ranges-append.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, 2004
*
* 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 J>
class Append : public MinMax {
protected:
I i;
J j;
public:
Append(void);
Append(I& i, J& j);
void init(I& i, J& j);
void operator ++(void);
};
template<class I>
class NaryAppend : public MinMax {
protected:
I* r;
int n;
int active;
public:
NaryAppend(void);
NaryAppend(I* i, int n);
void init(I* i, int n);
void operator ++(void);
};
/*
* Binary Append
*
*/
template<class I, class J>
inline void
Append<I,J>::operator ++(void) {
if (i()) {
mi = i.min(); ma = i.max();
++i;
if (!i() && j() && (j.min() == ma+1)) {
ma = j.max();
++j;
}
} else if (j()) {
mi = j.min(); ma = j.max();
++j;
} else {
finish();
}
}
template<class I, class J>
forceinline
Append<I,J>::Append(void) {}
template<class I, class J>
forceinline
Append<I,J>::Append(I& i0, J& j0)
: i(i0), j(j0) {
if (i() || j())
operator ++();
else
finish();
}
template<class I, class J>
forceinline void
Append<I,J>::init(I& i0, J& j0) {
i = i0; j = j0;
if (i() || j())
operator ++();
else
finish();
}
/*
* Nary Append
*
*/
template<class I>
inline void
NaryAppend<I>::operator ++(void) {
mi = r[active].min();
ma = r[active].max();
++r[active];
while (!r[active]()) {
//Skip empty iterators:
do {
active++;
if (active >= n) {
finish(); return;
}
} while (!r[active]());
if (r[active].min() == ma+1){
ma = r[active].max();
++r[active];
} else {
return;
}
}
}
template<class I>
forceinline
NaryAppend<I>::NaryAppend(void) {}
template<class I>
inline
NaryAppend<I>::NaryAppend(I* r0, int n0)
: r(r0), n(n0), active(0) {
while (active < n && !r[active]())
active++;
if (active < n){
operator ++();
} else {
finish();
}
}
template<class I>
inline void
NaryAppend<I>::init(I* r0, int n0) {
r = r0; n = n0; active = 0;
while (active < n && !r[active]())
active++;
if (active < n){
operator ++();
} else {
finish();
}
}
}}}
// STATISTICS: iter-any
Gecode::Iter::Ranges::Append::init
void init(I &i, J &j)
Initialize with iterator i and j.
Definition ranges-append.hpp:148
Gecode::Iter::Ranges::Append::operator++
void operator++(void)
Move iterator to next range (if possible).
Definition ranges-append.hpp:115
Gecode::Iter::Ranges::Append::Append
Append(void)
Default constructor.
Definition ranges-append.hpp:134
Gecode::Iter::Ranges::Append::i
I i
First iterator.
Definition ranges-append.hpp:49
Gecode::Iter::Ranges::Append::j
J j
Iterator to be appended.
Definition ranges-append.hpp:51
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::NaryAppend::operator++
void operator++(void)
Move iterator to next range (if possible).
Definition ranges-append.hpp:164
Gecode::Iter::Ranges::NaryAppend::n
int n
Number of iterators.
Definition ranges-append.hpp:86
Gecode::Iter::Ranges::NaryAppend::NaryAppend
NaryAppend(void)
Default constructor.
Definition ranges-append.hpp:187
Gecode::Iter::Ranges::NaryAppend::init
void init(I *i, int n)
Initialize with n iterators in i.
Definition ranges-append.hpp:204
Gecode::Iter::Ranges::NaryAppend::r
I * r
The array of iterators to be appended.
Definition ranges-append.hpp:84
Gecode::Iter::Ranges::NaryAppend::active
int active
Number of current iterator being processed.
Definition ranges-append.hpp:88
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
forceinline
#define forceinline
Definition config.hpp:187