////////////////////////////////////////////////////////////////////////////// // // (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 #include "check_equal_containers.hpp" #include "movable_int.hpp" #include "expand_bwd_test_allocator.hpp" #include "expand_bwd_test_template.hpp" #include "dummy_test_allocator.hpp" #include "propagate_allocator_test.hpp" #include "vector_test.hpp" #include "default_init_test.hpp" using namespace boost::container; namespace boost { namespace container { //Explicit instantiation to detect compilation errors template class boost::container::vector < test::movable_and_copyable_int , test::simple_allocator >; template class boost::container::vector < test::movable_and_copyable_int , test::dummy_test_allocator >; template class boost::container::vector < test::movable_and_copyable_int , std::allocator >; template class boost::container::vector < test::movable_and_copyable_int , allocator >; template class boost::container::vector < test::movable_and_copyable_int , adaptive_pool >; template class boost::container::vector < test::movable_and_copyable_int , node_allocator >; namespace container_detail { #ifndef BOOST_CONTAINER_VECTOR_ITERATOR_IS_POINTER template class vec_iterator; template class vec_iterator; #endif //BOOST_CONTAINER_VECTOR_ITERATOR_IS_POINTER } }} int test_expand_bwd() { //Now test all back insertion possibilities //First raw ints typedef test::expand_bwd_test_allocator int_allocator_type; typedef vector int_vector; if(!test::test_all_expand_bwd()) return 1; //Now user defined copyable int typedef test::expand_bwd_test_allocator copyable_int_allocator_type; typedef vector copyable_int_vector; if(!test::test_all_expand_bwd()) return 1; return 0; } class recursive_vector { public: int id_; vector vector_; vector::iterator it_; vector::const_iterator cit_; vector::reverse_iterator rit_; vector::const_reverse_iterator crit_; }; void recursive_vector_test()//Test for recursive types { vector recursive_vector_vector; } enum Test { zero, one, two, three, four, five, six }; template struct GetAllocatorCont { template struct apply { typedef vector< 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::vector_test()) return 1; if(test::vector_test()) return 1; if(test::vector_test()) return 1; if(test::vector_test()) return 1; return 0; } struct boost_container_vector; namespace boost { namespace container { namespace test { template<> struct alloc_propagate_base { template struct apply { typedef boost::container::vector type; }; }; }}} //namespace boost::container::test int main() { { const std::size_t positions_length = 10; std::size_t positions[positions_length]; vector vector_int; vector vector_int2(positions_length); for(std::size_t i = 0; i != positions_length; ++i){ positions[i] = 0u; } for(std::size_t i = 0, max = vector_int2.size(); i != max; ++i){ vector_int2[i] = (int)i; } vector_int.insert(vector_int.begin(), 999); vector_int.insert_ordered_at(positions_length, positions + positions_length, vector_int2.end()); for(std::size_t i = 0, max = vector_int.size(); i != max; ++i){ std::cout << vector_int[i] << std::endl; } } recursive_vector_test(); { //Now test move semantics vector original; vector move_ctor(boost::move(original)); vector move_assign; move_assign = boost::move(move_ctor); move_assign.swap(original); } //////////////////////////////////// // 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; } { typedef vector > MyEnumCont; MyEnumCont v; Test t; v.push_back(t); v.push_back(::boost::move(t)); v.push_back(Test()); } //////////////////////////////////// // Backwards expansion test //////////////////////////////////// if(test_expand_bwd()) return 1; //////////////////////////////////// // Default init test //////////////////////////////////// if(!test::default_init_test< vector > >()){ std::cerr << "Default init test failed" << std::endl; return 1; } //////////////////////////////////// // Emplace testing //////////////////////////////////// const test::EmplaceOptions Options = (test::EmplaceOptions)(test::EMPLACE_BACK | test::EMPLACE_BEFORE); if(!boost::container::test::test_emplace< vector, Options>()){ return 1; } //////////////////////////////////// // Allocator propagation testing //////////////////////////////////// if(!boost::container::test::test_propagate_allocator()){ return 1; } //////////////////////////////////// // Initializer lists testing //////////////////////////////////// if(!boost::container::test::test_vector_methods_with_initializer_list_as_argument_for< boost::container::vector >()) { return 1; } return 0; }