Hashmap 和 Hashtable 理论上有什么区别? [英] What are the differences between Hashmap vs Hashtable in theory?
问题描述
hashmap 和 hashtable 理论上有区别吗?
我的意思不是在 Java(或实现)中给出的具体定义中,而是在理论上.哈希表不是使用哈希的映射……因此是哈希映射吗?
根据 维基百科,它们是一样的:
<块引用>在计算中,哈希表(hash map)是一种用于实现关联数组(...)的数据结构
根据维基教科书,是一样的:
<块引用>哈希表或哈希映射是一种将键与值相关联的数据结构.
StackOverflow 上的一些回答还指出:><块引用>
Hashtable 通常很有用(它们也称为 hashmap)(...)
Are there are differences between hashmap and hashtable in theory?
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 (...)
According to Wikibooks, it's the same:
A hash table, or a hash map, is a data structure that associates keys with values.
Some answer on StackOverflow also states:
Hashtable is often useful (they are also called hashmaps) (...)
这篇关于Hashmap 和 Hashtable 理论上有什么区别?的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!