I’ve been following the topic RFC: hash table pattern matching.
The Racket Reference (4.15 Hash Tables) mentions performance differences between mutable and immutable versions.
In other languages Hash tables go by other names in other names; dictionary (Python?), associative array(Awk?) , map (Haskell?), and I’m sure others.
Why not name them for the algorithm or performance characteristics?
I’m sure this is a gap in my CS education, so please forgive my ignorance.
Best regards
Stephen