Hoogle Search
Within LTS Haskell 24.66 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
fmapF :: FunctorF m => (forall (x :: k) . () => f x -> g x) -> m f -> m gparameterized-utils Data.Parameterized.TraversableF No documentation available.
fmapFDefault :: TraversableF t => (forall (s :: k) . () => e s -> f s) -> t e -> t fparameterized-utils Data.Parameterized.TraversableF This function may be used as a value for fmapF in a FunctorF instance.
foldMapF :: (FoldableF t, Monoid m) => (forall (s :: k) . () => e s -> m) -> t e -> mparameterized-utils Data.Parameterized.TraversableF Map each element of the structure to a monoid, and combine the results.
foldMapFDefault :: (TraversableF t, Monoid m) => (forall (s :: k) . () => e s -> m) -> t e -> mparameterized-utils Data.Parameterized.TraversableF This function may be used as a value for foldMap in a Foldable instance.
-
parameterized-utils Data.Parameterized.TraversableFC No documentation available.
-
parameterized-utils Data.Parameterized.TraversableFC This function may be used as a value for fmapF in a FunctorF instance.
-
parameterized-utils Data.Parameterized.TraversableFC Map each element of the structure to a monoid, and combine the results.
-
parameterized-utils Data.Parameterized.TraversableFC This function may be used as a value for foldMap in a Foldable instance.
-
parameterized-utils Data.Parameterized.TraversableFC.WithIndex Like foldMapFC, but with an index.
foldMapFC f ≡ ifoldMapFC (const f)
-
parameterized-utils Data.Parameterized.TraversableFC.WithIndex Like fmapFC, but with an index.
fmapFC f ≡ imapFC (const f)