Struct TrivialLastValueAccumulator 

pub struct TrivialLastValueAccumulator { /* private fields */ }

This accumulator is used when there is no ordering specified for the LAST_VALUE aggregation. It simply updates the last value it sees according to the pre-existing ordering of the input data, and provides a fast path for this case without needing to maintain any ordering state.

Implementations

impl TrivialLastValueAccumulator

pub fn try_new(data_type: &DataType, ignore_nulls: bool) -> Result<Self>

Creates a new TrivialLastValueAccumulator for the given data_type.

Trait Implementations

impl Accumulator for TrivialLastValueAccumulator

fn state(&mut self) -> Result<Vec<ScalarValue>>

Returns the intermediate state of the accumulator, consuming the intermediate state.

fn update_batch(&mut self, values: &[ArrayRef]) -> Result<()>

Updates the accumulator’s state from its input.

fn merge_batch(&mut self, states: &[ArrayRef]) -> Result<()>

Updates the accumulator’s state from an Array containing one or more intermediate values.

fn evaluate(&mut self) -> Result<ScalarValue>

Returns the final aggregate value, consuming the internal state.

fn size(&self) -> usize

Returns the allocated size required for this accumulator, in bytes, including Self.

fn retract_batch( &mut self, _values: &[Arc<dyn Array>], ) -> Result<(), DataFusionError>

Retracts (removed) an update (caused by the given inputs) to accumulator’s state.

fn supports_retract_batch(&self) -> bool

Does the accumulator support incrementally updating its value by removing values.

impl Debug for TrivialLastValueAccumulator

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.