Struct WindowBuffer 

pub(super) struct WindowBuffer<W: WindowImpl> {
    window_impl: W,
    frame_exclusion: FrameExclusion,
    buffer: VecDeque<Entry<W::Key, W::Value>>,
    curr_idx: usize,
    left_idx: usize,
    right_excl_idx: usize,
    curr_delta: Option<Vec<(Op, W::Value)>>,
}

A common sliding window buffer.

Fields

window_impl: W

frame_exclusion: FrameExclusion

buffer: VecDeque<Entry<W::Key, W::Value>>

curr_idx: usize

left_idx: usize

right_excl_idx: usize

curr_delta: Option<Vec<(Op, W::Value)>>

Implementations

impl<W: WindowImpl> WindowBuffer<W>

pub fn new( window_impl: W, frame_exclusion: FrameExclusion, enable_delta: bool, ) -> Self

pub fn smallest_key(&self) -> Option<&W::Key>

Get the smallest key that is still kept in the buffer. Returns None if there’s nothing yet.

pub fn curr_key(&self) -> Option<&W::Key>

Get the key part of the current row.

pub fn curr_window(&self) -> CurrWindow<'_, W::Key>

Get the current window info.

fn curr_window_outer(&self) -> Range<usize>

fn curr_window_exclusion(&self) -> Range<usize>

fn curr_window_ranges(&self) -> (Range<usize>, Range<usize>)

pub fn curr_window_values(&self) -> impl DoubleEndedIterator<Item = &W::Value>

Iterate over values in the current window.

pub fn consume_curr_window_values_delta( &mut self, ) -> impl Iterator<Item = (Op, W::Value)> + '_

Consume the delta of values comparing the current window to the previous window. The delta is not guaranteed to be sorted, especially when frame exclusion is not NoOthers.

pub fn append(&mut self, key: W::Key, value: W::Value)

Append a key-value pair to the buffer.

pub fn slide(&mut self) -> impl Iterator<Item = (W::Key, W::Value)> + '_

Slide the current window forward. Returns the keys that are removed from the buffer.

fn maintain_delta(&mut self, old_outer: Range<usize>, new_outer: Range<usize>)

fn recalculate_left_right(&mut self, hint: RecalculateHint)