Struct mz_compute_types::plan::reduce::AccumulablePlan

pub struct AccumulablePlan {
    pub full_aggrs: Vec<AggregateExpr>,
    pub simple_aggrs: Vec<(usize, usize, AggregateExpr)>,
    pub distinct_aggrs: Vec<(usize, usize, AggregateExpr)>,
}

Plan for computing a set of accumulable aggregations.

We fuse all of the accumulable aggregations together and compute them with one dataflow fragment. We need to be careful to separate out the aggregations that apply only to the distinct set of values. We need to apply a distinct operator to those before we combine them with everything else.

Fields

full_aggrs: Vec<AggregateExpr>

All of the aggregations we were asked to compute, stored in order.

simple_aggrs: Vec<(usize, usize, AggregateExpr)>

All of the non-distinct accumulable aggregates. Each element represents: (index of the aggregation among accumulable aggregations, index of the datum among inputs, aggregation expr) These will all be rendered together in one dataflow fragment.

distinct_aggrs: Vec<(usize, usize, AggregateExpr)>

Same as above but for all of the DISTINCT accumulable aggregations.

Trait Implementations

impl Clone for AccumulablePlan

fn clone(&self) -> AccumulablePlan

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for AccumulablePlan

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for AccumulablePlan

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl DisplayText<PlanRenderingContext<'_, Plan>> for AccumulablePlan

fn fmt_text( &self, f: &mut Formatter<'_>, ctx: &mut PlanRenderingContext<'_, Plan>, ) -> Result

impl Ord for AccumulablePlan

fn cmp(&self, other: &AccumulablePlan) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized + PartialOrd,

Restrict a value to a certain interval.

impl PartialEq for AccumulablePlan

fn eq(&self, other: &AccumulablePlan) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialOrd for AccumulablePlan

fn partial_cmp(&self, other: &AccumulablePlan) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl RustType<ProtoAccumulablePlan> for AccumulablePlan

fn into_proto(&self) -> ProtoAccumulablePlan

Convert a Self into a Proto value.

fn from_proto(proto: ProtoAccumulablePlan) -> Result<Self, TryFromProtoError>

Consume and convert a Proto back into a Self value.

fn into_proto_owned(self) -> Proto

A zero clone version of Self::into_proto that types can optionally implement, otherwise, the default implementation delegates to Self::into_proto.

impl Serialize for AccumulablePlan

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for AccumulablePlan

impl StructuralPartialEq for AccumulablePlan