Hoogle Search
Within LTS Haskell 24.17 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
bimaps Data.Bijection.Map A Map from keys k to values a. The Semigroup operation for Map is union, which prefers values from the left operand. If m1 maps a key k to a value a1, and m2 maps the same key to a different value a2, then their union m1 <> m2 maps k to a1.
-
bloodhound Database.Bloodhound.Common.Types No documentation available.
Map :: [(Literal, Literal)] -> Literalcodec-beam Codec.Beam No documentation available.
-
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"
-
ctrie Control.Concurrent.Map A map from keys k to values v.
-
Delta types for Map.
-
hashmap Data.HashMap The abstract type of a Map. Its interface is a suitable subset of IntMap.
-
hedn Data.EDN {:a map} -
hedn Data.EDN.AST.Types.Value {:a map} -
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".