7 Order* allocOrder(OrderType type, Set * set){
8 Order* order = (Order*)ourmalloc(sizeof(Order));
10 order->constraints = allocDefVectorBoolean();
15 Boolean* getOrderConstraint(Order* order, uint64_t first, uint64_t second){
16 //Probably a bad idea to do a O(n) search through the order...
17 //We have a hashset data structure, why not use it for O(1) search
20 //We don't like warnings
24 uint size = getSizeVectorInt(order->set->members);
25 //First we need to make sure that first and second are part of the list!
26 bool exist1=false, exist2=false;
27 for(int i=0; i<size; i++){
28 if(getVectorInt(order->set->members, i)==first){
30 }else if(getVectorInt(order->set->members, i) == second){
32 }else if(exist1 && exist2){
36 ASSERT(exist1 && exist2);
40 void deleteOrder(Order* order){
41 uint size = getSizeVectorBoolean( order->constraints );
42 for(uint i=0; i<size; i++){
43 deleteBoolean( getVectorBoolean(order->constraints, i) );
45 deleteSet( order->set);