values-inter.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 Values {
template<class I, class J>
class Inter {
protected:
I i;
J j;
void next(void);
public:
Inter(void);
Inter(I& i, J& j);
void init(I& i, J& j);
bool operator ()(void) const;
void operator ++(void);
int val(void) const;
};
template<class I, class J>
forceinline
Inter<I,J>::Inter(void) {}
template<class I, class J>
forceinline void
Inter<I,J>::next(void) {
do {
while (i() && j() && (i.val() < j.val()))
++i;
while (i() && j() && (j.val() < i.val()))
++j;
} while (i() && j() && (i.val() != j.val()));
}
template<class I, class J>
inline void
Inter<I,J>::init(I& i0, J& j0) {
i=i0; j=j0; next();
}
template<class I, class J>
forceinline
Inter<I,J>::Inter(I& i0, J& j0) : i(i0), j(j0) {
next();
}
template<class I, class J>
forceinline void
Inter<I,J>::operator ++(void) {
++i; ++j; next();
}
template<class I, class J>
forceinline bool
Inter<I,J>::operator ()(void) const {
return i() && j();
}
template<class I, class J>
forceinline int
Inter<I,J>::val(void) const {
assert(i.val() == j.val());
return i.val();
}
}}}
// STATISTICS: iter-any
Gecode::Iter::Values::Inter::Inter
Inter(void)
Default constructor.
Definition values-inter.hpp:80
Gecode::Iter::Values::Inter::j
J j
Second iterator.
Definition values-inter.hpp:48
Gecode::Iter::Values::Inter::val
int val(void) const
Return current value.
Definition values-inter.hpp:119
Gecode::Iter::Values::Inter::next
void next(void)
Find next element from intersection.
Definition values-inter.hpp:84
Gecode::Iter::Values::Inter::i
I i
First iterator.
Definition values-inter.hpp:46
Gecode::Iter::Values::Inter::init
void init(I &i, J &j)
Initialize with values from i and j.
Definition values-inter.hpp:95
Gecode::Iter::Values::Inter::operator()
bool operator()(void) const
Test whether iterator is still at a value or done.
Definition values-inter.hpp:113
Gecode::Iter::Values::Inter::operator++
void operator++(void)
Move iterator to next value (if possible).
Definition values-inter.hpp:107
Gecode::Iter::Values
Value iterators.
Definition iter.hh:45
Gecode::Iter
Range and value iterators.
Definition iter.hh:41
Gecode
Gecode toplevel namespace
forceinline
#define forceinline
Definition config.hpp:187