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?
推荐答案
根据维基百科,它们是相同的:
在计算中,哈希表(哈希图)是一种用于实现关联数组(...)的数据结构
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 的一些回答还指出:
Some answer on StackOverflow also states:
哈希表通常很有用(它们也称为哈希图)(...)
Hashtable is often useful (they are also called hashmaps) (...)
这篇关于Hashmap和Hashtable在理论上有什么区别?的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!