Description
Provides abstractions and concrete implementations for mutable containers in Haskell. Mutable containers are useful when code needs in-place updates for performance or algorithmic reasons.
It is useful for graph algorithms, caches, buffers, indexes, simulations, and performance-sensitive data structures. It is a developer library and should be used where mutation is intentional.