Enum QueryAdmissionOrdering 

pub enum QueryAdmissionOrdering {
    None,
    Requested,
    Resolved,
}

ORDER BY facts relevant to read admission.

Variants

None

No caller-visible ordering is requested.

Requested

Ordering is requested but not yet resolved into executor slots.

Resolved

Ordering has a planner-resolved executor contract.

Implementations

impl QueryAdmissionOrdering

pub const fn as_str(self) -> &'static str

Return a stable lowercase diagnostic label for this ordering state.

Trait Implementations

impl Clone for QueryAdmissionOrdering

fn clone(&self) -> QueryAdmissionOrdering

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for QueryAdmissionOrdering

impl Debug for QueryAdmissionOrdering

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Eq for QueryAdmissionOrdering

impl PartialEq for QueryAdmissionOrdering

fn eq(&self, other: &QueryAdmissionOrdering) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for QueryAdmissionOrdering