Java Development Tutorials
In my previous post we have learnt How to Sort HashMap in Java by Keys, in this article we will learn to sort HashMap values. We will be using the below three approaches.
The values() method of java.util.HashMap class returns a Collection view of the values contained in this map. The collection is backed by the map, so changes to the map are reflected in the collection, and vice-versa.
The size() method of java.util.HashMap class will returns the number of key-value mappings in this map.
The remove(Object o) method will remove the mapping for the specified key from this map if present.
The put(K key, V value) method of java.util.HashMap class associates the specified value with the specified key in this map. If the map previously contained a mapping for the key, the old value is replaced whereas putAll(Map<? extends K,? extends V> m) method copies all of the mappings from the specified map to this map. These mappings will replace any mappings that this map had for any of the keys currently in the specified map.
[Read more…]
The put(K key, V value) method of java.util.HashMap class associates the specified value with the specified key in this map. If the map previously contained a mapping for the key, the old value is replaced.
[Read more…]
The keySet() method of java.util.HashMap class returns a Set view of the keys contained in this map. The set is backed by the map, so changes to the map are reflected in the set, and vice-versa.
[Read more…]
The isEmpty() method of java.util.HashMap class will tests if the HashMap has any elements or not. [Read more…]
The get(Object key) method of java.util.HashMap class returns the value to which the specified key is mapped, or null if this map contains no mapping for the key.
[Read more…]
The entrySet() method of java.util.HashMap class returns a Set view of the mappings contained in this map. The set is backed by the map, so changes to the map are reflected in the set, and vice-versa.
[Read more…]
