////////////////////////////////////////////////////////////////////////////// // // (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 #include #include #include #include #include #include "print_container.hpp" #include "movable_int.hpp" #include "dummy_test_allocator.hpp" #include "map_test.hpp" #include "propagate_allocator_test.hpp" #include "emplace_test.hpp" using namespace boost::container; namespace boost { namespace container { //Explicit instantiation to detect compilation errors //map template class map < test::movable_and_copyable_int , test::movable_and_copyable_int , std::less , test::dummy_test_allocator < std::pair > >; template class map < test::movable_and_copyable_int , test::movable_and_copyable_int , std::less , test::simple_allocator < std::pair > >; template class map < test::movable_and_copyable_int , test::movable_and_copyable_int , std::less , std::allocator < std::pair > >; template class map < test::movable_and_copyable_int , test::movable_and_copyable_int , std::less , allocator < std::pair > >; template class map < test::movable_and_copyable_int , test::movable_and_copyable_int , std::less , adaptive_pool < std::pair > >; template class map < test::movable_and_copyable_int , test::movable_and_copyable_int , std::less , node_allocator < std::pair > >; //multimap template class multimap < test::movable_and_copyable_int , test::movable_and_copyable_int , std::less , test::dummy_test_allocator < std::pair > >; template class multimap < test::movable_and_copyable_int , test::movable_and_copyable_int , std::less , test::simple_allocator < std::pair > >; template class multimap < test::movable_and_copyable_int , test::movable_and_copyable_int , std::less , std::allocator < std::pair > >; template class multimap < test::movable_and_copyable_int , test::movable_and_copyable_int , std::less , allocator < std::pair > >; template class multimap < test::movable_and_copyable_int , test::movable_and_copyable_int , std::less , adaptive_pool < std::pair > >; template class multimap < test::movable_and_copyable_int , test::movable_and_copyable_int , std::less , node_allocator < std::pair > >; namespace container_detail { template class tree < const test::movable_and_copyable_int , std::pair , container_detail::select1st< std::pair > , std::less , test::dummy_test_allocator < std::pair > , tree_assoc_defaults >; template class tree < const test::movable_and_copyable_int , std::pair , container_detail::select1st< std::pair > , std::less , test::simple_allocator < std::pair > , tree_assoc_defaults >; template class tree < const test::movable_and_copyable_int , std::pair , container_detail::select1st< std::pair > , std::less , std::allocator < std::pair > , tree_assoc_defaults >; template class tree < const test::movable_and_copyable_int , std::pair , container_detail::select1st< std::pair > , std::less , allocator < std::pair > , tree_assoc_defaults >; template class tree < const test::movable_and_copyable_int , std::pair , container_detail::select1st< std::pair > , std::less , adaptive_pool < std::pair > , tree_assoc_defaults >; template class tree < const test::movable_and_copyable_int , std::pair , container_detail::select1st< std::pair > , std::less , node_allocator < std::pair > , tree_assoc_defaults >; } //container_detail { }} //boost::container class recursive_map { public: recursive_map & operator=(const recursive_map &x) { id_ = x.id_; map_ = x.map_; return *this; } int id_; map map_; map::iterator it_; map::const_iterator cit_; map::reverse_iterator rit_; map::const_reverse_iterator crit_; friend bool operator< (const recursive_map &a, const recursive_map &b) { return a.id_ < b.id_; } }; class recursive_multimap { public: recursive_multimap & operator=(const recursive_multimap &x) { id_ = x.id_; multimap_ = x.multimap_; return *this; } int id_; multimap multimap_; multimap::iterator it_; multimap::const_iterator cit_; multimap::reverse_iterator rit_; multimap::const_reverse_iterator crit_; friend bool operator< (const recursive_multimap &a, const recursive_multimap &b) { return a.id_ < b.id_; } }; template 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); } template struct GetAllocatorMap { template struct apply { typedef map< ValueType , ValueType , std::less , typename allocator_traits ::template portable_rebind_alloc< std::pair >::type , typename boost::container::tree_assoc_options < boost::container::tree_type >::type > map_type; typedef multimap< ValueType , ValueType , std::less , typename allocator_traits ::template portable_rebind_alloc< std::pair >::type , typename boost::container::tree_assoc_options < boost::container::tree_type >::type > multimap_type; }; }; template int test_map_variants() { typedef typename GetAllocatorMap::template apply::map_type MyMap; typedef typename GetAllocatorMap::template apply::map_type MyMoveMap; typedef typename GetAllocatorMap::template apply::map_type MyCopyMoveMap; typedef typename GetAllocatorMap::template apply::map_type MyCopyMap; typedef typename GetAllocatorMap::template apply::multimap_type MyMultiMap; typedef typename GetAllocatorMap::template apply::multimap_type MyMoveMultiMap; typedef typename GetAllocatorMap::template apply::multimap_type MyCopyMoveMultiMap; typedef typename GetAllocatorMap::template apply::multimap_type MyCopyMultiMap; typedef std::map MyStdMap; typedef std::multimap MyStdMultiMap; if (0 != test::map_test< MyMap ,MyStdMap ,MyMultiMap ,MyStdMultiMap>()){ std::cout << "Error in map_test" << std::endl; return 1; } if (0 != test::map_test< MyMoveMap ,MyStdMap ,MyMoveMultiMap ,MyStdMultiMap>()){ std::cout << "Error in map_test" << std::endl; return 1; } if (0 != test::map_test< MyCopyMoveMap ,MyStdMap ,MyCopyMoveMultiMap ,MyStdMultiMap>()){ std::cout << "Error in map_test" << std::endl; return 1; } if (0 != test::map_test< MyCopyMap ,MyStdMap ,MyCopyMultiMap ,MyStdMultiMap>()){ std::cout << "Error in map_test" << std::endl; return 1; } return 0; } struct boost_container_map; struct boost_container_multimap; namespace boost { namespace container { namespace test { template<> struct alloc_propagate_base { template struct apply { typedef typename boost::container::allocator_traits:: template portable_rebind_alloc >::type TypeAllocator; typedef boost::container::map, TypeAllocator> type; }; }; template<> struct alloc_propagate_base { template struct apply { typedef typename boost::container::allocator_traits:: template portable_rebind_alloc >::type TypeAllocator; typedef boost::container::multimap, TypeAllocator> type; }; }; }}} //namespace boost::container::test int main () { //Recursive container instantiation { map map_; multimap multimap_; } //Allocator argument container { map map_((map::allocator_type())); multimap multimap_((multimap::allocator_type())); } //Now test move semantics { test_move >(); test_move >(); } //////////////////////////////////// // Testing allocator implementations //////////////////////////////////// // std:allocator if(test_map_variants< std::allocator, red_black_tree >()){ std::cerr << "test_map_variants< std::allocator > failed" << std::endl; return 1; } // boost::container::allocator if(test_map_variants< allocator, red_black_tree >()){ std::cerr << "test_map_variants< allocator > failed" << std::endl; return 1; } // boost::container::node_allocator if(test_map_variants< node_allocator, red_black_tree >()){ std::cerr << "test_map_variants< node_allocator > failed" << std::endl; return 1; } // boost::container::adaptive_pool if(test_map_variants< adaptive_pool, red_black_tree >()){ std::cerr << "test_map_variants< adaptive_pool > failed" << std::endl; return 1; } //////////////////////////////////// // Tree implementations //////////////////////////////////// // AVL if(test_map_variants< std::allocator, avl_tree >()){ std::cerr << "test_map_variants< std::allocator, avl_tree > failed" << std::endl; return 1; } // SCAPEGOAT TREE if(test_map_variants< std::allocator, scapegoat_tree >()){ std::cerr << "test_map_variants< std::allocator, scapegoat_tree > failed" << std::endl; return 1; } // SPLAY TREE if(test_map_variants< std::allocator, splay_tree >()){ std::cerr << "test_map_variants< std::allocator, splay_tree > failed" << std::endl; return 1; } //////////////////////////////////// // Emplace testing //////////////////////////////////// const test::EmplaceOptions MapOptions = (test::EmplaceOptions)(test::EMPLACE_HINT_PAIR | test::EMPLACE_ASSOC_PAIR); if(!boost::container::test::test_emplace, MapOptions>()) return 1; if(!boost::container::test::test_emplace, MapOptions>()) return 1; //////////////////////////////////// // Allocator propagation testing //////////////////////////////////// if(!boost::container::test::test_propagate_allocator()) return 1; if(!boost::container::test::test_propagate_allocator()) return 1; if (!boost::container::test::test_map_support_for_initialization_list_for >()) return 1; if (!boost::container::test::test_map_support_for_initialization_list_for >()) return 1; //////////////////////////////////// // Test optimize_size option //////////////////////////////////// // // map // typedef map< int*, int*, std::less, std::allocator< std::pair > , tree_assoc_options< optimize_size, tree_type >::type > rbmap_size_optimized_no; typedef map< int*, int*, std::less, std::allocator< std::pair > , tree_assoc_options< optimize_size, tree_type >::type > rbmap_size_optimized_yes; BOOST_STATIC_ASSERT(sizeof(rbmap_size_optimized_yes) < sizeof(rbmap_size_optimized_no)); typedef map< int*, int*, std::less, std::allocator< std::pair > , tree_assoc_options< optimize_size, tree_type >::type > avlmap_size_optimized_no; typedef map< int*, int*, std::less, std::allocator< std::pair > , tree_assoc_options< optimize_size, tree_type >::type > avlmap_size_optimized_yes; BOOST_STATIC_ASSERT(sizeof(avlmap_size_optimized_yes) < sizeof(avlmap_size_optimized_no)); // // multimap // typedef multimap< int*, int*, std::less, std::allocator< std::pair > , tree_assoc_options< optimize_size, tree_type >::type > rbmmap_size_optimized_no; typedef multimap< int*, int*, std::less, std::allocator< std::pair > , tree_assoc_options< optimize_size, tree_type >::type > rbmmap_size_optimized_yes; BOOST_STATIC_ASSERT(sizeof(rbmmap_size_optimized_yes) < sizeof(rbmmap_size_optimized_no)); typedef multimap< int*, int*, std::less, std::allocator< std::pair > , tree_assoc_options< optimize_size, tree_type >::type > avlmmap_size_optimized_no; typedef multimap< int*, int*, std::less, std::allocator< std::pair > , tree_assoc_options< optimize_size, tree_type >::type > avlmmap_size_optimized_yes; BOOST_STATIC_ASSERT(sizeof(avlmmap_size_optimized_yes) < sizeof(avlmmap_size_optimized_no)); return 0; } #include