Struct mz_compute_types::plan::reduce::MonotonicPlan

pub struct MonotonicPlan {
    pub aggr_funcs: Vec<AggregateFunc>,
    pub skips: Vec<usize>,
    pub must_consolidate: bool,
}

Plan for computing a set of hierarchical aggregations with a monotonic input.

Here, the aggregations will be rendered in place. We don’t need to worry about retractions because the inputs are append only, so we can change our computation to only retain the “best” value in the diff field, instead of holding onto all values.

Fields

aggr_funcs: Vec<AggregateFunc>

All of the aggregations we were asked to compute.

skips: Vec<usize>

Set of “skips” or calls to nth() an iterator needs to do over the input to extract the relevant datums.

must_consolidate: bool

True if the input is not physically monotonic, and the operator must perform consolidation to remove potential negations. The operator implementation is free to consolidate as late as possible while ensuring correctness, so it is not a requirement that the input be directly subjected to consolidation. More details in the monotonic one-shot SELECTs design doc.[^1]

[^1] https://github.com/MaterializeInc/materialize/blob/main/doc/developer/design/20230421_stabilize_monotonic_select.md

Trait Implementations

impl Clone for MonotonicPlan

fn clone(&self) -> MonotonicPlan

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for MonotonicPlan

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for MonotonicPlan

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Ord for MonotonicPlan

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

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

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

fn into_proto(&self) -> ProtoMonotonicPlan

Convert a Self into a Proto value.

fn from_proto(proto: ProtoMonotonicPlan) -> 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 MonotonicPlan

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 MonotonicPlan

impl StructuralPartialEq for MonotonicPlan