Struct substrait::proto::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 advanced_extension: Option<AdvancedExtension>,
}

The merge equijoin 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>>

type: i32

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 copy 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<'de> Deserialize<'de> for MergeJoinRel

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

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

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<B>(&self, buf: &mut B) -> Result<(), EncodeError>

where B: BufMut, 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<B>(&self, buf: &mut B) -> Result<(), EncodeError>

where B: BufMut, 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<B>(buf: B) -> Result<Self, DecodeError>

where B: Buf, Self: Default,

Decodes an instance of the message from a buffer.

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

where B: Buf, Self: Default,

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

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

where B: Buf, Self: Sized,

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

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

where B: Buf, Self: Sized,

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

impl PartialEq for MergeJoinRel

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

This method tests for self and other values to be equal, and is used by ==.

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for MergeJoinRel

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 MergeJoinRel