Hash Maps

] > Hash Maps

[next][prev][up][toc]

11.4.2 Hash Maps

java.util.HashMap


	HashMap<K,V>()

V	put(K key, V value)

V	get(Object key)

V	remove(Object key)

boolean	containsKey(Object key)

Integer value;
HashMap <Integer,Integer> map;
map = new HashMap <Integer,Integer> ();
for(int k = 0; k < 100; k++ ){
   int i = (int) (10 ∗  Math.random());
   Integer key = new Integer(i);
   if( map.containsKey( key ) ){
     value = map.get( key );
     i = 1 + value.intValue();
     value = new Integer(i);
   }
   else
   {
      value = new Integer(0);
   }
   map.put( key, value );
}
System.out.println( map );

{2=11, 4=8, 8=14, 9=10, 6=6, 1=5, 3=9, 7=7, 5=13, 0=7}