Order* allocOrder(OrderType type, Set * set){
Order* order = (Order*)ourmalloc(sizeof(Order));
order->set=set;
- order->constraints = allocDefVectorBoolean();
+ allocInlineDefVectorBoolean(& order->constraints);
order->type=type;
return order;
}
void deleteOrder(Order* order){
- uint size = getSizeVectorBoolean( order->constraints );
- for(uint i=0; i<size; i++){
- deleteBoolean( getVectorBoolean(order->constraints, i) );
- }
- deleteSet( order->set);
+ deleteVectorArrayBoolean(& order->constraints);
ourfree(order);
}
struct Order {
OrderType type;
Set * set;
- VectorBoolean* constraints;
+ VectorBoolean constraints;
};
Order* allocOrder(OrderType type, Set * set);
sp_before_semi = ignore
sp_before_semi_for_empty = ignore
sp_after_semi_for_empty = ignore
-sp_before_nl_cont = ignore
\ No newline at end of file
+sp_before_nl_cont = ignore
\ No newline at end of file
Element * inputs[]={e1, e2};
Boolean * b=applyPredicate(solver, equals, inputs, 2);
addBoolean(solver, b);
+ Order * o=createOrder(solver, TOTAL, s);
+ Boolean * oc=orderConstraint(solver, o, 1, 2);
+ addBoolean(solver, oc);
deleteSolver(solver);
}