Update of /cvsroot/boost/boost/boost/math/complex
In directory sc8-pr-cvs3.sourceforge.net:/tmp/cvs-serv4649
Modified Files:
Tag: RC_1_34_0
acos.hpp
Log Message:
(merge from head)
fixed license reference text; slight changes to comments to avoid spurious
inspect tool warnings
Index: acos.hpp
===================================================================
RCS file: /cvsroot/boost/boost/boost/math/complex/acos.hpp,v
retrieving revision 1.4
retrieving revision 1.4.2.1
diff -u -d -r1.4 -r1.4.2.1
--- acos.hpp 16 Dec 2005 14:10:05 -0000 1.4
+++ acos.hpp 24 Jul 2006 21:33:20 -0000 1.4.2.1
@@ -1,7 +1,6 @@
// (C) Copyright John Maddock 2005.
-// Use, modification and distribution are subject to the
-// Boost Software License, Version 1.0. (See accompanying file
-// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+// Distributed under the Boost Software License, Version 1.0. (See
accompanying
+// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#ifndef BOOST_MATH_COMPLEX_ACOS_INCLUDED
#define BOOST_MATH_COMPLEX_ACOS_INCLUDED
@@ -104,7 +103,7 @@
// Figure out if our input is within the "safe area" identified by Hull
et al.
// This would be more efficient with portable floating point exception
handling;
// fortunately the quantities M and u identified by Hull et al (figure
3),
- // match with the max() and min() methods of numeric_limits<T>.
+ // match with the max and min methods of numeric_limits<T>.
//
T safe_max = detail::safe_max(static_cast<T>(8));
T safe_min = detail::safe_min(static_cast<T>(4));
@@ -189,8 +188,8 @@
//
// E^2 > 8*sqrt(u); with:
//
- // E = std::numeric_limits<T>::epsilon()
- // u = std::numeric_limits<T>::min()
+ // E = std::numeric_limits<T>::epsilon()
+ // u = (std::numeric_limits<T>::min)()
//
// Hull et al provide alternative code for "bad" machines
// but we have no way to test that here, so for now just assert
-------------------------------------------------------------------------
Take Surveys. Earn Cash. Influence the Future of IT
Join SourceForge.net's Techsay panel and you'll get the chance to share your
opinions on IT & business topics through brief surveys -- and earn cash
http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV
_______________________________________________
Boost-cvs mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/boost-cvs
