Re: Overlays as an AA-tree

[Andreas Politz]

Stefan Monnier <address@hidden> writes:

>> And here I thought it was rather an elegant solution :) (to the problem
>> of one overlay's beg going past another's because of an insert).
>
> It doesn't solve the problem of updating the tree after
> a deletion (where some overlays may suddenly end up at the same place,
> so the tree will also need some amount of reorganization).


Why ? If the tree is sorted by begin only, deletions won't break the
tree order.  Only insertions with 2 or more overlays at the same
position and different front-advance types may do so.  Unless I missed
something.

-ap