Hoogle Search
Within LTS Haskell 24.41 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
(
>$ ) :: Contravariant f => b -> f b -> f alens Control.Lens.Getter Replace all locations in the output with the same value. The default definition is contramap . const, but this may be overridden with a more efficient version.
(
<$$> ) :: Stream s Identity tok => (a -> b) -> Parsec s st a -> StreamPermParser s st bparsec Text.Parsec.Perm The expression f <$$> p creates a fresh permutation parser consisting of parser p. The the final result of the permutation parser is the function f applied to the return value of p. The parser p is not allowed to accept empty input - use the optional combinator (<$?>) instead. If the function f takes more than one parameter, the type variable b is instantiated to a functional type which combines nicely with the adds parser p to the (<||>) combinator. This results in stylized code where a permutation parser starts with a combining function f followed by the parsers. The function f gets its parameters in the order in which the parsers are specified, but actual input can be in any order.
(
<$?> ) :: Stream s Identity tok => (a -> b) -> (a, Parsec s st a) -> StreamPermParser s st bparsec Text.Parsec.Perm The expression f <$?> (x,p) creates a fresh permutation parser consisting of parser p. The the final result of the permutation parser is the function f applied to the return value of p. The parser p is optional - if it can not be applied, the default value x will be used instead.
(
<$$> ) :: Stream s Identity tok => (a -> b) -> Parsec s st a -> StreamPermParser s st bparsec Text.ParserCombinators.Parsec.Perm The expression f <$$> p creates a fresh permutation parser consisting of parser p. The the final result of the permutation parser is the function f applied to the return value of p. The parser p is not allowed to accept empty input - use the optional combinator (<$?>) instead. If the function f takes more than one parameter, the type variable b is instantiated to a functional type which combines nicely with the adds parser p to the (<||>) combinator. This results in stylized code where a permutation parser starts with a combining function f followed by the parsers. The function f gets its parameters in the order in which the parsers are specified, but actual input can be in any order.
(
<$?> ) :: Stream s Identity tok => (a -> b) -> (a, Parsec s st a) -> StreamPermParser s st bparsec Text.ParserCombinators.Parsec.Perm The expression f <$?> (x,p) creates a fresh permutation parser consisting of parser p. The the final result of the permutation parser is the function f applied to the return value of p. The parser p is optional - if it can not be applied, the default value x will be used instead.
-
optparse-applicative Options.Applicative.Help.Pretty No documentation available.
-
conduit Data.Conduit Deprecated: Use .|
-
conduit Data.Conduit The connect-and-resume operator. This does not close the Conduit, but instead returns it to be used again. This allows a Conduit to be used incrementally in a large program, without forcing the entire program to live in the Sink monad. Leftover data returned from the Sink will be discarded. Mnemonic: connect + do more. Since 1.0.17
-
conduit Data.Conduit Continue processing after usage of =$$+. Connect a SealedConduitT to a sink and return the output of the sink together with a new SealedConduitT. Since 1.0.17
-
conduit Data.Conduit Same as =$$++, but doesn't include the updated SealedConduitT. NOTE In previous versions, this would cause finalizers to run. Since version 1.3.0, there are no finalizers in conduit. Since 1.0.17