Struct HashJoinNode

pub struct HashJoinNode {

    pub join_type: i32,
    pub left_key: Vec<i32>,
    pub right_key: Vec<i32>,
    pub condition: Option<ExprNode>,
    pub inequality_pairs: Vec<InequalityPair>,
    pub left_table: Option<Table>,
    pub right_table: Option<Table>,
    pub left_degree_table: Option<Table>,
    pub right_degree_table: Option<Table>,
    pub output_indices: Vec<u32>,
    pub left_deduped_input_pk_indices: Vec<u32>,
    pub right_deduped_input_pk_indices: Vec<u32>,
    pub null_safe: Vec<bool>,
    pub is_append_only: bool,
}

Fields

join_type: i32

left_key: Vec<i32>

right_key: Vec<i32>

condition: Option<ExprNode>

inequality_pairs: Vec<InequalityPair>

left_table: Option<Table>

Used for internal table states.

right_table: Option<Table>

Used for internal table states.

left_degree_table: Option<Table>

Used for internal table states.

right_degree_table: Option<Table>

Used for internal table states.

output_indices: Vec<u32>

The output indices of current node

left_deduped_input_pk_indices: Vec<u32>

Left deduped input pk indices. The pk of the left_table and left_degree_table is [left_join_key | left_deduped_input_pk_indices] and is expected to be the shortest key which starts with the join key and satisfies unique constrain.

right_deduped_input_pk_indices: Vec<u32>

Right deduped input pk indices. The pk of the right_table and right_degree_table is [right_join_key | right_deduped_input_pk_indices] and is expected to be the shortest key which starts with the join key and satisfies unique constrain.

null_safe: Vec<bool>

is_append_only: bool

Whether to optimize for append only stream. It is true when the input is append-only

Implementations

impl HashJoinNode

pub fn join_type(&self) -> JoinType

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

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

Sets join_type to the provided enum value.

impl HashJoinNode

pub fn get_join_type(&self) -> Result<JoinType, PbFieldNotFound>

pub fn get_left_key(&self) -> &Vec<i32>

pub fn get_right_key(&self) -> &Vec<i32>

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

pub fn get_inequality_pairs(&self) -> &Vec<InequalityPair>

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

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

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

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

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

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

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

pub fn get_null_safe(&self) -> &Vec<bool>

pub fn get_is_append_only(&self) -> bool

Trait Implementations

impl Clone for HashJoinNode

fn clone(&self) -> HashJoinNode

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for HashJoinNode

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

Formats the value using the given formatter.

impl Default for HashJoinNode

fn default() -> Self

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for HashJoinNode

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

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Message for HashJoinNode

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 HashJoinNode

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

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 HashJoinNode