Struct BlockStreamIterator

pub struct BlockStreamIterator {
    block_stream: Option<BlockDataStream>,
    next_block_index: usize,
    sstable: TableHolder,
    iter: Option<BlockIterator>,
    task_progress: Arc<TaskProgress>,
    sstable_store: SstableStoreRef,
    sstable_info: SstableInfo,
    io_retry_times: usize,
    max_io_retry_times: usize,
    stats_ptr: Arc<AtomicU64>,
}

Iterates over the KV-pairs of an SST while downloading it.

Fields

block_stream: Option<BlockDataStream>

The downloading stream.

next_block_index: usize

sstable: TableHolder

For key sanity check of divided SST and debugging

iter: Option<BlockIterator>

task_progress: Arc<TaskProgress>

sstable_store: SstableStoreRef

sstable_info: SstableInfo

io_retry_times: usize

max_io_retry_times: usize

stats_ptr: Arc<AtomicU64>

Implementations

impl BlockStreamIterator

pub fn new( sstable: TableHolder, task_progress: Arc<TaskProgress>, sstable_store: SstableStoreRef, sstable_info: SstableInfo, max_io_retry_times: usize, stats_ptr: Arc<AtomicU64>, ) -> Self

Initialises a new BlockStreamIterator which iterates over the given BlockDataStream. The iterator reads at most max_block_count from the stream.

async fn create_stream(&mut self) -> HummockResult<()>

pub(crate) async fn download_next_block( &mut self, ) -> HummockResult<Option<(Bytes, Vec<u8>, BlockMeta)>>

Wrapper function for self.block_stream.next() which allows us to measure the time needed.

pub(crate) fn init_block_iter( &mut self, buf: Bytes, uncompressed_capacity: usize, ) -> HummockResult<()>

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

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

fn current_block_largest(&self) -> Vec<u8>

fn key(&self) -> FullKey<&[u8]>

pub(crate) fn is_valid(&self) -> bool

Trait Implementations

impl Drop for BlockStreamIterator

fn drop(&mut self)

Executes the destructor for this type.