TreeMap.getLowerEntry

Returns the entry for the greatest key less than the specified key; if no such entry exists (i.e., the least key in the Tree is greater than the specified key), returns {@code null}.

class TreeMap(K, V)
final
getLowerEntry
(
K key
)
if (
isOrderingComparable!K
)

Meta