fn reduced(&self) -> bool {
        let mut non_empty = 0;
        for index in 0..self.merging.len() {
            if self.merging[index].is_double() {
                return false;
            }
            if self.merging[index].len() > 0 {
                non_empty += 1;
            }
            if non_empty > 1 {
                return false;
            }
        }
        true
    }
/// True iff there is at most one non-empty batch in `self.merging`.
///
/// When true, there is no maintenance work to perform in the trace, other
/// than compaction. We do not yet have logic in place to determine if
/// compaction would improve a trace, so for now we are ignoring that.
True iff there is at most one non-empty batch in `self.merging`.
When true, there is no maintenance work to perform in the trace, other
than compaction. We do not yet have logic in place to determine if
compaction would improve a trace, so for now we are ignoring that.
True iff there is at most one non - empty batch in ` self . merging ` . When true there is no maintenance work to perform in the trace other than compaction . We do not yet have logic in place to determine if compaction would improve a trace so for now we are ignoring that .
fn reduced(&self) -> bool {
        let mut non_empty = 0;
        for index in 0..self.merging.len() {
            if self.merging[index].is_double() {
                return false;
            }
            if self.merging[index].len() > 0 {
                non_empty += 1;
            }
            if non_empty > 1 {
                return false;
            }
        }
        true
    }
fn reduced ( & self ) -> bool { let mut non_empty = 0 ; for index in 0 .. self . merging . len ( ) { if self . merging [ index ] . is_double ( ) { return false ; } if self . merging [ index ] . len ( ) > 0 { non_empty += 1 ; } if non_empty > 1 { return false ; } } true }
True iff there is at most one non-empty batch in `self.merging`.
True iff there is at most one non - empty batch in ` self . merging ` .
&self