gecoder-with-gecode 0.7.1 → 0.8.0

data/ext/gecode-1.3.1/gecode/int/var/bool.icc

@@ -1,52 +0,0 @@
-/*
- *  Main authors:
- *     Christian Schulte <schulte@gecode.org>
- *
- *  Copyright:
- *     Christian Schulte, 2002
- *
- *  Last modified:
- *     $Date: 2005-10-27 17:04:11 +0200 (Thu, 27 Oct 2005) $ by $Author: schulte $
- *     $Revision: 2418 $
- *
- *  This file is part of Gecode, the generic constraint
- *  development environment:
- *     http://www.gecode.org
- *
- *  See the file "LICENSE" for information on usage and
- *  redistribution of this file, and for a
- *     DISCLAIMER OF ALL WARRANTIES.
- *
- */
-
-namespace Gecode {
-
-  forceinline
-  BoolVar::BoolVar(void) {}
-
-  forceinline
-  BoolVar::BoolVar(Space* home, int min, int max)
-    : IntVar(home,min,max) {
-    if ((min < 0) || (max > 1))
-      throw Int::VariableOutOfRangeDomain("BoolVar");
-  }
-
-  forceinline
-  BoolVar::BoolVar(const Int::BoolView& b)
-    : IntVar(b) {}
-
-  forceinline void
-  BoolVar::update(Space* home, bool share, BoolVar& x) {
-    var = x.var->copy(home,share);
-  }
-
-  forceinline
-  BoolVar::BoolVar(const IntVar& x)
-    : IntVar(x) {
-    if ((x.min() < 0) || (x.max() > 1))
-      throw Int::VariableOutOfRangeDomain("BoolVar");
-  }
-
-}
-
-// STATISTICS: int-var

data/ext/gecode-1.3.1/gecode/int/var/imp-body.icc

@@ -1,65 +0,0 @@
-/*
- *  CAUTION:
- *    This file has been automatically generated.
- *    Do not edit, edit the file "../trunk/gecode/int/var-imp.vis" instead.
- *
- *  This file contains generated code fragments which are 
- *  copyrighted as follows:
- *
- *  Main author:
- *     Christian Schulte <schulte@gecode.org>
- *
- *  Copyright:
- *     Christian Schulte, 2006
- *
- *  The generated code fragments are part of Gecode, the generic
- *  constraint development environment:
- *     http://www.gecode.org
- *
- *  See the file "LICENSE" for information on usage and
- *  redistribution of this file, and for a
- *     DISCLAIMER OF ALL WARRANTIES.
- *
- */
-
-
-namespace Gecode { namespace Int {
-
-
-
-  /*
-   * The variable processor for IntVarImpBase
-   *
-   */
-
-  void
-  IntVarImpBase::Processor::process(Space* home, VarBase* _x) {
-    // Process modified variables
-    Gecode::Variable<VTI_INT,PC_INT_DOM,IntMeDiff>* x = 
-      static_cast<Gecode::Variable<VTI_INT,PC_INT_DOM,IntMeDiff>*>(_x);
-    do {
-      switch (x->modevent()) {
-      case ME_INT_VAL:
-        x->process(home);
-        break;
-      case ME_INT_BND:
-        // Conditions: BND DOM 
-        x->process(home,PC_INT_BND,PC_INT_DOM,ME_INT_BND);
-        break;
-      case ME_INT_DOM:
-        // Conditions: DOM 
-        x->process(home,PC_INT_DOM,PC_INT_DOM,ME_INT_DOM);
-        break;
-      default: GECODE_NEVER;
-      }
-      x = x->next();
-    } while (x != NULL);
-  }
-
-  
-  IntVarImpBase::Processor IntVarImpBase::p;
-
-
-}}
-
-// STATISTICS: int-var

data/ext/gecode-1.3.1/gecode/int/var/imp-hdr.icc

