#^ X      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVW None234:M A  i carries a value and metadata about the value. It can be configured to use a specific number of threads. Readable component name. ,Returns the list of all children components. HReturns the maximum number of threads that can be used by the component.WConfigures the component to use the specified number of threads. This function affects , , and   methods of the result, while   and   remain the same._The number of threads that the component is configured to use. The default number is usually 1.The cost of using the component as configured. The cost is a rough approximation of time it would take to do the job given the . The content.XX) is an existential type wrapper around a  .4Show details of the given component's configuration.Y Function YG takes a component name, maximum number of threads it can use, and its  method, and returns a  . Function a takes the component name and its cost creates a single-threaded component with no subcomponents.Z Function ZY configures two components that are meant to alternate in processing of the data stream.[ Function \g configures two components, both of them with the full thread count, and returns the components and a ]5 that can be used to build a new component from them.\ Function \ configures two components assuming they can be run in parallel, splitting the given thread count between them, and returns the configured components, a ] that can be used to build a new component from them, and a flag that indicates if they should be run in parallel or sequentially for optimal resource usage.Applies a unary  combinatorP to the component payload. The resulting component has the original one as its   , and its 5 is the sum of the original component's cost and the combinator cost.+Combines two components into one, applying  combinator to their contents. The  and K of the result assume the sequential execution of the argument components.+Combines two components into one, applying  combinator to their contents. The  combinatorE takes a flag denoting if its arguments should run in parallel. The  and I of the result assume the parallel execution of the argument components.Combines three components into one. The first component runs in parallel with the latter two, which are considered alternative to each other.Builds a tree of recursive components. The combinator takes a list of pairs of a boolean flag denoting whether the level should be run in parallel and the value.]^_`a XbcdeYZ[\combinator cost name  combinator f ]^_`a  XbcdeYZ[\fNone=HKM7A + can be used to read input into any nested g? computation whose functor provably descends from the functor a?. It's the read-only end of a communication channel created by #.h1This method consumes a portion of input from the  using the  argument and returns the . Depending on the reader, the producer coroutine may not need to be resumed at all, or it may need to be resumed many times. The intervening g) computations suspend all the way to the #. function invocation that created the source.A - can be used to yield output from any nested g? computation whose functor provably descends from the functor a@. It's the write-only end of a communication channel created by #.=This method puts a portion of the producer's output into the . The intervening g! computations suspend up to the # invocation that has created the argument sink. The method returns the suffix of the argument that could not make it into the sink because of the sibling coroutine's death.7A disconnected sink that consumes and ignores all data L into it.i7A disconnected sink that consumes and ignores all data L into it. Converts a  on the ancestor functor a' into a sink on the descendant functor d.  Converts a  on the ancestor functor a) into a source on the descendant functor d.!aA sink mark-up transformation: every chunk going into the sink is accompanied by the given value."FA sink mark-down transformation: the marks get removed off each chunk.#The #< function splits the computation into two concurrent parts, producer and consumer. The producer is given a  to put values into, and consumer a F to get those values from. Once producer and consumer both complete, # returns their paired results.$The $ function is equivalent to #, except it runs the producer and the consumer in parallel.%A generic version of #>. The first argument is used to combine two computation steps.& Function &, tries to get a single value from the given  argument. The intervening g* computations suspend all the way to the #D function invocation that created the source. The function returns j! if the argument source is empty.'Tries to get a minimal, i.e., prime, prefix from the given  argument. The intervening g* computations suspend all the way to the #D function invocation that created the source. The function returns k! if the argument source is empty.(ZInvokes its first argument with the value it gets from the source, if there is any to get.) Function ) acts the same way as &O, but doesn't actually consume the value from the source; sequential calls to )# will always return the same value.**7 consumes and returns all data generated by the source.+Consumes inputs from the source as long as the parser accepts it.,Consumes input from the source as long as the reader accepts it.-Consumes values from the sourceB as long as each satisfies the predicate, then returns their list..Consumes values from the source until one of them satisfies the predicate or the source is emptied, then returns the pair of the list of preceding values and maybe the one value that satisfied the predicate. The latter is not consumed./Copies all data from the source argument into the sink@ argument. The result indicates if there was any chunk to copy.0Copies all data from the source argument into the sink argument, like / but ignoring the result.1Like /, copies data from the source to the sink1, but only as long as it satisfies the predicate.2NParses the input data using the given parser and copies the results to output.3Like /, copies data from the source to the sink1, but only as long as it satisfies the predicate.4Like /, copies data from the source to the sink_, but only until one value satisfies the predicate. That value is returned rather than copied.55 is like / that applies the function f- to each argument before passing it into the sink.6An equivalent of  that works on a n instead of a list. The argument function is applied to every value vefore it's written to the sink argument.77 is to 5 like l is to .88 is to 5 like   is to .99 is similar to m# except it reads the values from a 8 instead of a list and writes the mapped values into a # instead of returning another list.:: is a love child of 8 and 9: it threads the accumulator like the latter, but its argument function returns not a single value, but a list of values to write into the sink.;Like 5J except it runs the argument function on whole chunks read from the input.<Like 9J except it runs the argument function on whole chunks read from the input.== is similar to n. It draws the values from a 3 instead of a list, writes the mapped values to a , and returns a g.>> is similar to o# except it draws the values from a # instead of a list and works with g instead of an arbitrary monad.?Like >J except it runs the argument function on whole chunks read from the input.@An equivalent of p. Draws the values from a 5 instead of a list, writes the filtered values to a , and returns a g.A Similar to  , but reads the values from a  instead of a list.BB is similar to q# except it draws the values from a # instead of a list and works with g instead of an arbitrary monad.C A variant of B& that discards the final result value.rLike B6 but working on whole chunks from the argument source.DD is a version of  ) that writes the generated values into a  instead of returning a list.EE is opposite of > ; it takes a  instead of a 3 argument and writes the generated values into it.FLike EC but writing whole chunks of generated data into the argument sink.GEquivalent to   . Takes a F instead of a list argument and partitions its contents into the two  arguments.HH is similar to s% except it draws the values from two ; arguments instead of two lists, sends the results into a , and works with g instead of an arbitrary monad.II is equivalent to H., but it consumes the two sources in parallel.JJ is similar to /` except it distributes every input value from its source argument into its both sink arguments.K Every value L into a K0 result sink goes into its both argument sinks: put (teeSink s1 s2) x is equivalent to put s1 x >> put s2 x. The K method returns the list of values that couldn't fit into the second sink.L*This function puts a value into the given . The intervening g! computations suspend up to the #/ invocation that has created the argument sink.MLike LA, but returns a Bool that determines if the sink is still active.NN puts an entire list into its sink' argument. If the coroutine fed by the sink7 dies, the remainder of the argument list is returned.>thuvi !"#$%w&'()*+,-./0123456789:;<=>?@ABCrDEFGHIJKLMNx? !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMN@#$%&(')LM /0JK*N+,-.1234"!6578;<A9:G=>?@BCDEFHI:thuvi !"#$%w&'()*+,-./0123456789:;<=>?@ABCrDEFGHIJKLMNxNone 23468=HKMOOJ is a type class representing all types that can act as consumers, namely d, ^, and [.PP" is used to combine two values of Branch! class into one, using the given d binary combinator.QClass Qj applies to any two components that can be combined into a third component with the following properties:JThe input of the result, if any, becomes the input of the first component.[The output produced by the first child component is consumed by the second child component.AThe result output, if any, is the output of the second component.S1A parser is a transducer that marks up its input.T*Type of values in a markup-up stream. The V# constructor wraps the actual data.WA W$ value is produced to mark either a Z and Y& of a region of data, or an arbitrary X in data. A X! is semantically equivalent to a Z immediately followed by Y.[The [9 type represents coroutines that distribute the input stream acording to some criteria. A splitter should distribute only the original input data, and feed it into the sinks in the same order it has been read from the source. Furthermore, the input source should be entirely consumed and fed into the two sinks.+A splitter can be used in two ways: as a predicate to determine which portions of its input stream satisfy a certain property, or as a chunker to divide the input stream into chunks. In the former case, the predicate is considered true for exactly those parts of the input that are written to its true sink. In the latter case, a chunk is a contiguous section of the input stream that is written exclusively to one sink, either true or false. A kb value written to either of the two sinks can also terminate the chunk written to the other sink.^The ^H type represents coroutines that transform a data stream. Execution of `$ must continue consuming the given  and feeding the - as long as there is any data in the source.a6A coroutine that produces values and puts them into a .d(A coroutine that consumes values from a .grA coroutine that has no inputs nor outputs - and therefore may not suspend at all, which means it's not really a coroutine.nCreates a proper d8 from a function that is, but can't be proven to be, an m.oCreates a proper a8 from a function that is, but can't be proven to be, an l.pCreates a proper ^8 from a function that is, but can't be proven to be, an k.qCreates a proper [8 from a function that is, but can't be proven to be, an j.r Function r[ takes a function that maps one input value to one output value each, and lifts it into a ^.s Function s_ takes a function that maps one input value into a list of output values, and lifts it into a ^.t Function s_ takes a function that maps one input value into a list of output values, and lifts it into a ^.u Function u constructs a ^ from a state-transition function and the initial state. The transition function may produce arbitrary output at any transition step.v Function vW takes a function that assigns a Boolean value to each input item and lifts it into a [.w Function wm takes a state-converting function that also assigns a Boolean value to each input item and lifts it into a [.5OPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwyz{|}~)OPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvw)ghimdeflabck^_`j[\]WZYXTVUSQROPnopqrstuvw$OPQRSTVUWZYX[\]^_`abcdefghijklmnopqrstuvwyz{|}~ None2346HMxTwo streams of x4 types can be unambigously converted one to another.yA ^/ that converts a stream of one type to another.|AAdjusts the argument splitter to split the stream of a data type  Isomorphic# to the type it was meant to split.xyz{|xyz{| xyz{|None 23468=HKM }Class }j applies to any two components that can be combined into a third component with the following properties:if both argument components consume input, the input of the combined component gets distributed to both components in parallel, andif both argument components produce output, the output of the combined component is a concatenation of the complete output from the first component followed by the complete output of the second component.The 2 combinator may apply the components in any order.~The ~T combinator makes sure its first argument has completed before using the second one. Converts a d into a ^ with no output. Combinator " converts the given producer to a ^ that passes all its input through unmodified, except for prepending the output of the argument producer to it. The following law holds:   prefix =  ( prefix)   Combinator " converts the given producer to a ^ that passes all its input through unmodified, finally appending the output of the argument producer to it. The following law holds:   suffix =   ( suffix) The 0 combinator converts its argument producer to a ^R that produces the same output, while consuming its entire input and ignoring it.The  (streaming not) combinator simply reverses the outputs of the argument splitter. In other words, data that the argument splitter sends to its true sink goes to the false$ sink of the result, and vice versa.The  combinator sends the truej sink output of its left operand to the input of its right operand for further splitting. Both operands' false sinks are connected to the falseB sink of the combined splitter, but any input value to reach the trueK sink of the combined component data must be deemed true by both splitters.A ( combinator's input value can reach its false5 sink only by going through both argument splitters' false sinks. Combinator V is a pairwise logical conjunction of two splitters run in parallel on the same input. Combinator V is a pairwise logical disjunction of two splitters run in parallel on the same input."Converts a splitter into a parser.The recursive combinator  feeds the true sink of the argument splitter back to itself, modified by the argument transducer. Data fed to the splitter's false sink is passed on unmodified.The recursive combinator  combines two splitters into a mutually recursive loop acting as a single splitter. The true sink of one of the argument splitters and false sink of the other become the true and false sinks of the loop. The other two sinks are bound to the other splitter's source. The use of  makes sense only on hierarchically structured streams. If we gave it some input containing a flat sequence of values, and assuming both component splitters are deterministic and stateless, an input value would either not loop at all or it would loop forever.The ) combinator is similar to the combinator  in that it combines a splitter and two transducers into another transducer. However, in this case the transducers are re-instantiated for each consecutive portion of the input as the splitter chunks it up. Each contiguous portion of the input that the splitter sends to one of its two sinks gets transducered through the appropriate argument transducer as that transducer's whole input. As soon as the contiguous portion is finished, the transducer gets terminated.The  combinator combines two pure splitters into a pure splitter. One splitter is used to chunk the input into contiguous portions. Its false sink is routed directly to the false sink of the combined splitter. The second splitter is instantiated and run on each portion of the input that goes to first splitter's true> sink. If the second splitter sends any output at all to its true3 sink, the whole input portion is passed on to the true: sink of the combined splitter, otherwise it goes to its false sink.The  combinator is analogous to the H combinator, but it succeeds and passes each chunk of the input to its true= sink only if the second splitter sends no part of it to its false sink.The result of combinator ~ behaves the same as the argument splitter up to and including the first portion of the input which goes into the argument's trueA sink. All input following the first true portion goes into the false sink.The result of combinator d takes all input up to and including the first portion of the input which goes into the argument's true, sink and feeds it to the result splitter's true0 sink. All the rest of the input goes into the false# sink. The only difference between  and * combinators is in where they direct the false* portion of the input preceding the first true part.The result of the combinator . is a splitter which directs all input to its falseI sink, up to the last portion of the input which goes to its argument's trueY sink. That portion of the input is the only one that goes to the resulting component's true0 sink. The splitter returned by the combinator  has to buffer the previous two portions of its input, because it cannot know if a true portion of the input is the last one until it sees the end of the input or another portion succeeding the previous one.The result of the combinator . is a splitter which directs all input to its falseI sink, up to the last portion of the input which goes to its argument's trueX sink. That portion and the remainder of the input is fed to the resulting component's true sink. The difference between  and % combinators is where they feed the false8 portion of the input, if any, remaining after the last true part.The  combinator feeds its trueB sink only the prefix of the input that its argument feeds to its true6 sink. All the rest of the input is dumped into the false sink of the result.The  combinator feeds its trueB sink only the suffix of the input that its argument feeds to its true6 sink. All the rest of the input is dumped into the false sink of the result.The 8 combinator takes every input section that its argument splitter deems true , and feeds even ones into its true4 sink. The odd sections and parts of input that are false0 according to its argument splitter are fed to  splitter's false sink. Splitter  issues an empty true6 section at the beginning of every section considered trueE by its argument splitter, otherwise the entire input goes into its false sink. Splitter  issues an empty true0 section at the end of every section considered trueE by its argument splitter, otherwise the entire input goes into its false sink. Combinator  treats its argument ['s as patterns components and returns a [E that matches their concatenation. A section of input is considered true- by the result iff its prefix is considered true by argument s1+ and the rest of the section is considered true by s2. The splitter s2/ is started anew after every section split to true sink by s1. Combinator i tracks the running balance of difference between the number of preceding starts of sections considered truej according to its first argument and the ones according to its second argument. The combinator passes to trueh all input values for which the difference balance is positive. This combinator is typically used with  and B in order to count entire input sections and ignore their lengths.[Runs the second argument on every contiguous region of input source (typically produced by !) whose all values either match Left (_, True) or Left (_, False).Given a [, a , and two consumer functions, ; runs the splitter on the source and feeds the splitter's true and false- outputs, respectively, to the two consumers.Like N+, except it puts the contents of the given  into the sink.G}~(}~E}~NoneHM&Used by / to distinguish between overlapping substrings.7Collects the entire input source into the return value.,Produces the contents of the given argument. Consumer 2 copies the given source into the standard output. Producer . feeds the given sink from the standard input.@Reads the named file and feeds the given sink from its contents.-Feeds the given sink from the open text file handle./Feeds the given sink from the open binary file handle. The argument  chunkSize9 determines the size of the chunks read from the handle.ECreates the named text file and writes the entire given source to it.0Appends the given source to the named text file.0Copies the given source into the open text file handle.2Copies the given source into the open binary file handle. Transducer B removes all markup from its input and passes the content through. Transducer / prepares input content for subsequent parsing.The @ consumer suppresses all input it receives. It is equivalent to  substitute []The 3 consumer reports an error if any input reaches it.The X transforms all uppercase letters in the input to lowercase, leaving the rest unchanged.The X transforms all lowercase letters in the input to uppercase, leaving the rest unchanged.The D transducer counts all its input values and outputs the final tally.Converts each input value x to show x. Transducer 0 collects all its input into a single list item. Transducer O flattens the input stream of lists of values into the output stream of values.Same as J except it inserts the given separator list between every two input lists. Splitter + feeds all white-space characters into its true sink, all others into false. Splitter , feeds all alphabetical characters into its true$ sink, all other characters into | false. Splitter  feeds all digits into its true! sink, all other characters into false. Splitter  feeds line-ends into its false% sink, and all other characters into true.The sectioning splitter  feeds line-ends into its false sink, and line contents into truec. A single line-end can be formed by any of the character sequences "\n", "\r", "\r\n", or "\n\r". Splitter ! feeds its entire input into its true sink. Splitter ! feeds its entire input into its false sink. Splitter  feeds all input values to its true2 sink, treating every value as a separate section. Splitter , passes all marked-up input sections to its true& sink, and all unmarked input to its false sink. Splitter ; passes the content of all marked-up input sections to its trueF sink, takeWhile the outermost tags and all unmarked input go to its false sink. Splitter A passes input sections marked-up with the appropriate tag to its true) sink, and the rest of the input to its false sink. The argument select& determines if the tag is appropriate. Splitter Q passes the content of input sections marked-up with the appropriate tag to its true( sink, and the rest of the input to its false sink. The argument select' determines if the tag is appropriate.Performs the same task as the < splitter, but instead of splitting it outputs the input as T x - in order to distinguish overlapping strings. Splitter  feeds to its true sink all input parts that match the contents of the given list argument. If two overlapping parts of the input both match the argument, both are sent to true, and each is preceded by an empty chunk on false.RA utility function wrapping if-then-else, useful for handling monadic truth values)%(None36HM ?Converts an XML entity name into the text value it represents: expandXMLEntity "lt" = "<".XML markup splitter wrapping .The XML token parser. This parser converts plain text to parsed text, which is a precondition for using the remaining XML components.8Splits all top-level elements with all their content to true, all other input to false.0Splits the content of all top-level elements to true&, their tags and intervening input to false. Similiar to ( element)u, except it runs the argument splitter only on each element's start tag, not on the entire element with its content.(Splits every attribute specification to true, everything else to false.\Splits every element name, including the names of nested elements and names in end tags, to true, all the rest of input to false.Splits every attribute name to true, all the rest of input to false.ASplits every attribute value, excluding the quote delimiters, to true, all the rest of input to false.9'None 23468=HKMSThe G type represents computations that distribute data acording to some criteria. A splitter should distribute only the original input data, and feed it into the sinks in the same order it has been read from the source. If the two 'Sink c x' arguments of a splitter are the same, the splitter must act as an identity transform.The ; type represents computations that transform a data stream.6A component that produces values and puts them into a  is called .(A component that consumes values from a  is called .HA component that performs a computation with no inputs nor outputs is a .3The constant cost of each I/O-performing component.A / that converts a stream of one type to another.qAdjusts the argument consumer to consume the stream of a data type coercible to the type it was meant to consume.sAdjusts the argument producer to produce the stream of a data type coercible from the type it was meant to produce.nAdjusts the argument splitter to split the stream of a data type isomorphic to the type it was meant to split.ProducerComponent . feeds the given sink from the standard input.ProducerComponent A opens the named file and feeds the given sink from its contents.ProducerComponent ) feeds the given sink from the open file handle.ConsumerComponent 2 copies the given source into the standard output.ConsumerComponent : opens the named file and copies the given source into it.ConsumerComponent 8 opens the name file and appends the given source to it.ConsumerComponent , copies the given source into the open file handle.- produces the contents of the given argument.ConsumerComponent 1 collects the given source into the return value.The @ consumer suppresses all input it receives. It is equivalent to   []The 3 consumer reports an error if any input reaches it.TransducerComponent % passes its input through unmodified.TransducerComponent B removes all markup from its input and passes the content through.TransducerComponent / prepares input content for subsequent parsing.The X transforms all uppercase letters in the input to lowercase, leaving the rest unchanged.The X transforms all lowercase letters in the input to uppercase, leaving the rest unchanged.The D transducer counts all its input values and outputs the final tally.Converts each input value x to show x.Performs the same task as the < splitter, but instead of splitting it outputs the input as T x - in order to distinguish overlapping strings.TransducerComponent 0 collects all its input into a single list item.TransducerComponent O flattens the input stream of lists of values into the output stream of values.Same as J except it inserts the given separator list between every two input lists.SplitterComponent ! feeds its entire input into its true sink.SplitterComponent ! feeds its entire input into its false sink.SplitterComponent , passes all marked-up input sections to its true& sink, and all unmarked input to its false sink.SplitterComponent ; passes the content of all marked-up input sections to its trueB sink, while the outermost tags and all unmarked input go to its false sink.SplitterComponent A passes input sections marked-up with the appropriate tag to its true) sink, and the rest of the input to its false sink. The argument select& determines if the tag is appropriate.SplitterComponent Q passes the content of input sections marked-up with the appropriate tag to its true( sink, and the rest of the input to its false sink. The argument select' determines if the tag is appropriate.SplitterComponent  feeds all input values to its true2 sink, treating every value as a separate section.SplitterComponent  feeds to its true sink all input parts that match the contents of the given list argument. If two overlapping parts of the input both match the argument, both are sent to true, and each is preceded by an empty chunk on false.SplitterComponent + feeds all white-space characters into its true sink, all others into false.SplitterComponent , feeds all alphabetical characters into its true$ sink, all other characters into | false.SplitterComponent  feeds all digits into its true! sink, all other characters into false.SplitterComponent  feeds line-ends into its false% sink, and all other characters into true.The sectioning splitter  feeds line-ends into its false sink, and line contents into truec. A single line-end can be formed by any of the character sequences "\n", "\r", "\r\n", or "\n\r". Converts a  into a  with no output.Class Qj applies to any two components that can be combined into a third component with the following properties:JThe input of the result, if any, becomes the input of the first component.[The output produced by the first child component is consumed by the second child component.AThe result output, if any, is the output of the second component.Class JoinableComponentPairj applies to any two components that can be combined into a third component with the following properties:if both argument components consume input, the input of the combined component gets distributed to both components in parallel,if both argument components produce output, the output of the combined component is a concatenation of the complete output from the first component followed by the complete output of the second component, andThe 2 combinator may apply the components in any order.The T combinator makes sure its first argument has completed before using the second one. Combinator  converts the given producer to transducer that passes all its input through unmodified, except | for prepending the output of the argument producer to it. |  prefix =  (  prefix) asis  Combinator   converts the given producer to transducer that passes all its input through unmodified, finally | appending to it the output of the argument producer. |   suffix =  asis (  suffix) The   combinator converts its argument producer to a transducer that produces the same output, while | consuming its entire input and ignoring it. The   (streaming not) combinator simply reverses the outputs of the argument splitter. In other words, data that the argument splitter sends to its true sink goes to the false$ sink of the result, and vice versa. The   combinator sends the truej sink output of its left operand to the input of its right operand for further splitting. Both operands' false sinks are connected to the falseB sink of the combined splitter, but any input value to reach the trueK sink of the combined component data must be deemed true by both splitters. A  ( combinator's input value can reach its false5 sink only by going through both argument splitters' false sinks. Combinator V is a pairwise logical conjunction of two splitters run in parallel on the same input. Combinator V is a pairwise logical disjunction of two splitters run in parallel on the same input.The recursive combinator  feeds the true sink of the argument splitter back to itself, modified by the argument transducer. Data fed to the splitter's false sink is passed on unmodified.The recursive combinator  combines two splitters into a mutually recursive loop acting as a single splitter. The true sink of one of the argument splitters and false sink of the other become the true and false sinks of the loop. The other two sinks are bound to the other splitter's source. The use of  makes sense only on hierarchically structured streams. If we gave it some input containing a flat sequence of values, and assuming both component splitters are deterministic and stateless, an input value would either not loop at all or it would loop forever.The ) combinator is similar to the combinator  in that it combines a splitter and two transducers into another transducer. However, in this case the transducers are re-instantiated for each consecutive portion of the input as the splitter chunks it up. Each contiguous portion of the input that the splitter sends to one of its two sinks gets transducered through the appropriate argument transducer as that transducer's whole input. As soon as the contiguous portion is finished, the transducer gets terminated.The  combinator combines two pure splitters into a pure splitter. One splitter is used to chunk the input into contiguous portions. Its false sink is routed directly to the false sink of the combined splitter. The second splitter is instantiated and run on each portion of the input that goes to first splitter's true> sink. If the second splitter sends any output at all to its true3 sink, the whole input portion is passed on to the true: sink of the combined splitter, otherwise it goes to its false sink.The  combinator is analogous to the H combinator, but it succeeds and passes each chunk of the input to its true= sink only if the second splitter sends no part of it to its false sink. Combinator  treats its argument (s as patterns components and returns a D that matches their concatenation. A section of input is considered true- by the result iff its prefix is considered true by argument s1+ and the rest of the section is considered true by s2. The splitter s2. is started anew after every section split to true sink by s1.The 8 combinator takes every input section that its argument splitter deems true , and feeds even ones into its true4 sink. The odd sections and parts of input that are false0 according to its argument splitter are fed to  splitter's false sink.The result of combinator ~ behaves the same as the argument splitter up to and including the first portion of the input which goes into the argument's trueA sink. All input following the first true portion goes into the false sink.The result of combinator d takes all input up to and including the first portion of the input which goes into the argument's true, sink and feeds it to the result splitter's true0 sink. All the rest of the input goes into the false# sink. The only difference between  and * combinators is in where they direct the false* portion of the input preceding the first true part.The  combinator feeds its trueB sink only the prefix of the input that its argument feeds to its true6 sink. All the rest of the input is dumped into the false sink of the result.The result of the combinator . is a splitter which directs all input to its falseI sink, up to the last portion of the input which goes to its argument's trueY sink. That portion of the input is the only one that goes to the resulting component's true0 sink. The splitter returned by the combinator  has to buffer the previous two portions of its input, because it cannot know if a true portion of the input is the last one until it sees the end of the input or another portion succeeding the previous one.The result of the combinator . is a splitter which directs all input to its falseI sink, up to the last portion of the input which goes to its argument's trueX sink. That portion and the remainder of the input is fed to the resulting component's true sink. The difference between  and % combinators is where they feed the false8 portion of the input, if any, remaining after the last true part. The   combinator feeds its trueB sink only the suffix of the input that its argument feeds to its true6 sink. All the rest of the input is dumped into the false sink of the result.!SplitterComponent ! issues an empty true6 section at the beginning of every section considered trueE by its argument splitter, otherwise the entire input goes into its false sink."SplitterComponent " issues an empty true0 section at the end of every section considered trueE by its argument splitter, otherwise the entire input goes into its false sink.# Combinator #i tracks the running balance of difference between the number of preceding starts of sections considered truej according to its first argument and the ones according to its second argument. The combinator passes to trueh all input values for which the difference balance is positive. This combinator is typically used with ! and "B in order to count entire input sections and ignore their lengths.$"Converts a splitter into a parser.%AThis splitter splits XML markup from data content. It is used by parseXMLTokens.&The XML token parser. This parser converts plain text to parsed text, which is a precondition for using the remaining XML components.'8Splits all top-level elements with all their content to true, all other input to false.(0Splits the content of all top-level elements to true&, their tags and intervening input to false.) Similiar to ( element)u, except it runs the argument splitter only on each element's start tag, not on the entire element with its content.*(Splits every attribute specification to true, everything else to false.+\Splits every element name, including the names of nested elements and names in end tags, to true, all the rest of input to false.,Splits every attribute name to true, all the rest of input to false.-ASplits every attribute value, excluding the quote delimiters, to true, all the rest of input to false.h      !"#$%&'()*+,-./01234567v       !"#$%&'()*+,-./01765432      !"#$%&'()*+,-./01 h      !"#$%&'()*+,-./01234567None3HM 8Class Qj applies to any two components that can be combined into a third component with the following properties:JThe input of the result, if any, becomes the input of the first component.[The output produced by the first child component is consumed by the second child component.AThe result output, if any, is the output of the second component.9The 92 combinator may apply the components in any order.:The : combinator sends the truej sink output of its left operand to the input of its right operand for further splitting. Both operands' false sinks are connected to the falseB sink of the combined splitter, but any input value to reach the trueK sink of the combined component data must be deemed true by both splitters.;A ;( combinator's input value can reach its false5 sink only by going through both argument splitters' false sinks.< Combinator <V is a pairwise logical conjunction of two splitters run in parallel on the same input.= Combinator =V is a pairwise logical disjunction of two splitters run in parallel on the same input.AThe recursive combinator A feeds the true sink of the argument splitter back to itself, modified by the argument transducer. Data fed to the splitter's false sink is passed on unmodified.BThe recursive combinator B combines two splitters into a mutually recursive loop acting as a single splitter. The true sink of one of the argument splitters and false sink of the other become the true and false sinks of the loop. The other two sinks are bound to the other splitter's source. The use of B makes sense only on hierarchically structured streams. If we gave it some input containing a flat sequence of values, and assuming both component splitters are deterministic and stateless, an input value would either not loop at all or it would loop forever.CThe C) combinator is similar to the combinator > in that it combines a splitter and two transducers into another transducer. However, in this case the transducers are re-instantiated for each consecutive portion of the input as the splitter chunks it up. Each contiguous portion of the input that the splitter sends to one of its two sinks gets transducered through the appropriate argument transducer as that transducer's whole input. As soon as the contiguous portion is finished, the transducer gets terminated.DThe D combinator combines two pure splitters into a pure splitter. One splitter is used to chunk the input into contiguous portions. Its false sink is routed directly to the false sink of the combined splitter. The second splitter is instantiated and run on each portion of the input that goes to first splitter's true> sink. If the second splitter sends any output at all to its true3 sink, the whole input portion is passed on to the true: sink of the combined splitter, otherwise it goes to its false sink.EThe E combinator is analogous to the DH combinator, but it succeeds and passes each chunk of the input to its true= sink only if the second splitter sends no part of it to its false sink.F Combinator F treats its argument ['s as patterns components and returns a [E that matches their concatenation. A section of input is considered true- by the result iff its prefix is considered true by argument s1+ and the rest of the section is considered true by s2. The splitter s2/ is started anew after every section split to true sink by s1.G Combinator Gi tracks the running balance of difference between the number of preceding starts of sections considered truej according to its first argument and the ones according to its second argument. The combinator passes to trueh all input values for which the difference balance is positive. This combinator is typically used with startOf and endOfB in order to count entire input sections and ignore their lengths.89:;<=>?@ABCDEFG$Q}~89:;<=>?@ABCDEFG89:;<=>?@ABCDEFGNoneiQxyz{|}~89:;<=>?@ABCDEFGixyz{|Q8}~9:;<=>?@ABCDEFGNone3HM HClass Qj applies to any two components that can be combined into a third component with the following properties:JThe input of the result, if any, becomes the input of the first component.[The output produced by the first child component is consumed by the second child component.AThe result output, if any, is the output of the second component.IThe I2 combinator may apply the components in any order.JThe J combinator sends the truej sink output of its left operand to the input of its right operand for further splitting. Both operands' false sinks are connected to the falseB sink of the combined splitter, but any input value to reach the trueK sink of the combined component data must be deemed true by both splitters.KA K( combinator's input value can reach its false5 sink only by going through both argument splitters' false sinks.L Combinator LV is a pairwise logical conjunction of two splitters run in parallel on the same input.M Combinator MV is a pairwise logical disjunction of two splitters run in parallel on the same input.QThe recursive combinator Q feeds the true sink of the argument splitter back to itself, modified by the argument transducer. Data fed to the splitter's false sink is passed on unmodified.RThe recursive combinator R combines two splitters into a mutually recursive loop acting as a single splitter. The true sink of one of the argument splitters and false sink of the other become the true and false sinks of the loop. The other two sinks are bound to the other splitter's source. The use of R makes sense only on hierarchically structured streams. If we gave it some input containing a flat sequence of values, and assuming both component splitters are deterministic and stateless, an input value would either not loop at all or it would loop forever.SThe S) combinator is similar to the combinator N in that it combines a splitter and two transducers into another transducer. However, in this case the transducers are re-instantiated for each consecutive portion of the input as the splitter chunks it up. Each contiguous portion of the input that the splitter sends to one of its two sinks gets transducered through the appropriate argument transducer as that transducer's whole input. As soon as the contiguous portion is finished, the transducer gets terminated.TThe T combinator combines two pure splitters into a pure splitter. One splitter is used to chunk the input into contiguous portions. Its false sink is routed directly to the false sink of the combined splitter. The second splitter is instantiated and run on each portion of the input that goes to first splitter's true> sink. If the second splitter sends any output at all to its true3 sink, the whole input portion is passed on to the true: sink of the combined splitter, otherwise it goes to its false sink.UThe U combinator is analogous to the TH combinator, but it succeeds and passes each chunk of the input to its true= sink only if the second splitter sends no part of it to its false sink.V Combinator V treats its argument ['s as patterns components and returns a [E that matches their concatenation. A section of input is considered true- by the result iff its prefix is considered true by argument s1+ and the rest of the section is considered true by s2. The splitter s2/ is started anew after every section split to true sink by s1.W Combinator Wi tracks the running balance of difference between the number of preceding starts of sections considered truej according to its first argument and the ones according to its second argument. The combinator passes to trueh all input values for which the difference balance is positive. This combinator is typically used with startOf and endOfB in order to count entire input sections and ignore their lengths.HIJKLMNOPQRSTUVW$Q}~HIJKLMNOPQRSTUVWHIJKLMNOPQRSTUVWNoneiQxyz{|}~HIJKLMNOPQRSTUVWixyz{|QH}~IJKLMNOPQRSTUVW !""#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijkllmnopqrrsttuvvwxxyzz{|}~  ./0       !"#$%12&'()*+,-./01234 5 6 7 8 9 : ; < =>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghiijklmnopqrstuvwxyz{|}~ scc-0.8.2.2Control.Concurrent.SCC.Streams#Control.Concurrent.SCC.ConfigurableControl.Concurrent.SCC.TypesControl.Concurrent.SCC.Parallel!Control.Concurrent.SCC.Sequential Control.Concurrent.Configuration Data.Listmap concatMapfoldlunfoldr partition Control.Concurrent.SCC.Coercions"Control.Concurrent.SCC.CombinatorsControl.Categoryid!Control.Concurrent.SCC.PrimitivesControl.Concurrent.SCC.XMLhaving+Control.Concurrent.SCC.Combinators.Parallel-Control.Concurrent.SCC.Combinators.Sequentialmonad-coroutine-0.9.0.1*Control.Monad.Coroutine.SuspensionFunctorsFinalAdvanceDeferredReading ResultPart FinalResult ReadingResultReaderControl.Monad.Coroutine.NestedAncestorFunctor Componentname subComponentsmaxUsableThreads usingThreads usedThreadscostwithshowComponentTreeatomicliftliftSequentialPairliftParallelPairparallelRouterAndBranchesrecursiveComponentTreeSourceSinkputChunk SinkFunctor SourceFunctornullSinkliftSink liftSource markUpWithmarkDownpipepipePpipeGgetgetPrimegetWithpeekgetAll getParsedgetReadgetWhilegetUntilpourpour_pourRead pourParsed pourWhile pourUntil mapStreammapSinkmapMaybeStreamconcatMapStreammapAccumStreamconcatMapAccumStreammapStreamChunksmapAccumStreamChunks mapMStream mapMStream_mapMStreamChunks_ filterMStream foldStream foldMStream foldMStream_ unfoldMStream unmapMStream_unmapMStreamChunks_partitionStreamzipWithMStreamparZipWithMStreamteeteeSinkputtryPutputAll BranchingcombineBranchesPipeableComponentPaircomposeParserMarkupContentBoundaryPointEndStartSplittersplit Transducer transduceProducerproduceConsumerconsume Performerperform OpenSplitterOpenTransducer OpenProducer OpenConsumerisolateConsumerisolateProducerisolateTransducerisolateSplitteroneToOneTransducerstatelessTransducerstatelessChunkTransducerstatefulTransducerstatelessSplitterstatefulSplitter Coerciblecoerce adaptConsumer adaptProducer adaptSplitterJoinableComponentPairsequence consumeByprependappend substitutesNotselect parseRegionsfirst uptoFirstlast lastAndAfterprefixsuffixevenstartOfendOfsplitterToMarker OccurenceTag consumeInto produceFromtoStdOut fromStdInfromFile fromHandlefromBinaryHandletoFile appendFiletoHandletoBinaryHandleunparseparsesuppress erroneous lowercase uppercasecounttoStringgroup concatenateconcatSeparate whitespacelettersdigits nonEmptyLineline everythingnothingonemarked markedContent markedWithcontentMarkedWithparseSubstring substringXMLToken ErrorTokenDoctypeDeclarationEndMarkedSectionStartMarkedSectionCDATA CommentTextCommentProcessingInstructionTextProcessingInstruction EntityNameEntityReferenceAttributeValue AttributeName ElementNameEmptyTagEndTagStartTagexpandXMLEntity xmlTokensparseXMLTokens xmlElementxmlElementContentxmlElementHavingTagWith xmlAttributexmlElementNamexmlAttributeNamexmlAttributeValueTransducerType ProducerType ConsumerType PerformerType AnyListOrUnitCompatibleSignatureSplitterComponentParserComponentTransducerComponentProducerComponentConsumerComponentPerformerComponentioCost>->joinsnot>&>|&&||ifswhereverunlesswhilenestedInforeach havingOnly followedBy...xmlParseTokens chooseBinder2$fCompatibleSignatureTransducerTransducerTypem[][]-$fCompatibleSignatureProducerProducerTypemy[]-$fCompatibleSignatureConsumerConsumerTypem[]y.$fCompatibleSignaturePerformerPerformerTypemxy$fAnyListOrUnit()$fAnyListOrUnit[] AnyComponent toComponent#optimalTwoAlternatingConfigurations"optimalTwoSequentialConfigurations optimalTwoParallelConfigurationsComponentConfigurationcomponentChildrencomponentThreads componentCostshowIndentedComponentshowIndentedAnyComponentshowRightAligned$fFunctorComponentControl.Monad.Coroutine Coroutine readChunk emptySourcebase Data.MaybeNothing Data.MonoidmemptymapMaybe mapAccumL Control.MonadmapMmapM_filterMfoldMfoldMStreamChunkszipWithMreadAll fromParser nullOrElse$fBranchingSplittermx()$fBranchingTransducermx()$fBranchingConsumermxr7$fPipeableComponentPairmyTransducerTransducerTransducer3$fPipeableComponentPairmxProducerTransducerProducer3$fPipeableComponentPairmyTransducerConsumerConsumer2$fPipeableComponentPairmxProducerConsumerPerformer3$fPipeableComponentPairmxProducerConsumerPerformer03$fPipeableComponentPairmxProducerConsumerPerformer1 $fShowMarkup$fFunctorMarkup$fFunctorBoundary$fCoercible[]y$fCoercible[][]$fCoercible[][]0$fCoercibleText[]$fCoercible[][]1$fCoercible[]Text$fCoercible[][]2$fCoercible[]x $fCoerciblexxsAndsOrpAndpOrbetween groupMarkssplitInputToConsumersputQueuecontainers-0.5.5.1 Data.SequenceSeqwrapMarkedSplitterparserToSplittersplittersToPairMarkerzipSplittersWith splitInput findsTrueIn findsFalseInreadEof teeConsumersZ$fJoinableComponentPairConsumerTypeProducerTypeTransducerTypemxyConsumerProducerTransducerZ$fJoinableComponentPairProducerTypeConsumerTypeTransducerTypemxyProducerConsumerTransducer^$fJoinableComponentPairTransducerTypeConsumerTypeTransducerTypemxyTransducerConsumerTransducer^$fJoinableComponentPairConsumerTypeTransducerTypeTransducerTypemxyConsumerTransducerTransducer^$fJoinableComponentPairTransducerTypeProducerTypeTransducerTypemxyTransducerProducerTransducer^$fJoinableComponentPairProducerTypeTransducerTypeTransducerTypemxyProducerTransducerTransducer`$fJoinableComponentPairTransducerTypePerformerTypeTransducerTypemxyTransducerPerformerTransducer`$fJoinableComponentPairPerformerTypeTransducerTypeTransducerTypemxyPerformerTransducerTransducerY$fJoinableComponentPairConsumerTypePerformerTypeConsumerTypemx()ConsumerPerformerConsumerY$fJoinableComponentPairPerformerTypeConsumerTypeConsumerTypemx()PerformerConsumerConsumerY$fJoinableComponentPairProducerTypePerformerTypeProducerTypem()xProducerPerformerProducerY$fJoinableComponentPairPerformerTypeProducerTypeProducerTypem()xPerformerProducerProducer^$fJoinableComponentPairPerformerTypePerformerTypePerformerTypem()()PerformerPerformerPerformerb$fJoinableComponentPairTransducerTypeTransducerTypeTransducerTypemxyTransducerTransducerTransducerW$fJoinableComponentPairConsumerTypeConsumerTypeConsumerTypemx()ConsumerConsumerConsumerW$fJoinableComponentPairProducerTypeProducerTypeProducerTypem()xProducerProducerProducer0$fCompatibleSignatureTransducerTransducerTypemxy,$fCompatibleSignatureProducerProducerTypemyx,$fCompatibleSignatureConsumerConsumerTypemxycond Occurenceoverlap$fEnumOccurenceTag XMLStreamchunk xmlParsererrorBadQuoteCharactererrorBadAttributeerrorBadEntityReferenceerrorBadDeclarationType errorMalformedDoctypeDeclarationerrorUnescapedContentLTunterminatedCommentunterminatedMarkedSectionunterminatedMarkupDeclarationunterminatedStartTagunterminatedEndTag!unterminatedProcessingInstruction isNameStart isNameChardispatchOnStringgetElementNamegetRestOfRegionpourRestOfRegiongetRestOfStartTaggetRestOfEndTag findEndTag findStartTagsplitSimpleRegions isContent fromContent$fMonoidXMLStream