[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Overlays as an AA-tree
From: |
Stefan Monnier |
Subject: |
Re: Overlays as an AA-tree |
Date: |
Mon, 06 Feb 2017 10:06:54 -0500 |
User-agent: |
Gnus/5.13 (Gnus v5.13) Emacs/26.0.50 (gnu/linux) |
> 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.
But you can start with OL1 < OL2 and end with OL1 = OL2.
Admittedly, if you disallow `=` in your comparison the problem should
not occur.
Stefan
- Re: Overlays as an AA-tree, (continued)
- Re: Overlays as an AA-tree, Andreas Politz, 2017/02/21
- Re: Overlays as an AA-tree, Stefan Monnier, 2017/02/21
- Re: Overlays as an AA-tree, Andreas Politz, 2017/02/21
- Re: Overlays as an AA-tree, Stefan Monnier, 2017/02/21
- Re: Overlays as an AA-tree, Andreas Politz, 2017/02/21
- Re: Overlays as an AA-tree, Andreas Politz, 2017/02/24
- Re: Overlays as an AA-tree, Richard Stallman, 2017/02/13
- Re: Overlays as an AA-tree, Andreas Politz, 2017/02/14
- Re: Overlays as an AA-tree, Stefan Monnier, 2017/02/06
- Re: Overlays as an AA-tree, Andreas Politz, 2017/02/06
- Re: Overlays as an AA-tree,
Stefan Monnier <=
- Re: Overlays as an AA-tree, Joakim Jalap, 2017/02/06
- Re: Overlays as an AA-tree, Clément Pit-Claudel, 2017/02/06
Re: Overlays as an AA-tree, Stefan Monnier, 2017/02/03