Struct GraphDiff 

pub struct GraphDiff {
    pub added_nodes: Vec<Node>,
    pub removed_node_ids: Vec<NodeId>,
    pub removed_files: Vec<PathBuf>,
    pub added_edges: Vec<Edge>,
    pub removed_edges: Vec<(NodeId, NodeId, EdgeKind)>,
    pub deferred_calls: Vec<(NodeId, String)>,
    pub deferred_uses: Vec<(NodeId, String)>,
    pub deferred_implements: Vec<(NodeId, String)>,
    pub deferred_inherits: Vec<(NodeId, String)>,
    pub deferred_throws: Vec<(NodeId, String)>,
    pub deferred_annotated: Vec<(NodeId, String)>,
}

Incremental change set produced by the indexer after each commit. Applying a GraphDiff to the store brings the persisted graph up to date.

Fields

added_nodes: Vec<Node>

removed_node_ids: Vec<NodeId>

Explicit node IDs to remove (e.g. from a targeted replacement).

removed_files: Vec<PathBuf>

Files that were deleted. The store removes all nodes whose file field matches any path in this list. Preferred over removed_node_ids when whole files are gone because the indexer does not need to know prior node IDs (keeping indexer ↔ store decoupled).

added_edges: Vec<Edge>

removed_edges: Vec<(NodeId, NodeId, EdgeKind)>

deferred_calls: Vec<(NodeId, String)>

Cross-file calls that couldn’t be resolved against the diff-local node set (because the callee lives in an unchanged file). The store resolves these after inserting the new nodes, using its full existing data.

deferred_uses: Vec<(NodeId, String)>

Same for parameter/return-type Uses edges.

deferred_implements: Vec<(NodeId, String)>

Same for struct→trait Implements edges.

deferred_inherits: Vec<(NodeId, String)>

Same for extends / inheritance edges.

deferred_throws: Vec<(NodeId, String)>

Same for throws ExceptionType edges.

deferred_annotated: Vec<(NodeId, String)>

Same for decorator/annotation references.

Implementations

impl GraphDiff

pub fn is_empty(&self) -> bool

pub fn merge(&mut self, other: GraphDiff)

Merge another diff into this one. Used when multiple files change in parallel and their per-file diffs are combined before a single store write.

Trait Implementations

impl Clone for GraphDiff

fn clone(&self) -> GraphDiff

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphDiff

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

Formats the value using the given formatter.

impl Default for GraphDiff

fn default() -> GraphDiff

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for GraphDiff

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for GraphDiff

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

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for GraphDiff

impl StructuralPartialEq for GraphDiff