hash table

基本解釋

The use of the hash table with linked list provides the quickest lookup.
使用這種具有鏈表的散列表可以提供最快速的查詢功能。
It then appends all of that data as a hash table to the episodes array, which is a member variable.
然後將所有數(shù)據(jù)作爲(wèi)一個哈希表附加到劇集數(shù)組，該數(shù)組是一個成員變量。
In this method, one of the tables, usually the smaller one, is scanned and used to create a hash table in memory.
在該方法中，需要掃描其中的一個表，通常掃描較小的那個表，用它在內(nèi)存中創(chuàng)建一個哈希表。

The good news is the elements in any one spot in a hash table are likely to be a small number, three, four, five.
好的一點是在哈希表中,任何一個存貯點上的元素數(shù)據(jù)是很小的,三個，四個，五個。
麻省理工公開課 - 計算機科學(xué)及編程導(dǎo)論課程節(jié)選
So let's look at the second example, all right, I keep doing that -- this piece of code from here to here gives me a way of now creating a hash table of size 256.
所以讓我們來看一下第二個例子，好的，我繼續(xù)做那件事,這段代碼中從這裡到這裡,是創(chuàng)建一個大小爲(wèi)256的哈希表。
麻省理工公開課 - 計算機科學(xué)及編程導(dǎo)論課程節(jié)選

Many entrepreneurs think that the best startup teams bring vastly different viewpoints to the table and hash things out on the fly.
FORBES: Build Your Startup Team Like The Wu-Tang Clan
It makes it nearly impossible for people who have legitimate but bridgeable differences to sit down at the same table and hash things out.
WHITEHOUSE: President Obama at Michigan Commencement

哈希表
Location of data is a heart problem in P2P field. Among many techniques of data location, distributed hash table (DHT) is most advantageous.
數(shù)據(jù)定位是對等系統(tǒng)的核心問題，在諸多對等系統(tǒng)數(shù)據(jù)定位方法中，應(yīng)用分佈式哈希表接口進行數(shù)據(jù)定位的方法優(yōu)點突出。
散列表
襍湊表