All of this is vaguely endearing and even consoling-a little like watching a giant computer hash up some simple arithmetic.

所有这一切都让人隐隐地感到喜爱与宽慰就好像一台超级计算机无法搞定一些简单幼稚的数学题一样。

Each instance has to initialize its own cache, but it only caches the references it USES, and is able to access the reference directly rather than having to look it up in a hash map.

每个实例必须初始化其自身的缓存，但它只缓存那些它要使用的引用，并且可以直接访问引用而不是要到一个散列映射中去寻找。

This hash is created for every keyword, so old results don't show up.

这个散列为每一个关键字创建，所以旧的结果不会显示。

Next, you set up global variables for the command to be executed, a buffer for response messages, and a hash that will contain the fields from the trigger message (Listing 4).

下面，您为要执行的命令设置一些全局变量，为响应消息设置一个缓冲区，并设置一个哈希来包含来自触发器消息的字段(见清单4)。

A number of conditions can cause leaks, including ever-expanding hash tables, large resource objects being held indefinitely, and global JNI references not being cleaned up.

导致泄漏的原因很多，包括越来越多的散列表、不确定保存的大型资源对象和未清理的全局JNI引用。

After the first table has been scanned and placed in a hash table, the second table is scanned and each row in the table is looked up in the hash table to see if a join can be made.

在扫描完第一个表并将它放在哈希表中之后，就扫描第二个表，并在哈希表中查找该表中的每一行，看是否可以进行连接。

With a hash index you can find a record in a given file in constant time by generating a hash value for the record and then looking up the record in the file based on that hash value.

借助hash索引，可以通过为记录生成一个hash值，然后根据这个hash值在文件中查找该记录，从而在固定的时间内在给定的文件中找到一条记录。

For now, we will demonstrate by using a hash table that gets initialized into the memory whenever WebSphere Portal Server starts up.

现在，我们将通过使用一个每当WebSphere Portal Server启动时被初始化到内存中的散列表来展示。

Since Git stores content identified by its SHA-1 hash, if any files were changed then this would immediately show up as a different version of a file.

由于Git存储的内容由其SHA - 1哈希识别，任何文件发生改变，这将会马上展现出文件的不同版本。

When you make meatball you must hash (up) meat.

做肉丸子时，你一定要把肉切碎。

Emil: What?! How can you pass up this amazing buffet? I'm starting with some bacon, scrambled eggs, and hash browns.

埃米尔：什么？ ！你怎么能错过这个令人惊叹的自助餐？我要开始吃一些熏肉，炒蛋和土豆煎饼。

Why does a hash table take up more memory than other data-structures?

为什么一个哈希表也需要更多的内存比其他的数据结构？

To speed up the comparison of two configurations, I compute the hash of each case as a long number.

为加快两个配置的比较，我计算每个作为一项长期的号码，哈希。

And. as so often in China when someone comes up with a good idea, many others hash in and price wars break out.

在中国是很常见的，当一些人带着好的想法进入这个行业，而许多人冲了进来然后价格战便爆发了。

Memory data are stored in table set, and data index is set up by hash table.

采用表集的方式存储各类内存数据，通过哈希表建立数据索引。

I am trying to set up hash-based sharing, but it doesn't works.

我试图建立的基于散列的分片，但它不工作。

Try shutting me up, they brought on the Pancake Breakfast ($220) which had 2 large pancakes with eggs, hash brown and 2 sausages.

为了要将我“塞住” ，更大份量的美式煎饼早餐（$220） 被端出来了。