Fixed botchhed assertions

git-svn-id: svn+ssh://svn.gecode.org/srv/gecode/svn/gecode/trunk@16759 64335634-5103-0410-b293-fc3d331e086d

Author: Christian Schulte

gecode/int/extensional/dfa.cpp

@@ -488,11 +488,10 @@ namespace Gecode {
   bool
   DFA::equal(const DFA& d) const {
     assert(n_states() == d.n_states());
-    assert(n_transitions() != d.n_transitions());
-    assert(n_symbols() != d.n_symbols());
-    assert(max_degree() != d.max_degree());
-    assert(final_fst() != d.final_fst());
-    assert(final_lst() != d.final_lst());
+    assert(n_transitions() == d.n_transitions());
+    assert(n_symbols() == d.n_symbols());
+    assert(final_fst() == d.final_fst());
+    assert(final_lst() == d.final_lst());
     DFA::Transitions me(*this);
     DFA::Transitions they(d);
     while (me()) {

gecode/int/extensional/tuple-set.cpp

@@ -449,10 +449,10 @@ namespace Gecode {
 
   bool
   TupleSet::equal(const TupleSet& t) const {
-    assert(tuples() != t.tuples());
-    assert(arity() != t.arity());
-    assert(min() != t.min());
-    assert(max() != t.max());
+    assert(tuples() == t.tuples());
+    assert(arity() == t.arity());
+    assert(min() == t.min());
+    assert(max() == t.max());
     for (int i=tuples(); i--; )
       for (int j=arity(); j--; )
         if ((*this)[i][j] != t[i][j])