Release 1.37.0

[SVN r49549]

CMakeLists.txt

@@ -1,26 +0,0 @@
-#
-# Copyright Troy D. Straszheim
-#
-# Distributed under the Boost Software License, Version 1.0.
-# See http://www.boost.org/LICENSE_1_0.txt
-#
-#----------------------------------------------------------------------------
-# This file was automatically generated from the original CMakeLists.txt file
-# Add a variable to hold the headers for the library
-set (lib_headers
-    algorithm
-)
-
-# Add a library target to the build system
-boost_library_project(
-  algorithm
-  #  SRCDIRS 
-  TESTDIRS  minmax/test string/test
-  HEADERS ${lib_headers}
-  #  DOCDIRS 
-  DESCRIPTION  "A library of various algorithms."
-  MODULARIZED
-  AUTHORS  "Pavol Droba <droba -at- topmail.sk>"
-           "Herve Bronnimann <hbr -at- poly.edu>"
-  #  MAINTAINERS 
-)

include/boost/algorithm/string/detail/classification.hpp

@@ -171,7 +171,7 @@ namespace boost {
                         // Check what kind of storage are we using right now
                         if(use_fixed_storage(m_Size))
                         {
-                            // Using fixed storage, allocate new
+                            // Using fixed storage, allocate new		
                             set_value_type* pTemp=new set_value_type[Other.m_Size];
                             DestStorage=pTemp;
                             m_Storage.m_dynSet=pTemp;

minmax/index.html

@@ -56,7 +56,7 @@ be enough. The present library solves both problems.</p>
 <tt>minmax</tt>
 as straightforward extensions of the C++
 standard. As it returns a pair of <tt>const&amp;</tt>, we must use the <a
-href="../../tuple/index.html">Boost.tuple</a> library to construct such
+href=:../../../../tuple/index.html>Boost.tuple</a> library to construct such
 pairs. (Please note: the intent is not to fix the known defaults of
 <tt>std::min</tt>
 and <tt>std::max</tt>, but to add one more algorithms that combines both; see the
@@ -158,9 +158,9 @@ identical to
 that they return the last instance of the largest element (and not the
 first, as <tt>first_min_element</tt> and <tt>last_max_element</tt> would).
 <p>The family of algorithms comprising <tt>first_min_first_max_element</tt>,
-<tt>first_min_last_max_element</tt>,
+<tt>first_min_first_max_element</tt>,
-<tt>last_min_first_max_element</tt>,
+<tt>first_min_first_max_element</tt>,
-and <tt>last_min_last_max_element</tt> can be described generically as
+and <tt>first_min_first_max_element</tt> can be described generically as
 follows (using <i><tt>which</tt></i> and
 <i><tt>what</tt></i> for <tt>first</tt>
 or <tt>last</tt>): <tt><i>which</i>_min_<i>what</i>_max_element</tt> finds

minmax/test/CMakeLists.txt

@@ -1,10 +0,0 @@
-#
-# Copyright Troy D. Straszheim
-#
-# Distributed under the Boost Software License, Version 1.0.
-# See http://www.boost.org/LICENSE_1_0.txt
-#
-boost_additional_test_dependencies(algorithm BOOST_DEPENDS test)
-
-boost_test_run(minmax_element_test)
-boost_test_run(minmax_test)

minmax/test/minmax_test.cpp

@@ -54,23 +54,23 @@ void test(BOOST_EXPLICIT_TEMPLATE_TYPE(Value))
   less_count<Value> lc(counter);
 
   // Test functionality
-  tuple<Value const&, Value const&> result1 = boost::minmax(zero, one);
+  tuple<Value const&, Value const&> result1 = minmax(zero, one);
   BOOST_CHECK_EQUAL( get<0>(result1), zero );
   BOOST_CHECK_EQUAL( get<1>(result1), one );
 
-  tuple<Value const&, Value const&> result2 = boost::minmax(one, zero);
+  tuple<Value const&, Value const&> result2 = minmax(one, zero);
   BOOST_CHECK_EQUAL( get<0>(result2), zero );
   BOOST_CHECK_EQUAL( get<1>(result2), one );
   
   // Test functionality and number of comparisons
   lc.reset();
-  tuple<Value const&, Value const&> result3 = boost::minmax(zero, one, lc );
+  tuple<Value const&, Value const&> result3 = minmax(zero, one, lc );
   BOOST_CHECK_EQUAL( get<0>(result3), zero );
   BOOST_CHECK_EQUAL( get<1>(result3), one );
   BOOST_CHECK_EQUAL( counter, 1 );
 
   lc.reset();
-  tuple<Value const&, Value const&> result4 = boost::minmax(one, zero, lc );
+  tuple<Value const&, Value const&> result4 = minmax(one, zero, lc );
   BOOST_CHECK_EQUAL( get<0>(result4), zero );
   BOOST_CHECK_EQUAL( get<1>(result4), one );
   BOOST_CHECK_EQUAL( counter, 1);

module.cmake

@@ -1,4 +0,0 @@
-boost_module(algorithm DEPENDS regex concept_check range)
-
-
-

string/doc/Jamfile.v2

@@ -10,10 +10,7 @@
 import toolset ;
 toolset.using doxygen ;
 
-boostbook string_algo : string_algo.xml autodoc 
+boostbook string_algo : string_algo.xml autodoc ;
-	:
-        <format>pdf:<xsl:param>boost.url.prefix=http://www.boost.org/doc/libs/release/doc/html
-	;
 
 doxygen autodoc
     :   

string/doc/usage.xml

@@ -130,7 +130,7 @@
     string str1("command.com");
     cout 
         << str1
-        << (is_executable("command.com")? "is": "is not") 
+        << is_executable("command.com")? "is": "is not" 
         << "an executable" 
         << endl; // prints "command.com is an executable"
     
@@ -138,7 +138,7 @@
     char text1[]="hello world!";
     cout 
         << text1 
-        << (all( text1, is_lower() )? "is": "is not")
+        << all( text1, is_lower() )? "is": "is not"
         << " written in the lower case" 
         << endl; // prints "hello world! is written in the lower case"
         </programlisting>

string/test/CMakeLists.txt

@@ -1,18 +0,0 @@
-#
-# Copyright Troy D. Straszheim
-#
-# Distributed under the Boost Software License, Version 1.0.
-# See http://www.boost.org/LICENSE_1_0.txt
-#
-boost_additional_test_dependencies(algorithm BOOST_DEPENDS test)
-
-
-boost_test_run(trim_test)
-boost_test_run(conv_test)
-boost_test_run(predicate_test)
-boost_test_run(find_test)
-boost_test_run(split_test)
-boost_test_run(join_test)
-boost_test_run(replace_test)
-boost_test_run(regex_test DEPENDS boost_regex SHARED)
-