gecoder-with-gecode 0.9.0 → 0.9.1

data/ext/gecode-2.1.1/gecode/int/int-set.icc

@@ -1,191 +0,0 @@
-/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
-/*
- *  Main authors:
- *     Christian Schulte <schulte@gecode.org>
- *
- *  Copyright:
- *     Christian Schulte, 2003
- *
- *  Last modified:
- *     $Date: 2008-02-19 16:09:54 +0100 (Tue, 19 Feb 2008) $ by $Author: tack $
- *     $Revision: 6236 $
- *
- *  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 {
-
-  /*
-   * Integer sets
-   *
-   */
-  forceinline
-  IntSet::IntSet(void) {}
-
-  template <class I>
-  IntSet::IntSet(I& i) {
-    Support::DynamicArray<Range> d;
-    int n=0;
-    while (i()) {
-      d[n].min = i.min(); d[n].max = i.max();
-      ++n; ++i;
-    }
-    if (n > 0) {
-      IntSetObject* o = IntSetObject::allocate(n);
-      for (int j=n; j--; )
-        o->r[j]=d[j];
-      object(o);
-    }
-  }
-
-  template <>
-  forceinline
-  IntSet::IntSet(const IntSet& s) 
-    : SharedHandle(s) {}
-
-  template <>
-  forceinline
-  IntSet::IntSet(IntSet& s) 
-    : SharedHandle(s) {}
-
-  forceinline
-  IntSet::IntSet(const int r[][2], int n) { 
-    init(r,n); 
-  }
-
-  forceinline
-  IntSet::IntSet(const int r[], int n) { 
-    init(r,n);
-  }
-
-  forceinline
-  IntSet::IntSet(int n, int m) { 
-    init(n,m); 
-  }
-
-  forceinline int
-  IntSet::min(int i) const {
-    assert(object() != NULL);
-    return static_cast<IntSetObject*>(object())->r[i].min;
-  }
-
-  forceinline int
-  IntSet::max(int i) const {
-    assert(object() != NULL);
-    return static_cast<IntSetObject*>(object())->r[i].max;
-  }
-
-  forceinline unsigned int
-  IntSet::width(int i) const {
-    assert(object() != NULL);
-    IntSetObject* o = static_cast<IntSetObject*>(object());
-    return static_cast<unsigned int>(o->r[i].max-o->r[i].min)+1;
-  }
-
-  forceinline int
-  IntSet::size(void) const {
-    IntSetObject* o = static_cast<IntSetObject*>(object());
-    return (o == NULL) ? 0 : o->n;
-  }
-
-  forceinline int
-  IntSet::min(void) const {
-    IntSetObject* o = static_cast<IntSetObject*>(object());
-    return (o == NULL) ? 1 : o->r[0].min;
-  }
-
-  forceinline int
-  IntSet::max(void) const {
-    IntSetObject* o = static_cast<IntSetObject*>(object());
-    return (o == NULL) ? 0 : o->r[o->n-1].max;
-  }
-
-
-  /*
-   * Range iterator for integer sets
-   *
-   */
-
-  forceinline
-  IntSetRanges::IntSetRanges(void) {}
-  forceinline
-  void
-  IntSetRanges::init(const IntSet& s) {
-    int n = s.size();
-    if (n > 0) {
-      i = &static_cast<IntSet::IntSetObject*>(s.object())->r[0]; e = i+n;
-    } else {
-      i = e = NULL;
-    }    
-  }
-  forceinline
-  IntSetRanges::IntSetRanges(const IntSet& s) { init(s); }
-
-  
-  forceinline void
-  IntSetRanges::operator++(void) {
-    i++;
-  }
-  forceinline bool
-  IntSetRanges::operator()(void) const {
-    return i<e;
-  }
-
-  forceinline int
-  IntSetRanges::min(void) const {
-    return i->min;
-  }
-  forceinline int
-  IntSetRanges::max(void) const {
-    return i->max;
-  }
-  forceinline unsigned int
-  IntSetRanges::width(void) const {
-    return static_cast<unsigned int>(i->max - i->min) + 1;
-  }
-
-  /*
-   * Value iterator for integer sets
-   *
-   */
-  forceinline
-  IntSetValues::IntSetValues(void) {}
-
-  forceinline
-  IntSetValues::IntSetValues(const IntSet& s) {
-    IntSetRanges r(s);
-    Iter::Ranges::ToValues<IntSetRanges>::init(r);
-  }
-
-  forceinline void
-  IntSetValues::init(const IntSet& s) {
-    IntSetRanges r(s);
-    Iter::Ranges::ToValues<IntSetRanges>::init(r);
-  }
-
-}
-
-// STATISTICS: int-var
-

