此类在类实例化时构建一个键值对哈希表。
This class builds a hash table of key-value pairs at the class instantiation.
如果内部哈希表中没有URI，将返回空值。
If the URI does not exist in the internal hash table, a null is returned.
在内部，类负责维护所汇聚的全部对象的哈希表。
Internally, the class maintains a hash table of all pooled objects.
每当文档更改时，这个哈希表也会更改。
符号实际上是一种指针，指向储存在哈希表中的字符串。
Symbols are effectively Pointers to strings stored in a hash table.
如果哈希表中没有与键值对应的名称，将返回null。
If name does not correspond to a key in the hashtable, then null will simply be returned.
哈希表在访问没有明显顺序的数据方面难以置信的有用。
Hashes are incredibly useful for accessing data that does not have an obvious ordering.
这两个值将在我们的哈希表中得到对象返回值后被消除。
These two values will be lost after we get the object back from the hashtable.
要为哈希表、数组和标量都提供视图多好呀，为什么不呢？
If different views can be provided for hashes, arrays, and scalars, why stop there?
要写出一个完美的哈希函数是很困难的，特别是要处理哈希表中的冲突。
Perfecting hashing is difficult and to deal with that hashtable implementations support collision resolution.
然后将所有数据作为一个哈希表附加到剧集数组，该数组是一个成员变量。
It then appends all of that data as a hash table to the episodes array, which is a member variable.
这些元组存储在内部哈希表中，该哈希表是由URI 作为键码。
These pairs are stored in the internal hash map, which is keyed by the URI.
KV存储的主要思想是一个哈希表，每个item有一个主键和特定的数据值。
Key-values Stores. The main idea here is using a hash table where there is a unique key and a pointer to a particular item of data.
请注意，variable_map类在许多方面与哈希表非常相似。
Note that the variable_map class resembles a hash table in many respects.
这个修订实际上是文档的MD 5哈希表，由CouchDB自动添加。
This revision is actually the MD5 hash of the document, automatically added by CouchDB.
每个SharedObject实例都有一个数据属性，可以看作存储数据的哈希表。
Each SharedObject instance has a data property that can be thought of as a hashtable for storing data.
作业参数存储在哈希表中，并当作业执行时将其发送到设备类的插件代码中。
Job parameters are stored in a hashtable and are passed to the device class plug-in code when the job is executed. Create a job object for setting job definition attributes as shown below.
它的工作方式是：从预处理源代码和用于编译源代码的编译器选项创建一个哈希表。
It works by creating a hash from the preprocessed sources and the compiler options used to compile the sources.
它们还有一些内嵌的数据结构，像数组、哈希表和对像记录一样的结构的某种支持。
They also have some built-in data structures like arrays, hashes, and some sort of support for record-like structures.
在该方法中，需要扫描其中的一个表，通常扫描较小的那个表，用它在内存中创建一个哈希表。
In this method, one of the tables, usually the smaller one, is scanned and used to create a hash table in memory.
然后这个数组被翻转(所以现在先前的键跟在值的后面)并重新转换为一个哈希表。
This array is then reversed (so that now the former keys follow their values) and transformed back into a hash.
相反地，应该使用内存中的哈希表来缓存数据，并且在会话中保存一个对此数据进行引用的键。
Instead, use an in memory hash table to cache the data and just keep a key to the data in the session.
S3给开发者提供了一个类似基本哈希表的最简化的API，它允许你轻松地存储和提取信息。
For developers, S3 offers a minimalistic API that resembles a basic hashtable - allowing you to easily store and retrieve information.
好的一点是在哈希表中，任何一个存贮点上的元素数据是很小的，三个，四个，五个。
The good news is the elements in any one spot in a hash table are likely to be a small number, three, four, five.
而改变那些值的同时也改变了哈希码，然后会破坏一些哈希表或者恰好储存了对象的字典。
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.
在编写代码时应尽量避免嵌套循环，目前大多数代码都是使用了哈希表、简单链表和单循环。
Your code should (almost) never have multiple nested loops (a loop inside a loop inside a loop). Most of the code written today should use Hashtables, simple lists and singly nested loops.
理论上，哈希表是一个非常简单的构造，就是数组或链表的集合被划分到有限数量的存储体中。
In theory the hash table is a rather simple construct, just collection of arrays or linked lists divided into a finite number of buckets.
然而，尽管基于哈希表的数据交换很简单并且切实可行，但它只适合应用于最简单的互操作场景中。
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.
在构建阶段，数据库服务器读取一个表，并且在应用所有现有筛选器之后，在内存中创建一个哈希表。
In the build phase, the database server reads one table, and, after it applies any existing filters, it creates a hash table in memory.
在构建阶段，数据库服务器读取一个表，并且在应用所有现有筛选器之后，在内存中创建一个哈希表。
In the build phase, the database server reads one table, and, after it applies any existing filters, it creates a hash table in memory.
应用推荐