[      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZSafe[ A strict \] A strict ^_Convert ] to ^`Convert ^ to ]aConvert [ to ^ [bc]de_`a [bc]de_`a[bc]de_`a Trustworthy4;IN9$A Handler for the upstream input of 3Any lens, traversal, or prism will type-check as a  xinstance Monad m => Monoid (EndoM m a) where mempty = EndoM return mappend (EndoM f) (EndoM g) = EndoM (f >=> g)&A handler for the upstream input of a 3Any lens, traversal, or prism will type-check as a Like , but monadic.A '# m a b' processes elements of type a, and results in a monadic value of type m b.FoldM   step   initial   extractEfficient representation of a left fold that preserves the fold's step function, initial accumulator, and extraction functionThis allows the fM instance to assemble derived folds that traverse the container only onceA '! a b' processes elements of type a$ and results in a value of type b.Fold   step   initial   extract Apply a strict left  to a g container Like   , but monadic Convert a strict left  into a scan )Fold all values within a container using h and i  Convert a "foldMap" to a /Get the first element of a container or return j if the container is empty.Get the last element of a container or return j if the container is empty[Get the last element of a container or return a default value if the container is emptyReturn the last N elementsReturns k if the container is empty, l otherwise"Return the length of the containerReturns k if all elements are k, l otherwiseReturns k if any element is k, l otherwise(all predicate) returns k, if all elements satisfy the predicate, l otherwise(any predicate) returns k- if any element satisfies the predicate, l otherwise Computes the sum of all elements!Computes the product all elementsComputes the maximum elementComputes the minimum element(elem a) returns k* if the container has an element equal to a, l otherwise (notElem a) returns l* if the container has an element equal to a, k otherwise(find predicate)? returns the first element that satisfies the predicate or j& if no element satisfies the predicate (index n) returns the n th element of the container, or j< if the container has an insufficient number of elements  (elemIndex a)4 returns the index of the first element that equals a , or j if no element matches!(findIndex predicate)M returns the index of the first element that satisfies the predicate, or j& if no element satisfies the predicate"/Pick a random element, using reservoir sampling#6Pick several random elements, using reservoir sampling$AConverts an effectful function to a fold. Specialized version of %.%(Converts an effectful function to a fold Qsink (f <> g) = sink f <> sink g -- if `(<>)` is commutative sink mempty = mempty&Like , except with a more general m return value'Like , except with a more general n argument(Fold all values into a list)-Fold all values into a list, in reverse order* O(n log n)`. Fold values into a list with duplicates removed, while preserving their first occurrences+O(n^2)`. 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 more traditional fold to accept the  type0%Upgrade a monadic fold to accept the  type16Upgrade a more traditional monadic fold to accept the  type2 Generalize a  to a  Rgeneralize (pure r) = pure r generalize (f <*> x) = generalize f <*> generalize x3Simplify a pure  to a  Jsimplify (pure r) = pure r simplify (f <*> x) = simplify f <*> simplify x4Shift a 3 from one monad to another with a morphism such as lift or liftIO!; the effect is the same as .5Allows to continue feeding a 4 even after passing it to a function that closes it. For pure s, this is provided by the o instance.6 _Fold1 step returns a new  using just a step function that has the same type for the accumulator and the element. The result type is the accumulator type wrapped in ^0. The initial accumulator is retrieved from the g, the result is None for empty containers.7(premap f folder) returns a new  where f is applied at each step 6fold (premap f folder) list = fold folder (map f list)!fold (premap Sum mconcat) [1..10]Sum {getSum = 55}fold mconcat (map Sum [1..10])Sum {getSum = 55} 4premap id = id premap (f . g) = premap g . premap f Jpremap k (pure r) = pure r premap k (f <*> x) = premap k f <*> premap k x8(premapM f folder) returns a new - where f is applied to each input element 9foldM (premapM f folder) list = foldM folder (map f list) 6premapM id = id premapM (f . g) = premap g . premap f NpremapM k (pure r) = pure r premapM k (f <*> x) = premapM k f <*> premapM k x9(handles t folder) transforms the input of a ' using a lens, traversal, or prism: handles _1 :: Fold a r -> Fold (a, b) r handles _Left :: Fold a r -> Fold (Either a b) r handles traverse :: Traversable t => Fold a r -> Fold (t a) r,fold (handles traverse sum) [[1..5],[6..10]]55^fold (handles (traverse.traverse) sum) [[Nothing, Just 2, Just 7],[Just 13, Nothing, Just 20]]422fold (handles (filtered even) sum) [1,3,5,7,21,21]42<fold (handles _2 mconcat) [(1,"Hello "),(2,"World"),(3,"!")]"Hello World!" 8handles id = id handles (f . g) = handles f . handles g Nhandles t (pure r) = pure r handles t (f <*> x) = handles t f <*> handles t x:(handlesM t folder) transforms the input of a ' using a lens, traversal, or prism: handlesM _1 :: FoldM m a r -> FoldM (a, b) r handlesM _Left :: FoldM m a r -> FoldM (Either a b) r handlesM traverse :: Traversable t => FoldM m a r -> FoldM m (t a) r: obeys these laws: <handlesM id = id handlesM (f . g) = handlesM f . handlesM g RhandlesM t (pure r) = pure r handlesM t (f <*> x) = handlesM t f <*> handlesM t xYpqrstuvwxyz{|  !"#$%&'()*+,}-./0123456789:~@g  !"#$%&'()*+,-./0123456789:;  !"#$%&'()*+,-./0123456789:Lpqrstuvwxyz{|  !"#$%&'()*+,}-./0123456789:~None;Apply a strict left  to a lazy bytestring<.Get the first byte of a byte stream or return j if the stream is empty=-Get the last byte of a byte stream or return j if the byte stream is empty>Returns k if the byte stream is empty, l otherwise?-Return the length of the byte stream in bytes@(all predicate) returns k% if all bytes satisfy the predicate, l otherwiseA(any predicate) returns k* if any byte satisfies the predicate, l otherwiseBComputes the maximum byteCComputes the minimum byteD (elem w8) returns k( if the byte stream has a byte equal to w8, l otherwiseE (notElem w8) returns l( if the byte stream has a byte equal to w8, k otherwiseF(find predicate)< returns the first byte that satisfies the predicate or j# if no byte satisfies the predicateG (index n) returns the nth byte of the byte stream, or j6 if the stream has an insufficient number of bytesH(elemIndex w8)1 returns the index of the first byte that equals w8 , or j if no byte matchesI(findIndex predicate)J returns the index of the first byte that satisfies the predicate, or j# if no byte satisfies the predicateJcount w8 returns the number of times w8 appears;<=>?@ABCDEFGHIJ;<=>?@ABCDEFGHIJ;<=>?A@BCDEFGHIJ;<=>?@ABCDEFGHIJSafeKApply a strict left  to lazy textL3Get the first character of a text stream or return j if the stream is emptyM2Get the last character of a text stream or return j if the text stream is emptyNReturns k if the text stream is empty, l otherwiseO2Return the length of the text stream in charactersP(all predicate) returns k. if all characters satisfy the predicate, l otherwiseQ(any predicate) returns k/ if any character satisfies the predicate, l otherwiseRComputes the maximum characterSComputes the minimum characterT(elem c) returns k- if the text stream has a character equal to c, l otherwiseU (notElem c) returns l1 if the text stream has a character equal to c, k otherwiseV(find predicate)A returns the first character that satisfies the predicate or j( if no character satisfies the predicateW (index n) returns the n$th character of the text stream, or j; if the stream has an insufficient number of charactersX (elemIndex c)6 returns the index of the first character that equals c , or j if no character matchesY(findIndex predicate)O returns the index of the first character that satisfies the predicate, or j, if no character satisfies the predicateZ (count c) returns the number of times c appearsKLMNOPQRSTUVWXYZKLMNOPQRSTUVWXYZKLMNOQPRSTUVWXYZKLMNOPQRSTUVWXYZ        !"#$%&'()*+,-./0123456789:;<=>  !"#$%?  !"#$%?@ABCDAEFGHIJKLMAENAOPAEQAERAESTUVTUWAXYAZ[\]^__`abcdefgghhijklmnopqrstuvwxyTz{|}~Afoldl_9x3AxrveVO67KxAVGgIU6v Control.FoldlControl.Foldl.ByteStringControl.Foldl.TextControl.Foldl.InternalControl.Monad.MorphhoistHandlerMEndoMappEndoMHandlerFoldMFoldfoldfoldMscanmconcatfoldMapheadlastlastDeflastNnulllengthandorallanysumproductmaximumminimumelemnotElemfindindex elemIndex findIndexrandomrandomNmapM_sink genericLength genericIndexlistrevListnubeqNubsetvectorpurelypurely_impurely impurely_ generalizesimplifyhoists duplicateM_Fold1premappremapMhandleshandlesMcountEither'base Data.EitherEitherMaybe'GHC.BaseMaybelazystricthushLeft'Right'Just'Nothing' Applicative Data.FoldableFoldablemappendmemptyNothingghc-prim GHC.TypesTrueFalseGHC.NumNumGHC.RealIntegralcomon_KzU0eCqCMJH43dMJq7UvefControl.ComonadComonad RandomNState_size _reservoir _position_gen VectorState IncompleteCompletePair3Pair maxChunkSize $fMonoidEndoM$fFloatingFoldM$fFractionalFoldM $fNumFoldM $fMonoidFoldM$fProfunctorFoldM$fApplicativeFoldM$fFunctorFoldM$fFloatingFold$fFractionalFold $fNumFold $fMonoidFold$fApplicativeFold $fComonadFold$fProfunctorFold $fFunctorFoldGHC.Prim RealWorldprimi_5Jnw7oEuYtM9dmKXelGXVbControl.Monad.Primitive PrimMonadvecto_A9qWf1eecPQGJD12EBZIxFData.Vector.Generic.BaseMutableVectorGHC.WordWord8bytes_6elQVSg5cWdFrvRnfxTUrHData.ByteString.Internal ByteStringtext_BKzOMwCPkuv5n8xwLM3CQGData.Text.InternalText