pub fn insert<I: Into<Interval<N>>>(&mut self, interval: I, data: D) {
        let interval = interval.into();
        match self.root {
            Some(ref mut n) => n.insert(interval, data),
            None => self.root = Some(Node::new(interval, data)),
        };
    }
/// Inserts an `Interval` into the tree and associates it with `data`
Inserts an `Interval` into the tree and associates it with `data`
Inserts an ` Interval ` into the tree and associates it with ` data `
pub fn insert<I: Into<Interval<N>>>(&mut self, interval: I, data: D) {
        let interval = interval.into();
        match self.root {
            Some(ref mut n) => n.insert(interval, data),
            None => self.root = Some(Node::new(interval, data)),
        };
    }
pub fn insert < I : Into < Interval < N > > > ( & mut self , interval : I , data : D ) { let interval = interval . into ( ) ; match self . root { Some ( ref mut n ) => n . insert ( interval , data ) , None => self . root = Some ( Node :: new ( interval , data ) ) , } ; }
Inserts an `Interval` into the tree and associates it with `data`
Inserts an ` Interval ` into the tree and associates it with ` data `
&mut self
interval
I
data
D
&mut self
interval
I
data
D