Get overlapping boundaries in tree

[guillemcortes]

Hi, I've gone through the code and haven't found how can I do this. Any help would be appreciated.
If I have the following tree:
{Interval(0.0, 4.0, ('a')), Interval(0.5 ,10.0, ('b'))}
I want to obtain the interval (0.5, 4.0). How can I do that?

---

The big picture of this problem is that splitting the overlaps of the tree above would result in 3 intervals (0.0, 0.5), (0.5, 4.0) and (4.0, 10.0). What I really want to do is merge only the full-overlapping interval i.e. (0.5, 4.0) with one of the other intervals based on what's in data i.e. ('a'), ('b').

Thank you