HORIZON HASKELLDocslts/ghc-10.0.x77a86622026-10-31Search packagesCtrl K
Theme: |

GHC 10.0.0.20260917 · lts/ghc-10.0.x · 77a8662 · 2026-10-31

Package0.8Data Structures

containers

Assorted concrete container types

Modules

  • Data.Containers.ListUtilsThis module provides efficient containers-based functions on the list type. In the documentation, n is the number of elements in the list…
  • Data.GraphFinite Graphs The Graph type is an adjacency list representation of a finite, directed
  • Data.IntMapFinite 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.LazyFinite Int Maps (lazy interface) The IntMap v type represents a finite map (sometimes called a dictionary)
  • Data.IntMap.Merge.LazyThis module defines an API for writing functions that merge two
  • Data.IntMap.Merge.StrictThis module defines an API for writing functions that merge two
  • Data.IntMap.StrictFinite Int Maps (strict interface) The IntMap v type represents a finite map (sometimes called a dictionary)
  • Data.IntSetFinite Int Sets The IntSet type represents a set of elements of type Int. An IntSet
  • Data.MapFinite 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.LazyFinite Maps (lazy interface) The Map k v type represents a finite map (sometimes called a dictionary)
  • Data.Map.Merge.LazyThis module defines an API for writing functions that merge two
  • Data.Map.Merge.StrictThis module defines an API for writing functions that merge two
  • Data.Map.StrictFinite Maps (strict interface) The Map k v type represents a finite map (sometimes called a dictionary)
  • Data.SequenceFinite sequences The Seq a type represents a finite sequence of values of
  • Data.SetFinite Sets The Set e type represents a set of elements of type e. Most operations
  • Data.TreeMulti-way Trees and Forests The Tree a type represents a lazy, possibly infinite, multi-way tree
Internal modules · 11
  • Data.IntMap.InternalWARNING 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.Debug
  • Data.IntMap.Strict.InternalWARNING This module is considered internal. The Package Versioning Policy does not apply. The contents of this module may change in any w…
  • Data.IntSet.InternalWARNING 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.IntTreeCommonsWARNING This module is considered internal. The Package Versioning Policy does not apply. The contents of this module may change in any w…
  • Data.Map.InternalWARNING 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.Debug
  • Data.Map.Strict.InternalWARNING This module is considered internal. The Package Versioning Policy does not apply. The contents of this module may change in any w…
  • Data.Sequence.InternalWARNING 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.SortingWARNING This module is considered internal. The Package Versioning Policy does not apply. The contents of this module may change in any w…
  • Data.Set.InternalWARNING 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

Used by in this set · 227