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.
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.
module GI.GtkSource.Objects.
Map This is a backwards-compatibility module re-exporting the contents of the GI.GtkSource.Objects.Map module in the gi-gtksource5 package. The link below will take you to the relevant entry in the gi-gtksource5 documentation.
-
refined-containers Data.Map.Refined A wrapper around a regular Map with a type parameter s identifying the set of keys present in the map. A key of type k may not be present in the map, but a Key s k is guaranteed to be present (if the s parameters match). Thus the map is isomorphic to a (total) function Key s k -> a, which motivates many of the instances below. A Map always knows its set of keys, so given Map s k a we can always derive KnownSet s k by pattern matching on the Dict returned by keysSet.
-
refined-containers Data.Map.Strict.Refined A wrapper around a regular Map with a type parameter s identifying the set of keys present in the map. A key of type k may not be present in the map, but a Key s k is guaranteed to be present (if the s parameters match). Thus the map is isomorphic to a (total) function Key s k -> a, which motivates many of the instances below. A Map always knows its set of keys, so given Map s k a we can always derive KnownSet s k by pattern matching on the Dict returned by keysSet.
-
verset Verset 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.