1.37.0 Beta 1

[SVN r49441]
Memory management fixes for is_any_of predicate merged from the trunk
2025-06-25 20:11:50 +02:00 · 2008-10-23 11:39:59 +00:00 · 2008-10-07 21:59:57 +00:00 · 2008-06-19 12:07:24 +00:00 · 2008-02-27 20:00:24 +00:00 · 2008-02-10 16:39:38 +00:00
8 changed files with 10 additions and 53 deletions
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@ -1,20 +0,0 @@
-#----------------------------------------------------------------------------
-# 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 
-)
--- a/include/boost/algorithm/string/detail/classification.hpp
+++ b/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;
--- a/minmax/index.html
+++ b/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>last_min_first_max_element</tt>,
-and <tt>last_min_last_max_element</tt> can be described generically as
+<tt>first_min_first_max_element</tt>,
+<tt>first_min_first_max_element</tt>,
+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
--- a/minmax/test/CMakeLists.txt
+++ b/minmax/test/CMakeLists.txt
@ -1,4 +0,0 @@
-boost_additional_test_dependencies(algorithm BOOST_DEPENDS test)
-
-boost_test_run(minmax_element_test)
-boost_test_run(minmax_test)
--- a/minmax/test/minmax_test.cpp
+++ b/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);
--- a/module.cmake
+++ b/module.cmake
@ -1,4 +0,0 @@
-boost_module(algorithm DEPENDS regex concept_check range)
-
-
-
--- a/string/doc/Jamfile.v2
+++ b/string/doc/Jamfile.v2
@ -10,10 +10,7 @@
 import toolset ;
 toolset.using doxygen ;

-boostbook string_algo : string_algo.xml autodoc 
-	:
-        <format>pdf:<xsl:param>boost.url.prefix=http://www.boost.org/doc/libs/release/doc/html
-	;
+boostbook string_algo : string_algo.xml autodoc ;

 doxygen autodoc
    :   
--- a/string/test/CMakeLists.txt
+++ b/string/test/CMakeLists.txt
@ -1,12 +0,0 @@
-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)
-
Author	SHA1	Message	Date
Beman Dawes	fbb6522abb	1.37.0 Beta 1 [SVN r49441]	2008-10-23 11:39:59 +00:00
Pavol Droba	98a8b08afb	Memory management fixes for is_any_of predicate merged from the trunk [SVN r49172]	2008-10-07 21:59:57 +00:00
Pavol Droba	fc0f3dcffc	Cummulative merge of updates from the main trunk [SVN r46505]	2008-06-19 12:07:24 +00:00
Daniel James	822636418b	Merged revisions 43211,43214-43219,43222-43225,43227-43238,43242,43244-43245,43249-43250,43257-43259,43261,43263,43265,43267-43268,43270-43271,43273,43275-43279,43284-43289,43291,43295,43297-43298,43304-43305,43307,43313,43315,43324,43326-43327,43331,43333,43339-43343,43345,43348,43350,43352-43353,43355-43356,43358,43360,43366-43367,43369-43370,43372-43376,43378-43389,43394,43396-43398,43400-43401,43403-43404,43406-43408,43413-43415,43417-43418,43420,43422-43423 via svnmerge from https://svn.boost.org/svn/boost/trunk ........ r43417 \| danieljames \| 2008-02-26 22:04:55 +0000 (Tue, 26 Feb 2008) \| 2 lines Fix a link to Boost.Bimap. ........ r43418 \| danieljames \| 2008-02-26 22:07:25 +0000 (Tue, 26 Feb 2008) \| 2 lines Change another link that's no longer in the repository to link to the website. ........ r43422 \| danieljames \| 2008-02-27 18:51:14 +0000 (Wed, 27 Feb 2008) \| 1 line Fix broken copyright urls. Fixes #1573. ........ r43423 \| danieljames \| 2008-02-27 19:22:01 +0000 (Wed, 27 Feb 2008) \| 1 line Fix incorrect links to copyright of the form 'http:#www.boost.org ........ [SVN r43425]	2008-02-27 20:00:24 +00:00
Daniel James	352e16aade	Merged revisions 43206,43208-43213 via svnmerge from https://svn.boost.org/svn/boost/trunk ........ r43206 \| danieljames \| 2008-02-10 09:55:03 +0000 (Sun, 10 Feb 2008) \| 1 line Fix some broken links. ........ r43209 \| danieljames \| 2008-02-10 14:56:22 +0000 (Sun, 10 Feb 2008) \| 1 line Link to people pages on the website, as they've been removed from the download. ........ r43210 \| danieljames \| 2008-02-10 15:02:17 +0000 (Sun, 10 Feb 2008) \| 1 line Point links to the pages that used to be in 'more' to the site. ........ r43212 \| danieljames \| 2008-02-10 16:10:16 +0000 (Sun, 10 Feb 2008) \| 1 line Fix links on the home page as well. ........ r43213 \| danieljames \| 2008-02-10 16:21:22 +0000 (Sun, 10 Feb 2008) \| 1 line Generated documentation which is no longer generated. ........ [SVN r43214]	2008-02-10 16:39:38 +00:00
Beman Dawes	89c76ea1bb	Full merge from trunk at revision 41356 of entire boost-root tree. [SVN r41370]	2007-11-25 18:38:02 +00:00
Beman Dawes	50b5726a6f	Full merge from trunk at revision 41356 of entire boost-root tree. [SVN r41369]	2007-11-25 18:07:19 +00:00
Beman Dawes	d4b95734dd	Starting point for releases [SVN r39706]	2007-10-05 14:25:06 +00:00
nobody	05af96f84c	This commit was manufactured by cvs2svn to create tag 'Version_1_34_1'. [SVN r38286]	2007-07-24 19:28:14 +00:00
Pavol Droba	5bdbb2b308	Documentation for iter_find/iter_split added [SVN r37842]	2007-06-01 13:50:51 +00:00
Pavol Droba	1a02969303	release notes - fix the incorrect functionname spelling [SVN r37533]	2007-04-29 07:04:58 +00:00
Pavol Droba	6309379618	release notes for 1.34 added [SVN r37532]	2007-04-29 07:02:21 +00:00
Pavol Droba	37581bac55	documentation typo fixed [SVN r36843]	2007-01-30 07:59:28 +00:00
Beman Dawes	a71a4ed5b1	Merged copyright and license addition [SVN r35907]	2006-11-07 19:27:00 +00:00
Rene Rivera	c509c3fbad	Remove obsolete Boost.Build v1 files. [SVN r35880]	2006-11-06 17:10:46 +00:00
Pavol Droba	d8683f2498	unused parameters removed [SVN r35753]	2006-10-27 17:37:37 +00:00
Pavol Droba	7c0101aa51	Copyright added to index.html unneeded file removed [SVN r34908]	2006-08-20 20:14:48 +00:00
Pavol Droba	6f3e85528f	License added to the xml documentation files [SVN r34894]	2006-08-16 07:10:48 +00:00
Pavol Droba	8af639b7cf	missing 'using' directives for join_if and join_if_regex added missing #include <boost/algorithm/string/join.hpp> added to string_algo.hpp [SVN r34122]	2006-05-30 19:13:08 +00:00
Pavol Droba	d9bc7e800b	Merged patch from main trunk for borland by Nicola Musatti [SVN r33723]	2006-04-17 17:16:11 +00:00
nobody	b4ed9beb90	This commit was manufactured by cvs2svn to create branch 'RC_1_34_0'. [SVN r33417]	2006-03-21 02:26:31 +00:00
				`@ -1,4 +0,0 @@`
				`boost_module(algorithm DEPENDS regex concept_check range)`