úÎ7ô4,      !"#$%&'()*+H,-./012345676leafLen est la taille standard des blocs de feuilles. =O(log n). Appends the specified byte at the beginning of the . 7O(log n). Appends the specified byte at the end of the . O(log n) First element of the ,. Raises an error if the argument is empty. +O(log n). Returns the first element of the  , and the  of the  remaining elements. O(log n). Last element of a . @O(log n) The elements after the head. An error is raised if the  is empty. O(log n) The elements in the  except the last one. O(1) Tests whether a  is empty. O(1) Length of a . 8 O(n).   f r applies f on each element of r and returns the  concatenation of the result.  O(n) efficient way to reverse a . @O(n) intercalate an element between each element of the list of s  and concatenates the result. O(1) The empty  O(1) Convert a 9 into a  O(n) Convert a list of 9 into a  O(n) Inverse conversion O(log n) Concatenates two s  O(log n)  a i b inserts  a in  b after the ith element of b. :;<=>?@ABCO(log n) returns the 9 at given index in the  \O(n) returns the index of the first element equal to the query element. This implementation @ uses memchr at leaves, and explores the rope in parallel (with D).  O(n) Same as , but explores the  sequentially. Useful for  s loaded lazily with (. PO(n) returns the list of all positions where the queried elements occurs in the . " This implementation uses memchr. O(n). fold over a . F This implementation is not tail-recursive but never pushes more than  O(log n) calls on the stack. E O(n). like  but strict. FDO(n). Right fold. Again not tail-recursive but never uses more than  O(log n) on the stack. G O(log n).  n xs? is equivalent to (take n xs, drop n xs), but a little faster. O(n).  c r breaks  r before the first occurence of c. O(n).  w r breaks  r between each occurence of w (non-inclusive). + This function is not tail-recursive, uses memchr% and constructs the list in parallel  using D. O(n). Satisfies lines r == breaks 0x0a r. !Writes the contents of the  on the specified H. " synonym for !. #like !8, but with a newline character at the end of the output $Writes the contents of the  on the standard output. %like $7 but with a newline character at the end of the output IAfromPtr encapsule un pointeur, un offset et une longueur dans un Rope.. &O(n) Conversion from a strict  ByteString 'O(n) Conversion to a strict  ByteString (Lazy file reading, using mmap. ),Strict hGet. The whole rope is constructed. J*#Returns the next line in the input H. If you need to iterate *, # it may be more efficient to first mmap the file using (, or even load  it with then iterate   0x0a : *% allocates a buffer to read the file T and may waste most of this space if the lines are shorter than the standard buffer  size of this module. +>Reads the contents of a file handle strictly, then closes it. ,  !"#$%&'()*+, &'  ()*+!#"%$,  !"#$%&'()*+K      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFG;HIJKL;MNOPQ data-rope-0.3 Data.RopeRopeconssnocheadunconslasttailinitnulllengthmapreverse intercalateempty singletonpackunpackappendinsertindex elemIndex elemIndex' elemIndicesfoldlfoldl'foldrtakedropsplitAt#splitAt breakBytebreakslineshPuthPutStr hPutStrLnputStrputStrLnfromByteString toByteStringreadFilehGethGetLine hGetContentsstrncmpmemchrStringcontentsi0offsetConcatsizeClength_lrleafSizesizebaseGHC.WordWord8deltaratiobalancerotateLrotateRsingleLsingleRdoubleLdoubleRinlinePerformIO GHC.Conc.SyncparfoldlBuf foldlBuf'foldrBufGHC.IO.Handle.TypesHandlefromPtr buildRope