Struct GapFillCacheManager 

pub struct GapFillCacheManager {
    cache: BTreeMap<Vec<u8>, (CompactedRow, RowType)>,
    capacity: usize,
    window_bounds: Option<(Vec<u8>, Vec<u8>)>,
}

A cache for GapFillExecutor that stores a continuous time window of data.

Fields

cache: BTreeMap<Vec<u8>, (CompactedRow, RowType)>

capacity: usize

window_bounds: Option<(Vec<u8>, Vec<u8>)>

The time bounds of the cached window. None if the cache is empty.

Implementations

impl GapFillCacheManager

pub fn new(capacity: usize) -> Self

pub fn contains_time(&self, cache_key: &Vec<u8>) -> bool

Check if the given time is within the current cache window bounds.

pub fn load_window( &mut self, window_data: Vec<(Vec<u8>, CompactedRow, RowType)>, )

Load a continuous window of data into the cache, replacing all existing data.

pub async fn find_prev_original<S: StateStore>( &mut self, target_time: &Vec<u8>, managed_state: &ManagedGapFillState<S>, ) -> StreamExecutorResult<Option<(Vec<u8>, CompactedRow)>>

Finds the closest previous original row, scanning through the StateStore if not in cache.

pub async fn find_next_original<S: StateStore>( &mut self, target_time: &Vec<u8>, managed_state: &ManagedGapFillState<S>, ) -> StreamExecutorResult<Option<(Vec<u8>, CompactedRow)>>

Finds the closest next original row, scanning through the StateStore if not in cache.

pub fn insert( &mut self, cache_key: Vec<u8>, row: CompactedRow, row_type: RowType, )

Inserts a row into the cache, evicting the oldest row if capacity is exceeded.

pub fn remove(&mut self, cache_key: &Vec<u8>) -> Option<(CompactedRow, RowType)>

pub fn sync_clean_cache_entries( &mut self, state_rows_to_delete: &[(OwnedRow, OwnedRow)], managed_state: &ManagedGapFillState<impl StateStore>, )

Removes entries from the cache that are marked for deletion in the state table.

fn find_prev_original_in_cache( &self, cache_key: &Vec<u8>, ) -> Option<(Vec<u8>, CompactedRow)>

Finds the closest previous original row in the cache.

fn find_next_original_in_cache( &self, cache_key: &Vec<u8>, ) -> Option<(Vec<u8>, CompactedRow)>

Finds the closest next original row in the cache.

fn update_window_bounds_for_insert(&mut self, new_key: &Vec<u8>)

Updates window bounds when a new key is inserted.

fn update_window_bounds_after_removal(&mut self)

Updates window bounds after removing entries from the cache.

pub fn scan_filled_rows_between_in_cache<S: StateStore>( &self, start_time: &Vec<u8>, end_time: &Vec<u8>, managed_state: &ManagedGapFillState<S>, ) -> StreamExecutorResult<(Vec<(OwnedRow, OwnedRow)>, bool)>

Scans cache for filled rows between two time points (exclusive).

pub async fn scan_filled_rows_between<S: StateStore>( &self, start_time: &Vec<u8>, end_time: &Vec<u8>, managed_state: &ManagedGapFillState<S>, ) -> StreamExecutorResult<Vec<(OwnedRow, OwnedRow)>>

Trait Implementations

impl EstimateSize for GapFillCacheManager

fn estimated_heap_size(&self) -> usize

The estimated heap size of the current struct in bytes.

fn estimated_size(&self) -> usize

where Self: Sized,

The estimated total size of the current struct in bytes, including the estimated_heap_size and the size of Self.