In this method, one of the tables, usually the smaller one, is scanned and used to create a hash table in memory.
在该方法中，需要扫描其中的一个表，通常扫描较小的那个表，用它在内存中创建一个哈希表。
The use of the hash table with linked list provides the quickest lookup.
使用这种具有链表的散列表可以提供最快速的查询功能。
It then appends all of that data as a hash table to the episodes array, which is a member variable.
然后将所有数据作为一个哈希表附加到剧集数组，该数组是一个成员变量。
Instead, use an in memory hash table to cache the data and just keep a key to the data in the session.
相反地，应该使用内存中的哈希表来缓存数据，并且在会话中保存一个对此数据进行引用的键。
So to construct a nonblocking linked list, tree, or hash table, we need to find a way to update multiple Pointers with CAS without leaving the data structure in an inconsistent state.
所以，要构建一个非阻塞的链表、树或哈希表，需要找到一种方式，可以用CAS更新多个指针，同时不会让数据结构处于不一致的状态。
In the build phase, the database server reads one table, and, after it applies any existing filters, it creates a hash table in memory.
在构建阶段，数据库服务器读取一个表，并且在应用所有现有筛选器之后，在内存中创建一个哈希表。
Internally, the class maintains a hash table of all pooled objects.
在内部，类负责维护所汇聚的全部对象的哈希表。
Changing these values would change the hash code, which would in turn break any hash table or dictionary that the object happened to be stored in.
而改变那些值的同时也改变了哈希码，然后会破坏一些哈希表或者恰好储存了对象的字典。
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.
在满足筛选器条件的每个行中，数据库服务器将对键应用哈希函数，并探测哈希表以查找匹配的键值。
The good news is the elements in any one spot in a hash table are likely to be a small number, three, four, five.
好的一点是在哈希表中，任何一个存贮点上的元素数据是很小的，三个，四个，五个。
Symbols are effectively Pointers to strings stored in a hash table.
符号实际上是一种指针，指向储存在哈希表中的字符串。
So let's look at the second example, all right, I keep doing that — this piece of code from here to here gives me a way of now creating a hash table of size 256.
所以让我们来看一下第二个例子，好的，我继续做那件事，这段代码中从这里到这里，是创建一个大小为256的哈希表。
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.
在扫描完第一个表并将它放在哈希表中之后，就扫描第二个表，并在哈希表中查找该表中的每一行，看是否可以进行连接。
If the URI does not exist in the internal hash table, a null is returned.
如果内部哈希表中没有URI，将返回空值。
The dynamic hash join consists of two activities: building the hash (or build phase as we call it), and probing the hash table (or probe phase).
动态哈希连接包含两个动作：构建哈希（或者是我们所称的构建阶段），以及探测哈希表（或探测阶段）。
The getCreateConnection() method uses a static hash table to determine if either an existing connection can be returned, or needs to be created.
getCreateConnection()方法使用静态哈希表来确定是否可以返回现有连接，或需要进行创建。
Reduction in false lock contentions for row and table locks in the lock manager's hash table
减少锁管理器的hash表中对行和表锁的虚假锁竞争。
In theory the hash table is a rather simple construct, just collection of arrays or linked lists divided into a finite number of buckets.
理论上，哈希表是一个非常简单的构造，就是数组或链表的集合被划分到有限数量的存储体中。
Each transition is a method invocation followed by a hash table.
每个转换都是在散列表之后的一个方法调用。
The curly braces () indicate a hash table, which is a set of name and value pairs.
大括号()则表明这是一个散列表，该散列表由一组名称和值对组成。
For each logging token read from the Shared memory or configuration file on its first invocation, OPEN_LOG builds a hash key using the name of the token and the size of the hash table.
对于每个从共享内存或初次调用使用的配置文件中读取的日志标记，OPEN_LOG都会使用标记名和散列表的大小来生成一个散列值。
However, while exchanging a hash table is easy and supported out of the box, it is only appropriate to use in the most simple of interoperability scenarios.
然而，尽管基于哈希表的数据交换很简单并且切实可行，但它只适合应用于最简单的互操作场景中。
The linked list hash table contains information about the shared memory logging token pointers.
这个链表散列表包含有关共享内存日志标记指针的信息。
In this case, the size of the hash table is substantial, needing more than 100 bytes of memory just to store one word (either 4 or 8 bytes)!
在这种情况下，散列表的尺寸就变得很重要了，为了存储一个字(4或8个字节)，就需要使用100个字节的内存。
Get the first and second child-level definitions, putting them into the hash table.
获得第一个子层和第二个子层的定义，并将它们放入散列表中。
Put attributes definitions into the hash table.
将属性定义放入散列表中。
First, you must change the fields from individual instance variables to a hash table of field and value pairs.
首先，必须把字段从单个实例变量修改成字段和值组合构成的散列表。
Our implementation is to match against a hash table of user ID with the Theme value.
我们的实现是要将用户标识的散列表与主题值匹配。
The first DB2.OPEN_LOG call builds a linked list hash table as shown in Figure 1 from the logging tokens kept in the Shared memory.
第一个DB 2 . OPEN_LOG调用的功能是从共享内存中保存的日志标记来构建一个如图1所示的链表散列表。
It generates a hash table from the predetermined list of valid command-line options and a lookup function whose time complexity is o (1).
它将从预定的有效命令行选项列表和时间复杂度为O(1)的查找函数中生成一个散列表。
应用推荐