The session id is a 32 byte long MD5 hash value.
sessionid就是个一32位的md5hash值。
This method computes a hash value for each object.
该方法计算每个对象的hash值。
Just requiring a special SHA-1 hash value is not enough.
只有一个特定的SHA - 1散列值是不够的。
The hash value identifies the respective hash bucket.
hash值标识相应的hashbucket。
Hash value is calculated on the basis of the RDN of the entry.
散列值是根据条目的RDN计算出来的。
The hash value is the Base64 encoding of the SHA-1 checksum.
散列值是SHA - 1的Base64校验编码。
Searching for a hash value with range predicates is straight-forward.
使用范围谓词搜索hash值很简单。
This hash value is then mapped to a bucket for storage or for getting a value of the row.
然后这个hash值被映射到一个桶中存储，或者获得一个行值。
Next, it computes hash value for the interface uuid and checks if uuid has a valid format.
接下来，它计算接口uuid 的散列值，检查 uuid 的格式是否有效。
RDN Hash-based splitting: The directory server entry is used to calculate a unique hash value.
基于rdn散列的分割：使用目录服务器条目计算一个惟一的散列值。
Using the hash function, each row is put in a bucket with other rows that have the same hash value.
通过哈希函数，将具有相同哈希值的行放在一个bucket中。
The String class specifies a similar algorithm to be used for computing the hash value of a String.
String类规定类似的算法用于计算 String 的散列值。
When you store a value, the client determines the hash value from the key and the server used to store it.
当存储一个值时，客户机会从这个键确定出散列值以及它原来存储在哪个服务器上。
The generated hash value is numeric, and I use this value as single index key for the string being indexed.
生成的hash值是数值型的，我使用这个值作为被索引的字符串的索引键。
A keyword's hash value is typically computed by combining the associated values of its keysig with its length.
关键字散列值通常这样计算：将关键字的keysig关联值和关键字长度结合。
To retrieve an item from a subtree, you compute a hash value from the column you chose when creating the index.
从子树中检索一个项目，当您创建索引时，可以从所选的列中计算出一个hash值。
In traditional de-duplication, objects are hashed, and the hash value is used as the initial check for similarity.
在传统的去耦合中，对象被散列化，然后使用散列值进行初始相似性检查。
The Rainbow tables technique pre-computes the hash value, saving time at the expense of creating very large tables.
Rainbow表方法是预先算出hash值，通过创建很大的表格而节省时间。
Now for this same binary, the hash value stored in TSD is extracted and matched with the run-time calculated hash value.
现在对于这同一个二进制，将提取TSD中存储的散列值并与运行时计算的散列值进行匹配。
Message digests are secure one-way hash functions that take arbitrary-sized data and output a fixed-length binary hash value.
消息摘要是安全的单向哈希函数，它可以接受任意大小的输入数据，并输出固定长度的二进制哈希值。
You can explicitly search for a known hash value with point ranges, in other words ranges with identical start and stop keys.
可以使用点范围(即开始键和终止键相同)显式地搜索一个已知的hash值。
When the directories are distributed, this hash value maps to a specific entry in a specific directory server in the back end.
在分布目录时，这个散列值映射到特定后端目录服务器中的特定条目。
This is required, because the hash value is the address of the object and you need to maintain this if you move the object.
这是必需的，因为散列值是对象的地址，并且如果您移动该对象，则需要维护它。
When you get a value, the client determines the same hash value from the key and chooses the same server to get the information.
当获取一个值时，客户机会从这个键确定出相同的散列值并会选择相同的服务器来获取信息。
All hash-based collections assume that an object's hash value does not change while it is in use as a key in the collection.
所有基于散列的集合假设，当对象的散列值用于作为集合中的关键字时它不会改变。
When asked to validate a password, the Membership service hashes the presented password, then compares the hash value with its copy.
当验证密码时，会员服务将当前密码散列，并与它的拷贝值进行比较。
The sender creates a message digest (also called hash value, fingerprint/thumbprint, or watermark) based on the contents of the message.
发送方根据消息的内容创建消息摘要（也称为哈希码、指纹或者水印）。
The resulting perfect hash() function returns an unsigned int value in the range 0..(k-1), where k is the maximum keyword hash value +1.
产生的完美hash()函数返回一个无符号的int值，范围为 0..(k-1)，其中k 值为最大关键字散列值加 1。
The resulting perfect hash() function returns an unsigned int value in the range 0..(k-1), where k is the maximum keyword hash value +1.
产生的完美hash()函数返回一个无符号的int值，范围为 0..(k-1)，其中k 值为最大关键字散列值加 1。
应用推荐