62         for (auto it = cont.begin(); std::next(it) != cont.end();) {  in check_container_order()
93         l_bound_check = cont.end();  in test_ordered_methods()
94         u_bound_check = cont.end();  in test_ordered_methods()
95         for (auto it = cont.begin(); it != cont.end(); ++it){  in test_ordered_methods()
96             if (!val_comp(*it, Value<Container>::make(key)) && l_bound_check == cont.end()) {  in test_ordered_methods()
99             if (val_comp(Value<Container>::make(key), *it) && u_bound_check == cont.end()) {  in test_ordered_methods()
167                                              Iterator begin, Iterator end )  in construct_container()
170         new (ptr) OrderedType(begin, end);  in construct_container()
176                                              Iterator begin, Iterator end, const Allocator& alloc )  in construct_container()
179         new (ptr) OrderedType(begin, end, typename OrderedType::key_compare(), alloc);  in construct_container()
184     static bool equal( const OrderedType& c, Iterator begin, Iterator end ) {  in equal()
185         bool equal_sizes = std::size_t(std::distance(begin, end)) == c.size();  in equal()
187         for (Iterator it = begin; it != end; ++it) {  in equal()
218     c1.insert(lst.begin(), lst.end());
229     c2.insert(it, lst.end());
234     c2_alloc.insert(it, lst.end());
239     c2_comp_alloc.insert(it, lst.end());
252     c4.insert(lst.begin(), lst.end());
257     c5.insert(lst.begin(), lst.end());
262     c6.insert(lst.begin(), lst.end());
266     Table c7(c1.begin(), c1.end());
270     Table c8(c1.begin(), c1.end(), allocator);
274     Table c9(c1.begin(), c1.end(), compare, allocator);