haproxy/ebtree
Willy Tarreau cfaa6e7ef3 MINOR: ebtree/scope: simplify the lookup functions by using eb32sc_next_with_parent()
This gets rid of the nasty loop we used to have at the end of the lookup
function and instead falls back to the normal walk down code.
2017-11-13 19:34:09 +01:00
..
LICENSE
compiler.h
eb32sctree.c MINOR: ebtree/scope: simplify the lookup functions by using eb32sc_next_with_parent() 2017-11-13 19:34:09 +01:00
eb32sctree.h MINOR: ebtree/scope: add a function to find next node from a parent 2017-11-13 19:34:09 +01:00
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 MINOR: protect ebimtree/ebistree against multiple inclusions 2014-03-15 07:48:25 +01:00
ebistree.c
ebistree.h MINOR: protect ebimtree/ebistree against multiple inclusions 2014-03-15 07:48:25 +01:00
ebmbtree.c
ebmbtree.h DOC: ebtree: indicate that prefix insertion/lookup may be used with strings 2014-05-10 08:36:19 +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 OPTIM: ebtree: pack the struct eb_node to avoid holes on 64-bit 2013-12-07 01:36:08 +01:00