úÎH)CĂ;      !"#$%&'()*+,-./0123456789:SafeLike optional, but restricted to ; results.'Zero or more argument occurrences like <, but concatenated.&One or more argument occurrences like =, but concatenated.A variant of the Applicative's >0 operator specialized for endomorphic functions.(Lifted and potentially optimized monoid ?# operation from the parameter type.45Safe:!‹The central parser type. Its first parameter is the subtype of the parser, the second is the input monoid type, the third the output type.)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.3Name a parser for error reporting in case it fails.Like @>, 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 A' result) iff the argument parser fails.B"Provides a partial parsing result.CA parser that fails on any non-empty 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 CP 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 C inputs, accepting the longest sequence of input characters that match the given predicate; an optimized version of 'concatMany . satisfyChar'.$Specialization of " on C• 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 and consumes 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  (,),'Two parsers can be sequentially joined.-The ? operator is specialized to return incremental parsing results.. Usage of DI destroys the incrementality of its left argument's parsing results, but E is safe to use./The >U combinator requires its both arguments to provide complete parsing results, whereas F and G# preserve the incremental results.0 Usage of @D destroys the incrementality of parsing results, if you need it use  instead.6HIJKL MNOPBQR !"#$%&'()*+,-./0)  !"#$%&'()*) ( !"#$%&')*1HIJKL MNOPBQR !"#$%&'()*+,-./0033Safe9;2An empty type to specialize 1 for the left-biased S instance.4The T instances are the same as the S instances.5PLeft-biased choice. The right parser is used only if the left one utterly fails.12345+  !"#$%&'()*12312312345Safe9;7An empty type to specialize 6 for the symmetric S instance.9The T instances are the same as the S instances.:The symmetric version of the U choice combinator.6789:+  !"#$%&'()*6786786789:V      !"#$%&'()*+,-./0123456789:;<=:;>?@>?A>?B>?C>?D>?E>?FGHIJ>?K>?L>?M>?NOPQRSTUVWXY>?>?Z>?[\1incremental-parser-0.2.5.1-8apEy2LgtyoFYeWTMKvWBWControl.Applicative.Monoid"Text.ParserCombinators.Incremental2Text.ParserCombinators.Incremental.LeftBiasedLocal,Text.ParserCombinators.Incremental.Symmetric AlternativeliftA2MonoidAlternative moptional concatMany concatSomeMonoidApplicative+<*>><ParserfeedfeedEofresultsinspectcompleteResults resultPrefixfailure<||><<|> defaultMany defaultSomeshowWithmapIncremental lookAhead notFollowedBy isInfalliblemapTypemoreeofanyTokentokensatisfy satisfyCharstring takeWhile takeWhile1takeCharsWhiletakeCharsWhile1countskipmanyTill acceptAllandandThen$fMonoidAlternativeParser$fMonoidParser$fMonoidApplicativeParser $fMonadParser$fApplicativeParser$fFunctorParserLeftBiasedLocalleftmost$fMonadPlusParser$fAlternativeParser SymmetricallOfbaseGHC.BaseMonoidmanysome<*>mappendfmapmempty resultPart0monoid-subclasses-0.4.3.1-FVLtTuXABZt5wvLFrc0lHCData.Monoid.Textual TextualMonoid>>=>>*><*FailureResult ResultPartDelayChoiceappendIncrementalappendmaniesdefaultManySomeprependapply MonadPlus<|>