diff --git a/src/manual/java/blusunrize/lib/manual/Tree.java b/src/manual/java/blusunrize/lib/manual/Tree.java
index 4e20c2abf1..6d2cf33f53 100644
--- a/src/manual/java/blusunrize/lib/manual/Tree.java
+++ b/src/manual/java/blusunrize/lib/manual/Tree.java
@@ -111,8 +111,7 @@ public static class InnerNode<NT extends Comparable<NT>, LT extends Comparable<L
 		private final List<AbstractNode<NT, LT>> children = new ArrayList<>();
 
 		private final Comparator<AbstractNode<NT, LT>> compare =
-				Comparator.<AbstractNode<NT, LT>, Boolean>comparing(AbstractNode::isLeaf)
-						.thenComparingDouble(AbstractNode::getWeight)
+				Comparator.<AbstractNode<NT, LT>>comparingDouble(AbstractNode::getWeight)
 						//Nulls should be irrelevant (either both or neither are null)
 						.thenComparing(AbstractNode::getNodeData, Comparator.nullsFirst(Comparator.naturalOrder()))
 						.thenComparing(AbstractNode::getLeafData, Comparator.nullsFirst(Comparator.naturalOrder()));