pub struct RuleStats {
pub name: String,
pub edges: u64,
pub tripped: bool,
pub fires: u64,
pub approximate: bool,
pub building: Option<BuildProgress>,
}Expand description
One rule’s provenance size, trip latch, and fire counter.
tripped is a one-way latch: once set, the engine adds no new edges for
that rule until GraphDb::rebuild_rule (and only if the full desired
set then fits). fires counts on_node_changed evaluations plus
backfill/rebuild participant ticks (rebuild counts even when it is a
provenance no-op).
Fields§
§name: String§edges: u64§tripped: bool§fires: u64§approximate: boolWhether this rule uses the approximate IVF-Flat candidate path.
building: Option<BuildProgress>Some while this rule’s vector index is still being built.
The rule derives no edges until it is None: the backfill is one
commit that runs after the index is whole, so a caller never sees a
partial edge set. Absent from the JSON when the rule is not building,
which is every rule created over a corpus at or below
core_rules::HNSW_BUILD_BATCH vectors.
Trait Implementations§
impl Eq for RuleStats
impl StructuralPartialEq for RuleStats
Auto Trait Implementations§
impl Freeze for RuleStats
impl RefUnwindSafe for RuleStats
impl Send for RuleStats
impl Sync for RuleStats
impl Unpin for RuleStats
impl UnsafeUnpin for RuleStats
impl UnwindSafe for RuleStats
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.