There are two variants of ceilingEntry() in Java.util.TreeMap, both are discussed in this article.
1. ceilingEntry(K Key) : It 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.
Syntax :
public Map.Entry ceilingEntry(K key)
Parameters :
key : The key to be matched.
Return Value :
It returns the entry with the least key greater than or equal to key, and 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.
import java.io.*;
import java.util.*;
public class ceilingEntry1 {
public static void main(String[] args) {
TreeMap<Integer, String> treemap = new TreeMap<Integer, String>();
treemap.put( 2 , "two" );
treemap.put( 7 , "seven" );
treemap.put( 3 , "three" );
System.out.println( "The next greater key-value of 5 is : " + treemap.ceilingEntry( 5 ));
System.out.println( "The next greater key-value of 8 is : " + treemap.ceilingEntry( 8 ));
}
}
|
Output:
The next greater key-value of 5 is : 7=seven
The next greater key-value of 8 is : null
2. ceilingKey(K key) : This has also the same work as that of the upper one but the only difference is that it does not contains the mapped-keys.It simply returns the least key greater or equal to the given key, else returns NULL.
Syntax :
public K ceilingKey(K key)
Parameters :
key : The key to be matched.
Return Value :
It returns the entry with the least key greater than or equal to key, and 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.
import java.io.*;
import java.util.*;
public class ceilingKey1 {
public static void main(String[] args) {
TreeMap<Integer, String> treemap = new TreeMap<Integer, String>();
treemap.put( 2 , "two" );
treemap.put( 7 , "seven" );
treemap.put( 3 , "three" );
System.out.println( "The next greater key of 5 is : " + treemap.ceilingKey( 5 ));
System.out.println( "The next greater key of 8 is : " + treemap.ceilingKey( 8 ));
}
}
|
Output:
The next greater key of 5 is : 7
The next greater key of 8 is : null
If you like GeeksforGeeks and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to review-team@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
Feeling lost in the vast world of Backend Development? It's time for a change! Join our
Java Backend Development - Live Course and embark on an exciting journey to master backend development efficiently and on schedule.
What We Offer:
- Comprehensive Course
- Expert Guidance for Efficient Learning
- Hands-on Experience with Real-world Projects
- Proven Track Record with 100,000+ Successful Geeks
Last Updated :
18 Sep, 2023
Like Article
Save Article