Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://www.tutorialspoint.com/java/util/treemap_descendingkeyset.htm below:

Java TreeMap descendingKeySet() Method

The Java TreeMap descendingKeySet() method is used to return a reverse order NavigableSet view of the keys contained in this map. The set's iterator returns the keys in descending order. The set is backed by the map, so changes to the map are reflected in the set, and vice-versa.

Following is the declaration for java.util.TreeMap.descendingKeySet() method.

public NavigableSet<K> descendingKeySet()

NA

The method call returns a reverse order navigable set view of the keys in this map.

NA

The following example shows the usage of Java TreeMap descendingKeySet() method to get a navigable set of keys ordered in a descending order. We've created a TreeMap object of Integer,Integer pairs. Then few entries are added to map and using descendingKeySet() we've retrieved the navigable set of keys and then printed the same.

package com.tutorialspoint;

import java.util.NavigableSet;
import java.util.TreeMap;

public class TreeMapDemo {
   public static void main(String[] args) {
      
      // creating tree map 
      TreeMap<Integer, Integer> treemap = new TreeMap<>();

      // populating tree map
      treemap.put(2, 2);
      treemap.put(1, 1);
      treemap.put(3, 3);
      treemap.put(6, 6);
      treemap.put(5, 5);

      // putting values in navigable set
      NavigableSet nset = treemap.descendingKeySet();

      System.out.println("Checking value");
      System.out.println("Navigable set values: "+nset);
   }    
}

Let us compile and run the above program, this will produce the following result.

Checking value
Navigable set values: [6, 5, 3, 2, 1]

The following example shows the usage of Java TreeMap descendingKeySet() method to get a navigable set of keys ordered in a descending order. We've created a TreeMap object of Integer,String pairs. Then few entries are added to map and using descendingKeySet() we've retrieved the navigable set of keys and then printed the same.

package com.tutorialspoint;

import java.util.NavigableSet;
import java.util.TreeMap;

public class TreeMapDemo {
   public static void main(String[] args) {
      
      // creating tree map 
      TreeMap<Integer, String> treemap = new TreeMap<>();

      // populating tree map
      treemap.put(2, "two");
      treemap.put(1, "one");
      treemap.put(3, "three");
      treemap.put(6, "six");
      treemap.put(5, "five");

      // putting values in navigable set
      NavigableSet nset = treemap.descendingKeySet();

      System.out.println("Checking value");
      System.out.println("Navigable set values: "+nset);
   }    
}

Let us compile and run the above program, this will produce the following result.

Checking value
Navigable set values: [6, 5, 3, 2, 1]

The following example shows the usage of Java TreeMap descendingKeySet() method to get a navigable set of keys ordered in a descending order. We've created a TreeMap object of Integer,Student pairs. Then few entries are added to map and using descendingKeySet() we've retrieved the navigable set of keys and then printed the same.

package com.tutorialspoint;

import java.util.NavigableSet;
import java.util.TreeMap;

public class TreeMapDemo {
   public static void main(String[] args) {
      
      // creating tree map 
      TreeMap<Integer, Student> treemap = new TreeMap<>();

      // populating tree map
      treemap.put(2, new Student(2, "Robert"));
      treemap.put(1, new Student(1, "Julie"));  
      treemap.put(3, new Student(3, "Adam"));
      treemap.put(6, new Student(6, "Julia"));
      treemap.put(5, new Student(5, "Tom"));

      // putting values in navigable set
      NavigableSet nset = treemap.descendingKeySet();

      System.out.println("Checking value");
      System.out.println("Navigable set values: "+nset);
   }    
}
class Student {
   int rollNo;
   String name;

   Student(int rollNo, String name){
      this.rollNo = rollNo;
      this.name = name;
   }

   @Override
   public String toString() {
      return "[ " + this.rollNo + ", " + this.name + " ]";
   }
   @Override
   public boolean equals(Object obj) {
      if(obj == null) return false;
      Student s = (Student)obj;
      return this.rollNo == s.rollNo && this.name.equalsIgnoreCase(s.name);
   }
}

Let us compile and run the above program, this will produce the following result.

Checking value
Navigable set values: [6, 5, 3, 2, 1]

java_util_treemap.htm

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4