this.leafNodeRemains(node1, node2); return 0; this.leafNodeChangedToNonLeafNode(node1, node2); return 1; this.nonLeafNodeChangedToLeafNode(node1, node2); return 1; this.nodeDeleted(subnode1); differenceCount++; if (!it1.hasNext()) { this.nodeAdded(subnode2); differenceCount++; break; } else if (comp > 0) { this.nodeAdded(subnode2); differenceCount++; if (!it2.hasNext()) { this.nodeDeleted(subnode1); differenceCount++; break; differenceCount += this.compare(subnode1, subnode2); if (!it1.hasNext() || !it2.hasNext()) break; subnode1 = it1.next();
treeComparator.compare(node1, node2);
this.leafNodeRemains(node1, node2); return 0; this.leafNodeChangedToNonLeafNode(node1, node2); return 1; this.nonLeafNodeChangedToLeafNode(node1, node2); return 1; this.nodeDeleted(subnode1); differenceCount++; if (!it1.hasNext()) { this.nodeAdded(subnode2); differenceCount++; break; } else if (comp > 0) { this.nodeAdded(subnode2); differenceCount++; if (!it2.hasNext()) { this.nodeDeleted(subnode1); differenceCount++; break; differenceCount += this.compare(subnode1, subnode2); if (!it1.hasNext() || !it2.hasNext()) break; subnode1 = it1.next();