Remove pre-order and post-order traversal logic for red-black trees.

Tom Lane <tgl@sss.pgh.pa.us>

Commit: f80e782a6b4dcdea78f053f1505fff316f3a3289
Author: Tom Lane <tgl@sss.pgh.pa.us>
Date: 2017-09-10T17:19:11Z
Releases: 11.0
Remove pre-order and post-order traversal logic for red-black trees.

This code isn't used, and there's no clear reason why anybody would ever
want to use it.  These traversal mechanisms don't yield a visitation order
that is semantically meaningful for any external purpose, nor are they
any faster or simpler than the left-to-right or right-to-left traversals.
(In fact, some rough testing suggests they are slower :-(.)  Moreover,
these mechanisms are impossible to test in any arm's-length fashion; doing
so requires knowledge of the red-black tree's internal implementation.
Hence, let's just jettison them.

Discussion: https://postgr.es/m/17735.1505003111@sss.pgh.pa.us

Files

PathChange+/−
src/backend/lib/rbtree.c modified +2 −127
src/include/lib/rbtree.h modified +1 −4

Discussion