Hoogle Search

Within LTS Haskell 24.65 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. writeAsciiDoctor :: PandocMonad m => WriterOptions -> Pandoc -> m Text

   pandoc	Text.Pandoc.Writers.AsciiDoc

   Deprecated: Use writeAsciiDoc instead

2. writeDZSlides :: PandocMonad m => WriterOptions -> Pandoc -> m Text

   pandoc	Text.Pandoc.Writers.HTML

   Convert Pandoc document to DZSlides HTML slide show.

3. writeSlideous :: PandocMonad m => WriterOptions -> Pandoc -> m Text

   pandoc	Text.Pandoc.Writers.HTML

   Convert Pandoc document to Slideous HTML slide show.

4. writeSlidy :: PandocMonad m => WriterOptions -> Pandoc -> m Text

   pandoc	Text.Pandoc.Writers.HTML

   Convert Pandoc document to Slidy HTML slide show.

5. ensureValidXmlIdentifiers :: Pandoc -> Pandoc

   pandoc	Text.Pandoc.Writers.Shared

   Ensure that all identifiers start with a letter, and modify internal links accordingly. (Yes, XML allows an underscore, but HTML 4 doesn't, so we are more conservative.)

6. gridTable :: Monad m => WriterOptions -> (WriterOptions -> [Block] -> m (Doc Text)) -> [ColSpec] -> TableHead -> [TableBody] -> TableFoot -> m (Doc Text)

   pandoc	Text.Pandoc.Writers.Shared

   Writes a grid table.

7. weakenMid :: forall (right :: [Effect]) (m :: Type -> Type) a (left :: [Effect]) (mid :: [Effect]) . SList left -> SList mid -> Union (Append left right) m a -> Union (Append left (Append mid right)) m a

   polysemy	Polysemy.Internal.Union

   Weaken a Union so it is capable of storing a number of new effects somewhere within the previous effect list. Both the prefix and the new effects are specified as singleton list proofs.

8. outputToIOMonoid :: forall o m (r :: EffectRow) a . (Monoid m, Member (Embed IO) r) => (o -> m) -> Sem ((Output o :: (Type -> Type) -> Type -> Type) ': r) a -> Sem r (m, a)

   polysemy	Polysemy.Output

   Run an Output effect in terms of atomic operations in IO. Internally, this simply creates a new IORef, passes it to runOutputMonoidIORef, and then returns the result and the final value of the IORef. Beware: As this uses an IORef internally, all other effects will have local state semantics in regards to Output effects interpreted this way. For example, throw and catch will never revert outputs, even if runError is used after outputToIOMonoid.

9. outputToIOMonoidAssocR :: forall o m (r :: EffectRow) a . (Monoid m, Member (Embed IO) r) => (o -> m) -> Sem ((Output o :: (Type -> Type) -> Type -> Type) ': r) a -> Sem r (m, a)

   polysemy	Polysemy.Output

   Like outputToIOMonoid, but right-associates uses of <>. This asymptotically improves performance if the time complexity of <> for the Monoid depends only on the size of the first argument. You should always use this instead of outputToIOMonoid if the monoid is a list, such as String. Beware: As this uses an IORef internally, all other effects will have local state semantics in regards to Output effects interpreted this way. For example, throw and catch will never revert outputs, even if runError is used after outputToIOMonoidAssocR.

10. runLazyOutputMonoid :: forall o m (r :: [(Type -> Type) -> Type -> Type]) a . Monoid m => (o -> m) -> Sem ((Output o :: (Type -> Type) -> Type -> Type) ': r) a -> Sem r (m, a)

    polysemy	Polysemy.Output

    Run an Output effect by transforming it into a monoid, and accumulate it lazily. Warning: This inherits the nasty space leak issue of WriterT! Don't use this if you don't have to.

Page 823 of many | Previous | Next