Gecode::Set::RangeList Class Reference
Inherits Gecode::FreeList.Detailed Description
Lists of ranges (intervals).
Definition at line 41 of file var.icc.
Constructors | |
| RangeList (void) | |
| Default constructor (noop). | |
| RangeList (int min, int max, RangeList *p, RangeList *n) | |
| Initialize with minimum min and maximum max and predecessor p and successor n. | |
Access | |
| int | min (void) const |
| Return minimum. | |
| int | max (void) const |
| Return maximum. | |
| unsigned int | width (void) const |
| Return width (distance between maximum and minimum). | |
| RangeList * | next (const RangeList *p) const |
| Return next element (from previous p). | |
| RangeList * | prev (const RangeList *n) const |
| Return previous element (from next n). | |
Update | |
| void | min (int n) |
| Set minimum to n. | |
| void | max (int n) |
| Set maximum to n. | |
| void | prevnext (RangeList *p, RangeList *n) |
| Set previous element to p and next element to n. | |
| void | next (RangeList *o, RangeList *n) |
| Set next element from o to n. | |
| void | prev (RangeList *o, RangeList *n) |
| Set previous element from o to n. | |
| void | fix (RangeList *n) |
| Restore simple link to next element (so that it becomes a true free list). | |
Memory management | |
| void | dispose (Space *home, RangeList *p, RangeList *l) |
| Free memory for all elements between this and l (inclusive). | |
| static void * | operator new (size_t s, Space *home) |
| Allocate memory from space. | |
| static void | operator delete (void *) |
| No-op (for exceptions). | |
| static void | operator delete (void *, Space *home) |
| No-op (use dispose instead). | |
Protected Attributes | |
| int | _min |
| Minimum of range. | |
| int | _max |
| Maximum of range. | |
Constructor & Destructor Documentation
| Gecode::Set::RangeList::RangeList | ( | void | ) | [inline] |
Initialize with minimum min and maximum max and predecessor p and successor n.
Definition at line 40 of file integerset.icc.
Member Function Documentation
| int Gecode::Set::RangeList::min | ( | void | ) | const [inline] |
| int Gecode::Set::RangeList::max | ( | void | ) | const [inline] |
| unsigned int Gecode::Set::RangeList::width | ( | void | ) | const [inline] |
| void Gecode::Set::RangeList::min | ( | int | n | ) | [inline] |
| void Gecode::Set::RangeList::max | ( | int | n | ) | [inline] |
| void Gecode::Set::RangeList::fix | ( | RangeList * | n | ) | [inline] |
Restore simple link to next element (so that it becomes a true free list).
Definition at line 68 of file integerset.icc.
Free memory for all elements between this and l (inclusive).
p must be the pointer to the previous element of this.
Definition at line 110 of file integerset.icc.
| void * Gecode::Set::RangeList::operator new | ( | size_t | s, | |
| Space * | home | |||
| ) | [inline, static] |
| void Gecode::Set::RangeList::operator delete | ( | void * | ) | [inline, static] |
| void Gecode::Set::RangeList::operator delete | ( | void * | , | |
| Space * | home | |||
| ) | [inline, static] |
Member Data Documentation
int Gecode::Set::RangeList::_min [protected] |
int Gecode::Set::RangeList::_max [protected] |
The documentation for this class was generated from the following files:
- gecode/set/var.icc (Revision: 3568)
- gecode/set/var/integerset.icc (Revision: 3413)
