postgresql/src/test/modules/test_rbtree
Bruce Momjian 29275b1d17 Update copyright for 2024
Reported-by: Michael Paquier

Discussion: https://postgr.es/m/ZZKTDPxBBMt3C0J9@paquier.xyz

Backpatch-through: 12
2024-01-03 20:49:05 -05:00
..
expected Add a test harness for the red-black tree code. 2017-09-10 13:26:46 -04:00
sql Add a test harness for the red-black tree code. 2017-09-10 13:26:46 -04:00
.gitignore Add a test harness for the red-black tree code. 2017-09-10 13:26:46 -04:00
Makefile Split all OBJS style lines in makefiles into one-line-per-entry style. 2019-11-05 14:41:07 -08:00
README Add a test harness for the red-black tree code. 2017-09-10 13:26:46 -04:00
meson.build Update copyright for 2024 2024-01-03 20:49:05 -05:00
test_rbtree--1.0.sql Add a test harness for the red-black tree code. 2017-09-10 13:26:46 -04:00
test_rbtree.c Update copyright for 2024 2024-01-03 20:49:05 -05:00
test_rbtree.control Add a test harness for the red-black tree code. 2017-09-10 13:26:46 -04:00

README

test_rbtree is a test module for checking the correctness of red-black
tree operations.

These tests are performed on red-black trees that store integers.
Since the rbtree logic treats the comparison function as a black
box, it shouldn't be important exactly what the key type is.

Checking the correctness of traversals is based on the fact that a red-black
tree is a binary search tree, so the elements should be visited in increasing
(for Left-Current-Right) or decreasing (for Right-Current-Left) order.

Also, this module does some checks of the correctness of the find, delete
and leftmost operations.