6 Order* allocOrder(OrderType type, Set * set){
7 Order* order = (Order*)ourmalloc(sizeof(Order));
9 order->constraints = allocDefVectorBoolean();
14 Boolean* getOrderConstraint(Order* order, uint64_t first, uint64_t second){
15 //Probably a bad idea to do a O(n) search through the order...
16 //We have a hashset data structure, why not use it for O(1) search
19 //We don't like warnings
23 uint size = getSizeVectorInt(order->set->members);
24 //First we need to make sure that first and second are part of the list!
25 bool exist1=false, exist2=false;
26 for(int i=0; i<size; i++){
27 if(getVectorInt(order->set->members, i)==first){
29 }else if(getVectorInt(order->set->members, i) == second){
31 }else if(exist1 && exist2){
35 ASSERT(exist1 && exist2);