////////////////////////////////////////////////////////////////////////////// // // (C) Copyright Ion Gaztanaga 2004-2012. 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 #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" using namespace boost::container; namespace boost { namespace container { //Explicit instantiation to detect compilation errors template class boost::container::vector >; template class boost::container::vector >; template class boost::container::vector >; }} 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 wrapped int typedef test::expand_bwd_test_allocator int_holder_allocator_type; typedef vector int_holder_vector; if(!test::test_all_expand_bwd()) return 1; //Now user defined bigger wrapped int typedef test::expand_bwd_test_allocator triple_int_holder_allocator_type; typedef vector triple_int_holder_vector; if(!test::test_all_expand_bwd()) return 1; return 0; } class recursive_vector { public: int id_; vector vector_; }; void recursive_vector_test()//Test for recursive types { vector recursive_vector_vector; } enum Test { zero, one, two, three, four, five, six }; 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] = 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); } typedef vector MyVector; typedef vector MyMoveVector; typedef vector MyCopyMoveVector; typedef vector MyCopyVector; typedef vector MyEnumVector; if(test::vector_test()) return 1; if(test::vector_test()) return 1; if(test::vector_test()) return 1; if(test::vector_test()) return 1; if(test_expand_bwd()) return 1; MyEnumVector v; Test t; v.push_back(t); v.push_back(::boost::move(t)); v.push_back(Test()); const test::EmplaceOptions Options = (test::EmplaceOptions)(test::EMPLACE_BACK | test::EMPLACE_BEFORE); if(!boost::container::test::test_emplace < vector, Options>()) return 1; if(!boost::container::test::test_propagate_allocator()) return 1; return 0; } #include