dep-selector-libgecode 1.0.0.alpha.0

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

@@ -0,0 +1,81 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2008
+ *
+ *  Last modified:
+ *     $Date: 2010-09-01 20:02:08 +1000 (Wed, 01 Sep 2010) $ by $Author: schulte $
+ *     $Revision: 11371 $
+ *
+ *  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 {
+
+  /// Post brancher according to \a v and \a vals
+  template<class SelView>
+  void
+  post(Space& home, ViewArray<BoolView>& x, SelView& v,
+       IntValBranch vals, const ValBranchOptions& o_vals, BranchFilter bf) {
+    switch (vals) {
+    case INT_VAL_MIN:
+    case INT_VAL_MED:
+    case INT_VAL_SPLIT_MIN:
+    case INT_VAL_RANGE_MIN:
+    case INT_VALUES_MIN:
+      {
+        ValZeroOne<BoolView> a(home,o_vals);
+        ViewValBrancher<SelView,ValZeroOne<BoolView> >
+          ::post(home,x,v,a,bf);
+      }
+      break;
+    case INT_VAL_MAX:
+    case INT_VAL_SPLIT_MAX:
+    case INT_VAL_RANGE_MAX:
+    case INT_VALUES_MAX:
+      {
+        ValZeroOne<NegBoolView> a(home,o_vals);
+        ViewValBrancher<SelView,ValZeroOne<NegBoolView> >
+          ::post(home,x,v,a,bf);
+      }
+      break;
+    case INT_VAL_RND:
+      {
+        ValRnd<BoolView> a(home,o_vals);
+        ViewValBrancher<SelView,ValRnd<BoolView> >
+          ::post(home,x,v,a,bf);
+      }
+      break;
+    default:
+      throw UnknownBranching("Int::branch");
+    }
+  }
+
+}}}
+
+// STATISTICS: int-branch

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

@@ -0,0 +1,107 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2008
+ *
+ *  Last modified:
+ *     $Date: 2010-09-01 20:02:08 +1000 (Wed, 01 Sep 2010) $ by $Author: schulte $
+ *     $Revision: 11371 $
+ *
+ *  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 {
+
+  /// Post brancher according to \a v and \a vals
+  template<class SelView>
+  void
+  post(Space& home, ViewArray<IntView>& x, SelView& v,
+       IntValBranch vals, const ValBranchOptions& o_vals, BranchFilter bf) {
+    switch (vals) {
+    case INT_VAL_MIN:
+      {
+        ValMin<IntView> a(home,o_vals);
+        ViewValBrancher<SelView,ValMin<IntView> >::post(home,x,v,a,bf);
+      }
+      break;
+    case INT_VAL_MED:
+      {
+        ValMed<IntView> a(home,o_vals);
+        ViewValBrancher<SelView,ValMed<IntView> >::post(home,x,v,a,bf);
+      }
+      break;
+    case INT_VAL_MAX:
+      {
+        ValMin<MinusView> a(home,o_vals);
+        ViewValBrancher<SelView,ValMin<MinusView> >::post(home,x,v,a,bf);
+      }
+      break;
+    case INT_VAL_RND:
+      {
+        ValRnd<IntView> a(home,o_vals);
+        ViewValBrancher<SelView,ValRnd<IntView> >::post(home,x,v,a,bf);
+      }
+      break;
+    case INT_VAL_SPLIT_MIN:
+      {
+        ValSplitMin<IntView> a(home,o_vals);
+        ViewValBrancher<SelView,ValSplitMin<IntView> >::post(home,x,v,a,bf);
+      }
+      break;
+    case INT_VAL_SPLIT_MAX:
+      {
+        ValSplitMin<MinusView> a(home,o_vals);
+        ViewValBrancher<SelView,ValSplitMin<MinusView> >::post(home,x,v,a,bf);
+      }
+      break;
+    case INT_VAL_RANGE_MIN:
+      {
+        ValRangeMin<IntView> a(home,o_vals);
+        ViewValBrancher<SelView,ValRangeMin<IntView> >::post(home,x,v,a,bf);
+      }
+      break;
+    case INT_VAL_RANGE_MAX:
+      {
+        ValRangeMin<MinusView> a(home,o_vals);
+        ViewValBrancher<SelView,ValRangeMin<MinusView> >::post(home,x,v,a,bf);
+      }
+      break;
+    case INT_VALUES_MIN:
+      ViewValuesBrancher<SelView,IntView>::post(home,x,v,bf);
+      break;
+    case INT_VALUES_MAX:
+      ViewValuesBrancher<SelView,MinusView>::post(home,x,v,bf);
+      break;
+    default:
+      throw UnknownBranching("Int::branch");
+    }
+  }
+
+}}}
+
+// STATISTICS: int-branch

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/int/branch/post-view-bool.bs

