
- Java.util Package Classes
- Java.util - Home
- Java.util - ArrayDeque
- Java.util - ArrayList
- Java.util - Arrays
- Java.util - BitSet
- Java.util - Calendar
- Java.util - Collections
- Java.util - Currency
- Java.util - Date
- Java.util - Dictionary
- Java.util - EnumMap
- Java.util - EnumSet
- Java.util - Formatter
- Java.util - GregorianCalendar
- Java.util - HashMap
- Java.util - HashSet
- Java.util - Hashtable
- Java.util - IdentityHashMap
- Java.util - LinkedHashMap
- Java.util - LinkedHashSet
- Java.util - LinkedList
- Java.util - ListResourceBundle
- Java.util - Locale
- Java.util - Observable
- Java.util - PriorityQueue
- Java.util - Properties
- Java.util - PropertyPermission
- Java.util - PropertyResourceBundle
- Java.util - Random
- Java.util - ResourceBundle
- Java.util - ResourceBundle.Control
- Java.util - Scanner
- Java.util - ServiceLoader
- Java.util - SimpleTimeZone
- Java.util - Stack
- Java.util - StringTokenizer
- Java.util - Timer
- Java.util - TimerTask
- Java.util - TimeZone
- Java.util - TreeMap
- Java.util - TreeSet
- Java.util - UUID
- Java.util - Vector
- Java.util - WeakHashMap
- Java.util Package Extras
- Java.util - Interfaces
- Java.util - Exceptions
- Java.util - Enumerations
- Java.util Useful Resources
- Java.util - Useful Resources
- Java.util - Discussion
java.util.TreeMap.ceilingEntry() Method
Description
The ceilingEntry(K key) method is used to return a key-value mapping associated with the least key greater than or equal to the given key, or null if there is no such key.
Declaration
Following is the declaration for java.util.TreeMap.ceilingEntry() method.
public Map.Entry<K,V> ceilingEntry(K key)
Parameters
key − This is the key to be matched.
Return Value
The method call returns an entry with the least key greater than or equal to key, or null if there is no such key.
Exception
ClassCastException − It throws the exception if the specified key cannot be compared with the keys currently in the map.
NullPointerException − It throws the exception if the specified key is null and this map uses natural ordering, or its comparator does not permit null keys.
Example
The following example shows the usage of java.util.TreeMap.ceilingEntry() method.
package com.tutorialspoint; import java.util.*; public class TreeMapDemo { public static void main(String[] args) { // creating tree map NavigableMap<Integer, String> treemap = new TreeMap<Integer, String>(); // populating tree map treemap.put(2, "two"); treemap.put(1, "one"); treemap.put(3, "three"); treemap.put(6, "six"); treemap.put(5, "five"); System.out.println("Ceiling entry for 4: "+ treemap.ceilingEntry(4)); System.out.println("Ceiling entry for 5: "+ treemap.ceilingEntry(5)); } }
Let us compile and run the above program, this will produce the following result.
Ceiling entry for 4: 5=five Ceiling entry for 5: 5=five