Struct GraphMutationReport 

pub struct GraphMutationReport {

    pub creates: usize,
    pub merges: usize,
    pub deletes: usize,
    pub patches: usize,
    pub property_removes: usize,
    pub matched_rows: usize,
    pub changed_nodes: usize,
    pub changed_edges: usize,
    pub node_upserts: usize,
    pub edge_upserts: usize,
    pub node_deletes: usize,
    pub edge_deletes: usize,
    pub node_patches: usize,
    pub edge_patches: usize,
    pub node_property_removes: usize,
    pub edge_property_removes: usize,
    pub node_inserts: usize,
    pub node_updates: usize,
    pub edge_inserts: usize,
    pub edge_updates: usize,
}

Count-oriented mutation reporting.

Reports created from a GraphMutationPlan can know exact changed node/edge counts only for single-identity operations. Matched or row-producing operations increment their coarse operation counters at planning time, while executors fill in matched_rows and granular changed_* / *_patches / *_deletes / *_upserts counters after they materialize the backend row set.

Fields

creates: usize

merges: usize

deletes: usize

patches: usize

property_removes: usize

matched_rows: usize

changed_nodes: usize

changed_edges: usize

node_upserts: usize

edge_upserts: usize

node_deletes: usize

edge_deletes: usize

node_patches: usize

edge_patches: usize

node_property_removes: usize

edge_property_removes: usize

node_inserts: usize

Upserts the executor could classify as inserting a new node, i.e. no element with the same identity existed before the write.

Only backends that can cheaply distinguish insert from update populate these (for example the in-memory store). Upsert-oriented backends that return PutOutcome::Upserted leave them at 0 and report the totals through node_upserts / edge_upserts instead, so a zero here does not mean “no inserts” — check the backend’s classification ability first.

node_updates: usize

Upserts the executor could classify as updating an existing node.

edge_inserts: usize

Upserts the executor could classify as inserting a new edge.

edge_updates: usize

Upserts the executor could classify as updating an existing edge.

Implementations

impl GraphMutationReport

pub fn record(&mut self, operation: &GraphMutationPlanOp)

Trait Implementations

impl Clone for GraphMutationReport

fn clone(&self) -> GraphMutationReport

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphMutationReport

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

Formats the value using the given formatter.

impl Default for GraphMutationReport

fn default() -> GraphMutationReport

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for GraphMutationReport

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for GraphMutationReport

impl PartialEq for GraphMutationReport

fn eq(&self, other: &GraphMutationReport) -> 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 Serialize for GraphMutationReport

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for GraphMutationReport