理论上HashMap和Hashtable有什么不同? [英] What are the differences between Hashmap vs Hashtable in theory?
问题描述
在理论上,hashmap和hashtable是否存在差异?
Are there are differences between hashmap and hashtable in theory?
我不是指Java(或实现)中给出的具体定义,而是理论上。哈希表是不是哈希表的映射?因此,哈希映射?
I don't mean in the concrete definitions given in Java (or the implementation), but in theory. Isn't a hashtable a map that uses hashing ... hence a hashmap?
推荐答案
根据维基百科,它们是一样的:
According to Wikipedia, they are the same:
在计算中,一个散列表(哈希映射)是一个数据结构,用于实现一个关联数组($)
In computing, a hash table (hash map) is a data structure used to implement an associative array (...)
根据 Wikibooks ,这是一样的:
哈希表或哈希映射是将键与值相关联的数据结构。
A hash table, or a hash map, is a data structure that associates keys with values.
一些答案在 StackOverflow 还指出:
$ b
Some answer on StackOverflow also states:
散列表通常很有用(它们也被称为hashmaps)(...)
Hashtable is often useful (they are also called hashmaps) (...)
这篇关于理论上HashMap和Hashtable有什么不同?的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!