Struct CreateTableStatement

pub struct CreateTableStatement<T: AstInfo> {
    pub name: UnresolvedItemName,
    pub columns: Vec<ColumnDef<T>>,
    pub constraints: Vec<TableConstraint<T>>,
    pub if_not_exists: bool,
    pub temporary: bool,
    pub with_options: Vec<TableOption<T>>,
}

CREATE TABLE

Fields

name: UnresolvedItemName

Table name

columns: Vec<ColumnDef<T>>

Optional schema

constraints: Vec<TableConstraint<T>>

if_not_exists: bool

temporary: bool

with_options: Vec<TableOption<T>>

Trait Implementations

impl<T: AstInfo> AstDisplay for CreateTableStatement<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 CreateTableStatement<T>

fn clone(&self) -> CreateTableStatement<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 CreateTableStatement<T>

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

Formats the value using the given formatter.

impl<T: AstInfo> Display for CreateTableStatement<T>

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

Formats the value using the given formatter.

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

type Folded = CreateTableStatement<T2>

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

impl<T: Hash + AstInfo> Hash for CreateTableStatement<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: PartialEq + AstInfo> PartialEq for CreateTableStatement<T>

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

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

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

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

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

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