1 files changed, 86 insertions, 0 deletions
diff --git a/libs/algorithm/test/copy_n_test1.cpp b/libs/algorithm/test/copy_n_test1.cpp
new file mode 100644
index 000000000..a61c1083f
--- /dev/null
+++ b/libs/algorithm/test/copy_n_test1.cpp
@@ -0,0 +1,86 @@
+/* 
+   Copyright (c) Marshall Clow 2011-2012.
+
+   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)
+
+    For more information, see http://www.boost.org
+*/
+
+#include <boost/config.hpp>
+#include <boost/algorithm/cxx11/copy_n.hpp>
+
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
+
+#include <string>
+#include <iostream>
+#include <vector>
+#include <list>
+
+namespace ba = boost::algorithm;
+// namespace ba = boost;
+
+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 );
+
+    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 + 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 );   
+    }
+
+
+BOOST_AUTO_TEST_CASE( test_main )
+{
+  test_sequence1 ();
+}