Scribd
Upload
42 views

Java Prgrms

The HashMap class implements the Map interface using a hash table, allowing get and put operations to run in constant time regardless of the map's size. It defines several constructors to initialize the capacity and fill ratio. HashMap does not guarantee element ordering. The example code maps names to account balances, demonstrates getting a set view of entries and iterating to display them, and updates a value by putting a new one with the existing key.

Uploaded by

rakesh456_123
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
42 views

Java Prgrms

The HashMap class implements the Map interface using a hash table, allowing get and put operations to run in constant time regardless of the map's size. It defines several constructors to initialize the capacity and fill ratio. HashMap does not guarantee element ordering. The example code maps names to account balances, demonstrates getting a set view of entries and iterating to display them, and updates a value by putting a new one with the existing key.

Uploaded by

rakesh456_123
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

The 

HashMap class uses a hash table to implement the Map interface. This allows the execution time of
basic operations, such as get() and put(), to remain constant even for large sets. 
The following constructors are defined:
HashMap( ) 
HashMap(Map m) 
HashMap(int capacity) 
HashMap(int capacity, float fillRatio)
The first form constructs a default hash map. The second form initializes the hash map by using the
elements of m. The third form initializes the capacity of the hash map to capacity. The fourth form
initializes both the capacity and fill ratio of the hash map by using its arguments. The meaning of
capacity and fill ratio is the same as for HashSet, described earlier.
HashMap implements Map and extends AbstractMap. It does not add any methods of its own. You
should note that a hash map does not guarantee the order of its elements. Therefore, the order in
which elements are added to a hash map is not necessarily the order in which they are read by an
iterator.
The following program illustrates HashMap. It maps names to account balances. Notice how a set-
view is obtained and used.
import java.util.*; 
class HashMapDemo { 
public static void main(String args[]) { 
// Create a hash map 
HashMap hm = new HashMap(); 
// Put elements to the map 
hm.put("John Doe", new Double(3434.34)); 
hm.put("Tom Smith", new Double(123.22)); 
hm.put("Jane Baker", new Double(1378.00)); 
hm.put("Todd Hall", new Double(99.22)); 
hm.put("Ralph Smith", new Double(-19.08)); 
// Get a set of the entries 
Set set = hm.entrySet(); 
// Get an iterator 
Iterator i = set.iterator(); 
// Display elements 
while(i.hasNext()) { 
Map.Entry me = (Map.Entry)i.next(); 
System.out.print(me.getKey() + ": "); 
System.out.println(me.getValue()); 
} 
System.out.println(); 
// Deposit 1000 into John Doe's account 
double balance = ((Double)hm.get("John Doe")).doubleValue(); 
hm.put("John Doe", new Double(balance + 1000)); 
System.out.println("John Doe's new balance: " + 
hm.get("John Doe")); 
} 
}
Output from this program is shown here:

Ralph Smith: -19.08 


Tom Smith: 123.22 
John Doe: 3434.34 
Todd Hall: 99.22 
Jane Baker: 1378.0 
John Doe's current balance: 4434.34
The program begins by creating a hash map and then adds the mapping of names to balances.
Next, the contents of the map are displayed by using a set-view, obtained by calling entrySet(). The
keys and values are displayed by calling the getKey() and getValue() methods that are defined
by Map.Entry. Pay close attention to how the deposit is made into John Doe's account.
The put() method automatically replaces any preexisting value that is associated with the specified
key with the new value. Thus, after John Doe's account is updated, the hash map will still contain
just one "John Doe" account.

You might also like