pub struct Sort<'a> { /* private fields */ }Implementations§
Source§impl Sort<'static>
impl Sort<'static>
Source§impl<'a> Sort<'a>
impl<'a> Sort<'a>
pub fn with_evaluator( child: Box<dyn PhysicalOperator + 'a>, keys: Vec<SortKey>, evaluator: SharedExpressionEvaluator<'a>, ) -> Self
pub fn with_evaluator_and_work_mem( child: Box<dyn PhysicalOperator + 'a>, keys: Vec<SortKey>, evaluator: SharedExpressionEvaluator<'a>, work_mem_bytes: usize, ) -> Self
pub fn with_evaluator_and_keep( child: Box<dyn PhysicalOperator + 'a>, keys: Vec<SortKey>, evaluator: SharedExpressionEvaluator<'a>, keep: usize, ) -> Self
Trait Implementations§
Source§impl PhysicalOperator for Sort<'_>
impl PhysicalOperator for Sort<'_>
Source§fn row_schema(&self) -> &RowSchema
fn row_schema(&self) -> &RowSchema
Complete logical-to-physical row layout emitted by this operator. Every
Batch returned by Self::next must carry this exact schema; operators must reject a child that violates that invariant.Source§fn supports_batched_consumption(&self) -> bool
fn supports_batched_consumption(&self) -> bool
Whether a complete, effect-free consumer may use native batches without changing SQL expression, side-effect or first-error order relative to singleton demand. Unclassified pipelines retain singleton demand. A producer with additional per-row evaluation above its child must establish that ordering independently; row order alone is insufficient.
Source§fn output_ordering(&self) -> &[PhysicalOrder]
fn output_ordering(&self) -> &[PhysicalOrder]
Leading output ordering known to be preserved by this operator.
Source§fn backward_scan_support(&self) -> BackwardScanSupport
fn backward_scan_support(&self) -> BackwardScanSupport
Describe backwards-scan support without changing the operator tree. The default is deliberately conservative so a scrollable cursor freezes the complete output of unclassified plans.
fn open(&mut self) -> ExecResult<()>
fn next(&mut self) -> ExecResult<Option<Batch>>
fn close(&mut self) -> ExecResult<()>
Source§fn estimated_cardinality(&self) -> Option<u64>
fn estimated_cardinality(&self) -> Option<u64>
Planner/runtime cardinality estimate for choosing physical strategies.
None means the operator cannot provide a useful estimate. The value
is advisory rather than a correctness bound.Source§fn consume_into_aggregate(
&mut self,
_executor: &mut dyn AggregateExecutor,
) -> ExecResult<bool>
fn consume_into_aggregate( &mut self, _executor: &mut dyn AggregateExecutor, ) -> ExecResult<bool>
Let a leaf consume its native projected rows directly into an
aggregate executor. Returning
false promises that no input was
consumed, so the caller can fall back to ordinary Batch pulls.Source§fn collect_materialized(
&mut self,
_sink: &mut MaterializedResultSink<'_>,
) -> ExecResult<bool>
fn collect_materialized( &mut self, _sink: &mut MaterializedResultSink<'_>, ) -> ExecResult<bool>
Fill a native public result from borrowed source values after opening the pipeline. Only complete, effect-free projection chains may forward this request.
false guarantees that no row was consumed; the caller retains ordinary pulls and always closes the pipeline.Source§fn next_with_demand(&mut self, _rows: NonZeroUsize) -> ExecResult<Option<Batch>>
fn next_with_demand(&mut self, _rows: NonZeroUsize) -> ExecResult<Option<Batch>>
Pull at most
rows newly evaluated output rows. Pipelined expression producers must propagate demand before evaluating their inputs. A semantic materialization boundary may return a larger already-evaluated batch; its consumer retains that remainder without evaluating it again. The default preserves that materialized-batch contract, so an effectful streaming adapter must override this method.Source§fn next_direction(
&mut self,
direction: PhysicalScanDirection,
) -> ExecResult<Option<Batch>>
fn next_direction( &mut self, direction: PhysicalScanDirection, ) -> ExecResult<Option<Batch>>
Pull one directional batch. Native backwards-capable pipelines keep batches to one row so a consumer can reverse direction between adjacent fetches.
Source§fn rewind(&mut self) -> ExecResult<()>
fn rewind(&mut self) -> ExecResult<()>
Rewind a native backwards-capable pipeline without recomputing rows held by semantic materialization boundaries.
Auto Trait Implementations§
impl<'a> !RefUnwindSafe for Sort<'a>
impl<'a> !Sync for Sort<'a>
impl<'a> !UnwindSafe for Sort<'a>
impl<'a> Freeze for Sort<'a>
impl<'a> Send for Sort<'a>
impl<'a> Unpin for Sort<'a>
impl<'a> UnsafeUnpin for Sort<'a>
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
impl<T> ErasedDestructor for Twhere
T: 'static,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more