From b357df193c24d17d666c8303bd3fd78352c9212a Mon Sep 17 00:00:00 2001
From: bdemsky <bdemsky@uci.edu>
Date: Fri, 16 Jun 2017 11:19:19 -0700
Subject: [PATCH] Fix warnings

---
 src/AST/boolean.c |  3 ++-
 src/AST/order.c   | 14 +++++++++++---
 src/csolver.c     |  1 +
 3 files changed, 14 insertions(+), 4 deletions(-)

diff --git a/src/AST/boolean.c b/src/AST/boolean.c
index ce6fad9..63df873 100644
--- 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 2f8381e..dd233b6 100644
--- 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 5ddaaed..0f971b1 100644
--- 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));
-- 
2.34.1