解读Hashtable

作者:admin 日期:2007-08-15

字体大小: 小中大

提供一个  键------>值   键------>值    键------>值    键------>值
当有100个时，对应关系

例:
import java.util.Enumeration;
import java.util.Hashtable;

public class TestHashtable {
    public static void main(String[] args){
        Hashtable ht = new Hashtable();
        ht.put("sichuan","chengdu"); //改变以下四行代码的顺序，可能会改变输出内容的顺序
        ht.put("hunan","changsha");
        ht.put("beijing","beijing");
        ht.put("anhui","hefei");

    Enumeration e = ht.keys();
    while(e.hasMoreElements()) {
        Object key = e.nextElement();
        Object value = ht.get(key);
        System.out.println(key + " " + value + " " + key.hashCode() + " " + value.hashCode());
    }

    }
}

运行结果:
hunan changsha 99640558 1432430903
anhui hefei 92962223 99156333
sichuan chengdu 2084411463 742637738
beijing beijing -227176258 -227176258