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.

Exact lookup

1. class StaticMap t => DynamicMap t

   relude	Relude.Extra.Map

   Modifiable Map.

2. class StaticMap t

   relude	Relude.Extra.Map

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

3. 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)]
   

4. 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")]
   

5. 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
   

6. 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]
   

7. 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]
   

8. bifoldMap :: (Bifoldable p, Monoid m) => (a -> m) -> (b -> m) -> p a b -> m

   relude	Relude.Foldable.Reexport

   Combines the elements of a structure, given ways of mapping them to a common monoid.

   bifoldMap f g ≡ bifoldr (mappend . f) (mappend . g) mempty
   

   Examples

   Basic usage:

   >>> bifoldMap (take 3) (fmap digitToInt) ([1..], "89")
   [1,2,3,8,9]
   

   >>> bifoldMap (take 3) (fmap digitToInt) (Left [1..])
   [1,2,3]
   

   >>> bifoldMap (take 3) (fmap digitToInt) (Right "89")
   [8,9]
   

9. bifoldMapDefault :: (Bitraversable t, Monoid m) => (a -> m) -> (b -> m) -> t a b -> m

   relude	Relude.Foldable.Reexport

   A default definition of bifoldMap in terms of the Bitraversable operations.

   bifoldMapDefault f g ≡
   getConst . bitraverse (Const . f) (Const . g)
   

10. bimapDefault :: Bitraversable t => (a -> b) -> (c -> d) -> t a c -> t b d

    relude	Relude.Foldable.Reexport

    A default definition of bimap in terms of the Bitraversable operations.

    bimapDefault f g ≡
    runIdentity . bitraverse (Identity . f) (Identity . g)
    

Page 514 of many | Previous | Next