Struct DictionaryRangedUniqueState

pub struct DictionaryRangedUniqueState { /* private fields */ }

A specialized unique kernel for DictionaryArray for when all values are in a small known range.

Implementations

impl DictionaryRangedUniqueState

pub fn new(values: Box<dyn Array>) -> Self

pub fn key_state(&mut self) -> &mut PrimitiveRangedUniqueState<u32>

Trait Implementations

impl RangedUniqueKernel for DictionaryRangedUniqueState

type Array = DictionaryArray<u32>

fn has_seen_all(&self) -> bool

Returns whether all the values in the whole range are in the state

fn append(&mut self, array: &Self::Array)

Append an Array’s values to the State

fn append_state(&mut self, other: &Self)

Append another state into the State

fn finalize_unique(self) -> Self::Array

Consume the state to get the unique elements

fn finalize_n_unique(&self) -> usize

Consume the state to get the number of unique elements including null

fn finalize_n_unique_non_null(&self) -> usize

Consume the state to get the number of unique elements excluding null