public void fillOut() {
		if (acount < bcount) {
			min = acount;			// Smallest vector is a
			max = bcount;
		}
		else {
			min = bcount;			// Smallest vector is b
			max = acount;
		}
		diff = max - min;			// Subtract to get a positive difference
		numflip = min - intersectcount;	// Number of hashes in smallest vector not in intersection
	}
Assume the dotproduct, acount, bcount, and intersectcount are filled in
Calculate the remaining values: min, max, numflip, and diff
Assume small vector is produced by flipping and removing hashes from big vector
Calculate the number of flipped hashes (numflip) from a VectorCompare result
Calculate the difference in the number of hashes (diff) from a VectorCompare result
Ghidra/Framework/Generic/src/main/java/generic/lsh/vector/VectorCompare.java