RE : Piece Table with O(log(n)) operations

From: Joaquin Cuenca Abela (e98cuenc@free.fr)
Date: Mon Jan 06 2003 - 18:17:10 EST

  • Next message: Martin Sevior: "Re: RE : Piece Table with O(log(n)) operations"

    Martin wrote:
    >
    > On Sat, 4 Jan 2003, Joaquin Cuenca Abela wrote:
    >
    > > I've find a way to get O(log(n)) as the worst case with any
    > operation
    > > on the piece table. I've put a description in
    > > http://e98cuenc.free.fr/wordprocessor/piecetable.html
    > >
    > > The main affected class will be pf_Fragments. In the web
    > page (still
    > > not finished) I discuss all the gory details.
    > >
    >
    > This is a extremely interesting Joaquin and is very, very cool :-)
    >
    > I start to see peicetable performance issues when dealling
    > with documents
    > of about 100 pages or larger right now. Particularly when typing or
    > deleting. You new code would certainly fix those!
    >
    > I haven't looked through your code yet but I assume you rewritten the
    > setNext()/getNext()/setPrev()/getPrev()/getPos() methods in the
    > piecetable? Right?

    Just for the record, roughly setNext() is my insertRight(), getNext() is
    ++, setPrev() is insertLeft(), getPrev() is -- and getPos is
    documentPosition().

    Cheers,

    This archive was generated by hypermail 2.1.4 : Mon Jan 06 2003 - 18:21:38 EST