containers: Assorted concrete container types
This 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.
| Versions | 0.1.0.0, 0.1.0.1, 0.2.0.0, 0.2.0.1, 0.3.0.0, 0.4.0.0, 0.4.1.0, 0.4.2.0, 0.4.2.1, 0.5.0.0, 0.5.1.0, 0.5.2.0, 0.5.2.1, 0.5.3.0, 0.5.3.1, 0.5.4.0, 0.5.5.0, 0.5.5.1, 0.5.6.0, 0.5.6.1, 0.5.6.2, 0.5.6.3, 0.5.7.0, 0.5.7.1, 0.5.8.1, 0.5.8.2, 0.5.9.1, 0.5.9.2, 0.5.10.1, 0.5.10.2, 0.5.11.0 (info) |
|---|---|
| Change log | changelog.md |
| Dependencies | array, base (>=4.3 && <5), deepseq (>=1.2 && <1.5), ghc-prim [details] |
| License | BSD-3-Clause |
| Author | |
| Maintainer | libraries@haskell.org |
| Category | Data Structures |
| Bug tracker | https://github.com/haskell/containers/issues |
| Source repo | head: git clone http://github.com/haskell/containers.git |
| Uploaded | by dfeuer at Mon Feb 6 23:37:40 UTC 2017 |
| Distributions | Arch:0.5.10.2, LTSHaskell:0.5.10.2, NixOS:0.5.11.0, Stackage:0.5.11.0 |
| Downloads | 61116 total (287 in the last 30 days) |
| Rating | 2.75 (votes: 8) [estimated by rule of succession] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2017-02-06 [all 1 reports] Hackage Matrix CI |
Modules
[Index]
- Data
- Data.Graph
- Data.IntMap
- Data.IntMap.Base
- Data.IntMap.Lazy
- Data.IntMap.Strict
- Data.IntSet
- Data.IntSet.Base
- Data.Map
- Data.Map.Base
- Data.Map.Lazy
- Data.Map.Strict
- Data.Map.Strict.Internal
- Data.Map.Strict.Merge
- Data.Sequence
- Data.Sequence.Base
- Data.Set
- Data.Set.Base
- Data.Tree
- Utils
- Data.Utils.BitQueue
- Data.Utils.BitUtil
- Data.Utils.PtrEquality
- Data.Utils.StrictFold
- Data.Utils.StrictMaybe
- Data.Utils.StrictPair
Downloads
- containers-0.5.8.2.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)