mirror of
https://gitlab.rtems.org/rtems/rtos/rtems.git
synced 2026-09-03 12:39:54 +08:00
score: Import <sys/tree.h> from Newlib
Import <sys/tree.h> from Newlib as <rtems/score/bsd-tree.h> using Newlib commit: commit eb03ac17f16f1bd354482148426353fd35cd879d Author: Sebastian Huber <sebastian.huber@embedded-brains.de> Date: Tue Oct 5 15:53:47 2021 +0200 sys/tree.h: Red child with black sibling rotations Add specialized rotations RB_RED_ROTATE_LEFT() and RB_RED_ROTATE_RIGHT() which may be used if we rotate a red child which has a black sibling. Such a red node must have at least two child nodes so that the following red-black tree invariant is fulfilled: Every path from a given node to any of its descendant NULL nodes goes through the same number of black nodes. PARENT / \ BLACK RED / \ BLACK BLACK Close #5049.
This commit is contained in:
committed by
Chris Johns
parent
34485ccd92
commit
b68ef66b49