*"W      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~ Function 3 lifts a value of the underlying monad type into a  computation.  Function J runs the given computation involving pipes and returns the final result.  The contextF argument ensures that no suspended computation can escape its scope. The < function splits the computation into two concurrent parts, producer and consumer. The producer is  given a  to put values into, and consumer a 7 to get those values from. Once producer and consumer  both complete,  returns their paired results. The  function is same as +, with an additional description argument. The  function is equivalent to  , except the producer and consumer" are run in parallel if resources  allow. The / function is the actual worker function of the  family.  Function % tries to get a value from the given  argument. The intervening  computations suspend  all the way to the < function invocation that created the source. The result of  is  iff the  argument source is empty.  Function ; tries to put a value into the given sink. The intervening  computations suspend up to the  > invocation that has created the argument sink. The result of + indicates whether the operation succeded.  Function = checks if the argument sink accepts values, i.e., whether a  operation would succeed on the  sink.   copies all data from the source argument into the sink0 argument, as long as there is anything to copy  and the sink accepts it.   is similar to  2 except it distributes every input value from the source arguments into both sink1  and sink2.   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.  9 returns the list of all values generated by the source.  > consumes the entire source ignoring the values it generates. SA utility function wrapping if-then-else, useful for handling monadic truth values [A utility function, useful for handling monadic list values where empty list means success 8A computation that produces values and puts them into a  is called . *A computation that consumes values from a  is called . A  is the write-only end of a  communication channel. A  is the read-only end of a  communication channel. m represents the type of monadic computations that can be split into co-routining computations using function  . The context7 type parameter delimits the scope of the computation.   "#Show details of the given component's configuration.  Function G takes a component name, maximum number of threads it can use, and its X  method, and returns a HI component.  Function G takes a component name, maximum number of threads it can use, and its X  method, and returns a AB component.  Function G takes a component name, maximum number of threads it can use, and its X  method, and returns a :; component.  Function G takes a component name, maximum number of threads it can use, and its X  method, and returns a 34 component.  Function  lifts a single-threaded G function into a AB component.  Function  lifts a single-threaded @ function into a :; component.  Function  lifts a single-threaded 9 function into a 34 component.  Function X takes a function that maps one input value to one output value each, and lifts it into  a 34.  Function N takes a function that maps one input value into a list of output values, and  lifts it into a 34.  Function W creates a stateful transducer that produces only one output value after consuming the  entire input. Similar to Data.List.foldl  Function   constructs a 342 from a state-transition function and the initial U state. The transition function may produce arbitrary output at any transition step. ! Function !T takes a function that assigns a Boolean value to each input item and lifts it into  a +,. " Function "> lifts a simple, non-sectioning splitter function into a full +,. # Function #2 lifts a sectioning splitter function into a full +, $ Function $ lifts a single-threaded 1 function into a +, component. % Function % lifts a single-threaded 2 function into a full +,  component. & Function 'I configures two components, both of them with the full thread count, and  returns the components and a OP6 that can be used to build a new component from them. ' Function 'A configures two components assuming they can be run in parallel, Y splitting the given thread count between them, and returns the configured components, a OP 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. ( Function (C configures three components assuming they can be run in parallel, N splitting the given thread count between them, and returns the components, a OP that can be u used to build a new component from them, and a flag per component that indicates if it should be run in parallel or * sequentially for optimal resource usage. ))O is a type class representing all components that can act as consumers, namely AB,  34, and +,. **& is used to combine two components in ) class into one, using the  given AB binary combinator. +The +,a type represents computations that distribute data acording to some criteria. A splitter should q distribute only the original input data, and feed it into the sinks in the same order it has been read from the o source. If the two sink arguments of a splitter are the same, the splitter must act as an identity transform. 3The 34H type represents computations that transform data and return no result. a A transducer must continue consuming the given source and feeding the sink while there is data. :6A component that produces values and puts them into a  is called :;. A(A component that consumes values from a  is called AB. e data Consumer m x r = Consumer {consumerData :: ComponentData (forall c. Source c x -> Pipe c m r), P consume :: forall c. Source c x -> Pipe c m r} HHA component that performs a computation with no inputs nor outputs is a HI. T The types of TQ class carry metadata and can be configured to use a specific number of threads. V-Returns the list of all children components. WIReturns the maximum number of threads that can be used by the component. XWConfigures the component to use the specified number of threads. This function affects Y, Z,  and V methods of the result, while U and W remain the same. YcThe number of threads that the component is configured to use. By default the number is usually 1. Z/The cost of using the component as configured. [[\) is an existential type wrapper around a T. H !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\HTUVWXYZ)*[\HIJKLMNABCDEFG:;<=>?@+,-./0123456789OPQRS "#$%!'&(^ 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. b Producer b/ feeds the given sink from the standard input. c Producer cB opens the named file and feeds the given sink from its contents. d Producer d) 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. e Consumer e; opens the named file and copies the given source into it. f Consumer f9 opens the name file and appends the given source to it. g Consumer g, 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. h Transducer h& passes its input through unmodified. iThe iB transducer suppresses all input it receives. It is equivalent to  substitute [] jThe j6 transducer reports an error if any input reaches it. kThe kY transforms all uppercase letters in the input to lowercase, leaving the rest unchanged. lThe lY transforms all lowercase letters in the input to uppercase, leaving the rest unchanged. mThe mE transducer counts all its input values and outputs the final tally. o Transducer o3 collects all its input values into a single list. p Transducer pP flattens the input stream of lists of values into the output stream of values. r Splitter r+ feeds all white-space characters into its true sink, all others into false. s Splitter s, feeds all alphabetical characters into its true! sink, all other characters into false. t Splitter t feeds all digits into its true! sink, all other characters into false. u Splitter u feeds line-ends into its false% sink, and all other characters into true. vThe sectioning splitter v 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". w Splitter w! feeds its entire input into its true sink. x Splitter x! feeds its entire input into its false sink. y Splitter y feeds all input values to its true3 sink, treating every value as a separate section. z Splitter z feeds to its true@ sink all input parts that match the contents of the given list c argument. If two overlapping parts of the input both match the argument, only the first one wins. { Splitter { feeds to its true@ sink all input parts that match the contents of the given list Y argument. If two overlapping parts of the input match the argument, both are considered true. ]^_`abcdefghijklmnopqrstuvwxyz{_^cdbfeg`aijhwxyz{opqklrstvumn]} 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 ~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 =  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 R (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. 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 T combines two splitters into a mutually recursive loop acting as a single splitter. z The true sink of one of the argument splitters and false sink of the other become the true and false sinks of the loop. 4 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 c a flat sequence of values, and assuming both component splitters are deterministic and stateless, @ a 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 true: 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 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 sink. . All the rest of the input is dumped into the false sink of the result. The H combinator takes every input section that its argument splitters 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 6 | 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 numbers of preceding inputs considered true i according to its first argument and the ones according to its second argument. The combinator passes to true all c 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. Class T applies to any two components that can be combined into a third component with the  | following properties: p | * if both argument components consume input, the input of the combined component gets distributed to both  | components in parallel, s | * if both argument components produce output, the output of the combined component is a concatenation of the n | 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 3 | has completed before using the second one. Class T applies to any two components that can be combined into a third component with the  | following properties: S | * The input of the result, if any, becomes the input of the first component. d | * The output produced by the first child component is consumed by the second child component. J | * The result output, if any, is the output of the second component. "|}~"|}~      !"#$%&'()*+,-./012234567899:;<=>??@ABCDEEFGHIJKKLMNOPQQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~?Escc-0.2!Control.Concurrent.SCC.Foundation%Control.Concurrent.SCC.ComponentTypes!Control.Concurrent.SCC.Components"Control.Concurrent.SCC.Combinatorsbase Data.MaybeliftPiperunPipespipepipeDpipePget getSuccessputcanPutpourteeputListgetListconsumeAndSuppresscondwhenNullSinkSourcePipeParallelizableMonad parallelizeshowComponentTree liftPerformer liftConsumer liftProducerliftTransducerliftAtomicConsumerliftAtomicProducerliftAtomicTransducerlift121TransducerliftStatelessTransducerliftFoldTransducerliftStatefulTransducerliftStatelessSplitterliftSimpleSplitterliftSectionSplitterliftAtomicSimpleSplitterliftAtomicSectionSplitter"optimalTwoSequentialConfigurations optimalTwoParallelConfigurations"optimalThreeParallelConfigurationsBranchComponentcombineBranchesSplitter splitterNamesplitterMaxThreadssplitterConfigurationsplitterUsingThreadssplit splitSections TransducertransducerNametransducerMaxThreadstransducerConfigurationtransducerUsingThreads transduceProducer producerNameproducerMaxThreadsproducerConfigurationproducerUsingThreadsproduceConsumer consumerNameconsumerMaxThreadsconsumerConfigurationconsumerUsingThreadsconsume Performer performerNameperformerMaxThreadsperformerConfigurationperformerUsingThreadsperformComponentConfigurationcomponentChildrencomponentThreads componentCost Componentname subComponentsmaxUsableThreads usingThreads usedThreadscost AnyComponentioCosttoListfromListtoStdOuttoPrint fromStdInfromFile fromHandletoFile appendFiletoHandleasissuppress erroneous lowercase uppercasecounttoStringgroup concatenateconcatSeparate whitespacelettersdigits nonEmptyLineline everythingnothingone substringsubstringMatch consumeByprependappend substitutesnot>&>|&&||ifswhereverunlessselectwhilenestedInforeachhaving havingOnlyfirst uptoFirstlast lastAndAfterprefixsuffixevenstartOfendOf followedBy...JoinableComponentPairjoinsequencePipeableComponentPair>->pipePrimNothing