@@ -1,191 +0,0 @@
-/*
- *  CAUTION:
- *    This file has been automatically generated.
- *    Do not edit, edit the file "../trunk/gecode/int/var-imp.vis" instead.
- *
- *  This file contains generated code fragments which are 
- *  copyrighted as follows:
- *
- *  Main author:
- *     Christian Schulte <schulte@gecode.org>
- *
- *  Copyright:
- *     Christian Schulte, 2006
- *
- *  The generated code fragments are part of Gecode, the generic
- *  constraint development environment:
- *     http://www.gecode.org
- *
- *  See the file "LICENSE" for information on usage and
- *  redistribution of this file, and for a
- *     DISCLAIMER OF ALL WARRANTIES.
- *
- */
-
-
-namespace Gecode { namespace Int {
-
-  /**
-   * \defgroup TaskActorIntMEPC Integer modification events and propagation conditions
-   * \ingroup TaskActorInt
-   */
-  
-  //@{
-  /// Domain operation has resulted in failure
-  const Gecode::ModEvent ME_INT_FAILED = Gecode::ME_GEN_FAILED;
-
-  /// Domain operation has not changed domain
-  const Gecode::ModEvent ME_INT_NONE = Gecode::ME_GEN_NONE;
-
-  /// Domain operation has resulted in a value (assigned variable)
-  const Gecode::ModEvent ME_INT_VAL = Gecode::ME_GEN_ASSIGNED;
-
-  /** 
-   * \brief Domain operation has changed the minimum or maximum of the domain
-   *
-   * Note that this implies that the domain has not resulted in a value.
-   *
-   * If a propagator subscribes to this variable, it will be processed
-   * assuming a ME_INT_BND modification event.
-   */
-  const Gecode::ModEvent ME_INT_BND = Gecode::ME_GEN_ASSIGNED + 1;
-
-  /** 
-   * \brief Domain operation has changed the domain
-   *
-   * Note that this implies that the domain has not resulted in a value
-   * and that also the minimum and maximum of the domain have not changed.
-   */
-
-
-  const Gecode::ModEvent ME_INT_DOM = Gecode::ME_GEN_ASSIGNED + 2;
-
-  /**
-   * \brief Propagate when a view becomes assigned (single value)
-   *
-   * If a propagator \a p depends on a view \a x with propagation
-   * condition PC_INT_VAL, then \a p is propagated when a domain
-   * update operation on \a x returns the modification event ME_INT_VAL.
-   */
-  const Gecode::PropCond PC_INT_VAL = Gecode::PC_GEN_ASSIGNED;
-
-  /**
-   * \brief Propagate when minimum or maximum of a view changes
-   *
-   * If a propagator \a p depends on a view \a x with propagation
-   * condition PC_INT_BND, then \a p is propagated when a domain
-   * update operation on \a x returns the modification events ME_INT_VAL
-   * or ME_INT_BND.
-   */
-  const Gecode::PropCond PC_INT_BND = Gecode::PC_GEN_ASSIGNED + 1;
-
-  /**
-   * \brief Propagate when domain changes
-   *
-   * If a propagator \a p depends on a view \a x with propagation
-   * condition PC_INT_DOM, then \a p is propagated when a domain
-   * update operation on \a x returns the modification event ME_INT_VAL,
-   * ME_INT_BND, or ME_INT_DOM.
-   */
-  const Gecode::PropCond PC_INT_DOM = Gecode::PC_GEN_ASSIGNED + 2;
-
-  //@}
-
-  /// Modification event difference for Int-variable implementations
-  class IntMeDiff {
-  public:
-    /// Return difference when changing modification event \a me2 to \a me1
-    ModEvent operator()(ModEvent me1, ModEvent me2) const;
-  };
-
-  /// Base-class for Int-variable implementations
-  class IntVarImpBase : public Gecode::Variable<VTI_INT,PC_INT_DOM,IntMeDiff> {
-  protected:
-    /// Variable procesor for variables of this type
-    class Processor : public Gecode::VarTypeProcessor<VTI_INT,PC_INT_DOM,IntMeDiff> {
-    public:
-      /// Process modified variables linked from \a x
-      GECODE_INT_EXPORT virtual void process(Space* home, VarBase* x);
-    };
-    /// The processor used
-    GECODE_INT_EXPORT static Processor p;
-    /// Constructor for cloning \a x
-    IntVarImpBase(Space* home, bool share, IntVarImpBase& x);
-  public:
-    /// Constructor for creating variable
-    IntVarImpBase(Space* home);
-    /// \name Dependencies
-    //@{
-    /** \brief Subscribe propagator \a p with propagation condition \a pc to variable
-     *
-     * In case \a process is false, the propagator is just subscribed but
-     * not processed for execution (this must be used when creating
-     * subscriptions during propagation).
-     *
-     * In case the variable is assigned (that is, \a assigned is 
-     * true), the subscribing propagator is processed for execution.
-     * Otherwise, the propagator subscribes and is processed for execution
-     * with modification event \a me provided that \a pc is different
-     * from \a PC_GEN_ASSIGNED.
-     */
-    void subscribe(Space* home, Propagator* p, PropCond pc, bool assigned, bool process);
-    /// Notify that variable implementation has been modified with modification event \a me
-    void notify(Space* home, ModEvent me);
-    //@}
-
-
-  };
-
-
-  forceinline ModEvent
-  IntMeDiff::operator()(ModEvent me1, ModEvent me2) const {
-    const int med = (
-      (
-        ((ME_INT_NONE ^ ME_INT_NONE) << 0) |  // [ME_INT_NONE][ME_INT_NONE]
-        ((ME_INT_VAL ^ ME_INT_VAL) << 2) |  // [ME_INT_NONE][ME_INT_VAL]
-        ((ME_INT_BND ^ ME_INT_BND) << 4) |  // [ME_INT_NONE][ME_INT_BND]
-        ((ME_INT_DOM ^ ME_INT_DOM) << 6)    // [ME_INT_NONE][ME_INT_DOM]
-      ) |
-      (
-        ((ME_INT_NONE ^ ME_INT_VAL) << 8) |  // [ME_INT_VAL][ME_INT_NONE]
-        ((ME_INT_VAL ^ ME_INT_VAL) << 10) |  // [ME_INT_VAL][ME_INT_VAL]
-        ((ME_INT_BND ^ ME_INT_VAL) << 12) |  // [ME_INT_VAL][ME_INT_BND]
-        ((ME_INT_DOM ^ ME_INT_VAL) << 14)    // [ME_INT_VAL][ME_INT_DOM]
-      ) |
-      (
-        ((ME_INT_NONE ^ ME_INT_BND) << 16) |  // [ME_INT_BND][ME_INT_NONE]
-        ((ME_INT_VAL ^ ME_INT_VAL) << 18) |  // [ME_INT_BND][ME_INT_VAL]
-        ((ME_INT_BND ^ ME_INT_BND) << 20) |  // [ME_INT_BND][ME_INT_BND]
-        ((ME_INT_DOM ^ ME_INT_BND) << 22)    // [ME_INT_BND][ME_INT_DOM]
-      ) |
-      (
-        ((ME_INT_NONE ^ ME_INT_DOM) << 24) |  // [ME_INT_DOM][ME_INT_NONE]
-        ((ME_INT_VAL ^ ME_INT_VAL) << 26) |  // [ME_INT_DOM][ME_INT_VAL]
-        ((ME_INT_BND ^ ME_INT_BND) << 28) |  // [ME_INT_DOM][ME_INT_BND]
-        ((ME_INT_DOM ^ ME_INT_DOM) << 30)    // [ME_INT_DOM][ME_INT_DOM]
-      )
-    );
-    return (((med >> (me1 << 3)) >> (me2 << 1)) & 3);
-  }
-
-  forceinline
-  IntVarImpBase::IntVarImpBase(Space* home)
-    : Gecode::Variable<VTI_INT,PC_INT_DOM,IntMeDiff>(home) {}
-
-  forceinline
-  IntVarImpBase::IntVarImpBase(Space* home, bool share, IntVarImpBase& x)
-    : Gecode::Variable<VTI_INT,PC_INT_DOM,IntMeDiff>(home,share,x) {}
-
-  forceinline void
-  IntVarImpBase::subscribe(Space* home, Propagator* p, PropCond pc, bool assigned, bool process) {
-    Gecode::Variable<VTI_INT,PC_INT_DOM,IntMeDiff>::subscribe(home,p,pc,assigned,ME_INT_BND,process);
-  }
-
-  forceinline void
-  IntVarImpBase::notify(Space* home, ModEvent me) {
-    Gecode::Variable<VTI_INT,PC_INT_DOM,IntMeDiff>::notify(home,me);
-  }
-
-}}
-
-// STATISTICS: int-var

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

