Struct RowsWindow 

pub(super) struct RowsWindow<K: Ord, V: Clone> {
    frame_bounds: RowsFrameBounds,
    _phantom: PhantomData<K>,
    _phantom2: PhantomData<V>,
}

The sliding window implementation for ROWS frames.

Fields

frame_bounds: RowsFrameBounds

_phantom: PhantomData<K>

_phantom2: PhantomData<V>

Implementations

impl<K: Ord, V: Clone> RowsWindow<K, V>

pub fn new(frame_bounds: RowsFrameBounds) -> Self

Trait Implementations

impl<K: Ord, V: Clone> WindowImpl for RowsWindow<K, V>

type Key = K

type Value = V

fn preceding_saturated( &self, window: BufferRef<'_, Self::Key, Self::Value>, ) -> bool

Whether the preceding half of the current window is saturated. By “saturated” we mean that every row that is possible to be in the preceding half of the current window is already in the buffer.

fn following_saturated( &self, window: BufferRef<'_, Self::Key, Self::Value>, ) -> bool

Whether the following half of the current window is saturated.

fn recalculate_left_right( &mut self, window: BufferRefMut<'_, Self::Key, Self::Value>, _hint: RecalculateHint, )

Recalculate the left and right indices of the current window, according to the latest curr_idx and the hint.

fn shift_indices(&mut self, _n: usize)

Shift the indices stored by the WindowImpl by n positions. This should be called after evicting rows from the buffer.