OR-Tools  9.6
Classes | Public Member Functions | List of all members
GlobalCheapestInsertionFilteredHeuristic::NodeEntryQueue

Detailed Description

Definition at line 1075 of file routing_search.cc.

Classes

struct  Entry
 

Public Member Functions

 NodeEntryQueue (int num_nodes)
 
void Clear ()
 
bool IsEmpty () const
 
bool IsEmpty (int64_t insert_after) const
 
Entry * Top ()
 
void Pop ()
 
void ClearInsertions (int64_t insert_after)
 
void PushInsertion (int64_t node, int64_t insert_after, int vehicle, int bucket, int64_t value)
 

Constructor & Destructor Documentation

◆ NodeEntryQueue()

NodeEntryQueue ( int  num_nodes)
inlineexplicit

Definition at line 1098 of file routing_search.cc.

Member Function Documentation

◆ Clear()

void Clear ( )
inline

Definition at line 1100 of file routing_search.cc.

◆ ClearInsertions()

void ClearInsertions ( int64_t  insert_after)
inline

Definition at line 1135 of file routing_search.cc.

◆ IsEmpty() [1/2]

bool IsEmpty ( ) const
inline

Definition at line 1105 of file routing_search.cc.

◆ IsEmpty() [2/2]

bool IsEmpty ( int64_t  insert_after) const
inline

Definition at line 1109 of file routing_search.cc.

◆ Pop()

void Pop ( )
inline

Definition at line 1124 of file routing_search.cc.

◆ PushInsertion()

void PushInsertion ( int64_t  node,
int64_t  insert_after,
int  vehicle,
int  bucket,
int64_t  value 
)
inline

Definition at line 1143 of file routing_search.cc.

◆ Top()

Entry* Top ( )
inline

Definition at line 1113 of file routing_search.cc.

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