Generated on: Thu Mar 29 07:46:58 PDT 2012 for custom file set | ||
|
||
// doxy/ or-tools/ src/ constraint_solver/ |
#include <constraint_solveri.h>
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. | |
const T & | LastValue () const |
Returns the last value in the FIFO. | |
void | SetLastValue (const T &v) |
Sets the last value in the FIFO. | |
Classes | |
struct | Chunk |
class | Iterator |
This iterator is not stable with respect to deletion. More... |
This class represent a reversible FIFO structure. The main diffence w.r.t a standart 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 150 of file constraint_solveri.h.
operations_research::SimpleRevFIFO< T >::SimpleRevFIFO | ( | ) | [inline] |
Definition at line 180 of file constraint_solveri.h.
void operations_research::SimpleRevFIFO< T >::Push | ( | Solver *const | s, | |
T | val | |||
) | [inline] |
Definition at line 182 of file constraint_solveri.h.
void operations_research::SimpleRevFIFO< T >::PushIfNotTop | ( | Solver *const | s, | |
T | val | |||
) | [inline] |
Pushes the var on top if is not a duplicate of the current top object.
Definition at line 195 of file constraint_solveri.h.
const T* operations_research::SimpleRevFIFO< T >::Last | ( | ) | const [inline] |
const T& operations_research::SimpleRevFIFO< T >::LastValue | ( | ) | const [inline] |
void operations_research::SimpleRevFIFO< T >::SetLastValue | ( | const T & | v | ) | [inline] |