Struct RankState 

pub(super) struct RankState<RF: RankFuncCount> {
    first_key: Option<StateKey>,
    buffer: EstimatedVecDeque<StateKey>,
    func_state: RF,
    _phantom: PhantomData<RF>,
}

Generic state for rank window functions including row_number, rank and dense_rank.

Fields

first_key: Option<StateKey>

First state key of the partition.

buffer: EstimatedVecDeque<StateKey>

State keys that are waiting to be outputted.

func_state: RF

Function-specific state.

_phantom: PhantomData<RF>

Implementations

impl<RF: RankFuncCount> RankState<RF>

pub fn new(_call: &WindowFuncCall) -> Self

fn slide_inner(&mut self) -> (i64, StateEvictHint)

Trait Implementations

impl<RF: RankFuncCount + EstimateSize> EstimateSize for RankState<RF>

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.

impl<RF: RankFuncCount> WindowState for RankState<RF>

fn append(&mut self, key: StateKey, _args: SmallVec<[Datum; 2]>)

Append a new input row to the state. The key is expected to be increasing.

fn curr_window(&self) -> StatePos<'_>

Get the current window frame position.

fn slide(&mut self) -> Result<(Datum, StateEvictHint)>

Slide the window frame forward and collect the output and evict hint. Similar to Iterator::next.

fn slide_no_output(&mut self) -> Result<StateEvictHint>

Slide the window frame forward and collect the evict hint. Don’t calculate the output if possible.