Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Physics
Chemistry
Biology
Mathematics
English
Economics
Psychology
Social Studies
Fashion Studies
Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
NavigableMap lowerEntry() method in Java
The lowerEntry() method in NavigabelMap returns a key-value mapping associated with the greatest key strictly less than the given key.
The following is an example to implement lowerEntry() method
Example
import java.util.*;
public class Demo {
public static void main(String[] args) {
NavigableMap<Integer, String> n = new TreeMap<Integer, String>();
n.put(5, "Tom");
n.put(9, "John");
n.put(14, "Jamie");
n.put(1, "Tim");
n.put(4, "Jackie");
n.put(15, "Kurt");
n.put(19, "Tiger");
n.put(24, "Jacob");
System.out.println("NavigableMap elements...
"+n);
System.out.println("Lower Entry is "+n.lowerEntry(10));
}
}Output
The output is as follows
NavigableMap elements...
{1=Tim, 4=Jackie, 5=Tom, 9=John, 14=Jamie, 15=Kurt, 19=Tiger, 24=Jacob}
Lower Entry is 9=John
Updated on: 29-Jun-2020
56 Views
Advertisements