Java NavigableMap.higherEntry(K key)

Map.Entry < K , V > higherEntry(K key)

//w w  w  .  ja v  a  2 s  .c  o m
import java.util.Iterator;
import java.util.NavigableMap;
import java.util.NavigableSet;
import java.util.TreeMap;

public class Main {
  public static void main(String[] args) {
    NavigableMap<String, Integer> navigableMap = new TreeMap<String, Integer>();
    String[] letters = { "a", "b", "c" };
    int[] ints = { 3, 2, 1 };
    for (int i = 0; i < letters.length; i++){
      navigableMap.put(letters[i], ints[i]);
    }
    System.out.println("Map = " + navigableMap);
    System.out.println("Entry > c is " + navigableMap.higherEntry("c"));
  }
}