dep-selector-libgecode 1.0.0.alpha.0

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/int/branch/select-val.hpp

@@ -0,0 +1,229 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2002
+ *
+ *  Last modified:
+ *     $Date: 2011-05-11 20:44:17 +1000 (Wed, 11 May 2011) $ by $Author: tack $
+ *     $Revision: 12001 $
+ *
+ *  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
+  ValMin<View>::ValMin(void) {}
+  template<class View>
+  forceinline
+  ValMin<View>::ValMin(Space& home, const ValBranchOptions& vbo)
+    : ValSelBase<View,int>(home,vbo) {}
+  template<class View>
+  forceinline int
+  ValMin<View>::val(Space&, View x) const {
+    return x.min();
+  }
+  template<class View>
+  forceinline ModEvent
+  ValMin<View>::tell(Space& home, unsigned int a, View x, int n) {
+    return (a == 0) ? x.eq(home,n) : x.gr(home,n);
+  }
+
+  template<class View>
+  forceinline
+  ValMed<View>::ValMed(void) {}
+  template<class View>
+  forceinline
+  ValMed<View>::ValMed(Space& home, const ValBranchOptions& vbo)
+    : ValSelBase<View,int>(home,vbo) {}
+  template<class View>
+  forceinline int
+  ValMed<View>::val(Space&, View x) const {
+    return x.med();
+  }
+  template<class View>
+  forceinline ModEvent
+  ValMed<View>::tell(Space& home, unsigned int a, View x, int n) {
+    return (a == 0) ? x.eq(home,n) : x.nq(home,n);
+  }
+
+
+  template<class View>
+  forceinline
+  ValRnd<View>::ValRnd(void) {}
+  template<class View>
+  forceinline
+  ValRnd<View>::ValRnd(Space&, const ValBranchOptions& vbo)
+    : r(vbo.seed) {}
+  template<class View>
+  forceinline int
+  ValRnd<View>::val(Space&, View x) {
+    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 ModEvent
+  ValRnd<View>::tell(Space& home, unsigned int a, View x, int n) {
+    return (a == 0) ? x.eq(home,n) : x.nq(home,n);
+  }
+  template<class View>
+  forceinline typename ValRnd<View>::Choice
+  ValRnd<View>::choice(Space&) {
+    return r;
+  }
+  template<class View>
+  forceinline typename ValRnd<View>::Choice
+  ValRnd<View>::choice(const Space&, Archive& e) {
+    return Choice(e.get());
+  }
+  template<class View>
+  forceinline void
+  ValRnd<View>::commit(Space&, const Choice& c, unsigned int) {
+    r = c;
+  }
+  template<class View>
+  forceinline void
+  ValRnd<View>::update(Space&, bool, ValRnd<View>& vr) {
+    r = vr.r;
+  }
+  template<class View>
+  forceinline void
+  ValRnd<View>::dispose(Space&) {}
+
+
+  template<class View>
+  forceinline
+  ValSplitMin<View>::ValSplitMin(void) {}
+  template<class View>
+  forceinline
+  ValSplitMin<View>::ValSplitMin(Space& home,
+    const ValBranchOptions& vbo)
+    : ValSelBase<View,int>(home,vbo) {}
+  template<class View>
+  forceinline int
+  ValSplitMin<View>::val(Space&, View x) const {
+    return (x.width() == 2) ? x.min() : ((x.min()+x.max()) / 2);
+  }
+  template<class View>
+  forceinline ModEvent
+  ValSplitMin<View>::tell(Space& home, unsigned int a, View x, int n) {
+    return (a == 0) ? x.lq(home,n) : x.gr(home,n);
+  }
+
+
+  template<class View>
+  forceinline
+  ValRangeMin<View>::ValRangeMin(void) {}
+  template<class View>
+  forceinline
+  ValRangeMin<View>::ValRangeMin(Space& home,
+    const ValBranchOptions& vbo)
+    : ValSelBase<View,int>(home,vbo) {}
+  template<class View>
+  forceinline int
+  ValRangeMin<View>::val(Space&, View x) const {
+    if (x.range()) {
+      return (x.width() == 2) ? x.min() : ((x.min()+x.max()) / 2);
+    } else {
+      ViewRanges<View> r(x);
+      return r.max();
+    }
+  }
+  template<class View>
+  forceinline ModEvent
+  ValRangeMin<View>::tell(Space& home, unsigned int a, View x, int n) {
+    return (a == 0) ? x.lq(home,n) : x.gr(home,n);
+  }
+
+
+  template<class View>
+  forceinline
+  ValZeroOne<View>::ValZeroOne(void) {}
+  template<class View>
+  forceinline
+  ValZeroOne<View>::ValZeroOne(Space& home, const ValBranchOptions& vbo)
+    : ValSelBase<View,NoValue>(home,vbo) {}
+  template<class View>
+  forceinline NoValue
+  ValZeroOne<View>::val(Space&, View) const {
+    NoValue n; return n;
+  }
+  template<class View>
+  forceinline ModEvent
+  ValZeroOne<View>::tell(Space& home, unsigned int a, View x, NoValue) {
+    return (a == 0) ? x.zero(home) : x.one(home);
+  }
+
+
+  template<class View>
+  forceinline
+  AssignValMin<View>::AssignValMin(void) {}
+  template<class View>
+  forceinline
+  AssignValMin<View>::AssignValMin(Space& home, const ValBranchOptions& vbo)
+    : ValMin<View>(home,vbo) {}
+
+
+  template<class View>
+  forceinline
+  AssignValMed<View>::AssignValMed(void) {}
+  template<class View>
+  forceinline
+  AssignValMed<View>::AssignValMed(Space& home, const ValBranchOptions& vbo)
+    : ValMed<View>(home,vbo) {}
+
+
+  template<class View>
+  forceinline
+  AssignValRnd<View>::AssignValRnd(void) {}
+  template<class View>
+  forceinline
+  AssignValRnd<View>::AssignValRnd(Space& home, const ValBranchOptions& vbo)
+    : ValRnd<View>(home,vbo) {}
+
+
+  template<class View>
+  forceinline
+  AssignValZero<View>::AssignValZero(void) {}
+  template<class View>
+  forceinline
+  AssignValZero<View>::AssignValZero(Space& home,
+                                     const ValBranchOptions& vbo)
+    : ValZeroOne<View>(home,vbo) {}
+
+}}}
+
+// STATISTICS: int-branch
+

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/int/branch/select-values.hpp

