diff options
| author | Stefan Monnier <monnier@iro.umontreal.ca> | 2022-10-05 23:52:01 -0400 |
|---|---|---|
| committer | Stefan Monnier <monnier@iro.umontreal.ca> | 2022-10-05 23:52:01 -0400 |
| commit | 8bd114b98a31a31c1091e937891b369a165add3a (patch) | |
| tree | 91ab75bbb8f98e28762035857a3081fb986e2a2c /test/lisp/emacs-lisp/bytecomp-tests.el | |
| parent | a1f1fdd291a708684262c2494eae5bba32857cd7 (diff) | |
| download | emacs-8bd114b98a31a31c1091e937891b369a165add3a.tar.gz emacs-8bd114b98a31a31c1091e937891b369a165add3a.tar.bz2 emacs-8bd114b98a31a31c1091e937891b369a165add3a.zip | |
itree.c: Get rid of the trick using null->parent
* src/itree.c (interval_tree_remove_fix): Add a `parent` argument.
Change the loop so it always keeps both `node` and `parent` in sync,
thus avoiding the use of `node->parent` on the initial node (since
that one can be null).
(interval_tree_remove): Manually keep track of the `broken` node's
parent to pass it to `interval_tree_remove_fix`.
Diffstat (limited to 'test/lisp/emacs-lisp/bytecomp-tests.el')
0 files changed, 0 insertions, 0 deletions