if (ln.getCount() > rn.getCount()) {
n1 = rn;
n2 = ln;
}
FIFOQueue queue = new FIFOQueue(256);
queue.enq(n1);
//ensure all subnodes of n1 visited before n2
while(!queue.isEmpty()) {
Node n = (Node)queue.deq();
ln = (Node)obj2node.get(n.getObject().toString() + ".0");
rn = (Node)obj2node.get(n.getObject().toString() + ".1");
if (ln == null) continue;
assertTrue(ln.getCount() < n2.getCount());
assertTrue(rn.getCount() < n2.getCount());
queue.enq(ln);
queue.enq(rn);
}
}
return 0;
}
};