#[non_exhaustive]pub struct EngineBaselineStats {Show 21 fields
pub graph_vertex_count: usize,
pub graph_formula_vertex_count: usize,
pub graph_edge_count: usize,
pub dirty_vertex_count: usize,
pub evaluation_vertex_count: usize,
pub formula_ast_root_count: usize,
pub formula_ast_node_count: usize,
pub staged_formula_count: usize,
pub formula_plane_active_span_count: usize,
pub formula_plane_producer_result_entries: usize,
pub formula_plane_consumer_read_entries: usize,
pub formula_plane_mixed_topology_cache_builds: u64,
pub formula_plane_mixed_topology_cache_hits: u64,
pub formula_plane_mixed_topology_cache_overflows: u64,
pub formula_plane_dirty_pending_events: usize,
pub formula_plane_dirty_region_events_recorded: u64,
pub formula_plane_dirty_span_region_events_recorded: u64,
pub formula_plane_dirty_whole_span_seeds_recorded: u64,
pub formula_plane_dirty_global_invalidations: u64,
pub formula_plane_structural_span_candidates: u64,
pub formula_plane_cycle_member_span_demotions: u64,
}Expand description
Read-only engine counters used by benchmark/instrumentation tooling.
These counters are deliberately observational: collecting them must not mutate engine state or alter formula evaluation semantics.
Fields (Non-exhaustive)§
This struct is marked as non-exhaustive
Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional
Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.graph_vertex_count: usize§graph_formula_vertex_count: usize§graph_edge_count: usize§dirty_vertex_count: usize§evaluation_vertex_count: usize§formula_ast_root_count: usize§formula_ast_node_count: usize§staged_formula_count: usize§formula_plane_active_span_count: usize§formula_plane_producer_result_entries: usize§formula_plane_consumer_read_entries: usize§formula_plane_mixed_topology_cache_builds: u64§formula_plane_mixed_topology_cache_hits: u64§formula_plane_mixed_topology_cache_overflows: u64§formula_plane_dirty_pending_events: usize§formula_plane_dirty_region_events_recorded: u64§formula_plane_dirty_span_region_events_recorded: u64§formula_plane_dirty_whole_span_seeds_recorded: u64§formula_plane_dirty_global_invalidations: u64§formula_plane_structural_span_candidates: u64§formula_plane_cycle_member_span_demotions: u64Number of spans demoted to legacy because a member participated in a statically-cyclic SCC (gotcha G8, refs #112).
Trait Implementations§
Source§impl Clone for EngineBaselineStats
impl Clone for EngineBaselineStats
Source§fn clone(&self) -> EngineBaselineStats
fn clone(&self) -> EngineBaselineStats
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreimpl Copy for EngineBaselineStats
Source§impl Debug for EngineBaselineStats
impl Debug for EngineBaselineStats
Source§impl Default for EngineBaselineStats
impl Default for EngineBaselineStats
Source§fn default() -> EngineBaselineStats
fn default() -> EngineBaselineStats
Returns the “default value” for a type. Read more
impl Eq for EngineBaselineStats
Source§impl PartialEq for EngineBaselineStats
impl PartialEq for EngineBaselineStats
impl StructuralPartialEq for EngineBaselineStats
Auto Trait Implementations§
impl Freeze for EngineBaselineStats
impl RefUnwindSafe for EngineBaselineStats
impl Send for EngineBaselineStats
impl Sync for EngineBaselineStats
impl Unpin for EngineBaselineStats
impl UnsafeUnpin for EngineBaselineStats
impl UnwindSafe for EngineBaselineStats
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
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§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.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> ⓘ
Converts
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> ⓘ
Converts
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