Struct HashJoin 

pub struct HashJoin<'a> { /* private fields */ }

Implementations

impl<'a> HashJoin<'a>

pub fn new( left: Box<dyn PhysicalOperator + 'a>, right: Box<dyn PhysicalOperator + 'a>, kind: JoinKind, left_keys: Vec<ScalarExpr>, right_keys: Vec<ScalarExpr>, evaluator: SharedExpressionEvaluator<'a>, left_nulls: ResultRow, right_nulls: ResultRow, ) -> Self

pub fn new_with_work_mem( left: Box<dyn PhysicalOperator + 'a>, right: Box<dyn PhysicalOperator + 'a>, kind: JoinKind, left_keys: Vec<ScalarExpr>, right_keys: Vec<ScalarExpr>, evaluator: SharedExpressionEvaluator<'a>, left_nulls: ResultRow, right_nulls: ResultRow, work_mem_bytes: usize, ) -> Self

pub fn new_with_work_mem_and_predicate( left: Box<dyn PhysicalOperator + 'a>, right: Box<dyn PhysicalOperator + 'a>, kind: JoinKind, left_keys: Vec<ScalarExpr>, right_keys: Vec<ScalarExpr>, predicate: Option<ScalarExpr>, evaluator: SharedExpressionEvaluator<'a>, left_nulls: ResultRow, right_nulls: ResultRow, work_mem_bytes: usize, ) -> Self

pub fn try_new_with_work_mem_and_predicate( left: Box<dyn PhysicalOperator + 'a>, right: Box<dyn PhysicalOperator + 'a>, kind: JoinKind, left_keys: Vec<ScalarExpr>, right_keys: Vec<ScalarExpr>, predicate: Option<ScalarExpr>, evaluator: SharedExpressionEvaluator<'a>, left_nulls: ResultRow, right_nulls: ResultRow, work_mem_bytes: usize, params: &[SQLParam], ) -> ExecResult<Self>

Construct a hash join while preparing supported residual predicates against its composite output schema. Parameters and constant LIKE patterns are folded exactly once before any candidate row is probed.

pub fn output_has_spilled(&self) -> bool

pub fn right_input_has_spilled(&self) -> bool

pub fn hash_index_has_spilled(&self) -> bool

pub fn builds_left_input(&self) -> bool

Trait Implementations

impl PhysicalOperator for HashJoin<'_>

fn row_schema(&self) -> &RowSchema

Complete logical-to-physical row layout emitted by this operator. Every Batch returned by Self::next must carry this exact schema; operators must reject a child that violates that invariant.

fn estimated_cardinality(&self) -> Option<u64>

Planner/runtime cardinality estimate for choosing physical strategies. None means the operator cannot provide a useful estimate. The value is advisory rather than a correctness bound.

fn open(&mut self) -> ExecResult<()>

fn next(&mut self) -> ExecResult<Option<Batch>>

fn close(&mut self) -> ExecResult<()>

fn schema(&self) -> &[String]

Schema column names in logical output order.

fn output_ordering(&self) -> &[PhysicalOrder]

Leading output ordering known to be preserved by this operator.

fn consume_into_aggregate( &mut self, _executor: &mut dyn AggregateExecutor, ) -> ExecResult<bool>

Let a leaf consume its native projected rows directly into an aggregate executor. Returning false promises that no input was consumed, so the caller can fall back to ordinary Batch pulls.