fn reduce_uncommitted_size(&mut self, ents: &[Entry]) {
        if self.uncommitted_size == 0 {
            // Fast-path for followers, who do not track or enforce the limit.
            return;
        }
        let s = ents
            .iter()
            .fold(0, |acc, entry| acc + entry.get_Data().len());
        if s as u64 > self.uncommitted_size {
            self.uncommitted_size = 0;
        } else {
            self.uncommitted_size -= s as u64;
        }
    }
// accounts for the newly committed entries by decreasing
// the uncommitted entry size limit.
accounts for the newly committed entries by decreasing
the uncommitted entry size limit.
accounts for the newly committed entries by decreasing the uncommitted entry size limit .
fn reduce_uncommitted_size(&mut self, ents: &[Entry]) {
        if self.uncommitted_size == 0 {
            // Fast-path for followers, who do not track or enforce the limit.
            return;
        }
        let s = ents
            .iter()
            .fold(0, |acc, entry| acc + entry.get_Data().len());
        if s as u64 > self.uncommitted_size {
            self.uncommitted_size = 0;
        } else {
            self.uncommitted_size -= s as u64;
        }
    }
fn reduce_uncommitted_size ( & mut self , ents : & [ Entry ] ) { if self . uncommitted_size == 0 { // Fast-path for followers, who do not track or enforce the limit. return ; } let s = ents . iter ( ) . fold ( 0 , | acc , entry | acc + entry . get_Data ( ) . len ( ) ) ; if s as u64 > self . uncommitted_size { self . uncommitted_size = 0 ; } else { self . uncommitted_size -= s as u64 ; } }
accounts for the newly committed entries by decreasing
the uncommitted entry size limit.
accounts for the newly committed entries by decreasing the uncommitted entry size limit .
&mut self
ents
&[Entry]