Struct RecursiveQuery

pub struct RecursiveQuery {
    pub name: String,
    pub static_term: Arc<LogicalPlan>,
    pub recursive_term: Arc<LogicalPlan>,
    pub is_distinct: bool,
}

A variadic query operation, Recursive CTE.

Recursive Query Evaluation

From the Postgres Docs:

1. Evaluate the non-recursive term. For UNION (but not UNION ALL), discard duplicate rows. Include all remaining rows in the result of the recursive query, and also place them in a temporary working table.

2. So long as the working table is not empty, repeat these steps:

• Evaluate the recursive term, substituting the current contents of the working table for the recursive self-reference. For UNION (but not UNION ALL), discard duplicate rows and rows that duplicate any previous result row. Include all remaining rows in the result of the recursive query, and also place them in a temporary intermediate table.

• Replace the contents of the working table with the contents of the intermediate table, then empty the intermediate table.

Fields

name: String

Name of the query

static_term: Arc<LogicalPlan>

The static term (initial contents of the working table)

recursive_term: Arc<LogicalPlan>

The recursive term (evaluated on the contents of the working table until it returns an empty set)

is_distinct: bool

Should the output of the recursive term be deduplicated (UNION) or not (UNION ALL).

Trait Implementations

impl Clone for RecursiveQuery

fn clone(&self) -> RecursiveQuery

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for RecursiveQuery

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

Formats the value using the given formatter.

impl Hash for RecursiveQuery

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 PartialEq for RecursiveQuery

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

fn partial_cmp(&self, other: &RecursiveQuery) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Eq for RecursiveQuery

impl StructuralPartialEq for RecursiveQuery