git-subtree-dir: software/gecode git-subtree-split: 313e87646da4fc2752a70e83df16d993121a8e40
270 lines
6.3 KiB
C++
270 lines
6.3 KiB
C++
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
|
|
/*
|
|
* Main authors:
|
|
* Guido Tack <tack@gecode.org>
|
|
*
|
|
* Contributing authors:
|
|
* Christian Schulte <schulte@gecode.org>
|
|
* Gabor Szokoli <szokoli@gecode.org>
|
|
*
|
|
* Copyright:
|
|
* Guido Tack, 2004
|
|
* Christian Schulte, 2004
|
|
* Gabor Szokoli, 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 Set {
|
|
|
|
/*
|
|
* Constructors and access
|
|
*
|
|
*/
|
|
|
|
forceinline
|
|
SetView::SetView(void) {}
|
|
forceinline
|
|
SetView::SetView(const SetVar& y)
|
|
: VarImpView<SetVar>(y.varimp()) {}
|
|
forceinline
|
|
SetView::SetView(SetVarImp* y)
|
|
: VarImpView<SetVar>(y) {}
|
|
|
|
/*
|
|
* Variable information
|
|
*
|
|
*/
|
|
|
|
forceinline unsigned int
|
|
SetView::glbSize(void) const {
|
|
return x->glbSize();
|
|
}
|
|
forceinline unsigned int
|
|
SetView::lubSize(void) const {
|
|
return x->lubSize();
|
|
}
|
|
forceinline unsigned int
|
|
SetView::unknownSize(void) const {
|
|
return x->lubSize() - x->glbSize();
|
|
}
|
|
forceinline bool
|
|
SetView::contains(int i) const {
|
|
return x->knownIn(i);
|
|
}
|
|
forceinline bool
|
|
SetView::notContains(int i) const {
|
|
return x->knownOut(i);
|
|
}
|
|
forceinline unsigned int
|
|
SetView::cardMin(void) const {
|
|
return x->cardMin();
|
|
}
|
|
forceinline unsigned int
|
|
SetView::cardMax(void) const {
|
|
return x->cardMax();
|
|
}
|
|
forceinline int
|
|
SetView::lubMin(void) const {
|
|
return x->lubMin();
|
|
}
|
|
forceinline int
|
|
SetView::lubMax(void) const {
|
|
return x->lubMax();
|
|
}
|
|
forceinline int
|
|
SetView::lubMinN(unsigned int n) const {
|
|
return x->lubMinN(n);
|
|
}
|
|
forceinline int
|
|
SetView::glbMin(void) const {
|
|
return x->glbMin();
|
|
}
|
|
forceinline int
|
|
SetView::glbMax(void) const {
|
|
return x->glbMax();
|
|
}
|
|
|
|
/*
|
|
* Tells
|
|
*
|
|
*/
|
|
|
|
forceinline ModEvent
|
|
SetView::cardMin(Space& home, unsigned int m) {
|
|
return x->cardMin(home, m);
|
|
}
|
|
|
|
forceinline ModEvent
|
|
SetView::cardMax(Space& home, unsigned int m) {
|
|
return x->cardMax(home, m);
|
|
}
|
|
|
|
forceinline ModEvent
|
|
SetView::include(Space& home, int from, int to) {
|
|
return x->include(home,from,to);
|
|
}
|
|
|
|
forceinline ModEvent
|
|
SetView::include(Space& home, int n) {
|
|
return x->include(home,n);
|
|
}
|
|
|
|
forceinline ModEvent
|
|
SetView::exclude(Space& home, int n) {
|
|
return x->exclude(home, n);
|
|
}
|
|
|
|
forceinline ModEvent
|
|
SetView::intersect(Space& home, int from, int to) {
|
|
return x->intersect(home,from,to);
|
|
}
|
|
|
|
forceinline ModEvent
|
|
SetView::intersect(Space& home, int n) {
|
|
return x->intersect(home,n);
|
|
}
|
|
|
|
template<class I> ModEvent
|
|
SetView::includeI(Space& home, I& iter) {
|
|
return x->includeI(home, iter);
|
|
}
|
|
|
|
forceinline ModEvent
|
|
SetView::exclude(Space& home, int from, int to) {
|
|
return x->exclude(home,from,to);
|
|
}
|
|
template<class I> ModEvent
|
|
SetView::excludeI(Space& home, I& iter) {
|
|
return x->excludeI(home, iter);
|
|
}
|
|
template<class I> ModEvent
|
|
SetView::intersectI(Space& home, I& iter) {
|
|
return x->intersectI(home, iter);
|
|
}
|
|
|
|
|
|
/*
|
|
* Delta information for advisors
|
|
*
|
|
*/
|
|
|
|
forceinline ModEvent
|
|
SetView::modevent(const Delta& d) {
|
|
return SetVarImp::modevent(d);
|
|
}
|
|
|
|
forceinline int
|
|
SetView::glbMin(const Delta& d) const {
|
|
return SetVarImp::glbMin(d);
|
|
}
|
|
forceinline int
|
|
SetView::glbMax(const Delta& d) const {
|
|
return SetVarImp::glbMax(d);
|
|
}
|
|
forceinline bool
|
|
SetView::glbAny(const Delta& d) const {
|
|
return SetVarImp::glbAny(d);
|
|
}
|
|
|
|
forceinline int
|
|
SetView::lubMin(const Delta& d) const {
|
|
return SetVarImp::lubMin(d);
|
|
}
|
|
forceinline int
|
|
SetView::lubMax(const Delta& d) const {
|
|
return SetVarImp::lubMax(d);
|
|
}
|
|
forceinline bool
|
|
SetView::lubAny(const Delta& d) const {
|
|
return SetVarImp::lubAny(d);
|
|
}
|
|
|
|
|
|
/**
|
|
* \brief %Range iterator for least upper bound of set variable views
|
|
* \ingroup TaskActorSetView
|
|
*/
|
|
template<>
|
|
class LubRanges<SetView> : public LubRanges<SetVarImp*> {
|
|
public:
|
|
/// \name Constructors and initialization
|
|
//@{
|
|
/// Default constructor
|
|
LubRanges(void);
|
|
/// Initialize with ranges for view \a x
|
|
LubRanges(const SetView& x);
|
|
/// Initialize with ranges for view \a x
|
|
void init(const SetView& x);
|
|
//@}
|
|
};
|
|
|
|
forceinline
|
|
LubRanges<SetView>::LubRanges(void) {}
|
|
|
|
forceinline
|
|
LubRanges<SetView>::LubRanges(const SetView& x)
|
|
: LubRanges<SetVarImp*>(x.varimp()) {}
|
|
|
|
forceinline void
|
|
LubRanges<SetView>::init(const SetView& x) {
|
|
LubRanges<SetVarImp*>::init(x.varimp());
|
|
}
|
|
|
|
|
|
/**
|
|
* \brief %Range iterator for greatest lower bound of set variable views
|
|
* \ingroup TaskActorSetView
|
|
*/
|
|
template<>
|
|
class GlbRanges<SetView> : public GlbRanges<SetVarImp*> {
|
|
public:
|
|
/// \name Constructors and initialization
|
|
//@{
|
|
/// Default constructor
|
|
GlbRanges(void);
|
|
/// Initialize with ranges for view \a x
|
|
GlbRanges(const SetView& x);
|
|
/// Initialize with ranges for view \a x
|
|
void init(const SetView& x);
|
|
};
|
|
|
|
forceinline
|
|
GlbRanges<SetView>::GlbRanges(void) {}
|
|
|
|
forceinline
|
|
GlbRanges<SetView>::GlbRanges(const SetView& x)
|
|
: GlbRanges<SetVarImp*>(x.varimp()) {}
|
|
|
|
forceinline void
|
|
GlbRanges<SetView>::init(const SetView& x) {
|
|
GlbRanges<SetVarImp*>::init(x.varimp());
|
|
}
|
|
|
|
}}
|
|
|
|
// STATISTICS: set-var
|
|
|