On Thu, Jul 21, 2005 at 12:30:09PM +0100, Angus Leeming wrote: > Lars Gullik Bjønnes wrote: > > ... Actually... since we are not _really_ working on the front it > > won't be much faster. std::list otoh would be fast. > > In this case, maybe. But André moved to a vector to store the paragraphs > because his profiling tests showed it to be quicker in most common > operations.
I remember something like that. Moreover, std::list will have O(n) 'random access', I am not sure this will play nice with the current iterator/cursor implementation. Apart from that, my first shot would be re-implementing erase() to shift the pimpl pointes down and delete a single one of them instead of instead of con- and destructing O(n) of them... Andre'
