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.

  1. bimapBoth :: Bifunctor f => (a -> b) -> f a a -> f b b

    relude Relude.Extra.Bifunctor

    Maps a function over both elements of a bifunctor. 

    >>> bimapBoth length ([True], [False, True])
(1,2)

>>> map (bimapBoth not) [Left True, Right False]
[Left False,Right True]

  2. bimapF :: (Functor f, Bifunctor p) => (a -> c) -> (b -> d) -> f (p a b) -> f (p c d)

    relude Relude.Extra.Bifunctor

    Fmaps functions for nested bifunctor. Short for fmap (bimap f g). 

    >>> bimapF not length $ Just (False, ['a', 'b'])
Just (True,2)

  3. foldMap1 :: (Foldable1 f, Semigroup m) => (a -> m) -> f a -> m

    relude Relude.Extra.Foldable1

    Map each element of the non-empty structure to a semigroup, and combine the results. 

    >>> foldMap1 SG.Sum (1 :| [2, 3, 4])
Sum {getSum = 10}

>>> foldMap1 show (123 :| [456, 789, 0])
"1234567890"

  4. class StaticMap t => DynamicMap t

    relude Relude.Extra.Map

    Modifiable Map.

  5. class StaticMap t

    relude Relude.Extra.Map

    Read-only map or set. Contains polymorphic functions which work for both sets and maps.

  6. fmapToFst :: Functor f => (a -> b) -> f a -> f (b, a)

    relude Relude.Extra.Tuple

    Like fmap, but also keep the original value in the snd position. A dual to fmapToSnd. 

    >>> fmapToFst show [3, 10, 2]
[("3",3),("10",10),("2",2)]

  7. fmapToSnd :: Functor f => (a -> b) -> f a -> f (a, b)

    relude Relude.Extra.Tuple

    Like fmap, but also keep the original value in the fst position. A dual to fmapToFst. 

    >>> fmapToSnd show [3, 10, 2]
[(3,"3"),(10,"10"),(2,"2")]

  8. asumMap :: forall b m f a . (Foldable f, Alternative m) => (a -> m b) -> f a -> m b

    relude Relude.Foldable.Fold

    Alternative version of asum that takes a function to map over. 

    >>> asumMap (\x -> if x > 2 then Just x else Nothing) [1..4]
Just 3

  9. foldMapA :: (Semigroup b, Monoid b, Applicative m, Foldable f) => (a -> m b) -> f a -> m b

    relude Relude.Foldable.Fold

    Polymorphic version of the concatMapA function. 

    >>> foldMapA @[Int] (Just . replicate 3) [1..3]
Just [1,1,1,2,2,2,3,3,3]

  10. foldMapM :: (Monoid b, Monad m, Foldable f) => (a -> m b) -> f a -> m b

    relude Relude.Foldable.Fold

    Polymorphic version of the concatMapM function. 

    >>> foldMapM @[Int] (Just . replicate 3) [1..3]
Just [1,1,1,2,2,2,3,3,3]

Page 514 of many | Previous | Next