Struct SstConcatIterator 

pub struct SstConcatIterator { /* private fields */ }

Concat multiple iterators ordered in key order and their key ranges do not overlap. We do not want to create the iterators when initializing this iterator to reduce the overhead of seeking.

Implementations

impl SstConcatIterator

pub fn create_and_seek_to_first(sstables: Vec<Arc<SsTable>>) -> Result<Self>

pub fn create_and_seek_to_key( sstables: Vec<Arc<SsTable>>, key: KeySlice<'_>, ) -> Result<Self>

Trait Implementations

impl StorageIterator for SstConcatIterator

type KeyType<'a> = Key<&'a [u8]>

fn key(&self) -> KeySlice<'_>

Get the current key.

fn value(&self) -> &[u8]

Get the current value.

fn is_valid(&self) -> bool

Check if the current iterator is valid.

fn next(&mut self) -> Result<()>

Move to the next position.

fn num_active_iterators(&self) -> usize

Number of underlying active iterators for this iterator.