您要查找的是不是：
- hash table search 散列表搜索
- When a new record was added to the hash table. 当将新记录添加到哈希表时。
- Directory size is the size of the hash table. 目录大小为哈希表的大小。
- Method to allow a type to work correctly in a hash table. 方法,使类型可以在哈希表中正确地工作。
- Some research is based on Distributed Hash Table (DHT) networks. 其中，有些研究是奠基在DHT网路之上。
- The collection is a hash table that represents the bindings on a control. 该集合是表示控件上的绑定的哈希表。
- Calling methods on a hash table at this stage is therefore not advisable. 因此,不建议在此阶段对哈希表调用方法。
- This value can be used as a key in hash tables. 此值可用做哈希表中的键。
- Messages are extracted into a working file to be translated and compiled into a hash table. 信息被提取到工作文件中进行翻译，并被编译成一张哈希表。
- This method uses a pre-computed hash table to serve as an index for short sequences. 这一方法利用一个预先计算的哈西表作为短序列的索引。
- It is an impediment to scalability, because only one thread can access the hash table at a time. 首先,这种方法对于可伸缩性是一种障碍,因为一次只能有一个线程可以访问hash表。
- NHashSize The size of the hash table for interface pointer maps. Should be a prime number. 用于指针映射接口的哈希表的大小,必须是一个素数。
- The article describes the use of TCAM device in routing table search and its algorithm of manage and pays much attention to the implementing of TCAM device in FPGA. 本文详细介绍了TCAM器件在高速路由查找中的应用及其管理算法,同时重点给出了TCAM器件的FPGA实现。
- For any joins, use the first (top) input to build the hash table and the second (bottom) input to probe the hash table. 对于联接,使用第一个(顶端)输入生成哈希表,使用第二个(底端)输入探测哈希表。
- This behavior does not apply to collections where elements are conceptually grouped into buckets, such as a hash table. 此行为不适用于元素按概念分组到存储桶中的集合(如哈希表)。
- For the Bound Trees cache, the hash table size can be up to 1009 on 32-bit systems and up to 4001 on 64-bit systems. 对于绑定树缓存而言,在32位系统上哈希表大小可达1009,在64位系统上哈希表大小可达4001。
- For the Extended Stored Procedures cache the hash table size can be up to 127 on 32-bit and 64-bit systems. 对于扩展存储过程缓存而言,在32位和64位系统上,哈希表大小可达127。
- Maximum number of cached entries in a hash bucket for this hash table since the server was started. 自服务器启动以来,哈希存储桶中用于该哈希表的最大已缓存条目数。
- By using the array reference notation ([ ]), you can address the elements of an array or hash table variable. 通过使用数组引用表示法([]),可以寻址数组或哈希表变量的元素。
- CORE NOTE: What are hash tables and how do they relate to dictionaries? 核心笔记：什么是哈希表？它们与字典的关系是什么？
