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

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