
Range iterator for mapping ranges. More...
#include <ranges-map.hpp>
Constructors and initialization | |
| Map (void) | |
| Default constructor. More... | |
| Map (I &i) | |
| Initialize with ranges from i. More... | |
| Map (I &i, const M &m) | |
| Initialize with ranges from i and map m. More... | |
| void | init (I &i) |
| Initialize with ranges from i. More... | |
| void | init (I &i, const M &m) |
| Initialize with ranges from i and map m. More... | |
Iteration control | |
| bool | operator() (void) const |
| Test whether iterator is still at a range or done. More... | |
| void | operator++ (void) |
| Move iterator to next range (if possible) More... | |
Range access | |
| int | min (void) const |
| Return smallest value of range. More... | |
| int | max (void) const |
| Return largest value of range. More... | |
| unsigned int | width (void) const |
| Return width of range (distance between minimum and maximum) More... | |
Range iterator for mapping ranges.
If strict is true, then mapped ranges are not allowed to be adjacent or overlap.
Definition at line 49 of file ranges-map.hpp.
| Gecode::Iter::Ranges::Map< I, M, strict >::Map | ( | void | ) |
Default constructor.
| Gecode::Iter::Ranges::Map< I, M, strict >::Map | ( | I & | i | ) |
Initialize with ranges from i.
| Gecode::Iter::Ranges::Map< I, M, strict >::Map | ( | I & | i, |
| const M & | m | ||
| ) |
Initialize with ranges from i and map m.
| void Gecode::Iter::Ranges::Map< I, M, strict >::init | ( | I & | i | ) |
Initialize with ranges from i.
| void Gecode::Iter::Ranges::Map< I, M, strict >::init | ( | I & | i, |
| const M & | m | ||
| ) |
Initialize with ranges from i and map m.
| bool Gecode::Iter::Ranges::Map< I, M, strict >::operator() | ( | void | ) | const |
Test whether iterator is still at a range or done.
| void Gecode::Iter::Ranges::Map< I, M, strict >::operator++ | ( | void | ) |
Move iterator to next range (if possible)
| int Gecode::Iter::Ranges::Map< I, M, strict >::min | ( | void | ) | const |
Return smallest value of range.
| int Gecode::Iter::Ranges::Map< I, M, strict >::max | ( | void | ) | const |
Return largest value of range.
| unsigned int Gecode::Iter::Ranges::Map< I, M, strict >::width | ( | void | ) | const |
Return width of range (distance between minimum and maximum)