HashMap

   I.HashMap

   The function of HashMap in Java is similar to the map in C++ and the dictionary in Python.

    Characteristic:

1.The key word can't be repeated,and the computer'll set the value with the latest key word input.

2.Data in HashMap is an unordered list.

  3.It was created by sequence.

4.It's not thread-safe.

Code:

public class pro_35 {

	public static void main(String[] args) {
		HashMap map = new HashMap();
		map.put(3, "北京");
		map.put(2, "上海");
		map.put(1, "广州");
		map.put(null, "武汉");
		map.put(null, null);    //键值允许是null
		Set keys = map.keySet();
		Iterator it = keys.iterator();
		while(it.hasNext())
		{
			Object obj = it.next();
			System.out.println(obj+"="+map.get(obj));
		}
	}		
}

    Output:

null=null
1=广州
2=上海
3=北京

   II.LinkedHashMap

Characteristic:

1.It was created by linked list,so its structure is discrete.

2.Data in LinkedHashMap are stored in insertion order.

3.It's not thread-safe.

Code:

import java.util.*;
public class pro_35 {

	public static void main(String[] args) {
		HashMap map = new HashMap();
		map.put(2, "上海");
		map.put(1, "广州");
		map.put(3, "北京");
		map.put(null, "武汉");
		map.put(null, null);
		Set keys = map.keySet();
		Iterator it = keys.iterator();
		//
		while(it.hasNext())
		{
			Object obj = it.next();
			System.out.println(obj+"="+map.get(obj));
		}
	}		
}

   III.HashTable

Characteristic:

1.Both Key word and its value can't be null.

2.Data in HashTable is an unordered list.

3.It's thread-safe.

Code:

package pro_916;
import java.util.*;
public class HashTable {

	public static void main(String[] args) {
		Hashtable map = new Hashtable();
		map.put(1, "北京");
		map.put("1", "上海");
		map.put(5, "广州");
		map.put(3, "西安");
		//map.put(null, "武汉");
		//map.put(null, null);
		Set keys = map.keySet();
		Iterator it = keys.iterator();
		//
		while(it.hasNext())
		{
			Object obj = it.next();
			System.out.println(obj+"="+map.get(obj));
		}
	}

}

    IV.TreeMap

Characteristic:

1. It was created based on the Red-Black tree.

2.Both Key-word can't be null and the type of key-word must be same.
3. Data in TreeMap aresorted in an ascending sequence by the value of ascii

Code:

<span style="font-size:24px;">import java.util.*;
public class HashTable {

	public static void main(String[] args) {
		TreeMap map = new TreeMap();
		map.put(1, "北京");
	//	map.put("1", "上海");
		map.put(5, "广州");
		map.put(3, "西安");
	//	map.put(null, "武汉");
		map.put(6, null);
	//	map.put(null, null);
		Set keys = map.keySet();
		Iterator it = keys.iterator();
		//
		while(it.hasNext())
		{
			Object obj = it.next();
			System.out.println(obj+"="+map.get(obj));
		}
	}

}</span>

Output:

  1=北京
3=西安
5=广州
6=null