pub struct SearchStats {Show 14 fields
pub start_nodes: usize,
pub path_entries: usize,
pub evaluated_edges: usize,
pub accepted_edges: usize,
pub rejected_edges: usize,
pub skipped_revisits: usize,
pub stopped_paths: usize,
pub max_depth: usize,
pub materialized_node_payloads: usize,
pub materialized_edge_payloads: usize,
pub lazy_payload_read_calls: usize,
pub lazy_payload_requested_rows: usize,
pub lazy_payload_selected_rows: usize,
pub lazy_payload_row_groups: usize,
}Expand description
Traversal counters.
With parallel traversal, max_paths is a soft early-stop limit for in-flight
work. Returned paths are truncated exactly, while stats describe completed
evaluated work.
Fields§
§start_nodes: usizeNumber of resolved start nodes.
path_entries: usizeNumber of path states allocated or created.
evaluated_edges: usizeCandidate edges evaluated by the DSL kernel.
accepted_edges: usizeEvaluated edges accepted by visit.
rejected_edges: usizeEvaluated edges rejected by visit.
skipped_revisits: usizeCandidate edges skipped before evaluation because of revisit limits.
stopped_paths: usizeAccepted paths where stop evaluated to true.
max_depth: usizeMaximum accepted-edge depth reached by any completed path state.
materialized_node_payloads: usizeNative node payload structs materialized by a lazy typed store.
materialized_edge_payloads: usizeNative edge payload structs materialized by a lazy typed store.
lazy_payload_read_calls: usizeLazy Parquet payload read calls issued during typed native traversal.
lazy_payload_requested_rows: usizePayload rows requested by lazy typed traversal.
lazy_payload_selected_rows: usizePhysical rows selected from Parquet row groups for lazy payload reads.
lazy_payload_row_groups: usizeParquet row groups selected for lazy payload reads.
Trait Implementations§
Source§impl Clone for SearchStats
impl Clone for SearchStats
Source§fn clone(&self) -> SearchStats
fn clone(&self) -> SearchStats
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreimpl Copy for SearchStats
Source§impl Debug for SearchStats
impl Debug for SearchStats
Source§impl Default for SearchStats
impl Default for SearchStats
Source§fn default() -> SearchStats
fn default() -> SearchStats
impl Eq for SearchStats
Source§impl PartialEq for SearchStats
impl PartialEq for SearchStats
Source§fn eq(&self, other: &SearchStats) -> bool
fn eq(&self, other: &SearchStats) -> bool
self and other values to be equal, and is used by ==.impl StructuralPartialEq for SearchStats
Auto Trait Implementations§
impl Freeze for SearchStats
impl RefUnwindSafe for SearchStats
impl Send for SearchStats
impl Sync for SearchStats
impl Unpin for SearchStats
impl UnsafeUnpin for SearchStats
impl UnwindSafe for SearchStats
Blanket Implementations§
impl<T> Allocation for T
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§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.Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more