------ art_28016_26962572.1188870475282 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: 7bit Content-Disposition: inline On 8/31/07, Ruby Quiz <james / grayproductions.net> wrote: > This week's task is to implement the Rope data structure as a Ruby class. I modified my implementation a bit more and provided results along with the other ruby implementations (sorry Mauricio) submitted. The benchmark test I used is attached. It can run the original build/sort that assumes mutable ropes and a build/sort that can also be used with immutable ropes (in addition to mutable ropes). These tests assume that << can only take another rope. I included some testing to ensure the results are correct. I also used the linux /proc/$$/status to get the memory. Mahurin::StringRope is almost the same as my previous submission. The main change was handling a boundary case better so I don't unecessarily concat an empty rope (a < should have been a <