gecoder-with-gecode 0.9.0 → 0.9.1

data/ext/gecode-2.1.1/gecode/int/var-imp/bool.cc

@@ -1,104 +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-01-25 13:35:29 +0100 (Fri, 25 Jan 2008) $ by $Author: tack $
- *     $Revision: 5983 $
- *
- *  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.hh"
-
-namespace Gecode { namespace Int {
-
-  BoolVarImp BoolVarImp::s_one(1);
-  BoolVarImp BoolVarImp::s_zero(0);
-
-  ModEvent
-  BoolVarImp::one_none(Space* home) {
-    assert(none());
-    bits() ^= (NONE ^ ONE);
-    assert(one());
-    IntDelta d(false);
-    return notify(home,ME_BOOL_VAL,&d);
-  }
-
-  ModEvent
-  BoolVarImp::zero_none(Space* home) {
-    assert(none());
-    bits() ^= (NONE ^ ZERO);
-    assert(zero());
-    IntDelta d(false);
-    return notify(home,ME_BOOL_VAL,&d);
-  }
-
-
-  Reflection::Arg*
-  BoolVarImp::spec(const Space*, Reflection::VarMap& m) const {
-    int specIndex = m.index(this);
-    if (specIndex != -1)
-      return Reflection::Arg::newVar(specIndex);
-    Reflection::VarSpec* spec =
-      new Reflection::VarSpec(vti, Reflection::Arg::newInt(status()));
-    return (Reflection::Arg::newVar(m.put(this, spec)));
-  }
-
-
-  VarImpBase*
-  BoolVarImp::create(Space* home, Reflection::VarSpec& spec) {
-    unsigned int dom = spec.dom()->toInt();
-    int min = 0;
-    int max = 1;
-    if (dom == Int::BoolVarImp::ZERO)
-      max = 0;
-    else if (dom == Int::BoolVarImp::ONE)
-      min = 1;
-    return new (home) BoolVarImp(home, min, max);
-  }
-
-  void
-  BoolVarImp::constrain(Space* home, VarImpBase* v,
-                        Reflection::VarSpec& spec) {
-    unsigned int d = spec.dom()->toInt();
-    if (d == Int::BoolVarImp::ZERO) {
-      GECODE_ME_FAIL(home, static_cast<Int::BoolVarImp*>(v)->zero(home));
-    } else if (d == Int::BoolVarImp::ONE) {
-      GECODE_ME_FAIL(home, static_cast<Int::BoolVarImp*>(v)->one(home));
-    }
-  }
-
-  namespace {
-    Reflection::VarImpRegistrar<BoolVarImp> registerBoolVarImp;
-  }
-
-}}
-
-// STATISTICS: int-var

data/ext/gecode-2.1.1/gecode/int/var-imp/int.cc

