pub struct AccessPathSummary {
pub strategy: QueryStrategy,
pub field: Option<String>,
pub index: Option<String>,
pub candidates: usize,
pub ranked: bool,
pub filtered_on_projection: bool,
pub reads: usize,
pub branches: Option<Vec<PlanBranch>>,
pub overlay: Option<PlanOverlay>,
}Fields§
§strategy: QueryStrategy§field: Option<String>§index: Option<String>§candidates: usize§ranked: boolThe answer came out in relevance order: a search scored the candidates and no explicit
order_by overrode that order.
filtered_on_projection: boolEvery field the query touches lives in the registry’s projection, so the predicate was tested against cached values and no record was read off the log.
reads: usize§branches: Option<Vec<PlanBranch>>§overlay: Option<PlanOverlay>Set only for a query run through a unit of work — see PlanOverlay.
Trait Implementations§
Source§impl Clone for AccessPathSummary
impl Clone for AccessPathSummary
Source§impl Debug for AccessPathSummary
impl Debug for AccessPathSummary
impl Eq for AccessPathSummary
Source§impl PartialEq for AccessPathSummary
impl PartialEq for AccessPathSummary
impl StructuralPartialEq for AccessPathSummary
Auto Trait Implementations§
impl Freeze for AccessPathSummary
impl RefUnwindSafe for AccessPathSummary
impl Send for AccessPathSummary
impl Sync for AccessPathSummary
impl Unpin for AccessPathSummary
impl UnsafeUnpin for AccessPathSummary
impl UnwindSafe for AccessPathSummary
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.