void test_unordered_multiset<ValueTraits, CacheBegin, CompareHash, Incremental> ::test_insert(std::vector<typename ValueTraits::value_type>& values) { typedef typename ValueTraits::value_type value_type; typedef unordered_multiset <value_type , value_traits<ValueTraits> , constant_time_size<value_type::constant_time_size> , cache_begin<CacheBegin> , compare_hash<CompareHash> , incremental<Incremental> > unordered_multiset_type; typedef typename unordered_multiset_type::bucket_traits bucket_traits; typedef typename unordered_multiset_type::iterator iterator; typename unordered_multiset_type::bucket_type buckets [BucketSize]; unordered_multiset_type testset(bucket_traits(buckets, BucketSize)); testset.insert(&values[0] + 2, &values[0] + 5); const unordered_multiset_type& const_testset = testset; if(Incremental){ { { int init_values [] = { 4, 5, 1 }; TEST_INTRUSIVE_SEQUENCE( init_values, const_testset.begin() ); } typename unordered_multiset_type::iterator i = testset.begin(); BOOST_TEST (i->value_ == 4); i = testset.insert (values[0]); BOOST_TEST (&*i == &values[0]); i = testset.iterator_to (values[2]); BOOST_TEST (&*i == &values[2]); testset.erase(i); { int init_values [] = { 5, 1, 3 }; TEST_INTRUSIVE_SEQUENCE( init_values, const_testset.begin() ); } testset.clear(); testset.insert(&values[0], &values[0] + values.size()); { int init_values [] = { 4, 5, 1, 2, 2, 3 }; TEST_INTRUSIVE_SEQUENCE( init_values, const_testset.begin() ); } BOOST_TEST (testset.erase(1) == 1); BOOST_TEST (testset.erase(2) == 2); BOOST_TEST (testset.erase(3) == 1); BOOST_TEST (testset.erase(4) == 1); BOOST_TEST (testset.erase(5) == 1); BOOST_TEST (testset.empty() == true); //Now with a single bucket typename unordered_multiset_type::bucket_type single_bucket[1]; unordered_multiset_type testset2(bucket_traits(single_bucket, 1)); testset2.insert(&values[0], &values[0] + values.size()); BOOST_TEST (testset2.erase(5) == 1); BOOST_TEST (testset2.erase(2) == 2); BOOST_TEST (testset2.erase(1) == 1); BOOST_TEST (testset2.erase(4) == 1); BOOST_TEST (testset2.erase(3) == 1); BOOST_TEST (testset2.empty() == true); } } else{ { { int init_values [] = { 1, 4, 5 }; TEST_INTRUSIVE_SEQUENCE( init_values, const_testset.begin() ); } typename unordered_multiset_type::iterator i = testset.begin(); BOOST_TEST (i->value_ == 1); i = testset.insert (values[0]); BOOST_TEST (&*i == &values[0]); i = testset.iterator_to (values[2]); BOOST_TEST (&*i == &values[2]); testset.erase(i); { int init_values [] = { 1, 3, 5 }; TEST_INTRUSIVE_SEQUENCE( init_values, const_testset.begin() ); } testset.clear(); testset.insert(&values[0], &values[0] + values.size()); { int init_values [] = { 1, 2, 2, 3, 4, 5 }; TEST_INTRUSIVE_SEQUENCE( init_values, const_testset.begin() ); } BOOST_TEST (testset.erase(1) == 1); BOOST_TEST (testset.erase(2) == 2); BOOST_TEST (testset.erase(3) == 1); BOOST_TEST (testset.erase(4) == 1); BOOST_TEST (testset.erase(5) == 1); BOOST_TEST (testset.empty() == true); //Now with a single bucket typename unordered_multiset_type::bucket_type single_bucket[1]; unordered_multiset_type testset2(bucket_traits(single_bucket, 1)); testset2.insert(&values[0], &values[0] + values.size()); BOOST_TEST (testset2.erase(5) == 1); BOOST_TEST (testset2.erase(2) == 2); BOOST_TEST (testset2.erase(1) == 1); BOOST_TEST (testset2.erase(4) == 1); BOOST_TEST (testset2.erase(3) == 1); BOOST_TEST (testset2.empty() == true); } } { //Now erase just one per loop const int random_init[] = { 3, 2, 4, 1, 5, 2, 2 }; const unsigned int random_size = sizeof(random_init)/sizeof(random_init[0]); typename unordered_multiset_type::bucket_type single_bucket[1]; for(unsigned int i = 0, max = random_size; i != max; ++i){ std::vector<typename ValueTraits::value_type> data (random_size); for (unsigned int j = 0; j < random_size; ++j) data[j].value_ = random_init[j]; unordered_multiset_type testset_new(bucket_traits(single_bucket, 1)); testset_new.insert(&data[0], &data[0]+max); testset_new.erase(testset_new.iterator_to(data[i])); BOOST_TEST (testset_new.size() == (max -1)); } } { typename unordered_multiset_type::bucket_type buckets [BucketSize]; const unsigned int NumBucketSize = BucketSize; const unsigned int LoadFactor = 3; const unsigned int NumIterations = NumBucketSize*LoadFactor; std::vector<value_type> random_init(NumIterations);//Preserve memory std::vector<value_type> set_tester; set_tester.reserve(NumIterations); //Initialize values for (unsigned int i = 0; i < NumIterations; ++i){ random_init[i].value_ = i*2;//(i/LoadFactor)*LoadFactor; } for(unsigned int initial_pos = 0; initial_pos != (NumIterations+1); ++initial_pos){ for(unsigned int final_pos = initial_pos; final_pos != (NumIterations+1); ++final_pos){ //Create intrusive container inserting values unordered_multiset_type testset ( &random_init[0] , &random_init[0] + random_init.size() , bucket_traits(buckets, NumBucketSize)); BOOST_TEST (testset.size() == random_init.size()); //Obtain the iterator range to erase iterator it_beg_pos = testset.begin(); for(unsigned int it_beg_pos_num = 0; it_beg_pos_num != initial_pos; ++it_beg_pos_num){ ++it_beg_pos; } iterator it_end_pos(it_beg_pos); for(unsigned int it_end_pos_num = 0; it_end_pos_num != (final_pos - initial_pos); ++it_end_pos_num){ ++it_end_pos; } //Erase the same values in both the intrusive and original vector std::size_t erased_cnt = std::distance(it_beg_pos, it_end_pos); //Erase values from the intrusive container testset.erase(it_beg_pos, it_end_pos); BOOST_TEST (testset.size() == (random_init.size()-(final_pos - initial_pos))); //Now test... BOOST_TEST ((random_init.size() - erased_cnt) == testset.size()); //Create an ordered copy of the intrusive container set_tester.insert(set_tester.end(), testset.begin(), testset.end()); std::sort(set_tester.begin(), set_tester.end()); { typename std::vector<value_type>::iterator it = set_tester.begin(), itend = set_tester.end(); typename std::vector<value_type>::iterator random_init_it(random_init.begin()); for( ; it != itend; ++it){ while(!random_init_it->is_linked()) ++random_init_it; BOOST_TEST(*it == *random_init_it); ++random_init_it; } } set_tester.clear(); } } } }