Immutable Data Structures
The cluster focuses on debates about the performance, efficiency, and implementation of immutable data structures, including misconceptions about full copying and the use of persistent structures for structural sharing in languages like Haskell and Clojure.
Activity Over Time
Top Contributors
Keywords
Sample Comments
Could you elaborate about the complexity involved in using immutable data structures in your use case? Is that a performance concern?
Fast immutable data structures don't rely on compiler optimizations. They just exist lol.
No reason. OC probably thinks that immutable data structures are always copied when being operated on.
Besides performance, what other cons exists for immutable data structures in a single standalone system?
Immutable does not mean you have to copy the whole structure. You can store only the changes. This is how immutable data structures work in functional languages such as Haskell.
The immutable data structures example was revolting
Performance - immutability comes at a high cost sometimes.
better implement immutable data structures
Persistent data structures can generally overcome a lot of the performance issues with immutability, but generally at the cost of memory.
Does it also work with immutable data-structures?