Java集合框架学习(十一) Hashtable详解

Hashtable介绍


1. 继承自Dictionary;

2. 线程安全;

3. 支持Iterator和Enumeration;

4. key和value都不可为null;

5. 一般用于多线程环境中。


类定义

public class Hashtable<K,V>
extends Dictionary<K,V>
implements Map<K,V>, Cloneable, Serializable


例子介绍


package com.dylan.collection;

import java.util.Enumeration;
import java.util.Hashtable;

/**
 * @author xusucheng
 * @create 2018-02-03
 **/
public class HashtableExample {
    public static void main(String[] args) {

        Enumeration names;
        String key;

        // Creating a Hashtable
        Hashtable<String, String> hashtable =
                new Hashtable<String, String>();

        // Adding Key and Value pairs to Hashtable
        hashtable.put("Key1","Chaitanya");
        hashtable.put("Key2","Ajeet");
        hashtable.put("Key3","Peter");
        hashtable.put("Key4","Ricky");
        hashtable.put("Key5","Mona");

        names = hashtable.keys();
        while(names.hasMoreElements()) {
            key = (String) names.nextElement();
            System.out.println("Key: " +key+ " & Value: " +
                    hashtable.get(key));
        }
    }
}




使用Iterator迭代HashTable


package com.dylan.collection;

import java.util.Hashtable;
import java.util.Iterator;
import java.util.Set;

/**
 * @author xusucheng
 * @create 2018-02-03
 **/
public class IterateHashtable {
    public static void main(String[] args) {

        String str;

        // Creating a Hashtable instance
        Hashtable<String, String> hashtable = new Hashtable<String, String>();

    /* Adding key-value pairs to Hashtable
     * public V put(K key, V value): Maps the specified key to the
     * specified value in this hashtable. Neither the key nor the
     * value can be null. The value can be retrieved by calling the
     * get method with a key that is equal to the original key.
     */
        hashtable.put("A", "Apple");
        hashtable.put("B", "Orange");
        hashtable.put("C", "Mango");
        hashtable.put("D", "Banana");
        hashtable.put("E", "Grapes");

        System.out.println("Hashtable contains:");

    /* public Set<K> keySet(): Returns a Set view of the keys
     * contained in this map. The set is backed by the map,
     * so changes to the map are reflected in the set, and
     * vice-versa.
     */
        Set<String> keys = hashtable.keySet();

        //Obtaining iterator over set entries
        Iterator<String> itr = keys.iterator();

        //Displaying Key and value pairs
        while (itr.hasNext()) {
            // Getting Key
            str = itr.next();

       /* public V get(Object key): Returns the value to which
        * the specified key is mapped, or null if this map
        * contains no mapping for the key.
        */
            System.out.println("Key: "+str+" & Value: "+hashtable.get(str));
        }
    }
}






  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 1
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值