B1> -      !"#$%&'()*+, Safe-InferredLike optional, but restricted to - results.'Zero or more argument occurrences like ., but concatenated.&One or more argument occurrences like /, but concatenated.(Lifted and potentially optimized monoid 0# operation from the parameter type.None3XThe central parser type. Its first parameter is the input monoid, the second the output.)Feeds a chunk of the input to the parser.Signals the end of the input. .Extracts all available parsing results from a . The first component of the result pair is a list of complete results together with the unconsumed remainder of the input. If the parsing can continue further, the second component of the pair provides the partial result prefix together with the parser for the rest of the input. Like  =, but more general: doesn't assume that the result type is a -. Like  Q, but returns only the complete results with the corresponding unconsumed inputs. Like  -, but returns only the partial result prefix.Like 1>, but capable of mapping partial results, being restricted to - types only.BBehaves like the argument parser, but without consuming any input.+Does not consume any input; succeeds (with 2' result) iff the argument parser fails.3"Provides a partial parsing result.9A parser that fails on any input and succeeds at its end.,A parser that accepts any single input atom.,A parser that accepts a specific input atom.MA parser that accepts an input atom only if it satisfies the given predicate.Specialization of  on 4P inputs, accepting an input character only if it satisfies the given predicate.AA parser that consumes and returns the given prefix of the input.A parser accepting the longest sequence of input atoms that match the given predicate; an optimized version of 'concatMany . satisfy'.A parser accepting the longest non-empty sequence of input atoms that match the given predicate; an optimized version of 'concatSome . satisfy'.Specialization of  on 4 inputs, accepting the longest sequence of input characters that match the given predicate; an optimized version of 'concatMany . satisfyChar'. Specialization of  on 4 inputs, accepting the longest non-empty sequence of input atoms that match the given predicate; an optimized version of 'concatSome . satisfyChar'.!?Accepts the given number of occurrences of the argument parser.",Discards the results of the argument parser.#BRepeats matching the first argument until the second one succeeds.$ A parser that accepts all input.%dParallel parser conjunction: the combined parser keeps accepting input as long as both arguments do.&NA sequence parser that preserves incremental results, otherwise equivalent to  (,)5'Two parsers can be sequentially joined.6 Usage of 7I destroys the incrementality of its left argument's parsing results, but 8 is safe to use.9The :W combinator requires its both arguments to provide complete parsing results, takeWhile ; and <# preserve the incremental results.= Usage of 1D destroys the incrementality of parsing results, if you need it use  instead.2>?@AB CDE3FG !"#$%&H5I69=%  !"#$%&% $ !"#%&-BA@?> CDE3FG !"#$%&H5I69=None24(An empty type to specialize ' for the left-biased J instance.KThe L instances are the same as the J instances.MPLeft-biased choice. The right parser is used only if the left one utterly fails.'()KM'  !"#$%&'()'()'()KMNone24+An empty type to specialize * for the symmetric J instance.NThe L instances are the same as the J instances.OThe symmetric version of the P choice combinator.*+,NO'  !"#$%&*+,*+,*+,NOQ      !"#$%&'()*+,- ./ 0123425625723829:23;<=>?@A29B29CD25E25F25GHIJKLMNOPQRST25U2VWXUX25YZincremental-parser-0.2.3.3Control.Applicative.Monoid"Text.ParserCombinators.Incremental2Text.ParserCombinators.Incremental.LeftBiasedLocal,Text.ParserCombinators.Incremental.Symmetric AlternativeliftA2MonoidAlternative moptional concatMany concatSomeMonoidApplicative><ParserfeedfeedEofresultsinspectcompleteResults resultPrefixfailure<||><<|>showWithmapIncremental lookAhead notFollowedBy isInfalliblemapTypemoreeofanyTokentokensatisfy satisfyCharstring takeWhile takeWhile1takeCharsWhiletakeCharsWhile1countskipmanyTill acceptAllandandThenLeftBiasedLocalleftmost SymmetricallOfbase Data.MonoidMonoidControl.ApplicativemanysomemappendGHC.Basefmapmempty resultPartmonoid-subclasses-0.3.6.1Data.Monoid.Textual TextualMonoid$fMonoidParser $fMonadParser>>=>>$fApplicativeParser<*>*><*$fFunctorParserChoiceDelay ResultPartResultFailureappendIncrementalappendmaniesprependapply$fMonoidAlternativeParser$fMonoidApplicativeParser$fMonadPlusParser Control.Monad MonadPlus$fAlternativeParser<|>