Struct MatchRecognizeNode 

pub struct MatchRecognizeNode {
    pub partition_by: Vec<u32>,
    pub order_by: Vec<ColumnOrder>,
    pub measures: Vec<MatchRecognizeMeasure>,
    pub defines: Vec<MatchRecognizeDefine>,
    pub pattern_node: Option<MatchRecognizePatternNode>,
    pub state_table: Option<Table>,
    pub after_match_skip: Option<MatchRecognizeAfterMatchSkip>,
    pub within: Option<ExprNode>,
    pub within_deadline: Option<ExprNode>,
    pub input_mode: i32,
}

SQL:2016 MATCH_RECOGNIZE (row pattern recognition). v1: append-only input, ONE ROW PER MATCH. PARTITION BY / ORDER BY are input column indices.

Fields

partition_by: Vec<u32>

order_by: Vec<ColumnOrder>

ORDER BY keys, carried as ColumnOrder like every other ordered streaming node. v1 only supports the default ascending order (the binder rejects DESC / explicit NULLS); the executor asserts it.

measures: Vec<MatchRecognizeMeasure>

defines: Vec<MatchRecognizeDefine>

pattern_node: Option<MatchRecognizePatternNode>

The PATTERN clause as a structured tree (the v1 subset: variables, concatenation, alternation, quantification and PERMUTE; anchors and exclusions are rejected at parse time). Field 7 previously carried the pattern as text; it is now reserved.

state_table: Option<Table>

Rows referenced by live partial matches, keyed (partition…, order…, seq): the retained window the matcher re-feeds on recovery. Input arrives already ordered (see input_mode), so this holds only what live matches still need – there is no out-of-order buffer here.

after_match_skip: Option<MatchRecognizeAfterMatchSkip>

AFTER MATCH SKIP strategy.

within: Option<ExprNode>

WITHIN span check: a predicate over a synthetic \[last_order_key, first_order_key\] row (InputRef(0) - InputRef(1) <= interval). Absent when there is no WITHIN clause.

within_deadline: Option<ExprNode>

WITHIN deadline: first_order_key + interval over a synthetic \[first_order_key\] row (InputRef(0) + interval). The watermark at which a partial starting at that row expires; used to wake an idle partition to evict it. Absent when there is no WITHIN clause.

input_mode: i32

How the ordered-input requirement is satisfied. EVENT_TIME: an EowcSort upstream (same fragment) emits rows in full ORDER BY order, strictly below each forwarded watermark. PROCESSING_TIME (not yet planned): rows are matched in observed arrival order.

Implementations

impl MatchRecognizeNode

pub fn input_mode(&self) -> MatchRecognizeInputMode

Returns the enum value of input_mode, or the default if the field is set to an invalid enum value.

pub fn set_input_mode(&mut self, value: MatchRecognizeInputMode)

Sets input_mode to the provided enum value.

impl MatchRecognizeNode

pub fn get_partition_by(&self) -> &Vec<u32>

pub fn get_order_by(&self) -> &Vec<ColumnOrder>

pub fn get_measures(&self) -> &Vec<MatchRecognizeMeasure>

pub fn get_defines(&self) -> &Vec<MatchRecognizeDefine>

pub fn get_pattern_node( &self, ) -> Result<&MatchRecognizePatternNode, PbFieldNotFound>

pub fn get_state_table(&self) -> Result<&Table, PbFieldNotFound>

pub fn get_after_match_skip( &self, ) -> Result<&MatchRecognizeAfterMatchSkip, PbFieldNotFound>

pub fn get_within(&self) -> Result<&ExprNode, PbFieldNotFound>

pub fn get_within_deadline(&self) -> Result<&ExprNode, PbFieldNotFound>

pub fn get_input_mode(&self) -> Result<MatchRecognizeInputMode, PbFieldNotFound>

Trait Implementations

impl Clone for MatchRecognizeNode

fn clone(&self) -> MatchRecognizeNode

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for MatchRecognizeNode

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

Formats the value using the given formatter.

impl Default for MatchRecognizeNode

fn default() -> Self

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for MatchRecognizeNode

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Message for MatchRecognizeNode

fn encoded_len(&self) -> usize

Returns the encoded length of the message without a length delimiter.

fn clear(&mut self)

Clears the message, resetting all fields to their default.

fn encode(&self, buf: &mut impl BufMut) -> Result<(), EncodeError>

where Self: Sized,

Encodes the message to a buffer.

fn encode_to_vec(&self) -> Vec<u8>

where Self: Sized,

Encodes the message to a newly allocated buffer.

fn encode_length_delimited( &self, buf: &mut impl BufMut, ) -> Result<(), EncodeError>

where Self: Sized,

Encodes the message with a length-delimiter to a buffer.

fn encode_length_delimited_to_vec(&self) -> Vec<u8>

where Self: Sized,

Encodes the message with a length-delimiter to a newly allocated buffer.

fn decode(buf: impl Buf) -> Result<Self, DecodeError>

where Self: Default,

Decodes an instance of the message from a buffer.

fn decode_length_delimited(buf: impl Buf) -> Result<Self, DecodeError>

where Self: Default,

Decodes a length-delimited instance of the message from the buffer.

fn merge(&mut self, buf: impl Buf) -> Result<(), DecodeError>

where Self: Sized,

Decodes an instance of the message from a buffer, and merges it into self.

fn merge_length_delimited(&mut self, buf: impl Buf) -> Result<(), DecodeError>

where Self: Sized,

Decodes a length-delimited instance of the message from buffer, and merges it into self.

impl PartialEq for MatchRecognizeNode

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

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for MatchRecognizeNode