Post #3722211
2026-07-10 17:39 UTC
@zwarich@hachyderm.io @joe@f.duriansoftware.com You could use a nonsensical built-in bitwise ordering as the basis for something Opinionated™️ like saying that the default associative collection implementation is a balanced binary tree that uses this ordering, because you personally believe hash tables are too nondeterministic or something
Replies (1)
-
@zwarich@hachyderm.io 2026-07-10 17:41
@slava@mathstodon.xyz @joe@f.duriansoftware.com There is actually a whole field of history-independent data structures, including a history-independent linearly probed hash table. Whenever data structures people invent things like this I assume they have bad characteristics in practice, though.