/// Uses the provided `Interval` to find overlapping intervals in the tree and returns an
/// `IntervalTreeIterator`
Uses the provided `Interval` to find overlapping intervals in the tree and returns an
`IntervalTreeIterator`
Uses the provided ` Interval ` to find overlapping intervals in the tree and returns an ` IntervalTreeIterator `
pub fn find<I: Into<Interval<N>>>(&self, interval: I) -> IntervalTreeIterator<'_, N, D> {
        let interval = interval.into();
        match self.root {
            Some(ref n) => IntervalTreeIterator {
                nodes: vec![n],
                interval,
            },
            None => {
                let nodes = vec![];
                IntervalTreeIterator { nodes, interval }
            }
        }
    }
pub fn find < I : Into < Interval < N > > > ( & self , interval : I ) -> IntervalTreeIterator < ' _ , N , D > { let interval = interval . into ( ) ; match self . root { Some ( ref n ) => IntervalTreeIterator { nodes : vec ! [ n ] , interval , } , None => { let nodes = vec ! [ ] ; IntervalTreeIterator { nodes , interval } } } }
Uses the provided `Interval` to find overlapping intervals in the tree and returns an
`IntervalTreeIterator`
Uses the provided ` Interval ` to find overlapping intervals in the tree and returns an ` IntervalTreeIterator `
&self
interval
I