@@ -1,361 +0,0 @@
-/*
- *  Main authors:
- *     Christian Schulte <schulte@gecode.org>
- *
- *  Copyright:
- *     Christian Schulte, 2002
- *
- *  Last modified:
- *     $Date: 2006-08-25 10:43:21 +0200 (Fri, 25 Aug 2006) $ by $Author: schulte $
- *     $Revision: 3568 $
- *
- *  This file is part of Gecode, the generic constraint
- *  development environment:
- *     http://www.gecode.org
- *
- *  See the file "LICENSE" for information on usage and
- *  redistribution of this file, and for a
- *     DISCLAIMER OF ALL WARRANTIES.
- *
- */
-
-#include "gecode/int.hh"
-
-#include "gecode/limits.hh"
-
-#include "gecode/int/var/imp-body.icc"
-
-namespace Gecode { namespace Int {
-
-  forceinline bool
-  IntVarImp::closer_min(int n) const {
-    unsigned int l = n - dom.min();
-    unsigned int r = 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
-   *
-   */
-
-  void
-  IntVarImp::lq_full(Space* home, int m) {
-    assert((m >= dom.min()) && (m <= dom.max()));
-    if (range()) { // Is already range...
-      dom.max(m);
-      if (assigned()) goto notify_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()) goto notify_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);
-      }
-    }
-    notify(home,ME_INT_BND);
-    return;
-  notify_val:
-    notify(home,ME_INT_VAL);
-  }
-
-  void
-  IntVarImp::gq_full(Space* home, int m) {
-    assert((m >= dom.min()) && (m <= dom.max()));
-    if (range()) { // Is already range...
-      dom.min(m);
-      if (assigned()) goto notify_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()) goto notify_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);
-      }
-    }
-    notify(home,ME_INT_BND);
-    return;
-  notify_val:
-    notify(home,ME_INT_VAL);
-  }
-
-  void
-  IntVarImp::eq_full(Space* home, int m) {
-    if (!range()) {
-      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()) {
-	dom.min(Limits::Int::int_max+1);
-	return;
-      }
-      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;
-    }
-    dom.min(m); dom.max(m);
-    notify(home,ME_INT_VAL);
-  }
-
-  ModEvent
-  IntVarImp::nq_full(Space* home, int m) {
-    assert(!((m < dom.min()) || (m > dom.max())));
-    if (range()) {
-      if ((m == dom.min()) && (m == dom.max()))
-	return ME_INT_FAILED;
-      if (m == dom.min()) {
-	dom.min(m+1); goto notify_bnd_or_val;
-      }
-      if (m == dom.max()) {
-	dom.max(m-1); goto notify_bnd_or_val;
-      }
-      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;
-	  goto notify_bnd_or_val;
-	} else { // Remains non-range
-	  f_next->prev(fst(),NULL);
-	  fst()->dispose(home); fst(f_next);
-	  holes -= dom.min() - f_min - 1;
-	  goto notify_bnd;
-	}
-      } else if (m == f_min) {
-	dom.min(m+1); fst()->min(m+1);
-	goto notify_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;
-	  goto notify_bnd_or_val;
-	} else { // Remains non-range
-	  l_prev->next(lst(),NULL);
-	  lst()->dispose(home); lst(l_prev);
-	  holes -= l_max - dom.max() - 1;
-	  goto notify_bnd;
-	}
-      } else if (m == l_max) {
-	dom.max(m-1); lst()->max(m-1);
-	goto notify_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);
-	}
-      }
-    }
-    notify(home,ME_INT_DOM);
-    return ME_INT_DOM;
-  notify_bnd_or_val:
-    if (assigned()) {
-      notify(home,ME_INT_VAL);
-      return ME_INT_VAL;
-    }
-  notify_bnd:
-    notify(home,ME_INT_BND);
-    return ME_INT_BND;
-  }
-
-
-
-  /*
-   * Copying variables
-   *
-   */
-
-  forceinline
-  IntVarImp::IntVarImp(Space* home, bool share, IntVarImp& x, bool is_bool)
-    : IntVarImpBase(home,share,x), dom(x.dom.min(),x.dom.max()) { 
-    if (is_bool) {
-      holes = 0; fst(NULL);
-    } else {
-      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 =
-	  reinterpret_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,false);
-  }
-  IntVarImp*
-  IntVarImp::perform_copy_bool(Space* home, bool share) {
-    return new (home) IntVarImp(home,share,*this,true);
-  }
-
-}}
-
-// STATISTICS: int-var