Data Abstraction and Problem Solving with C++
Walls and Mirrors
by Frank M. Carrano
c11p642.h
Go to the documentation of this file.00001 00014 template <typename T, typename Container = vector<T>, 00015 typename Compare = less<typename Container::value_type> > 00016 class priority_queue 00017 { 00018 public: 00024 explicit priority_queue(const Compare& cmp = Compare(), 00025 const Container& = Container()) ; 00026 00032 bool empty() const; 00033 00040 size_type size() const; 00041 00047 const value_type& top() const; 00048 00053 void pop(); 00054 00059 void push(const value_type& e); 00060 00061 }; // end std::priority_queue
