Struct mz_sql_parser::ast::defs::name::UnresolvedSchemaName

pub struct UnresolvedSchemaName(pub Vec<Ident>);

A name of a schema

Tuple Fields

0: Vec<Ident>

Trait Implementations

impl AstDisplay for UnresolvedSchemaName

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 Clone for UnresolvedSchemaName

fn clone(&self) -> UnresolvedSchemaName

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for UnresolvedSchemaName

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

Formats the value using the given formatter.

impl Display for UnresolvedSchemaName

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

Formats the value using the given formatter.

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

type Folded = UnresolvedSchemaName

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

impl Hash for UnresolvedSchemaName

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 Ord for UnresolvedSchemaName

fn cmp(&self, other: &UnresolvedSchemaName) -> 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 PartialEq for UnresolvedSchemaName

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

fn partial_cmp(&self, other: &UnresolvedSchemaName) -> 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 UnresolvedSchemaName

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

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

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

impl Eq for UnresolvedSchemaName

impl StructuralPartialEq for UnresolvedSchemaName