pub fn append(&mut self, entry_indexes: Vec<EntryIndex>) {
        let len = entry_indexes.len();
        if len > 0 {
            self.prepare_append(
                entry_indexes[0].index,
                false, /* allow_hole */
                false, /* allow_overwrite */
            );
            self.global_stats.add(LogQueue::Append, len);
            for ei in &entry_indexes {
                self.entry_indexes.push_back(ei.into());
            }
        }
    }
/// Appends some log entries from append queue. Existing entries newer than
/// any of the incoming entries will be deleted silently. Assumes the
/// provided entries have consecutive logical indexes.
///
/// # Panics
///
/// Panics if index of the first entry in `entry_indexes` is greater than
/// largest existing index + 1 (hole).
///
/// Panics if incoming entries contains indexes that might be compacted
/// before (overwrite history).
Appends some log entries from append queue. Existing entries newer than
any of the incoming entries will be deleted silently. Assumes the
provided entries have consecutive logical indexes.
Appends some log entries from append queue . Existing entries newer than any of the incoming entries will be deleted silently . Assumes the provided entries have consecutive logical indexes .
pub fn append(&mut self, entry_indexes: Vec<EntryIndex>) {
        let len = entry_indexes.len();
        if len > 0 {
            self.prepare_append(
                entry_indexes[0].index,
                false, /* allow_hole */
                false, /* allow_overwrite */
            );
            self.global_stats.add(LogQueue::Append, len);
            for ei in &entry_indexes {
                self.entry_indexes.push_back(ei.into());
            }
        }
    }
pub fn append ( & mut self , entry_indexes : Vec < EntryIndex > ) { let len = entry_indexes . len ( ) ; if len > 0 { self . prepare_append ( entry_indexes [ 0 ] . index , false , /* allow_hole */ false , /* allow_overwrite */ ) ; self . global_stats . add ( LogQueue :: Append , len ) ; for ei in & entry_indexes { self . entry_indexes . push_back ( ei . into ( ) ) ; } } }
Appends some log entries from append queue.
Appends some log entries from append queue .
&mut self
entry_indexes
Vec<EntryIndex>
panics
Panics if index of the first entry in `entry_indexes` is greater than
largest existing index + 1 (hole).

Panics if incoming entries contains indexes that might be compacted
before (overwrite history).
Panics if index of the first entry in ` entry_indexes ` is greater than largest existing index + 1 ( hole ) . Panics if incoming entries contains indexes that might be compacted before ( overwrite history ) .