/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */ /* * Main authors: * Christian Schulte * * 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 forceinline ValSelMin::ValSelMin (Space& home, const ValBranch::Var>& vb) : ValSel(home,vb) {} template forceinline ValSelMin::ValSelMin(Space& home, ValSelMin& vs) : ValSel(home,vs) {} template forceinline int ValSelMin::val(const Space&, View x, int) { return x.min(); } template forceinline ValSelMax::ValSelMax (Space& home, const ValBranch::Var>& vb) : ValSel(home,vb) {} template forceinline ValSelMax::ValSelMax(Space& home, ValSelMax& vs) : ValSel(home,vs) {} template forceinline int ValSelMax::val(const Space&, View x, int) { return x.max(); } template forceinline ValSelMed::ValSelMed (Space& home, const ValBranch::Var>& vb) : ValSel(home,vb) {} template forceinline ValSelMed::ValSelMed(Space& home, ValSelMed& vs) : ValSel(home,vs) {} template forceinline int ValSelMed::val(const Space&, View x, int) { return x.med(); } template forceinline ValSelAvg::ValSelAvg (Space& home, const ValBranch::Var>& vb) : ValSel(home,vb) {} template forceinline ValSelAvg::ValSelAvg(Space& home, ValSelAvg& vs) : ValSel(home,vs) {} template forceinline int ValSelAvg::val(const Space&, View x, int) { return (x.width() == 2U) ? x.min() : ((x.min()+x.max()) / 2); } template forceinline ValSelRnd::ValSelRnd (Space& home, const ValBranch::Var>& vb) : ValSel(home,vb), r(vb.rnd()) {} template forceinline ValSelRnd::ValSelRnd(Space& home, ValSelRnd& vs) : ValSel(home,vs), r(vs.r) { } template forceinline int ValSelRnd::val(const Space&, View x, int) { unsigned int p = r(x.size()); for (ViewRanges i(x); i(); ++i) { if (i.width() > p) return i.min() + static_cast(p); p -= i.width(); } GECODE_NEVER; return 0; } template forceinline bool ValSelRnd::notice(void) const { return true; } template forceinline void ValSelRnd::dispose(Space&) { r.~Rnd(); } forceinline ValSelRangeMin::ValSelRangeMin (Space& home, const ValBranch& vb) : ValSel(home,vb) {} forceinline ValSelRangeMin::ValSelRangeMin(Space& home, ValSelRangeMin& vs) : ValSel(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 r(x); return r.max(); } } forceinline ValSelRangeMax::ValSelRangeMax(Space& home, const ValBranch& vb) : ValSel(home,vb) {} forceinline ValSelRangeMax::ValSelRangeMax(Space& home, ValSelRangeMax& vs) : ValSel(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 r(x); do { min = r.min(); ++r; } while (r()); return min; } } }}} // STATISTICS: int-branch