查询词典 hash

If a class denes mutable objects and implements a cmp or eq method, it should not implement hash, since the dictionary implementation requires that a key's hash value is immutable (if the object's hash value changes, it will be in the wrong hash bucket).

如果类定义的是可变对象并且实现了 cmp或 eq方法，它就不应该实现 hash，因为字典实现一个散列表的键值是不可变的(如果对象的散列值改变了，它会放在错误的散列表位置中)。

In general, it is impossible that every key map to a different hash value, for the space of keys can be greater than the number of permissible hash codes: what makes for a good hasher is that the probability of a collision (two different keys with the same hash value) is as close to zero as possible.

通常，它不可能将每一个键值映射到一个不同的散列值，键值的空间可以大於所允许的散列值的数量：一个好的散列器，要求其发生冲突(两个不同的键值对应同一个散列值)的可能性尽量接近於零。

In order to enhance the Hash functionperformance, this article structure one kindbased on the AES HASH function, this HASH function has dispersed arow result the length is 256 bits, may the very good defenseexhaustion attack.

为了提高Hash函数性能，本文构造了一种基于AES的hash函数，该哈希函数散列结果的长度为256比特，可以很好的防御穷举攻击。

A poor choice of hash function may cased high probability of keys mapping to the same hash bucket.

而array在resize的时候，需要将原先的元素复制到一个新的空间中去。

In this paper we firstly discuss the general concepts of compter security and cryptology, and then describe the mostly used modern encryption methods and technologies. We detail the advantages and disadvantages of symmetric algorithm, public-key algorithm and one-way hash function. At last we put forward a new block cipher - permutation code, and describe the secret hash digital signature and online electronic contracting with the trusted third party system.

本文首先讨论计算机安全和密码学的一般概念，然后介绍现代加密手段常用的方法和技术，详细讨论了对称加密方法、公开密钥加密方法和单向散列加密方法的优点和不足，进而提出了一种新型的分组加密算法—排列码加密算法，并在此基础上实现了保密散列数字签名算法和有可信第三方参与的网上电子签约。

The paper proposes a method of use of hash and binary tree to express the internal structure of knowledge and use of hash table and B tree to store the external knowledge for the first time.

首次提出用散列二叉树实现知识的内部表达；用散列表和B树实现知识的外部存贮，这种方法提高了知识的存取效率，实现了知识库的分布存贮和多用户共享。

Secondly, for the same hash function, the sample with the minimum hash value is selected as the global sample and the local samples are combined at the center node to filter out the biased effect of duplicated updates.

然后，对于相同散列函数产生的样本选取具有最小散列值的样本作为全局样本，完成局部样本集在中心节点的合并，滤除在分布节点上的重复更新对样本偏斜的影响。

Based on the C language implementation of the hash table algorithm code, a good understanding of the hash table and its time complexity measure.

详细说明：基于C语言编写的哈希表算法的实现代码，可以很好的理解哈希表及其时间复杂度的度量。

A hash function must always return the same hash code for the same key.

哈希函数必须始终为相同的键返回相同的哈希代码。

If part of an object's value is in another object, the hash code computed for the object's should be partially based on the other object's hash code.

如果一个物体的一部分的价值是在另一个对象，计算散列代码的对象应该是部分基于其他对象的散列代码。

The circulation, consumption and reproduction of the trilogy have not only testified to its historical significance and literariness, but also invested it with new meanings.

该三部曲的流通、消费与再生产不仅验证了其历史意义及文学性，而切还赋予它以新的意义。

If he thought that he could buy me off, he would be wrong.

如果他认为他可以收买我，那他就大错特错了。