úÎ0{,/1      !"#$%&'()*+,-./0I123456789:;<=>?@6leafLen 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 . AO(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 B into a  O(n) Convert a list of B 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. CDEFGHIJKLO(log n) returns the B 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 M). 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. N O(n). like  but strict. O DO(n). Right fold. Again not tail-recursive but never uses more than  O(log n) on the stack. P!"#$ 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 M. 'O(n). Satisfies lines r == breaks 0x0a r. (Writes the contents of the  on the specified Q. ) 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 R-O(n) Conversion from a strict  ByteString .O(n) Conversion to a strict  ByteString /Lazy file reading, using mmap. 0,Strict hGet. The whole rope is constructed. S)  !"#$%&'()*+,-./0)-.   !"#$%&'/0(*),+)  !"#$%&'()*+,-./0T      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQERSTUVEWXYZ[ Data-Rope-0.1Data.Rope.Internals Data.Ropec_munmapc_mmap c_PROT_NONE c_PROT_READ c_PROT_WRITE c_PROT_EXEC c_MAP_SHARED c_MAP_FILERopeconssnocheadunconslasttailinitnulllengthmapreverse intercalateempty singletonpackunpackappendinsertindex elemIndex elemIndicesfoldlfoldl'foldrtakedropsplitAt#splitAt breakBytebreakslineshPuthPutStr hPutStrLnputStrputStrLnfromByteString toByteStringreadFilehGetstrncmpmemchrFilehandlepositionropeStringcontentsi0offsetConcatsizeClength_lrleafSizesizebaseGHC.WordWord8deltaratiobalancerotateLrotateRsingleLsingleRdoubleLdoubleRinlinePerformIOGHC.ConcparfoldlBuf foldlBuf'foldrBufGHC.IO.Handle.TypesHandlefromPtr buildRope