将项目类型定义放入散列表中。
将项目类型关系定义放入散列表中。
从散列表中检索项目类型的定义。
最后一个嵌套散列表如清单5所示。
将属性定义放入散列表中。
它是建立在一种类似于散列表的模型上的。
正在使用的inode还储存在散列表中。
嵌套的散列表如清单4所示。
第二种方法是使用散列表示法。
因此，创建事件散列表的代码如清单6所示。
Thus, the code to create the event hashtable is shown in Listing 6.
创建新的散列表。
构建(并稍后填充)一个散列表来保留最终结果。
Build (and later populate) a hash table to hold the final results.
该函数读取XML，并作为一组散列表返回数据。
This function reads the XML and returns the data back as an array of hash tables.
必须构造一个包含blog帖子信息的散列表。
You have to construct a hashtable to contain the blog post information.
使用这种具有链表的散列表可以提供最快速的查询功能。
The use of the hash table with linked list provides the quickest lookup.
这个链表散列表包含有关共享内存日志标记指针的信息。
The linked list hash table contains information about the shared memory logging token pointers.
比如，消费者可能向服务发送包含多个值的散列表。
For instance, the consumer might send a hash map containing multiple values to the service.
并假设该实现所需要的环境信息已经保存在env散列表中。
It is also assumed that the environment information needed by this implementation has already been stored in an env hash table.
获得第一个子层和第二个子层的定义，并将它们放入散列表中。
Get the first and second child-level definitions, putting them into the hash table.
由于命令行中指定了- g选项，将在全局范围内生成散列表。
Because the -g option is specified from the command line, the hash table is generated in global scope.
使用散列表创建dentry缓存，并且根据对象名分配缓存。
The dentry cache is built using a hash table and is hashed by the name of the object.
该对象只是将对象引用存储为简单键-值对的散列表或类似的集合。
The object is simply a hashtable or similar collection that stores object references as simple key-value pairs.
首先，必须把字段从单个实例变量修改成字段和值组合构成的散列表。
First, you must change the fields from individual instance variables to a hash table of field and value pairs.
构建散列表时，连接键被下推用于过滤事实表的行，性能也显著提高。
When hash tables are built, join keys are pushed down and used to filter the rows of the fact table, and performance improves dramatically.
该数列内的每个元素都是一个散列表，包含事件名称和比赛项目的阵列。
Within each element of the array is a hash table that includes the name of the event and an array of the games played.
它有时候称为关联数组(因为数据与一个键值相关联)，或者作为散列表。
It's sometimes known as an associative array because data is associated with a key value, or as a hash table.
如这个查询计划所示，不止一个散列表的键可以被下推来过滤事实表的行。
As this query plan shows, keys from more than one hash table build can be pushed down to filter rows of the fact table.
因为使用- c选项进行gperf调用，将使用const属性定义散列表。
Because the -c option was used for gperf invocation, the hash table is defined with the const attribute.
应用推荐