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

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

Java TreeMap headMap() Method

TheJava TreeMap headMap(K toKey) method is used to return a view of the portion of this map whose keys are strictly less than toKey.

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

public SortedMap<K,V> headMap(K toKey)

toKey − This is the high endpoint (exclusive) of the keys in the returned map.

The method call returns a view of the portion of this map whose keys are strictly less than toKey.

• ClassCastException − This exception is thrown if toKey is not compatible with this map's comparator (or, if the map has no comparator, if toKey does not implement Comparable). Implementations may, but are not required to, throw this exception if toKey cannot be compared to keys currently in the map.

• NullPointerException − This exception is thrown if toKey is null and this map uses natural ordering, or its comparator does not permit null keys.

• IllegalArgumentException − This exception is thrown if this map itself has a restricted range, and toKey lies outside the bounds of the range.

TheheadMap(K toKey,boolean inclusive) method is used to return a view of the portion of this map whose keys are less than (or equal to, if inclusive is true)toKey.

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

public NavigableMap<K,V> headMap(K toKey,boolean inclusive)

• toKey − This is the high endpoint of the keys in the returned map.

• inclusive − This is true if the high endpoint is to be included in the returned view.

The method call returns a view of the portion of this map whose keys are less than (or equal to, if inclusive is true) toKey.

• ClassCastException − This exception is thrown if toKey is not compatible with this map's comparator.

• NullPointerException − This exception is thrown if toKey is null and this map uses natural ordering, or its comparator does not permit null keys.

• IllegalArgumentException − This exception is thrown if this map itself has a restricted range, and toKey lies outside the bounds of the range.

The following example shows the usage of Java TreeMap headMap(K key) method to get a view of the portion of this map whose keys are strictly less than given key. We've created a TreeMap and SortedMap objects of Integer,Integer pairs. Then few entries are added to the treemap object, and using headMap() we're getting a view for the given key and printed it.

package com.tutorialspoint;

import java.util.SortedMap;
import java.util.TreeMap;

public class TreeMapDemo {
   public static void main(String[] args) {

      // creating maps 
      TreeMap<Integer, Integer> treemap = new TreeMap<>();
      SortedMap<Integer, Integer> treemaphead = 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);

      // getting head map
      treemaphead = treemap.headMap(3);

      System.out.println("Checking values of the sorted map");
      System.out.println("Value is: "+ treemaphead);
   }    
}

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

Checking values of the sorted map
Value is: {1=1, 2=2}

The following example shows the usage of Java TreeMap headMap(K key) method to get a view of the portion of this map whose keys are strictly less than given key. We've created a TreeMap and SortedMap objects of Integer,String pairs. Then few entries are added to the treemap object, and using headMap() we're getting a view for the given key and printed it.

package com.tutorialspoint;

import java.util.SortedMap;
import java.util.TreeMap;

public class TreeMapDemo {
   public static void main(String[] args) {

      // creating maps 
      TreeMap<Integer, String> treemap = new TreeMap<>();
      SortedMap<Integer, String> treemaphead = 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");

      // getting head map
      treemaphead = treemap.headMap(3);

      System.out.println("Checking values of the sorted map");
      System.out.println("Value is: "+ treemaphead);
   }    
}

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

Checking values of the sorted map
Value is: {1=one, 2=two}

The following example shows the usage of Java TreeMap headMap(K key, boolean inclusive) method to get a view of the portion of this map whose keys are strictly less than given key while including the high end point. We've created a TreeMap and SortedMap objects of Integer,Student pairs. Then few entries are added to the treemap object, and using headMap() we're getting a view for the given key and printed it.

package com.tutorialspoint;

import java.util.NavigableMap;
import java.util.TreeMap;

public class TreeMapDemo {
   public static void main(String[] args) {

      // creating maps 
      TreeMap<Integer, String> treemap = new TreeMap<>();
      NavigableMap<Integer, String> treemapheadincl = 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");

      // getting head map inclusive 3
      treemapheadincl = treemap.headMap(3,true);

      System.out.println("Checking values of the map");
      System.out.println("Value is: "+ treemapheadincl);
   }    
}

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

Checking values of the map
Value is: {1=one, 2=two, 3=three}

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