638
edits
Changes
→Background: oops
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 nondeterministic deterministic hash table that is structured like this (pseudocode):
struct Entry {
