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.
module Control.Concurrent.STM.
Map A contention-free STM hash map. "Contention-free" means that the map will never cause spurious conflicts. A transaction operating on the map will only ever have to retry if another transaction is operating on the same key at the same time.
-
ttrie Control.Concurrent.STM.Map A map from keys k to values v.
module Data.TypeMap.Internal.
Map No documentation available.
-
No documentation available.
module Yaya.Containers.Pattern.
Map No documentation available.
-
No documentation available.
-
algebra Numeric.Map linear maps from elements of a free module to another free module over r
f $# x + y = (f $# x) + (f $# y) f $# (r .* x) = r .* (f $# x)
Map r b a represents a linear mapping from a free module with basis a over r to a free module with basis b over r. Note well the reversed direction of the arrow, due to the contravariance of change of basis! This way enables we can employ arbitrary pure functions as linear maps by lifting them using arr, or build them by using the monad instance for Map r b. As a consequence Map is an instance of, well, almost everything. Map :: ((a -> r) -> b -> r) -> Map r b aalgebra Numeric.Map No documentation available.
-
classy-prelude-yesod ClassyPrelude.Yesod 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.
-
No documentation available.