fix to reversed sub-node order for block size iterator

Author: seancfoley

IPAddress/src/inet.ipaddr/inet/ipaddr/format/util/BinaryTreeNode.java

@@ -1378,7 +1378,7 @@ public int compare(BinaryTreeNode<E> node1, BinaryTreeNode<E> node2) {
 			this.addedOnly = addedOnly;
 			this.bounds = bounds;
 			Comparator<BinaryTreeNode<E>> comp = 
-					(Comparator<BinaryTreeNode<E>>) (reverseBlocksEqualSize ? COMP : REVERSE_COMP);
+					(Comparator<BinaryTreeNode<E>>) (reverseBlocksEqualSize ? REVERSE_COMP : COMP);
 			if(treeSize > 0) {
 				int initialCapacity = treeSize >> 1;
 				if(initialCapacity == 0) {
@@ -1478,7 +1478,7 @@ static class Cached<E, C> {
 
 		private static final Comparator<?> COMP = new Comp<>(false), REVERSE_COMP = new Comp<>(true);
 
-		// heap will have either a caching objectwith the node or just the node
+		// heap will have the caching object with the node
 		private PriorityQueue<Cached<E, C>> queue;
 
 		private C cacheItem;
@@ -1493,7 +1493,7 @@ static class Cached<E, C> {
 				ChangeTracker changeTracker) {
 			super(start, null, changeTracker);
 			@SuppressWarnings("unchecked")
-			Comparator<Cached<E, C>> comp = (Comparator<Cached<E, C>>) (reverseBlocksEqualSize ? COMP : REVERSE_COMP);
+			Comparator<Cached<E, C>> comp = (Comparator<Cached<E, C>>) (reverseBlocksEqualSize ? REVERSE_COMP : COMP);
 			if(treeSize == 0) {
 				queue = new PriorityQueue<>(comp);
 			} else {