The containers package contains efficient general-purpose implementations of various basic immutable container types. The declared cost of each operation is either worst-case or amortized, but remains valid even if structures are shared.
Changes since 0.5.8.1 (2016-08-31)
The headline change is adding
Data.IntMap. The versions for
Data.Map were introduced in 0.5.8.1, so this change restores parity between the interfaces. With this in place we hope this version will make it into GHC 8.2.
Other changes include:
- Add instances for
- Add lifted instances (from
Data.Tree. (Thanks to Oleg Grenrus for doing a lot of this work.)
- Properly deprecate functions in
Data.IntMaplong documented as deprecated.
- Rename several internal modules for clarity. Thanks to esoeylemez for starting this process.
Data.Map.fromDistinctDescListmore eager, improving performance.
- Plug space leaks in
Data.Map.Lazy.fromDescListby manually inlining constant functions.
Data.Mapas total alternatives to
Data.Mapas a total alternative to
- Avoid using
deleteFindMaxinternally, preferring total functions instead. New implementations of said functions lead to slight performance improvements overall.