pub struct OrderByUsing {
pub schema: Option<ObjectName>,
pub op: Symbol,
pub meta: Meta,
}Expand description
The USING <qual_all_Op> operator of a PostgreSQL ORDER BY sort key.
qual_all_Op is a possibly schema-qualified operator: the bare USING < form
carries no schema node at all, while USING OPERATOR(pg_catalog.<) records the qualification. Modelled like the operator
half of NamedOperatorExpr: the operator
is always symbolic, never a word, so it is a bare interned Symbol. schema
is Option rather than an empty ObjectName because every present node must
carry a real source span (the span-containment walker enforces it) — an empty
name would have none.
Fields§
§schema: Option<ObjectName>Schema qualification (pg_catalog in OPERATOR(pg_catalog.<)); None for
the bare USING < form.
op: SymbolThe operator symbol spelling (<, ~<~), interned exact-case so it
round-trips.
meta: MetaSource location and node identity.
Trait Implementations§
Source§impl Clone for OrderByUsing
impl Clone for OrderByUsing
Source§fn clone(&self) -> OrderByUsing
fn clone(&self) -> OrderByUsing
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreSource§impl Debug for OrderByUsing
impl Debug for OrderByUsing
Source§impl<'de> Deserialize<'de> for OrderByUsing
impl<'de> Deserialize<'de> for OrderByUsing
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
impl Eq for OrderByUsing
Source§impl Hash for OrderByUsing
impl Hash for OrderByUsing
Source§impl PartialEq for OrderByUsing
impl PartialEq for OrderByUsing
Source§impl Render for OrderByUsing
impl Render for OrderByUsing
Source§fn render(&self, ctx: &RenderCtx<'_>, f: &mut Formatter<'_>) -> Result
fn render(&self, ctx: &RenderCtx<'_>, f: &mut Formatter<'_>) -> Result
Source§fn operand_binding_power(&self) -> Option<BindingPower>
fn operand_binding_power(&self) -> Option<BindingPower>
None (the default) for a self-delimiting node — an atom, call, or
constructor — that never needs parentheses. Read moreSource§impl Serialize for OrderByUsing
impl Serialize for OrderByUsing
impl StructuralPartialEq for OrderByUsing
Auto Trait Implementations§
impl Freeze for OrderByUsing
impl RefUnwindSafe for OrderByUsing
impl Send for OrderByUsing
impl Sync for OrderByUsing
impl Unpin for OrderByUsing
impl UnsafeUnpin for OrderByUsing
impl UnwindSafe for OrderByUsing
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
Source§impl<T> DynAstExt for T
impl<T> DynAstExt for T
Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&dyn Any for downcasting a node back to its concrete type.Source§fn dyn_clone(&self) -> Box<dyn DynAstExt>
fn dyn_clone(&self) -> Box<dyn DynAstExt>
Clone (whose
Self-returning signature cannot go through a vtable).Source§fn dyn_eq(&self, other: &dyn DynAstExt) -> bool
fn dyn_eq(&self, other: &dyn DynAstExt) -> bool
PartialEq (whose &Self argument cannot go through a vtable). Equal
iff other holds the same concrete type and that type deems the values
equal; differently-typed nodes are never equal.