git-subtree-dir: software/gecode_on_record git-subtree-split: 37ed9bda495ea87e63217c19a374b5a93bb0078e
170 lines
5.0 KiB
C++
Executable File
170 lines
5.0 KiB
C++
Executable File
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
|
|
/*
|
|
* Main authors:
|
|
* Christian Schulte <schulte@gecode.org>
|
|
*
|
|
* Copyright:
|
|
* Christian Schulte, 2012
|
|
*
|
|
* 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 Int { namespace Branch {
|
|
|
|
template<class View>
|
|
forceinline
|
|
ValSelMin<View>::ValSelMin
|
|
(Space& home, const ValBranch<typename ValSelMin<View>::Var>& vb)
|
|
: ValSel<View,int>(home,vb) {}
|
|
template<class View>
|
|
forceinline
|
|
ValSelMin<View>::ValSelMin(Space& home, ValSelMin& vs)
|
|
: ValSel<View,int>(home,vs) {}
|
|
template<class View>
|
|
forceinline int
|
|
ValSelMin<View>::val(const Space&, View x, int) {
|
|
return x.min();
|
|
}
|
|
|
|
template<class View>
|
|
forceinline
|
|
ValSelMax<View>::ValSelMax
|
|
(Space& home, const ValBranch<typename ValSelMax<View>::Var>& vb)
|
|
: ValSel<View,int>(home,vb) {}
|
|
template<class View>
|
|
forceinline
|
|
ValSelMax<View>::ValSelMax(Space& home, ValSelMax& vs)
|
|
: ValSel<View,int>(home,vs) {}
|
|
template<class View>
|
|
forceinline int
|
|
ValSelMax<View>::val(const Space&, View x, int) {
|
|
return x.max();
|
|
}
|
|
|
|
template<class View>
|
|
forceinline
|
|
ValSelMed<View>::ValSelMed
|
|
(Space& home, const ValBranch<typename ValSelMed<View>::Var>& vb)
|
|
: ValSel<View,int>(home,vb) {}
|
|
template<class View>
|
|
forceinline
|
|
ValSelMed<View>::ValSelMed(Space& home, ValSelMed& vs)
|
|
: ValSel<View,int>(home,vs) {}
|
|
template<class View>
|
|
forceinline int
|
|
ValSelMed<View>::val(const Space&, View x, int) {
|
|
return x.med();
|
|
}
|
|
|
|
template<class View>
|
|
forceinline
|
|
ValSelAvg<View>::ValSelAvg
|
|
(Space& home, const ValBranch<typename ValSelAvg<View>::Var>& vb)
|
|
: ValSel<View,int>(home,vb) {}
|
|
template<class View>
|
|
forceinline
|
|
ValSelAvg<View>::ValSelAvg(Space& home, ValSelAvg& vs)
|
|
: ValSel<View,int>(home,vs) {}
|
|
template<class View>
|
|
forceinline int
|
|
ValSelAvg<View>::val(const Space&, View x, int) {
|
|
return (x.width() == 2U) ? x.min() : ((x.min()+x.max()) / 2);
|
|
}
|
|
|
|
template<class View>
|
|
forceinline
|
|
ValSelRnd<View>::ValSelRnd
|
|
(Space& home, const ValBranch<typename ValSelRnd<View>::Var>& vb)
|
|
: ValSel<View,int>(home,vb), r(vb.rnd()) {}
|
|
template<class View>
|
|
forceinline
|
|
ValSelRnd<View>::ValSelRnd(Space& home, ValSelRnd& vs)
|
|
: ValSel<View,int>(home,vs), r(vs.r) {
|
|
}
|
|
template<class View>
|
|
forceinline int
|
|
ValSelRnd<View>::val(const Space&, View x, int) {
|
|
unsigned int p = r(x.size());
|
|
for (ViewRanges<View> i(x); i(); ++i) {
|
|
if (i.width() > p)
|
|
return i.min() + static_cast<int>(p);
|
|
p -= i.width();
|
|
}
|
|
GECODE_NEVER;
|
|
return 0;
|
|
}
|
|
template<class View>
|
|
forceinline bool
|
|
ValSelRnd<View>::notice(void) const {
|
|
return true;
|
|
}
|
|
template<class View>
|
|
forceinline void
|
|
ValSelRnd<View>::dispose(Space&) {
|
|
r.~Rnd();
|
|
}
|
|
|
|
forceinline
|
|
ValSelRangeMin::ValSelRangeMin
|
|
(Space& home, const ValBranch<IntVar>& vb)
|
|
: ValSel<IntView,int>(home,vb) {}
|
|
forceinline
|
|
ValSelRangeMin::ValSelRangeMin(Space& home, ValSelRangeMin& vs)
|
|
: ValSel<IntView,int>(home,vs) {}
|
|
forceinline int
|
|
ValSelRangeMin::val(const Space&, IntView x, int) {
|
|
if (x.range()) {
|
|
return (x.width() == 2) ? x.min() : (x.min() + (x.max()-x.min())/2);
|
|
} else {
|
|
ViewRanges<View> r(x);
|
|
return r.max();
|
|
}
|
|
}
|
|
|
|
forceinline
|
|
ValSelRangeMax::ValSelRangeMax(Space& home, const ValBranch<IntVar>& vb)
|
|
: ValSel<IntView,int>(home,vb) {}
|
|
forceinline
|
|
ValSelRangeMax::ValSelRangeMax(Space& home, ValSelRangeMax& vs)
|
|
: ValSel<IntView,int>(home,vs) {}
|
|
forceinline int
|
|
ValSelRangeMax::val(const Space&, IntView x, int) {
|
|
if (x.range()) {
|
|
return (x.width() == 2) ? x.max() : (x.max() - (x.max()-x.min())/2);
|
|
} else {
|
|
int min;
|
|
ViewRanges<IntView> r(x);
|
|
do {
|
|
min = r.min(); ++r;
|
|
} while (r());
|
|
return min;
|
|
}
|
|
}
|
|
|
|
}}}
|
|
|
|
// STATISTICS: int-branch
|
|
|