pub enum QueryRanking {
Total,
Calls,
Average,
Rows,
}Expand description
What a ranking of statements is ordered by.
A closed domain rather than free text, and the reason is the defect this repairs (FR-127): the manual promised a criterion, the command had none, and the global output ordering silently accepted a field the answer never carried. A no-op that ends in success is worse than a refusal, because the caller reads the ranking as though it had been ordered.
Every name is ONE word, so the spelling on the command line and the spelling
in the answer cannot drift apart. The pair that was already wrong here —
total-time in the manual against total_time in the answer — is exactly
what two-word names cost, and the product has no third convention to fall
back on.
Variants§
Total
Time the signature accounts for in total.
Calls
How many times the signature was called.
Average
Time one call of the signature costs on average.
Rows
Rows the server examined for the signature.
Implementations§
Trait Implementations§
Source§impl Clone for QueryRanking
impl Clone for QueryRanking
impl Copy for QueryRanking
Source§impl Debug for QueryRanking
impl Debug for QueryRanking
impl Eq for QueryRanking
Source§impl PartialEq for QueryRanking
impl PartialEq for QueryRanking
impl StructuralPartialEq for QueryRanking
Source§impl ValueEnum for QueryRanking
impl ValueEnum for QueryRanking
Auto Trait Implementations§
impl Freeze for QueryRanking
impl RefUnwindSafe for QueryRanking
impl Send for QueryRanking
impl Sync for QueryRanking
impl Unpin for QueryRanking
impl UnsafeUnpin for QueryRanking
impl UnwindSafe for QueryRanking
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.