Enum GroupOrdering

pub enum GroupOrdering {
    None,
    Partial(GroupOrderingPartial),
    Full(GroupOrderingFull),
}

Ordering information for each group in the hash table

Variants

None

Groups are not ordered

Partial(GroupOrderingPartial)

Groups are ordered by some pre-set of the group keys

Full(GroupOrderingFull)

Groups are entirely contiguous,

Implementations

impl GroupOrdering

pub fn try_new( input_schema: &Schema, mode: &InputOrderMode, ordering: LexOrderingRef<'_>, ) -> Result<Self>

Create a GroupOrdering for the specified ordering

pub fn emit_to(&self) -> Option<EmitTo>

pub fn input_done(&mut self)

Updates the state the input is done

pub fn remove_groups(&mut self, n: usize)

remove the first n groups from the internal state, shifting all existing indexes down by n

pub fn new_groups( &mut self, batch_group_values: &[ArrayRef], group_indices: &[usize], total_num_groups: usize, ) -> Result<()>

Called when new groups are added in a batch

• total_num_groups: total number of groups (so max group_index is total_num_groups - 1).

• group_values: group key values for each row in the batch

• group_indices: indices for each row in the batch

• hashes: hash values for each row in the batch

pub fn size(&self) -> usize

Return the size of memory used by the ordering state, in bytes

Trait Implementations

impl Debug for GroupOrdering

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

Formats the value using the given formatter.