Enum JoinOrderTree 

pub enum JoinOrderTree {
    Scan(JoinRelation),
    Inner {
        algorithm: JoinAlgorithm,
        condition: JoinCondition,
        left: Box<JoinOrderTree>,
        right: Box<JoinOrderTree>,
    },
    Cross {
        left: Box<JoinOrderTree>,
        right: Box<JoinOrderTree>,
    },
}

Output of the join order optimizer. The engine walks this tree to drive the actual row-tuple join algorithms.

Variants

Scan(JoinRelation)

Base relation – a single scan source.

Inner

Inner equijoin with the chosen algorithm.

Fields

algorithm: JoinAlgorithm

condition: JoinCondition

left: Box<JoinOrderTree>

right: Box<JoinOrderTree>

Cross

Cross join – no predicate connecting the two sides.

Fields

left: Box<JoinOrderTree>

right: Box<JoinOrderTree>

Trait Implementations

impl Clone for JoinOrderTree

fn clone(&self) -> JoinOrderTree

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for JoinOrderTree

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

Formats the value using the given formatter.