for (uint i = 0; i < size; i++) {
Order *order = orders->get(i);
decomposeOrder->setCurrentOrder(order);
- if (!decomposeOrder->canExecuteTransform()){
+
+ if (true) {
continue;
}
uint newMask = newCapacity - 1;
for (uint i = 0; i < oldCapacity; i++) {
Node *n = old_array[i];
+ if (n == NULL)
+ continue;
uint hashCode = n->hashCode;
uint newindex = hashCode & newMask;
for (;; newindex = (newindex + 1) & newMask) {
}
}
*n_ptr = allocNode(type, numEdges, edges, hashvalue);
+ cnf->size++;
Edge e = {*n_ptr};
return e;
}