您要查找的是不是：
- 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. 因此,不建議在此階段對哈希表調用方法。
- The hash table algorithm takes your key, performs an operation on it, called a hash function, and based on the result of the calculation, chooses where in the data structure to store your value. 哈希表的演算法是獲取鍵，對鍵執行一個叫做哈希函數的操作，並根據計算的結果，選擇數據結構中某處來存儲你的值。
- This value can be used as a key in hash tables. 此值可用做哈希表中的鍵。
- A checkpoint is carried out at the beginning of the ALTER TABLE operation. ALTER TABLE操作開始時執行檢查點。
- 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. 這一方法利用一個預先計算的哈西表作為短序列的索引。
- Individual deletions of rows are not entered into the transaction log, so the TRUNCATE TABLE operation is not replicated. 各行刪除操作不記入事務日誌,因此不複製TRUNCATE TABLE操作。
- 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. 用於指針映射介面的哈希表的大小,必須是一個素數。
- For any joins, use the first (top) input to build the hash table and the second (bottom) input to probe the hash table. 對於聯接,使用第一個(頂端)輸入生成哈希表,使用第二個(底端)輸入探測哈希表。
- The techni calscheme of solution mining in anaphase project is applied to solutiom mining fors table operation and increasing rate of rock salt resource. 以長山採區為例，剖析溶腔中的水流狀態，高低鹹水的貯存狀態。制定出生產技術方案並進行了成功的運用。為穩定採區的高咸高產和提高岩鹽資源利用率開闢出一條新路。
- 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? 核心筆記：什麼是哈希表？它們與字典的關係是什麼？
