Kr:      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>A ` 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. IReturns 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. qThe 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. ?@?) is an existential type wrapper around a . @A #Show details of the given component's configuration. BCDE Function EG takes a component name, maximum number of threads it can use, and its   method, and returns a .  Function  b takes the component name and its cost creates a single-threaded component with no subcomponents. F Function FE configures two components that are meant to alternate in processing  of the data stream. G Function HI configures two components, both of them with the full thread count, and  returns the components and a ;:6 that can be used to build a new component from them. H Function HA configures two components assuming they can be run in parallel, Y splitting the given thread count between them, and returns the configured components, a ;: that p 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  combinatorO to the component payload. The resulting component has the original one as its   , and its % is the sum of the original component's cost and the combinator cost. combinator cost name  combinator +Combines two components into one, applying  combinator to their contents. The  and  of the D result assume the sequential execution of the argument components. +Combines two components into one, applying  combinator to their contents. The  combinator takes a flag denoting . if its arguments should run in parallel. The  and 0 of the result assume the parallel execution of  the argument components. sCombines three components into one. The first component runs in parallel with the latter two, which are considered  alternative to each other. sBuilds a tree of recursive components. The combinator takes a list of pairs of a boolean flag denoting whether the 0 level should be run in parallel and the value.    +&Class of functors that can be lifted. IjConvert the ancestor functor into its descendant. The descendant functor typically contains the ancestor. _A simple record containing the resolver functions for all possible coroutine pair suspensions. Eresolves the left suspension functor into the resumption it contains 2resolves the right suspension into its resumption W | invoked when both coroutines are suspended, resolves both suspensions or either one ^Combines two functors into one, applying either or both of them. Used for coupled coroutines. /Combines two functors into one, applying both. cCombines two alternative functors into one, applying one or the other. Used for nested coroutines. The  functor instance doesn'Pt contain anything and cannot be constructed. Used for building non-suspendable  coroutines. The ! > functor instance is equivalent to (->) but more descriptive. !"The #"= functor instance is equivalent to (,) but more descriptive. #JKCComputation is suspended, its remainder is embedded in the functor s. L3Coroutine computation is finished with final value r. $,Suspending, resumable monadic computations. MNRun the next step of a $ computation. %?Class of monads that can perform two computations in parallel. &CPerform two monadic computations in parallel and pass the results. 'Suspend the current $. (Suspend yielding a value. )#Suspend until a value is provided. *Convert a non-suspending $ to the base monad. +Run a $H, using a function that converts suspension to the resumption it wraps. , Run a nested $. that can suspend both itself and the current $. -LCombines two values under two functors into a pair of values under a single . . Weaves two coroutines into one. /'Weaves two nested coroutines into one. 0qRuns two coroutines concurrently. The first argument is used to run the next step of each coroutine, the next to R convert the left, right, or both suspensions into the corresponding resumptions. 1Like 0e, but for nested coroutines that are allowed to suspend the current coroutine as well as themselves. 2(Converts a coroutine into a nested one. 3BConverts a coroutine into one that can contain nested coroutines. 4Like 3", working over multiple functors. % !"#$%&'()*+,-./01234%$'%&*+,01"# !()-./234% !!"##$%&&'()*+,-./012345A 5, can be used to read values into any nested $2 computation whose functor provably descends from  the functor a. It's the read-only end of a Pipe communication channel. O6 Function 6% tries to get a value from the given 5 argument. The intervening $ computations  suspend all the way to the >C function invocation that created the source. The function returns P if  the argument source is empty. 7A 7- can be used to yield values from any nested $2 computation whose functor provably descends from  the functor a. It's the write-only end of a Pipe communication channel. Q8 Function 8% tries to put a value into the given 7. The intervening $ computations suspend up  to the >> invocation that has created the argument sink. The result of 8! indicates whether the operation  succeded. 9 Function 9 checks if the argument 7! accepts values, i.e., whether a 8 operation would succeed on  the sink. :;RST< Converts a 7 on the ancestor functor a' into a sink on the descendant functor d. = Converts a 5 on the ancestor functor a) into a source on the descendant functor d. >The >< function splits the computation into two concurrent parts, producer and consumer. The producer is  given a 7 to put values into, and consumer a 56 to get those values from. Once producer and consumer  both complete, > returns their paired results. ?The ? function is equivalent to > , except the producer and consumer are run in parallel. @The @ function acts either as ? or as >, depending on the argument parallel. UA generic version of >?. The first argument is used to combine two computation steps. ASuccess continuation B Function B_ assumes that the argument source is not empty and returns the value the source yields. If the 0 source is empty, the function throws an error. CC copies all data from the source argument into the sink0 argument, as long as there is anything to copy  and the sink accepts it. DD is like C that applies the function f- to each argument before passing it into the sink. VV is to D like Data.Maybe.mapMaybe is to  Data.List.Map. EE is similar to C2 except it distributes every input value from the source arguments into both sink1  and sink2. FF puts entire list into its sinkB argument, as long as the sink accepts it. The remainder that wasn't + accepted by the sink is the result value. GG9 returns the list of all values generated by the source. HH> consumes the entire source ignoring the values it generates. ISA utility function wrapping if-then-else, useful for handling monadic truth values J[A utility function, useful for handling monadic list values where empty list means success KLike F+, except it puts the contents of the given W into the sink. 56789:;<=>?@ABCDEFGHIJK78956:;>?@BA<=HECDGFKIJ56678989:;<=>?@ABCDEFGHIJK)LLJ is a type class representing all types that can act as consumers, namely `_,  ZY, and WV. MM" is used to combine two values of Branch! class into one, using the given `_ binary  combinator. NOPQRA PO$ value is produced to mark either a U and T& of a region of data, or an arbitrary  S in data. A S! is semantically equivalent to a U immediately followed by T. The Q $ constructor wraps the actual data. STUVThe SplitterComponent\ type represents computations that distribute the input stream acording to some criteria. A s splitter should distribute only the original input data, and feed it into the sinks in the same order it has been w read from the source. Furthermore, the input source should be entirely consumed and fed into the first two sinks. The v third sink can be used to supply extra information at arbitrary points in the input. If any of the sinks dies before  all data is fed to them, XN should return the list of all values it has consumed from the source but hasn't " managed to write into the sinks. uA splitter can be used in two ways: as a predicate to determine which portions of its input stream satisfy a certain s property, or as a chunker to divide the input stream into chunks. In the former case, the predicate is considered C true for exactly those parts of the input that are written to its true( sink. In the latter case, a chunk is a p contiguous section of the input stream that is written exclusively to one sink, either true or false. Anything 6 written to the third sink also terminates the chunk. WXYThe ZYJ type represents computations that transform a data stream. Execution of [ must continue  consuming the given 5 and feeding the 7 as 3 long both can be resumed. If the sink dies first, [6 should return the list of all values it has consumed  from the source but hasn'.t managed to process and write into the sink. Z[\6A component that produces values and puts them into a 7. ]^_(A component that consumes values from a 5. `abDA component that performs a computation with no inputs nor outputs. cdefghiCreates a proper `_! from a function that is, but can't be proven to be, an h. jCreates a proper ]\! from a function that is, but can't be proven to be, an g. kCreates a proper ZY! from a function that is, but can't be proven to be, an f. lCreates a proper WV! from a function that is, but can't be proven to be, an e. m Function mS takes a function that maps one input value to one output value each, and lifts it  into a ZY. n Function nN takes a function that maps one input value into a list of output values, and  lifts it into a ZY. o Function oW creates a stateful transducer that produces only one output value after consuming the  entire input. Similar to Data.List.foldl p Function p constructs a ZY2 from a state-transition function and the initial U state. The transition function may produce arbitrary output at any transition step. q Function qT takes a function that assigns a Boolean value to each input item and lifts it into  a WV. r Function rS takes a state-converting function that also assigns a Boolean value to each input  item and lifts it into a WV. sGiven a WV, a 5 , and three consumer functions, s! runs the splitter on the source  and feeds the splitter's outputs to its true, false, and edge. sinks, respectively, to the three consumers. tGiven a WV, a 5, and two consumer functions, t! runs the splitter on the source  and feeds the splitter's true and false. outputs, respectively, to the two consumers. *@LMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrst*bcdh_`ag\]^fYZ[eVWXRUTSOQPNLMijklmnopqrst@)LMMNOQPPQRUTSSTUVWXWXYZ[Z[\]^]^_`a`abcdcdefghijklmnopqrst/uClass uT applies to any two components that can be combined into a third component with the  following properties: i if both argument components consume input, the input of the combined component gets distributed to both  components in parallel, l if both argument components produce output, the output of the combined component is a concatenation of the l complete output from the first component followed by the complete output of the second component, and  the v3 method may apply the components in any order, the w& method makes sure its first argument 1 has completed before using the second one. vwXYZ[\]xClass xT applies to any two components that can be combined into a third component with the  following properties: L The 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. C The result output, if any, is the output of the second component. yz Converts a `_ into a ZY with no output. { 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 = v (} prefix) asis | Combinator |a converts the given producer to transducer that passes all its input through unmodified, finally 8 | appending to it the output of the argument producer.  | | suffix = v 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 snotg (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 trueO sink output of its left operand to the input of its right operand for further  splitting. Both operands' false sinks are connected to the false. sink of the combined splitter, but any input  value to reach the trueL sink of the combined component data must be deemed true by both splitters. A >| combinator's input value can reach its false3 sink only by going through both argument splitters' false  sinks.  Combinator &&W is a pairwise logical conjunction of two splitters run in parallel on the same input.  Combinator ||W is a pairwise logical disjunction of two splitters run in parallel on the same input. #Converts a splitter into a parser. 4Converts a boundary-marking splitter into a parser. The recursive combinator N 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 J combines two splitters into a mutually recursive loop acting as a single w splitter. The true sink of one of the argument splitters and false sink of the other become the true and false sinks B of the loop. The other two sinks are bound to the other splitter's source. The use of  makes sense only s on hierarchically structured streams. If we gave it some input containing a flat sequence of values, and assuming s 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 9 in that it combines a splitter and two transducers into s another transducer. However, in this case the transducers are re-instantiated for each consecutive portion of the t input as the splitter chunks it up. Each contiguous portion of the input that the splitter sends to one of its two W sinks gets transducered through the appropriate argument transducer as that transducer's whole input. As soon as the A contiguous portion is finished, the transducer gets terminated. The f 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 a second splitter is instantiated and run on each portion of the input that goes to first splitter's true sink. If 4 the second splitter sends any output at all to its true3 sink, the whole input portion is passed on to the true 9 sink of the combined splitter, otherwise it goes to its false sink. The  combinator is analogous to the : 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 T behaves the same as the argument splitter up to and including the first portion of ' the input which goes into the argument's true@ sink. All input following the first true portion goes into the  false sink. The result of combinator O 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 true& 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 false sink, up to the last 0 portion of the input which goes to its argument's true> 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 w 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 false sink, up to the 5 last portion of the input which goes to its argument's true6 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 true 5 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 true 5 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 false/ 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 true 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 true by its argument 4 splitter, otherwise the entire input goes into its false sink.  Combinator  treats its argument WV's as patterns components and returns a WV 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 ...] tracks the running balance of difference between the number of preceding starts of sections  considered true_ according to its first argument and the ones according to its second argument. The combinator  passes to trueb all input values for which the difference balance is positive. This combinator is typically used  with  and C 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). `` runs the producer2 argument with a new sink, suppressing everything 8 in the sink. &uvwxyz{|}~&z{|}xyuvw~&uvwvwxyyz{|}~%Used by 0 to distinguish between overlapping substrings. a Consumer & copies the given source into a list. 3 produces the contents of the given list argument.  Consumer 3 copies the given source into the standard output.  Producer / feeds the given sink from the standard input.  Producer B opens the named file and feeds the given sink from its contents.  Producer ) feeds the given sink from the open file handle. The argument doClose determines  | if handleB should be closed when the handle is consumed or the sink closed.  Consumer ; opens the named file and copies the given source into it.  Consumer 9 opens the name file and appends the given source to it.  Consumer , copies the given source into the open file handle. The argument doClose determines  | if handleA should be closed once the entire source is consumed and copied.  Transducer & passes its input through unmodified.  Transducer C removes all markup from its input and passes the content through.  Transducer 0 prepares input content for subsequent parsing. The @ consumer suppresses all input it receives. It is equivalent to  substitute [] The 4 consumer reports an error if any input reaches it. The Y transforms all uppercase letters in the input to lowercase, leaving the rest unchanged. The Y transforms all lowercase letters in the input to uppercase, leaving the rest unchanged. The E transducer counts all its input values and outputs the final tally. Converts each input value x to show x.  Transducer 3 collects all its input values into a single list.  Transducer P flattens the input stream of lists of values into the output stream of values. Same as K 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 true . 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 true3 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 true sink, while the 1 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 L 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 PO 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 edge. $$$%?Escapes a character for inclusion into an XML attribute value. =Escapes a character for inclusion into the XML data content. ?Converts an XML entity name into the text value it represents:  expandEntity "lt" = "<". The D splitter distinguishes XML markup from data content. It is used by . lThe XML token parser. This parser converts plain text to parsed text, which is a precondition for using the  remaining XML components. bcdefgh8Splits 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 ()Control.Concurrent.SCC.Combinators.having )', except it runs the argument splitter  only on each element'9s 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.  Behaves like )Control.Concurrent.SCC.Combinators.having8, but the right-hand splitter works on plain instead of % marked-up text. This allows regular i( splitters to be applied to parsed XML.  Behaves like -Control.Concurrent.SCC.Combinators.havingOnly8, but the right-hand splitter works on plain instead of % marked-up text. This allows regular i( splitters to be applied to parsed XML. ]The Z type represents computations that distribute data acording to some criteria. A splitter t 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'L 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 Sink is called . (A component that consumes values from a Source is called . HA component that performs a computation with no inputs nor outputs is a . The constant cost of each I/O-performing component. ConsumerComponent & copies the given source into a list. 3 produces the contents of the given list argument. ConsumerComponent 3 copies the given source into the standard output. ProducerComponent / feeds the given sink from the standard input. ProducerComponent B opens the named file and feeds the given sink from its contents. ProducerComponent ) feeds the given sink from the open file handle. The argument doClose determines  | if handleB should be closed when the handle is consumed or the sink closed. ConsumerComponent ; opens the named file and copies the given source into it. ConsumerComponent 9 opens the name file and appends the given source to it. ConsumerComponent , copies the given source into the open file handle. The argument doClose determines  | if handleA should be closed once the entire source is consumed and copied. TransducerComponent & passes its input through unmodified. TransducerComponent C removes all markup from its input and passes the content through. TransducerComponent 0 prepares input content for subsequent parsing. The @ consumer suppresses all input it receives. It is equivalent to  [] The 4 consumer reports an error if any input reaches it. The Y transforms all uppercase letters in the input to lowercase, leaving the rest unchanged. The Y transforms all lowercase letters in the input to uppercase, leaving the rest unchanged. The E transducer counts all its input values and outputs the final tally. Converts each input value x to show x. TransducerComponent 3 collects all its input values into a single list. TransducerComponent P flattens the input stream of lists of values into the output stream of values. Same as K except it inserts the given separator list between every two input lists. 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 true . A single : line-end can be formed by any of the character sequences "\n", "\r", "\r\n", or "\n\r". SplitterComponent ! feeds its entire input into its true sink. SplitterComponent ! feeds its entire input into its false sink. SplitterComponent  feeds all input values to its true3 sink, treating every value as a separate section. 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 true sink, while the 1 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  L 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 PO x  . in order to distinguish overlapping strings.  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 edge.   Converts a  into a  with no output. Class PipeableComponentPairT applies to any two components that can be combined into a third component with the  following properties: L The 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. C The result output, if any, is the output of the second component. Class JoinableComponentPairT applies to any two components that can be combined into a third component with the  following properties: i if both argument components consume input, the input of the combined component gets distributed to both  components in parallel, l if both argument components produce output, the output of the combined component is a concatenation of the l complete output from the first component followed by the complete output of the second component, and  the 3 method may apply the components in any order, the & method makes sure its first argument 1 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)   Combinator a converts the given producer to transducer that passes all its input through unmodified, finally 8 | appending to it the output of the argument producer.  |  suffix =   ( suffix) The ` combinator converts its argument producer to a transducer that produces the same output, while / | consuming its entire input and ignoring it. The g (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 trueO sink output of its left operand to the input of its right operand for further  splitting. Both operands' false sinks are connected to the false. sink of the combined splitter, but any input  value to reach the trueL sink of the combined component data must be deemed true by both splitters. A  combinator's input value can reach its false3 sink only by going through both argument splitters' false  sinks.  Combinator W is a pairwise logical conjunction of two splitters run in parallel on the same input.  Combinator W is a pairwise logical disjunction of two splitters run in parallel on the same input. #Converts a splitter into a parser. 4Converts a boundary-marking splitter into a parser. The recursive combinator N 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  J combines two splitters into a mutually recursive loop acting as a single w splitter. The true sink of one of the argument splitters and false sink of the other become the true and false sinks B of the loop. The other two sinks are bound to the other splitter's source. The use of   makes sense only s on hierarchically structured streams. If we gave it some input containing a flat sequence of values, and assuming s 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 9 in that it combines a splitter and two transducers into s another transducer. However, in this case the transducers are re-instantiated for each consecutive portion of the t input as the splitter chunks it up. Each contiguous portion of the input that the splitter sends to one of its two W sinks gets transducered through the appropriate argument transducer as that transducer's whole input. As soon as the A contiguous portion is finished, the transducer gets terminated. "The "f 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 a second splitter is instantiated and run on each portion of the input that goes to first splitter's true sink. If 4 the second splitter sends any output at all to its true3 sink, the whole input portion is passed on to the true 9 sink of the combined splitter, otherwise it goes to its false sink. #The # combinator is analogous to the ": 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 $T behaves the same as the argument splitter up to and including the first portion of ' the input which goes into the argument's true@ sink. All input following the first true portion goes into the  false sink. %The result of combinator %O 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 true& 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 false sink, up to the last 0 portion of the input which goes to its argument's true> 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 w 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 false sink, up to the 5 last portion of the input which goes to its argument's true6 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 true 5 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 true 5 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 false/ according to its argument splitter are fed to  * splitter's false sink. +SplitterComponent + issues an empty true6 section at the beginning of every section considered true by A 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 true by its = argument splitter, otherwise the entire input goes into its false sink. - Combinator - treats its argument 's as patterns components and returns a  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 .] tracks the running balance of difference between the number of preceding starts of sections  considered true_ according to its first argument and the ones according to its second argument. The combinator  passes to trueb all input values for which the difference balance is positive. This combinator is typically used  with + and ,C in order to count entire input sections and ignore their lengths. /0123 Similiar to ()Control.Concurrent.SCC.Combinators.having element)', except it runs the argument splitter  only on each element'9s start tag, not on the entire element with its content. 4(Splits every attribute specification to true, everything else to false. 5\Splits every element name, including the names of nested elements and names in end tags, to true, all the rest of  input to false. 6Splits every attribute name to true, all the rest of input to false. 7ASplits every attribute value, excluding the quote delimiters, to true, all the rest of input to false. 89]      !"#$%&'()*+,-./0123456789]      !"#$%&'()*+,-./0123456789]      !"#$%&'()*+,-./0123456789j       !!"#$%&&''()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSSTUVWXYYZ[[\]]^__`aabcdefghijklmnopqrstuvwxyz{|}~xtuyz{  ( 9  ; !"#$%scc-0.4 Control.Concurrent.ConfigurationControl.Concurrent.CoroutineControl.Concurrent.SCC.StreamsControl.Concurrent.SCC.Types"Control.Concurrent.SCC.Combinators!Control.Concurrent.SCC.PrimitivesControl.Concurrent.SCC.XML!Control.Concurrent.SCC.Components Componentname subComponentsmaxUsableThreads usingThreads usedThreadscostwithshowComponentTreeatomicliftliftSequentialPairliftParallelPairparallelRouterAndBranchesrecursiveComponentTreeAncestorFunctorSeesawResolver resumeLeft resumeRight resumeAny SomeFunctorBoth RightSomeLeftSome NestedFunctor EitherFunctorRightFLeftFNaughtAwaitYield CoroutineParallelizableMonadbindM2suspendyieldawait runCoroutine pogoStickpogoStickNestednestcouple coupleNestedseesaw seesawNestedlocaloutliftOutSourcegetSinkputcanPut SinkFunctor SourceFunctorliftSink liftSourcepipepipePpipePS getSuccessget'pourpourMapteeputListgetListconsumeAndSuppresscondwhenNullputQueue BranchingcombineBranchesParserMarkupContentBoundaryPointEndStartSplittersplit Transducer transduceProducerproduceConsumerconsume Performerperform OpenSplitterOpenTransducer OpenProducer OpenConsumerisolateConsumerisolateProducerisolateTransducerisolateSplitteroneToOneTransducerstatelessTransducerfoldingTransducerstatefulTransducerstatelessSplitterstatefulSplittersplitToConsumerssplitInputToConsumersJoinableComponentPairjoinsequencePipeableComponentPairconnect consumeByprependappend substitutesNotsAndsOrpAndpOrifswhereverunlessselect parseRegionsparseNestedRegionswhilenestedInforeachhaving havingOnlyfirst uptoFirstlast lastAndAfterprefixsuffixevenstartOfendOf followedBybetweensplitterToMarker groupMarks OccurenceTagtoListfromListtoStdOut fromStdInfromFile fromHandletoFile appendFiletoHandleasisunparseparsesuppress erroneous lowercase uppercasecounttoStringgroup concatenateconcatSeparate whitespacelettersdigits nonEmptyLineline everythingnothingonemarked markedContent markedWithcontentMarkedWithparseSubstring substringToken ErrorTokenEndMarkedSectionStartMarkedSectionCDATA CommentTextCommentProcessingInstructionTextProcessingInstruction EntityNameEntityReferenceTokenAttributeValue AttributeName ElementNameEmptyTagEndTagStartTagescapeAttributeCharacterescapeContentCharacter expandEntitytokens parseTokenselementelementContentelementHavingTag attribute elementName attributeNameattributeValue havingTexthavingOnlyTextTransducerType ProducerType ConsumerType PerformerType AnyListOrUnitCompatibleSignatureSplitterComponentParserComponentTransducerComponentProducerComponentConsumerComponentPerformerComponentioCost>->snot>&>|&&||... xmlTokensxmlParseTokens xmlElementxmlElementContentxmlElementHavingTag xmlAttributexmlElementNamexmlAttributeNamexmlAttributeValue xmlHavingTextxmlHavingOnlyTextComponentConfigurationcomponentChildrencomponentThreads componentCost AnyComponent componentshowIndentedComponentshowIndentedAnyComponentshowRightAligned toComponent#optimalTwoAlternatingConfigurations"optimalTwoSequentialConfigurations optimalTwoParallelConfigurations liftFunctorCoroutineStateSuspendDoneresumebase Data.MaybeNothingTryYieldtryYieldcanYieldpipeG pourMapMaybecontainers-0.3.0.0 Data.SequenceSeqsplittersToPairMarkerzipSplittersWithsuppressProducer OccurencedispatchOnStringgetElementNamegetRestOfRegionpourRestOfRegion pourRestOfTag findEndTag findStartTagghc-prim GHC.TypesChar