Hoogle Search
Within LTS Haskell 24.35 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
map :: Ord b => (a -> b) -> MinQueue a -> MinQueue bpqueue Data.PQueue.Min Creates a new priority queue containing the images of the elements of this queue. Equivalent to fromList . map f . toList.
map :: (a -> b) -> MaxPQueue k a -> MaxPQueue k bpqueue Data.PQueue.Prio.Max Map a function over all values in the queue.
map :: (a -> b) -> MinPQueue k a -> MinPQueue k bpqueue Data.PQueue.Prio.Min Map a function over all values in the queue.
-
sample-frame Sound.Frame.Stereo No documentation available.
-
yaya Yaya.Zoo A more general implementation of fmap, because it can also work to, from, or within monomorphic structures, obviating the need for classes like MonoFunctor.
-
contiguous Data.Primitive.Contiguous Map over the elements of an array. Note that because a new array must be created, the resulting array type can be different than the original.
map :: Ord k => Decoder k -> Decoder v -> Decoder (Map k v)dhall Dhall.Marshal.Decode Decode a Map from a toMap expression or generally a Prelude.Map.Type.
>>> input (Dhall.map strictText bool) "toMap { a = True, b = False }" fromList [("a",True),("b",False)] >>> input (Dhall.map strictText bool) "[ { mapKey = \"foo\", mapValue = True } ]" fromList [("foo",True)]If there are duplicate mapKeys, later mapValues take precedence:>>> let expr = "[ { mapKey = 1, mapValue = True }, { mapKey = 1, mapValue = False } ]" >>> input (Dhall.map natural bool) expr fromList [(1,False)]map :: (a -> b) -> Triexpr a -> Triexpr bexpress Data.Express.Triexpr Maps a function to the stored values in a Triexpr.
map :: (Context a, Context b) => (a -> b) -> Matrix a -> Matrix bmatrices Data.Matrix No documentation available.
-
matrices Data.Matrix.Generic No documentation available.