summaryrefslogtreecommitdiff
path: root/test/lisp/emacs-lisp/hierarchy-tests.el
diff options
context:
space:
mode:
authorStefan Monnier <monnier@iro.umontreal.ca>2022-10-05 23:52:01 -0400
committerStefan Monnier <monnier@iro.umontreal.ca>2022-10-05 23:52:01 -0400
commit8bd114b98a31a31c1091e937891b369a165add3a (patch)
tree91ab75bbb8f98e28762035857a3081fb986e2a2c /test/lisp/emacs-lisp/hierarchy-tests.el
parenta1f1fdd291a708684262c2494eae5bba32857cd7 (diff)
downloademacs-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/hierarchy-tests.el')
0 files changed, 0 insertions, 0 deletions