Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

Exact lookup

1. data ListMap (m :: Type -> Type) a

   ghc	GHC.Data.TrieMap

   No documentation available.

2. type LiteralMap a = Map Literal a

   ghc	GHC.Data.TrieMap

   No documentation available.

3. data MaybeMap (m :: Type -> Type) a

   ghc	GHC.Data.TrieMap

   No documentation available.

4. class Functor m => TrieMap (m :: Type -> Type)

   ghc	GHC.Data.TrieMap

   No documentation available.

5. foldMapTM :: (TrieMap m, Monoid r) => (a -> r) -> m a -> r

   ghc	GHC.Data.TrieMap

   No documentation available.

6. fmapMaybeUB :: (a -> b) -> MaybeUB a -> MaybeUB b

   ghc	GHC.Data.Unboxed

   No documentation available.

7. module GHC.Data.Word64Map

   An efficient implementation of maps from integer keys to values (dictionaries). This module re-exports the value lazy Data.Word64Map.Lazy API, plus several deprecated value strict functions. Please note that these functions have different strictness properties than those in Data.Word64Map.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.Word64Map (Word64Map)
   import qualified Data.Word64Map as Word64Map
   

   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>

8. data Word64Map a

   ghc	GHC.Data.Word64Map.Internal

   A map of integers to values a.

9. contramapFirstWhenMatched :: forall b a (f :: Type -> Type) y z . (b -> a) -> WhenMatched f a y z -> WhenMatched f b y z

   ghc	GHC.Data.Word64Map.Internal

   Map contravariantly over a WhenMatched f _ y z.

10. contramapSecondWhenMatched :: forall b a (f :: Type -> Type) x z . (b -> a) -> WhenMatched f x a z -> WhenMatched f x b z

    ghc	GHC.Data.Word64Map.Internal

    Map contravariantly over a WhenMatched f x _ z.

Page 449 of many | Previous | Next