4 OrderNode* allocOrderNode(uint64_t id, Order* order){
5 OrderNode* This = (OrderNode*) ourmalloc(sizeof(OrderNode));
8 This->inEdges = allocHashSetOrderEdge(HT_INITIAL_CAPACITY, HT_DEFAULT_FACTOR);
9 This->outEdges = allocHashSetOrderEdge(HT_INITIAL_CAPACITY, HT_DEFAULT_FACTOR);
13 void addNewIncomingEdge(OrderNode* node, OrderEdge* edge){
14 ASSERT(!containsHashSetOrderEdge(node->inEdges, edge)); // Only for testing ... Should be removed after testing
15 addHashSetOrderEdge(node->inEdges, edge);
18 void addNewOutgoingEdge(OrderNode* node, OrderEdge* edge){
19 ASSERT(!containsHashSetOrderEdge(node->outEdges, edge));
20 addHashSetOrderEdge(node->outEdges, edge);
23 void deleteOrderNode(OrderNode* node){
24 deleteHashSetOrderEdge(node->inEdges);
25 deleteHashSetOrderEdge(node->outEdges);