gecoder-with-gecode 0.9.0 → 0.9.1

data/ext/gecode-2.2.0/gecode/int/distinct.hh

@@ -0,0 +1,341 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *     Guido Tack <tack@gecode.org>
+ *
+ *  Contributing authors:
+ *     Gabor Szokoli <szokoli@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2002
+ *     Guido Tack, 2004
+ *     Gabor Szokoli, 2003
+ *
+ *  Last modified:
+ *     $Date: 2008-07-11 09:28:48 +0200 (Fri, 11 Jul 2008) $ by $Author: tack $
+ *     $Revision: 7285 $
+ *
+ *  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.
+ *
+ */
+
+#ifndef __GECODE_INT_DISTINCT_HH__
+#define __GECODE_INT_DISTINCT_HH__
+
+#include "gecode/int.hh"
+
+#include "gecode/int/rel.hh"
+
+/**
+ * \namespace Gecode::Int::Distinct
+ * \brief %Distinct propagators
+ */
+
+namespace Gecode { namespace Int { namespace Distinct {
+
+  /**
+   * \brief Naive value distinct propagator
+   *
+   * Eliminates values of assigned views of type \a View.
+   *
+   * Requires \code #include "gecode/int/distinct.hh" \endcode
+   * \ingroup FuncIntProp
+   */
+  template <class View>
+  class Val : public NaryPropagator<View,PC_INT_VAL> {
+  protected:
+    using NaryPropagator<View,PC_INT_VAL>::x;
+
+    /// Constructor for posting
+    Val(Space* home, ViewArray<View>& x);
+    /// Constructor for cloning \a p
+    Val(Space* home, bool share, Val<View>& p);
+  public:
+    /// Copy propagator during cloning
+    virtual Actor*     copy(Space* home, bool share);
+    /// Perform propagation
+    virtual ExecStatus propagate(Space* home, ModEventDelta med);
+    /// Specification for this propagator
+    virtual Reflection::ActorSpec spec(const Space* home,
+                                        Reflection::VarMap& m) const;
+    /// Name of this propagator
+    static Support::Symbol ati(void);
+    /// Post propagator for specification
+    static void post(Space* home, Reflection::VarMap& vars,
+                     const Reflection::ActorSpec& spec);
+    /// Post propagator for view array \a x
+    static ExecStatus post(Space* home, ViewArray<View>& x);
+  };
+
+  /**
+   * \brief Eliminate singletons by naive value propagation
+   *
+   * This is actually the propagation algorithm for Distinct::Val.
+   * It is available as separate function as it is reused for
+   * both bounds consistent and domain consistent distinct
+   * propagators.
+   *
+   * If \a complete is true, computes fixpoint, otherwise might not
+   * compute fixpoint. This can be helpful when used together with
+   * bounds or domain propagation to protect from pathological cases
+   * which can be handled more efficiently with bounds propagation.
+   */
+  template <class View, bool complete>
+  ExecStatus prop_val(Space* home, ViewArray<View>&);
+
+
+
+  /**
+   * \brief Bounds consistent distinct propagator
+   *
+   * The propagator uses staging: first it uses naive value-based
+   * propagation and only then uses bounds consistent propagation.
+   * Due to using naive value-based propagation, the propagator
+   * might actually achieve stronger consistency than just
+   * bounds consistency.
+   *
+   * The algorithm is taken from:
+   *        A. Lopez-Ortiz, C.-G. Quimper, J. Tromp, and P. van Beek.
+   *        A fast and simple algorithm for bounds consistency of the
+   *        alldifferent constraint. IJCAI-2003.
+   *
+   * This implementation uses the code that is provided by
+   * Peter Van Beek:
+   *   http://ai.uwaterloo.ca/~vanbeek/software/software.html
+   * The code (originally by John Tromp) 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).
+   *
+   * Requires \code #include "gecode/int/distinct.hh" \endcode
+   * \ingroup FuncIntProp
+   */
+  template <class View>
+  class Bnd : public Propagator {
+  protected:
+    /// Views on which to perform bounds-propagation
+    ViewArray<View> x;
+    /// Views on which to perform value-propagation (subset of \c x)
+    ViewArray<View> y;
+    /// Constructor for posting
+    Bnd(Space* home, ViewArray<View>& x);
+    /// Constructor for cloning \a p
+    Bnd(Space* home, bool share, Bnd<View>& p);
+  public:
+    /// Post propagator for view array \a x
+    static ExecStatus post(Space* home, ViewArray<View>& x);
+    /// Post propagator for specification
+    static void post(Space* home, Reflection::VarMap& vars,
+                     const Reflection::ActorSpec& spec);
+    /// Perform propagation
+    virtual ExecStatus propagate(Space* home, ModEventDelta med);
+    /**
+     * \brief Cost function
+     *
+     * If in stage for naive value propagation, the cost is dynamic
+     * PC_LINEAR_LO. Otherwise it is dynamic PC_LINEAR_HI.
+     */
+    virtual PropCost cost(ModEventDelta med) const;
+    /// Copy propagator during cloning
+    virtual Actor* copy(Space* home, bool share);
+    /// Destructor
+    virtual size_t dispose(Space* home);
+    /// Specification for this propagator
+    virtual Reflection::ActorSpec spec(const Space* home,
+                                        Reflection::VarMap& m) const;
+    /// Name of this propagator
+    static Support::Symbol ati(void);
+  };
+
+  /**
+   * \brief Perform bounds consistent distinct propagation
+   *
+   * This is actually the propagation algorithm for Distinct::Bnd.
+   * It is available as separate function as it is reused for
+   * both bounds consistent and domain consistent distinct
+   * propagators.
+   */
+  template <class View>
+  ExecStatus prop_bnd(Space* home, ViewArray<View>& x, int m);
+
+  template <class View> class ViewNode;
+  template <class View> class ValNode;
+
+  /**
+   * \brief Propagation controller for domain consistent distinct
+   *
+   * The propagation controller provides convenient access to
+   * performing incremental domain consistent distinct propagation
+   * so that the routines can be reused easily.
+   *
+   * Requires \code #include "gecode/int/distinct.hh" \endcode
+   * \ingroup FuncIntProp
+   */
+  template <class View>
+  class DomCtrl {
+  protected:
+    /// View-value graph for propagation
+    class ViewValGraph {
+    public:
+      /// Array of view nodes
+      ViewNode<View>** view; 
+      /// Number of view nodes
+      int n_view;
+      /// Array of value nodes
+      ValNode<View>* val;
+      /// Number of value nodes
+      int n_val;
+      /// Marking counter
+      unsigned int count;
+    public:
+      /// Construct graph as not yet initialized
+      ViewValGraph(void);
+      /// Test whether graph has been initialized
+      bool initialized(void) const;
+      /// Initialize graph
+      ExecStatus init(Space* home, int n, View* x);
+      /// Mark edges in graph
+      void mark(void);
+      /// Prune unmarked edges, \a assigned is true if a view got assigned
+      ExecStatus tell(Space* home, bool& assigned);
+      /// Purge graph if necessary
+      void purge(void);
+      /// Synchronize graph with new view domains
+      bool sync(void);
+    public:
+      /// Stack used during matching
+      typedef Support::SentinelStack<ViewNode<View>*> MatchStack;
+      /// Find a matching for node \a x
+      bool match(MatchStack& m, ViewNode<View>* x);
+    };
+    /// Propagation is performed on a view-value graph
+    ViewValGraph vvg;
+  public:
+    /// Initialize with non-initialized view-value graph
+    DomCtrl(void);
+    /// Check whether a view-value graph is available
+    bool available(void);
+    /// Initialize view-value graph for views \a x
+    ExecStatus init(Space* home, int n, View* x);
+    /// Synchronize available view-value graph
+    ExecStatus sync(void);
+    /// Perform propagation, \a assigned is true if a view gets assigned
+    ExecStatus propagate(Space* home, bool& assigned);
+  };
+
+  /**
+   * \brief Domain consistent distinct propagator
+   *
+   * The propagator uses staging: first it uses naive value-based
+   * propagation and only then uses domain consistent propagation.
+   *
+   * The algorithm is taken from:
+   *    Jean-Charles R�gin, A filtering algorithm for constraints
+   *    of difference in CSPs, Proceedings of the Twelfth National
+   *    Conference on Artificial Intelligence, pages 362--367.
+   *    Seattle, WA, USA, 1994.
+   *
+   * Requires \code #include "gecode/int/distinct.hh" \endcode
+   * \ingroup FuncIntProp
+   */
+  template <class View>
+  class Dom : public NaryPropagator<View,PC_INT_DOM> {
+  protected:
+    using NaryPropagator<View,PC_INT_DOM>::x;
+    /// Propagation controller
+    DomCtrl<View> dc;
+    /// Constructor for cloning \a p
+    Dom(Space* home, bool share, Dom<View>& p);
+    /// Constructor for posting
+    Dom(Space* home, ViewArray<View>& x);
+  public:
+    /// Perform propagation
+    virtual ExecStatus propagate(Space* home, ModEventDelta med);
+    /**
+     * \brief Cost function
+     *
+     * If in stage for naive value propagation, the cost is dynamic
+     * PC_LINEAR_LO. Otherwise it is dynamic PC_CUBIC_LO.
+     */
+    virtual PropCost cost(ModEventDelta med) const;
+    /// Copy propagator during cloning
+    virtual Actor* copy(Space* home, bool share);
+    /// Specification for this propagator
+    virtual Reflection::ActorSpec spec(const Space* home,
+                                        Reflection::VarMap& m) const;
+    /// Name of this propagator
+    static Support::Symbol ati(void);
+    /// Post propagator for views \a x
+    static  ExecStatus post(Space* home, ViewArray<View>& x);
+    /// Post propagator for specification
+    static void post(Space* home, Reflection::VarMap& vars,
+                     const Reflection::ActorSpec& spec);
+  };
+
+  /**
+   * \brief Ternary domain consistent distinct propagator
+   *
+   * Requires \code #include "gecode/int/distinct.hh" \endcode
+   * \ingroup FuncIntProp
+   */
+  template <class View>
+  class TerDom : public TernaryPropagator<View,PC_INT_DOM> {
+  protected:
+    using TernaryPropagator<View,PC_INT_DOM>::x0;
+    using TernaryPropagator<View,PC_INT_DOM>::x1;
+    using TernaryPropagator<View,PC_INT_DOM>::x2;
+
+    /// Constructor for cloning \a p
+    TerDom(Space* home, bool share, TerDom<View>& p);
+    /// Constructor for posting
+    TerDom(Space* home, View x0, View x1, View x2);
+  public:
+    /// Perform propagation
+    virtual ExecStatus propagate(Space* home, ModEventDelta med);
+    /// Copy propagator during cloning
+    virtual Actor* copy(Space* home, bool share);
+    /// Specification for this propagator
+    virtual Reflection::ActorSpec spec(const Space* home,
+                                        Reflection::VarMap& m) const;
+    /// Name of this propagator
+    static Support::Symbol ati(void);
+    /// Post propagator for views \a x
+    static  ExecStatus post(Space* home, View x0, View x1, View x2);
+    /// Post propagator for specification
+    static void post(Space* home, Reflection::VarMap& vars,
+                     const Reflection::ActorSpec& spec);
+  };
+
+}}}
+
+#include "gecode/int/distinct/val.icc"
+#include "gecode/int/distinct/bnd.icc"
+#include "gecode/int/distinct/ter-dom.icc"
+#include "gecode/int/distinct/dom.icc"
+
+#endif
+
+// STATISTICS: int-prop
+

