ranges-map.hpp
Go to the documentation of this file.
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Christian Schulte, 2008
*
* This file is part of Gecode, the generic constraint
* development environment:
* http://www.gecode.org
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
*/
namespace Gecode { namespace Iter { namespace Ranges {
template<class I, class M, bool strict=true>
class Map {
public:
Map(void);
Map(I& i);
Map(I& i, const M& m);
void init(I& i);
void init(I& i, const M& m);
bool operator ()(void) const;
void operator ++(void);
int min(void) const;
int max(void) const;
unsigned int width(void) const;
};
template<class I, class M>
class Map<I,M,false> : public MinMax {
protected:
I i;
M m;
void next(void);
public:
Map(void);
Map(I& i);
Map(I& i, const M& m);
void init(I& i);
void init(I& i, const M& m);
void operator ++(void);
};
template<class I, class M>
class Map<I,M,true> {
protected:
I i;
M m;
public:
Map(void);
Map(I& i);
Map(I& i, const M& m);
void init(I& i);
void init(I& i, const M& m);
bool operator ()(void) const;
void operator ++(void);
int min(void) const;
int max(void) const;
unsigned int width(void) const;
};
template<class I, class M>
forceinline
Map<I,M,false>::Map(void) {}
template<class I, class M>
forceinline void
Map<I,M,false>::next(void) {
if (i()) {
mi = m.min(i.min());
ma = m.max(i.max());
++i;
while (i() && (ma+1 >= m.min(i.min()))) {
ma = m.max(i.max()); ++i;
}
} else {
finish();
}
}
template<class I, class M>
forceinline void
Map<I,M,false>::init(I& i0) {
i=i0; next();
}
template<class I, class M>
forceinline void
Map<I,M,false>::init(I& i0, const M& m0) {
i=i0; m=m0; next();
}
template<class I, class M>
forceinline
Map<I,M,false>::Map(I& i0) : i(i0) {
next();
}
template<class I, class M>
forceinline
Map<I,M,false>::Map(I& i0, const M& m0) : i(i0), m(m0) {
next();
}
template<class I, class M>
forceinline void
Map<I,M,false>::operator ++(void) {
next();
}
template<class I, class M>
forceinline
Map<I,M,true>::Map(void) {}
template<class I, class M>
forceinline void
Map<I,M,true>::init(I& i0) {
i=i0;
}
template<class I, class M>
forceinline void
Map<I,M,true>::init(I& i0, const M& m0) {
i=i0; m=m0;
}
template<class I, class M>
forceinline
Map<I,M,true>::Map(I& i0) : i(i0) {}
template<class I, class M>
forceinline
Map<I,M,true>::Map(I& i0, const M& m0) : i(i0), m(m0) {}
template<class I, class M>
forceinline bool
Map<I,M,true>::operator ()(void) const {
return i();
}
template<class I, class M>
forceinline void
Map<I,M,true>::operator ++(void) {
++i;
}
template<class I, class M>
forceinline int
Map<I,M,true>::min(void) const {
return m.min(i.min());
}
template<class I, class M>
forceinline int
Map<I,M,true>::max(void) const {
return m.max(i.max());
}
template<class I, class M>
forceinline unsigned int
Map<I,M,true>::width(void) const {
return static_cast<unsigned int>(max()-min())+1;
}
}}}
// STATISTICS: iter-any
Gecode::Iter::Ranges::Map< I, M, false >::i
I i
Input range.
Definition ranges-map.hpp:85
Gecode::Iter::Ranges::Map< I, M, false >::Map
Map(void)
Default constructor.
Definition ranges-map.hpp:157
Gecode::Iter::Ranges::Map< I, M, false >::next
void next(void)
Find next mapped range.
Definition ranges-map.hpp:161
Gecode::Iter::Ranges::Map< I, M, false >::m
M m
Map for ranges.
Definition ranges-map.hpp:87
Gecode::Iter::Ranges::Map< I, M, true >::i
I i
Input range iterator.
Definition ranges-map.hpp:117
Gecode::Iter::Ranges::Map< I, M, true >::Map
Map(void)
Default constructor.
Definition ranges-map.hpp:206
Gecode::Iter::Ranges::Map< I, M, true >::m
M m
Map object.
Definition ranges-map.hpp:119
Gecode::Iter::Ranges::Map::Map
Map(I &i, const M &m)
Initialize with ranges from i and map m.
Gecode::Iter::Ranges::Map::operator()
bool operator()(void) const
Test whether iterator is still at a range or done.
Gecode::Iter::Ranges::Map::init
void init(I &i, const M &m)
Initialize with ranges from i and map m.
Gecode::Iter::Ranges::Map::init
void init(I &i)
Initialize with ranges from i.
Gecode::Iter::Ranges::Map::min
int min(void) const
Return smallest value of range.
Gecode::Iter::Ranges::Map::width
unsigned int width(void) const
Return width of range (distance between minimum and maximum).
Gecode::Iter::Ranges::Map::operator++
void operator++(void)
Move iterator to next range (if possible).
Gecode::Iter::Ranges::Map::max
int max(void) const
Return largest value of range.
Gecode::Iter::Ranges::Map::Map
Map(I &i)
Initialize with ranges from i.
Gecode::Iter::Ranges::Map::Map
Map(void)
Default constructor.
Gecode::Iter::Ranges::MinMax::ma
int ma
Maximum of current range.
Definition ranges-minmax.hpp:52
Gecode::Iter::Ranges::MinMax::mi
int mi
Minimum of current range.
Definition ranges-minmax.hpp:50
Gecode::Iter::Ranges::MinMax::MinMax
MinMax(void)
Default constructor.
Definition ranges-minmax.hpp:87
Gecode::Iter::Ranges::MinMax::finish
void finish(void)
Set range such that iteration stops
Definition ranges-minmax.hpp:82
Gecode::Iter::Ranges
Range iterators.
Definition iter.hh:43
Gecode::Iter
Range and value iterators.
Definition iter.hh:41
Gecode
Gecode toplevel namespace
Gecode::min
void min(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Definition arithmetic.cpp:67
Gecode::max
void max(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Definition arithmetic.cpp:49
forceinline
#define forceinline
Definition config.hpp:187