public boolean checkAndSetReinserted() {
			if ((reinsertedLevels >> dstLevel & 0x1) != 0) {
				return true;
			}
			reinsertedLevels |= (1 << dstLevel);
			return false;
		}
The Split algorithm as defined in Section 4.2 of the paper.

@param n the node to split
@return the new node (containing the second group)
Ghidra/Debug/ProposedUtils/src/main/java/ghidra/util/database/spatial/AbstractRStarConstraintsTree.java