Create branches/filesystem-v3 for v2 removal

[SVN r77385]

doc/Jamfile.v2

@@ -16,6 +16,8 @@ using quickbook ;
 using doxygen ;
 using boostbook ;
 
+local BOOST_ROOT = [ os.environ BOOST_ROOT ] ;
+
 doxygen autodoc 
     : 
         [ glob ../../../boost/algorithm/*.hpp ../../../boost/algorithm/searching/*.hpp ]
@@ -27,12 +29,14 @@ doxygen autodoc
 
 xml algorithm : algorithm.qbk ;
 
+# path-constant boost-images : $(BOOST_ROOT)/doc/src/images ;
+
 boostbook standalone
   :
     algorithm
   :
     <dependency>autodoc 
-    <xsl:param>boost.root=../../../..
+    <xsl:param>boost.root=$(BOOST_ROOT)
     <xsl:param>"boost.doxygen.reftitle=Boost.Algorithms C++ Reference"
     <xsl:param>chapter.autolabel=0
     <xsl:param>chunk.section.depth=8

doc/boyer_moore.qbk

@@ -24,8 +24,6 @@ However, the Boyer-Moore algorithm cannot be used with comparison predicates lik
 
 Nomenclature: I refer to the sequence being searched for as the "pattern", and the sequence being searched in as the "corpus".
 
-[heading Interface]
-
 For flexibility, the Boyer-Moore algorithm has has two interfaces; an object-based interface and a procedural one. The object-based interface builds the tables in the constructor, and uses operator () to perform the search. The procedural interface builds the table and does the search all in one step. If you are going to be searching for the same pattern in multiple corpora, then you should use the object interface, and only build the tables once.
 
 Here is the object interface:
@@ -80,7 +78,7 @@ Both the object-oriented and procedural versions of the Boyer-Moore algorithm ta
 
 The Boyer-Moore object takes a traits template parameter which enables the caller to customize how one of the precomputed tables is stored. This table, called the skip table, contains (logically) one entry for every possible value that the pattern can contain. When searching 8-bit character data, this table contains 256 elements. The traits class defines the table to be used. 
 
-The default traits class uses a `boost::array` for small 'alphabets' and a `tr1::unordered_map` for larger ones.  The array-based skip table gives excellent performance, but could be prohibitively large when the 'alphabet' of elements to be searched grows. The unordered_map based version only grows as the number of unique elements in the pattern, but makes many more heap allocations, and gives slower lookup performance. 
+The default traits class uses a `boost::array` for small 'alphabets' and a `tr1::unordered_map` for larger ones.  The array-based skip table gives excellent performance, but could be prohibitively large when the "alphabet" of elements to be searched grows. The unordered_map based version only grows as the number of unique elements in the pattern, but makes many more heap allocations, and gives slower lookup performance. 
 
 To use a different skip table, you should define your own skip table object and your own traits class, and use them to instantiate the Boyer-Moore object. The interface to these objects is described TBD.
 

doc/boyer_moore_horspool.qbk

@@ -16,72 +16,6 @@ http://www.boost.org/LICENSE_1_0.txt)
 
 The header file 'boyer_moore_horspool.hpp' contains an an implementation of the Boyer-Moore-Horspool algorithm for searching sequences of values. 
 
-The Boyer-Moore-Horspool search algorithm was published by Nigel Horspool in 1980. It is a refinement of the Boyer-Moore algorithm that trades space for time. It uses less space for internal tables than Boyer-Moore, and has poorer worst-case performance.
-
-The Boyer-Moore-Horspool algorithm cannot be used with comparison predicates like `std::search`.
-
-[heading Interface]
-
-Nomenclature: I refer to the sequence being searched for as the "pattern", and the sequence being searched in as the "corpus".
-
-For flexibility, the Boyer-Moore-Horspool algorithm has has two interfaces; an object-based interface and a procedural one. The object-based interface builds the tables in the constructor, and uses operator () to perform the search. The procedural interface builds the table and does the search all in one step. If you are going to be searching for the same pattern in multiple corpora, then you should use the object interface, and only build the tables once.
-
-Here is the object interface:
-``
-template <typename patIter>
-class boyer_moore_horspool {
-public:
-    boyer_moore_horspool ( patIter first, patIter last );
-    ~boyer_moore_horspool ();
-    
-    template <typename corpusIter>
-    corpusIter operator () ( corpusIter corpus_first, corpusIter corpus_last );
-    };
-``
-
-and here is the corresponding procedural interface:
-
-``
-template <typename patIter, typename corpusIter>
-corpusIter boyer_moore_horspool_search ( 
-        corpusIter corpus_first, corpusIter corpus_last, 
-        patIter pat_first, patIter pat_last );
-``
-
-Each of the functions is passed two pairs of iterators. The first two define the corpus and the second two define the pattern. Note that the two pairs need not be of the same type, but they do need to "point" at the same type. In other words, `patIter::value_type` and `curpusIter::value_type` need to be the same type.
-
-The return value of the function is an iterator pointing to the start of the pattern in the corpus. If the pattern is not found, it returns the end of the corpus (`corpus_last`).
-
-[heading Performance]
-
-The execution time of the Boyer-Moore-Horspool algorithm is linear in the size of the string being searched; it can have a significantly lower constant factor than many other search algorithms: it doesn't need to check every character of the string to be searched, but rather skips over some of them. Generally the algorithm gets faster as the pattern being searched for becomes longer. Its efficiency derives from the fact that with each unsuccessful attempt to find a match between the search string and the text it is searching, it uses the information gained from that attempt to rule out as many positions of the text as possible where the string cannot match.
-
-[heading Memory Use]
-
-The algorithm an internal table that has one entry for each member of the "alphabet" in the pattern. For (8-bit) character types, this table contains 256 entries.
-
-[heading Complexity]
-
-The worst-case performance is ['O(m x n)], where ['m] is the length of the pattern and ['n] is the length of the corpus. The average time is ['O(n)]. The best case performance is sub-linear, and is, in fact, identical to Boyer-Moore, but the initialization is quicker and the internal loop is simpler than Boyer-Moore.
-
-[heading Exception Safety]
-
-Both the object-oriented and procedural versions of the Boyer-Moore-Horspool algorithm take their parameters by value and do not use any information other than what is passed in. Therefore, both interfaces provide the strong exception guarantee.
-
-[heading Notes]
-
-* When using the object-based interface, the pattern must remain unchanged for during the searches; i.e, from the time the object is constructed until the final call to operator () returns.
-
-* The Boyer-Moore-Horspool algorithm requires random-access iterators for both the pattern and the corpus.
-
-[heading Customization points] 
-
-The Boyer-Moore-Horspool object takes a traits template parameter which enables the caller to customize how the precomputed table is stored. This table, called the skip table, contains (logically) one entry for every possible value that the pattern can contain. When searching 8-bit character data, this table contains 256 elements. The traits class defines the table to be used. 
-
-The default traits class uses a `boost::array` for small 'alphabets' and a `tr1::unordered_map` for larger ones.  The array-based skip table gives excellent performance, but could be prohibitively large when the 'alphabet' of elements to be searched grows. The unordered_map based version only grows as the number of unique elements in the pattern, but makes many more heap allocations, and gives slower lookup performance. 
-
-To use a different skip table, you should define your own skip table object and your own traits class, and use them to instantiate the Boyer-Moore-Horspool object. The interface to these objects is described TBD.
-
 
 [endsect]
 

include/boost/algorithm/cxx11/all_of.hpp

@@ -12,7 +12,6 @@
 #ifndef BOOST_ALGORITHM_ALL_OF_HPP
 #define BOOST_ALGORITHM_ALL_OF_HPP
 
-#include <algorithm>    // for std::all_of, if available
 #include <boost/range/begin.hpp>
 #include <boost/range/end.hpp>
 

include/boost/algorithm/cxx11/any_of.hpp

@@ -14,7 +14,6 @@
 #ifndef BOOST_ALGORITHM_ANY_OF_HPP
 #define BOOST_ALGORITHM_ANY_OF_HPP
 
-#include <algorithm>    // for std::any_of, if available
 #include <boost/range/begin.hpp>
 #include <boost/range/end.hpp>
 

include/boost/algorithm/cxx11/copy_if.hpp

@@ -12,7 +12,7 @@
 #ifndef BOOST_ALGORITHM_COPY_IF_HPP
 #define BOOST_ALGORITHM_COPY_IF_HPP
 
-#include <algorithm>    // for std::copy_if, if available
+#include <algorithm>	// for std::copy_if, if available
 #include <boost/range/begin.hpp>
 #include <boost/range/end.hpp>
 

include/boost/algorithm/cxx11/iota.hpp

@@ -71,4 +71,4 @@ OutputIterator iota_n ( OutputIterator out, T value, std::size_t n )
 
 }}
 
-#endif  // BOOST_ALGORITHM_IOTA_HPP
+#endif  // BOOST_ALGORITHM_IOTA_HPP

include/boost/algorithm/cxx11/is_partitioned.hpp

@@ -12,7 +12,7 @@
 #ifndef BOOST_ALGORITHM_IS_PARTITIONED_HPP
 #define BOOST_ALGORITHM_IS_PARTITIONED_HPP
 
-#include <algorithm>    // for std::is_partitioned, if available
+#include <algorithm>	// for std::is_partitioned, if available
 
 #include <boost/range/begin.hpp>
 #include <boost/range/end.hpp>
@@ -35,14 +35,14 @@ using std::is_partitioned;      // Section 25.3.13
 template <typename InputIterator, typename UnaryPredicate>
 bool is_partitioned ( InputIterator first, InputIterator last, UnaryPredicate p )
 {
-//  Run through the part that satisfy the predicate
+//	Run through the part that satisfy the predicate
     for ( ; first != last; ++first )
         if ( !p (*first))
-            break;
-//  Now the part that does not satisfy the predicate
+        	break;
+//	Now the part that does not satisfy the predicate
     for ( ; first != last; ++first )
         if ( p (*first))
-            return false;
+        	return false;
     return true;
 }
 #endif
@@ -62,4 +62,4 @@ bool is_partitioned ( const Range &r, UnaryPredicate p )
 
 }}
 
-#endif  // BOOST_ALGORITHM_IS_PARTITIONED_HPP
+#endif  // BOOST_ALGORITHM_IS_PARTITIONED_HPP

include/boost/algorithm/cxx11/is_permutation.hpp

@@ -136,4 +136,4 @@ is_permutation ( const Range &r, ForwardIterator first2, BinaryPredicate pred )
 
 }}
 
-#endif  // BOOST_ALGORITHM_IS_PERMUTATION_HPP
+#endif  // BOOST_ALGORITHM_IS_PERMUTATION_HPP

include/boost/algorithm/cxx11/is_sorted.hpp

@@ -94,7 +94,7 @@ using std::is_sorted;       // Section 25.4.1.5
 #endif
 
 ///
-/// -- Range based versions of the C++11 functions
+///	-- Range based versions of the C++11 functions
 ///
 
 /// \fn is_sorted_until ( const R &range, Pred p )
@@ -126,7 +126,7 @@ using std::is_sorted;       // Section 25.4.1.5
     }
 
 namespace detail {
-    typedef struct { typedef bool type; } bool_;
+	typedef struct { typedef bool type; } bool_;
 };
 
 /// \fn is_sorted ( const R &range, Pred p )
@@ -157,7 +157,7 @@ namespace detail {
 
 
 ///
-/// -- Range based versions of the C++11 functions
+///	-- Range based versions of the C++11 functions
 ///
 
 /// \fn is_increasing ( ForwardIterator first, ForwardIterator last )

include/boost/algorithm/cxx11/none_of.hpp

@@ -12,7 +12,6 @@
 #ifndef BOOST_ALGORITHM_NONE_OF_HPP
 #define BOOST_ALGORITHM_NONE_OF_HPP
 
-#include <algorithm>    // for std::none_of, if available
 #include <boost/range/begin.hpp>
 #include <boost/range/end.hpp>
 

include/boost/algorithm/cxx11/partition_copy.hpp

@@ -12,7 +12,6 @@
 #ifndef BOOST_ALGORITHM_PARTITION_COPY_HPP
 #define BOOST_ALGORITHM_PARTITION_COPY_HPP
 
-#include <algorithm>    // for std::partition_copy, if available
 #include <utility>  // for make_pair
 
 #include <boost/range/begin.hpp>

include/boost/algorithm/cxx11/partition_point.hpp

@@ -12,7 +12,7 @@
 #ifndef BOOST_ALGORITHM_PARTITION_POINT_HPP
 #define BOOST_ALGORITHM_PARTITION_POINT_HPP
 
-#include <algorithm>    // for std::partition_point, if available
+#include <algorithm>	// for std::partition_point, if available
 
 #include <boost/range/begin.hpp>
 #include <boost/range/end.hpp>
@@ -20,12 +20,12 @@
 namespace boost { namespace algorithm {
 
 #if __cplusplus >= 201103L
-//  Use the C++11 versions of partition_point if it is available
+//  Use the C++11 versions of iota if it is available
 using std::partition_point;      // Section 25.3.13
 #else
 /// \fn partition_point ( ForwardIterator first, ForwardIterator last, Predicate p )
 /// \brief Given a partitioned range, returns the partition point, i.e, the first element 
-///     that does not satisfy p
+///		that does not satisfy p
 /// 
 /// \param first    The start of the input sequence
 /// \param last     One past the end of the input sequence
@@ -69,4 +69,4 @@ typename boost::range_iterator<Range> partition_point ( Range &r, Predicate p )
 
 }}
 
-#endif  // BOOST_ALGORITHM_PARTITION_POINT_HPP
+#endif  // BOOST_ALGORITHM_PARTITION_POINT_HPP

include/boost/algorithm/hex.hpp

@@ -45,7 +45,7 @@ namespace boost { namespace algorithm {
     
     \struct non_hex_input    
     \brief  Thrown when a non-hex value (0-9, A-F) encountered when decoding.
-                Contains the offending character
+    			Contains the offending character
     
     \struct not_enough_input 
     \brief  Thrown when the input sequence unexpectedly ends

include/boost/algorithm/searching/knuth_morris_pratt.hpp

@@ -32,7 +32,7 @@ namespace boost { namespace algorithm {
         * Random-access iterators
         * The two iterator types (I1 and I2) must "point to" the same underlying type.
 
-    http://en.wikipedia.org/wiki/Knuth-Morris-Pratt_algorithm
+    http://en.wikipedia.org/wiki/Knuth–Morris–Pratt_algorithm
     http://www.inf.fh-flensburg.de/lang/algorithmen/pattern/kmpen.htm
 */
 

index.html

@@ -1,13 +0,0 @@
-<html>
-<head>
-<meta http-equiv="refresh" content="0; URL=doc/html/index.html">
-</head>
-<body>
-Automatic redirection failed, please go to
-<a href="doc/html/index.html">doc/html/index.html</a> &nbsp;<hr>
-<p>© Copyright Marshall Clow, 2012</p>
-<p>Distributed under the Boost Software License, Version 1.0. (See accompanying 
-file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy 
-at <a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</p>
-</body>
-</html>

string/doc/usage.xml

@@ -135,12 +135,12 @@
         << endl; // prints "command.com is an executable"
     
     //..
-    char text1[]="hello";
+    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 is written in the lower case"
+        << endl; // prints "hello world! is written in the lower case"
         </programlisting>
         <para>
             The predicates determine whether if a substring is contained in the input string
@@ -149,11 +149,6 @@
             simply contains the substring or if both strings are equal. See the reference for 
             <headername>boost/algorithm/string/predicate.hpp</headername> for more details. 
         </para>
-        <para>  
-            Note that if we had used "hello world" as the input to the test, it would have
-            output "hello world is not written in the lower case" because the space in the
-            input string is not a lower case letter.
-        </para>
         <para>  
             In addition the algorithm <functionname>all()</functionname> checks
             all elements of a container to satisfy a condition specified by a predicate. 

test/copy_n_test1.cpp

@@ -22,60 +22,60 @@ namespace ba = boost::algorithm;
 template <typename Container>
 void test_sequence ( Container const &c ) {
 
-    typedef typename Container::value_type value_type;
-    std::vector<value_type> v;
-    
-//  Copy zero elements
-    v.clear ();
-    ba::copy_n ( c.begin (), 0, back_inserter ( v ));
-    BOOST_CHECK ( v.size () == 0 );
-    ba::copy_n ( c.begin (), 0U, back_inserter ( v ));
-    BOOST_CHECK ( v.size () == 0 );
+	typedef typename Container::value_type value_type;
+	std::vector<value_type> v;
+	
+//	Copy zero elements
+	v.clear ();
+	ba::copy_n ( c.begin (), 0, back_inserter ( v ));
+	BOOST_CHECK ( v.size () == 0 );
+	ba::copy_n ( c.begin (), 0U, back_inserter ( v ));
+	BOOST_CHECK ( v.size () == 0 );
 
-    if ( c.size () > 0 ) {  
-    //  Just one element
-        v.clear ();
-        ba::copy_n ( c.begin (), 1, back_inserter ( v ));
-        BOOST_CHECK ( v.size () == 1 );
-        BOOST_CHECK ( v[0] == *c.begin ());
-        
-        v.clear ();
-        ba::copy_n ( c.begin (), 1U, back_inserter ( v ));
-        BOOST_CHECK ( v.size () == 1 );
-        BOOST_CHECK ( v[0] == *c.begin ());
+	if ( c.size () > 0 ) {	
+	//	Just one element
+		v.clear ();
+		ba::copy_n ( c.begin (), 1, back_inserter ( v ));
+		BOOST_CHECK ( v.size () == 1 );
+		BOOST_CHECK ( v[0] == *c.begin ());
+		
+		v.clear ();
+		ba::copy_n ( c.begin (), 1U, back_inserter ( v ));
+		BOOST_CHECK ( v.size () == 1 );
+		BOOST_CHECK ( v[0] == *c.begin ());
 
-    //  Half the elements
-        v.clear ();
-        ba::copy_n ( c.begin (), c.size () / 2, back_inserter ( v ));
-        BOOST_CHECK ( v.size () == c.size () / 2);
-        BOOST_CHECK ( std::equal ( v.begin (), v.end (), c.begin ()));
+	//	Half the elements
+		v.clear ();
+		ba::copy_n ( c.begin (), c.size () / 2, back_inserter ( v ));
+		BOOST_CHECK ( v.size () == c.size () / 2);
+		BOOST_CHECK ( std::equal ( v.begin (), v.end (), c.begin ()));
 
-    //  Half the elements + 1
-        v.clear ();
-        ba::copy_n ( c.begin (), c.size () / 2 + 1, back_inserter ( v ));
-        BOOST_CHECK ( v.size () == c.size () / 2 + 1 );
-        BOOST_CHECK ( std::equal ( v.begin (), v.end (), c.begin ()));
-    
-    //  All the elements
-        v.clear ();
-        ba::copy_n ( c.begin (), c.size (), back_inserter ( v ));
-        BOOST_CHECK ( v.size () == c.size ());
-        BOOST_CHECK ( std::equal ( v.begin (), v.end (), c.begin ()));
-        }
-    }
+	//	Half the elements + 1
+		v.clear ();
+		ba::copy_n ( c.begin (), c.size () / 2 + 1, back_inserter ( v ));
+		BOOST_CHECK ( v.size () == c.size () / 2 + 1 );
+		BOOST_CHECK ( std::equal ( v.begin (), v.end (), c.begin ()));
+	
+	//	All the elements
+		v.clear ();
+		ba::copy_n ( c.begin (), c.size (), back_inserter ( v ));
+		BOOST_CHECK ( v.size () == c.size ());
+		BOOST_CHECK ( std::equal ( v.begin (), v.end (), c.begin ()));
+		}
+	}
 
 
 void test_sequence1 () {
-    std::vector<int> v;
-    for ( int i = 5; i < 15; ++i )
-        v.push_back ( i );
-    test_sequence  ( v );
-    
-    std::list<int> l;
-    for ( int i = 25; i > 15; --i )
-        l.push_back ( i );
-    test_sequence  ( l );   
-    }
+	std::vector<int> v;
+	for ( int i = 5; i < 15; ++i )
+		v.push_back ( i );
+	test_sequence  ( v );
+	
+	std::list<int> l;
+	for ( int i = 25; i > 15; --i )
+		l.push_back ( i );
+	test_sequence  ( l );	
+	}
 
 
 int test_main( int , char* [] )

