pub struct MatchColumn {
pub name: String,
pub expr: Expr,
pub hidden: bool,
}Fields§
§name: String§expr: ExprA sort-only column materialised by an aggregating query so a non-projected
ORDER BY key (a grouping key, functionally-dependent value, or aggregate)
can be sorted on; the planner emits it from the Aggregate operator and
drops it with a final projection before the rows are returned. Always
false for user-projected columns.
Trait Implementations§
Source§impl Clone for MatchColumn
impl Clone for MatchColumn
Source§impl Debug for MatchColumn
impl Debug for MatchColumn
impl Eq for MatchColumn
Source§impl Hash for MatchColumn
impl Hash for MatchColumn
Source§impl PartialEq for MatchColumn
impl PartialEq for MatchColumn
impl StructuralPartialEq for MatchColumn
Auto Trait Implementations§
impl !Freeze for MatchColumn
impl RefUnwindSafe for MatchColumn
impl Send for MatchColumn
impl Sync for MatchColumn
impl Unpin for MatchColumn
impl UnsafeUnpin for MatchColumn
impl UnwindSafe for MatchColumn
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
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.