638
edits
Line 112: | Line 112: | ||
[[Image:jorendorff-dht-LookupHitTest-speed.png]] | [[Image:jorendorff-dht-LookupHitTest-speed.png]] | ||
This test measures the speed of <code>table.get(k)</code> operations, where ''k'' is the key of an existing entry in the table. | |||
[[Image:jorendorff-dht-LookupMissTest-speed.png]] | [[Image:jorendorff-dht-LookupMissTest-speed.png]] | ||
This test measures the speed of <code>table.get(k)</code> operations, where the key ''k'' is not found in the table. | |||
In an OpenTable, lookups that miss are slower than lookups that hit ''when there is at least one collision''. This is because we keep probing the hash table until we find an empty entry. | In an OpenTable, lookups that miss are slower than lookups that hit ''when there is at least one collision''. This is because we keep probing the hash table until we find an empty entry. |
edits