gecoder-with-gecode 0.7.1 → 0.8.0

data/ext/gecode-1.3.1/gecode/int/gcc.hh

@@ -1,338 +0,0 @@
-/*
- *  Main authors:
- *     Patrick Pekczynski <pekczynski@ps.uni-sb.de>
- *
- *  Copyright:
- *     Patrick Pekczynski, 2004/2005
- *
- *  Last modified:
- *     $Date: 2006-08-04 16:03:26 +0200 (Fri, 04 Aug 2006) $ by $Author: schulte $
- *     $Revision: 3512 $
- *
- *  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.
- *
- */
-
-#ifndef __GECODE_INT_GCC_HH__
-#define __GECODE_INT_GCC_HH__
-
-#include "gecode/int.hh"
-#include "gecode/support/sort.hh"
-#include "gecode/support/static-stack.hh"
-#include "gecode/int/gcc/gccbndsup.icc"
-#include "gecode/int/gcc/graphsup.icc"
-#include "gecode/int/gcc/occur.icc"
-
-/**
- * \namespace Gecode::Int::GCC
- * \brief Global cardinality propagators
- * \note The global cardinality propagator with fixed cardinalities does not
- *       not support sharing!
- *
- */
-
-namespace Gecode { namespace Int { namespace GCC {
-
-  /**
-   * \brief Bounds-consistent global cardinality propagator
-   * \par [Reference]
-   *  The algorithm is taken from: \n
-     \verbatim
-     @PROCEEDINGS{quimper-efficient,
-     title     = {An Efficient Bounds Consistency Algorithm
-                  for the Global Cardinality Constraint},
-     year      = {2003},
-     volume    = {2833},
-     address   = {Kinsale, Ireland},
-     month     = {September},
-     author    = {Claude-Guy Quimper and Peter van Beek
-                  and Alejandro L�pez-Ortiz
-                  and Alexander Golynski and Sayyed Bashir Sadjad},
-     booktitle = {Proceedings of the 9th International Conference
-                  on Principles and Practice of
-		  Constraint Programming},
-     pages     = {600--614},
-     url       = {http://ai.uwaterloo.ca/~vanbeek/publications},
-     }
-     @TECHREPORT{quimper-efficientTR,
-     author      = {Claude-Guy Quimper and Peter van Beek
-                    and Alejandro L�pez-Ortiz
-                    and Alexander Golynski and
-		    Sayyed Bashir Sadjad},
-     title       = {An Efficient Bounds Consistency Algorithm
-                    for the Global Cardinality Constraint,
-		    Technical Report},
-     institution = {School of Computer Science,
-                    University of Waterloo, Waterloo, Canada},
-     year        = {2003},
-     url         = {http://ai.uwaterloo.ca/~vanbeek/publications},
-     }
-     \endverbatim
-   *
-   * This implementation uses the code that is provided
-   * by Peter Van Beek:\n
-   * http://ai.uwaterloo.ca/~vanbeek/software/software.html
-   * The code here has only been slightly modified to fit Gecode
-   * (taking idempotent/non-idempotent propagation into account)
-   * and uses a more efficient layout of datastructures (keeping the
-   * number of different arrays small).
-   *
-   * The Bnd class is used to post the propagator and BndImp
-   * is the actual implementation taking shared variables into account.
-   *
-   * Requires \code #include "gecode/int/gcc.hh" \endcode
-   * \ingroup FuncIntProp
-   */
-
-  template <class View, class Card, bool isView>
-  class Bnd{
-  public:
-    /**
-     * \brief Post propagator for views \a x and cardinalities \a k
-     *
-     * \a all denotes whether the propagator uses all value occuring
-     * in the domains of the problem vies specified in \a x. Also
-     * checks whether \a x and \a k contain shared views.
-     */
-    static  ExecStatus  post(Space* home,
-			     ViewArray<View>& x,
-			     ViewArray<Card>& k,
-			     bool all);
-  };
-
-  /**
-   * \brief Implementation of the bounds consistent
-   * global cardinality propagator
-   */
-  template <class View, class Card, bool isView, bool shared>
-  class BndImp : public Propagator {
-    friend class Bnd<View, Card, isView>;
-  protected:
-    /// Views on which to perform bounds-propagation
-    ViewArray<View> x;
-    /// Array containing either fixed cardinalities or CardViews
-    ViewArray<Card> k;
-    /**
-     * \brief  Data structure storing the sum of the views lower bounds
-     * Necessary for reasoning about the interval capacities in the
-     * propagation algorithm.
-     */
-    PartialSum<Card>* lps;
-    /// Data structure storing the sum of the views upper bounds
-    PartialSum<Card>* ups;
-    /**
-     * \brief Stores whether cardinalities are all assigned
-     *
-     * If all cardinalities are assigned the propagation algorithm
-     * only has to perform propagation for the upper bounds.
-     */
-    bool card_fixed;
-    /**
-     * \brief Stores whether all values in domains of the x-views are used
-     * for cardinality reasoning or whether we only use a subset of them.
-     */
-    bool card_all;
-    /**
-     * \brief Stores whether the minium required occurences of
-     *        the cardinalities are all zero. If so, we do not need
-     *        to perform lower bounds propagation.
-     */
-    bool skip_lbc;
-    /// Constructor for posting
-    BndImp(Space* home, ViewArray<View>&, ViewArray<Card>&, bool, bool, bool);
-    /// Constructor for cloning \a p
-    BndImp(Space* home, bool share, BndImp<View, Card, isView, shared>& p);
-
-  public:
-    /// Destructor
-    virtual size_t dispose(Space* home);
-    /// Flush partial sum data structures
-    virtual void flush(void);
-    /// Copy propagator during cloning
-    virtual Actor* copy(Space* home, bool share);
-    /// Cost funtion returning dynamic PC_LINEAR_HI.
-    virtual PropCost    cost (void) const;
-    /// Perform propagation
-    virtual ExecStatus  propagate(Space* home);
-  };
-
-  /**
-   * \brief Performs bounds-consistent global cardinality propagation
-   *
-   * This function implements the propagation algorithm for
-   * the bounds-consistent global cardinality propagator implemented
-   * in GCC::Bnd. It is available as seperate function in order
-   * to allow staging for GCC::Dom and GCC::Bnd though staging is
-   * currently not used due to technical difficulties.
-   */
-  template <class View, class Card, bool isView, bool shared>
-  ExecStatus prop_bnd(Space* home, ViewArray<View>&, ViewArray<Card>&,
-		      PartialSum<Card>*&, PartialSum<Card>*&,
-		      bool, bool, bool);
-
-  /**
-   * \brief Domain-consistent global cardinality propagator
-   * \par [Reference]
-   *  The algorithm is taken from: \n
-   * \anchor CardVarNPCompl
-   \verbatim
-     @PROCEEDINGS{improvedgcc,
-     title     = {Improved Algorithms for the
-                  Global Cardinality Constraint},
-     year      = {2004},
-     volume    = {3528},
-     address   = {Toronto, Canada},
-     month     = {September},
-     author    = {Claude-Guy Quimper and Peter van Beek and
-                  Alejandro L�pez-Ortiz and Alexander Golynski},
-     booktitle = {Proceedings of the 10th International
-                  Conference on Principles and Practice of
-		  Constraint Programming},
-     url       = {http://ai.uwaterloo.ca/~vanbeek/publications},
-     }
-     \endverbatim
-   *
-   * Requires \code #include "gecode/int/gcc.hh" \endcode
-   * \ingroup FuncIntProp
-   */
-
-  template <class View, class Card, bool isView>
-  class Dom : public Propagator {
-  protected:
-    /// Views on which to perform domain-propagation
-    ViewArray<View> x;
-    /**
-     * \brief Views used to channel information between \c x and \c k
-     * (\f$ x \subseteq y \f$).
-     */
-    ViewArray<View> y;
-    /// Array containing either fixed cardinalities or CardViews
-    ViewArray<Card> k;
-    /// Propagation is performed on a variable-value graph (used as cache)
-    VarValGraph<View, Card, isView>* vvg;
-    /**
-     * \brief Stores whether cardinalities are all assigned
-     *
-     * If all cardinalities are assigned the propagation algorithm
-     * only has to perform propagation for the upper bounds.
-     */
-    bool card_fixed;
-    /**
-     * \brief Stores whether all values in domains of the x-views are used
-     * for cardinality reasoning or whether we only use a subset of them.
-     */
-    bool card_all;
-    /// Constructor for cloning \a p
-    Dom(Space* home, bool share, Dom<View, Card, isView>& p);
-    /// Constructor for posting
-    Dom(Space* home, ViewArray<View>&, ViewArray<Card>&, bool, bool);
-
-  public:
-    /// Destructor including deallocation of variable-value graph
-    virtual size_t dispose(Space* home);
-    /// Flush variable-value graph
-    virtual void flush(void);
-    /// Copy propagator during cloning
-    virtual Actor* copy(Space* home, bool share);
-    /**
-     * \brief Cost function
-     *
-     * As the propagation stronlgy depends on the domain size of the
-     * views on which propagation is performed, the propagation costs
-     * are computed as follows, where \c d denotes the size of the
-     * largest domain of a view in \c x:
-     * - dynamic PC_LINEAR_LO ( \f$ d < 6\f$ )
-     * - dynamic PC_LINEAR_HI ( \f$ 6 \leq d < \frac{n}{2} \f$ )
-     * - dynamic PC_QUADRATIC_LO ( \f$ \frac{n}{2} \leq d < n^2 \f$)
-     * - dynamic PC_CUBIC_LO  ( \f$ n^2 \leq d \f$)
-     */
-    virtual PropCost    cost (void) const;
-    /// Perform propagation
-    virtual ExecStatus  propagate(Space* home);
-    /**
-     * \brief Post propagator for views \a x and cardinalities \a k
-     *
-     * \a all denotes whether the propagator uses all value occuring
-     * in the domains of the problem vies specified in \a x.
-     */
-    static  ExecStatus  post(Space* home,
-			     ViewArray<View>& x, ViewArray<Card>& k,
-			     bool all);
-  };
-
-  /**
-   * \brief Value consistent global cardinality propagator
-   *
-   * Requires \code #include "gecode/int/gcc.hh" \endcode
-   * \ingroup FuncIntProp
-   */
-
-
-  template <class View, class Card, bool isView>
-  class Val : public Propagator {
-  protected:
-    /// Views on which to perform value-propagation
-    ViewArray<View> x;
-    /// Array containing either fixed cardinalities or CardViews
-    ViewArray<Card> k;
-    /**
-     * \brief Stores whether all values in domains of the x-views are used
-     * for cardinality reasoning or whether we only use a subset of them.
-     */
-    bool card_all;
-    /// Constructor for cloning \a p
-    Val(Space* home, bool share, Val<View, Card, isView>& p );
-    /// Constructor for posting
-    Val(Space* home, ViewArray<View>&, ViewArray<Card>&, bool);
-
-  public:
-    /// Destructor
-    virtual size_t dispose(Space* home);
-    /// Copy propagator during cloning
-    virtual Actor* copy(Space* home, bool share);
-    /// Cost funtion returning dynamic PC_LINEAR_HI.
-    virtual PropCost    cost (void) const;
-        /// Perform propagation
-    virtual ExecStatus  propagate(Space* home);
-    /**
-     * \brief Post propagator for views \a x and cardinalities \a k
-     *
-     * \a all denotes whether the propagator uses all value occuring
-     * in the domains of the problem vies specified in \a x.
-     */
-    static  ExecStatus  post(Space* home,
-			     ViewArray<View>& x, ViewArray<Card>& k,
-			     bool all);
-  };
-
-  /**
-   * \brief Performs value-consistent global cardinality propagation
-   *
-   * This function implements the propagation algorithm for
-   * the value-consistent global cardinality propagator implemented
-   * in GCC::Val.
-   */
-
-  template <class View, class Card, bool isView>
-  ExecStatus prop_val(Space* home, ViewArray<View>&, ViewArray<Card>&,
-		      bool&);
-
-}}}
-
-#include "gecode/int/gcc/ubc.icc"
-#include "gecode/int/gcc/lbc.icc"
-#include "gecode/int/gcc/val.icc"
-#include "gecode/int/gcc/bnd.icc"
-#include "gecode/int/gcc/dom.icc"
-
-#endif
-
-
-// STATISTICS: int-prop
-

