Java HashMap
In Java, HashMap is a class that implements the Map interface and provides a key-value based data structure. It is part of the java.util package and allows null values and null keys. It does not guarantee the order of the keys and values.
Here are some of the most commonly used methods in the HashMap class:
void clear(): This method removes all the key-value mappings from theHashMap.boolean containsKey(Object key): This method returnstrueif theHashMapcontains a mapping for the specified key, otherwisefalse.boolean containsValue(Object value): This method returnstrueif theHashMapcontains one or more mappings to the specified value, otherwisefalse.Set<Map.Entry<K, V>> entrySet(): This method returns aSetview of the key-value mappings in theHashMap.V get(Object key): This method returns the value to which the specified key is mapped, ornullif the key is not mapped to any value.boolean isEmpty(): This method returnstrueif theHashMapcontains no key-value mappings, otherwisefalse.Set<K> keySet(): This method returns aSetview of the keys in theHashMap.V put(K key, V value): This method associates the specified value with the specified key in theHashMap. If theHashMappreviously contained a mapping for the key, the old value is replaced with the new value and the old value is returned.void putAll(Map<? extends K, ? extends V> m): This method copies all of the mappings from the specifiedMapto thisHashMap.V remove(Object key): This method removes the mapping for the specified key from theHashMap, if it is present.int size(): This method returns the number of key-value mappings in theHashMap.Collection<V> values(): This method returns aCollectionview of the values in theHashMap.
These methods provide the basic functionality to manipulate a HashMap. The choice of which method to use depends on the specific requirements of the application.
