-
通過Enumeration和Iterator遍歷Hashtable的效率分析
今天需要遍歷壹個Hashtable,查看了壹下Hashtable類,發現它提供了如下幾個方法可供我們遍歷: keys() – returns an Enumeration of the keys of this Hashtable keySet() – returns a Set of the keys entrySet() – returns a Set of the mappings elements() – returns an Enumeration of the values of this Hashtable 4種方法,那種更好呢,寫段代碼來比較壹下吧: import java.util.Enumeration; import java.util.Hashtable; import java.util.Iterator; import java.util.Map.Entry; public class traveseHashTable { public static void…