Hoogle Search
Within LTS Haskell 24.39 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
ParseException :: String -> ParseExceptionio-streams System.IO.Streams.Attoparsec.Text No documentation available.
module System.IO.Streams.
Process A module adapting the functions from System.Process to work with io-streams.
-
io-streams System.IO.Streams.Process A handle to a process, which can be used to wait for termination of the process using waitForProcess. None of the process-creation functions in this library wait for termination: they all return a ProcessHandle which may be used to wait for the process later. On Windows a second wait method can be used to block for event completion. This requires two handles. A process job handle and a events handle to monitor.
-
strict Data.Strict.Tuple The type of strict pairs.
-
weigh Weigh No documentation available.
-
No documentation available.
Property :: Expression -> DocTestdoctest-lib Test.DocTest.Parse No documentation available.
-
This module is an approximation for Control.Lens from lens; by importing it you get all functions and instances from microlens, microlens-mtl, microlens-ghc, as well as the following instances:
class
PolyMap (map :: Type -> Type)mono-traversable Data.Containers A guaranteed-polymorphic Map, which allows for more polymorphic versions of functions.
module Control.Applicative.
Permutations This module is a generalization of the package parsec-permutation authored by Samuel Hoffstaetter: https://hackage.haskell.org/package/parsec-permutation This module also takes inspiration from the algorithm is described in: Parsing Permutation Phrases, by Arthur Baars, Andres Löh and Doaitse Swierstra. Published as a functional pearl at the Haskell Workshop 2001: https://www.cs.ox.ac.uk/jeremy.gibbons/wg21/meeting56/loeh-paper.pdf From these two works we derive a flexible and general method for parsing permutations over an Applicative structure. Quite useful in conjunction with "Free" constructions of Applicatives, Monads, etc. Other permutation parsing libraries tend towards using special "almost applicative" combinators for construction which denies the library user the ability to lift and unlift permutation parsing into any Applicative computational context. We redefine these combinators as convenience operators here alongside the equivalent Applicative instance. For example, suppose we want to parse a permutation of: an optional string of a's, the character b and an optional c. Using a standard parsing library combinator char (e.g. ReadP) this can be described using the Applicative instance by:
test = runPermutation $ (,,) <$> toPermutationWithDefault "" (some (char 'a')) <*> toPermutation (char 'b') <*> toPermutationWithDefault '_' (char 'c')