Struct tidb_query_common::storage::scanner::RangesScanner

[+] Show declaration

pub struct RangesScanner<T> {
    storage: T,
    ranges_iter: RangesIterator,
    scan_backward_in_range: bool,
    is_key_only: bool,
    scanned_rows_per_range: Vec<usize>,
    is_scanned_range_aware: bool,
    current_range: IntervalRange,
    working_range_begin_key: Vec<u8>,
    working_range_end_key: Vec<u8>,
}

[−] Expand description

A scanner that scans over multiple ranges. Each range can be a point range containing only one row, or an interval range containing multiple rows.

Fields

storage: T

ranges_iter: RangesIterator

scan_backward_in_range: bool

is_key_only: bool

scanned_rows_per_range: Vec<usize>

is_scanned_range_aware: bool

current_range: IntervalRange

working_range_begin_key: Vec<u8>

working_range_end_key: Vec<u8>

Implementations

impl<T: Storage> RangesScanner<T>[−]

pub fn new(_: RangesScannerOptions<T>) -> RangesScanner<T>

pub fn next(&mut self) -> Result<Option<OwnedKvPair>, StorageError>[−]

Fetches next row.

pub fn collect_storage_stats(&mut self, dest: &mut T::Statistics)[−]

Appends storage statistics collected so far to the given container and clears the collected statistics.

pub fn collect_scanned_rows_per_range(&mut self, dest: &mut Vec<usize>)[−]

Appends scanned rows of each range so far to the given container and clears the collected statistics.

pub fn take_scanned_range(&mut self) -> IntervalRange[−]

Returns scanned range since last call.

pub fn can_be_cached(&self) -> bool

fn update_scanned_range_from_new_point(&mut self, point: &PointRange)

fn update_scanned_range_from_new_range(&mut self, range: &IntervalRange)

fn update_working_range_begin_key(&mut self)

fn update_working_range_end_key(&mut self)

fn update_scanned_range_from_scanned_row(
    &mut self,
    some_row: &Option<OwnedKvPair>
)