C++ Reference
C++ Reference: Routing
Detailed Description
template<class T>
class operations_research::SimpleRevFIFO< T >
This class represent a reversible FIFO structure.
The main difference w.r.t a standard FIFO structure is that a Solver is given as parameter to the modifiers such that the solver can store the backtrack information Iterator's traversing order should not be changed, as some algorithm depend on it to be consistent. It's main use is to store a list of demons in the various classes of variables.
Definition at line 137 of file constraint_solveri.h.
Classes | |
| class | Iterator |
| This iterator is not stable with respect to deletion. More... | |
Public Member Functions | |
| SimpleRevFIFO () | |
| void | Push (Solver *const s, T val) |
| void | PushIfNotTop (Solver *const s, T val) |
| Pushes the var on top if is not a duplicate of the current top object. More... | |
| const T * | Last () const |
| Returns the last item of the FIFO. More... | |
| T * | MutableLast () |
| const T & | LastValue () const |
| Returns the last value in the FIFO. More... | |
| void | SetLastValue (const T &v) |
| Sets the last value in the FIFO. More... | |
Constructor & Destructor Documentation
◆ SimpleRevFIFO()
|
inline |
Definition at line 167 of file constraint_solveri.h.
Member Function Documentation
◆ Last()
|
inline |
Returns the last item of the FIFO.
Definition at line 189 of file constraint_solveri.h.
◆ LastValue()
|
inline |
Returns the last value in the FIFO.
Definition at line 196 of file constraint_solveri.h.
◆ MutableLast()
|
inline |
Definition at line 193 of file constraint_solveri.h.
◆ Push()
|
inline |
Definition at line 169 of file constraint_solveri.h.
◆ PushIfNotTop()
|
inline |
Pushes the var on top if is not a duplicate of the current top object.
Definition at line 182 of file constraint_solveri.h.
◆ SetLastValue()
|
inline |
Sets the last value in the FIFO.
Definition at line 202 of file constraint_solveri.h.
The documentation for this class was generated from the following files: