Google OR-Tools: AdjustablePriorityQueue< T, Comp
template<typename T, typename Comp = std::less<T>>
class AdjustablePriorityQueue< T, Comp >
Definition at line 34 of file adjustable_priority_queue.h.
#include <adjustable_priority_queue.h>
Public Member Functions | |
| AdjustablePriorityQueue ()=default | |
| AdjustablePriorityQueue (const Comp &c) | |
| AdjustablePriorityQueue (const AdjustablePriorityQueue &)=delete | |
| AdjustablePriorityQueue & | operator= (const AdjustablePriorityQueue &)=delete |
| AdjustablePriorityQueue (AdjustablePriorityQueue &&)=default | |
| AdjustablePriorityQueue & | operator= (AdjustablePriorityQueue &&)=default |
| void | Add (T *val) |
| void | Remove (T *val) |
| bool | Contains (const T *val) const |
| void | NoteChangedPriority (T *val) |
| T * | Top () |
| const T * | Top () const |
| void | AllTop (std::vector< T * > *topvec) |
| void | Pop () |
| int | Size () const |
| int | Capacity () const |
| void | SetCapacity (size_t c) |
| bool | IsEmpty () const |
| void | Clear () |
| void | CheckValid () |
| const std::vector< T * > * | Raw () const |
template<typename T, typename Comp = std::less<T>>
◆ AdjustablePriorityQueue() [2/4]
template<typename T, typename Comp = std::less<T>>
◆ AdjustablePriorityQueue() [3/4]
template<typename T, typename Comp = std::less<T>>
◆ AdjustablePriorityQueue() [4/4]
template<typename T, typename Comp = std::less<T>>
◆ Add()
template<typename T, typename Comp = std::less<T>>
◆ AllTop()
template<typename T, typename Comp = std::less<T>>
◆ Capacity()
template<typename T, typename Comp = std::less<T>>
◆ CheckValid()
template<typename T, typename Comp = std::less<T>>
◆ Clear()
template<typename T, typename Comp = std::less<T>>
◆ Contains()
template<typename T, typename Comp = std::less<T>>
◆ IsEmpty()
template<typename T, typename Comp = std::less<T>>
◆ NoteChangedPriority()
template<typename T, typename Comp = std::less<T>>
◆ operator=() [1/2]
template<typename T, typename Comp = std::less<T>>
◆ operator=() [2/2]
template<typename T, typename Comp = std::less<T>>
◆ Pop()
template<typename T, typename Comp = std::less<T>>
◆ Raw()
template<typename T, typename Comp = std::less<T>>
◆ Remove()
template<typename T, typename Comp = std::less<T>>
◆ SetCapacity()
template<typename T, typename Comp = std::less<T>>
◆ Size()
template<typename T, typename Comp = std::less<T>>
◆ Top() [1/2]
template<typename T, typename Comp = std::less<T>>
◆ Top() [2/2]
template<typename T, typename Comp = std::less<T>>
The documentation for this class was generated from the following file:
- ortools/base/adjustable_priority_queue.h