Struct SortOperation 

pub struct SortOperation;

Trait Implementations

impl Clone for SortOperation

fn clone(&self) -> SortOperation

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Explain for SortOperation

fn describe<'__explain>( &'__explain self, formatter: &mut ExplainFormatter<'__explain, '_>, ) -> Result

impl Labeled for SortOperation

const LABEL: &'static str = "Sort"

impl<V, O> LaneKernel<Bare<V>, Multiple<O>> for SortOperation

where V: ValueOrdering + BareValueDomain, O: OrderState, for<'a> V::Value<'a>: EnsureSortable, V::Owned: Debug + Display + Send + Sync,

type Output = OperandHandle<Bare<V>, Multiple<Ordered>>

fn execute<'a>( _graphrecord: &'a GraphRecord, values: BareStream<'a, V, Multiple<O>>, _prepared: Self::Prepared<'a>, ) -> QueryResult<<Self::Output as EvaluateOperand>::ReturnValue<'a>>

fn estimate(&self, input: Estimate, _stats: &Stats<'_>) -> Estimate

impl<I, V, O> LaneKernel<Indexed<I, V>, Multiple<O>> for SortOperation

where I: IndexDomain, V: ValueOrdering, O: OrderState, for<'a> I::Index<'a>: EnsureSortable, for<'a> V::Value<'a>: EnsureSortable, V::Owned: Debug + Display + Send + Sync,

type Output = OperandHandle<Indexed<I, V>, Multiple<Ordered>>

fn execute<'a>( _graphrecord: &'a GraphRecord, values: KeyedStream<'a, I, V, Multiple<O>>, _prepared: Self::Prepared<'a>, ) -> QueryResult<<Self::Output as EvaluateOperand>::ReturnValue<'a>>

fn estimate(&self, input: Estimate, _stats: &Stats<'_>) -> Estimate

impl Operation for SortOperation

where Self: Prepare + OperationInputs + Explain,

type Scope = Lane

impl OperationInputs for SortOperation

type Inputs<'__inputs, __Primary: '__inputs> = (&'__inputs __Primary,)

fn inputs<'__inputs, __Primary: '__inputs>( &'__inputs self, primary: &'__inputs __Primary, ) -> Self::Inputs<'__inputs, __Primary>

impl OptimizerHints for SortOperation

fn commutes_with_filter(&self) -> bool

fn allows_limit_pushdown(&self) -> bool

fn is_volatile(&self) -> bool

fn empty_rule(&self) -> EmptyRule

impl PlanIdentity for SortOperation

fn identity_eq(&self, other: &Self) -> bool

fn identity_hash<__Hasher: Hasher>(&self, state: &mut __Hasher)

impl PlanInputs for SortOperation

fn inputs(&self) -> Vec<&dyn PlanNode>

fn optimize(&self, session: &Session<'_>) -> Transformed<Self>

impl Prepare for SortOperation

type Prepared<'a> = ()

fn prepare<'a>( &'a self, _graphrecord: &'a GraphRecord, _cache: &'a EvaluationCache<'a>, ) -> QueryResult<Self::Prepared<'a>>