Struct mz_compute_client::plan::interpret::SingleTimeMonotonic

pub struct SingleTimeMonotonic<'a, T = Timestamp> {
    monotonic_ids: &'a BTreeSet<GlobalId>,
    _phantom: PhantomData<T>,
}

Provides a concrete implementation of an interpreter that determines if the output of Plan expressions is physically monotonic in a single-time dataflow, potentially taking into account judgments about its inputs. We note that in a single-time dataflow, expressions in non-recursive contexts (i.e., outside of LetRec values) process streams that are at a minimum logically monotonic, i.e., may contain retractions but would cease to do so if consolidated. Detecting physical monotonicity, i.e., the absence of retractions in a stream, enables us to disable forced consolidation whenever possible.

Fields

monotonic_ids: &'a BTreeSet<GlobalId>

_phantom: PhantomData<T>

Implementations

impl<'a, T> SingleTimeMonotonic<'a, T>

pub fn new(monotonic_ids: &'a BTreeSet<GlobalId>) -> Self

Instantiates an interpreter for single-time physical monotonicity analysis.

Trait Implementations

impl<'a, T: Debug> Debug for SingleTimeMonotonic<'a, T>

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

Formats the value using the given formatter.

impl<T> Interpreter<T> for SingleTimeMonotonic<'_, T>

type Domain = PhysicallyMonotonic

fn constant( &self, _ctx: &Context<Self::Domain>, rows: &Result<Vec<(Row, T, Diff)>, EvalError> ) -> Self::Domain

fn get( &self, ctx: &Context<Self::Domain>, id: &Id, _keys: &AvailableCollections, _plan: &GetPlan ) -> Self::Domain

fn mfp( &self, _ctx: &Context<Self::Domain>, input: Self::Domain, _mfp: &MapFilterProject, _input_key_val: &Option<(Vec<MirScalarExpr>, Option<Row>)> ) -> Self::Domain

fn flat_map( &self, _ctx: &Context<Self::Domain>, input: Self::Domain, _func: &TableFunc, _exprs: &Vec<MirScalarExpr>, _mfp: &MapFilterProject, _input_key: &Option<Vec<MirScalarExpr>> ) -> Self::Domain

fn join( &self, _ctx: &Context<Self::Domain>, inputs: Vec<Self::Domain>, _plan: &JoinPlan ) -> Self::Domain

fn reduce( &self, ctx: &Context<Self::Domain>, _input: Self::Domain, _key_val_plan: &KeyValPlan, _plan: &ReducePlan, _input_key: &Option<Vec<MirScalarExpr>> ) -> Self::Domain

fn top_k( &self, ctx: &Context<Self::Domain>, _input: Self::Domain, _top_k_plan: &TopKPlan ) -> Self::Domain

fn negate( &self, _ctx: &Context<Self::Domain>, _input: Self::Domain ) -> Self::Domain

fn threshold( &self, ctx: &Context<Self::Domain>, _input: Self::Domain, _threshold_plan: &ThresholdPlan ) -> Self::Domain

fn union( &self, _ctx: &Context<Self::Domain>, inputs: Vec<Self::Domain>, _consolidate_output: bool ) -> Self::Domain

fn arrange_by( &self, _ctx: &Context<Self::Domain>, input: Self::Domain, _forms: &AvailableCollections, _input_key: &Option<Vec<MirScalarExpr>>, _input_mfp: &MapFilterProject ) -> Self::Domain