pub struct RowIteratorScan<'a> { /* private fields */ }Expand description
Physical scan over a fallible row iterator. Unlike VecSource, this
adapter preserves producer backpressure and late errors without requiring a
cardinality-sized staging vector.
Implementations§
Source§impl<'a> RowIteratorScan<'a>
impl<'a> RowIteratorScan<'a>
pub fn new( schema: Vec<String>, rows: Box<dyn Iterator<Item = ExecResult<ResultRow>> + Send + 'a>, ) -> Self
pub fn with_types( schema: Vec<String>, types: Vec<Option<ColumnType>>, rows: Box<dyn Iterator<Item = ExecResult<ResultRow>> + Send + 'a>, ) -> Self
pub fn with_row_schema( schema: RowSchema, rows: Box<dyn Iterator<Item = ExecResult<ResultRow>> + Send + 'a>, ) -> Self
Trait Implementations§
Source§impl PhysicalOperator for RowIteratorScan<'_>
impl PhysicalOperator for RowIteratorScan<'_>
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.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 output_ordering(&self) -> &[PhysicalOrder]
fn output_ordering(&self) -> &[PhysicalOrder]
Leading output ordering known to be preserved by this operator.
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.Auto Trait Implementations§
impl<'a> !RefUnwindSafe for RowIteratorScan<'a>
impl<'a> !Sync for RowIteratorScan<'a>
impl<'a> !UnwindSafe for RowIteratorScan<'a>
impl<'a> Freeze for RowIteratorScan<'a>
impl<'a> Send for RowIteratorScan<'a>
impl<'a> Unpin for RowIteratorScan<'a>
impl<'a> UnsafeUnpin for RowIteratorScan<'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