///////////////////////////////////////////////////////////////////////////// // // (C) Copyright Olaf Krzikalla 2004-2006. // (C) Copyright Ion Gaztaņaga 2006-2007. // // 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) // // See http://www.boost.org/libs/intrusive for documentation. // ///////////////////////////////////////////////////////////////////////////// #include #include #include "itestvalue.hpp" #include "smart_ptr.hpp" #include "common_functors.hpp" #include // Boost.Test #include "boost/test/included/test_exec_monitor.hpp" using namespace boost::intrusive; template struct test_set { typedef typename ValueTraits::value_type value_type; static void test_all(std::vector& values); static void test_sort(std::vector& values); static void test_insert(std::vector& values); static void test_swap(std::vector& values); static void test_find(std::vector& values); static void test_impl(); static void test_clone(std::vector& values); }; template void test_set::test_all(std::vector& values) { test_sort(values); test_insert(values); test_swap(values); test_find(values); test_impl(); test_clone(values); } //test case due to an error in tree implementation: template void test_set::test_impl() { typedef typename ValueTraits::value_type testvalue_t; std::vector values (5); for (int i = 0; i < 5; ++i) values[i].value_ = i; typedef boost::intrusive::set ,ValueTraits::value_type::constant_time_size, std::size_t > set_type; set_type testset; for (int i = 0; i < 5; ++i) testset.insert (values[i]); testset.erase (testset.iterator_to (values[0])); testset.erase (testset.iterator_to (values[1])); testset.insert (values[1]); testset.erase (testset.iterator_to (values[2])); testset.erase (testset.iterator_to (values[3])); } //test: constructor, iterator, clear, reverse_iterator, front, back, size: template void test_set::test_sort(std::vector& values) { typedef typename ValueTraits::value_type testvalue_t; boost::test_tools::output_test_stream test_seq; typedef boost::intrusive::set ,ValueTraits::value_type::constant_time_size, std::size_t > set_type; set_type testset1 (values.begin(), values.end()); std::copy (testset1.begin(), testset1.end(), std::ostream_iterator (test_seq)); BOOST_CHECK (test_seq.is_equal ("12345")); testset1.clear(); BOOST_CHECK (testset1.empty()); typedef boost::intrusive::set set_type2; set_type2 testset2 (&values[0], &values[0] + 6); std::copy (testset2.rbegin(), testset2.rend(), std::ostream_iterator (test_seq)); BOOST_CHECK (test_seq.is_equal ("53142")); BOOST_CHECK (testset2.begin()->value_ == 2); BOOST_CHECK (testset2.rbegin()->value_ == 5); } //test: insert, const_iterator, const_reverse_iterator, erase, iterator_to: template void test_set::test_insert(std::vector& values) { typedef typename ValueTraits::value_type testvalue_t; boost::test_tools::output_test_stream test_seq; typedef boost::intrusive::set ,ValueTraits::value_type::constant_time_size, std::size_t > set_type; set_type testset; testset.insert(&values[0] + 2, &values[0] + 5); const set_type& const_testset = testset; std::copy (const_testset.begin(), const_testset.end(), std::ostream_iterator (test_seq)); BOOST_CHECK (test_seq.is_equal ("145")); BOOST_DEDUCED_TYPENAME set_type::iterator i = testset.begin(); BOOST_CHECK (i->value_ == 1); i = testset.insert (i, values[0]); BOOST_CHECK (&*i == &values[0]); std::copy (const_testset.rbegin(), const_testset.rend(), std::ostream_iterator (test_seq)); BOOST_CHECK (test_seq.is_equal ("5431")); i = testset.iterator_to (values[2]); BOOST_CHECK (&*i == &values[2]); testset.erase (i); //test post-increment: for (BOOST_DEDUCED_TYPENAME set_type::const_iterator i = const_testset.begin(), e = const_testset.end(); i != e; i++) test_seq << *i; BOOST_CHECK (test_seq.is_equal ("135")); } //test: insert (seq-version), swap, erase (seq-version), size: template void test_set::test_swap(std::vector& values) { typedef typename ValueTraits::value_type testvalue_t; boost::test_tools::output_test_stream test_seq; typedef boost::intrusive::set ,ValueTraits::value_type::constant_time_size, std::size_t > set_type; set_type testset1 (&values[0], &values[0] + 2); set_type testset2; testset2.insert (&values[0] + 2, &values[0] + 6); testset1.swap (testset2); std::copy (testset1.begin(), testset1.end(), std::ostream_iterator (test_seq)); BOOST_CHECK (test_seq.is_equal ("1245")); //test post-increment: for (BOOST_DEDUCED_TYPENAME set_type::iterator i = testset2.begin(), e = testset2.end(); i != e; i++) test_seq << *i; BOOST_CHECK (test_seq.is_equal ("23")); testset1.erase (testset1.iterator_to(values[5]), testset1.end()); BOOST_CHECK (testset1.size() == 1); // BOOST_CHECK (&testset1.front() == &values[3]); BOOST_CHECK (&*testset1.begin() == &values[3]); } //test: find, equal_range (lower_bound, upper_bound): template void test_set::test_find(std::vector& values) { typedef typename ValueTraits::value_type testvalue_t; boost::test_tools::output_test_stream test_seq; typedef boost::intrusive::set ,ValueTraits::value_type::constant_time_size, std::size_t > set_type; set_type testset (values.begin(), values.end()); typedef BOOST_DEDUCED_TYPENAME set_type::iterator iterator; testvalue_t cmp_val; cmp_val.value_ = 2; iterator i = testset.find (cmp_val); BOOST_CHECK (i->value_ == 2); BOOST_CHECK ((++i)->value_ != 2); std::pair range = testset.equal_range (cmp_val); BOOST_CHECK (range.first->value_ == 2); BOOST_CHECK (range.second->value_ == 3); BOOST_CHECK (std::distance (range.first, range.second) == 1); cmp_val.value_ = 7; BOOST_CHECK (testset.find (cmp_val) == testset.end()); } template void test_set ::test_clone(std::vector& values) { typedef typename ValueTraits::value_type testvalue_t; typedef boost::intrusive::set ,ValueTraits::value_type::constant_time_size, std::size_t > set_type; set_type testset1 (&values[0], &values[0] + values.size()); set_type testset2; testset2.clone_from(testset1, test::new_cloner(), test::delete_destroyer()); BOOST_CHECK (testset2 == testset1); testset2.clear_and_destroy(test::delete_destroyer()); BOOST_CHECK (testset2.empty()); } template class test_main_template { public: int operator()() { typedef testvalue testvalue_t; static const int random_init[6] = { 3, 2, 4, 1, 5, 2 }; std::vector > data (6); for (int i = 0; i < 6; ++i) data[i].value_ = random_init[i]; test_set >::test_all(data); test_set >::test_all(data); return 0; } }; template class test_main_template { public: int operator()() { typedef testvalue testvalue_t; static const int random_init[6] = { 3, 2, 4, 1, 5, 2 }; std::vector > data (6); for (int i = 0; i < 6; ++i) data[i].value_ = random_init[i]; test_set >::test_all(data); test_set >::test_all(data); test_set >::test_all(data); test_set >::test_all(data); return 0; } }; //Explicit instantiations of non-counted classes template class boost::intrusive::set , false>; template class boost::intrusive::set , false>; template class boost::intrusive::set , false>; template class boost::intrusive::set , false>; template class boost::intrusive::set , false>; template class boost::intrusive::set , false>; template class boost::intrusive::set , false>; template class boost::intrusive::set , false>; //Explicit instantiation of counted classes template class boost::intrusive::set , true>; template class boost::intrusive::set , true>; template class boost::intrusive::set , true>; template class boost::intrusive::set , true>; int test_main( int, char* [] ) { test_main_template()(); test_main_template, false>()(); test_main_template()(); test_main_template, true>()(); return 0; }