62         for (auto it = cont.begin(); std::next(it) != cont.end();) {  in check_container_order()  local
63             auto pr_it = it++;  in check_container_order()
64             REQUIRE_MESSAGE(check_order(*pr_it, *it), "The order of the elements is broken");  in check_container_order()
89         for (auto it = eq_range.first; it != eq_range.second; ++it)  in test_ordered_methods()  local
90             REQUIRE_MESSAGE(*it == Value<Container>::make(key), "equal_range contains wrong value");  in test_ordered_methods()
95         for (auto it = cont.begin(); it != cont.end(); ++it){  in test_ordered_methods()  local
96             if (!val_comp(*it, Value<Container>::make(key)) && l_bound_check == cont.end()) {  in test_ordered_methods()
97                 l_bound_check = it;  in test_ordered_methods()
99             if (val_comp(Value<Container>::make(key), *it) && u_bound_check == cont.end()) {  in test_ordered_methods()
100                 u_bound_check = it;  in test_ordered_methods()
187         for (Iterator it = begin; it != end; ++it) {  in equal()  local
188             if (!c.contains(Value<OrderedType>::key((*it)))) return false;  in equal()
224     auto it = lst.begin();
225     auto init = {*it++, *it++, *it++};
229     c2.insert(it, lst.end());
234     c2_alloc.insert(it, lst.end());
239     c2_comp_alloc.insert(it, lst.end());