pub struct OrderExplain {
pub source: &'static str,
pub reverse_walk: bool,
pub estimated_reads: u64,
pub predicate_first_reads: u64,
}Expand description
How a page ordered by a single key is read when a source already in
that order wins over reading every candidate (describe.explain).
Fields§
§source: &'static strstorage (record creation order), id or property.
reverse_walk: boolThe page is read from the far end of the order and reversed.
estimated_reads: u64Estimated rows the ordered walk reads.
predicate_first_reads: u64Rows reading every candidate would take.
Trait Implementations§
Source§impl Clone for OrderExplain
impl Clone for OrderExplain
Source§impl Debug for OrderExplain
impl Debug for OrderExplain
impl Eq for OrderExplain
Source§impl PartialEq for OrderExplain
impl PartialEq for OrderExplain
impl StructuralPartialEq for OrderExplain
Auto Trait Implementations§
impl Forget for OrderExplain
impl Freeze for OrderExplain
impl Move for OrderExplain
impl RefUnwindSafe for OrderExplain
impl Send for OrderExplain
impl Sync for OrderExplain
impl Unpin for OrderExplain
impl UnsafeUnpin for OrderExplain
impl UnwindSafe for OrderExplain
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
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§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
Compare self to
key and return true if they are equal.