您要查找的是不是:
- hash table entry 散列表项
- When a new record was added to the hash table. 当将新记录添加到哈希表时。
- Directory size is the size of the hash table. 目录大小为哈希表的大小。
- Stores an attribute table entry. 存储属性表的项。
- Method to allow a type to work correctly in a hash table. 方法,使类型可以在哈希表中正确地工作。
- Some research is based on Distributed Hash Table (DHT) networks. 其中,有些研究是奠基在DHT网路之上。
- Or is NULL, if the edge table entry does not need a value. 如果边缘表项不需要值则为NULL。
- This value can be used as a key in hash tables. 此值可用做哈希表中的键。
- 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. 因此,不建议在此阶段对哈希表调用方法。
- 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表。
- As mentioned above, the symbol table entry for index 0 (STN_UNDEF) is reserved; it holds the following. 如上所述,符号表的0索引(STN_UNDEF)是保留的,它包含了如下内容:
- NHashSize The size of the hash table for interface pointer maps. Should be a prime number. 用于指针映射接口的哈希表的大小,必须是一个素数。
- The IRQ signal is delivered to the local APICs listed in the corresponding Redirection Table entry. IRQ信号发送给对应重定向表条目中所列的局部APIC。
- 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。
- CORE NOTE: What are hash tables and how do they relate to dictionaries? 核心笔记:什么是哈希表?它们与字典的关系是什么?