The right branch condition in overlap_find_all_i maybe too loose

[fan982]

In the overlap_find_all_i function located in include/interval-tree/interval_tree.hpp, the condition for checking the right branch is if (ptr->right_ && ptr->right_->max() >= ival.low()). This seems overly loose? While it does not cause correctness issues, it may lead to traversing too many unnecessary nodes during the search, potentially impacting performance.

[5cript]

If you have suggestions for improvements, feel free to mention them or possibly by PR.
You are probably right that the ordered nature by the lower bound is underutilized here. I wont get a look at this though before somewhere early next year.