Storing Primitive Types in a Collection : HashMap « Collections Data Structure « Java






Storing Primitive Types in a Collection

      

import java.util.HashMap;
import java.util.Map;

public class Main {
  public static void main(String[] argv) throws Exception {
    Map map = new HashMap();

    // Create int wrapper object
    Integer refInt = new Integer(123);

    // Store int in map
    map.put("key", refInt);

    // Get int value from map
    refInt = (Integer) map.get("key");

    // Get the integer value from wrapper object
    int i = refInt.intValue();
  }
}

   
    
    
    
    
    
  








Related examples in the same category

1.Iterate through the values of Java HashMap example
2.Get Synchronized Map from Java HashMap example
3.Check if a particular key exists in Java HashMap example
4.Check if a particular value exists in Java HashMap example
5.Get Set view of Keys from Java HashMap example
6.Get Size of Java HashMap
7.Remove all values from Java HashMap example
8.Remove value from Java HashMap
9.Create Java Hashtable from HashMap
10.Sort an HashMap based on the keys
11.For keys of a map
12.For values of a map
13.For both the keys and values of a map
14.Creating a Copy of a Collection: the objects are not cloned.
15.Use Iterator to loop through the map key set
16.Generic hashmap with String as key and Integer as valueGeneric hashmap with String as key and Integer as value
17.Get key set and value set from map and use Iterator to loop through them
18.Clones a map
19.Hash map for counting references to Object keys.
20.Extended Version of java.util.HashMap that provides an extended get method accpeting a default value.
21.Compact HashMap
22.This class wraps a HashMap and provides methods by which key objects can be associated with "counting" values.
23.This extension of HashMap support duplicate keys
24.Concurrent Hopscotch HashMap