@Override
	public short getLast() {
        // if the highest possible key is in the set, return it.
        if(containsKey((short)(size-1))) {
            return (short)(size-1);
        }
        // otherwise return the next lowest key.
        return getPrevious((short)(size-1));
    }
Returns the last (highest) key in the set.
Ghidra/Framework/Generic/src/main/java/ghidra/util/datastruct/BitTree.java