HashMap, LinkedHashMap, TreeMap, AbstractMap Implementation(example) in Java

An object that maps keys to values. A map cannot contain duplicate keys; each key can map to at most one value. This interface takes the place of the Dictionary class, which was a totally abstract class rather than an interface. The Map interface provides three collection views, which allow a map's contents to be viewed as a set of keys, collection of values, or set of key-value mappings. The order of a map is defined as the order in which the iterators on the map's collection views return their elements. Some map implementations, like the TreeMap class, make specific guarantees as to their order; others, like the HashMap class, do not. Note: great care must be exercised if mutable objects are used as map keys. The behavior of a map is not specified if the value of an object is changed in a manner that affects equals comparisons while the object is a key in the map. A special case of this prohibition is that it is not permissible for a map to contain itself as a key. While it is permissible for a map to contain itself as a value, extreme caution is advised: the equals and hashCode methods are no longer well defined on a such a map. All general-purpose map implementation classes should provide two "standard" constructors: a void (no arguments) constructor which creates an empty map, and a constructor with a single argument of type Map, which creates a new map with the same key-value mappings as its argument. In effect, the latter constructor allows the user to copy any map, producing an equivalent map of the desired class. There is no way to enforce this recommendation (as interfaces cannot contain constructors) but all of the general-purpose map implementations in the SDK comply. The "destructive" methods contained in this interface, that is, the methods that modify the map on which they operate, are specified to throw UnsupportedOperationException if this map does not support the operation. If this is the case, these methods may, but are not required to, throw an UnsupportedOperationException if the invocation would have no effect on the map. For example, invoking the putAll(Map) method on an unmodifiable map may, but is not required to, throw the exception if the map whose mappings are to be "superimposed" is empty. Some map implementations have restrictions on the keys and values they may contain. For example, some implementations prohibit null keys and values, and some have restrictions on the types of their keys. Attempting to insert an ineligible key or value throws an unchecked exception, typically NullPointerException or ClassCastException. Attempting to query the presence of an ineligible key or value may throw an exception, or it may simply return false; some implementations will exhibit the former behavior and some will exhibit the latter. More generally, attempting an operation on an ineligible key or value whose completion would not result in the insertion of an ineligible element into the map may throw an exception or it may succeed, at the option of the implementation. Such exceptions are marked as "optional" in the specification for this interface.

/*
Maps Demo
Author: Sundar
Date: 11/27/2011
*/
import java.util.Map;
import java.util.AbstractMap;
import java.util.HashMap;
import java.util.TreeMap;
import java.util.LinkedHashMap;
import java.util.Iterator;

class MapDemo {

 public static void main(String args[]) {
  
  // Abstract Map Implements Map Interface and Super Class for all Map Implementations
  
  AbstractMap  hashMap= new HashMap ();
  
  hashMap.put("Jhon", 50);               // Usage : put(Name, Age), name: Key, Age: Value
  hashMap.put("Jeff", 20);
  hashMap.put("kate", 10);
  hashMap.put("Paul", 40);
  hashMap.put("King", 30);
  hashMap.put("Jack", null);               // Notice that Hashmap accepts null values
  
  System.out.println("Hash Map Elements: " + hashMap );  
  
  System.out.println("Hash Map Keys: " + hashMap.keySet() );
  
  System.out.println("Hash Map Values: " + hashMap.values() );

  // Creating Tree Map from Hash Map and Tree Map returns the Elements in a Sorted Way
  
  AbstractMap treeMap = new TreeMap(hashMap);           
  
  System.out.println("Tree Map Elements: " + treeMap );
  
  Map lhMap = new LinkedHashMap(treeMap);
  
  System.out.println("Changing the Value of Jack: " + lhMap.put("Jack", 50) );  // Notice how powerful the put() method is.
   
  System.out.println("Linked Hash Map Elements: " + lhMap );
  

 }                      // Main Ends Here

}                      // Class Ends Here