Hoogle Search

Within LTS Haskell 24.45 (ghc-9.10.3)

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

Exact lookup

1. Map :: ManagedPtr Map -> Map

   gi-gtksource5	GI.GtkSource.Objects.Map

   No documentation available.

2. data Map k v

   hashmap	Data.HashMap

   The abstract type of a Map. Its interface is a suitable subset of IntMap.

3. Map :: EDNMap -> Value

   hedn	Data.EDN

   {:a map}
   

4. Map :: EDNMap -> Value

   hedn	Data.EDN.AST.Types.Value

   {:a map}
   

5. data Map ph k v

   justified-containers	Data.Map.Justified

   A Data.Map Map wrapper that allows direct lookup of keys that are known to exist in the map. Here, "direct lookup" means that once a key has been proven to exist in the map, it can be used to extract a value directly from the map, rather than requiring a Maybe layer. Map allows you to shift the burden of proof that a key exists in a map from "prove at every lookup" to "prove once per key".

6. Map :: Schema -> Schema

   language-avro	Language.Avro.Types

   No documentation available.

7. module Control.Monad.Trans.Memo.Map

   Specialization of MemoStateT with Map as a container

8. module Opaleye.Internal.Map

   No documentation available.

9. type family Map f x

   opaleye	Opaleye.Internal.Map

   No documentation available.

10. module Data.RangeSet.Map

    A slightly less trivial implementation of range sets. This is nearly identical to Data.RangeSet.List except for some important performance differences:

    • Most query functions in this module are O(log n) rather than O(n), so may be much faster.
    • Most composition functions have the same time complexity but a higher constant, so may be somewhat slower.
    If you're mainly calling member, you should consider using this module, but if you're calling union, deleteRange, and other range manipulation functions as often as querying, you might stick with the list implementation. This module is intended to be imported qualified, to avoid name clashes with Prelude functions, e.g.

    import Data.RangeSet.Map (RSet)
    import qualified Data.RangeSet.Map as RSet
    

    The implementation of RSet is based on Data.Map.Strict.

Page 45 of many | Previous | Next