55         : mark(0), my_size(0), my_compare(), data(alloc)  in concurrent_priority_queue()
61         : mark(0), my_size(0), my_compare(compare), data(alloc)
67         : mark(0), my_size(0), my_compare(), data(alloc)
69         data.reserve(init_capacity);
74         : mark(0), my_size(0), my_compare(compare), data(alloc)
76         data.reserve(init_capacity);
82         : mark(0), my_compare(compare), data(begin, end, alloc)
86         my_size.store(data.size(), std::memory_order_relaxed);
101           data(other.data)  in concurrent_priority_queue()
108           data(other.data, alloc)  in concurrent_priority_queue()
115           data(std::move(other.data))  in concurrent_priority_queue()
122           data(std::move(other.data), alloc)  in concurrent_priority_queue()
129             data = other.data;
139             data = std::move(other.data);
153         data.assign(begin, end);  in assign()
155         my_size.store(data.size(), std::memory_order_relaxed);  in assign()
207         data.clear();  in clear()
216             swap(data, other.data);  in swap()
225     allocator_type get_allocator() const { return data.get_allocator(); }  in get_allocator()
256         __TBB_ASSERT(mark == data.size(), nullptr);  in handle_operations()
274                 if (mark < data.size() &&  in handle_operations()
275                     my_compare(data[0], data.back()))  in handle_operations()
278                     *(tmp->elem) = std::move(data.back());  in handle_operations()
282                     data.pop_back();  in handle_operations()
283                     __TBB_ASSERT(mark <= data.size(), nullptr);  in handle_operations()
297                         data.push_back(std::move(*(tmp->elem)));  in handle_operations()
315             if (data.empty()) {  in handle_operations()
318                 __TBB_ASSERT(mark <= data.size(), nullptr);  in handle_operations()
319                 if (mark < data.size() &&  in handle_operations()
320                     my_compare(data[0], data.back()))  in handle_operations()
323                     *(tmp->elem) = std::move(data.back());  in handle_operations()
326                     data.pop_back();  in handle_operations()
328                     *(tmp->elem) = std::move(data[0]);  in handle_operations()
338         if (mark < data.size()) heapify();  in handle_operations()
339         __TBB_ASSERT(mark == data.size(), nullptr);  in handle_operations()
345         if (!mark && data.size() > 0) mark = 1;  in heapify()
346         for (; mark < data.size(); ++mark) {  in heapify()
349             value_type to_place = std::move(data[mark]);  in heapify()
352                 if (!my_compare(data[parent], to_place))  in heapify()
354                 data[cur_pos] = std::move(data[parent]);  in heapify()
357             data[cur_pos] = std::move(to_place);  in heapify()
368             if (child + 1 < mark && my_compare(data[child], data[child + 1]))  in reheap()
371             if (my_compare(data[target], data.back()))  in reheap()
373             data[cur_pos] = std::move(data[target]);  in reheap()
377         if (cur_pos != data.size() - 1)  in reheap()
378             data[cur_pos] = std::move(data.back());  in reheap()
379         data.pop_back();  in reheap()
380         if (mark > data.size()) mark = data.size();  in reheap()
388         data.push_back(value);  in push_back_helper_impl()
427     vector_type data;  variable
432         return lhs.data == rhs.data;