@@ -0,0 +1,213 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2008
+ *
+ *  Last modified:
+ *     $Date: 2011-05-11 20:44:17 +1000 (Wed, 11 May 2011) $ by $Author: tack $
+ *     $Revision: 12001 $
+ *
+ *  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 {
+
+  /**
+   * \brief %Choice storing position and values
+   *
+   * The maximal number of alternatives is defined by \a alt.
+   */
+  template<class ViewSel, class View>
+  class PosValuesChoice : public PosChoice<ViewSel> {
+  private:
+    /// Information about position and minimum
+    class PosMin {
+    public:
+      /// Start position of range
+      unsigned int pos;
+      /// Minmum of range
+      int min;
+    };
+    /// Number of ranges
+    unsigned int n;
+    /// Values to assign to
+    PosMin* pm;
+  public:
+    /// Initialize choice for brancher \a b, position \a p, view choice \a viewc, and view \a x
+    PosValuesChoice(const Brancher& b, const Pos& p,
+                    const typename ViewSel::Choice& viewc, View x);
+    /// Initialize choice for brancher \a b from \a e
+    PosValuesChoice(const Brancher& b, unsigned int alt, Pos p,
+                    const typename ViewSel::Choice& viewc,
+                    Archive& e);
+    /// Return value to branch with for alternative \a a
+    int val(unsigned int a) const;
+    /// Report size occupied
+    virtual size_t size(void) const;
+    /// Deallocate
+    virtual ~PosValuesChoice(void);
+    /// Archive into \a e
+    virtual void archive(Archive& e) const;
+  };
+
+
+  template<class ViewSel, class View>
+  forceinline
+  PosValuesChoice<ViewSel,View>::
+  PosValuesChoice(const Brancher& b, const Pos& p,
+                const typename ViewSel::Choice& viewc, View x)
+    : PosChoice<ViewSel>(b,x.size(),p,viewc), n(0) {
+    for (ViewRanges<View> r(x); r(); ++r)
+      n++;
+    pm = heap.alloc<PosMin>(n+1);
+    unsigned int w=0;
+    int i=0;
+    for (ViewRanges<View> r(x); r(); ++r) {
+      pm[i].min = r.min();
+      pm[i].pos = w;
+      w += r.width(); i++;
+    }
+    pm[i].pos = w;
+  }
+
+  template<class ViewSel, class View>
+  forceinline
+  PosValuesChoice<ViewSel,View>::
+  PosValuesChoice(const Brancher& b, unsigned int alt, Pos p,
+                  const typename ViewSel::Choice& viewc, Archive& e)
+    : PosChoice<ViewSel>(b,alt,p,viewc) {
+    e >> n;
+    pm = heap.alloc<PosMin>(n+1);
+    for (unsigned int i=0; i<n+1; i++) {
+      e >> pm[i].pos;
+      e >> pm[i].min;
+    }
+  }
+
+  template<class ViewSel, class View>
+  forceinline int
+  PosValuesChoice<ViewSel,View>::val(unsigned int a) const {
+    PosMin* l = &pm[0];
+    PosMin* r = &pm[n-1];
+    while (true) {
+      PosMin* m = l + (r-l)/2;
+      if (a < m->pos) {
+        r=m-1;
+      } else if (a >= (m+1)->pos) {
+        l=m+1;
+      } else {
+        return m->min + static_cast<int>(a - m->pos);
+      }
+    }
+    GECODE_NEVER;
+    return 0;
+  }
+
+  template<class ViewSel, class View>
+  size_t
+  PosValuesChoice<ViewSel,View>::size(void) const {
+    return sizeof(PosValuesChoice<ViewSel,View>)+(n+1)*sizeof(PosMin);
+  }
+
+  template<class ViewSel, class View>
+  PosValuesChoice<ViewSel,View>::~PosValuesChoice(void) {
+    heap.free<PosMin>(pm,n+1);
+  }
+
+  template<class ViewSel, class View>
+  forceinline void
+  PosValuesChoice<ViewSel,View>::archive(Archive& e) const {
+    PosChoice<ViewSel>::archive(e);
+    e << this->alternatives() << n;
+    for (unsigned int i=0; i<n+1; i++) {
+      e << pm[i].pos;
+      e << pm[i].min;
+    }
+  }
+
+  template<class ViewSel, class View>
+  forceinline
+  ViewValuesBrancher<ViewSel,View>::
+  ViewValuesBrancher(Home home, ViewArray<typename ViewSel::View>& x,
+                     ViewSel& vi_s, BranchFilter bf)
+    : ViewBrancher<ViewSel>(home,x,vi_s,bf) {}
+
+  template<class ViewSel, class View>
+  void
+  ViewValuesBrancher<ViewSel,View>::
+  post(Home home, ViewArray<typename ViewSel::View>& x, ViewSel& vi_s,
+       BranchFilter bf) {
+    (void) new (home) ViewValuesBrancher<ViewSel,View>(home,x,vi_s,bf);
+  }
+
+  template<class ViewSel, class View>
+  forceinline
+  ViewValuesBrancher<ViewSel,View>::
+  ViewValuesBrancher(Space& home, bool share, ViewValuesBrancher& b)
+    : ViewBrancher<ViewSel>(home,share,b) {}
+
+  template<class ViewSel, class View>
+  Actor*
+  ViewValuesBrancher<ViewSel,View>::copy(Space& home, bool share) {
+    return new (home)
+      ViewValuesBrancher<ViewSel,View>(home,share,*this);
+  }
+
+  template<class ViewSel, class View>
+  const Choice*
+  ViewValuesBrancher<ViewSel,View>::choice(Space& home) {
+    Pos p = ViewBrancher<ViewSel>::pos(home);
+    View v(ViewBrancher<ViewSel>::view(p).varimp());
+    return new PosValuesChoice<ViewSel,View>
+      (*this,p,viewsel.choice(home),v);
+  }
+
+  template<class ViewSel, class View>
+  const Choice*
+  ViewValuesBrancher<ViewSel,View>::choice(const Space& home, Archive& e) {
+    int p;
+    unsigned int alt;
+    e >> p >> alt;
+    return new PosValuesChoice<ViewSel,View>
+      (*this,alt,p,viewsel.choice(home,e),e);
+  }
+
+  template<class ViewSel, class View>
+  ExecStatus
+  ViewValuesBrancher<ViewSel,View>
+  ::commit(Space& home, const Choice& c, unsigned int a) {
+    const PosValuesChoice<ViewSel,View>& pvc
+      = static_cast<const PosValuesChoice<ViewSel,View>&>(c);
+    View v(ViewBrancher<ViewSel>::view(pvc.pos()).varimp());
+    viewsel.commit(home, pvc.viewchoice(), a);
+    return me_failed(v.eq(home,pvc.val(a))) ? ES_FAILED : ES_OK;
+  }
+
+}}}
+
+// STATISTICS: int-branch

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/int/branch/select-view.hpp