@@ -1,407 +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: 2008-01-31 21:06:01 +0100 (Thu, 31 Jan 2008) $ by $Author: schulte $
- *     $Revision: 6024 $
- *
- *  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.hh"
-
-namespace Gecode { namespace Int {
-
-  forceinline bool
-  IntVarImp::closer_min(int n) const {
-    unsigned int l = static_cast<unsigned int>(n - dom.min());
-    unsigned int r = static_cast<unsigned int>(dom.max() - n);
-    return l < r;
-  }
-
-  int
-  IntVarImp::med(void) const {
-    // Computes the median
-    if (fst() == NULL)
-      return (dom.min()+dom.max())/2;
-    unsigned int i = size() / 2;
-    const RangeList* p = NULL;
-    const RangeList* c = fst();
-    while (i >= c->width()) {
-      i -= c->width();
-      const RangeList* n=c->next(p); p=c; c=n;
-    }
-    return c->min() + static_cast<int>(i);
-  }
-
-  bool
-  IntVarImp::in_full(int m) const {
-    if (closer_min(m)) {
-      const RangeList* p = NULL;
-      const RangeList* c = fst();
-      while (m > c->max()) {
-        const RangeList* n=c->next(p); p=c; c=n;
-      }
-      return (m >= c->min());
-    } else {
-      const RangeList* n = NULL;
-      const RangeList* c = lst();
-      while (m < c->min()) {
-        const RangeList* p=c->prev(n); n=c; c=p;
-      }
-      return (m <= c->max());
-    }
-  }
-
-  /*
-   * "Standard" tell operations
-   *
-   */
-
-  ModEvent
-  IntVarImp::lq_full(Space* home, int m) {
-    assert((m >= dom.min()) && (m <= dom.max()));
-    IntDelta d(m+1,dom.max());
-    ModEvent me = ME_INT_BND;
-    if (range()) { // Is already range...
-      dom.max(m);
-      if (assigned()) me = ME_INT_VAL;
-    } else if (m < fst()->next(NULL)->min()) { // Becomes range...
-      dom.max(std::min(m,fst()->max()));
-      fst()->dispose(home,NULL,lst());
-      fst(NULL); holes = 0;
-      if (assigned()) me = ME_INT_VAL;
-    } else { // Stays non-range...
-      RangeList* n = NULL;
-      RangeList* c = lst();
-      unsigned int h = 0;
-      while (m < c->min()) {
-        RangeList* p = c->prev(n); c->fix(n);
-        h += (c->min() - p->max() - 1);
-        n=c; c=p;
-      }
-      holes -= h;
-      int max_c = std::min(m,c->max());
-      dom.max(max_c); c->max(max_c);
-      if (c != lst()) {
-        lst()->dispose(home,n);
-        c->next(n,NULL); lst(c);
-      }
-    }
-    return notify(home,me,&d);
-  }
-
-  ModEvent
-  IntVarImp::gq_full(Space* home, int m) {
-    assert((m >= dom.min()) && (m <= dom.max()));
-    IntDelta d(dom.min(),m-1);
-    ModEvent me = ME_INT_BND;
-    if (range()) { // Is already range...
-      dom.min(m);
-      if (assigned()) me = ME_INT_VAL;
-    } else if (m > lst()->prev(NULL)->max()) { // Becomes range...
-      dom.min(std::max(m,lst()->min()));
-      fst()->dispose(home,NULL,lst());
-      fst(NULL); holes = 0;
-      if (assigned()) me = ME_INT_VAL;
-    } else { // Stays non-range...
-      RangeList* p = NULL;
-      RangeList* c = fst();
-      unsigned int h = 0;
-      while (m > c->max()) {
-        RangeList* n = c->next(p); c->fix(n);
-        h += (n->min() - c->max() - 1);
-        p=c; c=n;
-      }
-      holes -= h;
-      int min_c = std::max(m,c->min());
-      dom.min(min_c); c->min(min_c);
-      if (c != fst()) {
-        fst()->dispose(home,p);
-        c->prev(p,NULL); fst(c);
-      }
-    }
-    return notify(home,me,&d);
-  }
-
-  ModEvent
-  IntVarImp::eq_full(Space* home, int m) {
-    dom.min(m); dom.max(m);
-    if (!range()) {
-      bool failed = false;
-      RangeList* p = NULL;
-      RangeList* c = fst();
-      while (m > c->max()) {
-        RangeList* n=c->next(p); c->fix(n); p=c; c=n;
-      }
-      if (m < c->min())
-        failed = true;
-      while (c != NULL) {
-        RangeList* n=c->next(p); c->fix(n); p=c; c=n;
-      }
-      assert(p == lst());
-      fst()->dispose(home,p);
-      fst(NULL); holes = 0;
-      if (failed)
-        return ME_INT_FAILED;
-    }
-    IntDelta d;
-    return notify(home,ME_INT_VAL,&d);
-  }
-
-  ModEvent
-  IntVarImp::nq_full(Space* home, int m) {
-    assert(!((m < dom.min()) || (m > dom.max())));
-    ModEvent me = ME_INT_DOM;
-    if (range()) {
-      if ((m == dom.min()) && (m == dom.max()))
-        return ME_INT_FAILED;
-      if (m == dom.min()) {
-        dom.min(m+1);
-        me = assigned() ? ME_INT_VAL : ME_INT_BND;
-      } else if (m == dom.max()) {
-        dom.max(m-1);
-        me = assigned() ? ME_INT_VAL : ME_INT_BND;
-      } else {
-        RangeList* f = new (home) RangeList(dom.min(),m-1);
-        RangeList* l = new (home) RangeList(m+1,dom.max());
-        f->prevnext(NULL,l);
-        l->prevnext(f,NULL);
-        fst(f); lst(l); holes = 1;
-      }
-    } else if (m < fst()->next(NULL)->min()) { // Concerns the first range...
-      int f_max = fst()->max();
-      if (m > f_max)
-        return ME_INT_NONE;
-      int f_min = dom.min();
-      if ((m == f_min) && (m == f_max)) {
-        RangeList* f_next = fst()->next(NULL);
-        dom.min(f_next->min());
-        if (f_next == lst()) { // Turns into range
-          // Works as at the ends there are only NULL pointers
-          fst()->dispose(home,f_next);
-          fst(NULL); holes = 0;
-          me = assigned() ? ME_INT_VAL : ME_INT_BND;
-        } else { // Remains non-range
-          f_next->prev(fst(),NULL);
-          fst()->dispose(home); fst(f_next);
-          holes -= dom.min() - f_min - 1;
-          me = ME_INT_BND;
-        }
-      } else if (m == f_min) {
-        dom.min(m+1); fst()->min(m+1);
-        me = ME_INT_BND;
-      } else if (m == f_max) {
-        fst()->max(m-1); holes += 1;
-      } else {
-        // Create new hole
-        RangeList* f = new (home) RangeList(f_min,m-1);
-        f->prevnext(NULL,fst());
-        fst()->min(m+1); fst()->prev(NULL,f);
-        fst(f); holes += 1;
-      }
-    } else if (m > lst()->prev(NULL)->max()) { // Concerns the last range...
-      int l_min = lst()->min();
-      if (m < l_min)
-        return ME_INT_NONE;
-      int l_max = dom.max();
-      if ((m == l_min) && (m == l_max)) {
-        RangeList* l_prev = lst()->prev(NULL);
-        dom.max(l_prev->max());
-        if (l_prev == fst()) {
-          // Turns into range
-          l_prev->dispose(home,lst());
-          fst(NULL); holes = 0;
-          me = assigned() ? ME_INT_VAL : ME_INT_BND;
-        } else { // Remains non-range
-          l_prev->next(lst(),NULL);
-          lst()->dispose(home); lst(l_prev);
-          holes -= l_max - dom.max() - 1;
-          me = ME_INT_BND;
-        }
-      } else if (m == l_max) {
-        dom.max(m-1); lst()->max(m-1);
-        me = ME_INT_BND;
-      } else if (m == l_min) {
-        lst()->min(m+1); holes += 1;
-      } else { // Create new hole
-        RangeList* l = new (home) RangeList(m+1,l_max);
-        l->prevnext(lst(),NULL);
-        lst()->max(m-1); lst()->next(NULL,l);
-        lst(l); holes += 1;
-      }
-    } else { // Concerns element in the middle of the list of ranges
-      RangeList* p;
-      RangeList* c;
-      RangeList* n;
-      if (closer_min(m)) {
-        assert(m > fst()->max());
-        p = NULL;
-        c = fst();
-        do {
-          n=c->next(p); p=c; c=n;
-        } while (m > c->max());
-        if (m < c->min())
-          return ME_INT_NONE;
-        n=c->next(p);
-      } else {
-        assert(m < lst()->min());
-        n = NULL;
-        c = lst();
-        do {
-          p=c->prev(n); n=c; c=p;
-        } while (m < c->min());
-        if (m > c->max())
-          return ME_INT_NONE;
-        p=c->prev(n);
-      }
-      assert((fst() != c) && (lst() != c));
-      assert((m >= c->min()) && (m <= c->max()));
-      holes += 1;
-      int c_min = c->min();
-      int c_max = c->max();
-      if ((c_min == m) && (c_max == m)) {
-        c->dispose(home);
-        p->next(c,n); n->prev(c,p);
-      } else if (c_min == m) {
-        c->min(m+1);
-      } else {
-        c->max(m-1);
-        if (c_max != m) {
-          RangeList* l = new (home) RangeList(m+1,c_max);
-          l->prevnext(c,n);
-          c->next(n,l);
-          n->prev(c,l);
-        }
-      }
-    }
-    IntDelta d(m,m);
-    return notify(home,me,&d);
-  }
-
-
-
-  /*
-   * Copying variables
-   *
-   */
-
-  forceinline
-  IntVarImp::IntVarImp(Space* home, bool share, IntVarImp& x)
-    : IntVarImpBase(home,share,x), dom(x.dom.min(),x.dom.max()) { 
-    holes = x.holes;
-    if (holes) {
-      int m = 1;
-      // Compute length
-      {
-        RangeList* s_p = x.fst();
-        RangeList* s_c = s_p->next(NULL);
-        do {
-          m++;
-          RangeList* s_n = s_c->next(s_p); s_p=s_c; s_c=s_n;
-        } while (s_c != NULL);
-      }
-      RangeList* d_c =
-        static_cast<RangeList*>(home->alloc(m*sizeof(RangeList)));
-      fst(d_c); lst(d_c+m-1);
-      d_c->min(x.fst()->min());
-      d_c->max(x.fst()->max());
-      d_c->prevnext(NULL,NULL);
-      RangeList* s_p = x.fst();
-      RangeList* s_c = s_p->next(NULL);
-      do {
-        RangeList* d_n = d_c + 1;
-        d_c->next(NULL,d_n);
-        d_n->prevnext(d_c,NULL);
-        d_n->min(s_c->min()); d_n->max(s_c->max());
-        d_c = d_n;
-        RangeList* s_n=s_c->next(s_p); s_p=s_c; s_c=s_n;
-      } while (s_c != NULL);
-      d_c->next(NULL,NULL);
-    } else {
-      fst(NULL);
-    }
-  }
-
-  IntVarImp*
-  IntVarImp::perform_copy(Space* home, bool share) {
-    return new (home) IntVarImp(home,share,*this);
-  }
-
-  Reflection::Arg*
-  IntVarImp::spec(const Space*, Reflection::VarMap& m) const {
-    int varIndex = m.index(this);
-    if (varIndex != -1)
-      return Reflection::Arg::newVar(varIndex);
-
-    int count = 0;
-    const RangeList* p=NULL;
-    const RangeList* c=ranges_fwd();
-    while (c != NULL) {
-      const RangeList* n = c->next(p); p=c; c=n;
-      count++;
-    }
-    Reflection::IntArrayArg* args = Reflection::Arg::newIntArray(count*2);
-
-    Reflection::VarSpec* spec = new Reflection::VarSpec(vti, args);
-
-    count = 0;
-    p=NULL;
-    c=ranges_fwd();
-    while (c != NULL) {
-      (*args)[count++] = c->min();
-      (*args)[count++] = c->max();
-      const RangeList* n = c->next(p); p=c; c=n;
-    }
-
-    return Reflection::Arg::newVar(m.put(this, spec));
-  }
-
-  VarImpBase*
-  IntVarImp::create(Space* home, Reflection::VarSpec& spec) {
-    Reflection::IntArrayArgRanges ai(spec.dom()->toIntArray());
-    return new (home) IntVarImp(home, IntSet(ai));
-  }
-
-  void
-  IntVarImp::constrain(Space* home, VarImpBase* v,
-                       Reflection::VarSpec& spec) {
-    Reflection::IntArrayArgRanges ai(spec.dom()->toIntArray());
-    GECODE_ME_FAIL(home,
-      static_cast<Int::IntVarImp*>(v)->inter_r(home, ai, false));
-  }
-
-  namespace {
-    Reflection::VarImpRegistrar<IntVarImp> registerIntVarImp;
-  }
-
-}}
-
-// STATISTICS: int-var