3 ms·
This is wrong. There are no purely functional data structures analogous to hash tables in terms of performance. Hash tables are inherently stateful and cannot b
by innguest 12y ago
This is wrong. There are no purely functional data structures analogous to hash tables in terms of performance. Hash tables are inherently stateful and cannot be implemented without state.
- technomancy 12y agoMost people are OK taking a small performance hit for the simplicity of working with immutable data.