User Tools

Site Tools


Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
hash_table [2014/07/26 23:40]
will
hash_table [2015/02/02 08:28] (current)
Line 10: Line 10:
 In separate chaining (also called //open hashing// or //closed addressing//​) each bucket has its own list of entries. A good hash table only has very few items in each bucket, and so data structures like a [[linked list]] are popular. In separate chaining (also called //open hashing// or //closed addressing//​) each bucket has its own list of entries. A good hash table only has very few items in each bucket, and so data structures like a [[linked list]] are popular.
  
-This example is hash set, not a true hash table, as it only stores ​the key and not a corresponding value. However all the main logic is the same, a hash table stores a (key, value) pair instead of just a key, but all the hashing and equality checks are still performed on the key.+This example is hash set, as it only stores ​key. However all the main logic is the same, a hash table stores a (key, value) pair instead of just a key, but all the hashing and equality checks are still performed on the key.
  
-This example uses the [[Fowler Noll Vo hash function]] for strings.+This example uses the [[Fowler Noll Vo hash function]] for hashing ​strings, and the raw data for numbers.
  
 [algorithm hash set-open hashing] [algorithm hash set-open hashing]
hash_table.1406443230.txt.gz ยท Last modified: 2015/02/02 08:24 (external edit)