gecoder-with-gecode 0.7.1 → 0.8.0

data/ext/gecode-1.3.1/gecode/int/linear/noview.icc

@@ -1,264 +0,0 @@
-/*
- *  Main authors:
- *     Christian Schulte <schulte@gecode.org>
- *
- *  Copyright:
- *     Christian Schulte, 2002
- *
- *  Last modified:
- *     $Date: 2006-08-24 11:25:05 +0200 (Thu, 24 Aug 2006) $ by $Author: schulte $
- *     $Revision: 3559 $
- *
- *  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 Linear {
-
-    /**
-     * \brief No view serves as filler for empty view arrays
-     *
-     */
-    class NoView : public ConstantViewBase {
-    public:
-      /// \name Constructors and initialization
-      //@{
-      /// Default constructor
-      NoView(void) {}
-      /// Initialize
-      void init(void) {}
-      //@}
-
-      /// \name Value access
-      //@{
-      /// Return minimum of domain
-      int min(void) const { return 0; }
-      /// Return maximum of domain
-      int max(void) const { return 0; }
-      /// Return median of domain
-      int med(void) const { return 0; }
-      /// Return assigned value (only if assigned)
-      int val(void) const { return 0; }
-
-      /// Return size (cardinality) of domain
-      unsigned int size(void) const { return 1; }
-      /// Return width of domain (distance between maximum and minimum)
-      unsigned int width(void) const { return 1; }
-      /// Return regret of domain minimum (distance to next larger value)
-      unsigned int regret_min(void) const { return 0; }
-      /// Return regret of domain maximum (distance to next smaller value)
-      unsigned int regret_max(void) const { return 0; }
-      //@}
-
-      /// \name Domain tests
-      //@{
-      /// Test whether domain is a range
-      bool range(void) const { return true; }
-      /// Test whether view is assigned
-      bool assigned(void) const { return true; }
-
-      /// Test whether \a n is contained in domain
-      bool in(int n) const { return false; }
-      /// Test whether \a n is contained in domain
-      bool in(double n) const { return false; }
-      //@}
-
-      /// \name Domain update by value
-      //@{
-      /// Restrict domain values to be less or equal than \a n
-      ModEvent lq(Space* home, int n) { return ME_INT_NONE; }
-      /// Restrict domain values to be less or equal than \a n
-      ModEvent lq(Space* home, double n) { return ME_INT_NONE; }
-      /// Restrict domain values to be less than \a n
-      ModEvent le(Space* home, int n) { return ME_INT_NONE; }
-      /// Restrict domain values to be less than \a n
-      ModEvent le(Space* home, double n) { return ME_INT_NONE; }
-      /// Restrict domain values to be greater or equal than \a n
-      ModEvent gq(Space* home, int n) { return ME_INT_NONE; }
-      /// Restrict domain values to be greater or equal than \a n
-      ModEvent gq(Space* home, double n) { return ME_INT_NONE; }
-      /// Restrict domain values to be greater than \a n
-      ModEvent gr(Space* home, int n) { return ME_INT_NONE; }
-      /// Restrict domain values to be greater than \a n
-      ModEvent gr(Space* home, double n) { return ME_INT_NONE; }
-      /// Restrict domain values to be different from \a n
-      ModEvent nq(Space* home, int n) { return ME_INT_NONE; }
-      /// Restrict domain values to be different from \a n
-      ModEvent nq(Space* home, double n) { return ME_INT_NONE; }
-      /// Restrict domain values to be equal to \a n
-      ModEvent eq(Space* home, int n) { return ME_INT_NONE; }
-      /// Restrict domain values to be equal to \a n
-      ModEvent eq(Space* home, double n) { return ME_INT_NONE; }
-      //@}
-
-      /// \name Propagator modification events
-      //@{
-      /// Return modification event of propagator \a p for view
-      static ModEvent pme(const Propagator* p) { return ME_INT_NONE; }
-      /// Translate modification event \a me to propagator modification event for view
-      static PropModEvent pme(ModEvent me) { return ME_INT_NONE; }
-      //@}
-
-      /// \name Dependencies
-      //@{
-      /// Subscribe propagator \a p with propagation condition \a pc to view
-      void subscribe(Space* home, Propagator* p, PropCond pc, bool process=true) {}
-      /// Cancel subscription of propagator \a p with propagation condition \a pc to view
-      void cancel(Space* home, Propagator* p, PropCond pc) {}
-      //@}
-
-      /// \name Cloning
-      //@{
-      /// Update this view to be a clone of view \a x
-      void update(Space* home, bool share, NoView& x) {}
-      //@}
-
-      /// \name View comparison
-      //@{
-      /// Test whether this view is the same as \a x
-      bool operator ==(const NoView& x) const { return true; }
-      /// Test whether this view is not the same as \a x
-      bool operator !=(const NoView& x) const { return false; }
-      /// Test whether this view is smaller than \a x (arbitrary order)
-      bool operator < (const NoView& x) const { return false; }
-      /// Test whether this view is larger than \a x (arbitrary order)
-      bool operator > (const NoView& x) const { return false; }
-      //@}
-    };
-
-  }}
-
-
-  /**
-   * \brief View array for no view (empty)
-   *
-   */
-  template <>
-  class ViewArray<Int::Linear::NoView> {
-  public:
-    /// \name Constructors and initialization
-    //@{
-    /// Default constructor (array of size 0)
-    ViewArray(void) {}
-    /// Allocate array with \a m variables
-    ViewArray(Space* home, int m) {}
-    /// Initialize
-    ViewArray(const ViewArray<Int::Linear::NoView>&) {}
-    /// Initialize
-    ViewArray(Space*, const ViewArray<Int::Linear::NoView>&) {}
-    /// Initialize
-    const ViewArray<Int::Linear::NoView>& operator=(const ViewArray<Int::Linear::NoView>&) { return *this; }
-    //@}
-
-    /// \name Array size
-    //@{
-    /// Return size of array (number of elements)
-    int size(void) const { return 0; }
-    /// Decrease size of array (number of elements)
-    void size(int n) {}
-    //@}
-
-    /// \name Array elements
-    //@{
-    /// Return view at position \a i
-    Int::Linear::NoView operator[](int i) { Int::Linear::NoView n; return n; }
-    //@}
-
-    /// \name Dependencies
-    //@{
-    /// Subscribe propagator \a p with propagation condition \a pc to all views
-    void subscribe(Space*, Propagator* p, PropCond pc, bool process=true) {}
-    /// Cancel subscription of propagator \a p with propagation condition \a pc to all views
-    void cancel(Space* home, Propagator* p, PropCond pc) {}
-    //@}
-
-    /// \name Cloning
-    //@{
-    /**
-     * \brief Update array to be a clone of array \a a
-     *
-     * If \a share is true, sharing is retained for all shared
-     * data structures. Otherwise, for each of them an independent
-     * copy is created.
-     */
-    void update(Space*, bool share, ViewArray<Int::Linear::NoView>& a) {}
-    //@}
-
-
-    /// \name Moving elements
-    //@{
-    /// Move assigned view from position 0 to position \a i (shift elements to the left)
-    void move_fst(int i) {}
-    /// Move assigned view from position \c size()-1 to position \a i (truncate array by one)
-    void move_lst(int i) {}
-    /** \brief Move view from position 0 to position \a i (shift elements to the left)
-     *
-     * Before moving, cancel subscription of propagator \a p with
-     * propagation condition \a pc to view at position \a i.
-     */
-    void move_fst(int i, Propagator* p, PropCond pc) {}
-    /** \brief Move view from position \c size()-1 to position \a i (truncate array by one)
-     *
-     * Before moving, cancel subscription of propagator \a p with
-     * propagation condition \a pc to view at position \a i.
-     */
-    void move_lst(int i, Propagator* p, PropCond pc) {}
-    //@}
-
-    /// \name Dropping elements
-    //@{
-    /// Drop assigned views from positions 0 to \a i-1 from array
-    void drop_fst(int i);
-    /// Drop assigned views from positions \a i+1 to \c size()-1 from array
-    void drop_lst(int i);
-    /** \brief Drop views from positions 0 to \a i-1 from array
-     *
-     * Before moving, cancel subscription of propagator \a p with
-     * propagation condition \a pc to views at positions 0 to \a i-1.
-     */
-    void drop_fst(int i, Propagator* p, PropCond pc) {}
-    /** \brief Drop assigned views from positions \a i+1 to \c size()-1 from array
-     *
-     * Before moving, cancel subscription of propagator \a p with
-     * propagation condition \a pc to views at positions \a i+1 to
-     * \c size()-1.
-     */
-    void drop_lst(int i, Propagator* p, PropCond pc) {}
-    //@}
-
-    /// \name View equality
-    //@{
-    /// Test whether array has equal views
-    bool equal(void) const { return false; }
-    /// Test whether array contains view equal to \a y
-    bool equal(const Int::Linear::NoView& y) const {return false; }
-    /// Remove all duplicate views from array (changes element order)
-    void unique(void) {}
-    //@}
-
-    /// \name View sharing
-    //@{
-    /// Test whether array has shared views
-    bool shared(void) const { return false; }
-    /// Test whether array contains view shared with \a y
-    bool shared(const Int::Linear::NoView& y) const { return false; }
-    //@}
-
-  private:
-    static void* operator new(size_t);
-    static void  operator delete(void*,size_t);
-  };
-
-}
-
-
-// STATISTICS: int-prop
-

