1
0
mirror of http://git.haproxy.org/git/haproxy.git/ synced 2025-03-04 02:19:09 +00:00
haproxy/ebtree
Willy Tarreau 2b5702030d MINOR: ebtree: add new eb_next_dup/eb_prev_dup() functions to visit duplicates
Sometimes it's very useful to visit duplicates of a same node, but doing
so from the application is not convenient because keys have to be compared,
while all the information is available during the next/prev steps.

Let's introduce a couple of new eb_next_dup/eb_prev_dup functions to visit
only duplicates of the current node and return NULL once it's done. Now we
have all 3 combinations :
  - next        : returns next node in the tree
  - next_dup    : returns next dup in the sub-tree
  - next_unique : returns next value after skipping dups

(cherry picked from commit 3327b8ae6866f3878322a1a29e70b450226d216d)
2013-05-07 16:10:02 +02:00
..
compiler.h
eb32tree.c
eb32tree.h MINOR: ebtree: add new eb_next_dup/eb_prev_dup() functions to visit duplicates 2013-05-07 16:10:02 +02:00
eb64tree.c
eb64tree.h MINOR: ebtree: add new eb_next_dup/eb_prev_dup() functions to visit duplicates 2013-05-07 16:10:02 +02:00
ebimtree.c
ebimtree.h
ebistree.c
ebistree.h
ebmbtree.c
ebmbtree.h MINOR: ebtree: add new eb_next_dup/eb_prev_dup() functions to visit duplicates 2013-05-07 16:10:02 +02:00
ebpttree.c
ebpttree.h MINOR: ebtree: add new eb_next_dup/eb_prev_dup() functions to visit duplicates 2013-05-07 16:10:02 +02:00
ebsttree.c
ebsttree.h
ebtree.c
ebtree.h MINOR: ebtree: add new eb_next_dup/eb_prev_dup() functions to visit duplicates 2013-05-07 16:10:02 +02:00
LICENSE