public K lowerKey(K key) {Entry<K, V> entry = findBounded(key, LOWER);return entry != null ? entry.getKey() : null;}

public K lowerKey ( K key ) { Entry < K , V > entry = findBounded ( key , LOWER ) ; return entry != null ? entry . getKey ( ) : null ; }
public K lowerKey(K key){java.util.MapClass.Entry<K, V> entry = this.findBounded(key, java.util.TreeMap.Relation.LOWER);return entry != null ? entry.getKey() : default(K);}
