Linked index-value pairs. More...
#include <element.hh>
Public Member Functions | |
void | mark (void) |
bool | marked (void) const |
Return whether this pair is marked for removal. |
Public Attributes | |
Idx | idx_next |
The position of the next pair in index order. | |
Idx | val_next |
The position of the next pair in value order. | |
Idx | idx |
The index. | |
Val | val |
The value Mark that this pair should be removed. |
Linked index-value pairs.
Data structure linking pairs of index and value (index,value) where pairs are linked in order of both index and value (to allow for easy removal while keeping both index and value sorted).
Definition at line 67 of file element.hh.
|
inline |
|
inline |
Idx Gecode::Int::Element::Int< V0, V1, Idx, Val >::IdxVal::idx_next |
The position of the next pair in index order.
Definition at line 69 of file element.hh.
Idx Gecode::Int::Element::Int< V0, V1, Idx, Val >::IdxVal::val_next |
The position of the next pair in value order.
Definition at line 70 of file element.hh.
Idx Gecode::Int::Element::Int< V0, V1, Idx, Val >::IdxVal::idx |
The index.
Definition at line 71 of file element.hh.
Val Gecode::Int::Element::Int< V0, V1, Idx, Val >::IdxVal::val |
The value Mark that this pair should be removed.
Definition at line 72 of file element.hh.