Struct ExternalSort 

pub struct ExternalSort<'a> { /* private fields */ }

Physical external sort with stable SQL ordering and optional global top-K.

Implementations

impl<'a> ExternalSort<'a>

pub fn new( child: Box<dyn PhysicalOperator + 'a>, keys: Vec<SortKey>, evaluator: SharedExpressionEvaluator<'a>, keep: Option<usize>, work_mem_bytes: usize, ) -> Self

pub fn with_spill_directory(self, directory: impl Into<PathBuf>) -> Self

Place sort runs in a caller-selected temporary-data directory.

pub fn initial_run_count(&self) -> usize

pub fn merge_pass_count(&self) -> usize

Trait Implementations

impl PhysicalOperator for ExternalSort<'_>

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 output_ordering(&self) -> &[PhysicalOrder]

Leading output ordering known to be preserved by this operator.

fn open(&mut self) -> ExecResult<()>

fn next(&mut self) -> ExecResult<Option<Batch>>

fn close(&mut self) -> ExecResult<()>

fn schema(&self) -> &[String]

Schema column names in logical output order.

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.

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.