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.
fmap' :: (Measured v1 a1, Measured v2 a2) => (a1 -> a2) -> FingerTree v1 a1 -> FingerTree v2 a2fingertree Data.FingerTree Like fmap, but with constraints on the element types.
-
fingertree Data.FingerTree Map all elements of the tree with a function that also takes the measure of the prefix to the left and of the suffix to the right of the element.
-
fingertree Data.FingerTree Map all elements of the tree with a function that also takes the measure of the prefix of the tree to the left of the element.
unsafeFmap :: (a -> b) -> FingerTree v a -> FingerTree v bfingertree Data.FingerTree Like fmap, but safe only if the function preserves the measure.
-
fingertree Data.IntervalMap.FingerTree Map of closed intervals, possibly with duplicates.
fmapNTreeA :: (b -> Maybe b) -> LA (NTree b) (NTree b)hxt Control.Arrow.NTreeEdit No documentation available.
xpMap :: Ord k => String -> String -> PU k -> PU v -> PU (Map k v)hxt Text.XML.HXT.Arrow.Pickle Standard pickler for maps This pickler converts a map into a list of pairs. All key value pairs are mapped to an element with name (1.arg), the key is encoded as an attribute named by the 2. argument, the 3. arg is the pickler for the keys, the last one for the values
xpMap :: Ord k => String -> String -> PU k -> PU v -> PU (Map k v)hxt Text.XML.HXT.Arrow.Pickle.Xml Standard pickler for maps This pickler converts a map into a list of pairs. All key value pairs are mapped to an element with name (1.arg), the key is encoded as an attribute named by the 2. argument, the 3. arg is the pickler for the keys, the last one for the values
concatMapT :: (a -> [[b]]) -> [[a]] -> [[b]]leancheck Test.LeanCheck concatMap over tiers
concatMapT f [ [x0, y0, z0] , [x1, y1, z1] , [x2, y2, z2] , ... ] = f x0 \/ f y0 \/ f z0 \/ ... \/ delay (f x1 \/ f y1 \/ f z1 \/ ... \/ delay (f x2 \/ f y2 \/ f z2 \/ ... \/ (delay ...)))
(cf. concatT)concatMapT :: (a -> [[b]]) -> [[a]] -> [[b]]leancheck Test.LeanCheck.Core concatMap over tiers
concatMapT f [ [x0, y0, z0] , [x1, y1, z1] , [x2, y2, z2] , ... ] = f x0 \/ f y0 \/ f z0 \/ ... \/ delay (f x1 \/ f y1 \/ f z1 \/ ... \/ delay (f x2 \/ f y2 \/ f z2 \/ ... \/ (delay ...)))
(cf. concatT)