data/ext/gecode-1.3.1/gecode/int/gcc/bnd.icc

@@ -1,629 +0,0 @@
-/*
- *  Main authors:
- *     Patrick Pekczynski <pekczynski@ps.uni-sb.de>
- *
- *  Copyright:
- *     Patrick Pekczynski, 2004/2005
- *
- *  Last modified:
- *     $Date: 2006-08-04 16:03:26 +0200 (Fri, 04 Aug 2006) $ by $Author: schulte $
- *     $Revision: 3512 $
- *
- *  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 { namespace Int { namespace GCC {
-
-  /// \brief Perform bounds propagation
-  template <class View, class Card, bool isView, bool shared>
-  inline ExecStatus
-  prop_bnd(Space* home, ViewArray<View>& x, ViewArray<Card>& k,
-	   PartialSum<Card>*& lps, PartialSum<Card>*& ups,
-	   bool card_fixed, bool card_all, bool nolbc){		
-
-    bool all_assigned = true;
-    bool mod          = false;
-    int  smin         = 0;
-    int  smax         = 0;
-
-    if (isView) {
-      // if a cardinality of first or last value is
-      // out of the variable bounds (cardvar == 0)
-      // reduce cardinality variables
-
-      int m = k.size();
-      bool locut = k[0].max() == 0;
-      bool hicut = k[m - 1].max() == 0;
-
-      if (locut) {
-	int low = k[0].card();
-	for (int i = 0; i < x.size(); i++) {
-	  ModEvent me = x[i].gr(home, low);
-	  GECODE_ME_CHECK(me);
-	  mod |= me_modified(me) && (x[i].min() != low + 1);
-	  mod |= shared && me_modified(me);
-	}
-      }
-      if (hicut) {
-	int hi = k[m - 1].card();
-	for (int i = 0; i < x.size(); i++) {
-	  ModEvent me = x[i].le(home, hi);
-	  GECODE_ME_CHECK(me);
-	  mod |= me_modified(me) && (x[i].max() != hi - 1);
-	  mod |= shared && me_modified(me);
-	}
-      }
-
-      if (locut || hicut) {
-	int cmin = k[0].card();
-	int cmax = k[m - 1].card();
-	if (k[0].max() == 0) {
-	  cmin = k[1].card();
-	}
-	if (k[m - 1].max() == 0) {
-	  cmax = k[m - 2].card();
-	}
-	reduce_card<Card>(cmin, cmax, k);
-
-	if (lps != NULL) {
-	  delete lps; lps = NULL;
-	  assert(ups != NULL);
-	  delete ups; ups = NULL;
-	}
-      }
-    }
-
-    GECODE_AUTOARRAY(int, count, k.size());
-    for (int i = k.size(); i--; ) {
-      count[i] = 0;
-    }
-
-    int noa = 0;
-    int single = 0;
-    int xlb = 0;
-    int xub = 0;
-
-    for (int i = x.size(); i--; ) {
-      bool b = x[i].assigned();
-      xlb += x[i].min();
-      xub += x[i].max();
-      all_assigned &= b;
-      if (b) {
-	noa++;
-	int idx = lookupValue(k,x[i].val());
-	// reduction is essential for order on value nodes in dom
-	// hence introduce test for failed lookup
-	if (idx == -1) {
-	  return ES_FAILED;
-	}
-	count[idx]++;
-      } else {
-	single = i;
-      }
-    }
-
-    if (isView) {
-      // before propagation performs inferences on cardinality variables:
-      if (noa > 0) {
-	int n  = x.size();
-	int ks = k.size();
-
-	for (int i = ks; i--; ) {
-	  if (!k[i].assigned()) {
-	    int ub = n - (noa - count[i]);
-	    int lb = count[i];
-	    ModEvent melq = k[i].lq(home, ub);
-	    GECODE_ME_CHECK(melq);
-	    mod |= me_modified(melq) && (k[i].max() != ub);
-	    mod |= shared && me_modified(melq);
-
-	    ModEvent megq = k[i].gq(home, lb);
-	    GECODE_ME_CHECK(megq);
-	    mod |= me_modified(megq) && (k[i].min() != lb);
-	    mod |= shared && me_modified(megq);
-	  }
-	}
-      }
-
-      if (!card_consistent<View, Card>(smin, smax, x, k, card_all)) {
-	return ES_FAILED;
-      }
-
-      // can only modified cardinality variables
-      GECODE_ES_CHECK((prop_card<View, Card, shared>(home, x, k, mod)));
-
-      // mimicking linear constraint
-      int smax = 0;
-      int smin = 0;
-      int total_min = 0;
-      int total_max = 0;
-      for (int i = k.size(); i--; ) {
-	smax += k[i].max();
-	total_min += k[i].card() * k[i].min();
-	total_max += k[i].card() * k[i].max();
-      }
-      int xsmax = x.size() - smax;
-      int xsmin = x.size() - smin;
-      smax = 0;
-      smin = 0;
-      bool card_ass = true;
-      for (int i = k.size(); i--; ) {
-	int lb = xsmax + k[i].max();
-	int ub = xsmin + k[i].min();
-	ModEvent me = k[i].gq(home, lb);
-	GECODE_ME_CHECK(me);
-	mod |= me_modified(me) && (k[i].min() != lb);
-	mod |= shared && me_modified(me);
-	smax += k[i].max();
-
-	me = k[i].lq(home, ub);
-	GECODE_ME_CHECK(me);
-	mod |= me_modified(me) && (k[i].max() != ub);
-	mod |= shared && me_modified(me);
-	card_ass &= k[i].assigned();
-      }
-      if (card_ass) {
-	if (smax < x.size() || smax > x.size()) {
-	  return ES_FAILED;
-	}
-
-	// redundant linear constraint
-	for (int i = x.size(); i--; ) {
-	  if (!x[i].assigned()) {
-	    int xmin = xub - x[i].max();
-	    int xgq  = total_max - xmin;
-
-	    int xmax = xlb - x[i].min();
-	    int xlq  = total_max - xmax;
-
-	    ModEvent me = x[i].gq(home, xgq);
-	    GECODE_ME_CHECK(me);
-	    mod |= me_modified(me) && (x[i].min() != xgq);
-	    mod |= shared && me_modified(me);
-
-	    me = x[i].lq(home, xlq);
-	    GECODE_ME_CHECK(me);
-	    mod |= me_modified(me) && (x[i].max() != xlq);
-	    mod |= shared && me_modified(me);
-	  }
-	}
-      }
-    }
-
-    for (int i = k.size(); i--; ) {
-      count[i] = 0;
-    }
-
-    all_assigned = true;
-    noa = 0;
-    single = 0;
-
-    for (int i = x.size(); i--; ) {
-      bool b = x[i].assigned();
-      xlb += x[i].min();
-      xub += x[i].max();
-      all_assigned &= b;
-      if (b) {
-	noa++;
-	int idx = lookupValue(k,x[i].val());
-	// reduction is essential for order on value nodes in dom
-	// hence introduce test for failed lookup
-	if (idx == -1) {
-	  return ES_FAILED;
-	}
-	count[idx]++;
-      } else {
-	single = i;
-      }
-    }
-
-    if (all_assigned) {
-      for (int i = k.size(); i--; ) {
-	int ci = count[i];
-	if (! (k[i].min() <= ci && ci <= k[i].max())) {
-	  return ES_FAILED;
-	} else {
-	  if (isView) {
-	    if (!k[i].assigned()) {
-	      ModEvent me = k[i].eq(home, ci);
-	      GECODE_ME_CHECK(me);
-	      mod |= k[i].assigned();
-	    }	
-	    all_assigned &= k[i].assigned();
-	  }
-	}
-      }
-      if (all_assigned) {
-	return ES_SUBSUMED;
-      }
-    }
-
-    if (isView) {
-      // check again for zero entries at first or last position
-      int m = k.size();
-      bool locut = k[0].max() == 0;
-      bool hicut = k[m - 1].max() == 0;
-
-      if (locut) {
-	int low = k[0].card();
-	for (int i = 0; i < x.size(); i++) {
-	  ModEvent me = x[i].gr(home, low);
-	  GECODE_ME_CHECK(me);
-	  mod |= me_modified(me) && (x[i].min() != low + 1);
-	  mod |= shared && me_modified(me);
-	}
-      }
-      if (hicut) {
-	int hi = k[m - 1].card();
-	for (int i = 0; i < x.size(); i++) {
-	  ModEvent me = x[i].le(home, hi);
-	  GECODE_ME_CHECK(me);
-	  mod |= me_modified(me) && (x[i].max() != hi - 1);
-	  mod |= shared && me_modified(me);
-	}
-      }
-
-      if (locut || hicut) {
-	int cmin = k[0].card();
-	int cmax = k[m - 1].card();
-	if (k[0].max() == 0) {
-	  cmin = k[1].card();
-	}
-	if (k[m - 1].max() == 0) {
-	  cmax = k[m - 2].card();
-	}
-	reduce_card<Card>(cmin, cmax, k);
-
-	if (lps != NULL) {
-	  delete lps;
-	  lps = NULL;
-	  assert(ups != NULL);
-	  delete ups;
-	  ups = NULL;
-	}
-      }
-    }
-
-    ExecStatus es_ubc = ES_FIX;
-    ExecStatus es_lbc = ES_FIX;
-    int n = x.size();
-
-    GECODE_AUTOARRAY(int, mu, n);
-    GECODE_AUTOARRAY(int, nu, n);
-
-    for (int i = n; i--; ) {
-      nu[i] = i;
-      mu[i] = i;
-    }
-    // Create sorting permutation mu according to the variables upper bounds
-    MaxInc<View> max_inc(x);
-    Support::quicksort<int, MaxInc<View> >(mu, n, max_inc);
-
-    // Create sorting permutation nu according to the variables lower bounds
-    MinInc<View> min_inc(x);
-    Support::quicksort<int, MinInc<View> >(nu, n, min_inc);
-
-    if (isView) {
-      // assert guaranteed bounds in the set of all values for variable case
-      assert(k[0].card() == x[nu[0]].min());
-    }
-
-    // ensure that only values are considered lying in the variable domain
-    int cur_minx = x[nu[0]].min();
-    if (lps == NULL) {
-      assert (ups == NULL);
-      lps = new PartialSum<Card>(cur_minx,  k.size(), k, false);
-      ups = new PartialSum<Card>(cur_minx,  k.size(), k, true);
-    }
-
-    if (isView) {
-      // if there has been a change to the cardinality variables
-      // reconstruction of the partial sum structure is necessary
-      if (lps->check_update_min(k)) {
-	delete lps;
-	lps = new PartialSum<Card>(cur_minx,  k.size(), k, false);
-      }
-
-      if (ups->check_update_max(k)) {
-	delete ups;
-	ups = new PartialSum<Card>(cur_minx,  k.size(), k, true);
-      }
-    }
-
-    // already holds by construction
-    assert(lps->minValue() == ups->minValue());
-    assert(lps->maxValue() == ups->maxValue());
-
-    bool minima_equal = lps->minValue() == ups->minValue();
-    bool maxima_equal = lps->maxValue() == ups->maxValue();
-
-    if (!minima_equal || !maxima_equal ) {
-      delete lps;
-      lps = new PartialSum<Card>(cur_minx, k.size(), k, false);
-      delete ups;
-      ups = new PartialSum<Card>(cur_minx, k.size(), k, true);
-    }
-
-    // assert that the minimal value of the partial sum structure for
-    // LBC is consistent with the smallest value a variable can take
-    assert(lps->minValue() <= x[nu[0]].min());
-    // assert that the maximal value of the partial sum structure for
-    // UBC is consistent with the largest value a variable can take
-    assert(x[mu[x.size() - 1]].max() <= ups->maxValue());
-
-    /*
-     *  Setup rank and bounds info
-     *  Since this implementation is based on the theory of Hall Intervals
-     *  additional datastructures are needed in order to represent these
-     *  intervals and the "partial-sum" data structure (cf."gcc/gccbndsup.icc")
-     *
-     */
-
-    GECODE_AUTOARRAY(HallInfo, hall, (2 * n + 2));
-    GECODE_AUTOARRAY(Rank,     rank, n);
-
-    int nb = 0;
-    // setup bounds and rank
-    int min        = x[nu[0]].min();
-    int max        = x[mu[0]].max() + 1;
-    int last       = lps->firstValue + 1; //equivalent to last = min -2
-    hall[0].bounds = last;
-
-    /*
-     * First the algorithm merges the arrays minsorted and maxsorted
-     * into bounds i.e. hall[].bounds contains the ordered union
-     * of the lower and upper domain bounds including two sentinels
-     * at the beginning and at the end of the set
-     * ( the upper variable bounds in this union are increased by 1 )
-     */
-
-    {
-      int i = 0;
-      int j = 0;
-      while (true) {
-	if (i < n && min < max) {
-	  if (min != last) {
-	    last = min;
-	    hall[++nb].bounds = last;
-	  }
-	  rank[nu[i]].min = nb;
-	  if (++i < n) {
-	    min = x[nu[i]].min();
-	  }
-	} else {
-	  if (max != last) {
-	    last = max;
-	    hall[++nb].bounds = last;
-	  }
-	  rank[mu[j]].max = nb;
-	  if (++j == n) {
-	    break;
-	  }
-	  max = x[mu[j]].max() + 1;
-	}
-      }
-    }
-
-    int rightmost = nb + 1; // rightmost accesible value in bounds
-    hall[rightmost].bounds = ups->lastValue + 1 ;
-
-    nolbc = true;
-    for (int i = k.size(); i--; ) {
-      nolbc &= (k[i].min() == 0);
-    }
-
-    if (!card_fixed && !nolbc) {
-      es_lbc = lbc<View, Card, shared>(home, x, nb, hall, rank,lps, mu, nu);
-      if (es_lbc == ES_FAILED || es_lbc == ES_SUBSUMED) {
-	return es_lbc;
-      }
-      mod |= (es_lbc == ES_NOFIX);
-    }
-
-    es_ubc = ubc<View, Card, shared>(home, x, nb, hall, rank, ups, mu, nu);
-    if (es_ubc == ES_FAILED || es_ubc == ES_SUBSUMED) {
-      return es_ubc;
-    }
-    mod |= (es_ubc == ES_NOFIX);
-
-    if (isView) {
-      GECODE_ES_CHECK((prop_card<View, Card, shared>(home, x, k, mod)));
-    }
-
-    all_assigned = true;
-    noa = 0;
-    single = 0;
-    for (int i = k.size(); i--; ) {
-      count[i] = 0;
-    }
-
-    for (int i = x.size(); i--; ) {
-      bool b = x[i].assigned();
-      all_assigned &= b;
-      if (b) {
-	noa++;
-	int idx = lookupValue(k,x[i].val());
-	count[idx]++;
-      } else {
-	single = i;
-      }
-    }
-
-    if (all_assigned) {
-      for (int i = k.size(); i--; ) {
-	int ci = count[i];
-	if (! (k[i].min() <= ci && ci <= k[i].max())) {
-	  return ES_FAILED;
-	} else {
-	  if (isView) {
-	    if (!k[i].assigned()) {
-	      ModEvent me = k[i].eq(home, ci);
-	      GECODE_ME_CHECK(me);
-	      mod |= k[i].assigned();
-	    }
-	    all_assigned &= k[i].assigned();
-	  }
-	}
-      }
-      if (all_assigned) {
-	return ES_SUBSUMED;
-      }
-    }
-
-    return mod ? ES_NOFIX : ES_FIX;
-  }
-
-  // for posting
-  template <class View, class Card, bool isView, bool shared>
-  inline
-  BndImp<View, Card, isView, shared>::
-  BndImp(Space* home, ViewArray<View>& x0, ViewArray<Card>& k0,
-	 bool cf,  bool all, bool nolbc) :
-    Propagator(home, true), x(x0), k(k0), lps(NULL), ups(NULL),
-    card_fixed(cf), card_all(all), skip_lbc(nolbc) {
-    x.subscribe(home, this, PC_INT_BND);
-    k.subscribe(home, this, PC_INT_BND);
-  }
-
-  // for cloning
-  template <class View, class Card, bool isView, bool shared>
-  forceinline
-  BndImp<View, Card, isView, shared>::
-  BndImp(Space* home, bool share, BndImp<View, Card, isView, shared>& p)
-    : Propagator(home, share, p), lps(NULL), ups(NULL),
-      card_fixed(p.card_fixed), card_all(p.card_all),
-      skip_lbc(p.skip_lbc) {
-    x.update(home, share, p.x);
-    k.update(home, share, p.k);
-  }
-
-  template <class View, class Card, bool isView, bool shared>
-  size_t
-  BndImp<View, Card, isView, shared>::dispose(Space* home){
-    if (!home->failed()) {
-      x.cancel(home,this, PC_INT_BND);
-      k.cancel(home,this, PC_INT_BND);
-    }
-    if (lps != NULL) {
-      delete lps;
-    }
-    if (ups != NULL) {
-      delete ups;
-    }
-    (void) Propagator::dispose(home);
-    return sizeof(*this);
-  }
-
-  template <class View, class Card, bool isView, bool shared>
-  Actor*
-  BndImp<View, Card, isView, shared>::copy(Space* home, bool share){
-    return new (home) BndImp<View, Card, isView, shared>
-      (home, share, *this);
-  }
-
-  template <class View, class Card, bool isView, bool shared>
-  PropCost
-  BndImp<View, Card, isView, shared>::cost (void) const {
-    /*
-     * The bounds consistent version of the Global Cardinality constraint
-     * has a theoretical complexity of
-     *   O(t + n\cdot log(n)) with
-     *   n = number of variables
-     *   t = time needed to sort the domain bounds of the variables
-     */
-    PropCost pc = PC_LINEAR_HI;
-    return cost_hi(x.size(),pc);
-  }
-
-  template <class View, class Card, bool isView, bool shared>
-  ExecStatus
-  BndImp<View, Card, isView, shared>::propagate(Space* home) {
-    return prop_bnd<View, Card, isView, shared>
-      (home, x, k, lps, ups, card_fixed, card_all, skip_lbc);
-  }
-
-  /**
-   * \brief Sharing test for the bounds-consistent global cardinality
-   * propagator.
-   *
-   * Due to parametrization on the problem views, \a View1 and the
-   * cardinality views, \a View2 the test can be applied for both cases
-   * of fixed cardinalities and cardinality variables.
-   */
-  template <class View1, class View2>
-  class SharingTest {
-  public:
-    /**
-     * \brief Test whether the problem views in \a x0 or the
-     *  cardinality views in \a k0 contain shared views.
-     */
-    static bool shared(Space* home, ViewArray<View1>& x0,
-		       ViewArray<View2>& k0) {
-      ViewArray<View1> xc(home, x0.size()+k0.size());
-      for (int i = 0; i < x0.size(); i++) {
-	xc[i] = x0[i];
-      }
-      for (int i = x0.size(); i < x0.size()+k0.size(); i++) {
-	xc[i] = k0[i - x0.size()].intview();
-      }
-      return xc.shared();
-    }
-  };
-
-  /**
-   * \brief Specialization of class SharingTest for the case of fixed
-   * cardinalities using IntView as \a View1 and OccurBndsView as \a View2
-   */
-  template <>
-  class SharingTest<IntView,OccurBndsView> {
-  public:
-    /// Test whether the problem views in \a x0 contain shared views.
-    static bool shared(Space* home,
-		       ViewArray<IntView>& xs, ViewArray<OccurBndsView>&) {
-      return xs.shared();
-    }
-  };
-
-  template <class View, class Card, bool isView>
-  ExecStatus
-  Bnd<View, Card, isView>::post(Space* home,
-				ViewArray<View>& x0,
-				ViewArray<Card>& k0,
-				bool all) {
-    bool cardfix = true;
-    bool nolbc = true;
-    for (int i = k0.size(); i--; ) {
-      cardfix &= k0[i].assigned();
-      nolbc &= (k0[i].min() == 0);
-    }
-
-    if (SharingTest<View,Card>::shared(home,x0,k0)) {
-      new (home) BndImp<View, Card, isView, true>
-	(home, x0, k0, cardfix, all, nolbc);
-    } else {
-      new (home) BndImp<View, Card, isView, false>
-	(home, x0, k0, cardfix, all, nolbc);
-    }
-    return ES_OK;
-  }
-
-  template <class View, class Card, bool isView, bool shared>
-  void
-  BndImp<View, Card, isView, shared>::flush(void){
-    delete lps;
-    lps = NULL;
-    delete ups;
-    ups = NULL;
-  }
-
-}}}
-
-// STATISTICS: int-prop
-