pub fn merge_newer_neighbor(&self, mut rhs: Self) {
        for slot in rhs.slots.iter_mut() {
            for (raft_group_id, memtable) in slot.write().drain() {
                self.get_or_insert(raft_group_id)
                    .write()
                    .merge_newer_neighbor(memtable.write().borrow_mut());
            }
        }
        // Discarding neighbor's tombstones, they will be applied by
        // `MemTableRecoverContext`.
    }
/// Merges with a newer neighbor [`MemTableAccessor`].
///
/// This method is only used for recovery.
Merges with a newer neighbor [`MemTableAccessor`].
This method is only used for recovery.
Merges with a newer neighbor [ ` MemTableAccessor ` ] . This method is only used for recovery .
pub fn merge_newer_neighbor(&self, mut rhs: Self) {
        for slot in rhs.slots.iter_mut() {
            for (raft_group_id, memtable) in slot.write().drain() {
                self.get_or_insert(raft_group_id)
                    .write()
                    .merge_newer_neighbor(memtable.write().borrow_mut());
            }
        }
        // Discarding neighbor's tombstones, they will be applied by
        // `MemTableRecoverContext`.
    }
pub fn merge_newer_neighbor ( & self , mut rhs : Self ) { for slot in rhs . slots . iter_mut ( ) { for ( raft_group_id , memtable ) in slot . write ( ) . drain ( ) { self . get_or_insert ( raft_group_id ) . write ( ) . merge_newer_neighbor ( memtable . write ( ) . borrow_mut ( ) ) ; } } // Discarding neighbor's tombstones, they will be applied by // `MemTableRecoverContext`. }
Merges with a newer neighbor [`MemTableAccessor`].
Merges with a newer neighbor [ ` MemTableAccessor ` ] .
&self
rhs
Self