Scribd
Upload
15 views3 pages

1 Jan 2025

The Map interface stores elements as unique key-value pairs, where duplicate keys are not allowed but duplicate values are. Key-value pairs are referred to as entries, and various methods are provided for manipulating these pairs, such as size, isEmpty, containsKey, and put. HashMap and LinkedHashMap are two implementations of the Map interface, with HashMap not maintaining insertion order while LinkedHashMap does, and both have specific characteristics regarding capacity and synchronization.

Uploaded by

kanti chandrakar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
15 views3 pages

1 Jan 2025

The Map interface stores elements as unique key-value pairs, where duplicate keys are not allowed but duplicate values are. Key-value pairs are referred to as entries, and various methods are provided for manipulating these pairs, such as size, isEmpty, containsKey, and put. HashMap and LinkedHashMap are two implementations of the Map interface, with HashMap not maintaining insertion order while LinkedHashMap does, and both have specific characteristics regarding capacity and synchronization.

Uploaded by

kanti chandrakar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Understanding Map Interface

 In Map elements are stored in the form of Key-Value pairs.

 Keys are unique in Map interface, duplicate keys are not allowed but
duplicate values are allowed.
 Each key can map to at most one value.

 Each key-value pair is called "one entry“.

 Duplicates will be replaced but they are not rejected.

 Map interface is not child interface of Collection interface.

 Some map implementations have restrictions on the keys and values


they may contain.
Map Interface Methods
Method Description
int size(); Returns the number of key-value mappings in this map

boolean isEmpty(); Returns true if this map contains no key-value mappings

boolean containsKey Returns true if this map contains a mapping for the
(Object key); specified key.
boolean containsValue Returns true if this map maps one or more keys to the
(Object value); specified value
V get(Object key) Returns the value to which the specified key is mapped

V put(K key, V value) Associates the specified value with the specified key in
this map
V remove(Object key) Removes the mapping for a key from this map if it is
present
Set<K> keySet() Returns a Set view of the keys contained in this map
HashMap:
 HashMap is available since jdk1.2V.

 It is available in java.util package.

 It allows duplicate values with unique keys & insertion order is not
maintained. (Duplicate keys are replaced)
 Default capacity is 16 & load factor is 0.75.

 HashMap is not synchronized by default.

HashMap m=new HashMap();


HashMap m=new HashMap(int initialcapacity);
LinkedHashMap:
 The only difference between HashMap & LinkedHashMap is HashMap
doesn't maintain the insertion order where as LinkedHashMap maintains it.
 LinkedHashMap is available since jdk 1.4

You might also like