Add parts of IntView interface to NegBoolView, and fix min/max methods

Author: guidotack

gecode/int/view.hpp

@@ -1619,6 +1619,39 @@ namespace Gecode { namespace Int {
     ModEvent zero_none(Space& home);
     //@}
 
+    /// \name Domain update by value
+    //@{
+    /// Restrict domain values to be less or equal than \a n
+    ModEvent lq(Space& home, int n);
+    /// Restrict domain values to be less or equal than \a n
+    ModEvent lq(Space& home, long long int n);
+
+    /// Restrict domain values to be less than \a n
+    ModEvent le(Space& home, int n);
+    /// Restrict domain values to be less than \a n
+    ModEvent le(Space& home, long long int n);
+
+    /// Restrict domain values to be greater or equal than \a n
+    ModEvent gq(Space& home, int n);
+    /// Restrict domain values to be greater or equal than \a n
+    ModEvent gq(Space& home, long long int n);
+
+    /// Restrict domain values to be greater than \a n
+    ModEvent gr(Space& home, int n);
+    /// Restrict domain values to be greater than \a n
+    ModEvent gr(Space& home, long long int n);
+
+    /// Restrict domain values to be different from \a n
+    ModEvent nq(Space& home, int n);
+    /// Restrict domain values to be different from \a n
+    ModEvent nq(Space& home, long long int n);
+
+    /// Restrict domain values to be equal to \a n
+    ModEvent eq(Space& home, int n);
+    /// Restrict domain values to be equal to \a n
+    ModEvent eq(Space& home, long long int n);
+    //@}
+    
     /// \name Value access
     //@{
     /// Return minimum of domain

gecode/int/view/neg-bool.hpp

@@ -97,18 +97,70 @@ namespace Gecode { namespace Int {
     return x.zero(home);
   }
 
+  /* Domain update by value
+   *
+   */
 
+  forceinline ModEvent
+  NegBoolView::lq(Space& home, int n) {
+    return n==0 ? x.one(home) : (n < 0 ? ME_BOOL_FAILED : ME_BOOL_NONE);
+  }
+  forceinline ModEvent
+  NegBoolView::lq(Space& home, long long int n) {
+    return n==0 ? x.one(home) : (n < 0 ? ME_BOOL_FAILED : ME_BOOL_NONE);
+  }
+  forceinline ModEvent
+  NegBoolView::le(Space& home, int n) {
+    return n==1 ? x.one(home) : (n < 1 ? ME_BOOL_FAILED : ME_BOOL_NONE);
+  }
+  forceinline ModEvent
+  NegBoolView::le(Space& home, long long int n) {
+    return n==1 ? x.one(home) : (n < 1 ? ME_BOOL_FAILED : ME_BOOL_NONE);
+  }
+  forceinline ModEvent
+  NegBoolView::gq(Space& home, int n) {
+    return n==1 ? x.zero(home) : (n <= 0 ? ME_BOOL_NONE : ME_BOOL_FAILED);
+  }
+  forceinline ModEvent
+  NegBoolView::gq(Space& home, long long int n) {
+    return n==1 ? x.zero(home) : (n <= 0 ? ME_BOOL_NONE : ME_BOOL_FAILED);
+  }
+  forceinline ModEvent
+  NegBoolView::gr(Space& home, int n) {
+    return n==0 ? x.zero(home) : (n >= 1 ? ME_BOOL_FAILED : ME_BOOL_NONE);
+  }
+  forceinline ModEvent
+  NegBoolView::gr(Space& home, long long int n) {
+    return n==0 ? x.zero(home) : (n >= 1 ? ME_BOOL_FAILED : ME_BOOL_NONE);
+  }
+  forceinline ModEvent
+  NegBoolView::nq(Space& home, int n) {
+    return n==0 ? x.zero(home) : (n==1 ? x.one(home) : ME_BOOL_NONE);
+  }
+  forceinline ModEvent
+  NegBoolView::nq(Space& home, long long int n) {
+    return n==0 ? x.zero(home) : (n==1 ? x.one(home) : ME_BOOL_NONE);
+  }
+  forceinline ModEvent
+  NegBoolView::eq(Space& home, int n) {
+    return n==0 ? x.one(home) : (n==1 ? x.zero(home) : ME_BOOL_FAILED);
+  }
+  forceinline ModEvent
+  NegBoolView::eq(Space& home, long long int n) {
+    return n==0 ? x.one(home) : (n==1 ? x.zero(home) : ME_BOOL_FAILED);
+  }
+  
   /*
    * Value access
    *
    */
   forceinline int
   NegBoolView::min(void) const {
-    return x.max();
+    return 1-x.max();
   }
   forceinline int
   NegBoolView::max(void) const {
-    return x.min();
+    return 1-x.min();
   }
   forceinline int
   NegBoolView::val(void) const {