@@ -0,0 +1,121 @@
+#
+#  Main authors:
+#     Christian Schulte <schulte@gecode.org>
+#
+#  Copyright:
+#     Christian Schulte, 2008
+#
+#  Last modified:
+#     $Date: 2008-01-23 09:51:06 +0100 (Wed, 23 Jan 2008) $ by $Author: tack $
+#     $Revision: 5949 $
+#
+#  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.
+#
+
+[Header]
+
+[Footer]
+
+// STATISTICS: int-branch
+
+[General]
+# Type of view
+View:		BoolView
+# Type of variable argument
+VarArgs:	BoolVarArgs
+# Type of variable branching selection
+VarBranch:	IntVarBranch
+# Type of value branch selection
+ValBranch:	IntValBranch
+# Exception to be thrown if variable branch selection unknown
+Exception:	UnknownBranching("Int::branch")
+# Header file to include
+Include:	<gecode/int/branch.hh>
+# Local namespace
+LNS:		Gecode::Int::Branch
+# Global namespace
+GNS:		Gecode
+[VarBranch]
+# Value for branching selection, mark as special
+Value:		INT_VAR_NONE = NONE
+# Corresponding type
+Type:		ViewSelNone<BoolView>
+[VarBranch]
+Value:		INT_VAR_RND = COMPLETE
+Type:		ViewSelRnd<BoolView>
+[VarBranch]
+Value:		INT_VAR_MIN_MIN
+Type:		ViewSelNone<BoolView>
+[VarBranch]
+Value:		INT_VAR_MIN_MAX
+Type:		ViewSelNone<BoolView>
+[VarBranch]
+Value:		INT_VAR_MAX_MIN
+Type:		ViewSelNone<BoolView>
+[VarBranch]
+Value:		INT_VAR_MAX_MAX
+Type:		ViewSelNone<BoolView>
+[VarBranch]
+Value:		INT_VAR_SIZE_MIN
+Type:		ViewSelNone<BoolView>
+[VarBranch]
+Value:		INT_VAR_SIZE_MAX
+Type:		ViewSelNone<BoolView>
+[VarBranch]
+Value:		INT_VAR_DEGREE_MIN
+Type:		ViewSelDegreeMin<BoolView>
+[VarBranch]
+Value:		INT_VAR_DEGREE_MAX
+Type:		ViewSelDegreeMax<BoolView>
+[VarBranch]
+Value:		INT_VAR_AFC_MIN
+Type:		ViewSelAfcMin<BoolView>
+[VarBranch]
+Value:		INT_VAR_AFC_MAX
+Type:		ViewSelAfcMax<BoolView>
+[VarBranch]
+Value:		INT_VAR_SIZE_DEGREE_MIN
+Type:		ViewSelDegreeMax<BoolView>
+[VarBranch]
+Value:		INT_VAR_SIZE_DEGREE_MAX
+Type:		ViewSelDegreeMin<BoolView>
+[VarBranch]
+Value:		INT_VAR_SIZE_AFC_MIN
+Type:		ViewSelAfcMax<BoolView>
+[VarBranch]
+Value:		INT_VAR_SIZE_AFC_MAX
+Type:		ViewSelAfcMin<BoolView>
+[VarBranch]
+Value:		INT_VAR_REGRET_MIN_MIN
+Type:		ViewSelNone<BoolView>
+[VarBranch]
+Value:		INT_VAR_REGRET_MIN_MAX
+Type:		ViewSelNone<BoolView>
+[VarBranch]
+Value:		INT_VAR_REGRET_MAX_MIN
+Type:		ViewSelNone<BoolView>
+[VarBranch]
+Value:		INT_VAR_REGRET_MAX_MAX
+Type:		ViewSelNone<BoolView>
+[End]

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/int/branch/post-view-bool.cpp

