diff options
| author | Simon Hafner <hafnersimon@gmail.com> | 2015-03-05 14:44:54 -0600 |
|---|---|---|
| committer | Simon Hafner <hafnersimon@gmail.com> | 2015-03-05 14:44:54 -0600 |
| commit | 70eaf92ff0493ed11c6e6c8887bca1b235371aff (patch) | |
| tree | 530255b69df349728c76621e97bf40a11d63fe79 /lib/pure/ropes.nim | |
| parent | f592240c545506448e2bea78a2fa3404c7f46e69 (diff) | |
| parent | 8f43979cf6308c9d7e14a0d87c0faf227e1c4afe (diff) | |
| download | Nim-70eaf92ff0493ed11c6e6c8887bca1b235371aff.tar.gz | |
Merge branch 'devel' into warning-for-result
Diffstat (limited to 'lib/pure/ropes.nim')
| -rw-r--r-- | lib/pure/ropes.nim | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/lib/pure/ropes.nim b/lib/pure/ropes.nim index 995dff2aa..4cc64a154 100644 --- a/lib/pure/ropes.nim +++ b/lib/pure/ropes.nim @@ -43,7 +43,7 @@ proc isConc(r: Rope): bool {.inline.} = return isNil(r.data) # Note that the left and right pointers are not needed for leafs. # Leaves have relatively high memory overhead (~30 bytes on a 32 # bit machine) and we produce many of them. This is why we cache and -# share leafs accross different rope trees. +# share leafs across different rope trees. # To cache them they are inserted in another tree, a splay tree for best # performance. But for the caching tree we use the leaf's left and right # pointers. |