范围有限的散列 scoped hash
带有密钥的散列函数 Keyed Hash
散列后的消息验证代码 Hashed Messsage Authentication Code
基于分区的散列算法 Hash Partition Algorithm
专用的散列函数 Dedicated hash-functions
用于散列链的快速删除 struct page pprev_hash
一致的散列 consistent hashing
获取散列包含的所有值 HVALS
获取散列包含的所有键 HKEYS
可以将这个新散列的引用写回 $data。
信息以绑定oid与对应值的信息散列的形式返回。
The information is returned in the form of a hash of information, tied between the OID and the corresponding value.
选项散列的“ to ”元素将映射到服务的地址位置。
The "to" element of the option hash is mapped to the address location of the service.
Because if you did what I suggested with the list, the time to look up the key would be linear in the length of the list. You'd have to look at each element until you found the key.
字典是用一种很神奇的,叫做散列法的算法,来实现的,后面我们将,会学到一点关于。
Dictionaries are implemented using a magic technique called hashing, which we'll look at a little bit later in the term, which allows us to retrieve keys in constant time.
散列法的内容,此方法可以让我们在线性,时间内检索到键,因此字典的大小并不重要了。
应用推荐