}
// If not merging internal nodes, notify the master
- if (d_masterEqualityEngine && !d_isInternal[mergeInto]) {
+ if (d_masterEqualityEngine && !d_isInternal[t1classId] && !d_isInternal[t2classId]) {
d_masterEqualityEngine->assertEqualityInternal(d_nodes[t1classId], d_nodes[t2classId], TNode::null());
d_masterEqualityEngine->propagate();
}
}
};/* struct EqualityEngine::statistics */
- /**
- * Store the application lookup, with enough information to backtrack
- */
- void storeApplicationLookup(FunctionApplication& funNormalized, EqualityNodeId funId);
-
private:
/** The context we are using */
/** Number of application lookups, for backtracking. */
context::CDO<DefaultSizeType> d_applicationLookupsCount;
+ /**
+ * Store the application lookup, with enough information to backtrack
+ */
+ void storeApplicationLookup(FunctionApplication& funNormalized, EqualityNodeId funId);
+
/** Map from ids to the nodes (these need to be nodes as we pick up the operators) */
std::vector<Node> d_nodes;