@@ -0,0 +1,438 @@
+/*
+ *  CAUTION:
+ *    This file has been automatically generated. Do not edit,
+ *    edit the specification file
+ *      gecode/int/branch/post-view-bool.bs
+ *    instead.
+ *
+ *  This file contains generated code fragments which are
+ *  copyrighted as follows:
+ *
+ *  Main author:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2008
+ *
+ *  The generated code fragments are 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.
+ *
+ */
+
+#include <gecode/int/branch.hh>
+
+namespace Gecode { namespace Int { namespace Branch {
+
+  /// Create virtual view selector for tie-breaking
+  void
+  virtualize(Gecode::Home home, IntVarBranch vars,
+             const Gecode::VarBranchOptions& o_vars,
+             Gecode::ViewSelVirtualBase<BoolView>*& v) {
+    switch (vars) {
+    case INT_VAR_RND:
+      v = new (home) ViewSelVirtual<ViewSelRnd<BoolView> >(home,o_vars);
+      break;
+    case INT_VAR_MIN_MIN:
+      v = new (home) ViewSelVirtual<ViewSelNone<BoolView> >(home,o_vars);
+      break;
+    case INT_VAR_MIN_MAX:
+      v = new (home) ViewSelVirtual<ViewSelNone<BoolView> >(home,o_vars);
+      break;
+    case INT_VAR_MAX_MIN:
+      v = new (home) ViewSelVirtual<ViewSelNone<BoolView> >(home,o_vars);
+      break;
+    case INT_VAR_MAX_MAX:
+      v = new (home) ViewSelVirtual<ViewSelNone<BoolView> >(home,o_vars);
+      break;
+    case INT_VAR_SIZE_MIN:
+      v = new (home) ViewSelVirtual<ViewSelNone<BoolView> >(home,o_vars);
+      break;
+    case INT_VAR_SIZE_MAX:
+      v = new (home) ViewSelVirtual<ViewSelNone<BoolView> >(home,o_vars);
+      break;
+    case INT_VAR_DEGREE_MIN:
+      v = new (home) ViewSelVirtual<ViewSelDegreeMin<BoolView> >(home,o_vars);
+      break;
+    case INT_VAR_DEGREE_MAX:
+      v = new (home) ViewSelVirtual<ViewSelDegreeMax<BoolView> >(home,o_vars);
+      break;
+    case INT_VAR_AFC_MIN:
+      v = new (home) ViewSelVirtual<ViewSelAfcMin<BoolView> >(home,o_vars);
+      break;
+    case INT_VAR_AFC_MAX:
+      v = new (home) ViewSelVirtual<ViewSelAfcMax<BoolView> >(home,o_vars);
+      break;
+    case INT_VAR_SIZE_DEGREE_MIN:
+      v = new (home) ViewSelVirtual<ViewSelDegreeMax<BoolView> >(home,o_vars);
+      break;
+    case INT_VAR_SIZE_DEGREE_MAX:
+      v = new (home) ViewSelVirtual<ViewSelDegreeMin<BoolView> >(home,o_vars);
+      break;
+    case INT_VAR_SIZE_AFC_MIN:
+      v = new (home) ViewSelVirtual<ViewSelAfcMax<BoolView> >(home,o_vars);
+      break;
+    case INT_VAR_SIZE_AFC_MAX:
+      v = new (home) ViewSelVirtual<ViewSelAfcMin<BoolView> >(home,o_vars);
+      break;
+    case INT_VAR_REGRET_MIN_MIN:
+      v = new (home) ViewSelVirtual<ViewSelNone<BoolView> >(home,o_vars);
+      break;
+    case INT_VAR_REGRET_MIN_MAX:
+      v = new (home) ViewSelVirtual<ViewSelNone<BoolView> >(home,o_vars);
+      break;
+    case INT_VAR_REGRET_MAX_MIN:
+      v = new (home) ViewSelVirtual<ViewSelNone<BoolView> >(home,o_vars);
+      break;
+    case INT_VAR_REGRET_MAX_MAX:
+      v = new (home) ViewSelVirtual<ViewSelNone<BoolView> >(home,o_vars);
+      break;
+    default:
+      throw UnknownBranching("Int::branch");
+    }
+  }
+
+}}}
+
+namespace Gecode {
+
+  void
+  branch(Gecode::Home home, const BoolVarArgs& x,
+         IntVarBranch vars, IntValBranch vals,
+         const Gecode::VarBranchOptions& o_vars,
+         const Gecode::ValBranchOptions& o_vals) {
+    using namespace Gecode;
+    using namespace Gecode::Int;
+    using namespace Gecode::Int::Branch;
+
+
+    if (home.failed()) return;
+    ViewArray<BoolView> xv(home,x);
+    switch (vars) {
+    case INT_VAR_NONE:
+      {
+        ViewSelNone<BoolView> v(home,o_vars);
+        post(home,xv,v,vals,o_vals,o_vars.bf);
+      }
+      break;
+    case INT_VAR_RND:
+      {
+        ViewSelRnd<BoolView> v(home,o_vars);
+        post(home,xv,v,vals,o_vals,o_vars.bf);
+      }
+      break;
+    case INT_VAR_MIN_MIN:
+      {
+        ViewSelNone<BoolView> v(home,o_vars);
+        post(home,xv,v,vals,o_vals,o_vars.bf);
+      }
+      break;
+    case INT_VAR_MIN_MAX:
+      {
+        ViewSelNone<BoolView> v(home,o_vars);
+        post(home,xv,v,vals,o_vals,o_vars.bf);
+      }
+      break;
+    case INT_VAR_MAX_MIN:
+      {
+        ViewSelNone<BoolView> v(home,o_vars);
+        post(home,xv,v,vals,o_vals,o_vars.bf);
+      }
+      break;
+    case INT_VAR_MAX_MAX:
+      {
+        ViewSelNone<BoolView> v(home,o_vars);
+        post(home,xv,v,vals,o_vals,o_vars.bf);
+      }
+      break;
+    case INT_VAR_SIZE_MIN:
+      {
+        ViewSelNone<BoolView> v(home,o_vars);
+        post(home,xv,v,vals,o_vals,o_vars.bf);
+      }
+      break;
+    case INT_VAR_SIZE_MAX:
+      {
+        ViewSelNone<BoolView> v(home,o_vars);
+        post(home,xv,v,vals,o_vals,o_vars.bf);
+      }
+      break;
+    case INT_VAR_DEGREE_MIN:
+      {
+        ViewSelDegreeMin<BoolView> v(home,o_vars);
+        post(home,xv,v,vals,o_vals,o_vars.bf);
+      }
+      break;
+    case INT_VAR_DEGREE_MAX:
+      {
+        ViewSelDegreeMax<BoolView> v(home,o_vars);
+        post(home,xv,v,vals,o_vals,o_vars.bf);
+      }
+      break;
+    case INT_VAR_AFC_MIN:
+      {
+        ViewSelAfcMin<BoolView> v(home,o_vars);
+        post(home,xv,v,vals,o_vals,o_vars.bf);
+      }
+      break;
+    case INT_VAR_AFC_MAX:
+      {
+        ViewSelAfcMax<BoolView> v(home,o_vars);
+        post(home,xv,v,vals,o_vals,o_vars.bf);
+      }
+      break;
+    case INT_VAR_SIZE_DEGREE_MIN:
+      {
+        ViewSelDegreeMax<BoolView> v(home,o_vars);
+        post(home,xv,v,vals,o_vals,o_vars.bf);
+      }
+      break;
+    case INT_VAR_SIZE_DEGREE_MAX:
+      {
+        ViewSelDegreeMin<BoolView> v(home,o_vars);
+        post(home,xv,v,vals,o_vals,o_vars.bf);
+      }
+      break;
+    case INT_VAR_SIZE_AFC_MIN:
+      {
+        ViewSelAfcMax<BoolView> v(home,o_vars);
+        post(home,xv,v,vals,o_vals,o_vars.bf);
+      }
+      break;
+    case INT_VAR_SIZE_AFC_MAX:
+      {
+        ViewSelAfcMin<BoolView> v(home,o_vars);
+        post(home,xv,v,vals,o_vals,o_vars.bf);
+      }
+      break;
+    case INT_VAR_REGRET_MIN_MIN:
+      {
+        ViewSelNone<BoolView> v(home,o_vars);
+        post(home,xv,v,vals,o_vals,o_vars.bf);
+      }
+      break;
+    case INT_VAR_REGRET_MIN_MAX:
+      {
+        ViewSelNone<BoolView> v(home,o_vars);
+        post(home,xv,v,vals,o_vals,o_vars.bf);
+      }
+      break;
+    case INT_VAR_REGRET_MAX_MIN:
+      {
+        ViewSelNone<BoolView> v(home,o_vars);
+        post(home,xv,v,vals,o_vals,o_vars.bf);
+      }
+      break;
+    case INT_VAR_REGRET_MAX_MAX:
+      {
+        ViewSelNone<BoolView> v(home,o_vars);
+        post(home,xv,v,vals,o_vals,o_vars.bf);
+      }
+      break;
+    default:
+      throw UnknownBranching("Int::branch");
+    }
+  }
+
+  void
+  branch(Gecode::Home home, const BoolVarArgs& x,
+         const Gecode::TieBreakVarBranch<IntVarBranch>& vars,
+         IntValBranch vals,
+         const Gecode::TieBreakVarBranchOptions& o_vars,
+         const Gecode::ValBranchOptions& o_vals) {
+    using namespace Gecode;
+    using namespace Gecode::Int;
+    using namespace Gecode::Int::Branch;
+
+
+    if (home.failed()) return;
+    if ((vars.a == INT_VAR_NONE) || (vars.a == INT_VAR_RND) ||
+        ((vars.b == INT_VAR_NONE) && (vars.c == INT_VAR_NONE) && (vars.d == INT_VAR_NONE))) {
+      branch(home,x,vars.a,vals,o_vars.a,o_vals);
+      return;
+    }
+    ViewArray<BoolView> xv(home,x);
+    Gecode::ViewSelVirtualBase<BoolView>* tb[3];
+    int n=0;
+    if (vars.b != INT_VAR_NONE)
+      virtualize(home,vars.b,o_vars.b,tb[n++]);
+    if (vars.c != INT_VAR_NONE)
+      virtualize(home,vars.c,o_vars.c,tb[n++]);
+    if (vars.d != INT_VAR_NONE)
+      virtualize(home,vars.d,o_vars.d,tb[n++]);
+    assert(n > 0);
+    ViewSelTieBreakDynamic<BoolView> vbcd(home,tb,n);
+    switch (vars.a) {
+    case INT_VAR_MIN_MIN:
+      {
+        ViewSelNone<BoolView> va(home,o_vars.a);
+        ViewSelTieBreakStatic<ViewSelNone<BoolView>,
+          ViewSelTieBreakDynamic<BoolView> > v(home,va,vbcd);
+        post(home,xv,v,vals,o_vals,o_vars.a.bf);
+      }
+      break;
+    case INT_VAR_MIN_MAX:
+      {
+        ViewSelNone<BoolView> va(home,o_vars.a);
+        ViewSelTieBreakStatic<ViewSelNone<BoolView>,
+          ViewSelTieBreakDynamic<BoolView> > v(home,va,vbcd);
+        post(home,xv,v,vals,o_vals,o_vars.a.bf);
+      }
+      break;
+    case INT_VAR_MAX_MIN:
+      {
+        ViewSelNone<BoolView> va(home,o_vars.a);
+        ViewSelTieBreakStatic<ViewSelNone<BoolView>,
+          ViewSelTieBreakDynamic<BoolView> > v(home,va,vbcd);
+        post(home,xv,v,vals,o_vals,o_vars.a.bf);
+      }
+      break;
+    case INT_VAR_MAX_MAX:
+      {
+        ViewSelNone<BoolView> va(home,o_vars.a);
+        ViewSelTieBreakStatic<ViewSelNone<BoolView>,
+          ViewSelTieBreakDynamic<BoolView> > v(home,va,vbcd);
+        post(home,xv,v,vals,o_vals,o_vars.a.bf);
+      }
+      break;
+    case INT_VAR_SIZE_MIN:
+      {
+        ViewSelNone<BoolView> va(home,o_vars.a);
+        ViewSelTieBreakStatic<ViewSelNone<BoolView>,
+          ViewSelTieBreakDynamic<BoolView> > v(home,va,vbcd);
+        post(home,xv,v,vals,o_vals,o_vars.a.bf);
+      }
+      break;
+    case INT_VAR_SIZE_MAX:
+      {
+        ViewSelNone<BoolView> va(home,o_vars.a);
+        ViewSelTieBreakStatic<ViewSelNone<BoolView>,
+          ViewSelTieBreakDynamic<BoolView> > v(home,va,vbcd);
+        post(home,xv,v,vals,o_vals,o_vars.a.bf);
+      }
+      break;
+    case INT_VAR_DEGREE_MIN:
+      {
+        ViewSelDegreeMin<BoolView> va(home,o_vars.a);
+        ViewSelTieBreakStatic<ViewSelDegreeMin<BoolView>,
+          ViewSelTieBreakDynamic<BoolView> > v(home,va,vbcd);
+        post(home,xv,v,vals,o_vals,o_vars.a.bf);
+      }
+      break;
+    case INT_VAR_DEGREE_MAX:
+      {
+        ViewSelDegreeMax<BoolView> va(home,o_vars.a);
+        ViewSelTieBreakStatic<ViewSelDegreeMax<BoolView>,
+          ViewSelTieBreakDynamic<BoolView> > v(home,va,vbcd);
+        post(home,xv,v,vals,o_vals,o_vars.a.bf);
+      }
+      break;
+    case INT_VAR_AFC_MIN:
+      {
+        ViewSelAfcMin<BoolView> va(home,o_vars.a);
+        ViewSelTieBreakStatic<ViewSelAfcMin<BoolView>,
+          ViewSelTieBreakDynamic<BoolView> > v(home,va,vbcd);
+        post(home,xv,v,vals,o_vals,o_vars.a.bf);
+      }
+      break;
+    case INT_VAR_AFC_MAX:
+      {
+        ViewSelAfcMax<BoolView> va(home,o_vars.a);
+        ViewSelTieBreakStatic<ViewSelAfcMax<BoolView>,
+          ViewSelTieBreakDynamic<BoolView> > v(home,va,vbcd);
+        post(home,xv,v,vals,o_vals,o_vars.a.bf);
+      }
+      break;
+    case INT_VAR_SIZE_DEGREE_MIN:
+      {
+        ViewSelDegreeMax<BoolView> va(home,o_vars.a);
+        ViewSelTieBreakStatic<ViewSelDegreeMax<BoolView>,
+          ViewSelTieBreakDynamic<BoolView> > v(home,va,vbcd);
+        post(home,xv,v,vals,o_vals,o_vars.a.bf);
+      }
+      break;
+    case INT_VAR_SIZE_DEGREE_MAX:
+      {
+        ViewSelDegreeMin<BoolView> va(home,o_vars.a);
+        ViewSelTieBreakStatic<ViewSelDegreeMin<BoolView>,
+          ViewSelTieBreakDynamic<BoolView> > v(home,va,vbcd);
+        post(home,xv,v,vals,o_vals,o_vars.a.bf);
+      }
+      break;
+    case INT_VAR_SIZE_AFC_MIN:
+      {
+        ViewSelAfcMax<BoolView> va(home,o_vars.a);
+        ViewSelTieBreakStatic<ViewSelAfcMax<BoolView>,
+          ViewSelTieBreakDynamic<BoolView> > v(home,va,vbcd);
+        post(home,xv,v,vals,o_vals,o_vars.a.bf);
+      }
+      break;
+    case INT_VAR_SIZE_AFC_MAX:
+      {
+        ViewSelAfcMin<BoolView> va(home,o_vars.a);
+        ViewSelTieBreakStatic<ViewSelAfcMin<BoolView>,
+          ViewSelTieBreakDynamic<BoolView> > v(home,va,vbcd);
+        post(home,xv,v,vals,o_vals,o_vars.a.bf);
+      }
+      break;
+    case INT_VAR_REGRET_MIN_MIN:
+      {
+        ViewSelNone<BoolView> va(home,o_vars.a);
+        ViewSelTieBreakStatic<ViewSelNone<BoolView>,
+          ViewSelTieBreakDynamic<BoolView> > v(home,va,vbcd);
+        post(home,xv,v,vals,o_vals,o_vars.a.bf);
+      }
+      break;
+    case INT_VAR_REGRET_MIN_MAX:
+      {
+        ViewSelNone<BoolView> va(home,o_vars.a);
+        ViewSelTieBreakStatic<ViewSelNone<BoolView>,
+          ViewSelTieBreakDynamic<BoolView> > v(home,va,vbcd);
+        post(home,xv,v,vals,o_vals,o_vars.a.bf);
+      }
+      break;
+    case INT_VAR_REGRET_MAX_MIN:
+      {
+        ViewSelNone<BoolView> va(home,o_vars.a);
+        ViewSelTieBreakStatic<ViewSelNone<BoolView>,
+          ViewSelTieBreakDynamic<BoolView> > v(home,va,vbcd);
+        post(home,xv,v,vals,o_vals,o_vars.a.bf);
+      }
+      break;
+    case INT_VAR_REGRET_MAX_MAX:
+      {
+        ViewSelNone<BoolView> va(home,o_vars.a);
+        ViewSelTieBreakStatic<ViewSelNone<BoolView>,
+          ViewSelTieBreakDynamic<BoolView> > v(home,va,vbcd);
+        post(home,xv,v,vals,o_vals,o_vars.a.bf);
+      }
+      break;
+    default:
+      throw UnknownBranching("Int::branch");
+    }
+  }
+
+}
+
+
+// STATISTICS: int-branch
+