¿      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~ Copyright (C) 2007 John GoerzenBSD3John Lato <jwlato@gmail.com> provisionalportableSafe;=>?A( vThis is the primary class for structures that are to be considered foldable. A minimum complete definition provides  and . Instances of + can be folded, and can be many and varied.$These functions are used heavily in  Data.ListLike. Left-associative fold Strict version of .  A variant of 7 with no base case. Requires at least 1 list element.Right-associative fold Strict version of Like , but with no starting value9Combine the elements of a structure using a monoid.  =  id 7Map each element to a monoid, then combine the results )Monadic version of left fold, similar to . *A map in monad space, discarding results. 7Evaluate each action, ignoring the results. Same as   .   Copyright (C) 2007 John GoerzenBSD3John Lato <jwlato@gmail.com> provisionalportableSafe ;<=>?AV|S An extension to M for those data types that are capable of dealing with infinite lists. Some  functions are capable of working with finite or infinite lists. The functions here require infinite list capability in order to work at all. ;An infinite list of repeated calls of the function to args 0An infinite list where each element is the same +Converts a finite list into a circular one +The class implementing list-like functions.&It is worth noting that types such as  can be instances of r. Due to their specific ways of operating, they may not behave in the expected way in some cases. For instance,  may not increase the size of a map if the key you have given is already in the map; it will just replace the value already there.$Implementators must define at least: singletonheadtailnull or genericLengthThe empty list 0Creates a single-element list out of an element ?Like (:) for lists: adds an element to the beginning of a list "Adds an element to the *end* of a .  Combines two lists. Like (++).  Extracts the first element of a . /Extract head and tail, return Nothing if empty Extracts the last element of a . #Gives all elements after the head. 8All elements of the list except the last one. See also 3. !Tests whether the list is empty. Length of the list. See also Y. EApply a function to each element, returning any other valid .  will always be at least as fast, if not faster, than this function and is recommended if it will work for your purposes. See also E. Like , but without the possibility of changing the type of the item. This can have performance benefits for things such as ByteStrings, since it will let the ByteString use its native low-level map implementation.  Reverse the elements in a list. !2Add an item between each element in the structure "Flatten the structure. #MMap a function over the items and concatenate the results. See also $.$Like #, but without the possibility of changing the type of the item. This can have performance benefits for some things such as ByteString. %'True if any items satisfy the function &'True if all items satisfy the function 'The maximum value of the list (The minimum value of the list )kGenerate a structure with the specified length with every element set to the item passed in. See also ] *2Takes the first n elements of the list. See also Z. +2Drops the first n elements of the list. See also [ ,Equivalent to (* n xs, + n xs) . See also \. -AReturns all elements at start of list that satisfy the function. .PDrops all elements from the start of the list that satisfy the function. /NDrops all elements from the end of the list that satisfy the function. 0The equivalent of (- f xs, . f xs) 1The equivalent of 0 ( . f) 2Split a list into sublists, each which contains equal arguments. For order-preserving types, concatenating these sublists will produce the original list. See also V. 31All initial segments of the list, shortest first 4"All final segnemts, longest first 5<True when the first list is at the beginning of the second. 6<True when the first list is at the beginning of the second. 7@True when the first list is wholly containted within the second 8,Remove a prefix from a listlike if possible 9,Remove a suffix from a listlike if possible :$True if the item occurs in the list ;,True if the item does not occur in the list <fTake a function and return the first matching element, or Nothing if there is no such element. =5Returns only the elements that satisfy the function. >JReturns the lists that do and do not satisfy the function. Same as (= p xs, = ( . p) xs) ?kThe element at 0-based index i. Raises an exception if i is out of bounds. Like (!!) for lists. @0Returns the index of the element, if it exists. A@Returns the indices of the matching elements. See also C BnTake a function and return the index of the first matching element, or Nothing if no element matches C<Returns the indices of all elements satisfying the function D=Evaluate each action in the sequence and collect the results EA map in monad space. Same as D .   See also F FLike E~, but without the possibility of changing the type of the item. This can have performance benefits with some types. G4Removes duplicate elements from the list. See also Q HIRemoves the first instance of the element from the list. See also R I{List difference. Removes from the first list the first instance of each element of the second list. See '(\)' and S JList union: the set of elements that occur in either list. Duplicate elements in the first list will remain duplicate. See also T. KSList intersection: the set of elements that occur in both lists. See also U LSorts the list. On data types that do not preserve ordering, or enforce their own ordering, the result may not be what you expect. See also W. MIInserts the element at the last place where it is still less than or equal to the next element. On data types that do not preserve ordering, or enforce their own ordering, the result may not be what you expect. On types such as maps, this may result in changing an existing item. See also X. NLConverts the structure to a list. This is logically equivolent to P0, but may have a more optimized implementation. O%Generates the structure from a list. P,Converts one ListLike to another. See also N%. Default implementation is fromListLike = map id QGeneric version of G RGeneric version of R SGeneric version of I TGeneric version of J UGeneric version of K VGeneric version of 2. W2Sort function taking a custom comparison function XLike M(, but with a custom comparison function YLength of the list ZGeneric version of * [Generic version of + \Generic version of , ]Generic version of ) ^;Takes two lists and returns a list of corresponding pairs. _CTakes two lists and combines them with a custom combining function T ?ON"=Y]Z[\WED'()-.*+,01 %&:;#/8@A<BC567GQHRJTKU!>MXS2V34L9P$FI^_T !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\] ^_  L !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]Copyright (C) 2007 John GoerzenBSD3John Lato <jwlato@gmail.com> provisionalportableSafe>?A'aAn extension to I for those data types that support I/O. These functions mirror those in  System.IOI for the most part. They also share the same names; see the comments in  Data.ListLike for help importing them.fNote that some types may not be capable of lazy reading or writing. Therefore, the usual semantics of  System.IO[ functions regarding laziness may or may not be available from a particular implementation.Minimal complete definition:hGetLine hGetContentshGethGetNonBlockinghPutStrb'Reads a line from the specified handle c7Read entire handle contents. May be done lazily like .d%Read specified number of bytes. See  for particular semantics.eNon-blocking read. See  for more.fWriting entire data.g"Write data plus newline character.h Read one linei%Read entire content from stdin. See c.jWrite data to stdout.k,Write data plus newline character to stdout.leInteract with stdin and stdout by using a function to transform input to output. May be lazy. See  for more.mRead file. May be lazy.nWrite data to file.oAppend data to file.acbfgjkhilmnodeabcdefghijklmnoabcdefghijklmnoCopyright (C) 2007 John GoerzenBSD3John Lato <jwlato@gmail.com> provisionalportableSafepAn extension to , for those data types that are similar to a ". Minimal complete definition is q and r. qConverts the structure to a  r Converts a  to a list s'Breaks a string into a list of strings t%Breaks a string into a list of words u Joins lines v Joins words prsutvqpqrstuvpqrstuvSafe;=>?lNone;=>?Copyright (C) 2007 John GoerzenBSD3John Lato <jwlato@gmail.com> provisionalportableSafe;=>?wNewtype wrapper around Data.ByteString.Lazy.Char8.ByteString, this allows for ListLike instances with Char elements.rNewtype wrapper around Data.ByteString.Char8.ByteString, this allows for ListLike instances with Char elements.Safe;=>? Safe;=>?' Safe;=>?Safe Safe;=>?C  None ;=>?FT Copyright (C) 2007 John GoerzenBSD3John Lato <jwlato@gmail.com> provisionalportableSafe<%Returns True if all elements are True#Returns True if any element is TrueThe sum of the listThe product of the list=Converts a list of pairs into two separate lists of elements  Converts to a MonadPlus instance,List-like destructor (like Data.Maybe.maybe) xs xss is equivalent to (" (! xs xss)). It inserts the list xs in between the lists in xss and concatenates the result. ^_ ^_ None;<=>?None;=>? None;=>?aNone;=>?NoneCopyright (C) 2007 John GoerzenBSD3John Lato <jwlato@gmail.com> provisionalportableNone;=>?Copyright (C) 2007 John GoerzenBSD3$John Goerzen <jgoerzen@complete.org> provisionalportableNone; ]\[ZYXWVUTSRQMLKJIHGFEDCBA@?>=<;:9876543210/.-,+*)('&%$#"PON! ^_acbfgjkhilmnodeptsrq !NOP"#$%&'()*+,-./0123456789:;<=>?@ABC^_D EF abcdefghijklmnoqrstGHIJKLMQRSTUVWXYZ[\] !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]pqrst  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~    #ListLike-4.6-Ab5EcRsPp4IJionU6HgteCData.ListLike.FoldableLLData.ListLike.BaseData.ListLike.IOData.ListLike.StringData.ListLike.FMListData.ListLike.DListData.ListLike.CharStringData.ListLike.Text.TextData.ListLike.Text.TextLazyData.ListLike.Text.BuilderData.ListLike.CharsData.ListLike.UTF8Data.ListLike.UtilsData.ListLike.Vector.GenericData.ListLike.Vector.StorableData.ListLike.Vector.UnboxedData.ListLike.Vector.VectorData.ListLike.Instances Control.MonadfoldMData.MapMap System.IO hGetContentshGethGetNonBlockinginteractData.ListLike.TextData.ListLike.Vector Data.ListLike FoldableLLfoldlfoldl'foldl1foldrfoldr'foldr1foldfoldMapmapM_ sequence_$fFoldableLL[]aInfiniteListLikeiteraterepeatcycleListLikeempty singletonconssnocappendheadunconslasttailinitnulllengthmaprigidMapreverse intersperseconcat concatMaprigidConcatMapanyallmaximumminimum replicatetakedropsplitAt takeWhile dropWhile dropWhileEndspanbreakgroupinitstails isPrefixOf isSuffixOf isInfixOf stripPrefix stripSuffixelemnotElemfindfilter partitionindex elemIndex elemIndices findIndex findIndicessequencemapM rigidMapMnubdelete deleteFirstsunion intersectsortinserttoListfromList fromListLikenubBydeleteBydeleteFirstsByunionBy intersectBygroupBysortByinsertBy genericLength genericTake genericDropgenericSplitAtgenericReplicatezipzipWith $fListLike[]a ListLikeIOhGetLinehPutStr hPutStrLngetLine getContentsputStrputStrLnreadFile writeFile appendFile StringLiketoString fromStringlineswordsunlinesunwords$fMonadZipFMList$fStringLikeFMList$fIsStringFMList$fInfiniteListLikeFMLista$fListLikeFMLista$fFoldableLLFMLista$fStringLikeDList$fListLikeDLista$fFoldableLLDListaCharStringLazyCSLunCSL CharStringCSunCS$fStringLikeCharString$fListLikeIOCharStringChar$fListLikeCharStringChar$fFoldableLLCharStringChar$fMonoidCharString$fSemigroupCharString$fStringLikeCharStringLazy$fListLikeIOCharStringLazyChar$fListLikeCharStringLazyChar$fFoldableLLCharStringLazyChar$fMonoidCharStringLazy$fSemigroupCharStringLazy$fReadCharString$fShowCharString$fEqCharString$fOrdCharString$fReadCharStringLazy$fShowCharStringLazy$fEqCharStringLazy$fOrdCharStringLazy$fStringLikeText$fListLikeIOTextChar$fListLikeTextChar$fFoldableLLTextChar$fNFDataBuilder$fStringLikeBuilder$fListLikeIOBuilderChar$fListLikeBuilderChar$fFoldableLLBuilderCharCharsBTbuilder $fNFDataChars$fStringLikeChars$fListLikeIOCharsChar$fListLikeCharsChar$fFoldableLLCharsChar$fIsStringChars $fMonoidChars$fSemigroupChars $fShowChars $fEqChars $fOrdChars $fMonoidUTF8$fStringLikeUTF8$fSemigroupUTF8$fListLikeIOUTF8Char$fListLikeUTF8Char$fFoldableLLUTF8Char $fMonoidUTF80$fSemigroupUTF80$fStringLikeUTF80$fListLikeIOUTF8Char0$fListLikeUTF8Char0$fFoldableLLUTF8Char0$fIsStringUTF8andorsumproductunzip toMonadPluslist intercalate $fStringLikev $fListLikeva$fFoldableLLva$fStringLikeVector$fListLikeVectora$fFoldableLLVectora$fListLikeSeqa$fFoldableLLSeqa$fStringLikeSeq$fListLikeIOSeqChar$fListLikeIOArrayChar$fStringLikeArray$fListLikeArraye $fMonoidArray$fSemigroupArray$fFoldableLLArraye$fStringLikeByteString$fListLikeIOByteStringWord8$fListLikeByteStringWord8$fFoldableLLByteStringWord8$fStringLikeByteString0$fListLikeIOByteStringWord80$fListLikeByteStringWord80$fFoldableLLByteStringWord80$fInfiniteListLike[]a$fStringLike[]$fListLikeIO[]CharbaseGHC.Baseidghc-prim GHC.ClassesnotString