@Override
			public int compare(DataCtrl o1, DataCtrl o2) {
				CtrlNGram o1gram = o1.ctrlNGram;
				CtrlNGram o2gram = o2.ctrlNGram;
				if (o1gram.weight != o2gram.weight) {
					return (o1gram.weight < o2gram.weight) ? 1 : -1;	// Bigger weight first
				}
				if (o1gram.depth != o2gram.depth) {
					return (o1gram.depth < o2gram.depth) ? 1 : -1;		// Bigger depth first
				}
				if (o1gram.hash != o2gram.hash) {
					return (o1gram.hash < o2gram.hash) ? -1 : 1;
				}
				int res = o1gram.root.graph.side.compareTo(o2gram.root.graph.side);
				if (res != 0) {
					return res;
				}
				if (o1gram.root.uid != o2gram.root.uid) {
					return (o1gram.root.uid < o2gram.root.uid) ? -1 : 1;
				}
				return 0;
			}
Sort by control-flow hash, then by control-flow uid.
Higher weight, then higher depth, hashes come first.
Ghidra/Features/CodeCompare/src/main/java/ghidra/features/codecompare/graphanalysis/Pinning.java