containers-0.6.8: containers.cabal

name: containers
version: 0.6.8
license: BSD3
license-file: LICENSE
maintainer: libraries@haskell.org
bug-reports: https://github.com/haskell/containers/issues
synopsis: Assorted concrete container types
category: Data Structures
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](https://haskell-containers.readthedocs.io).
    .
    The declared cost of each operation is either worst-case or amortized, but
    remains valid even if structures are shared.

build-type: Simple
cabal-version:  >=1.10
extra-source-files:
    include/containers.h
    changelog.md
    mkappend.hs

tested-with:
  GHC ==8.2.2 || ==8.4.4 || ==8.6.5 || ==8.8.4 || ==8.10.7 || ==9.0.2 || ==9.2.8 ||
      ==9.4.5 || ==9.6.2 || ==9.8.1

source-repository head
    type:     git
    location: http://github.com/haskell/containers.git

Library
    default-language: Haskell2010
    build-depends: base >= 4.10 && < 5, array >= 0.4.0.0, deepseq >= 1.2 && < 1.6, template-haskell
    hs-source-dirs: src
    ghc-options: -O2 -Wall -fwarn-incomplete-uni-patterns -fwarn-incomplete-record-updates

    other-extensions: CPP, BangPatterns

    exposed-modules:
        Data.Containers.ListUtils
        Data.IntMap
        Data.IntMap.Lazy
        Data.IntMap.Strict
        Data.IntMap.Strict.Internal
        Data.IntMap.Internal
        Data.IntMap.Internal.Debug
        Data.IntMap.Merge.Lazy
        Data.IntMap.Merge.Strict
        Data.IntSet.Internal
        Data.IntSet
        Data.Map
        Data.Map.Lazy
        Data.Map.Merge.Lazy
        Data.Map.Strict.Internal
        Data.Map.Strict
        Data.Map.Merge.Strict
        Data.Map.Internal
        Data.Map.Internal.Debug
        Data.Set.Internal
        Data.Set
        Data.Graph
        Data.Sequence
        Data.Sequence.Internal
        Data.Sequence.Internal.Sorting
        Data.Tree
        Utils.Containers.Internal.BitUtil
        Utils.Containers.Internal.BitQueue
        Utils.Containers.Internal.StrictPair

    other-modules:
        Utils.Containers.Internal.Prelude
        Utils.Containers.Internal.State
        Utils.Containers.Internal.StrictMaybe
        Utils.Containers.Internal.PtrEquality
        Utils.Containers.Internal.Coercions
    if impl(ghc)
      other-modules:
        Utils.Containers.Internal.TypeError
        Data.Map.Internal.DeprecatedShowTree
        Data.IntMap.Internal.DeprecatedDebug

    include-dirs: include