52       multiset_type testset(values.begin(), values.end());  in test_all()  local
53       test::test_container(testset);  in test_all()
54       testset.clear();  in test_all()
55       testset.insert(values.begin(), values.end());  in test_all()
56       test::test_common_unordered_and_associative_container(testset, values);  in test_all()
57       testset.clear();  in test_all()
58       testset.insert(values.begin(), values.end());  in test_all()
59       test::test_associative_container(testset, values);  in test_all()
60       testset.clear();  in test_all()
61       testset.insert(values.begin(), values.end());  in test_all()
62       test::test_non_unique_container(testset, values);  in test_all()
83    multiset_type testset;  in test_impl()  local
85       testset.insert (values[i]);  in test_impl()
87    testset.erase (testset.iterator_to (values[0]));  in test_impl()
88    testset.erase (testset.iterator_to (values[1]));  in test_impl()
89    testset.insert (values[1]);  in test_impl()
91    testset.erase (testset.iterator_to (values[2]));  in test_impl()
92    testset.erase (testset.iterator_to (values[3]));  in test_impl()
128    multiset_type testset;  in test_insert()  local
129    testset.insert(values.begin() + 2, values.begin() + 5);  in test_insert()
130    testset.check();  in test_insert()
132       TEST_INTRUSIVE_SEQUENCE( init_values, testset.begin() );  }  in test_insert()
134    typename multiset_type::iterator i = testset.begin();  in test_insert()
137    i = testset.insert (i, values[0]);  in test_insert()
138    testset.check();  in test_insert()
142       TEST_INTRUSIVE_SEQUENCE( init_values, testset.rbegin() );  }  in test_insert()
144    i = testset.iterator_to (values[2]);  in test_insert()
150    testset.erase(i);  in test_insert()
151    testset.check();  in test_insert()
154       TEST_INTRUSIVE_SEQUENCE( init_values, testset.begin() );  }  in test_insert()
233    multiset_type testset (values.begin(), values.end());  in test_find()  local
241       iterator i = testset.find (key_of_value()(cmp_val));  in test_find()
242       BOOST_TEST (i == testset.find (2, any_less()));  in test_find()
245       std::pair<iterator,iterator> range = testset.equal_range (key_of_value()(cmp_val));  in test_find()
246       BOOST_TEST(range == testset.equal_range (2, any_less()));  in test_find()
253       BOOST_TEST (testset.find(key_of_value()(cmp_val)) == testset.end());  in test_find()
254       BOOST_TEST (testset.find (7, any_less()) == testset.end());  in test_find()
257       const multiset_type &const_testset = testset;  in test_find()
267 …range = testset.bounded_range (key_of_value()(cmp_val_lower), key_of_value()(cmp_val_upper), true,…  in test_find()
268       BOOST_TEST (range == testset.bounded_range (1, 2, any_less(), true, true));  in test_find()
284 …range = testset.bounded_range (key_of_value()(cmp_val_lower), key_of_value()(cmp_val_upper), true,…  in test_find()
285       BOOST_TEST (range == testset.bounded_range (1, 3, any_less(), true, false));  in test_find()
302 …range = testset.bounded_range (key_of_value()(cmp_val_lower), key_of_value()(cmp_val_upper), false…  in test_find()
303       BOOST_TEST (range == testset.bounded_range (1, 2, any_less(), false, false));  in test_find()