OR-Tools  8.2
AdjustablePriorityQueue< T, Comp >

Detailed Description

template<typename T, typename Comp = std::less<T>>
class AdjustablePriorityQueue< T, Comp >

Definition at line 38 of file adjustable_priority_queue.h.

Public Member Functions

 AdjustablePriorityQueue ()
 
 AdjustablePriorityQueue (const Comp &c)
 
 AdjustablePriorityQueue (const AdjustablePriorityQueue &)=delete
 
AdjustablePriorityQueueoperator= (const AdjustablePriorityQueue &)=delete
 
 AdjustablePriorityQueue (AdjustablePriorityQueue &&)=default
 
AdjustablePriorityQueueoperator= (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
 

Constructor & Destructor Documentation

◆ AdjustablePriorityQueue() [1/4]

Definition at line 42 of file adjustable_priority_queue.h.

◆ AdjustablePriorityQueue() [2/4]

AdjustablePriorityQueue ( const Comp &  c)
inline

Definition at line 43 of file adjustable_priority_queue.h.

◆ AdjustablePriorityQueue() [3/4]

AdjustablePriorityQueue ( const AdjustablePriorityQueue< T, Comp > &  )
delete

◆ AdjustablePriorityQueue() [4/4]

AdjustablePriorityQueue ( AdjustablePriorityQueue< T, Comp > &&  )
default

Member Function Documentation

◆ Add()

void Add ( T *  val)
inline

Definition at line 49 of file adjustable_priority_queue.h.

◆ AllTop()

void AllTop ( std::vector< T * > *  topvec)
inline

Definition at line 91 of file adjustable_priority_queue.h.

◆ Capacity()

int Capacity ( ) const
inline

Definition at line 122 of file adjustable_priority_queue.h.

◆ CheckValid()

void CheckValid ( )
inline

Definition at line 133 of file adjustable_priority_queue.h.

◆ Clear()

void Clear ( )
inline

Definition at line 129 of file adjustable_priority_queue.h.

◆ Contains()

bool Contains ( const T *  val) const
inline

Definition at line 69 of file adjustable_priority_queue.h.

◆ IsEmpty()

bool IsEmpty ( ) const
inline

Definition at line 127 of file adjustable_priority_queue.h.

◆ NoteChangedPriority()

void NoteChangedPriority ( T *  val)
inline

Definition at line 74 of file adjustable_priority_queue.h.

◆ operator=() [1/2]

AdjustablePriorityQueue & operator= ( AdjustablePriorityQueue< T, Comp > &&  )
default

◆ operator=() [2/2]

AdjustablePriorityQueue & operator= ( const AdjustablePriorityQueue< T, Comp > &  )
delete

◆ Pop()

void Pop ( )
inline

Definition at line 117 of file adjustable_priority_queue.h.

◆ Raw()

const std::vector< T * > * Raw ( ) const
inline

Definition at line 151 of file adjustable_priority_queue.h.

◆ Remove()

void Remove ( T *  val)
inline

Definition at line 56 of file adjustable_priority_queue.h.

◆ SetCapacity()

void SetCapacity ( size_t  c)
inline

Definition at line 125 of file adjustable_priority_queue.h.

◆ Size()

int Size ( ) const
inline

Definition at line 119 of file adjustable_priority_queue.h.

◆ Top() [1/2]

T * Top ( )
inline

Definition at line 87 of file adjustable_priority_queue.h.

◆ Top() [2/2]

const T * Top ( ) const
inline

Definition at line 89 of file adjustable_priority_queue.h.


The documentation for this class was generated from the following file: