http://d.puremagic.com/issues/show_bug.cgi?id=5813


bearophile_hugs@eml.cc changed:

           What    |Removed                     |Added
----------------------------------------------------------------------------
                 CC|                            |bearophile_hugs@eml.cc


--- Comment #20 from bearophile_hugs@eml.cc 2012-03-19 15:13:08 PDT ---
(In reply to comment #19)
> https://github.com/D-Programming-Language/phobos/pull/502

> Algorithmically, Appender is implemented using a sealed rope, a linked-list of arrays, with the first node being cached in a thread local free list.

Was a linked-list of arrays better/faster than a dynamic array of pointers to equal-sized memory blocks (decks data structure)?

-- 
Configure issuemail: http://d.puremagic.com/issues/userprefs.cgi?tab=email
------- You are receiving this mail because: -------