@Override
			public int compare(KeyPath o1, KeyPath o2) {
				int min = Math.min(o1.size(), o2.size());
				for (int i = 0; i < min; i++) {
					String e1 = o1.key(i);
					String e2 = o2.key(i);
					int c = e1.compareTo(e2);
					if (c != 0) {
						return c;
					}
				}
				return Integer.compare(o1.size(), o2.size());
			}
Sort paths by key, prioritizing the left-most, i.e., top-most, keys.

<p>
If one path is a prefix to the other, the prefix is "less than" the other.
Ghidra/Debug/Framework-TraceModeling/src/main/java/ghidra/trace/model/target/path/KeyPath.java