ranges-compl.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>
* Guido Tack <tack@gecode.org>
*
* Copyright:
* Guido Tack, 2004
* Christian Schulte, 2005
*
* 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<int UMIN, int UMAX, class I>
class Compl : public MinMax {
protected:
I i;
void start(void);
public:
Compl(void);
Compl(I& i);
void init(I& i);
void operator ++(void);
};
template<class I>
class ComplVal : public MinMax {
protected:
int UMIN, UMAX;
I i;
void start(void);
public:
ComplVal(void);
ComplVal(int umin, int umax, I& i);
void init(int umin, int umax, I& i);
void operator ++(void);
};
template<int UMIN, int UMAX, class I>
forceinline void
Compl<UMIN,UMAX,I>::start(void) {
if (i()) {
assert((i.min() >= UMIN) && (i.max() <= UMAX));
if (i.min() > UMIN) {
mi = UMIN;
ma = i.min()-1;
} else if (i.max() < UMAX) {
mi = i.max()+1;
++i;
ma = i() ? (i.min()-1) : UMAX;
} else {
finish();
}
} else {
mi = UMIN;
ma = UMAX;
}
}
template<int UMIN, int UMAX, class I>
forceinline
Compl<UMIN,UMAX,I>::Compl(void) {}
template<int UMIN, int UMAX, class I>
forceinline
Compl<UMIN,UMAX,I>::Compl(I& i0) : i(i0) {
start();
}
template<int UMIN, int UMAX, class I>
forceinline void
Compl<UMIN,UMAX,I>::init(I& i0) {
i=i0; start();
}
template<int UMIN, int UMAX, class I>
forceinline void
Compl<UMIN,UMAX,I>::operator ++(void) {
assert(!i() || (i.max() <= UMAX));
if (i() && (i.max() < UMAX)) {
mi = i.max()+1;
++i;
ma = i() ? (i.min()-1) : UMAX;
} else {
finish();
}
}
template<class I>
forceinline void
ComplVal<I>::start(void) {
if (i()) {
assert((i.min() >= UMIN) && (i.max() <= UMAX));
if (i.min() > UMIN) {
mi = UMIN;
ma = i.min()-1;
} else if (i.max() < UMAX) {
mi = i.max()+1;
++i;
ma = i() ? (i.min()-1) : UMAX;
} else {
finish();
}
} else {
mi = UMIN;
ma = UMAX;
}
}
template<class I>
forceinline
ComplVal<I>::ComplVal(void) {}
template<class I>
forceinline
ComplVal<I>::ComplVal(int umin, int umax, I& i0)
: UMIN(umin), UMAX(umax), i(i0) {
start();
}
template<class I>
forceinline void
ComplVal<I>::init(int umin, int umax, I& i0) {
UMIN=umin; UMAX=umax; i=i0; start();
}
template<class I>
forceinline void
ComplVal<I>::operator ++(void) {
assert(!i() || (i.max() <= UMAX));
if (i() && (i.max() < UMAX)) {
mi = i.max()+1;
++i;
ma = i() ? (i.min()-1) : UMAX;
} else {
finish();
}
}
}}}
// STATISTICS: iter-any
Gecode::Iter::Ranges::ComplVal::i
I i
Iterator to compute complement for.
Definition ranges-compl.hpp:90
Gecode::Iter::Ranges::ComplVal::init
void init(int umin, int umax, I &i)
Initialize with iterator i.
Definition ranges-compl.hpp:196
Gecode::Iter::Ranges::ComplVal::start
void start(void)
Initialize.
Definition ranges-compl.hpp:164
Gecode::Iter::Ranges::ComplVal::ComplVal
ComplVal(void)
Default constructor.
Definition ranges-compl.hpp:185
Gecode::Iter::Ranges::ComplVal::UMAX
int UMAX
Definition ranges-compl.hpp:88
Gecode::Iter::Ranges::ComplVal::operator++
void operator++(void)
Move iterator to next range (if possible).
Definition ranges-compl.hpp:202
Gecode::Iter::Ranges::ComplVal::UMIN
int UMIN
Values describing the universe set.
Definition ranges-compl.hpp:88
Gecode::Iter::Ranges::Compl::start
void start(void)
Initialize.
Definition ranges-compl.hpp:114
Gecode::Iter::Ranges::Compl::i
I i
Iterator to compute complement for.
Definition ranges-compl.hpp:52
Gecode::Iter::Ranges::Compl::init
void init(I &i)
Initialize with iterator i.
Definition ranges-compl.hpp:145
Gecode::Iter::Ranges::Compl::Compl
Compl(void)
Default constructor.
Definition ranges-compl.hpp:135
Gecode::Iter::Ranges::Compl::operator++
void operator++(void)
Move iterator to next range (if possible).
Definition ranges-compl.hpp:151
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
forceinline
#define forceinline
Definition config.hpp:187