65     value_type elem;  in examine()  local
68     REQUIRE((q2.empty() && !q2.size() && !q2.try_pop(elem)));  in examine()
71     for (it1 = vec_sorted.rbegin(); q1.try_pop(elem); ++it1) {  in examine()
72         REQUIRE(utils::IsEqual{}(elem, *it1));  in examine()
74             QueuePushHelper<HasCopyCtor>::push(q2, elem);  in examine()
76             QueuePushHelper<HasCopyCtor>::push(q2, std::move(elem));  in examine()
86     for (it1 = vec_sorted.rbegin(); q1.try_pop(elem); ++it1)  in examine()
87         REQUIRE(utils::IsEqual{}(elem, *it1));  in examine()
258         T elem = my_min + T(int(thread_id));  in operator()  local
261             push_selector(*q, elem, i);  in operator()
262             if (elem == my_max) elem = my_min;  in operator()
263             elem = elem + T(int(n_thread));  in operator()
281         T elem(my_max), last;  in operator()
284             while(q->try_pop(elem)) {  in operator()
285                 REQUIRE_MESSAGE(!less_than(last, elem), "Failed pop/priority test in EmptyBody");  in operator()
286                 last = elem;  in operator()
287                 elem = my_max;  in operator()
305         T elem = T(int(thread_id + 1));  in operator()  local
307             push_selector(*q, elem, i);  in operator()
308             q->try_pop(elem);  in operator()