úÎ`:[b      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`aportable provisionalEdward Kmett <ekmett@gmail.com>RA refinement of Integral to represent types that do not contain negative numbers. portable provisionalEdward Kmett <ekmett@gmail.com>portable provisionalEdward Kmett <ekmett@gmail.com>2(Extract the first element of the stream .Extract the possibly empty tail of the stream 'Extract the last element of the stream 9Extract everything except the last element of the stream !cons onto a stream "#Sort a stream $(Converts an non-empty list to a stream. %'Convert a stream to a list efficiently b"Lift list operations to work on a  stream &map a function over a  stream 'The ' function takes a stream xs and returns all the  finite prefixes of xs. (The ( function takes a stream xs and returns all the  suffixes of xs. )) an item into a  ** is similar to c%, but returns a stream of successive  reduced values from the left:  D scanl f z [x1, x2, ...] == z :| [z `f` x1, (z `f` x1) `f` x2, ...]  Note that & last (scanl f z xs) == foldl f z xs. ++ is the right-to-left dual of *.  Note that & head (scanr f z xs) == foldr f z xs. ,, is a variant of *& that has no starting value argument: F scanl1 f [x1, x2, ...] == x1 :| [x1 `f` x2, x1 `f` (x2 `f` x3), ...] -- is a variant of +& that has no starting value argument. .// f x produces the infinite sequence  of repeated applications of f to x. % iterate f x = [x, f x, f (f x), ..] 00 xs$ returns the infinite repetition of xs: & cycle [1,2,3] = 1 :| [2,3,1,2,3,...] 11 a finite NonEmpty 22 x3 returns a constant stream, where all elements are  equal to x. 33 n xs returns the first n elements of xs. Beware8: passing a negative integer as the first argument will  cause an error. 44 n xs drops the first n elements off the front of  the sequence xs. Beware8: passing a negative integer as the first argument will  cause an error. 55 n xs, returns a pair consisting of the prefix of xs  of length n= and the remaining stream immediately following this prefix. Beware8: passing a negative integer as the first argument will  cause an error. 66 p xs* returns the longest prefix of the stream  xs for which the predicate p holds. 77 p xs$ returns the suffix remaining after  6 p xs. 88 p xs returns the longest prefix of xs that satisfies  p-, together with the remainder of the stream. 9The 9 p function is equivalent to 8 not . p. :: p xs, removes any elements from xs that do not satisfy p. ;The ; function takes a predicate p and a stream  xs>, and returns a pair of streams. The first stream corresponds  to the elements of xs for which p holds; the second stream  corresponds to the elements of xs for which p does not hold. <The <1 function takes a stream and returns a stream of A lists such that flattening the resulting stream is equal to the ; argument. Moreover, each sublist in the resulting stream - contains only equal elements. For example, b group $ cycle "Mississippi" = "M" : "i" : "ss" : "i" : "ss" : "i" : "pp" : "i" : "M" : "i" : ... =>?@The isPrefix function returns True if the first argument is  a prefix of the second. Axs !! n# returns the element of the stream xs at index  n0. Note that the head of the stream has index 0. Beware>: passing a negative integer as the first argument will cause  an error. BThe B2 function takes two streams and returns a list of  corresponding pairs. CThe C function generalizes B. Rather than tupling = the functions, the elements are combined using the function ! passed as the first argument to C. DThe D function is the inverse of the B function. EThe E/ function breaks a stream of characters into a 7 stream of words, which were delimited by white space. FThe F% function is an inverse operation to E. It % joins words with separating spaces. GThe G4 function breaks a stream of characters into a list @ of strings at newline characters. The resulting strings do not  contain newlines. HThe H% function is an inverse operation to G. It = joins lines, after appending a terminating newline to each. 1 !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGH1&.*+,- !"#1'(/20)3456789:;<=>?@ABCDEFGH$%1 !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHportable provisionalEdward Kmett <ekmett@gmail.com>IOption is effectively d with a better instance of e, built off of an underlying [  instead of an underlying eF. Ideally, this type would not exist at all and we would just fix the e intance of d JKL-Provide a Semigroup for an arbitrary Monoid. MNOUse JI (PO a) -- to get the behavior of Data.Monoid.Last PQRUse JI (SR a) -- to get the behavior of Data.Monoid.First STUVWXYZ[\An associative operation.  (a <> b) <> c = a <> (b <> c) ]Reduce a non-empty list with <> XThe default definition should be sufficient, but this can be overridden for efficiency. ^Repeat a value (n + 1) times.  2 replicate1p n a = a <> a <> ... n + 1 times <> a UThe default definition uses peasant multiplication, exploiting associativity to only  require O(log n) uses of <>. _A generalization of Data.List.cycle to an arbitrary [. ; May fail to terminate for some values in some semigroups. `a@This lets you use a difference list of a Semigroup as a Monoid. + IJKLMNOPQRSTUVWXYZ[\]^_`a+[\]^XYZUVWRSTOPQLMN  IJK`a_IJKJKLMNMNOPQPQRSTSTUVWVWXYZYZ[\]^\]^_`af        !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIIJKLMNNOPPQRRSTTUVWXYZ[\]^_`abcsemigroups-0.7.1.2Data.SemigroupNumeric.Natural.InternalData.List.NonEmptyNumeric.Naturalbase Data.MonoidgetDualDualappEndoEndogetAllAllgetAnyAnygetSumSum getProductProductWhole toNatural unsafePredNatural runNaturalNonEmpty:|unfoldnonEmptyunconsheadtaillastinit<|conssortfromListtoListmapinitstailsinsertscanlscanrscanl1scanr1 intersperseiteratecyclereverserepeattakedropsplitAt takeWhile dropWhilespanbreakfilter partitiongroupgroupBygroup1groupBy1 isPrefixOf!!zipzipWithunzipwordsunwordslinesunlinesOption getOption WrappedMonoid WrapMonoid unwrapMonoidLastgetLastFirstgetFirstMaxgetMaxMingetMin Semigroup<>sconcat replicate1pcycle1optiondifflift Data.Foldablefoldl Data.MaybeMaybeMonoid