Package0.8Data Structures
containers
Assorted concrete container types
- Version0.8
- CategoryData Structures
- LicenceBSD-3-Clause
- Maintainerlibraries@haskell.org
- Homepagegithub.com/haskell/containers
- Pinned bywith GHC
- Sourcehackage.haskell.org/package/containers-0.8
Modules
27 modules- Data.Containers.ListUtils4This module provides efficient containers-based functions on the list type. In the documentation, n is the number of elements in the list…
- Data.Graph31Finite Graphs The Graph type is an adjacency list representation of a finite, directed
- Data.IntMap0Finite Int Maps (lazy interface) This module re-exports the value lazy Data.IntMap.Lazy API. The IntMap v type represents a finite map (s…
- Data.IntMap.Lazy115Finite Int Maps (lazy interface) The IntMap v type represents a finite map (sometimes called a dictionary)
- Data.IntMap.Merge.Lazy25This module defines an API for writing functions that merge two
- Data.IntMap.Merge.Strict22This module defines an API for writing functions that merge two
- Data.IntMap.Strict115Finite Int Maps (strict interface) The IntMap v type represents a finite map (sometimes called a dictionary)
- Data.IntSet62Finite Int Sets The IntSet type represents a set of elements of type Int. An IntSet
- Data.Map0Finite Maps (lazy interface) This module re-exports the value lazy Data.Map.Lazy API. The Map k v type represents a finite map (sometimes…
- Data.Map.Lazy129Finite Maps (lazy interface) The Map k v type represents a finite map (sometimes called a dictionary)
- Data.Map.Merge.Lazy25This module defines an API for writing functions that merge two
- Data.Map.Merge.Strict23This module defines an API for writing functions that merge two
- Data.Map.Strict129Finite Maps (strict interface) The Map k v type represents a finite map (sometimes called a dictionary)
- Data.Sequence82Finite sequences The Seq a type represents a finite sequence of values of
- Data.Set72Finite Sets The Set e type represents a set of elements of type e. Most operations
- Data.Tree18Multi-way Trees and Forests The Tree a type represents a lazy, possibly infinite, multi-way tree
Internal modules · 11
- Data.IntMap.Internal151WARNING This module is considered internal. The Package Versioning Policy does not apply. The contents of this module may change in any w…
- Data.IntMap.Internal.Debug2
- Data.IntMap.Strict.Internal115WARNING This module is considered internal. The Package Versioning Policy does not apply. The contents of this module may change in any w…
- Data.IntSet.Internal66WARNING This module is considered internal. The Package Versioning Policy does not apply. The contents of this module may change in any w…
- Data.IntSet.Internal.IntTreeCommons11WARNING This module is considered internal. The Package Versioning Policy does not apply. The contents of this module may change in any w…
- Data.Map.Internal181WARNING This module is considered internal. The Package Versioning Policy does not apply. The contents of this module may change in any w…
- Data.Map.Internal.Debug13
- Data.Map.Strict.Internal153WARNING This module is considered internal. The Package Versioning Policy does not apply. The contents of this module may change in any w…
- Data.Sequence.Internal87WARNING This module is considered internal. The Package Versioning Policy does not apply. The contents of this module may change in any w…
- Data.Sequence.Internal.Sorting28WARNING This module is considered internal. The Package Versioning Policy does not apply. The contents of this module may change in any w…
- Data.Set.Internal77WARNING This module is considered internal. The Package Versioning Policy does not apply. The contents of this module may change in any w…
Description
This package contains efficient general-purpose implementations of various immutable container types including sets, maps, sequences, trees, and graphs.
For a walkthrough of what this package provides with examples of common operations see the containers introduction.
The declared cost of each operation is either worst-case or amortized, but remains valid even if structures are shared.
Depends on
4 packages- array-0.5.8.0with GHC
- base-4.23.0.0with GHC
- deepseq-1.5.2.0with GHC
- template-haskell-2.25.0.0with GHC
Used by in this set · 21
- Cabal-3.18.1.0
- Cabal-syntax-3.18.1.0
- binary-0.8.9.3
- cabal-install-3.18.1.0
- cabal-install-solver-3.18.1.0
- edit-distance-0.2.2.1
- ghc-10.0.0.20260917
- ghc-boot-10.0.0.20260917
- ghc-heap-10.0.0.20260917
- ghci-10.0.0.20260917
- hackage-security-0.6.4.0
- haddock-api-2.34.0
- haddock-library-1.11.0
- hashable-1.5.1.0
- haskeline-0.8.5.0
- hpc-0.7.0.2
- regex-base-0.94.0.3
- regex-posix-0.96.0.2
- resolv-0.2.0.3
- semaphore-compat-2.0.1
- xhtml-3000.4.1.0