Hoogle Search
Within LTS Haskell 24.52 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
deriving-compat Data.Functor.Deriving.Internal Generates a lambda expression which behaves like fmap (without requiring a Functor instance).
makeFmapOptions :: FFTOptions -> Name -> Q Expderiving-compat Data.Functor.Deriving.Internal Like makeFmap, but takes an FFTOptions argument.
-
deriving-compat Data.Functor.Deriving.Internal Generates a lambda expression which behaves like foldMap (without requiring a Foldable instance).
makeFoldMapOptions :: FFTOptions -> Name -> Q Expderiving-compat Data.Functor.Deriving.Internal Like makeFoldMap, but takes an FFTOptions argument.
-
deriving-compat Data.Functor.Deriving.Internal Generates a lambda expression which behaves like mapM (without requiring a Traversable instance).
makeMapMOptions :: FFTOptions -> Name -> Q Expderiving-compat Data.Functor.Deriving.Internal Like makeMapM, but takes an FFTOptions argument.
-
deriving-compat Data.Traversable.Deriving Generates a lambda expression which behaves like mapM (without requiring a Traversable instance).
makeMapMOptions :: FFTOptions -> Name -> Q Expderiving-compat Data.Traversable.Deriving Like makeMapM, but takes an FFTOptions argument.
concatMap :: (a -> NonEmpty b) -> Infinite a -> Infinite binfinite-list Data.List.Infinite First map every element, then concat. The peculiar type with NonEmpty is to guarantee that concatMap is productive and results in an infinite list. Otherwise the concatenation of infinitely many [b] could still be a finite list.
PandocSyntaxMapError :: Text -> PandocErrorpandoc Text.Pandoc.Error No documentation available.