Hoogle Search

Within LTS Haskell 24.3 (ghc-9.10.2)

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

Exact lookup

1. module Control.Concurrent.Map

   A non-blocking concurrent map from hashable keys to values. The implementation is based on lock-free concurrent hash tries (aka Ctries) as described by:

   • Aleksander Prokopec, Phil Bagwell, Martin Odersky, "Cache-Aware Lock-Free Concurent Hash Tries"
   • Aleksander Prokopec, Nathan G. Bronson, Phil Bagwell, Martin Odersky "Concurrent Tries with Efficient Non-Blocking Snapshots"
   Operations have a worst-case complexity of O(log n), with a base equal to the size of the native Word.

2. data Map k v

   ctrie	Control.Concurrent.Map

   A map from keys k to values v.

3. module Data.Delta.Map

   Delta types for Map.

4. data Map k v

   hashmap	Data.HashMap

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

5. Map :: EDNMap -> Value

   hedn	Data.EDN

   {:a map}
   

6. Map :: EDNMap -> Value

   hedn	Data.EDN.AST.Types.Value

   {:a map}
   

7. 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".

8. Map :: Schema -> Schema

   language-avro	Language.Avro.Types

   No documentation available.

9. module Control.Monad.Trans.Memo.Map

   Specialization of MemoStateT with Map as a container

10. module Opaleye.Internal.Map

    No documentation available.

Page 9 of many | Previous | Next