@@ -0,0 +1,364 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2002
+ *
+ *  Last modified:
+ *     $Date: 2009-10-14 06:12:58 +1100 (Wed, 14 Oct 2009) $ by $Author: schulte $
+ *     $Revision: 9897 $
+ *
+ *  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 {
+
+  // Select variable with smallest min
+  forceinline
+  ByMinMin::ByMinMin(void) : min(0) {}
+  forceinline
+  ByMinMin::ByMinMin(Space& home, const VarBranchOptions& vbo)
+    : ViewSelBase<IntView>(home,vbo), min(0) {}
+  forceinline ViewSelStatus
+  ByMinMin::init(Space&, View x) {
+    min = x.min();
+    return VSS_BETTER;
+  }
+  forceinline ViewSelStatus
+  ByMinMin::select(Space&, View x) {
+    if (x.min() < min) {
+      min = x.min(); return VSS_BETTER;
+    } else if (x.min() > min) {
+      return VSS_WORSE;
+    } else {
+      return VSS_TIE;
+    }
+  }
+
+  // Select variable with largest min
+  forceinline
+  ByMinMax::ByMinMax(void) : min(0) {}
+  forceinline
+  ByMinMax::ByMinMax(Space& home, const VarBranchOptions& vbo)
+    : ViewSelBase<IntView>(home,vbo), min(0) {}
+  forceinline ViewSelStatus
+  ByMinMax::init(Space&, View x) {
+    min = x.min();
+    return VSS_BETTER;
+  }
+  forceinline ViewSelStatus
+  ByMinMax::select(Space&, View x) {
+    if (x.min() > min) {
+      min = x.min(); return VSS_BETTER;
+    } else if (x.min() < min) {
+      return VSS_WORSE;
+    } else {
+      return VSS_TIE;
+    }
+  }
+
+  // Select variable with smallest max
+  forceinline
+  ByMaxMin::ByMaxMin(void) : max(0) {}
+  forceinline
+  ByMaxMin::ByMaxMin(Space& home, const VarBranchOptions& vbo)
+    : ViewSelBase<IntView>(home,vbo), max(0) {}
+  forceinline ViewSelStatus
+  ByMaxMin::init(Space&, View x) {
+    max = x.max();
+    return VSS_BETTER;
+  }
+  forceinline ViewSelStatus
+  ByMaxMin::select(Space&, View x) {
+    if (x.max() < max) {
+      max = x.max(); return VSS_BETTER;
+    } else if (x.max() > max) {
+      return VSS_WORSE;
+    } else {
+      return VSS_TIE;
+    }
+  }
+
+  // Select variable with largest max
+  forceinline
+  ByMaxMax::ByMaxMax(void) : max(0) {}
+  forceinline
+  ByMaxMax::ByMaxMax(Space& home, const VarBranchOptions& vbo)
+    : ViewSelBase<IntView>(home,vbo), max(0) {}
+  forceinline ViewSelStatus
+  ByMaxMax::init(Space&, View x) {
+    max = x.max();
+    return VSS_BETTER;
+  }
+  forceinline ViewSelStatus
+  ByMaxMax::select(Space&, View x) {
+    if (x.max() > max) {
+      max = x.max(); return VSS_BETTER;
+    } else if (x.max() < max) {
+      return VSS_WORSE;
+    } else {
+      return VSS_TIE;
+    }
+  }
+
+  // Select variable with smallest size
+  forceinline
+  BySizeMin::BySizeMin(void) : size(0U) {}
+  forceinline
+  BySizeMin::BySizeMin(Space& home, const VarBranchOptions& vbo)
+    : ViewSelBase<IntView>(home,vbo), size(0U) {}
+  forceinline ViewSelStatus
+  BySizeMin::init(Space&, View x) {
+    size = x.size();
+    return (size == 2) ? VSS_BEST : VSS_BETTER;
+  }
+  forceinline ViewSelStatus
+  BySizeMin::select(Space&, View x) {
+    if (x.size() < size) {
+      size = x.size();
+      return (size == 2) ? VSS_BEST : VSS_BETTER;
+    } else if (x.size() > size) {
+      return VSS_WORSE;
+    } else {
+      return VSS_TIE;
+    }
+  }
+
+  // Select variable with largest size
+  forceinline
+  BySizeMax::BySizeMax(void) : size(0U) {}
+  forceinline
+  BySizeMax::BySizeMax(Space& home, const VarBranchOptions& vbo)
+    : ViewSelBase<IntView>(home,vbo), size(0U) {}
+  forceinline ViewSelStatus
+  BySizeMax::init(Space&, View x) {
+    size = x.size();
+    return VSS_BETTER;
+  }
+  forceinline ViewSelStatus
+  BySizeMax::select(Space&, View x) {
+    if (x.size() > size) {
+      size = x.size();
+      return VSS_BETTER;
+    } else if (x.size() < size) {
+      return VSS_WORSE;
+    } else {
+      return VSS_TIE;
+    }
+  }
+
+  // Select variable with smallest size/degree
+  forceinline
+  BySizeDegreeMin::BySizeDegreeMin(void) : sizedegree(0) {}
+  forceinline
+  BySizeDegreeMin::BySizeDegreeMin(Space& home, const VarBranchOptions& vbo)
+    : ViewSelBase<IntView>(home,vbo), sizedegree(0) {}
+  forceinline ViewSelStatus
+  BySizeDegreeMin::init(Space&, View x) {
+    sizedegree =
+      static_cast<double>(x.size())/static_cast<double>(x.degree());
+    return VSS_BETTER;
+  }
+  forceinline ViewSelStatus
+  BySizeDegreeMin::select(Space&, View x) {
+    double sd =
+      static_cast<double>(x.size())/static_cast<double>(x.degree());
+    if (sd < sizedegree) {
+      sizedegree = sd; return VSS_BETTER;
+    } else if (sd > sizedegree) {
+      return VSS_WORSE;
+    } else {
+      return VSS_TIE;
+    }
+  }
+
+  // Select variable with largest size/degree
+  forceinline
+  BySizeDegreeMax::BySizeDegreeMax(void) : sizedegree(0) {}
+  forceinline
+  BySizeDegreeMax::BySizeDegreeMax(Space& home, const VarBranchOptions& vbo)
+    : ViewSelBase<IntView>(home,vbo), sizedegree(0) {}
+  forceinline ViewSelStatus
+  BySizeDegreeMax::init(Space&, View x) {
+    sizedegree =
+      static_cast<double>(x.size())/static_cast<double>(x.degree());
+    return VSS_BETTER;
+  }
+  forceinline ViewSelStatus
+  BySizeDegreeMax::select(Space&, View x) {
+    double sd =
+      static_cast<double>(x.size())/static_cast<double>(x.degree());
+    if (sd > sizedegree) {
+      sizedegree = sd; return VSS_BETTER;
+    } else if (sd < sizedegree) {
+      return VSS_WORSE;
+    } else {
+      return VSS_TIE;
+    }
+  }
+
+  // Select variable with smallest size/afc
+  forceinline
+  BySizeAfcMin::BySizeAfcMin(void) : sizeafc(0) {}
+  forceinline
+  BySizeAfcMin::BySizeAfcMin(Space& home, const VarBranchOptions& vbo)
+    : ViewSelBase<IntView>(home,vbo), sizeafc(0) {}
+  forceinline ViewSelStatus
+  BySizeAfcMin::init(Space&, View x) {
+    sizeafc = static_cast<double>(x.size())/x.afc();
+    return VSS_BETTER;
+  }
+  forceinline ViewSelStatus
+  BySizeAfcMin::select(Space&, View x) {
+    double sa = static_cast<double>(x.size())/x.afc();
+    if (sa < sizeafc) {
+      sizeafc = sa; return VSS_BETTER;
+    } else if (sa > sizeafc) {
+      return VSS_WORSE;
+    } else {
+      return VSS_TIE;
+    }
+  }
+
+  // Select variable with largest size/afc
+  forceinline
+  BySizeAfcMax::BySizeAfcMax(void) : sizeafc(0) {}
+  forceinline
+  BySizeAfcMax::BySizeAfcMax(Space& home, const VarBranchOptions& vbo)
+    : ViewSelBase<IntView>(home,vbo), sizeafc(0) {}
+  forceinline ViewSelStatus
+  BySizeAfcMax::init(Space&, View x) {
+    sizeafc = static_cast<double>(x.size())/x.afc();
+    return VSS_BETTER;
+  }
+  forceinline ViewSelStatus
+  BySizeAfcMax::select(Space&, View x) {
+    double sa = static_cast<double>(x.size())/x.afc();
+    if (sa > sizeafc) {
+      sizeafc = sa; return VSS_BETTER;
+    } else if (sa < sizeafc) {
+      return VSS_WORSE;
+    } else {
+      return VSS_TIE;
+    }
+  }
+
+  // Select variable with smallest min-regret
+  forceinline
+  ByRegretMinMin::ByRegretMinMin(void) : regret(0U) {}
+  forceinline
+  ByRegretMinMin::ByRegretMinMin(Space& home, const VarBranchOptions& vbo)
+    : ViewSelBase<IntView>(home,vbo), regret(0U) {}
+  forceinline ViewSelStatus
+  ByRegretMinMin::init(Space&, View x) {
+    regret = x.regret_min();
+    return (regret == 1) ? VSS_BEST : VSS_BETTER;
+  }
+  forceinline ViewSelStatus
+  ByRegretMinMin::select(Space&, View x) {
+    if (x.regret_min() < regret) {
+      regret = x.regret_min();
+      return (regret == 1) ? VSS_BEST : VSS_BETTER;
+    } else if (x.regret_min() > regret) {
+      return VSS_WORSE;
+    } else {
+      return VSS_TIE;
+    }
+  }
+
+  // Select variable with largest min-regret
+  forceinline
+  ByRegretMinMax::ByRegretMinMax(void) : regret(0U) {}
+  forceinline
+  ByRegretMinMax::ByRegretMinMax(Space& home, const VarBranchOptions& vbo)
+    : ViewSelBase<IntView>(home,vbo), regret(0U) {}
+  forceinline ViewSelStatus
+  ByRegretMinMax::init(Space&, View x) {
+    regret = x.regret_min();
+    return VSS_BETTER;
+  }
+  forceinline ViewSelStatus
+  ByRegretMinMax::select(Space&, View x) {
+    if (x.regret_min() > regret) {
+      regret = x.regret_min();
+      return VSS_BETTER;
+    } else if (x.regret_min() < regret) {
+      return VSS_WORSE;
+    } else {
+      return VSS_TIE;
+    }
+  }
+
+  // Select variable with smallest max-regret
+  forceinline
+  ByRegretMaxMin::ByRegretMaxMin(void) : regret(0U) {}
+  forceinline
+  ByRegretMaxMin::ByRegretMaxMin(Space& home, const VarBranchOptions& vbo)
+    : ViewSelBase<IntView>(home,vbo), regret(0U) {}
+  forceinline ViewSelStatus
+  ByRegretMaxMin::init(Space&, View x) {
+    regret = x.regret_max();
+    return (regret == 1) ? VSS_BEST : VSS_BETTER;
+  }
+  forceinline ViewSelStatus
+  ByRegretMaxMin::select(Space&, View x) {
+    if (x.regret_max() < regret) {
+      regret = x.regret_max();
+      return (regret == 1) ? VSS_BEST : VSS_BETTER;
+    } else if (x.regret_max() > regret) {
+      return VSS_WORSE;
+    } else {
+      return VSS_TIE;
+    }
+  }
+
+  // Select variable with largest max-regret
+  forceinline
+  ByRegretMaxMax::ByRegretMaxMax(void) : regret(0U) {}
+  forceinline
+  ByRegretMaxMax::ByRegretMaxMax(Space& home, const VarBranchOptions& vbo)
+    : ViewSelBase<IntView>(home,vbo), regret(0U) {}
+  forceinline ViewSelStatus
+  ByRegretMaxMax::init(Space&, View x) {
+    regret = x.regret_max();
+    return VSS_BETTER;
+  }
+  forceinline ViewSelStatus
+  ByRegretMaxMax::select(Space&, View x) {
+    if (x.regret_max() > regret) {
+      regret = x.regret_max();
+      return VSS_BETTER;
+    } else if (x.regret_max() < regret) {
+      return VSS_WORSE;
+    } else {
+      return VSS_TIE;
+    }
+  }
+
+}}}
+
+// STATISTICS: int-branch