Struct GraphRemoveAudit 

pub struct GraphRemoveAudit {
    pub node_count: usize,
    pub mount_count: usize,
}

Result of Graph::unmount / Graph::remove.

Best-effort under concurrent mutation

Counts are a point-in-time best-effort snapshot of the detached subtree, NOT a transaction-isolated tally. The unmount flow detaches the child from the parent BEFORE auditing, so the only writers that can race the count are threads holding a Graph clone of the detached child (e.g., calling state(...) / mount_new(...) on the child between detach and audit). [audit_of] recursively walks the subtree, dropping each level’s inner lock before descending — concurrent mutation within that window may shift the tally by the number of nodes/mounts added or removed.

Why deliberate v1: the single-owner graphrefly_core::OwnedCore model (D248/D255 actor-thread) makes the “Graph clone on another thread” scenario possible but narrow; a single-locked walk would require a cross-graph lock-ordering pass (parent + every descendant) that composes against state() / mount_new() re-entry — overkill for diagnostic data the spec frames as best-effort. If a real consumer needs transaction-isolated audit counts, lift via either a cross-graph multi-level lock-ordering scheme OR a copy-on-write epoch on the subtree (gated on D196 consumer pressure).

Fields

node_count: usize

Number of nodes torn down (own + recursive into mounts).

mount_count: usize

Number of mounts torn down (recursive count).

Trait Implementations

impl Clone for GraphRemoveAudit

fn clone(&self) -> GraphRemoveAudit

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for GraphRemoveAudit

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for GraphRemoveAudit

fn eq(&self, other: &GraphRemoveAudit) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for GraphRemoveAudit

impl StructuralPartialEq for GraphRemoveAudit