úÎ'Š&¥     2013-2017 Luis Pedro CoelhoMITluis@luispedro.orgSafeL['This is a simple utility adapted from Ahttp://neilmitchell.blogspot.de/2015/07/thoughts-on-conduits.html%groupC yields the input as groups of n. elements. If the input is not a multiple of n%, the last element will be incomplete2013-2017 Luis Pedro CoelhoMITluis@luispedro.orgNone:LT[ÿ This is like Data.Conduit.List.map, except that each element is processed in a separate thread (up to maxSize can be queued up at any one time). Results are evaluated to normal form (not WHNF!) to ensure that the computation is fully evaluated before being yielded to the next conduit.QasyncMapC with error handling. The inner function can now return an error (as a  $). When the first error is seen, it  s in the main monad. Note that f¢ may be evaluated for arguments beyond the first error (as some threads may be running in the background and already processing elements after the first error).¼concatenates input into larger chunks and yields it. Its indended use is to build up larger blocks from smaller ones so that they can be sent across thread barriers with little overhead.Žthe chunkSize parameter is a hint, not an exact element. In particular, larger chunks are not split up and smaller chunks can be yielded too.QA simple sink which performs gzip in a separate thread and writes the results to h. See also jCompresses the output and writes to the given file with compression being performed in a separate thread. See also ÒA source which produces the ungzipped content from the the given handle. Note that this "reads ahead" so if you do not use all the input, the Handle will probably be left at an undefined position in the file. See also WOpen and read a gzip file with the uncompression being performed in a separate thread. See also oIf the filename indicates a gzipped file (or, on Unix, also a bz2 file), then it reads it and uncompresses it.For the case of gzip,  is used.  chunk hint 2013-2017 Luis Pedro CoelhoMITluis@luispedro.orgNoneLOT[ Unique conduit.XNote that this conduit **does not** assume that the input is sorted. Instead it uses a @ to store previously seen elements. Thus, memory usage is O(N). See  Merge a list of sorted sourcesSee  'Take two sorted sources and merge them.See           1conduit-algorithms-0.0.2.0-A5kjvyt5uEh6S3PXhYeKjHData.Conduit.Algorithms.UtilsData.Conduit.Algorithms.AsyncData.Conduit.AlgorithmsDataSet awaitJustgroupC asyncMapCasyncMapEitherC asyncGzipToasyncGzipToFile asyncGzipFromasyncGzipFromFileconduitPossiblyCompressedFile uniqueOnCuniqueCmergeCmergeC2base Data.EitherLeft mtl-2.2.1-BLKBelFsPB3BoFeSWSOYj6Control.Monad.Error.Class throwError bsConcatTo untilNothing