Fix warnings

diff --git a/src/AST/boolean.c b/src/AST/boolean.c
index ce6fad950d39d66d85dac78a28358ec72e0318b6..63df873363958bf680a0bd689508826b75ec4210 100644 (file)
--- a/src/AST/boolean.c
+++ b/src/AST/boolean.c
@@ -13,4 +13,5 @@ Boolean* allocBooleanOrder(Order* order,uint64_t first, uint64_t second){
     tmp->order = order;
     tmp->first=first;
     tmp->second=second;
-}
\ No newline at end of file
+               return tmp;
+}

diff --git a/src/AST/order.c b/src/AST/order.c
index 2f8381e234e59d0c698fbba314dccf69c6c9dbab..dd233b644bd2964e2566d83019897b470f167dbc 100644 (file)
--- a/src/AST/order.c
+++ b/src/AST/order.c
@@ -12,7 +12,15 @@ Order* allocOrder(enum OrderType type, Set * set){
 }
 
 Boolean* getOrderConstraint(Order* order, uint64_t first, uint64_t second){
-    uint size = getSizeVectorInt(order->set->members);
+       //Probably a bad idea to do a O(n) search through the order...
+       //We have a hashset data structure, why not use it for O(1) search
+
+
+       //We don't like warnings
+       return NULL;
+
+       /*
+       uint size = getSizeVectorInt(order->set->members);
     //First we need to make sure that first and second are part of the list!
     bool exist1=false, exist2=false;
     for(int i=0; i<size; i++){
@@ -25,5 +33,5 @@ Boolean* getOrderConstraint(Order* order, uint64_t first, uint64_t second){
         }
     }
     ASSERT(exist1 && exist2);
-    
-}
\ No newline at end of file
+       */
+}

diff --git a/src/csolver.c b/src/csolver.c
index 5ddaaeda13e13e79db6bb291f2705418217241c4..0f971b12afb0979c7df7f8de61fd318463880c7b 100644 (file)
--- a/src/csolver.c
+++ b/src/csolver.c
@@ -4,6 +4,7 @@
 #include "element.h"
 #include "boolean.h"
 #include "predicate.h"
+#include "order.h"
 
 CSolver * allocCSolver() {
        CSolver * tmp=(CSolver *) ourmalloc(sizeof(CSolver));