úÎtÁnüK      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJ Safe-InferedK A strict L M A strict N OConvert M to N PConvert N to M QConvert K to N KRSMTUOPQ KRSMTUOPQKSRMUTOPQ Trustworthy)Like , but monadic ?Efficient representation of a left fold that preserves the fold's step ; function, initial accumulator, and extraction function This allows the V) instance to assemble derived folds that % traverse the container only once Apply a strict left  to a W container Like , but monadic Convert a strict left  into a scan )Fold all values within a container using X and Y  Convert a "foldMap" to a  /Get the first element of a container or return Z if the container is  empty .Get the last element of a container or return Z if the container is  empty OGet the last element of a container or return a default value if the container  is empty Returns [ if the container is empty, \ otherwise #Return the length of the container Returns [ if all elements are [, \ otherwise Returns [ if any element is [, \ otherwise (all predicate) returns [( if all elements satisfy the predicate,  \ otherwise (any predicate) returns [) if any element satisfies the predicate,  \ otherwise !Computes the sum of all elements "Computes the product all elements Computes the maximum element Computes the minimum element (elem a) returns [* if the container has an element equal to a,  \ otherwise  (notElem a) returns \* if the container has an element equal to a,  [ otherwise (find predicate); returns the first element that satisfies the predicate or  Z' if no element satisfies the predicate  (index n) returns the n th element of the container, or Z if the 5 container has an insufficient number of elements  (elemIndex a)4 returns the index of the first element that equals a, or  Z if no element matches (findIndex predicate)- returns the index of the first element that  satisfies the predicate, or Z' if no element satisfies the predicate Like  , except with a more general ] return value Like , except with a more general ^ argument Fold all values into a list  O(n log n):. Fold values into a list with duplicates removed, while ' preserving their first occurrences O(n^2)E. Fold values into a list with duplicates removed, while preserving  their first occurrences !Fold values into a set "Fold all values into a vector #Upgrade a fold to accept the  type $%Upgrade a monadic fold to accept the  type % Generalize a  to a   generalize (pure r) = pure r  6 generalize (f <*> x) = generalize f <*> generalize x &Simplify a pure  to a   simplify (pure r) = pure r  0 simplify (f <*> x) = simplify f <*> simplify x '(premap f folder) returns a new ! where f is applied at each step  8 fold (premap f folder) list = fold folder (map f list)   premap id = id  & premap (f . g) = premap g . premap f  premap k (pure r) = pure r  0 premap k (f <*> x) = premap k f <*> premap k x ((premapM f folder) returns a new " where f is applied to each input  element  ; foldM (premapM f folder) list = foldM folder (map f list)   premapM id = id  ' premapM (f . g) = premap g . premap f  premapM k (pure r) = pure r  3 premapM k (f <*> x) = premapM k f <*> premapM k x )(pretraverse t folder)' traverses each incoming element using  Traversal'  t and folds every target of the  Traversal'   pretraverse id = id  5 pretraverse (f . g) = pretraverse f . pretraverse g ! pretraverse t (pure r) = pure r  ? pretraverse t (f <*> x) = pretraverse t f <*> pretraverse t x *(pretraverseM t folder)' traverses each incoming element using  Traversal'  t and folds every target of the  Traversal'   pretraverseM id = id  8 pretraverseM (f . g) = pretraverseM f . pretraverseM g " pretraverseM t (pure r) = pure r  B pretraverseM t (f <*> x) = pretraverseM t f <*> pretraverseM t x 8  !"#$%&'()*_`abcdefghijk.Wlm  !"#$%&'()*+  !"#$%&'()*6  !"#$%&'()*_`abcdefghijk Safe-Infered+Appply a strict left  to a lazy bytestring ,.Get the first byte of a byte stream or return Z if the stream is  empty --Get the last byte of a byte stream or return Z if the byte stream is  empty .Returns [ if the byte stream is empty, \ otherwise /.Return the length of the byte stream in bytes 0(all predicate) returns [% if all bytes satisfy the predicate, \  otherwise 1(any predicate) returns [& if any byte satisfies the predicate,  \ otherwise 2Computes the maximum byte 3Computes the minimum byte 4 (elem w8) returns [( if the byte stream has a byte equal to w8,  \ otherwise 5 (notElem w8) returns \( if the byte stream has a byte equal to w8,  [ otherwise 6(find predicate)8 returns the first byte that satisfies the predicate or  Z$ if no byte satisfies the predicate 7 (index n) returns the nth byte of the byte stream, or Z if the / stream has an insufficient number of bytes 8(elemIndex w8)1 returns the index of the first byte that equals w8, or  Z if no byte matches 9(findIndex predicate)4 returns the index of the first byte that satisfies  the predicate, or Z$ if no byte satisfies the predicate :count w8 returns the number of times w8 appears +,-./0123456789:no+,-./0123456789:+,-./1023456789:+,-./0123456789: Safe-Infered;Apply a strict left  to lazy text <3Get the first character of a text stream or return Z if the stream  is empty =2Get the last character of a text stream or return Z if the text  stream is empty >Returns [ if the text stream is empty, \ otherwise ?3Return the length of the text stream in characters @(all predicate) returns [* if all characters satisfy the predicate,  \ otherwise A(any predicate) returns [+ if any character satisfies the predicate,  \ otherwise BComputes the maximum character CComputes the minimum character D(elem c) returns [- if the text stream has a character equal to c,  \ otherwise E (notElem c) returns \- if the text stream has a character equal to  c, [ otherwise F(find predicate): returns the first character that satisfies the predicate  or Z) if no character satisfies the predicate G (index n) returns the n$th character of the text stream, or Z if 8 the stream has an insufficient number of characters H (elemIndex c)6 returns the index of the first character that equals c,  or Z if no character matches I(findIndex predicate)/ returns the index of the first character that  satisfies the predicate, or Z if no character satisfies the  predicate J (count c) returns the number of times c appears ;<=>?@ABCDEFGHIJp;<=>?@ABCDEFGHIJ;<=>?A@BCDEFGHIJ;<=>?@ABCDEFGHIJq      !"#$%&'()*+,-  .  ./01230456789:;<0=>0?@0AB0AC04DEFGEFH0IJ0KLMNOPQRSTUVWXYZ[\]^_0`abcdefgh foldl-1.0.7 Control.FoldlControl.Foldl.ByteStringControl.Foldl.TextControl.Foldl.InternalFoldMFoldfoldfoldMscanmconcatfoldMapheadlastlastDefnulllengthandorallanysumproductmaximumminimumelemnotElemfindindex elemIndex findIndex genericLength genericIndexlistnubeqNubsetvectorpurelyimpurely generalizesimplifypremappremapM pretraverse pretraverseMcountEither'base Data.EitherEitherMaybe' Data.MaybeMaybelazystricthushRight'Left'Nothing'Just'Control.Applicative Applicative Data.FoldableFoldable Data.MonoidmappendmemptyNothingghc-prim GHC.TypesTrueFalseGHC.NumNumGHC.RealIntegral $fMonoidEndoM$fFloatingFoldM$fFractionalFoldM $fNumFoldM $fMonoidFoldM$fApplicativeFoldM$fFunctorFoldM$fFloatingFold$fFractionalFold $fNumFold $fMonoidFold$fApplicativeFold $fFunctorFoldprimitive-0.4.1Control.Monad.Primitive PrimMonad vector-0.9.1Data.Vector.Generic.BaseVectorGHC.WordWord8bytestring-0.9.2.1Data.ByteString.Internal ByteString text-0.11.2.0Data.Text.InternalText