/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */ /* * Main authors: * Christian Schulte * * Contributing authors: * Gabor Szokoli * Guido Tack * * Copyright: * Christian Schulte, 2012 * Gabor Szokoli, 2004 * Guido Tack, 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 { namespace Branch { // Minimum merit forceinline MeritMin::MeritMin(Space& home, const VarBranch& vb) : MeritBase(home,vb) {} forceinline MeritMin::MeritMin(Space& home, MeritMin& m) : MeritBase(home,m) {} forceinline int MeritMin::operator ()(const Space&, SetView x, int) { UnknownRanges u(x); return u.min(); } // Maximum merit forceinline MeritMax::MeritMax(Space& home, const VarBranch& vb) : MeritBase(home,vb) {} forceinline MeritMax::MeritMax(Space& home, MeritMax& m) : MeritBase(home,m) {} forceinline int MeritMax::operator ()(const Space&, SetView x, int) { int max = Limits::max; for (UnknownRanges u(x); u(); ++u) max = u.max(); return max; } // Size merit forceinline MeritSize::MeritSize(Space& home, const VarBranch& vb) : MeritBase(home,vb) {} forceinline MeritSize::MeritSize(Space& home, MeritSize& m) : MeritBase(home,m) {} forceinline unsigned int MeritSize::operator ()(const Space&, SetView x, int) { return x.unknownSize(); } // Degree over size merit forceinline MeritDegreeSize::MeritDegreeSize(Space& home, const VarBranch& vb) : MeritBase(home,vb) {} forceinline MeritDegreeSize::MeritDegreeSize(Space& home, MeritDegreeSize& m) : MeritBase(home,m) {} forceinline double MeritDegreeSize::operator ()(const Space&, SetView x, int) { return static_cast(x.unknownSize()) / static_cast(x.degree()); } // AFC over size merit forceinline MeritAFCSize::MeritAFCSize(Space& home, const VarBranch& vb) : MeritBase(home,vb), afc(vb.afc()) {} forceinline MeritAFCSize::MeritAFCSize(Space& home, MeritAFCSize& m) : MeritBase(home,m), afc(m.afc) {} forceinline double MeritAFCSize::operator ()(const Space&, SetView x, int) { return x.afc() / static_cast(x.unknownSize()); } forceinline bool MeritAFCSize::notice(void) const { return false; } forceinline void MeritAFCSize::dispose(Space&) { // Not really needed afc.~AFC(); } // Action over size merit forceinline MeritActionSize::MeritActionSize(Space& home, const VarBranch& vb) : MeritBase(home,vb), action(vb.action()) {} forceinline MeritActionSize::MeritActionSize(Space& home, MeritActionSize& m) : MeritBase(home,m), action(m.action) {} forceinline double MeritActionSize::operator ()(const Space&, SetView x, int i) { return action[i] / static_cast(x.unknownSize()); } forceinline bool MeritActionSize::notice(void) const { return true; } forceinline void MeritActionSize::dispose(Space&) { action.~Action(); } // CHB Q-score over size merit forceinline MeritCHBSize::MeritCHBSize(Space& home, const VarBranch& vb) : MeritBase(home,vb), chb(vb.chb()) {} forceinline MeritCHBSize::MeritCHBSize(Space& home, MeritCHBSize& m) : MeritBase(home,m), chb(m.chb) {} forceinline double MeritCHBSize::operator ()(const Space&, SetView x, int i) { return chb[i] / static_cast(x.unknownSize()); } forceinline bool MeritCHBSize::notice(void) const { return true; } forceinline void MeritCHBSize::dispose(Space&) { chb.~CHB(); } }}} // STATISTICS: set-branch