test/find_if_not_test1.cpp

@@ -22,18 +22,18 @@ namespace ba = boost::algorithm;
 
 template <typename Container>
 typename Container::iterator offset_to_iter ( Container &v, int offset ) {
-    typename Container::iterator retval;
-    
-    if ( offset >= 0 ) {
-        retval = v.begin ();
-        std::advance ( retval, offset );
-        }
-    else {
-        retval = v.end ();
-        std::advance ( retval, offset + 1 );
-        }
-    return retval;
-    }
+	typename Container::iterator retval;
+	
+	if ( offset >= 0 ) {
+		retval = v.begin ();
+		std::advance ( retval, offset );
+		}
+	else {
+		retval = v.end ();
+		std::advance ( retval, offset + 1 );
+		}
+	return retval;
+	}
 
 template <typename Container, typename Predicate>
 void test_sequence ( Container &v, Predicate comp, int expected ) {
@@ -71,7 +71,7 @@ void test_sequence1 () {
     test_sequence ( v, less_than<int>(10), 5 );
     test_sequence ( v, less_than<int>(99), -1 );   // all elements satisfy 
 
-//  With bidirectional iterators.
+//	With bidirectional iterators.
     std::list<int> l;
     for ( int i = 5; i < 15; ++i )
         l.push_back ( i );

test/hex_fail1.cpp

@@ -15,7 +15,7 @@
 #include <iostream>
 #include <vector>
 
-//  should not compile: vector is not an integral type
+//	should not compile: vector is not an integral type
 int test_main( int , char* [] )
 {
   std::vector<float> v;

test/hex_test3.cpp

@@ -21,12 +21,12 @@ Try ostream_iterators
 
 template <typename char_type>
 void test_to_hex ( const char_type ** tests ) {
-    typedef std::basic_string<char_type> String;
-    typedef std::basic_ostringstream<char_type> Stream;
-    typedef std::ostream_iterator<char_type, char_type> Iter;
+	typedef std::basic_string<char_type> String;
+	typedef std::basic_ostringstream<char_type> Stream;
+	typedef std::ostream_iterator<char_type, char_type> Iter;
 
     for ( const char_type **p = tests; *p; p++ ) {
-        String arg, argh;
+    	String arg, argh;
         Stream one, two, three;
         arg.assign ( *p );
         boost::algorithm::hex ( *p, Iter ( one ));
@@ -49,12 +49,12 @@ void test_to_hex ( const char_type ** tests ) {
 
 template <typename char_type>
 void test_from_hex_success ( const char_type ** tests ) {
-    typedef std::basic_string<char_type> String;
-    typedef std::basic_ostringstream<char_type> Stream;
-    typedef std::ostream_iterator<char_type, char_type> Iter;
+	typedef std::basic_string<char_type> String;
+	typedef std::basic_ostringstream<char_type> Stream;
+	typedef std::ostream_iterator<char_type, char_type> Iter;
 
     for ( const char_type **p = tests; *p; p++ ) {
-        String arg, argh;
+    	String arg, argh;
         Stream one, two, three;
         arg.assign ( *p );
         boost::algorithm::unhex ( *p,                       Iter ( one ));

test/iota_test1.cpp

@@ -16,60 +16,60 @@
 #include <vector>
 #include <list>
 
-//  Test to make sure a sequence is "correctly formed"; i.e, ascending by one
+//	Test to make sure a sequence is "correctly formed"; i.e, ascending by one
 template <typename Iterator, typename T>
 bool test_iota_results ( Iterator first, Iterator last, T initial_value ) {
-    if ( first == last ) return true;
-    if ( initial_value != *first ) return false;
-    Iterator prev = first;
-    while ( ++first != last ) {
-        if (( *first - *prev ) != 1 )
-            return false;
-        prev = first;
-        }
-    return true;
-    }
+	if ( first == last ) return true;
+	if ( initial_value != *first ) return false;
+	Iterator prev = first;
+	while ( ++first != last ) {
+		if (( *first - *prev ) != 1	)
+			return false;
+		prev = first;
+		}
+	return true;
+	}
 
 template <typename Range, typename T>
 bool test_iota_results ( const Range &r, T initial_value ) {
-    return test_iota_results (boost::begin (r), boost::end (r), initial_value );
+	return test_iota_results (boost::begin (r), boost::end (r), initial_value );
 }
 
 
 void test_ints () {
-    std::vector<int> v;
-    std::list<int> l;
+	std::vector<int> v;
+	std::list<int> l;
 
-    v.clear (); v.reserve ( 10 );
-    boost::algorithm::iota ( v.begin (), v.end (), 23 );
-    BOOST_CHECK ( test_iota_results ( v.begin (), v.end (), 23 ));
-    
-    v.clear (); v.reserve ( 19 );
-    boost::algorithm::iota ( v, 18 );
-    BOOST_CHECK ( test_iota_results ( v, 18 ));
-    
-    v.clear ();
-    boost::algorithm::iota_n ( std::back_inserter(v), 99, 20 );
-    BOOST_CHECK ( test_iota_results ( v, 99 ));
-    
+	v.clear ();	v.reserve ( 10 );
+	boost::algorithm::iota ( v.begin (), v.end (), 23 );
+	BOOST_CHECK ( test_iota_results ( v.begin (), v.end (), 23 ));
+	
+	v.clear ();	v.reserve ( 19 );
+	boost::algorithm::iota ( v, 18 );
+	BOOST_CHECK ( test_iota_results ( v, 18 ));
+	
+	v.clear ();
+	boost::algorithm::iota_n ( std::back_inserter(v), 99, 20 );
+	BOOST_CHECK ( test_iota_results ( v, 99 ));
+	
 /*
-    l.clear (); l.reserve ( 5 );
-    boost::algorithm::iota ( l.begin (), l.end (), 123 );
-    BOOST_CHECK ( test_iota_results ( l.begin (), l.end (), 123 ));
-    
-    l.clear (); l.reserve ( 9 );
-    boost::algorithm::iota ( l.begin (), l.end (), 87 );
-    BOOST_CHECK ( test_iota_results ( l.begin (), l.end (), 87 ));
+	l.clear (); l.reserve ( 5 );
+	boost::algorithm::iota ( l.begin (), l.end (), 123 );
+	BOOST_CHECK ( test_iota_results ( l.begin (), l.end (), 123 ));
+	
+	l.clear (); l.reserve ( 9 );
+	boost::algorithm::iota ( l.begin (), l.end (), 87 );
+	BOOST_CHECK ( test_iota_results ( l.begin (), l.end (), 87 ));
 */
 
-    l.clear ();
-    boost::algorithm::iota_n ( std::back_inserter(l), 99, 20 );
-    BOOST_CHECK ( test_iota_results ( l, 99 ));
-    
-    l.clear ();
-    boost::algorithm::iota_n ( std::front_inserter(l), 123, 20 );
-    BOOST_CHECK ( test_iota_results ( l.rbegin (), l.rend (), 123 ));
-    }
+	l.clear ();
+	boost::algorithm::iota_n ( std::back_inserter(l), 99, 20 );
+	BOOST_CHECK ( test_iota_results ( l, 99 ));
+	
+	l.clear ();
+	boost::algorithm::iota_n ( std::front_inserter(l), 123, 20 );
+	BOOST_CHECK ( test_iota_results ( l.rbegin (), l.rend (), 123 ));
+	}
 
 
 int test_main( int , char* [] )

test/is_partitioned_test1.cpp

@@ -40,19 +40,19 @@ void test_sequence1 () {
     v.clear ();
     for ( int i = 5; i < 15; ++i )
         v.push_back ( i );
-    BOOST_CHECK ( ba::is_partitioned ( v, less_than<int>(3)));      // no elements
-    BOOST_CHECK ( ba::is_partitioned ( v, less_than<int>(6)));      // only the first element
-    BOOST_CHECK ( ba::is_partitioned ( v, less_than<int>(10))); // in the middle somewhere
-    BOOST_CHECK ( ba::is_partitioned ( v, less_than<int>(99))); // all elements satisfy 
+    BOOST_CHECK ( ba::is_partitioned ( v, less_than<int>(3)));		// no elements
+    BOOST_CHECK ( ba::is_partitioned ( v, less_than<int>(6)));		// only the first element
+    BOOST_CHECK ( ba::is_partitioned ( v, less_than<int>(10)));	// in the middle somewhere
+    BOOST_CHECK ( ba::is_partitioned ( v, less_than<int>(99)));	// all elements satisfy 
 
-//  With bidirectional iterators.
+//	With bidirectional iterators.
     std::list<int> l;
     for ( int i = 5; i < 15; ++i )
         l.push_back ( i );
-    BOOST_CHECK ( ba::is_partitioned ( l.begin (), l.end (), less_than<int>(3)));       // no elements
-    BOOST_CHECK ( ba::is_partitioned ( l.begin (), l.end (), less_than<int>(6)));       // only the first element
-    BOOST_CHECK ( ba::is_partitioned ( l.begin (), l.end (), less_than<int>(10)));  // in the middle somewhere
-    BOOST_CHECK ( ba::is_partitioned ( l.begin (), l.end (), less_than<int>(99)));      // all elements satisfy 
+    BOOST_CHECK ( ba::is_partitioned ( l.begin (), l.end (), less_than<int>(3)));		// no elements
+    BOOST_CHECK ( ba::is_partitioned ( l.begin (), l.end (), less_than<int>(6)));		// only the first element
+    BOOST_CHECK ( ba::is_partitioned ( l.begin (), l.end (), less_than<int>(10)));	// in the middle somewhere
+    BOOST_CHECK ( ba::is_partitioned ( l.begin (), l.end (), less_than<int>(99)));		// all elements satisfy 
     }
 
 

test/ordered_test.cpp

@@ -36,24 +36,24 @@ test_ordered(void)
           int nonConstantArray[] = { 1, 2, 2, 2, 5 };
     const int inOrderUntilTheEnd [] = { 0, 1, 2, 3, 4, 5, 6, 7, 6 };
 
-//  Begin/end checks
-    BOOST_CHECK (  ba::is_sorted (b_e(strictlyIncreasingValues)));
-    BOOST_CHECK ( !ba::is_sorted (b_e(randomValues)));
-    BOOST_CHECK (  ba::is_sorted (b_e(strictlyIncreasingValues), std::less<int>()));
-    BOOST_CHECK ( !ba::is_sorted (b_e(strictlyIncreasingValues), std::greater<int>()));
+//	Begin/end checks
+	BOOST_CHECK (  ba::is_sorted (b_e(strictlyIncreasingValues)));
+	BOOST_CHECK ( !ba::is_sorted (b_e(randomValues)));
+	BOOST_CHECK (  ba::is_sorted (b_e(strictlyIncreasingValues), std::less<int>()));
+	BOOST_CHECK ( !ba::is_sorted (b_e(strictlyIncreasingValues), std::greater<int>()));
 
-//  Range checks
-    BOOST_CHECK (  ba::is_sorted (a_range(strictlyIncreasingValues)));
-    BOOST_CHECK ( !ba::is_sorted (a_range(randomValues)));
-    BOOST_CHECK (  ba::is_sorted (a_range(strictlyIncreasingValues), std::less<int>()));
-    BOOST_CHECK ( !ba::is_sorted (a_range(strictlyIncreasingValues), std::greater<int>()));
+//	Range checks
+	BOOST_CHECK (  ba::is_sorted (a_range(strictlyIncreasingValues)));
+	BOOST_CHECK ( !ba::is_sorted (a_range(randomValues)));
+	BOOST_CHECK (  ba::is_sorted (a_range(strictlyIncreasingValues), std::less<int>()));
+	BOOST_CHECK ( !ba::is_sorted (a_range(strictlyIncreasingValues), std::greater<int>()));
 
     BOOST_CHECK (  ba::is_sorted_until ( b_e(strictlyIncreasingValues))                       ==      a_end(strictlyIncreasingValues));
     BOOST_CHECK (  ba::is_sorted_until ( b_e(strictlyIncreasingValues),     std::less<int>()) ==      a_end(strictlyIncreasingValues));
     BOOST_CHECK (  ba::is_sorted_until ( a_range(strictlyIncreasingValues))                   == boost::end(strictlyIncreasingValues));
     BOOST_CHECK (  ba::is_sorted_until ( a_range(strictlyIncreasingValues), std::less<int>()) == boost::end(strictlyIncreasingValues));
 
-//  Check for const and non-const arrays
+//	Check for const and non-const arrays
     BOOST_CHECK ( ba::is_sorted_until ( b_e(constantValues),       std::less<int>()) !=      a_end(constantValues));
     BOOST_CHECK ( ba::is_sorted_until ( a_range(constantValues),   std::less<int>()) != boost::end(constantValues));
     BOOST_CHECK ( ba::is_sorted_until ( b_e(nonConstantArray),     std::less<int>()) !=      a_end(nonConstantArray));
@@ -149,6 +149,6 @@ test_increasing_decreasing(void)
 int test_main( int, char * [] )
 {
     test_ordered ();
-    test_increasing_decreasing ();
+	test_increasing_decreasing ();
     return 0;
 }

test/partition_point_test1.cpp

@@ -22,18 +22,18 @@ namespace ba = boost::algorithm;
 
 template <typename Container>
 typename Container::iterator offset_to_iter ( Container &v, int offset ) {
-    typename Container::iterator retval;
-    
-    if ( offset >= 0 ) {
-        retval = v.begin ();
-        std::advance ( retval, offset );
-        }
-    else {
-        retval = v.end ();
-        std::advance ( retval, offset + 1 );
-        }
-    return retval;
-    }
+	typename Container::iterator retval;
+	
+	if ( offset >= 0 ) {
+		retval = v.begin ();
+		std::advance ( retval, offset );
+		}
+	else {
+		retval = v.end ();
+		std::advance ( retval, offset + 1 );
+		}
+	return retval;
+	}
 
 template <typename Container, typename Predicate>
 void test_sequence ( Container &v, Predicate comp, int expected ) {
@@ -79,7 +79,7 @@ void test_sequence1 () {
     test_sequence ( v, less_than<int>(10), 5 );
     test_sequence ( v, less_than<int>(99), -1 );   // all elements satisfy 
 
-//  With bidirectional iterators.
+//	With bidirectional iterators.
     std::list<int> l;
     for ( int i = 5; i < 15; ++i )
         l.push_back ( i );