Struct Join 

pub struct Join<PlanRef> {
    pub left: PlanRef,
    pub right: PlanRef,
    pub on: Condition,
    pub join_type: JoinType,
    pub output_indices: Vec<usize>,
}

Join combines two relations according to some condition.

Each output row has fields from the left and right inputs. The set of output rows is a subset of the cartesian product of the two inputs; precisely which subset depends on the join condition. In addition, the output columns are a subset of the columns of the left and right columns, dependent on the output indices provided. A repeat output index is illegal.

Fields

left: PlanRef

right: PlanRef

on: Condition

join_type: JoinType

output_indices: Vec<usize>

Implementations

impl<PlanRef: GenericPlanRef> Join<PlanRef>

pub(crate) fn clone_with_inputs<OtherPlanRef>( &self, left: OtherPlanRef, right: OtherPlanRef, ) -> Join<OtherPlanRef>

pub(crate) fn rewrite_exprs(&mut self, r: &mut dyn ExprRewriter)

pub(crate) fn visit_exprs(&self, v: &mut dyn ExprVisitor)

pub fn eq_indexes(&self) -> Vec<(usize, usize)>

pub fn new( left: PlanRef, right: PlanRef, on: Condition, join_type: JoinType, output_indices: Vec<usize>, ) -> Self

impl Join<StreamPlanRef>

pub fn stream_kind(&self) -> Result<StreamKind>

pub fn infer_internal_and_degree_table_catalog( input: StreamPlanRef, join_key_indices: Vec<usize>, dk_indices_in_jk: Vec<usize>, ) -> (TableCatalog, TableCatalog, Vec<usize>)

Return stream hash join internal table catalog and degree table catalog.

impl<PlanRef> Join<PlanRef>

pub fn decompose(self) -> (PlanRef, PlanRef, Condition, JoinType, Vec<usize>)

impl<PlanRef: GenericPlanRef> Join<PlanRef>

pub fn full_out_col_num( left_len: usize, right_len: usize, join_type: JoinType, ) -> usize

pub fn with_full_output( left: PlanRef, right: PlanRef, join_type: JoinType, on: Condition, ) -> Self

pub fn internal_column_num(&self) -> usize

pub fn is_full_out(&self) -> bool

pub fn i2l_col_mapping(&self) -> ColIndexMapping

Get the Mapping of columnIndex from internal column index to left column index.

pub fn i2r_col_mapping(&self) -> ColIndexMapping

Get the Mapping of columnIndex from internal column index to right column index.

pub fn i2l_col_mapping_ignore_join_type(&self) -> ColIndexMapping

TODO: This function may can be merged with i2l_col_mapping in future.

pub fn i2r_col_mapping_ignore_join_type(&self) -> ColIndexMapping

TODO: This function may can be merged with i2r_col_mapping in future.

pub fn l2i_col_mapping(&self) -> ColIndexMapping

Get the Mapping of columnIndex from left column index to internal column index.

pub fn r2i_col_mapping(&self) -> ColIndexMapping

Get the Mapping of columnIndex from right column index to internal column index.

pub fn i2o_col_mapping(&self) -> ColIndexMapping

Get the Mapping of columnIndex from internal column index to output column index

pub fn o2i_col_mapping(&self) -> ColIndexMapping

Get the Mapping of columnIndex from output column index to internal column index

pub fn add_which_join_key_to_pk(&self) -> EitherOrBoth<(), ()>

pub fn concat_schema(&self) -> Schema

Trait Implementations

impl<PlanRef: Clone> Clone for Join<PlanRef>

fn clone(&self) -> Join<PlanRef>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<PlanRef: Debug> Debug for Join<PlanRef>

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

Formats the value using the given formatter.

impl<PlanRef: GenericPlanRef> GenericPlanNode for Join<PlanRef>

fn schema(&self) -> Schema

fn stream_key(&self) -> Option<Vec<usize>>

fn ctx(&self) -> OptimizerContextRef

fn functional_dependency(&self) -> FunctionalDependencySet

impl<PlanRef: Hash> Hash for Join<PlanRef>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<PlanRef: PartialEq> PartialEq for Join<PlanRef>

fn eq(&self, other: &Join<PlanRef>) -> 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<PlanRef: Eq> Eq for Join<PlanRef>

impl<PlanRef> StructuralPartialEq for Join<PlanRef>