@Override
		public int compare(HashEntry o1, HashEntry o2) {
			int sz1 = o1.instList.size();
			int sz2 = o2.instList.size();
			if (sz1 != sz2) return (sz1 < sz2) ? -1 : 1;
			if (o1.hash.size != o2.hash.size)
				return (o1.hash.size > o2.hash.size) ? -1 : 1;		// Prefer BIGGER n-gram
			return Long.compare(o1.hash.value, o2.hash.value);
		}
Comparator for the main HashStore sort.  Sort first preferring smallest number of duplicate n-grams,
then subsort on the size (significance) of the n-gram.
Ghidra/Framework/SoftwareModeling/src/main/java/ghidra/program/model/correlate/HashStore.java