638
edits
User:Jorend/Deterministic hash tables: Difference between revisions
Jump to navigation
Jump to search
User:Jorend/Deterministic hash tables (view source)
Revision as of 22:23, 23 February 2012
, 23 February 2012→Deletion speed
(→Method) |
|||
| Line 119: | Line 119: | ||
[[Image:jorendorff-dht-WorklistTest-speed.png]] | [[Image:jorendorff-dht-WorklistTest-speed.png]] | ||
This test creates a table with 700 entries, then measures the speed of alternately adding an entry and deleting the oldest remaining entry from the table. Entries are therefore removed in FIFO order. Each | This test creates a table with 700 entries, then measures the speed of alternately adding an entry and deleting the oldest remaining entry from the table. Entries are therefore removed in FIFO order. Each “operation” here includes both an insert and a delete. | ||
[[Image:jorendorff-dht-DeleteTest-speed.png]] | [[Image:jorendorff-dht-DeleteTest-speed.png]] | ||
This test measures the speed of deleting all entries from a very large table. | This test measures the speed of deleting all entries from a very large table. | ||
The numbers for dense_hash_map are jagged because <code>DenseMap</code> shrinks the table at certain threshold sizes as entries are deleted, and shrinking the table is expensive. | |||
The apparent randomness of the OpenTable and CloseTable numbers is unexplained. | |||
[[Image:jorendorff-dht-LookupAfterDeleteTest-speed.png]] | [[Image:jorendorff-dht-LookupAfterDeleteTest-speed.png]] | ||
This test measures the performance of lookups, mostly misses, in a table that was filled to size 50000, then reduced to size 195 by deleting most of the entries. | This test measures the performance of lookups, mostly misses, in a table that was filled to size 50000, then reduced to size 195 by deleting most of the entries. | ||