pub struct RetainedQueryOperator { /* private fields */ }Implementations§
Source§impl RetainedQueryOperator
impl RetainedQueryOperator
pub fn try_new( input: Box<dyn RetainedQueryInput>, ) -> Result<Option<Self>, SQLError>
pub fn try_new_with_control( input: Box<dyn RetainedQueryInput>, control: &ProductionControl<'_>, ) -> Result<Option<Self>, SQLError>
Sourcepub fn into_boxed(
self,
control: &ProductionControl<'_>,
) -> Result<Box<Self>, SQLError>
pub fn into_boxed( self, control: &ProductionControl<'_>, ) -> Result<Box<Self>, SQLError>
Admit the physical wrapper before boxing it; failed admission closes the already owned child pipeline.
Trait Implementations§
Source§impl Drop for RetainedQueryOperator
impl Drop for RetainedQueryOperator
Source§impl PhysicalOperator for RetainedQueryOperator
impl PhysicalOperator for RetainedQueryOperator
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 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 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.
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 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.
fn open(&mut self) -> ExecResult<()>
fn next(&mut self) -> ExecResult<Option<Batch>>
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.fn close(&mut self) -> ExecResult<()>
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 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.
Auto Trait Implementations§
impl !RefUnwindSafe for RetainedQueryOperator
impl !Sync for RetainedQueryOperator
impl !UnwindSafe for RetainedQueryOperator
impl Freeze for RetainedQueryOperator
impl Send for RetainedQueryOperator
impl Unpin for RetainedQueryOperator
impl UnsafeUnpin for RetainedQueryOperator
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