pub struct Stats {
pub nodes_live: usize,
pub nodes_tombstoned: usize,
pub edges: u64,
pub rules: Vec<RuleStats>,
pub chain_truncations: u64,
pub history_floor: u64,
pub namespaces: Vec<NamespaceStats>,
}Expand description
Database-wide counters plus per-rule budget/fire stats.
Fields§
§nodes_live: usize§nodes_tombstoned: usize§edges: u64§rules: Vec<RuleStats>§chain_truncations: u64How many writes hit the rule-chaining depth cap with work still pending, since this handle was opened. Non-zero means some derived edges beyond the cap are stale and no single later write will repair them: split the rule chain or shorten it. Never persisted, so it resets on reopen.
history_floor: u64The oldest commit index history still reaches (the WAL horizon floor).
0 means nothing has been pruned and history is complete; a non-zero
value means events before that commit were pruned and are gone.
namespaces: Vec<NamespaceStats>Live node counts per namespace, in name order. Always carries
default — a store is at least its default namespace — so a
single-tenant store reads [{"name":"default", …}] and a reader can
tell “no namespaces in use” from one entry.
Trait Implementations§
impl Eq for Stats
impl StructuralPartialEq for Stats
Auto Trait Implementations§
impl Freeze for Stats
impl RefUnwindSafe for Stats
impl Send for Stats
impl Sync for Stats
impl Unpin for Stats
impl UnsafeUnpin for Stats
impl UnwindSafe for Stats
Blanket Implementations§
Source§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
Source§type ArchivedMetadata = ()
type ArchivedMetadata = ()
Source§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
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
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<T> LayoutRaw for T
impl<T> LayoutRaw for T
Source§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
Source§impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
Source§unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
Source§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
out indicating that a T is niched.