data/ext/gecode-2.1.1/gecode/int/linear-bool.cc

@@ -1,220 +0,0 @@
-/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
-/*
- *  Main authors:
- *     Christian Schulte <schulte@gecode.org>
- *
- *  Copyright:
- *     Christian Schulte, 2006
- *
- *  Last modified:
- *     $Date: 2008-03-06 10:39:58 +0100 (Thu, 06 Mar 2008) $ by $Author: tack $
- *     $Revision: 6446 $
- *
- *  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.
- *
- */
-
-#include "gecode/int/linear.hh"
-
-namespace Gecode {
-
-  using namespace Int;
-
-  void
-  linear(Space* home, const BoolVarArgs& x, IntRelType r, int c,
-         IntConLevel icl, PropKind pk) {
-    if (home->failed()) return;
-
-    int n=x.size();
-    GECODE_AUTOARRAY(Linear::Term<BoolView>, t, n);
-    for (int i=n; i--; ) {
-      t[i].a=1; t[i].x=x[i];
-    }
-
-    Linear::post(home,t,n,r,c,icl,pk);
-  }
-
-  void
-  linear(Space* home, const BoolVarArgs& x, IntRelType r, IntVar y,
-         IntConLevel icl, PropKind pk) {
-    if (home->failed()) return;
-
-    int n=x.size();
-    GECODE_AUTOARRAY(Linear::Term<BoolView>, t, n);
-    for (int i=n; i--; ) {
-      t[i].a=1; t[i].x=x[i];
-    }
-
-    Linear::post(home,t,n,r,y,0,icl,pk);
-  }
-
-  void
-  linear(Space* home,
-         const IntArgs& a, const BoolVarArgs& x, IntRelType r, int c,
-         IntConLevel icl, PropKind pk) {
-    if (a.size() != x.size())
-      throw ArgumentSizeMismatch("Int::linear");
-    if (home->failed()) 
-      return;
-
-    int n=x.size();
-    GECODE_AUTOARRAY(Linear::Term<BoolView>, t, n);
-    for (int i=n; i--; ) {
-      t[i].a=a[i]; t[i].x=x[i];
-    }
-
-    Linear::post(home,t,n,r,c,icl,pk);
-  }
-
-  void
-  linear(Space* home,
-         const IntArgs& a, const BoolVarArgs& x, IntRelType r, IntVar y,
-         IntConLevel icl, PropKind pk) {
-    if (a.size() != x.size())
-      throw ArgumentSizeMismatch("Int::linear");
-    if (home->failed()) 
-      return;
-
-    int n=x.size();
-    GECODE_AUTOARRAY(Linear::Term<BoolView>, t, n);
-    for (int i=n; i--; ) {
-      t[i].a=a[i]; t[i].x=x[i];
-    }
-
-    Linear::post(home,t,n,r,y,0,icl,pk);
-  }
-
-  void
-  linear(Space* home, const BoolVarArgs& x, IntRelType r, int c,
-         BoolVar b, IntConLevel icl, PropKind pk) {
-    if (home->failed()) return;
-
-    int n=x.size();
-    GECODE_AUTOARRAY(Linear::Term<BoolView>, t, n);
-    for (int i=n; i--; ) {
-      t[i].a=1; t[i].x=x[i];
-    }
-
-    Linear::post(home,t,n,r,c,b,icl,pk);
-  }
-
-  void
-  linear(Space* home, const BoolVarArgs& x, IntRelType r, IntVar y,
-         BoolVar b, IntConLevel icl, PropKind pk) {
-    if (home->failed()) return;
-
-    int n=x.size();
-    GECODE_AUTOARRAY(Linear::Term<BoolView>, t, n);
-    for (int i=n; i--; ) {
-      t[i].a=1; t[i].x=x[i];
-    }
-
-    Linear::post(home,t,n,r,y,b,icl,pk);
-  }
-
-  void
-  linear(Space* home,
-         const IntArgs& a, const BoolVarArgs& x, IntRelType r, int c,
-         BoolVar b, IntConLevel icl, PropKind pk) {
-    if (a.size() != x.size())
-      throw ArgumentSizeMismatch("Int::linear");
-    if (home->failed()) return;
-
-    int n=x.size();
-    GECODE_AUTOARRAY(Linear::Term<BoolView>, t, n);
-    for (int i=n; i--; ) {
-      t[i].a=a[i]; t[i].x=x[i];
-    }
-
-    Linear::post(home,t,n,r,c,b,icl,pk);
-  }
-
-  void
-  linear(Space* home,
-         const IntArgs& a, const BoolVarArgs& x, IntRelType r, IntVar y,
-         BoolVar b, IntConLevel icl, PropKind pk) {
-    if (a.size() != x.size())
-      throw ArgumentSizeMismatch("Int::linear");
-    if (home->failed()) return;
-
-    int n=x.size();
-    GECODE_AUTOARRAY(Linear::Term<BoolView>, t, n);
-    for (int i=n; i--; ) {
-      t[i].a=a[i]; t[i].x=x[i];
-    }
-
-    Linear::post(home,t,n,r,y,b,icl,pk);
-  }
-
-
-  namespace {
-    using namespace Int;
-    GECODE_REGISTER1(Linear::EqBoolInt<BoolView>::Memory);
-    GECODE_REGISTER1(Linear::EqBoolInt<BoolView>::Speed);
-    GECODE_REGISTER3(Linear::EqBoolScale<Linear::EmptyScaleBoolArray,Linear::EmptyScaleBoolArray,IntView>);
-    GECODE_REGISTER3(Linear::EqBoolScale<Linear::EmptyScaleBoolArray,Linear::EmptyScaleBoolArray,ZeroIntView>);
-    GECODE_REGISTER3(Linear::EqBoolScale<Linear::EmptyScaleBoolArray,Linear::ScaleBoolArray,IntView>);
-    GECODE_REGISTER3(Linear::EqBoolScale<Linear::EmptyScaleBoolArray,Linear::ScaleBoolArray,ZeroIntView>);
-    GECODE_REGISTER3(Linear::EqBoolScale<Linear::ScaleBoolArray,Linear::EmptyScaleBoolArray,IntView>);
-    GECODE_REGISTER3(Linear::EqBoolScale<Linear::ScaleBoolArray,Linear::EmptyScaleBoolArray,ZeroIntView>);
-    GECODE_REGISTER3(Linear::EqBoolScale<Linear::ScaleBoolArray,Linear::ScaleBoolArray,IntView>);
-    GECODE_REGISTER3(Linear::EqBoolScale<Linear::ScaleBoolArray,Linear::ScaleBoolArray,ZeroIntView>);
-    GECODE_REGISTER2(Linear::EqBoolView<BoolView,IntView>);
-    GECODE_REGISTER2(Linear::EqBoolView<BoolView,MinusView>);
-    GECODE_REGISTER1(Linear::GqBoolInt<BoolView>::Memory);
-    GECODE_REGISTER1(Linear::GqBoolInt<BoolView>::Speed);
-    GECODE_REGISTER1(Linear::GqBoolInt<NegBoolView>::Memory);
-    GECODE_REGISTER1(Linear::GqBoolInt<NegBoolView>::Speed);
-    GECODE_REGISTER2(Linear::GqBoolView<BoolView,IntView>);
-    GECODE_REGISTER2(Linear::GqBoolView<BoolView,MinusView>);
-    GECODE_REGISTER2(Linear::GqBoolView<NegBoolView,IntView>);
-    GECODE_REGISTER2(Linear::GqBoolView<NegBoolView,MinusView>);
-    GECODE_REGISTER3(Linear::LqBoolScale<Linear::EmptyScaleBoolArray,Linear::EmptyScaleBoolArray,IntView>);
-    GECODE_REGISTER3(Linear::LqBoolScale<Linear::EmptyScaleBoolArray,Linear::EmptyScaleBoolArray,MinusView>);
-    GECODE_REGISTER3(Linear::LqBoolScale<Linear::EmptyScaleBoolArray,Linear::EmptyScaleBoolArray,ZeroIntView>);
-    GECODE_REGISTER3(Linear::LqBoolScale<Linear::EmptyScaleBoolArray,Linear::ScaleBoolArray,IntView>);
-    GECODE_REGISTER3(Linear::LqBoolScale<Linear::EmptyScaleBoolArray,Linear::ScaleBoolArray,MinusView>);
-    GECODE_REGISTER3(Linear::LqBoolScale<Linear::EmptyScaleBoolArray,Linear::ScaleBoolArray,ZeroIntView>);
-    GECODE_REGISTER3(Linear::LqBoolScale<Linear::ScaleBoolArray,Linear::EmptyScaleBoolArray,IntView>);
-    GECODE_REGISTER3(Linear::LqBoolScale<Linear::ScaleBoolArray,Linear::EmptyScaleBoolArray,MinusView>);
-    GECODE_REGISTER3(Linear::LqBoolScale<Linear::ScaleBoolArray,Linear::EmptyScaleBoolArray,ZeroIntView>);
-    GECODE_REGISTER3(Linear::LqBoolScale<Linear::ScaleBoolArray,Linear::ScaleBoolArray,IntView>);
-    GECODE_REGISTER3(Linear::LqBoolScale<Linear::ScaleBoolArray,Linear::ScaleBoolArray,MinusView>);
-    GECODE_REGISTER3(Linear::LqBoolScale<Linear::ScaleBoolArray,Linear::ScaleBoolArray,ZeroIntView>);
-    GECODE_REGISTER1(Linear::NqBoolInt<BoolView>);
-    GECODE_REGISTER3(Linear::NqBoolScale<Linear::EmptyScaleBoolArray,Linear::EmptyScaleBoolArray,IntView>);
-    GECODE_REGISTER3(Linear::NqBoolScale<Linear::EmptyScaleBoolArray,Linear::EmptyScaleBoolArray,ZeroIntView>);
-    GECODE_REGISTER3(Linear::NqBoolScale<Linear::EmptyScaleBoolArray,Linear::ScaleBoolArray,IntView>);
-    GECODE_REGISTER3(Linear::NqBoolScale<Linear::EmptyScaleBoolArray,Linear::ScaleBoolArray,ZeroIntView>);
-    GECODE_REGISTER3(Linear::NqBoolScale<Linear::ScaleBoolArray,Linear::EmptyScaleBoolArray,IntView>);
-    GECODE_REGISTER3(Linear::NqBoolScale<Linear::ScaleBoolArray,Linear::EmptyScaleBoolArray,ZeroIntView>);
-    GECODE_REGISTER3(Linear::NqBoolScale<Linear::ScaleBoolArray,Linear::ScaleBoolArray,IntView>);
-    GECODE_REGISTER3(Linear::NqBoolScale<Linear::ScaleBoolArray,Linear::ScaleBoolArray,ZeroIntView>);
-    GECODE_REGISTER2(Linear::NqBoolView<BoolView,IntView>);
-    GECODE_REGISTER2(Linear::NqBoolView<BoolView,MinusView>);
-  }
-
-}
-
-// STATISTICS: int-post

