HORIZON HASKELLDocslts/ghc-9.10.xc74966e2026-09-27Search names, modules, packages, or :: a typeCtrl K

GHC 9.10.3 · lts/ghc-9.10.x · c74966e · 2026-09-27

Package0.7Data Structures

containers

Assorted concrete container types

Modules

29 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.Graph30Finite Graphs The Graph type is an adjacency list representation of a finite, directed
  • Data.IntMap4An efficient implementation of maps from integer keys to values
  • 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.IntSet56Finite Int Sets The IntSet type represents a set of elements of type Int. For a walkthrough of the most commonly used functions see their
  • Data.Map5Note: You should use Data.Map.Strict instead of this module if: You will eventually need all the values stored. The stored values don't …
  • 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.Set69Finite Sets The Set e type represents a set of elements of type e. Most operations
  • Data.Tree13Multi-way Trees and Forests The Tree a type represents a lazy, possibly infinite, multi-way tree
Internal modules · 13

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 · 310