public Entry<K, V> lowerEntry(K key) {return immutableCopy(findBounded(key, LOWER));}

public Entry < K , V > lowerEntry ( K key ) { return immutableCopy ( findBounded ( key , LOWER ) ) ; }
public java.util.MapClass.Entry<K, V> lowerEntry(K key){return this._enclosing.immutableCopy(this.findBounded(key, java.util.TreeMap.Relation.LOWER));}