data/ext/gecode-2.2.0/gecode/int/distinct/dom.icc

@@ -0,0 +1,752 @@
+/* -*- 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-07-11 11:14:16 +0200 (Fri, 11 Jul 2008) $ by $Author: tack $
+ *     $Revision: 7359 $
+ *
+ *  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 <climits>
+
+namespace Gecode { namespace Int { namespace Distinct {
+
+  /**
+   * \brief Class for combining two pointers with a flag
+   *
+   * When one pointer is given, this other can be retrieved.
+   *
+   */
+
+  template <class T>
+  class CombPtrFlag {
+  private:
+    /// Store pointer and flag
+    ptrdiff_t cpf;
+  public:
+    /// Initialize with pointer \a p1 and \a p2
+    CombPtrFlag(T* p1, T* p2);
+    /// Initialize with pointer \a p1 and \a p2
+    void init(T* p1, T* p2);
+    /// Return the other pointer when \a p is given
+    T* ptr(T* p) const;
+    /// Check whether flag is set
+    int is_set(void) const;
+    /// Set flag
+    void set(void);
+    /// Clear flag
+    void unset(void);
+  };
+
+  /**
+   * \brief Bidirectional links for both edges and anchors in nodes of view-value graph
+   *
+   */
+  class BiLink {
+  private:
+    BiLink* _prev; BiLink* _next;
+  public:
+    BiLink(void);
+
+    BiLink* prev(void) const; void prev(BiLink*);
+    BiLink* next(void) const; void next(BiLink*);
+
+    void add(BiLink*);
+    void unlink(void);
+
+    void mark(void);
+    bool marked(void) const;
+
+    bool empty(void) const;
+  };
+
+  template <class View> class Edge;
+
+  /**
+   * \brief Base-class for nodes (both view and value nodes)
+   *
+   * Note: the obvious ill-design to have also nodes and edges
+   * parametric wrt View is because the right design (having template
+   * function members) gets miscompiled (and actually not even compiled
+   * with some C++ compilers). Duh!
+   *
+   */
+  template <class View>
+  class Node : public BiLink {
+  public:
+    unsigned int low, min, comp;
+    Edge<View>* iter;
+
+    Node(void);
+
+    Edge<View>* edge_fst(void) const;
+    Edge<View>* edge_lst(void) const;
+
+    static void  operator delete(void*, size_t);
+    static void  operator delete(void*,Space*);
+    static void* operator new(size_t, Space*);
+  };
+
+  /**
+   * \brief Value nodes in view-value graph
+   *
+   */
+  template <class View>
+  class ValNode : public Node<View> {
+  protected:
+    /// The value of the node
+    const int      _val; 
+    /// The matching edge
+    Edge<View>*    _matching;
+    /// The next value node
+    ValNode<View>* _next_val;
+  public:
+    /// Initialize with value \a v
+    ValNode(int v);
+    /// Initialize with value \a v and successor \a n
+    ValNode(int v, ValNode<View>* n);
+    /// Return value of node
+    int val(void) const;
+    /// Set matching edge to \a m
+    void matching(Edge<View>* m);
+    /// Return matching edge (NULL if unmatched)
+    Edge<View>* matching(void) const;
+    /// Return pointer to next value node fields
+    ValNode<View>** next_val_ref(void);
+    /// Return next value node
+    ValNode<View>* next_val(void) const;
+    /// Set next value node to \a v
+    void next_val(ValNode<View>* v);
+  };
+
+  /**
+   * \brief View nodes in view-value graph
+   *
+   */
+  template <class View>
+  class ViewNode : public Node<View> {
+  protected:
+    /// The node's view
+    View        _view;    
+    /// The first value edge
+    Edge<View>* _val_edges; 
+  public:
+    /// Initialize new node for view \a x
+    ViewNode(View x);
+    /// Return first edge of all value edges
+    Edge<View>*  val_edges(void) const;
+    /// Return pointer to first edge fields of all value edges
+    Edge<View>** val_edges_ref(void);
+    /// Return view
+    View view(void) const;
+  };
+
+  /**
+   * \brief Edges in view-value graph
+   *
+   */
+  template <class View>
+  class Edge : public BiLink {
+  protected:
+    /// Next edge in chain of value edges
+    Edge<View>*              _next_edge;
+    /// Combine source and destination node anf flag
+    CombPtrFlag<Node<View> > sd;
+  public:
+    /// Construct new edge between \a x and \a v
+    Edge(ValNode<View>* v, ViewNode<View>* x);
+    /// Return destination of edge when source \a s is given
+    Node<View>* dst(Node<View>* s) const;
+
+    /// Return view node when value node \a v is given
+    ViewNode<View>* view(ValNode<View>* v) const;
+    /// Return value node when view node \a x is given
+    ValNode<View>* val(ViewNode<View>* x) const;
+
+    bool used(Node<View>*) const;
+    void use(void);
+    void free(void);
+
+    void revert(Node<View>*);
+
+    Edge<View>*  next_edge(void) const;
+    Edge<View>** next_edge_ref(void);
+
+    Edge<View>* next(void) const;
+
+    static void  operator delete(void*, size_t);
+    static void  operator delete(void*,Space*);
+    static void* operator new(size_t, Space*);
+  };
+
+}}}
+
+#include "gecode/int/distinct/combptr.icc"
+#include "gecode/int/distinct/bilink.icc"
+#include "gecode/int/distinct/edge.icc"
+#include "gecode/int/distinct/node.icc"
+
+namespace Gecode { namespace Int { namespace Distinct {
+
+
+  template <class View>
+  forceinline
+  DomCtrl<View>::ViewValGraph::ViewValGraph(void)
+    : view(NULL), val(NULL), count(1) {}
+
+  template <class View>
+  forceinline bool
+  DomCtrl<View>::ViewValGraph::initialized(void) const {
+    return view != NULL;
+  }
+
+  template <class View>
+  forceinline bool
+  DomCtrl<View>::ViewValGraph::match(MatchStack& m, ViewNode<View>* x) {
+    count++;
+  start:
+    // Try to find matching edge cheaply: is there a free edge around?
+    {
+      Edge<View>* e = x->val_edges();
+      // This holds true as domains are never empty
+      assert(e != NULL);
+      do {
+        if (!e->val(x)->matching()) {
+          e->revert(x); e->val(x)->matching(e);
+          // Found a matching, revert all edges on stack
+          while (!m.empty()) {
+            x = m.pop(); e = x->iter;
+            e->val(x)->matching()->revert(e->val(x));
+            e->revert(x); e->val(x)->matching(e);
+          }
+          return true;
+        }
+        e = e->next_edge();
+      } while (e != NULL);
+    }
+    // No, find matching edge by augmenting path method
+    Edge<View>* e = x->val_edges();
+    do {
+      if (e->val(x)->matching()->view(e->val(x))->min < count) { 
+        e->val(x)->matching()->view(e->val(x))->min = count;
+        m.push(x); x->iter = e;
+        x = e->val(x)->matching()->view(e->val(x));
+        goto start;
+      }
+    next:
+      e = e->next_edge();
+    } while (e != NULL);
+    if (!m.empty()) {
+      x = m.pop(); e = x->iter; goto next;
+    }
+    // All nodes and edges unsuccessfully tried
+    return false;
+  }
+
+  template <class View>
+  ExecStatus
+  DomCtrl<View>::ViewValGraph::init(Space* home, int n, View* x) {
+    n_view = n; 
+    view = static_cast<ViewNode<View>**>
+      (home->alloc(n_view*sizeof(ViewNode<View>*)));
+
+    // Find value information for construction of view value graph
+    int min = x[n_view-1].min();
+    int max = x[n_view-1].max();
+    for (int i=n_view-1; i--; ) {
+      min = std::min(min,x[i].min());
+      max = std::max(max,x[i].max());
+    }
+
+    unsigned int width = max-min+1;
+
+    // Definitly not enough values
+    if (width < static_cast<unsigned int>(n_view))
+      return ES_FAILED;
+
+    n_val = 0;
+    val = NULL;
+
+    if (static_cast<unsigned int>(n_view)*4 >= width) {
+      // Values are dense: use a mapping
+      GECODE_AUTOARRAY(ValNode<View>*,val2node,width);
+
+      for (unsigned int i=width; i--; )
+        val2node[i]=NULL;
+
+      for (int i=n; i--; ) {
+        view[i] = new (home) ViewNode<View>(x[i]);
+        Edge<View>** edge_p = view[i]->val_edges_ref();
+        ViewValues<View> xi(x[i]);
+        while (xi()) {
+          if (val2node[xi.val()-min] == NULL)
+            val2node[xi.val()-min] = new (home) ValNode<View>(xi.val());
+          *edge_p = new (home) Edge<View>(val2node[xi.val()-min],view[i]);
+          edge_p = (*edge_p)->next_edge_ref();
+          ++xi;
+        }
+        *edge_p = NULL;
+      }
+
+      for (unsigned int i=width; i--; )
+        if (val2node[i] != NULL) {
+          val2node[i]->next_val(val);
+          val = val2node[i];
+          n_val++;
+        }
+
+    } else {
+      // Values are sparse
+      for (int i=n; i--; ) {
+        view[i] = new (home) ViewNode<View>(x[i]);
+        Edge<View>** edge_p = view[i]->val_edges_ref();
+        ViewValues<View> xi(x[i]);
+        ValNode<View>** v = &val;
+        while (xi() && (*v != NULL)) {
+          if ((*v)->val() == xi.val()) {
+            // Value node does already exist, create new edge
+            *edge_p = new (home) Edge<View>(*v,view[i]);
+            edge_p = (*edge_p)->next_edge_ref();
+            v = (*v)->next_val_ref();
+            ++xi;
+          } else if ((*v)->val() < xi.val()) {
+            // Skip to next value node
+            v = (*v)->next_val_ref();
+          } else {
+            // Value node does not yet exist, create and link it
+            ValNode<View>* nv = new (home) ValNode<View>(xi.val(),*v);
+            *v = nv; v = nv->next_val_ref();
+            *edge_p = new (home) Edge<View>(nv,view[i]);
+            edge_p = (*edge_p)->next_edge_ref();
+            ++xi; n_val++;
+          }
+        }
+        // Create missing value nodes
+        while (xi()) {
+          ValNode<View>* nv = new (home) ValNode<View>(xi.val(),*v);
+          *v = nv; v = nv->next_val_ref();
+          *edge_p = new (home) Edge<View>(nv,view[i]);
+          edge_p = (*edge_p)->next_edge_ref();
+          ++xi; n_val++;
+        }
+        *edge_p = NULL;
+      }
+    }
+
+    GECODE_AUTOSTACK(ViewNode<View>*,NULL,m,n_view);
+    for (int i = n_view; i--; )
+      if (!match(m,view[i]))
+        return ES_FAILED;
+    return ES_OK;
+  }
+
+  template <class View>
+  forceinline void
+  DomCtrl<View>::ViewValGraph::mark(void) {
+    {
+      // Marks all edges as used that are on simple paths in the graph
+      // that start from a free (unmatched node) by depth-first-search
+      GECODE_AUTOSTACK(ValNode<View>*,NULL,visit,n_val);
+      
+      // Insert all free nodes: they can be only value nodes as we
+      // have a maximum matching covering all view nodes
+      count++;
+      {
+        ValNode<View>** v = &val; 
+        while (*v != NULL)
+          if (!(*v)->matching()) {
+            if ((*v)->empty()) {
+              *v = (*v)->next_val();
+              n_val--;
+            } else {
+              (*v)->min = count;
+              visit.push(*v);
+              v = (*v)->next_val_ref();
+            }
+          } else {
+            v = (*v)->next_val_ref();
+          }
+      }
+      
+      // Invariant: only value nodes are on the stack!
+      while (!visit.empty()) {
+        ValNode<View>* n = visit.pop();
+        for (Edge<View>* e = n->edge_fst(); e != n->edge_lst(); e=e->next()) {
+          // Get the value node
+          e->use();
+          ViewNode<View>* x = e->view(n);
+          if (x->min < count) {
+            x->min = count;
+            assert(x->edge_fst()->next() == x->edge_lst());
+            ValNode<View>* m = x->edge_fst()->val(x);
+            x->edge_fst()->use();
+            if (m->min < count) {
+              m->min = count;
+              visit.push(m);
+            }
+          }
+        }
+      }
+    }
+
+    {
+      GECODE_AUTOSTACK(Node<View>*,NULL,scc,n_val+n_view);
+      GECODE_AUTOSTACK(Node<View>*,NULL,visit,n_val+n_view);
+
+      count++;
+      unsigned int cnt0 = count;
+      unsigned int cnt1 = count;
+
+      for (int i = n_view; i--; )
+        if (view[i]->min < count) {
+          Node<View>* w = view[i];
+        start:
+          w->low = w->min = cnt0++;
+          scc.push(w);
+          Edge<View>* e = w->edge_fst();
+          while (e != w->edge_lst()) {
+            if (e->dst(w)->min < count) {
+              visit.push(w); w->iter = e;
+              w=e->dst(w);
+              goto start;
+            }
+          next:
+            if (e->dst(w)->low < w->min)
+              w->min = e->dst(w)->low;
+            e = e->next();
+          }
+          if (w->min < w->low) {
+            w->low = w->min;
+          } else {
+            Node<View>* v;
+            do {
+              v = scc.pop();
+              v->comp = cnt1;
+              v->low  = UINT_MAX;
+            } while (v != w);
+            cnt1++;
+          }
+          if (!visit.empty()) {
+            w=visit.pop(); e=w->iter; goto next;
+          }
+        }
+      count = cnt0+1;
+    }
+  }
+
+  /// Prunes the values read from a view node
+  template <class View>
+  class PruneVal {
+  protected:
+    /// View node
+    ViewNode<View>* x;
+    /// Current value edge
+    Edge<View>* e;
+  public:
+    /// \name Constructors and initialization
+    //@{
+    /// Initialize with edges for view node \a y
+    PruneVal(ViewNode<View>* y);
+    //@}
+
+    /// \name Iteration control
+    //@{
+    /// Test whether iterator is still at a value or done
+    bool operator()(void) const;
+    /// Move iterator to next value (if possible)
+    void operator++(void);
+    //@}
+
+    /// \name Value access
+    //@{
+    /// Return current value
+    int val(void) const;
+    //@}
+  };
+
+  template <class View>
+  forceinline
+  PruneVal<View>::PruneVal(ViewNode<View>* y)
+    : x(y), e(y->val_edges()) {
+    while ((e != NULL) && e->used(x))
+      e = e->next_edge();
+  }
+  template <class View>
+  forceinline bool 
+  PruneVal<View>::operator()(void) const {
+    return e != NULL;
+  }
+  template <class View>
+  forceinline void 
+  PruneVal<View>::operator++(void) {
+    do {
+      e = e->next_edge();
+    } while ((e != NULL) && e->used(x));
+  }
+  template <class View>
+  forceinline int 
+  PruneVal<View>::val(void) const {
+    assert(!e->used(x));
+    return e->val(x)->val();
+  }
+
+  template <class View>
+  forceinline ExecStatus
+  DomCtrl<View>::ViewValGraph::tell(Space* home, bool& assigned) {
+    assigned = false;
+    // Tell constraints and also eliminate nodes and edges
+    for (int i = n_view; i--; ) {
+      ViewNode<View>* x = view[i];
+      if (!x->edge_fst()->used(x)) {
+        GECODE_ME_CHECK(x->view().eq(home,x->edge_fst()->val(x)->val()));
+        x->edge_fst()->val(x)->matching(NULL);
+        for (Edge<View>* e = x->val_edges(); e != NULL; e = e->next_edge())
+          e->unlink();
+        view[i] = view[--n_view];
+        assigned = true;
+      } else {
+        PruneVal<View> pv(view[i]);
+        GECODE_ME_CHECK(view[i]->view().minus_v(home,pv,false));
+      }
+    }
+    return ES_OK;
+  }
+
+  template <class View>
+  forceinline void
+  DomCtrl<View>::ViewValGraph::purge(void) {
+    if (count > (UINT_MAX >> 1)) {
+      count = 1;
+      for (int i=n_view; i--; )
+        view[i]->min = 0;
+      for (ValNode<View>* v = val; v != NULL; v = v->next_val())
+        v->min = 0;
+    }
+  }
+
+  template <class View>
+  bool
+  DomCtrl<View>::ViewValGraph::sync(void) {
+    // Stack for view nodes to be rematched
+    GECODE_AUTOSTACK(ViewNode<View>*,NULL,re,n_view);
+    // Synchronize nodes
+    for (int i = n_view; i--; ) {
+      ViewNode<View>* x = view[i];
+      if (x->view().assigned()) {
+        x->edge_fst()->val(x)->matching(NULL);
+        for (Edge<View>* e = x->val_edges(); e != NULL; e = e->next_edge())
+          e->unlink();
+        view[i] = view[--n_view];
+      } else {
+        ViewRanges<View> r(x->view());
+        Edge<View>*  m = x->edge_fst();      // Matching edge
+        Edge<View>** p = x->val_edges_ref();
+        Edge<View>*  e = *p;
+        do {
+          while (e->val(x)->val() < r.min()) {
+            // Skip edge
+            e->unlink(); e->mark();
+            e = e->next_edge();
+          }
+          *p = e;
+          assert(r.min() == e->val(x)->val());
+          // This edges must be kept
+          for (unsigned int j=r.width(); j--; ) {
+            e->free();
+            p = e->next_edge_ref();
+            e = e->next_edge();
+          }
+          ++r;
+        } while (r());
+        *p = NULL;
+        while (e != NULL) {
+          e->unlink(); e->mark();
+          e = e->next_edge();
+        }
+        if (m->marked()) {
+          // Matching has been deleted!
+          m->val(x)->matching(NULL);
+          re.push(x);
+        }
+      }
+    }
+    GECODE_AUTOSTACK(ViewNode<View>*,NULL,m,n_view);
+    while (!re.empty())
+      if (!match(m,re.pop()))
+        return false;
+    return true;
+  }
+
+
+
+  /*
+   * The propagation controller
+   *
+   */
+
+  template <class View>
+  forceinline
+  DomCtrl<View>::DomCtrl(void) {}
+
+  template <class View>
+  forceinline bool
+  DomCtrl<View>::available(void) {
+    return vvg.initialized();
+  }
+
+  template <class View>
+  forceinline ExecStatus
+  DomCtrl<View>::init(Space* home, int n, View* x) {
+    return vvg.init(home,n,x);
+  }
+
+  template <class View>
+  forceinline ExecStatus
+  DomCtrl<View>::sync(void) {
+    vvg.purge();
+    return vvg.sync() ? ES_OK : ES_FAILED;
+  }
+
+  template <class View>
+  forceinline ExecStatus
+  DomCtrl<View>::propagate(Space* home, bool& assigned) {
+    vvg.mark();
+    return vvg.tell(home,assigned);
+  }
+
+
+  /*
+   * The propagator proper
+   *
+   */
+
+  template <class View>
+  forceinline
+  Dom<View>::Dom(Space* home, ViewArray<View>& x)
+    : NaryPropagator<View,PC_INT_DOM>(home,x) {}
+
+  template <class View>
+  ExecStatus
+  Dom<View>::post(Space* home, ViewArray<View>& x) {
+    if (x.size() == 2)
+      return Rel::Nq<View>::post(home,x[0],x[1]);
+    if (x.size() == 3)
+      return TerDom<View>::post(home,x[0],x[1],x[2]);
+    if (x.size() > 3) {
+      // Do bounds propagation to make view-value graph smaller
+      GECODE_ES_CHECK(prop_bnd<View>(home,x))
+      (void) new (home) Dom<View>(home,x);
+    }
+    return ES_OK;
+  }
+
+  template <class View>
+  void
+  Dom<View>::post(Space* home, Reflection::VarMap& vars,
+                  const Reflection::ActorSpec& spec) {
+    spec.checkArity(1);
+    ViewArray<View> x(home, vars, spec[0]);
+    (void) new (home) Dom<View>(home, x);
+  }
+
+  template <class View>
+  forceinline
+  Dom<View>::Dom(Space* home, bool share, Dom<View>& p)
+    : NaryPropagator<View,PC_INT_DOM>(home,share,p) {}
+
+  template <class View>
+  PropCost
+  Dom<View>::cost(ModEventDelta med) const {
+    return cost_lo(x.size(),
+                   (View::me(med) == ME_INT_VAL)
+                   ? PC_LINEAR_LO : PC_CUBIC_LO);
+  }
+
+  template <class View>
+  Support::Symbol
+  Dom<View>::ati(void) {
+    return Reflection::mangle<View>("Gecode::Int::Distinct::Dom");
+  }
+
+  template <class View>
+  Reflection::ActorSpec
+  Dom<View>::spec(const Space* home, Reflection::VarMap& m) const {
+    return NaryPropagator<View,PC_INT_DOM>::spec(home, m, ati());
+  }
+
+  template <class View>
+  Actor*
+  Dom<View>::copy(Space* home, bool share) {
+    return new (home) Dom<View>(home,share,*this);
+  }
+
+  template <class View>
+  ExecStatus
+  Dom<View>::propagate(Space* home, ModEventDelta med) {
+    if (View::me(med) == ME_INT_VAL) {
+      ExecStatus es = prop_val<View,false>(home,x);
+      GECODE_ES_CHECK(es);
+      if (x.size() < 2)
+        return ES_SUBSUMED(this,home);
+      if (es == ES_FIX)
+        return ES_FIX_PARTIAL(this,View::med(ME_INT_DOM));
+      es = prop_bnd<View>(home,x);
+      GECODE_ES_CHECK(es);
+      if (x.size() < 2)
+        return ES_SUBSUMED(this,home);
+      es = prop_val<View,true>(home,x);
+      GECODE_ES_CHECK(es);
+      if (x.size() < 2)
+        return ES_SUBSUMED(this,home);
+      return ES_FIX_PARTIAL(this,View::med(ME_INT_DOM));
+    }
+
+    if (x.size() == 2)
+      GECODE_REWRITE(this,Rel::Nq<View>::post(home,x[0],x[1]));
+    if (x.size() == 3)
+      GECODE_REWRITE(this,TerDom<View>::post(home,x[0],x[1],x[2]));
+
+    if (dc.available()) {
+      GECODE_ES_CHECK(dc.sync());
+    } else {
+      GECODE_ES_CHECK(dc.init(home,x.size(),&x[0]));
+    }
+
+    bool assigned;
+    GECODE_ES_CHECK(dc.propagate(home,assigned));
+
+    return ES_FIX;
+  }
+
+}}}
+
+// STATISTICS: int-prop
+