aboutsummaryrefslogtreecommitdiff
path: root/src/backend/nodes/outfuncs.c
diff options
context:
space:
mode:
authorAlexander Korotkov <akorotkov@postgresql.org>2022-07-08 21:51:26 +0300
committerAlexander Korotkov <akorotkov@postgresql.org>2022-07-08 22:00:03 +0300
commite57519a4637a8d88ae993ac1273d2b59d03a0f75 (patch)
treead7cd9f1f6022ff118b9c6c970ee9be615c31526 /src/backend/nodes/outfuncs.c
parent8d51d7f403c209ab4d5db203f5e350f6c71233ca (diff)
downloadpostgresql-e57519a4637a8d88ae993ac1273d2b59d03a0f75.tar.gz
postgresql-e57519a4637a8d88ae993ac1273d2b59d03a0f75.zip
Add missing inequality searches to rbtree
PostgreSQL contains the implementation of the red-black tree. The red-black tree is the ordered data structure, and one of its advantages is the ability to do inequality searches. This commit adds rbt_find_less() and rbt_find_great() functions implementing these searches. While these searches aren't yet used in the core code, they might be useful for extensions. Discussion: https://postgr.es/m/CAGRrpzYE8-7GCoaPjOiL9T_HY605MRax-2jgTtLq236uksZ1Sw%40mail.gmail.com Author: Steve Chavez, Alexander Korotkov Reviewed-by: Alexander Korotkov
Diffstat (limited to 'src/backend/nodes/outfuncs.c')
0 files changed, 0 insertions, 0 deletions