On Mon, Jan 09, 2006 at 10:11:35AM +0100, Abdel wrote: > Andre Poenitz a écrit : > >On Wed, Jan 04, 2006 at 11:53:45AM +0100, Abdel wrote: > >>From what I see it uses size() and operator[] so deque would be fine > >>here also. But maybe rewriting this patch to use ParagraphList::iterator > >>and algorithm::find would be better, wouldn't it? This way we won't rely > >>on vector property. > > > >We heavily rely on operator[] being reasonably fast, i.e. O(1) > >maybe O(ln n). Certainly not O(n). > > Note that my dual vector-list approach should offer o(1) operator[] access.
I noticed that. That's why the guess: > > [...] Could be even faster than the custom swap-based insert() > > [...] Andre'
