Struct mz_compute_types::plan::reduce::CollationPlan

pub struct CollationPlan {
    pub accumulable: Option<AccumulablePlan>,
    pub hierarchical: Option<HierarchicalPlan>,
    pub basic: Option<BasicPlan>,
    pub aggregate_types: Vec<ReductionType>,
}

Plan for collating the results of computing multiple aggregation types.

TODO: could we express this as a delta join

Fields

accumulable: Option<AccumulablePlan>

Accumulable aggregation results to collate, if any.

hierarchical: Option<HierarchicalPlan>

Hierarchical aggregation results to collate, if any.

basic: Option<BasicPlan>

Basic aggregation results to collate, if any.

aggregate_types: Vec<ReductionType>

When we get results back from each of the different aggregation types, they will be subsequences of the sequence aggregations in the original reduce expression. We keep a map from output position -> reduction type to easily merge results back into the requested order.

Implementations

impl CollationPlan

pub fn as_monotonic(&mut self, must_consolidate: bool)

Upgrades the hierarchical component of the collation plan to monotonic, if necessary, and sets consolidation requirements.

Trait Implementations

impl Clone for CollationPlan

fn clone(&self) -> CollationPlan

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for CollationPlan

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

Formats the value using the given formatter.

impl Default for CollationPlan

fn default() -> CollationPlan

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for CollationPlan

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 CollationPlan

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

impl Ord for CollationPlan

fn cmp(&self, other: &CollationPlan) -> 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 CollationPlan

fn eq(&self, other: &CollationPlan) -> 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 CollationPlan

fn partial_cmp(&self, other: &CollationPlan) -> 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<ProtoCollationPlan> for CollationPlan

fn into_proto(&self) -> ProtoCollationPlan

Convert a Self into a Proto value.

fn from_proto(proto: ProtoCollationPlan) -> 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 CollationPlan

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 CollationPlan

impl StructuralPartialEq for CollationPlan