TreeMap.getHigherEntry

Gets the entry for the least key greater than the specified key; if no such entry exists, returns the entry for the least key greater than the specified key; if no such entry exists returns {@code null}.

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

Meta