////////////////////////////////////////////////////////////////////////////// // // (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 "dummy_test_allocator.hpp" #include "movable_int.hpp" #include "list_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 template class boost::container::slist < test::movable_and_copyable_int , test::simple_allocator >; template class boost::container::slist < test::movable_and_copyable_int , test::dummy_test_allocator >; template class boost::container::slist < test::movable_and_copyable_int , std::allocator >; template class boost::container::slist < test::movable_and_copyable_int , allocator >; template class boost::container::slist < test::movable_and_copyable_int , adaptive_pool >; template class boost::container::slist < test::movable_and_copyable_int , node_allocator >; }} class recursive_slist { public: int id_; slist slist_; recursive_slist &operator=(const recursive_slist &o) { slist_ = o.slist_; return *this; } }; void recursive_slist_test()//Test for recursive types { slist recursive_list_list; } template struct GetAllocatorCont { template struct apply { typedef slist< ValueType , typename allocator_traits ::template portable_rebind_alloc::type > type; }; }; template int test_cont_variants() { typedef typename GetAllocatorCont::template apply::type MyCont; typedef typename GetAllocatorCont::template apply::type MyMoveCont; typedef typename GetAllocatorCont::template apply::type MyCopyMoveCont; typedef typename GetAllocatorCont::template apply::type MyCopyCont; if(test::list_test()) return 1; if(test::list_test()) return 1; if(test::list_test()) return 1; if(test::list_test()) return 1; if(test::list_test()) return 1; return 0; } int main () { recursive_slist_test(); { //Now test move semantics slist original; slist move_ctor(boost::move(original)); slist move_assign; move_assign = boost::move(move_ctor); move_assign.swap(original); { slist recursive, copy; //Test to test both move emulations if(!copy.size()){ copy = recursive; } } } //////////////////////////////////// // Testing allocator implementations //////////////////////////////////// // std:allocator if(test_cont_variants< std::allocator >()){ std::cerr << "test_cont_variants< std::allocator > failed" << std::endl; return 1; } // boost::container::allocator if(test_cont_variants< allocator >()){ std::cerr << "test_cont_variants< allocator > failed" << std::endl; return 1; } // boost::container::node_allocator if(test_cont_variants< node_allocator >()){ std::cerr << "test_cont_variants< node_allocator > failed" << std::endl; return 1; } // boost::container::adaptive_pool if(test_cont_variants< adaptive_pool >()){ std::cerr << "test_cont_variants< adaptive_pool > failed" << std::endl; return 1; } //////////////////////////////////// // Emplace testing //////////////////////////////////// const test::EmplaceOptions Options = (test::EmplaceOptions) (test::EMPLACE_FRONT | test::EMPLACE_AFTER | test::EMPLACE_BEFORE | test::EMPLACE_AFTER); if(!boost::container::test::test_emplace < slist, Options>()) return 1; //////////////////////////////////// // Allocator propagation testing //////////////////////////////////// if(!boost::container::test::test_propagate_allocator()) return 1; } #include