123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655 |
- //////////////////////////////////////////////////////////////////////////////
- //
- // (C) Copyright Ion Gaztanaga 2004-2013. 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/container for documentation.
- //
- //////////////////////////////////////////////////////////////////////////////
- #include <boost/container/detail/config_begin.hpp>
- #include <set>
- #include <boost/container/set.hpp>
- #include <boost/container/adaptive_pool.hpp>
- #include "print_container.hpp"
- #include "movable_int.hpp"
- #include "dummy_test_allocator.hpp"
- #include "set_test.hpp"
- #include "propagate_allocator_test.hpp"
- #include "emplace_test.hpp"
- #include "../../intrusive/test/iterator_test.hpp"
- using namespace boost::container;
- //Test recursive structures
- class recursive_set
- {
- public:
- recursive_set & operator=(const recursive_set &x)
- { id_ = x.id_; set_ = x.set_; return *this; }
- int id_;
- set<recursive_set> set_;
- set<recursive_set>::iterator it_;
- set<recursive_set>::const_iterator cit_;
- set<recursive_set>::reverse_iterator rit_;
- set<recursive_set>::const_reverse_iterator crit_;
- friend bool operator< (const recursive_set &a, const recursive_set &b)
- { return a.id_ < b.id_; }
- };
- //Test recursive structures
- class recursive_multiset
- {
- public:
- recursive_multiset & operator=(const recursive_multiset &x)
- { id_ = x.id_; multiset_ = x.multiset_; return *this; }
- int id_;
- multiset<recursive_multiset> multiset_;
- multiset<recursive_multiset>::iterator it_;
- multiset<recursive_multiset>::const_iterator cit_;
- multiset<recursive_multiset>::reverse_iterator rit_;
- multiset<recursive_multiset>::const_reverse_iterator crit_;
- friend bool operator< (const recursive_multiset &a, const recursive_multiset &b)
- { return a.id_ < b.id_; }
- };
- template<class C>
- void test_move()
- {
- //Now test move semantics
- C original;
- original.emplace();
- C move_ctor(boost::move(original));
- C move_assign;
- move_assign.emplace();
- move_assign = boost::move(move_ctor);
- move_assign.swap(original);
- }
- bool node_type_test()
- {
- using namespace boost::container;
- {
- typedef set<test::movable_int> set_type;
- set_type src;
- {
- test::movable_int mv_1(1), mv_2(2), mv_3(3);
- src.emplace(boost::move(mv_1));
- src.emplace(boost::move(mv_2));
- src.emplace(boost::move(mv_3));
- }
- if(src.size() != 3)
- return false;
- set_type dst;
- {
- test::movable_int mv_3(3);
- dst.emplace(boost::move(mv_3));
- }
- if(dst.size() != 1)
- return false;
- const test::movable_int mv_1(1);
- const test::movable_int mv_2(2);
- const test::movable_int mv_3(3);
- const test::movable_int mv_33(33);
- set_type::insert_return_type r;
- r = dst.insert(src.extract(mv_33)); // Key version, try to insert empty node
- if(! (r.position == dst.end() && r.inserted == false && r.node.empty()) )
- return false;
- r = dst.insert(src.extract(src.find(mv_1))); // Iterator version, successful
- if(! (r.position == dst.find(mv_1) && r.inserted == true && r.node.empty()) )
- return false;
- r = dst.insert(dst.begin(), src.extract(mv_2)); // Key type version, successful
- if(! (r.position == dst.find(mv_2) && r.inserted == true && r.node.empty()) )
- return false;
- r = dst.insert(src.extract(mv_3)); // Key type version, unsuccessful
- if(!src.empty())
- return false;
- if(dst.size() != 3)
- return false;
- if(! (r.position == dst.find(mv_3) && r.inserted == false && r.node.value() == mv_3) )
- return false;
- }
- {
- typedef multiset<test::movable_int> multiset_type;
- multiset_type src;
- {
- test::movable_int mv_1(1), mv_2(2), mv_3(3), mv_3bis(3);
- src.emplace(boost::move(mv_1));
- src.emplace(boost::move(mv_2));
- src.emplace(boost::move(mv_3));
- src.emplace_hint(src.begin(), boost::move(mv_3bis));
- }
- if(src.size() != 4)
- return false;
- multiset_type dst;
- {
- test::movable_int mv_3(3);
- dst.emplace(boost::move(mv_3));
- }
- if(dst.size() != 1)
- return false;
- const test::movable_int mv_1(1);
- const test::movable_int mv_2(2);
- const test::movable_int mv_3(3);
- const test::movable_int mv_4(4);
- multiset_type::iterator r;
- multiset_type::node_type nt(src.extract(mv_3));
- r = dst.insert(dst.begin(), boost::move(nt));
- if(! (*r == mv_3 && dst.find(mv_3) == r && nt.empty()) )
- return false;
- nt = src.extract(src.find(mv_1));
- r = dst.insert(boost::move(nt)); // Iterator version, successful
- if(! (*r == mv_1 && nt.empty()) )
- return false;
- nt = src.extract(mv_2);
- r = dst.insert(boost::move(nt)); // Key type version, successful
- if(! (*r == mv_2 && nt.empty()) )
- return false;
- r = dst.insert(src.extract(mv_3)); // Key type version, successful
- if(! (*r == mv_3 && r == --multiset_type::iterator(dst.upper_bound(mv_3)) && nt.empty()) )
- return false;
- r = dst.insert(src.extract(mv_4)); // Key type version, unsuccessful
- if(! (r == dst.end()) )
- return false;
- if(!src.empty())
- return false;
- if(dst.size() != 5)
- return false;
- }
- return true;
- }
- struct boost_container_set;
- struct boost_container_multiset;
- namespace boost {
- namespace container {
- namespace test {
- template<>
- struct alloc_propagate_base<boost_container_set>
- {
- template <class T, class Allocator>
- struct apply
- {
- typedef boost::container::set<T, std::less<T>, Allocator> type;
- };
- };
- template<>
- struct alloc_propagate_base<boost_container_multiset>
- {
- template <class T, class Allocator>
- struct apply
- {
- typedef boost::container::multiset<T, std::less<T>, Allocator> type;
- };
- };
- bool constructor_template_auto_deduction_test()
- {
- #ifndef BOOST_CONTAINER_NO_CXX17_CTAD
- using namespace boost::container;
- const std::size_t NumElements = 100;
- {
- std::set<int> int_set;
- for (std::size_t i = 0; i != NumElements; ++i) {
- int_set.insert(static_cast<int>(i));
- }
- std::multiset<int> int_mset;
- for (std::size_t i = 0; i != NumElements; ++i) {
- int_mset.insert(static_cast<int>(i));
- }
- typedef std::less<int> comp_int_t;
- typedef std::allocator<int> alloc_int_t;
- //range
- {
- auto fset = set(int_set.begin(), int_set.end());
- if (!CheckEqualContainers(int_set, fset))
- return false;
- auto fmset = multiset(int_mset.begin(), int_mset.end());
- if (!CheckEqualContainers(int_mset, fmset))
- return false;
- }
- //range+comp
- {
- auto fset = set(int_set.begin(), int_set.end(), comp_int_t());
- if (!CheckEqualContainers(int_set, fset))
- return false;
- auto fmset = multiset(int_mset.begin(), int_mset.end(), comp_int_t());
- if (!CheckEqualContainers(int_mset, fmset))
- return false;
- }
- //range+comp+alloc
- {
- auto fset = set(int_set.begin(), int_set.end(), comp_int_t(), alloc_int_t());
- if (!CheckEqualContainers(int_set, fset))
- return false;
- auto fmset = multiset(int_mset.begin(), int_mset.end(), comp_int_t(), alloc_int_t());
- if (!CheckEqualContainers(int_mset, fmset))
- return false;
- }
- //range+alloc
- {
- auto fset = set(int_set.begin(), int_set.end(), alloc_int_t());
- if (!CheckEqualContainers(int_set, fset))
- return false;
- auto fmset = multiset(int_mset.begin(), int_mset.end(), alloc_int_t());
- if (!CheckEqualContainers(int_mset, fmset))
- return false;
- }
- //ordered_unique_range / ordered_range
- //range
- {
- auto fset = set(ordered_unique_range, int_set.begin(), int_set.end());
- if (!CheckEqualContainers(int_set, fset))
- return false;
- auto fmset = multiset(ordered_range, int_mset.begin(), int_mset.end());
- if (!CheckEqualContainers(int_mset, fmset))
- return false;
- }
- //range+comp
- {
- auto fset = set(ordered_unique_range, int_set.begin(), int_set.end(), comp_int_t());
- if (!CheckEqualContainers(int_set, fset))
- return false;
- auto fmset = multiset(ordered_range, int_mset.begin(), int_mset.end(), comp_int_t());
- if (!CheckEqualContainers(int_mset, fmset))
- return false;
- }
- //range+comp+alloc
- {
- auto fset = set(ordered_unique_range, int_set.begin(), int_set.end(), comp_int_t(), alloc_int_t());
- if (!CheckEqualContainers(int_set, fset))
- return false;
- auto fmset = multiset(ordered_range, int_mset.begin(), int_mset.end(), comp_int_t(), alloc_int_t());
- if (!CheckEqualContainers(int_mset, fmset))
- return false;
- }
- //range+alloc
- {
- auto fset = set(ordered_unique_range, int_set.begin(), int_set.end(), alloc_int_t());
- if (!CheckEqualContainers(int_set, fset))
- return false;
- auto fmset = multiset(ordered_range, int_mset.begin(), int_mset.end(), alloc_int_t());
- if (!CheckEqualContainers(int_mset, fmset))
- return false;
- }
- }
- #endif
- return true;
- }
- }}} //boost::container::test
- template<class VoidAllocator, boost::container::tree_type_enum tree_type_value>
- struct GetAllocatorSet
- {
- template<class ValueType>
- struct apply
- {
- typedef set < ValueType
- , std::less<ValueType>
- , typename allocator_traits<VoidAllocator>
- ::template portable_rebind_alloc<ValueType>::type
- , typename boost::container::tree_assoc_options
- < boost::container::tree_type<tree_type_value>
- >::type
- > set_type;
- typedef multiset < ValueType
- , std::less<ValueType>
- , typename allocator_traits<VoidAllocator>
- ::template portable_rebind_alloc<ValueType>::type
- , typename boost::container::tree_assoc_options
- < boost::container::tree_type<tree_type_value>
- >::type
- > multiset_type;
- };
- };
- void test_merge_from_different_comparison()
- {
- set<int> set1;
- set<int, std::greater<int> > set2;
- set1.merge(set2);
- }
- bool test_heterogeneous_lookups()
- {
- typedef set<int, test::less_transparent> set_t;
- typedef multiset<int, test::less_transparent> mset_t;
- set_t set1;
- mset_t mset1;
- const set_t &cset1 = set1;
- const mset_t &cmset1 = mset1;
- set1.insert(1);
- set1.insert(1);
- set1.insert(2);
- set1.insert(2);
- set1.insert(3);
- mset1.insert(1);
- mset1.insert(1);
- mset1.insert(2);
- mset1.insert(2);
- mset1.insert(3);
- const test::non_copymovable_int find_me(2);
- //find
- if(*set1.find(find_me) != 2)
- return false;
- if(*cset1.find(find_me) != 2)
- return false;
- if(*mset1.find(find_me) != 2)
- return false;
- if(*cmset1.find(find_me) != 2)
- return false;
- //count
- if(set1.count(find_me) != 1)
- return false;
- if(cset1.count(find_me) != 1)
- return false;
- if(mset1.count(find_me) != 2)
- return false;
- if(cmset1.count(find_me) != 2)
- return false;
- //contains
- if(!set1.contains(find_me))
- return false;
- if(!cset1.contains(find_me))
- return false;
- if(!mset1.contains(find_me))
- return false;
- if(!cmset1.contains(find_me))
- return false;
- //lower_bound
- if(*set1.lower_bound(find_me) != 2)
- return false;
- if(*cset1.lower_bound(find_me) != 2)
- return false;
- if(*mset1.lower_bound(find_me) != 2)
- return false;
- if(*cmset1.lower_bound(find_me) != 2)
- return false;
- //upper_bound
- if(*set1.upper_bound(find_me) != 3)
- return false;
- if(*cset1.upper_bound(find_me) != 3)
- return false;
- if(*mset1.upper_bound(find_me) != 3)
- return false;
- if(*cmset1.upper_bound(find_me) != 3)
- return false;
- //equal_range
- if(*set1.equal_range(find_me).first != 2)
- return false;
- if(*cset1.equal_range(find_me).second != 3)
- return false;
- if(*mset1.equal_range(find_me).first != 2)
- return false;
- if(*cmset1.equal_range(find_me).second != 3)
- return false;
- return true;
- }
- int main ()
- {
- //Recursive container instantiation
- {
- set<recursive_set> set_;
- multiset<recursive_multiset> multiset_;
- }
- //Allocator argument container
- {
- set<int> set_((set<int>::allocator_type()));
- multiset<int> multiset_((multiset<int>::allocator_type()));
- }
- //Now test move semantics
- {
- test_move<set<recursive_set> >();
- test_move<multiset<recursive_multiset> >();
- }
- //Test std::pair value type as tree has workarounds to make old std::pair
- //implementations movable that can break things
- {
- boost::container::set<std::pair<int,int> > s;
- std::pair<int,int> p(0, 0);
- s.insert(p);
- s.emplace(p);
- }
- if (!boost::container::test::instantiate_constructors<set<int>, multiset<int> >())
- return 1;
- test_merge_from_different_comparison();
- ////////////////////////////////////
- // Constructor Template Auto Deduction test
- ////////////////////////////////////
- if (!test::constructor_template_auto_deduction_test()) {
- return 1;
- }
- if(!test_heterogeneous_lookups())
- return 1;
- ////////////////////////////////////
- // Testing allocator implementations
- ////////////////////////////////////
- {
- typedef std::set<int> MyStdSet;
- typedef std::multiset<int> MyStdMultiSet;
- if (0 != test::set_test
- < GetAllocatorSet<std::allocator<void>, red_black_tree>::apply<int>::set_type
- , MyStdSet
- , GetAllocatorSet<std::allocator<void>, red_black_tree>::apply<int>::multiset_type
- , MyStdMultiSet>()) {
- std::cout << "Error in set_test<std::allocator<void>, red_black_tree>" << std::endl;
- return 1;
- }
- if (0 != test::set_test
- < GetAllocatorSet<new_allocator<void>, avl_tree>::apply<int>::set_type
- , MyStdSet
- , GetAllocatorSet<new_allocator<void>, avl_tree>::apply<int>::multiset_type
- , MyStdMultiSet>()) {
- std::cout << "Error in set_test<new_allocator<void>, avl_tree>" << std::endl;
- return 1;
- }
- if (0 != test::set_test
- < GetAllocatorSet<adaptive_pool<void>, scapegoat_tree>::apply<int>::set_type
- , MyStdSet
- , GetAllocatorSet<adaptive_pool<void>, scapegoat_tree>::apply<int>::multiset_type
- , MyStdMultiSet>()) {
- std::cout << "Error in set_test<adaptive_pool<void>, scapegoat_tree>" << std::endl;
- return 1;
- }
- ///////////
- if (0 != test::set_test
- < GetAllocatorSet<new_allocator<void>, splay_tree>::apply<test::movable_int>::set_type
- , MyStdSet
- , GetAllocatorSet<new_allocator<void>, splay_tree>::apply<test::movable_int>::multiset_type
- , MyStdMultiSet>()) {
- std::cout << "Error in set_test<new_allocator<void>, splay_tree>" << std::endl;
- return 1;
- }
- if (0 != test::set_test
- < GetAllocatorSet<new_allocator<void>, red_black_tree>::apply<test::copyable_int>::set_type
- , MyStdSet
- , GetAllocatorSet<new_allocator<void>, red_black_tree>::apply<test::copyable_int>::multiset_type
- , MyStdMultiSet>()) {
- std::cout << "Error in set_test<new_allocator<void>, red_black_tree>" << std::endl;
- return 1;
- }
- if (0 != test::set_test
- < GetAllocatorSet<new_allocator<void>, red_black_tree>::apply<test::movable_and_copyable_int>::set_type
- , MyStdSet
- , GetAllocatorSet<new_allocator<void>, red_black_tree>::apply<test::movable_and_copyable_int>::multiset_type
- , MyStdMultiSet>()) {
- std::cout << "Error in set_test<new_allocator<void>, red_black_tree>" << std::endl;
- return 1;
- }
- }
- ////////////////////////////////////
- // Emplace testing
- ////////////////////////////////////
- const test::EmplaceOptions SetOptions = (test::EmplaceOptions)(test::EMPLACE_HINT | test::EMPLACE_ASSOC);
- if(!boost::container::test::test_emplace<set<test::EmplaceInt>, SetOptions>())
- return 1;
- if(!boost::container::test::test_emplace<multiset<test::EmplaceInt>, SetOptions>())
- return 1;
- ////////////////////////////////////
- // Allocator propagation testing
- ////////////////////////////////////
- if(!boost::container::test::test_propagate_allocator<boost_container_set>())
- return 1;
- if(!boost::container::test::test_propagate_allocator<boost_container_multiset>())
- return 1;
- if (!boost::container::test::test_set_methods_with_initializer_list_as_argument_for<set<int> >())
- return 1;
- if (!boost::container::test::test_set_methods_with_initializer_list_as_argument_for<multiset<int> >())
- return 1;
- ////////////////////////////////////
- // Test optimize_size option
- ////////////////////////////////////
- //
- // set
- //
- typedef set< int*, std::less<int*>, std::allocator<int*>
- , tree_assoc_options< optimize_size<false>, tree_type<red_black_tree> >::type > rbset_size_optimized_no;
- typedef set< int*, std::less<int*>, std::allocator<int*>
- , tree_assoc_options< optimize_size<true>, tree_type<avl_tree> >::type > avlset_size_optimized_yes;
- //
- // multiset
- //
- typedef multiset< int*, std::less<int*>, std::allocator<int*>
- , tree_assoc_options< optimize_size<true>, tree_type<red_black_tree> >::type > rbmset_size_optimized_yes;
- typedef multiset< int*, std::less<int*>, std::allocator<int*>
- , tree_assoc_options< optimize_size<false>, tree_type<avl_tree> >::type > avlmset_size_optimized_no;
- BOOST_STATIC_ASSERT(sizeof(rbmset_size_optimized_yes) < sizeof(rbset_size_optimized_no));
- BOOST_STATIC_ASSERT(sizeof(avlset_size_optimized_yes) < sizeof(avlmset_size_optimized_no));
- ////////////////////////////////////
- // Iterator testing
- ////////////////////////////////////
- {
- typedef boost::container::set<int> cont_int;
- cont_int a; a.insert(0); a.insert(1); a.insert(2);
- boost::intrusive::test::test_iterator_bidirectional< cont_int >(a);
- if(boost::report_errors() != 0) {
- return 1;
- }
- }
- {
- typedef boost::container::multiset<int> cont_int;
- cont_int a; a.insert(0); a.insert(1); a.insert(2);
- boost::intrusive::test::test_iterator_bidirectional< cont_int >(a);
- if(boost::report_errors() != 0) {
- return 1;
- }
- }
- ////////////////////////////////////
- // Node extraction/insertion testing functions
- ////////////////////////////////////
- if(!node_type_test())
- return 1;
- ////////////////////////////////////
- // has_trivial_destructor_after_move testing
- ////////////////////////////////////
- // set, default allocator
- {
- typedef boost::container::set<int> cont;
- typedef boost::container::dtl::tree<int, void, std::less<int>, void, void> tree;
- if (boost::has_trivial_destructor_after_move<cont>::value !=
- boost::has_trivial_destructor_after_move<tree>::value) {
- std::cerr << "has_trivial_destructor_after_move(set, default allocator) test failed" << std::endl;
- return 1;
- }
- }
- // set, std::allocator
- {
- typedef boost::container::set<int, std::less<int>, std::allocator<int> > cont;
- typedef boost::container::dtl::tree<int, void, std::less<int>, std::allocator<int>, void> tree;
- if (boost::has_trivial_destructor_after_move<cont>::value !=
- boost::has_trivial_destructor_after_move<tree>::value) {
- std::cerr << "has_trivial_destructor_after_move(set, std::allocator) test failed" << std::endl;
- return 1;
- }
- }
- // multiset, default allocator
- {
- typedef boost::container::multiset<int> cont;
- typedef boost::container::dtl::tree<int, void, std::less<int>, void, void> tree;
- if (boost::has_trivial_destructor_after_move<cont>::value !=
- boost::has_trivial_destructor_after_move<tree>::value) {
- std::cerr << "has_trivial_destructor_after_move(multiset, default allocator) test failed" << std::endl;
- return 1;
- }
- }
- // multiset, std::allocator
- {
- typedef boost::container::multiset<int, std::less<int>, std::allocator<int> > cont;
- typedef boost::container::dtl::tree<int, void, std::less<int>, std::allocator<int>, void> tree;
- if (boost::has_trivial_destructor_after_move<cont>::value !=
- boost::has_trivial_destructor_after_move<tree>::value) {
- std::cerr << "has_trivial_destructor_after_move(multiset, std::allocator) test failed" << std::endl;
- return 1;
- }
- }
- return 0;
- }
- #include <boost/container/detail/config_end.hpp>
|