Enum mz_sql_parser::ast::CteBlock

pub enum CteBlock<T: AstInfo> {
    Simple(Vec<Cte<T>>),
    MutuallyRecursive(MutRecBlock<T>),
}

A block of common table expressions (CTEs).

The block can either be entirely “simple” (traditional SQL WITH block), or “mutually recursive”, which introduce their bindings before the block and may result in mutually recursive definitions.

Variants

Simple(Vec<Cte<T>>)

MutuallyRecursive(MutRecBlock<T>)

Implementations

impl<T: AstInfo> CteBlock<T>

pub fn empty() -> Self

Returns an empty (simple) CTE block.

pub fn is_empty(&self) -> bool

True if there are no bindings in the block.

pub fn bound_identifiers(&self) -> impl Iterator<Item = &Ident>

Iterates through the identifiers used in bindings.

Trait Implementations

impl<T: AstInfo> AstDisplay for CteBlock<T>

fn fmt<W: Write>(&self, f: &mut AstFormatter<W>)

fn to_ast_string(&self) -> String

fn to_ast_string_stable(&self) -> String

fn to_ast_string_redacted(&self) -> String

impl<T: Clone + AstInfo> Clone for CteBlock<T>

fn clone(&self) -> CteBlock<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug + AstInfo> Debug for CteBlock<T>

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

Formats the value using the given formatter.

impl<T: AstInfo, T2: AstInfo> FoldNode<T, T2> for CteBlock<T>

type Folded = CteBlock<T2>

fn fold<F: Fold<T, T2>>(self, folder: &mut F) -> Self::Folded

impl<T: Hash + AstInfo> Hash for CteBlock<T>

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<T: Ord + AstInfo> Ord for CteBlock<T>

fn cmp(&self, other: &CteBlock<T>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized + PartialOrd,

Restrict a value to a certain interval.

impl<T: PartialEq + AstInfo> PartialEq for CteBlock<T>

fn eq(&self, other: &CteBlock<T>) -> 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<T: PartialOrd + AstInfo> PartialOrd for CteBlock<T>

fn partial_cmp(&self, other: &CteBlock<T>) -> 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<'ast, T: AstInfo> VisitMutNode<'ast, T> for CteBlock<T>

fn visit_mut<V: VisitMut<'ast, T>>(&'ast mut self, visitor: &mut V)

impl<'ast, T: AstInfo> VisitNode<'ast, T> for CteBlock<T>

fn visit<V: Visit<'ast, T>>(&'ast self, visitor: &mut V)

impl<T: Eq + AstInfo> Eq for CteBlock<T>

impl<T: AstInfo> StructuralPartialEq for CteBlock<T>