Hoogle Search

Within LTS Haskell 22.21 (ghc-9.6.5)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. module Data.IntMap

   An efficient implementation of maps from integer keys to values (dictionaries). This module re-exports the value lazy Data.IntMap.Lazy API, plus several deprecated value strict functions. Please note that these functions have different strictness properties than those in Data.IntMap.Strict: they only evaluate the result of the combining function. For example, the default value to insertWith' is only evaluated if the combining function is called and uses it. These modules are intended to be imported qualified, to avoid name clashes with Prelude functions, e.g.

   import Data.IntMap (IntMap)
   import qualified Data.IntMap as IntMap
   

   The implementation is based on big-endian patricia trees. This data structure performs especially well on binary operations like union and intersection. However, my benchmarks show that it is also (much) faster on insertions and deletions when compared to a generic size-balanced map implementation (see Data.Map).
   • Chris Okasaki and Andy Gill, "Fast Mergeable Integer Maps", Workshop on ML, September 1998, pages 77-86, http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.5452
   • D.R. Morrison, "PATRICIA -- Practical Algorithm To Retrieve Information Coded In Alphanumeric", Journal of the ACM, 15(4), October 1968, pages 514-534.
   Operation comments contain the operation time complexity in the Big-O notation http://en.wikipedia.org/wiki/Big_O_notation. Many operations have a worst-case complexity of <math>. This means that the operation can become linear in the number of elements with a maximum of <math> -- the number of bits in an Int (32 or 64).

2. data IntMap a

   containers	Data.IntMap.Internal

   A map of integers to values a.

3. data IntMap a

   containers	Data.IntMap.Lazy

   A map of integers to values a.

4. data IntMap a

   containers	Data.IntMap.Strict

   A map of integers to values a.

5. data IntMap a

   containers	Data.IntMap.Strict.Internal

   A map of integers to values a.

6. module Data.IntMap

   No documentation available.

7. data () => IntMap a

   rio	RIO.Prelude.Types

   A map of integers to values a.

8. data () => IntMap a

   relude	Relude.Container.Reexport

   A map of integers to values a.

9. data IntMap v

   uniplate	Data.Generics.Uniplate.Data.Instances

   Invariant preserving version of IntMap from the containers packages, suitable for use with Uniplate. Use toIntMap to construct values, and fromIntMap to deconstruct values.

10. data () => IntMap a

    classy-prelude	ClassyPrelude

    A map of integers to values a.

Page 1 of many | Next