[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: Overlays as an AA-tree

From: Joakim Jalap
Subject: Re: Overlays as an AA-tree
Date: Mon, 06 Feb 2017 17:52:52 +0100
User-agent: Gnus/5.13 (Gnus v5.13) Emacs/26.0.50 (berkeley-unix)

Stefan Monnier <address@hidden> writes:

>> Maybe not... but it still sounds a bit expensive to me, spontaneously.
> The number of overlays whose boundary happens to be just at the point of
> insertion is likely to be usually 0, sometimes 1 and very rarely more.

True. Even rarer I guess that they have differing front-advance types.
Still I think finding those overlays, deleting them if they are there
and then reinserting them requires quite a few traversals of the tree.
Maybe it's not a big deal perfomance wise, but I have a feeling the code
could be a bit messy. (But my feelings are eusually not correct)

-- Joakim

reply via email to

[Prev in Thread] Current Thread [Next in Thread]