public synchronized TreeEntry < K , V > ceilingEntry ( final K key ) { // Retorna la clave mas cercana mayor o igual a la clave indicada return getRoundEntry ( key , true , true ) ; }
Returns the least key greater than or equal to the given key or null if there is no such key .