Gecode::Iter::Ranges::Map< I, M, true > Class Template Reference
Specialized mapping of ranges for strict maps. More...
#include <ranges-map.hpp>
Protected Attributes | |
| I | i |
| Input range iterator. | |
| M | m |
| Map object. | |
Constructors and initialization | |
| Map (void) | |
| Default constructor. | |
| Map (I &i) | |
| Initialize with ranges from i. | |
| Map (I &i, const M &m) | |
| Initialize with ranges from i and map m. | |
| void | init (I &i) |
| Initialize with ranges from i. | |
| void | init (I &i, const M &m) |
| Initialize with ranges from i and map m. | |
Iteration control | |
| bool | operator() (void) const |
| Test whether iterator is still at a range or done. | |
| void | operator++ (void) |
| Move iterator to next range (if possible). | |
Range access | |
| int | min (void) const |
| Return smallest value of range. | |
| int | max (void) const |
| Return largest value of range. | |
| unsigned int | width (void) const |
| Return width of range (distance between minimum and maximum). | |
Detailed Description
template<class I, class M>
class Gecode::Iter::Ranges::Map< I, M, true >
Specialized mapping of ranges for strict maps.
Definition at line 124 of file ranges-map.hpp.
Constructor & Destructor Documentation
template<class I , class M >
| Gecode::Iter::Ranges::Map< I, M, true >::Map | ( | void | ) | [inline] |
template<class I , class M >
| Gecode::Iter::Ranges::Map< I, M, true >::Map | ( | I & | i | ) | [inline] |
template<class I , class M >
| Gecode::Iter::Ranges::Map< I, M, true >::Map | ( | I & | i, | |
| const M & | m | |||
| ) | [inline] |
Member Function Documentation
template<class I , class M >
| void Gecode::Iter::Ranges::Map< I, M, true >::init | ( | I & | i | ) | [inline] |
template<class I , class M >
| void Gecode::Iter::Ranges::Map< I, M, true >::init | ( | I & | i, | |
| const M & | m | |||
| ) | [inline] |
template<class I , class M >
| bool Gecode::Iter::Ranges::Map< I, M, true >::operator() | ( | void | ) | const [inline] |
template<class I , class M >
| void Gecode::Iter::Ranges::Map< I, M, true >::operator++ | ( | void | ) | [inline] |
template<class I , class M >
| int Gecode::Iter::Ranges::Map< I, M, true >::min | ( | void | ) | const [inline] |
template<class I , class M >
| int Gecode::Iter::Ranges::Map< I, M, true >::max | ( | void | ) | const [inline] |
template<class I , class M >
| unsigned int Gecode::Iter::Ranges::Map< I, M, true >::width | ( | void | ) | const [inline] |
Return width of range (distance between minimum and maximum).
Definition at line 262 of file ranges-map.hpp.
Member Data Documentation
template<class I , class M >
I Gecode::Iter::Ranges::Map< I, M, true >::i [protected] |
template<class I , class M >
M Gecode::Iter::Ranges::Map< I, M, true >::m [protected] |
The documentation for this class was generated from the following file:
- gecode/iter/ranges-map.hpp (Revision: 7989)
