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 21:54, 24 February 2012
, 24 February 2012→Background: oops
(→Background: oops) |
|||
| Line 19: | Line 19: | ||
Can a data structure retain the performance of traditional, arbitrary-order hash tables while also storing the order in which entries were added, so that iteration order is deterministic? | Can a data structure retain the performance of traditional, arbitrary-order hash tables while also storing the order in which entries were added, so that iteration order is deterministic? | ||
Tyler Close has developed a | Tyler Close has developed a deterministic hash table that is structured like this (pseudocode): | ||
struct Entry { | struct Entry { | ||