Re: [PATCH 5/8] lib/interval_tree: Fast overlap detection

Am 08.06.2017 um 20:03 schrieb Davidlohr Bueso: Allow interval trees to quickly check for overlaps to avoid unnecesary tree lookups in interval_tree_iter_first(). As of this patch, all interval tree flavors will require using a 'rb_root_cached' such that we can have the leftmost node easily avai

[PATCH 5/8] lib/interval_tree: Fast overlap detection

Allow interval trees to quickly check for overlaps to avoid unnecesary tree lookups in interval_tree_iter_first(). As of this patch, all interval tree flavors will require using a 'rb_root_cached' such that we can have the leftmost node easily available. While most users will make use of this feat