data/ext/gecode-2.1.1/gecode/int/linear-int.cc

@@ -1,240 +0,0 @@
-/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
-/*
- *  Main authors:
- *     Christian Schulte <schulte@gecode.org>
- *
- *  Copyright:
- *     Christian Schulte, 2002
- *
- *  Last modified:
- *     $Date: 2007-11-08 15:53:26 +0100 (Thu, 08 Nov 2007) $ by $Author: tack $
- *     $Revision: 5219 $
- *
- *  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.
- *
- */
-
-#include "gecode/int/linear.hh"
-
-namespace Gecode {
-
-  using namespace Int;
-
-  void
-  linear(Space* home,
-         const IntVarArgs& x, IntRelType r, int c, 
-         IntConLevel icl, PropKind) {
-    if (home->failed()) return;
-    GECODE_AUTOARRAY(Linear::Term<IntView>, t, x.size());
-    for (int i = x.size(); i--; ) {
-      t[i].a=1; t[i].x=x[i];
-    }
-    Linear::post(home,t,x.size(),r,c,icl);
-  }
-
-  void
-  linear(Space* home,
-         const IntVarArgs& x, IntRelType r, int c, BoolVar b, 
-         IntConLevel, PropKind) {
-    if (home->failed()) return;
-    GECODE_AUTOARRAY(Linear::Term<IntView>, t, x.size());
-    for (int i = x.size(); i--; ) {
-      t[i].a=1; t[i].x=x[i];
-    }
-    Linear::post(home,t,x.size(),r,c,b);
-  }
-
-  void
-  linear(Space* home,
-         const IntArgs& a, const IntVarArgs& x, IntRelType r, int c,
-         IntConLevel icl, PropKind) {
-    if (a.size() != x.size())
-      throw ArgumentSizeMismatch("Int::linear");
-    if (home->failed()) return;
-    GECODE_AUTOARRAY(Linear::Term<IntView>, t, x.size());
-    for (int i = x.size(); i--; ) {
-      t[i].a=a[i]; t[i].x=x[i];
-    }
-    Linear::post(home,t,x.size(),r,c,icl);
-  }
-
-  void
-  linear(Space* home,
-         const IntArgs& a, const IntVarArgs& x, IntRelType r, int c, BoolVar b,
-         IntConLevel, PropKind) {
-    if (a.size() != x.size())
-      throw ArgumentSizeMismatch("Int::linear");
-    if (home->failed()) return;
-    GECODE_AUTOARRAY(Linear::Term<IntView>, t, x.size());
-    for (int i = x.size(); i--; ) {
-      t[i].a=a[i]; t[i].x=x[i];
-    }
-    Linear::post(home,t,x.size(),r,c,b);
-  }
-
-  void
-  linear(Space* home,
-         const IntVarArgs& x, IntRelType r, IntVar y, 
-         IntConLevel icl, PropKind) {
-    if (home->failed()) return;
-    GECODE_AUTOARRAY(Linear::Term<IntView>, t, x.size()+1);
-    for (int i = x.size(); i--; ) {
-      t[i].a=1; t[i].x=x[i];
-    }
-    t[x.size()].a=-1; t[x.size()].x=y;
-    Linear::post(home,t,x.size()+1,r,0,icl);
-  }
-
-  void
-  linear(Space* home,
-         const IntVarArgs& x, IntRelType r, IntVar y, BoolVar b,
-         IntConLevel, PropKind) {
-    if (home->failed()) return;
-    GECODE_AUTOARRAY(Linear::Term<IntView>, t, x.size()+1);
-    for (int i = x.size(); i--; ) {
-      t[i].a=1; t[i].x=x[i];
-    }
-    t[x.size()].a=-1; t[x.size()].x=y;
-    Linear::post(home,t,x.size()+1,r,0,b);
-  }
-
-  void
-  linear(Space* home,
-         const IntArgs& a, const IntVarArgs& x, IntRelType r, IntVar y,
-         IntConLevel icl, PropKind) {
-    if (a.size() != x.size())
-      throw ArgumentSizeMismatch("Int::linear");
-    if (home->failed()) return;
-    GECODE_AUTOARRAY(Linear::Term<IntView>, t, x.size()+1);
-    for (int i = x.size(); i--; ) {
-      t[i].a=a[i]; t[i].x=x[i];
-    }
-    t[x.size()].a=-1; t[x.size()].x=y;
-    Linear::post(home,t,x.size()+1,r,0,icl);
-  }
-
-  void
-  linear(Space* home,
-         const IntArgs& a, const IntVarArgs& x, IntRelType r, IntVar y,
-         BoolVar b, IntConLevel, PropKind) {
-    if (a.size() != x.size())
-      throw ArgumentSizeMismatch("Int::linear");
-    if (home->failed()) return;
-    GECODE_AUTOARRAY(Linear::Term<IntView>, t, x.size()+1);
-    for (int i = x.size(); i--; ) {
-      t[i].a=a[i]; t[i].x=x[i];
-    }
-    t[x.size()].a=-1; t[x.size()].x=y;
-    Linear::post(home,t,x.size()+1,r,0,b);
-  }
-
-    namespace {
-      using namespace Int;
-      GECODE_REGISTER3(Linear::DomEq<double,ScaleView<double,double> >);
-      GECODE_REGISTER3(Linear::DomEq<int,ScaleView<int,unsigned int> >);
-      GECODE_REGISTER3(Linear::Eq<double,Linear::NoView,Linear::NoView>);
-      GECODE_REGISTER4(Linear::Eq<double,ScaleView<double,double>,Linear::NoView>);
-      GECODE_REGISTER5(Linear::Eq<double,ScaleView<double,double>,ScaleView<double,double> >);
-      GECODE_REGISTER3(Linear::Eq<int,IntView,IntView>);
-      GECODE_REGISTER3(Linear::Eq<int,IntView,Linear::NoView>);
-      GECODE_REGISTER3(Linear::Eq<int,Linear::NoView,Linear::NoView>);
-      GECODE_REGISTER4(Linear::Eq<int,ScaleView<int,unsigned int>,Linear::NoView>);
-      GECODE_REGISTER5(Linear::Eq<int,ScaleView<int,unsigned int>,ScaleView<int,unsigned int> >);
-      GECODE_REGISTER3(Linear::EqBin<int,IntView,IntView>);
-      GECODE_REGISTER3(Linear::EqBin<int,IntView,MinusView>);
-      GECODE_REGISTER3(Linear::EqBin<int,MinusView,MinusView>);
-      GECODE_REGISTER4(Linear::EqTer<int,IntView,IntView,IntView>);
-      GECODE_REGISTER4(Linear::EqTer<int,IntView,IntView,MinusView>);
-      GECODE_REGISTER4(Linear::EqTer<int,IntView,MinusView,MinusView>);
-      GECODE_REGISTER4(Linear::EqTer<int,MinusView,MinusView,MinusView>);
-      GECODE_REGISTER3(Linear::GqBin<int,IntView,IntView>);
-      GECODE_REGISTER3(Linear::GqBin<int,IntView,MinusView>);
-      GECODE_REGISTER3(Linear::GqBin<int,MinusView,MinusView>);
-      GECODE_REGISTER3(Linear::Lq<double,Linear::NoView,Linear::NoView>);
-      GECODE_REGISTER4(Linear::Lq<double,Linear::NoView,ScaleView<double,double> >);
-      GECODE_REGISTER4(Linear::Lq<double,ScaleView<double,double>,Linear::NoView>);
-      GECODE_REGISTER5(Linear::Lq<double,ScaleView<double,double>,ScaleView<double,double> >);
-      GECODE_REGISTER3(Linear::Lq<int,IntView,IntView>);
-      GECODE_REGISTER3(Linear::Lq<int,IntView,Linear::NoView>);
-      GECODE_REGISTER3(Linear::Lq<int,Linear::NoView,IntView>);
-      GECODE_REGISTER3(Linear::Lq<int,Linear::NoView,Linear::NoView>);
-      GECODE_REGISTER4(Linear::Lq<int,Linear::NoView,ScaleView<int,unsigned int> >);
-      GECODE_REGISTER4(Linear::Lq<int,ScaleView<int,unsigned int>,Linear::NoView>);
-      GECODE_REGISTER5(Linear::Lq<int,ScaleView<int,unsigned int>,ScaleView<int,unsigned int> >);
-      GECODE_REGISTER3(Linear::LqBin<int,IntView,IntView>);
-      GECODE_REGISTER3(Linear::LqBin<int,IntView,MinusView>);
-      GECODE_REGISTER3(Linear::LqBin<int,MinusView,MinusView>);
-      GECODE_REGISTER4(Linear::LqTer<int,IntView,IntView,IntView>);
-      GECODE_REGISTER4(Linear::LqTer<int,IntView,IntView,MinusView>);
-      GECODE_REGISTER4(Linear::LqTer<int,IntView,MinusView,MinusView>);
-      GECODE_REGISTER4(Linear::LqTer<int,MinusView,MinusView,MinusView>);
-      GECODE_REGISTER3(Linear::Nq<double,Linear::NoView,Linear::NoView>);
-      GECODE_REGISTER4(Linear::Nq<double,ScaleView<double,double>,Linear::NoView>);
-      GECODE_REGISTER5(Linear::Nq<double,ScaleView<double,double>,ScaleView<double,double> >);
-      GECODE_REGISTER3(Linear::Nq<int,IntView,IntView>);
-      GECODE_REGISTER3(Linear::Nq<int,IntView,Linear::NoView>);
-      GECODE_REGISTER3(Linear::Nq<int,Linear::NoView,Linear::NoView>);
-      GECODE_REGISTER4(Linear::Nq<int,ScaleView<int,unsigned int>,Linear::NoView>);
-      GECODE_REGISTER5(Linear::Nq<int,ScaleView<int,unsigned int>,ScaleView<int,unsigned int> >);
-      GECODE_REGISTER3(Linear::NqBin<int,IntView,IntView>);
-      GECODE_REGISTER3(Linear::NqBin<int,IntView,MinusView>);
-      GECODE_REGISTER3(Linear::NqBin<int,MinusView,MinusView>);
-      GECODE_REGISTER4(Linear::NqTer<int,IntView,IntView,IntView>);
-      GECODE_REGISTER4(Linear::NqTer<int,IntView,IntView,MinusView>);
-      GECODE_REGISTER4(Linear::NqTer<int,IntView,MinusView,MinusView>);
-      GECODE_REGISTER4(Linear::NqTer<int,MinusView,MinusView,MinusView>);
-      GECODE_REGISTER5(Linear::ReEq<double,ScaleView<double,double>,Linear::NoView,BoolView>);
-      GECODE_REGISTER5(Linear::ReEq<double,ScaleView<double,double>,Linear::NoView,NegBoolView>);
-      GECODE_REGISTER6(Linear::ReEq<double,ScaleView<double,double>,ScaleView<double,double>,BoolView>);
-      GECODE_REGISTER6(Linear::ReEq<double,ScaleView<double,double>,ScaleView<double,double>,NegBoolView>);
-      GECODE_REGISTER4(Linear::ReEq<int,IntView,IntView,BoolView>);
-      GECODE_REGISTER4(Linear::ReEq<int,IntView,IntView,NegBoolView>);
-      GECODE_REGISTER4(Linear::ReEq<int,IntView,Linear::NoView,BoolView>);
-      GECODE_REGISTER4(Linear::ReEq<int,IntView,Linear::NoView,NegBoolView>);
-      GECODE_REGISTER5(Linear::ReEq<int,ScaleView<int,unsigned int>,Linear::NoView,BoolView>);
-      GECODE_REGISTER5(Linear::ReEq<int,ScaleView<int,unsigned int>,Linear::NoView,NegBoolView>);
-      GECODE_REGISTER6(Linear::ReEq<int,ScaleView<int,unsigned int>,ScaleView<int,unsigned int>,BoolView>);
-      GECODE_REGISTER6(Linear::ReEq<int,ScaleView<int,unsigned int>,ScaleView<int,unsigned int>,NegBoolView>);
-      GECODE_REGISTER4(Linear::ReEqBin<int,IntView,IntView,BoolView>);
-      GECODE_REGISTER4(Linear::ReEqBin<int,IntView,IntView,NegBoolView>);
-      GECODE_REGISTER4(Linear::ReEqBin<int,IntView,MinusView,BoolView>);
-      GECODE_REGISTER4(Linear::ReEqBin<int,IntView,MinusView,NegBoolView>);
-      GECODE_REGISTER4(Linear::ReLq<double,Linear::NoView,ScaleView<double,double> >);
-      GECODE_REGISTER4(Linear::ReLq<double,ScaleView<double,double>,Linear::NoView>);
-      GECODE_REGISTER5(Linear::ReLq<double,ScaleView<double,double>,ScaleView<double,double> >);
-      GECODE_REGISTER3(Linear::ReLq<int,IntView,IntView>);
-      GECODE_REGISTER3(Linear::ReLq<int,IntView,Linear::NoView>);
-      GECODE_REGISTER3(Linear::ReLq<int,Linear::NoView,IntView>);
-      GECODE_REGISTER4(Linear::ReLq<int,Linear::NoView,ScaleView<int,unsigned int> >);
-      GECODE_REGISTER4(Linear::ReLq<int,ScaleView<int,unsigned int>,Linear::NoView>);
-      GECODE_REGISTER5(Linear::ReLq<int,ScaleView<int,unsigned int>,ScaleView<int,unsigned int> >);
-      GECODE_REGISTER3(Linear::ReLqBin<int,IntView,IntView>);
-      GECODE_REGISTER3(Linear::ReLqBin<int,IntView,MinusView>);
-      GECODE_REGISTER3(Linear::ReLqBin<int,MinusView,MinusView>);
-    }
-
-}
-
-// STATISTICS: int-post
-