Willy Tarreau d1d55ac619 MEDIUM: ebtree: only consider the branches matching the scope in lookups ... Now when looking up a node via eb32sc_first(), eb32sc_next(), and eb32sc_lookup_ge(), we only focus on the branches matching the requested scope. The code must be careful to miss no branch. It changes a little bit from the previous one because the scope stored on the intermediary nodes is not exact (since we don't propagate upwards during deletion), so in case a lookup fails, we have to walk up and pick the next matching entry.		2017-11-06 11:20:11 +01:00
..
compiler.h
eb32sctree.c	MEDIUM: ebtree: only consider the branches matching the scope in lookups	2017-11-06 11:20:11 +01:00
eb32sctree.h	MEDIUM: ebtree: only consider the branches matching the scope in lookups	2017-11-06 11:20:11 +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
LICENSE