pub fn return_interval(&mut self, interval_start: usize, mut interval_len: usize) {
        // Merge at front of other interval if possible.
        interval_len += self.remove(interval_start + interval_len).unwrap_or(0);

        // Extend the end of other interval if possible.
        if !self.extend_if_found(interval_start, interval_len) {
            // There was no interval that could be extended. Insert a new one.
            self.insert(interval_start, interval_len);
        }
    }
/// Returns a free interval to the tree.
Returns a free interval to the tree.
Returns a free interval to the tree .
pub fn return_interval(&mut self, interval_start: usize, mut interval_len: usize) {
        // Merge at front of other interval if possible.
        interval_len += self.remove(interval_start + interval_len).unwrap_or(0);
        // Extend the end of other interval if possible.
        if !self.extend_if_found(interval_start, interval_len) {
            // There was no interval that could be extended. Insert a new one.
            self.insert(interval_start, interval_len);
        }
    }
pub fn return_interval ( & mut self , interval_start : usize , mut interval_len : usize ) { // Merge at front of other interval if possible. interval_len += self . remove ( interval_start + interval_len ) . unwrap_or ( 0 ) ; // Extend the end of other interval if possible. if ! self . extend_if_found ( interval_start , interval_len ) { // There was no interval that could be extended. Insert a new one. self . insert ( interval_start , interval_len ) ; } }
Returns a free interval to the tree.
Returns a free interval to the tree .
&mut self
interval_start
usize
interval_len
usize
&mut self
interval_start
usize
interval_len
usize