Struct tikv::storage::raw::store::RawStoreInner

[+] Show declaration

pub struct RawStoreInner<S: Snapshot> {
    snapshot: S,
}

Fields

snapshot: S

Implementations

impl<'a, S: Snapshot> RawStoreInner<S>[−]

pub fn new(snapshot: S) -> Self

pub fn raw_get_key_value(
    &self,
    cf: CfName,
    key: &Key,
    stats: &mut Statistics
) -> Result<Option<Vec<u8>>>

pub async fn forward_raw_scan(
    &'a self,
    cf: CfName,
    start_key: &'a Key,
    limit: usize,
    statistics: &'a mut Statistics,
    option: IterOptions,
    key_only: bool
) -> Result<Vec<Result<KvPair>>>[−]

Scan raw keys in [start_key, end_key), returns at most limit keys. If end_key is None, it means unbounded.

If key_only is true, the value corresponding to the key will not be read. Only scanned keys will be returned.

pub async fn reverse_raw_scan(
    &'a self,
    cf: CfName,
    start_key: &'a Key,
    limit: usize,
    statistics: &'a mut Statistics,
    option: IterOptions,
    key_only: bool
) -> Result<Vec<Result<KvPair>>>[−]

Scan raw keys in [end_key, start_key) in reverse order, returns at most limit keys. If start_key is None, it means it’s unbounded.

If key_only is true, the value corresponding to the key will not be read out. Only scanned keys will be returned.