Struct mz_expr::RowSetFinishing
source · pub struct RowSetFinishing<L = NonNeg<i64>> {
pub order_by: Vec<ColumnOrder>,
pub limit: Option<L>,
pub offset: usize,
pub project: Vec<usize>,
}
Expand description
Instructions for finishing the result of a query.
The primary reason for the existence of this structure and attendant code is that SQL’s ORDER BY requires sorting rows (as already implied by the keywords), whereas much of the rest of SQL is defined in terms of unordered multisets. But as it turns out, the same idea can be used to optimize trivial peeks.
Fields§
§order_by: Vec<ColumnOrder>
Order rows by the given columns.
limit: Option<L>
Include only as many rows (after offset).
offset: usize
Omit as many rows.
project: Vec<usize>
Include only given columns.
Implementations§
source§impl<L> RowSetFinishing<L>
impl<L> RowSetFinishing<L>
sourcepub fn trivial(arity: usize) -> RowSetFinishing<L>
pub fn trivial(arity: usize) -> RowSetFinishing<L>
Returns a trivial finishing, i.e., that does nothing to the result set.
sourcepub fn is_trivial(&self, arity: usize) -> bool
pub fn is_trivial(&self, arity: usize) -> bool
True if the finishing does nothing to any result set.
source§impl RowSetFinishing
impl RowSetFinishing
sourcepub fn finish(
&self,
rows: RowCollection,
max_result_size: u64,
max_returned_query_size: Option<u64>,
duration_histogram: &Histogram,
) -> Result<(SortedRowCollectionIter, usize), String>
pub fn finish( &self, rows: RowCollection, max_result_size: u64, max_returned_query_size: Option<u64>, duration_histogram: &Histogram, ) -> Result<(SortedRowCollectionIter, usize), String>
Applies finishing actions to a RowCollection
, and reports the total
time it took to run.
Returns a SortedRowCollectionIter
that contains all of the response data, as
well as the size of the response in bytes.
sourcefn finish_inner(
&self,
rows: RowCollection,
max_result_size: u64,
max_returned_query_size: Option<u64>,
) -> Result<(SortedRowCollectionIter, usize), String>
fn finish_inner( &self, rows: RowCollection, max_result_size: u64, max_returned_query_size: Option<u64>, ) -> Result<(SortedRowCollectionIter, usize), String>
Implementation for RowSetFinishing::finish
.
Trait Implementations§
source§impl<L: Arbitrary> Arbitrary for RowSetFinishing<L>
impl<L: Arbitrary> Arbitrary for RowSetFinishing<L>
§type Parameters = (<Vec<ColumnOrder> as Arbitrary>::Parameters, <Option<L> as Arbitrary>::Parameters, <usize as Arbitrary>::Parameters, <Vec<usize> as Arbitrary>::Parameters)
type Parameters = (<Vec<ColumnOrder> as Arbitrary>::Parameters, <Option<L> as Arbitrary>::Parameters, <usize as Arbitrary>::Parameters, <Vec<usize> as Arbitrary>::Parameters)
arbitrary_with
accepts for configuration
of the generated Strategy
. Parameters must implement Default
.§type Strategy = Map<(<Vec<ColumnOrder> as Arbitrary>::Strategy, <Option<L> as Arbitrary>::Strategy, <usize as Arbitrary>::Strategy, <Vec<usize> as Arbitrary>::Strategy), fn(_: (Vec<ColumnOrder>, Option<L>, usize, Vec<usize>)) -> RowSetFinishing<L>>
type Strategy = Map<(<Vec<ColumnOrder> as Arbitrary>::Strategy, <Option<L> as Arbitrary>::Strategy, <usize as Arbitrary>::Strategy, <Vec<usize> as Arbitrary>::Strategy), fn(_: (Vec<ColumnOrder>, Option<L>, usize, Vec<usize>)) -> RowSetFinishing<L>>
Strategy
used to generate values of type Self
.source§fn arbitrary_with(_top: Self::Parameters) -> Self::Strategy
fn arbitrary_with(_top: Self::Parameters) -> Self::Strategy
source§impl<L: Clone> Clone for RowSetFinishing<L>
impl<L: Clone> Clone for RowSetFinishing<L>
source§fn clone(&self) -> RowSetFinishing<L>
fn clone(&self) -> RowSetFinishing<L>
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moresource§impl<L: Debug> Debug for RowSetFinishing<L>
impl<L: Debug> Debug for RowSetFinishing<L>
source§impl<'de, L> Deserialize<'de> for RowSetFinishing<L>where
L: Deserialize<'de>,
impl<'de, L> Deserialize<'de> for RowSetFinishing<L>where
L: Deserialize<'de>,
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>,
source§impl<L: PartialEq> PartialEq for RowSetFinishing<L>
impl<L: PartialEq> PartialEq for RowSetFinishing<L>
source§impl RustType<ProtoRowSetFinishing> for RowSetFinishing
impl RustType<ProtoRowSetFinishing> for RowSetFinishing
source§fn into_proto(&self) -> ProtoRowSetFinishing
fn into_proto(&self) -> ProtoRowSetFinishing
Self
into a Proto
value.source§fn from_proto(x: ProtoRowSetFinishing) -> Result<Self, TryFromProtoError>
fn from_proto(x: ProtoRowSetFinishing) -> Result<Self, TryFromProtoError>
source§fn into_proto_owned(self) -> Proto
fn into_proto_owned(self) -> Proto
Self::into_proto
that types can
optionally implement, otherwise, the default implementation
delegates to Self::into_proto
.source§impl<L> Serialize for RowSetFinishing<L>where
L: Serialize,
impl<L> Serialize for RowSetFinishing<L>where
L: Serialize,
impl<L: Eq> Eq for RowSetFinishing<L>
impl<L> StructuralPartialEq for RowSetFinishing<L>
Auto Trait Implementations§
impl<L> Freeze for RowSetFinishing<L>where
L: Freeze,
impl<L> RefUnwindSafe for RowSetFinishing<L>where
L: RefUnwindSafe,
impl<L> Send for RowSetFinishing<L>where
L: Send,
impl<L> Sync for RowSetFinishing<L>where
L: Sync,
impl<L> Unpin for RowSetFinishing<L>where
L: Unpin,
impl<L> UnwindSafe for RowSetFinishing<L>where
L: UnwindSafe,
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,
source§default unsafe fn clone_to_uninit(&self, dst: *mut T)
default unsafe fn clone_to_uninit(&self, dst: *mut T)
clone_to_uninit
)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
key
and return true
if they are equal.source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
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
key
and return true
if they are equal.source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§impl<T> FutureExt for T
impl<T> FutureExt for T
source§fn with_context(self, otel_cx: Context) -> WithContext<Self>
fn with_context(self, otel_cx: Context) -> WithContext<Self>
source§fn with_current_context(self) -> WithContext<Self>
fn with_current_context(self) -> WithContext<Self>
source§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T> IntoRequest<T> for T
impl<T> IntoRequest<T> for T
source§fn into_request(self) -> Request<T>
fn into_request(self) -> Request<T>
T
in a tonic::Request
source§impl<T, U> OverrideFrom<Option<&T>> for Uwhere
U: OverrideFrom<T>,
impl<T, U> OverrideFrom<Option<&T>> for Uwhere
U: OverrideFrom<T>,
source§impl<T> Pointable for T
impl<T> Pointable for T
source§impl<T> ProgressEventTimestamp for T
impl<T> ProgressEventTimestamp for T
source§impl<P, R> ProtoType<R> for Pwhere
R: RustType<P>,
impl<P, R> ProtoType<R> for Pwhere
R: RustType<P>,
source§fn into_rust(self) -> Result<R, TryFromProtoError>
fn into_rust(self) -> Result<R, TryFromProtoError>
RustType::from_proto
.source§fn from_rust(rust: &R) -> P
fn from_rust(rust: &R) -> P
RustType::into_proto
.source§impl<'a, S, T> Semigroup<&'a S> for Twhere
T: Semigroup<S>,
impl<'a, S, T> Semigroup<&'a S> for Twhere
T: Semigroup<S>,
source§fn plus_equals(&mut self, rhs: &&'a S)
fn plus_equals(&mut self, rhs: &&'a S)
std::ops::AddAssign
, for types that do not implement AddAssign
.