Struct MergeJoinRel 

pub struct MergeJoinRel {
    pub common: Option<RelCommon>,
    pub left: Option<Box<Rel>>,
    pub right: Option<Box<Rel>>,
    pub left_keys: Vec<FieldReference>,
    pub right_keys: Vec<FieldReference>,
    pub keys: Vec<ComparisonJoinKey>,
    pub post_join_filter: Option<Box<Expression>>,
    pub type: i32,
    pub residual_expression: Option<Box<Expression>>,
    pub advanced_extension: Option<AdvancedExtension>,
}

The merge join does a join by taking advantage of two sets that are sorted on the join keys. This allows the join operation to be done in a streaming fashion.

Fields

common: Option<RelCommon>

left: Option<Box<Rel>>

right: Option<Box<Rel>>

left_keys: Vec<FieldReference>

👎Deprecated

These fields are deprecated in favor of keys. If they are set then the two lists (left_keys and right_keys) must have the same length and the comparion function is considered to be SimpleEqualityType::EQ

right_keys: Vec<FieldReference>

👎Deprecated

keys: Vec<ComparisonJoinKey>

One or more keys to join on. The relation is invalid if this is empty (unless the deprecated left_keys/right_keys fields are being used).

If a custom comparison function is used then it must be consistent with the ordering of the input data. For example, if the comparison function is “<” then we generally expect the data to be sorted in ascending order.

If the comparison function is something like “less than ignoring case” then the data should be sorted appropriately (e.g. both “A” and “a” should come before “b”)

The sort order is not specified here. It is typically the responsibility of the producer to ensure the plan sorts the data if needed (although the consumer is free to do so as well). If possible, the consumer should verify the sort order and reject invalid plans.

post_join_filter: Option<Box<Expression>>

An optional boolean filter applied to each output record after join-type-specific output formation is complete. Semantically equivalent to placing a FilterRel directly above this join.

type: i32

residual_expression: Option<Box<Expression>>

An optional boolean expression evaluated on each candidate key-match to determine whether it is a true match. A candidate is only considered a match when all keys comparisons AND this expression evaluate to true. This expression interacts with join-type semantics: for example, in a left outer join, a left row that has key matches but no candidate satisfying this expression will be emitted with nulls for the right side.

advanced_extension: Option<AdvancedExtension>

Implementations

impl MergeJoinRel

pub fn type(&self) -> JoinType

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

pub fn set_type(&mut self, value: JoinType)

Sets type to the provided enum value.

Trait Implementations

impl Clone for MergeJoinRel

fn clone(&self) -> MergeJoinRel

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for MergeJoinRel

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

Formats the value using the given formatter.

impl Default for MergeJoinRel

fn default() -> Self

Returns the “default value” for a type.

impl Message for MergeJoinRel

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 Name for MergeJoinRel

const NAME: &'static str = "MergeJoinRel"

Simple name for this Message. This name is the same as it appears in the source .proto file, e.g. FooBar.

const PACKAGE: &'static str = "substrait"

Package name this message type is contained in. They are domain-like and delimited by ., e.g. google.protobuf.

fn full_name() -> String

Fully-qualified unique name for this Message. It’s prefixed with the package name and names of any parent messages, e.g. google.rpc.BadRequest.FieldViolation. By default, this is the package name followed by the message name. Fully-qualified names must be unique within a domain of Type URLs.

fn type_url() -> String

Type URL for this Message, which by default is the full name with a leading slash, but may also include a leading domain name, e.g. type.googleapis.com/google.profile.Person. This can be used when serializing into the google.protobuf.Any type.

impl PartialEq for MergeJoinRel

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for MergeJoinRel