data/ext/gecode-1.3.1/gecode/int/linear/post.cc

@@ -1,542 +0,0 @@
-/*
- *  Main authors:
- *     Christian Schulte <schulte@gecode.org>
- *
- *  Copyright:
- *     Christian Schulte, 2002
- *
- *  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.
- *
- */
-
-#include "gecode/int/rel.hh"
-#include "gecode/int/linear.hh"
-
-#include "gecode/support/sort.hh"
-
-#include <climits>
-#include <algorithm>
-
-namespace Gecode { namespace Int { namespace Linear {
-
-  /// Sort linear terms by view
-  class TermLess {
-  public:
-    forceinline bool
-    operator()(const Term& a, const Term& b) {
-      return before(a.x,b.x);
-    }
-  };
-
-  bool
-  preprocess(Term e[], int& n, IntRelType& r, int& c, int& n_p, int& n_n) {
-    if ((c < Limits::Int::int_min) || (c > Limits::Int::int_max))
-      throw NumericalOverflow("Int::linear");
-    /*
-     * Join coefficients for aliased variables:
-     */
-    {
-      // Group same variables
-      TermLess el;
-      Support::quicksort<Term,TermLess>(e,n,el);
-
-      // Join adjacent variables
-      int i = 0;
-      int j = 0;
-      while (i < n) {
-	int     a = e[i].a;
-	if ((a < Limits::Int::int_min) || (a > Limits::Int::int_max))
-	  throw NumericalOverflow("Int::linear");
-	IntView x = e[i].x;
-	while ((++i < n) && same(e[i].x,x)) {
-	  a += e[i].a;
-	  if ((a < Limits::Int::int_min) || (a > Limits::Int::int_max))
-	    throw NumericalOverflow("Int::linear");
-	}
-	if (a != 0) {
-	  e[j].a = a; e[j].x = x; j++;
-	}
-      }
-      n = j;
-    }
-    /*
-     * All inequations in terms of <=
-     */
-    switch (r) {
-    case IRT_EQ: case IRT_NQ: case IRT_LQ:
-      break;
-    case IRT_LE:
-      c--; r = IRT_LQ; break;
-    case IRT_GR:
-      c++; /* fall through */
-    case IRT_GQ:
-      r = IRT_LQ;
-      for (int i = n; i--; )
-	e[i].a = -e[i].a;
-      c = -c;
-      break;
-    default:
-      throw UnknownRelation("Int::linear");
-    }
-    /*
-     * Partition into positive/negative coefficents
-     */
-    {
-      int i = 0;
-      int j = n-1;
-      while (true) {
-	while ((e[j].a < 0) && (--j >= 0)) ;
-	while ((e[i].a > 0) && (++i <  n)) ;
-	if (j <= i) break;
-	std::swap(e[i],e[j]);
-      }
-      n_p = i;
-      n_n = n-n_p;
-    }
-    for (int i = n; i--; )
-      if ((e[i].a != 1) && (e[i].a != -1))
-	return false;
-    return true;
-  }
-
-  bool
-  int_precision(Term e[], int n, int c) {
-    // Decide the required precision
-    double sn = 0.0; double sp = 0.0;
-
-    for (int i = n; i--; ) {
-      const double l = e[i].a * static_cast<double>(e[i].x.min());
-      if (l < 0.0) sn += l; else sp += l;
-      const double u = e[i].a * static_cast<double>(e[i].x.max());
-      if (u < 0.0) sn += u; else sp += u;
-    }
-    double cp = (c<0) ? -c : c;
-    if ((sn-cp < Limits::Int::double_min) ||
-	(sp+cp > Limits::Int::double_max))
-      throw NumericalOverflow("Int::linear");
-
-    return ((sn >= Limits::Int::int_min) && (sn <= Limits::Int::int_max) &&
-	    (sp >= Limits::Int::int_min) && (sp <= Limits::Int::int_max) &&
-	    (sn-c >= Limits::Int::int_min) && (sn-c <= Limits::Int::int_max) &&
-	    (sp-c >= Limits::Int::int_min) && (sp-c <= Limits::Int::int_max));
-  }
-
-  /*
-   * Posting plain propagators
-   *
-   */
-
-  template <class Val, class View>
-  forceinline void
-  post_nary(Space* home,
-	    ViewArray<View>& x, ViewArray<View>& y, IntRelType r, Val c) {
-    switch (r) {
-    case IRT_LQ:
-      if (Lq<Val,View,View >::post(home,x,y,c) == ES_FAILED)
-	home->fail();
-      break;
-    case IRT_EQ:
-      if (Eq<Val,View,View >::post(home,x,y,c) == ES_FAILED)
-	home->fail();
-      break;
-    case IRT_NQ:
-      if (Nq<Val,View,View >::post(home,x,y,c) == ES_FAILED)
-	home->fail();
-      break;
-    default: GECODE_NEVER;
-    }
-  }
-
-  void
-  post(Space* home, Term e[], int n, IntRelType r, int c,
-       IntConLevel icl) {
-    int n_p, n_n;
-    bool is_unit = preprocess(e,n,r,c,n_p,n_n);
-    if (n == 0) {
-      switch (r) {
-      case IRT_EQ: if (c != 0) home->fail(); break;
-      case IRT_NQ: if (c == 0) home->fail(); break;
-      case IRT_LQ: if (0 > c)  home->fail(); break;
-      default: GECODE_NEVER;
-      }
-      return;
-    }
-    if (n == 1) {
-      if (e[0].a > 0) {
-	DoubleScaleView y(e[0].a,e[0].x);
-	switch (r) {
-	case IRT_EQ: GECODE_ME_FAIL(home,y.eq(home,c)); break;
-	case IRT_NQ: GECODE_ME_FAIL(home,y.nq(home,c)); break;
-	case IRT_LQ: GECODE_ME_FAIL(home,y.lq(home,c)); break;
-	default: GECODE_NEVER;
-	}
-      } else {
-	DoubleScaleView y(-e[0].a,e[0].x);
-	switch (r) {
-	case IRT_EQ: GECODE_ME_FAIL(home,y.eq(home,-c)); break;
-	case IRT_NQ: GECODE_ME_FAIL(home,y.nq(home,-c)); break;
-	case IRT_LQ: GECODE_ME_FAIL(home,y.gq(home,-c)); break;
-	default: GECODE_NEVER;
-	}
-      }
-      return;
-    }
-    bool is_ip = int_precision(e,n,c);
-    if (is_unit && is_ip && (icl != ICL_DOM)) {
-      if (n == 2) {
-	switch (r) {
-	case IRT_LQ:
-	  switch (n_p) {
-	  case 2:
-	    if (LqBin<int,IntView,IntView>::post(home,e[0].x,e[1].x,c)
-		== ES_FAILED) home->fail();
-	    break;
-	  case 1:
-	    if (LqBin<int,IntView,MinusView>::post(home,e[0].x,e[1].x,c)
-		== ES_FAILED) home->fail();
-	    break;
-	  case 0:
-	    if (LqBin<int,MinusView,MinusView>::post(home,e[0].x,e[1].x,c)
-		== ES_FAILED) home->fail();
-	    break;
-	  default: GECODE_NEVER;
-	  }
-	  break;
-	case IRT_EQ:
-	  switch (n_p) {
-	  case 2:
-	    if (EqBin<int,IntView,IntView>::post(home,e[0].x,e[1].x,c)
-		== ES_FAILED) home->fail();
-	    break;
-	  case 1:
-	    if (EqBin<int,IntView,MinusView>::post(home,e[0].x,e[1].x,c)
-		== ES_FAILED) home->fail();
-	    break;
-	  case 0:
-	    if (EqBin<int,IntView,IntView>::post(home,e[0].x,e[1].x,-c)
-		== ES_FAILED) home->fail();
-	    break;
-	  default: GECODE_NEVER;
-	  }
-	  break;
-	case IRT_NQ:
-	  switch (n_p) {
-	  case 2:
-	    if (NqBin<int,IntView,IntView>::post(home,e[0].x,e[1].x,c)
-		== ES_FAILED) home->fail();
-	    break;
-	  case 1:
-	    if (NqBin<int,IntView,MinusView>::post(home,e[0].x,e[1].x,c)
-		== ES_FAILED) home->fail();
-	    break;
-	  case 0:
-	    if (NqBin<int,IntView,IntView>::post(home,e[0].x,e[1].x,-c)
-		== ES_FAILED) home->fail();
-	    break;
-	  default: GECODE_NEVER;
-	  }
-	  break;
-	default: GECODE_NEVER;
-	}
-      } else if (n == 3) {
-	switch (r) {						
-	case IRT_LQ:
-	  switch (n_p) {
-	  case 3:
-	    if (LqTer<int,IntView,IntView,IntView>::post
-		(home,e[0].x,e[1].x,e[2].x,c) == ES_FAILED) home->fail();
-	    break;
-	  case 2:
-	    if (LqTer<int,IntView,IntView,MinusView>::post
-		(home,e[0].x,e[1].x,e[2].x,c) == ES_FAILED) home->fail();
-	    break;
-	  case 1:
-	    if (LqTer<int,IntView,MinusView,MinusView>::post
-		(home,e[0].x,e[1].x,e[2].x,c) == ES_FAILED) home->fail();
-	    break;
-	  case 0:
-	    if (LqTer<int,MinusView,MinusView,MinusView>::post
-		(home,e[0].x,e[1].x,e[2].x,c) == ES_FAILED) home->fail();
-	    break;
-	  default: GECODE_NEVER;
-	  }
-	  break;
-	case IRT_EQ:
-	  switch (n_p) {
-	  case 3:
-	    if (EqTer<int,IntView,IntView,IntView>::post
-		(home,e[0].x,e[1].x,e[2].x,c) == ES_FAILED) home->fail();
-	    break;
-	  case 2:
-	    if (EqTer<int,IntView,IntView,MinusView>::post
-		(home,e[0].x,e[1].x,e[2].x,c) == ES_FAILED) home->fail();
-	    break;
-	  case 1:
-	    if (EqTer<int,IntView,IntView,MinusView>::post
-		(home,e[1].x,e[2].x,e[0].x,-c) == ES_FAILED) home->fail();
-	    break;
-	  case 0:
-	    if (EqTer<int,IntView,IntView,IntView>::post
-		(home,e[0].x,e[1].x,e[2].x,-c) == ES_FAILED) home->fail();
-	    break;
-	  default: GECODE_NEVER;
-	  }
-	  break;
-	case IRT_NQ:
-	  switch (n_p) {
-	  case 3:
-	    if (NqTer<int,IntView,IntView,IntView>::post
-	      (home,e[0].x,e[1].x,e[2].x,c) == ES_FAILED) home->fail();
-	    break;
-	  case 2:
-	    if (NqTer<int,IntView,IntView,MinusView>::post
-	      (home,e[0].x,e[1].x,e[2].x,c) == ES_FAILED) home->fail();
-	    break;
-	  case 1:
-	    if (NqTer<int,IntView,IntView,MinusView>::post
-	      (home,e[1].x,e[2].x,e[0].x,-c) == ES_FAILED) home->fail();
-	    break;
-	  case 0:
-	    if (NqTer<int,IntView,IntView,IntView>::post
-	      (home,e[0].x,e[1].x,e[2].x,-c) == ES_FAILED) home->fail();
-	    break;
-	  default: GECODE_NEVER;
-	  }
-	  break;
-	default: GECODE_NEVER;
-	}
-      } else {
-	ViewArray<IntView> x(home,n_p);
-	for (int i = n_p; i--; ) x[i] = e[i].x;
-	ViewArray<IntView> y(home,n_n);
-	for (int i = n_n; i--; ) y[i] = e[i+n_p].x;
-	post_nary<int,IntView>(home,x,y,r,c);
-      }
-    } else {
-      if (is_ip) {
-	ViewArray<IntScaleView> x(home,n_p);
-	for (int i = n_p; i--; )
-	  x[i].init(e[i].a,e[i].x);
-	ViewArray<IntScaleView> y(home,n_n);
-	for (int i = n_n; i--; )
-	  y[i].init(-e[i+n_p].a,e[i+n_p].x);
-	if ((icl == ICL_DOM) && (r == IRT_EQ)) {
-	  if (DomEq<int,IntScaleView>::post(home,x,y,c) == ES_FAILED)
-	    home->fail();
-	} else {
-	  post_nary<int,IntScaleView>(home,x,y,r,c);
-	}
-      } else {
-	ViewArray<DoubleScaleView> x(home,n_p);
-	for (int i = n_p; i--; )
-	  x[i].init(e[i].a,e[i].x);
-	ViewArray<DoubleScaleView> y(home,n_n);
-	for (int i = n_n; i--; )
-	  y[i].init(-e[i+n_p].a,e[i+n_p].x);
-	if ((icl == ICL_DOM) && (r == IRT_EQ)) {
-	  if (DomEq<double,DoubleScaleView>::post(home,x,y,c) == ES_FAILED)
-	    home->fail();
-	} else {
-	  post_nary<double,DoubleScaleView>(home,x,y,r,c);
-	}
-      }
-    }
-  }
-
-
-
-  /*
-   * Posting reified propagators
-   *
-   */
-
-  template <class Val, class View>
-  forceinline void
-  post_nary(Space* home,
-	    ViewArray<View>& x, ViewArray<View>& y, IntRelType r, Val c, BoolView b) {
-    switch (r) {
-    case IRT_LQ:
-      if (ReLq<Val,View,View>::post(home,x,y,c,b) == ES_FAILED)
-	home->fail();
-      break;
-    case IRT_EQ:
-      if (ReEq<Val,View,View,BoolView>::post(home,x,y,c,b) == ES_FAILED)
-	home->fail();
-      break;
-    case IRT_NQ:
-      {
-	NegBoolView n(b);
-	if (ReEq<Val,View,View,NegBoolView>::post(home,x,y,c,n) == ES_FAILED)
-	  home->fail();
-      }
-      break;
-    default: GECODE_NEVER;
-    }
-  }
-
-  void
-  post(Space* home,
-       Term e[], int n, IntRelType r, int c, BoolView b) {
-    int n_p, n_n;
-    bool is_unit = preprocess(e,n,r,c,n_p,n_n);
-    if (n == 0) {
-      bool fail = false;
-      switch (r) {
-      case IRT_EQ: fail = (c != 0); break;
-      case IRT_NQ: fail = (c == 0); break;
-      case IRT_LQ: fail = (0 > c);  break;
-      default: GECODE_NEVER;
-      }
-      if ((fail ? b.t_zero(home) : b.t_one(home)) == ME_INT_FAILED)
-	home->fail();
-      return;
-    }
-    bool is_ip  = int_precision(e,n,c);
-    if (is_unit && is_ip) {
-      if (n == 1) {
-	switch (r) {
-	case IRT_EQ:
-	  if (e[0].a == 1) {
-	    if (Rel::ReEqBndInt<IntView,BoolView>::post(home,e[0].x,c,b)
-		== ES_FAILED)
-	      home->fail();
-	  } else {
-	    if (Rel::ReEqBndInt<IntView,BoolView>::post(home,e[0].x,-c,b)
-		== ES_FAILED)
-	      home->fail();
-	  }
-	  break;
-	case IRT_NQ:
-	  {
-	    NegBoolView n(b);
-	    if (e[0].a == 1) {
-	      if (Rel::ReEqBndInt<IntView,NegBoolView>::post(home,e[0].x,c,n)
-		  == ES_FAILED)
-		home->fail();
-	    } else {
-	      if (Rel::ReEqBndInt<IntView,NegBoolView>::post(home,e[0].x,-c,n)
-		  == ES_FAILED)
-		home->fail();
-	    }
-	  }
-	  break;
-	case IRT_LQ:
-	  if (e[0].a == 1) {
-	    if (Rel::ReLqInt<IntView,BoolView>::post(home,e[0].x,c,b)
-		== ES_FAILED)
-	      home->fail();
-	  } else {
-	    NegBoolView n(b);
-	    if (Rel::ReLqInt<IntView,NegBoolView>::post(home,e[0].x,-c-1,n)
-		== ES_FAILED)
-	      home->fail();
-	  }
-	  break;
-	default: GECODE_NEVER;
-	}
-      } else if (n == 2) {
-	switch (r) {
-	case IRT_LQ:
-	  switch (n_p) {
-	  case 2:
-	    if (ReLqBin<int,IntView,IntView>::post(home,e[0].x,e[1].x,c,b)
-		== ES_FAILED) home->fail();
-	    break;
-	  case 1:
-	    if (ReLqBin<int,IntView,MinusView>::post(home,e[0].x,e[1].x,c,b)
-		== ES_FAILED) home->fail();
-	    break;
-	  case 0:
-	    if (ReLqBin<int,MinusView,MinusView>::post(home,e[0].x,e[1].x,c,b)
-		== ES_FAILED) home->fail();
-	    break;
-	  default: GECODE_NEVER;
-	  }
-	  break;
-	case IRT_EQ:
-	  switch (n_p) {
-	  case 2:
-	    if (ReEqBin<int,IntView,IntView,BoolView>::post
-		(home,e[0].x,e[1].x,c,b)
-		== ES_FAILED) home->fail();
-	    break;
-	  case 1:
-	    if (ReEqBin<int,IntView,MinusView,BoolView>::post
-		(home,e[0].x,e[1].x,c,b)
-		== ES_FAILED) home->fail();
-	    break;
-	  case 0:
-	    if (ReEqBin<int,IntView,IntView,BoolView>::post
-		(home,e[0].x,e[1].x,-c,b)
-		== ES_FAILED) home->fail();
-	    break;
-	  default: GECODE_NEVER;
-	  }
-	  break;
-	case IRT_NQ:
-	  {
-	    NegBoolView n(b);
-	    switch (n_p) {
-	    case 2:
-	      if (ReEqBin<int,IntView,IntView,NegBoolView>::post
-		  (home,e[0].x,e[1].x,c,n)
-		  == ES_FAILED) home->fail();
-	      break;
-	    case 1:
-	      if (ReEqBin<int,IntView,MinusView,NegBoolView>::post
-		  (home,e[0].x,e[1].x,c,b)
-		  == ES_FAILED) home->fail();
-	      break;
-	    case 0:
-	      if (ReEqBin<int,IntView,IntView,NegBoolView>::post
-		  (home,e[0].x,e[1].x,-c,b)
-		  == ES_FAILED) home->fail();
-	      break;
-	    default: GECODE_NEVER;
-	    }
-	  }
-	  break;
-	default: GECODE_NEVER;
-	}
-      } else {
-	ViewArray<IntView> x(home,n_p);
-	for (int i = n_p; i--; ) x[i] = e[i].x;
-	ViewArray<IntView> y(home,n_n);
-	for (int i = n_n; i--; ) y[i] = e[i+n_p].x;
-	post_nary<int,IntView>(home,x,y,r,c,b);
-      }
-    } else {
-      if (is_ip) {
-	ViewArray<IntScaleView> x(home,n_p);
-	for (int i = n_p; i--; )
-	  x[i].init(e[i].a,e[i].x);
-	ViewArray<IntScaleView> y(home,n_n);
-	for (int i = n_n; i--; )
-	  y[i].init(-e[i+n_p].a,e[i+n_p].x);
-	post_nary<int,IntScaleView>(home,x,y,r,c,b);
-      } else {
-	ViewArray<DoubleScaleView> x(home,n_p);
-	for (int i = n_p; i--; )
-	  x[i].init(e[i].a,e[i].x);
-	ViewArray<DoubleScaleView> y(home,n_n);
-	for (int i = n_n; i--; )
-	  y[i].init(-e[i+n_p].a,e[i+n_p].x);
-	post_nary<double,DoubleScaleView>(home,x,y,r,c,b);
-      }
-    }
-  }
-
-}}}
-
-// STATISTICS: int-post
-