Lines Matching refs:priority_queue

33 a priority. The STL provides a single template class =std::priority_queue=, which only provides a l…
58     class priority_queue
74         explicit priority_queue(value_compare const & = value_compare());
75         priority_queue(priority_queue const &);
76         priority_queue& operator=(priority_queue const &);
77         priority_queue(priority_queue &&);                  // move semantics (C++11 only)
78         priority_queue& operator=(priority_queue &&);       // move semantics (C++11 only)
151 Except for [classref boost::heap::priority_queue] all _heap_ data structures support ordered iterat…
297     [[[classref boost::heap::priority_queue]]
299 …The [classref boost::heap::priority_queue priority_queue] class is a wrapper to the stl heap funct…
349 …[[[classref boost::heap::priority_queue]]       [[^O(1)]]   [O(log(N))]     [O(log(N))] [n/a]     …