不能在首次写入该流后更改哈希键。
不能在先写入该流后更改哈希键。
Hash key cannot be changed after the first write to the stream.
编译器用完了符号表的哈希键。
此规则还有一个特例，print(及其衍生物)和syswrite不会触发污染错误或子方法、子引用或哈希键。
The exceptions to this rule are that print (and derivatives) and syswrite do not trigger a tainting error or sub-methods, sub-references, or hash keys.
相反地，应该使用内存中的哈希表来缓存数据，并且在会话中保存一个对此数据进行引用的键。
Instead, use an in memory hash table to cache the data and just keep a key to the data in the session.
在满足筛选器条件的每个行中，数据库服务器将对键应用哈希函数，并探测哈希表以查找匹配的键值。
For each row that satisfies the filter condition, the database server applies hash function to the key and proves the hash table to find a match.
由于这个命令需要以一个数组作为参数，所以将原来的哈希表拆解为一个数组，拆解的方式是，在数组中，每个值跟在它的键的后面。
Since this command expects an array, the original hash is unwound into an array in such a way that the values follow their respective keys in the array.
这种安置是由一个内部的哈希函数决定的，该函数接受定义为分区键的列内的值并返回数据库分区号。
The placement is determined by an internal hashing function that takes the values in the column or columns defined as a partitioning key and returns the database partition number.
稍后您将把这些名称用作% trigmsg哈希的键。
数据库服务器不会在特定的哈希bucket中对键进行分类。
The database server does not sort keys in a particular hash bucket.
jdk以hashmap的形式为我们提供了方便的Map实现，它在内部使用哈希表实现了对键的对应值的快速查找。
And the JDK gives us a great Map implementation in the form of the HashMap, which USES hashtables internally to support fast key lookups for corresponding values.
这个哈希码可以用作HashMap或者其他相关目的的键。
This hash code could be used as a key into a HashMap or for any other related purpose.
然后这个数组被翻转(所以现在先前的键跟在值的后面)并重新转换为一个哈希表。
This array is then reversed (so that now the former keys follow their values) and transformed back into a hash.
我之前说过，字典是用哈希表(散列表)来实现的，这就意味着所有键都必须是散列的。
I mentioned earlier that a dictionary is implemented using a hashtable and that means that the keys have to be hashtable.
哈希函数必须始终为相同的键返回相同的哈希代码。
A hash function must always return the same hash code for the same key.
哈希函数：哈希表使用的一种函数，能计算出一个键的位置。
A function used by a hashtable to compute the location for a key.
最小的表首先被扫描，然后哈希表被填入相匹配的每个键的行指针。
The smallest table is scanned first, and the hash table is populated with Pointers to the rows that match each key.
哈希函数是基于键返回数值哈希代码的算法。
A hash function is an algorithm that returns a numeric hash code based on a key.
我将哈希(？)用户的位置与该键后，客户端，然后使用相同的密钥服务器恢复数据。
I would then hash (?) the users location with that key client side, post that, and then use the same key server side to restore the data.
哈希表自身的结构被拷贝，但是键和值不拷贝。
All the structure of the hashtable itself is copied, but the keys and values are not cloned.
它通常被称为数据结构服务器，因为键可以包含字符串，哈希，链表，集合和有序集合。
It is often referred to as a data structure server since keys can contain strings, hashes, lists, sets and sorted sets.
它通常被称为数据结构服务器，因为键可以包含字符串，哈希，链表，集合和有序集合。
It is often referred to as a data structure server since keys can contain strings, hashes, lists, sets and sorted sets.
应用推荐