![]() |
Google OR-Tools v9.14
a fast and portable software suite for combinatorial optimization
|
#include <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. | |
const T * | Last () const |
Returns the last item of the FIFO. | |
T * | MutableLast () |
const T & | LastValue () const |
Returns the last value in the FIFO. | |
void | SetLastValue (const T &v) |
Sets the last value in the FIFO. |
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 153 of file constraint_solveri.h.
|
inline |
Definition at line 183 of file constraint_solveri.h.
|
inline |
Returns the last item of the FIFO.
Definition at line 205 of file constraint_solveri.h.
|
inline |
Returns the last value in the FIFO.
Definition at line 212 of file constraint_solveri.h.
|
inline |
Definition at line 209 of file constraint_solveri.h.
|
inline |
Definition at line 185 of file constraint_solveri.h.
|
inline |
Pushes the var on top if is not a duplicate of the current top object.
Definition at line 198 of file constraint_solveri.h.
|
inline |
Sets the last value in the FIFO.
Definition at line 218 of file constraint_solveri.h.