úÎ: 5|6      !"#$%&'()*+,-./012345     L67 89:;<=>?@ABCDE6leafLen 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  . FO(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 G into a   O(n) Convert a list of G 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. HIJKLMNOPQO(log n) returns the G 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 R).  O(n) Same as , but explores the   sequentially. Useful for   s loaded lazily with 2. 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. S" O(n). like ! but strict. T#DO(n). Right fold. Again not tail-recursive but never uses more than  O(log n) on the stack. U$%&' 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 R. *O(n). Satisfies lines r == breaks 0x0a r. +Writes the contents of the   on the specified V. , 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 WAfromPtr encapsule un pointeur, un offset et une longueur dans un Rope.. 0O(n) Conversion from a strict  ByteString 1O(n) Conversion to a strict  ByteString 2Lazy file reading, using mmap. 3,Strict hGet. The whole rope is constructed. X4#Returns the next line in the input V. If you need to iterate 4, # it may be more efficient to first mmap the file using 2, or even load  it with then iterate  ( 0x0a : 4% 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. 5>Reads the contents of a file handle strictly, then closes it. ,  !"#$%&'()*+,-./012345, 01  !"#$%&'()* 2345+-,/.,  !"#$%&'()*+,-./012345Y      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVJWXYZ[J\]^_` Data-Rope-0.2Data.Rope.Internals Data.Ropec_munmapc_mmap c_PROT_NONE c_PROT_READ c_PROT_WRITE c_PROT_EXEC c_MAP_SHARED c_MAP_FILEw2cc2wRopeconssnocheadunconslasttailinitnulllengthmapreverse intercalateempty singletonpackunpackappendinsertindex elemIndex elemIndex' elemIndicesfoldlfoldl'foldrtakedropsplitAt#splitAt breakBytebreakslineshPuthPutStr hPutStrLnputStrputStrLnfromByteString toByteStringreadFilehGethGetLine hGetContentsstrncmpmemchrFilehandlepositionropeStringcontentsi0offsetConcatsizeClength_lrleafSizesizebaseGHC.WordWord8deltaratiobalancerotateLrotateRsingleLsingleRdoubleLdoubleRinlinePerformIO GHC.Conc.SyncparfoldlBuf foldlBuf'foldrBufGHC.IO.Handle.TypesHandlefromPtr buildRope