void DecomposeOrderTransform::removeMustBeTrueNodes(OrderGraph *graph, DecomposeOrderResolver *dor) {
SetIteratorOrderNode *iterator = graph->getNodes();
while (iterator->hasNext()) {
- OrderNode *node = iterator->next();
+ OrderNode *node = (OrderNode*)iterator->next();
if (node->removed)
continue;
if (isMustBeTrueNode(node)) {
void DecomposeOrderTransform::mustEdgePrune(OrderGraph *graph, DecomposeOrderResolver *dor) {
SetIteratorOrderNode *iterator = graph->getNodes();
while (iterator->hasNext()) {
- OrderNode *node = iterator->next();
+ OrderNode *node = (OrderNode*)iterator->next();
if (node->removed)
continue;
attemptNodeMerge(graph, node, dor);