pub fn longest_pending_span(&self) -> Range<usize> {
        let mut start = 0;
        let mut range = 0..0;

        // Find the longest span of pending datoms.
        for i in 0..self.children.len() {
            if self.is_midpoint_at(i) {
                let len = i - start;
                if len > range.len() {
                    range = start..i;
                }
                start = i + 1;
            }
        }

        range
    }
/// Return the longest span of pending datoms.
///
/// The returned range can be safely used to index into `datoms`. The child
/// node into which the datoms need to be flushed is `children[range.end]`.
Return the longest span of pending datoms.
The returned range can be safely used to index into `datoms`. The child
node into which the datoms need to be flushed is `children[range.end]`.
Return the longest span of pending datoms . The returned range can be safely used to index into ` datoms ` . The child node into which the datoms need to be flushed is ` children [ range . end ] ` .
pub fn longest_pending_span(&self) -> Range<usize> {
        let mut start = 0;
        let mut range = 0..0;
        // Find the longest span of pending datoms.
        for i in 0..self.children.len() {
            if self.is_midpoint_at(i) {
                let len = i - start;
                if len > range.len() {
                    range = start..i;
                }
                start = i + 1;
            }
        }
        range
    }
pub fn longest_pending_span ( & self ) -> Range < usize > { let mut start = 0 ; let mut range = 0 .. 0 ; // Find the longest span of pending datoms. for i in 0 .. self . children . len ( ) { if self . is_midpoint_at ( i ) { let len = i - start ; if len > range . len ( ) { range = start .. i ; } start = i + 1 ; } } range }
Return the longest span of pending datoms.
Return the longest span of pending datoms .
&self
&self