public static class AddressTrie.TrieComparator<E extends Address> extends Object implements Comparator<BinaryTreeNode<E>>, Serializable
| Modifier and Type | Method and Description |
|---|---|
int |
compare(BinaryTreeNode<E> tree1,
BinaryTreeNode<E> tree2)
Compares its two arguments for order.
|
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitcomparing, comparing, comparingDouble, comparingInt, comparingLong, equals, naturalOrder, nullsFirst, nullsLast, reversed, reverseOrder, thenComparing, thenComparing, thenComparing, thenComparingDouble, thenComparingInt, thenComparingLongpublic int compare(BinaryTreeNode<E> tree1, BinaryTreeNode<E> tree2)
java.util.ComparatorIn the foregoing description, the notation sgn(expression) designates the mathematical signum function, which is defined to return one of -1, 0, or 1 according to whether the value of expression is negative, zero or positive.
The implementor must ensure that sgn(compare(x, y)) == -sgn(compare(y, x)) for all x and y. (This implies that compare(x, y) must throw an exception if and only if compare(y, x) throws an exception.)
The implementor must also ensure that the relation is transitive: ((compare(x, y)>0) && (compare(y, z)>0)) implies compare(x, z)>0.
Finally, the implementor must ensure that compare(x, y)==0 implies that sgn(compare(x, z))==sgn(compare(y, z)) for all z.
It is generally the case, but not strictly required that (compare(x, y)==0) == (x.equals(y)). Generally speaking, any comparator that violates this condition should clearly indicate this fact. The recommended language is "Note: this comparator imposes orderings that are inconsistent with equals."
compare in interface Comparator<BinaryTreeNode<E extends Address>>tree1 - the first object to be compared.tree2 - the second object to be compared.