public IteratorSTL<T> lower_bound(T key) {
		if (!(key instanceof Comparable)) {
			throw new UnsupportedOperationException("T must be comparable");
		}
		return lower_bound(key, comparableComparator);
	}
Returns an iterator postioned at the item in the vector that is the smallest key less or equal than
the given key.  This method assumes the vector is sorted in ascending order.
@param key the key for which to find the lower bound
@return an iterator postioned at the item in the vector that is the smallest key less or equal than
the given key.
Ghidra/Framework/Generic/src/main/java/generic/stl/VectorSTL.java