Enum RelationalJoinRightInput 

pub enum RelationalJoinRightInput {
    Probe,
    Materialized,
    Hash,
    Merge,
}

Variants

Probe

The right access runs once per outer row, so its component costs scale with the outer cardinality instead of being charged as a subtree.

Materialized

The right subtree is produced once, then the join charges row-pair work.

Hash

Build a hash table once, then probe it with the left input.

Merge

Merge two compatibly ordered inputs without sorting them.

Trait Implementations

impl Clone for RelationalJoinRightInput

fn clone(&self) -> RelationalJoinRightInput

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for RelationalJoinRightInput

impl Debug for RelationalJoinRightInput

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

Formats the value using the given formatter.

impl Eq for RelationalJoinRightInput

impl PartialEq for RelationalJoinRightInput

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for RelationalJoinRightInput