Release 1.45.0

[SVN r66646]

include/boost/algorithm/string/find_iterator.hpp

@@ -258,13 +258,9 @@ namespace boost {
                 m_Next(Begin),
                 m_End(End),
                 m_bEof(false)
-            {
-                // force the correct behavior for empty sequences and yield at least one token
-                if(Begin!=End)
             {
                 increment();
             }
-            }
             //! Constructor
             /*!
                 Construct new split_iterator for a given finder
@@ -282,12 +278,8 @@ namespace boost {
                 m_Next=::boost::begin(lit_col);
                 m_End=::boost::end(lit_col);
 
-                // force the correct behavior for empty sequences and yield at least one token
-                if(m_Next!=m_End)
-                {
                 increment();
             }
-            }
 
 
         private:

string/test/split_test.cpp

@@ -40,7 +40,6 @@ void iterator_test()
     string str1("xx-abc--xx-abb");
     string str2("Xx-abc--xX-abb-xx");
     string str3("xx");
-    string strempty("");
     const char* pch1="xx-abc--xx-abb";
     vector<string> tokens;
     vector< vector<int> > vtokens;
@@ -124,25 +123,6 @@ void iterator_test()
     BOOST_CHECK( tokens[3]==string("xx") );
     BOOST_CHECK( tokens[4]==string("abb") );
 
-    split(
-        tokens,
-        str3,
-        is_any_of(","),
-        token_compress_off);
-
-    BOOST_REQUIRE( tokens.size()==1 );
-    BOOST_CHECK( tokens[0]==string("xx") );
-
-    split(
-        tokens,
-        strempty,
-        is_punct(),
-        token_compress_off);
-
-    BOOST_REQUIRE( tokens.size()==1 );
-    BOOST_CHECK( tokens[0]==string("") );
-
-
     find_iterator<string::iterator> fiter=make_find_iterator(str1, first_finder("xx"));
     BOOST_CHECK(equals(*fiter, "xx"));
     ++fiter;