Struct CodeGraph 

pub struct CodeGraph { /* private fields */ }

Core graph with Arc-wrapped internals for O(1) CoW snapshots.

CodeGraph uses Arc for all internal components, enabling:

• O(1) snapshot creation via Arc cloning
• Copy-on-write semantics via Arc::make_mut
• Memory-efficient sharing between snapshots

Design

The Arc wrapping enables the MVCC pattern:

• Readers see a consistent snapshot at the time they acquired access
• Writers use Arc::make_mut to get exclusive copies only when mutating
• Multiple snapshots can coexist without copying data

Performance

• Snapshot creation: O(5) Arc clones ≈ <1μs
• Read access: Direct Arc dereference, no locking
• Write access: Arc::make_mut clones only if refcount > 1

Implementations

impl CodeGraph

pub fn new() -> Self

Creates a new empty CodeGraph.

Example

use sqry_core::graph::unified::concurrent::CodeGraph;

let graph = CodeGraph::new();
assert_eq!(graph.epoch(), 0);

pub fn from_components( nodes: NodeArena, edges: BidirectionalEdgeStore, strings: StringInterner, files: FileRegistry, indices: AuxiliaryIndices, macro_metadata: NodeMetadataStore, ) -> Self

Creates a CodeGraph from existing components.

This is useful when building a graph from external data or reconstructing from serialized state.

pub fn snapshot(&self) -> GraphSnapshot

Creates a cheap snapshot of the graph.

This operation is O(5) Arc clones, which completes in <1μs. The snapshot is isolated from future mutations to the original graph.

Example

use sqry_core::graph::unified::concurrent::CodeGraph;

let graph = CodeGraph::new();
let snapshot = graph.snapshot();
// snapshot is independent of future mutations to graph

pub fn nodes(&self) -> &NodeArena

Returns a reference to the node arena.

pub fn edges(&self) -> &BidirectionalEdgeStore

Returns a reference to the bidirectional edge store.

pub fn strings(&self) -> &StringInterner

Returns a reference to the string interner.

pub fn files(&self) -> &FileRegistry

Returns a reference to the file registry.

pub fn indices(&self) -> &AuxiliaryIndices

Returns a reference to the auxiliary indices.

pub fn macro_metadata(&self) -> &NodeMetadataStore

Returns a reference to the macro boundary metadata store.

pub fn fact_epoch(&self) -> u64

Returns the monotonic fact-layer epoch stamped on the most recently saved or loaded snapshot. Returns 0 for graphs that have not been persisted yet or were loaded from V7 snapshots.

pub fn node_provenance(&self, id: NodeId) -> Option<&NodeProvenance>

Looks up node provenance by NodeId.

Returns None if the NodeId is out of range, the slot is vacant, or the stored generation does not match (stale handle).

pub fn edge_provenance(&self, id: EdgeId) -> Option<&EdgeProvenance>

Looks up edge provenance by EdgeId.

Returns None if the EdgeId is out of range, the slot is vacant, or the edge is the invalid sentinel.

pub fn file_provenance(&self, id: FileId) -> Option<FileProvenanceView<'_>>

Returns a borrowed provenance view for a file.

Returns None for invalid/unregistered FileIds.

pub fn epoch(&self) -> u64

Returns the current epoch.

pub fn nodes_mut(&mut self) -> &mut NodeArena

Returns a mutable reference to the node arena.

Uses Arc::make_mut for copy-on-write semantics: if other references exist (e.g., snapshots), the data is cloned.

pub fn edges_mut(&mut self) -> &mut BidirectionalEdgeStore

Returns a mutable reference to the bidirectional edge store.

Uses Arc::make_mut for copy-on-write semantics.

pub fn strings_mut(&mut self) -> &mut StringInterner

Returns a mutable reference to the string interner.

Uses Arc::make_mut for copy-on-write semantics.

pub fn files_mut(&mut self) -> &mut FileRegistry

Returns a mutable reference to the file registry.

Uses Arc::make_mut for copy-on-write semantics.

pub fn indices_mut(&mut self) -> &mut AuxiliaryIndices

Returns a mutable reference to the auxiliary indices.

Uses Arc::make_mut for copy-on-write semantics.

pub fn macro_metadata_mut(&mut self) -> &mut NodeMetadataStore

Returns a mutable reference to the macro boundary metadata store.

Uses Arc::make_mut for copy-on-write semantics.

pub fn nodes_and_strings_mut(&mut self) -> (&mut NodeArena, &mut StringInterner)

Returns mutable references to both the node arena and the string interner.

This avoids the borrow-conflict that arises when calling nodes_mut() and strings_mut() separately on &mut self.

pub fn rebuild_indices(&mut self)

Rebuilds auxiliary indices from the current node arena.

This avoids the borrow conflict that arises when calling nodes() and indices_mut() separately on &mut self. Uses disjoint field borrowing to access nodes (shared) and indices (mutable) simultaneously. Internally calls AuxiliaryIndices::build_from_arena which clears existing indices and rebuilds in a single pass without per-element duplicate checking.

pub fn bump_epoch(&mut self) -> u64

Increments the epoch counter and returns the new value.

Called automatically by ConcurrentCodeGraph::write().

pub fn set_epoch(&mut self, epoch: u64)

Sets the epoch to a specific value.

This is primarily for testing or reconstruction from serialized state.

pub fn node_count(&self) -> usize

Returns the number of nodes in the graph.

This is a convenience method that delegates to nodes().len().

Example

use sqry_core::graph::unified::concurrent::CodeGraph;

let graph = CodeGraph::new();
assert_eq!(graph.node_count(), 0);

pub fn edge_count(&self) -> usize

Returns the number of edges in the graph (forward direction).

This counts edges in the forward store, including both CSR and delta edges.

Example

use sqry_core::graph::unified::concurrent::CodeGraph;

let graph = CodeGraph::new();
assert_eq!(graph.edge_count(), 0);

pub fn is_empty(&self) -> bool

Returns true if the graph contains no nodes.

This is a convenience method that delegates to nodes().is_empty().

Example

use sqry_core::graph::unified::concurrent::CodeGraph;

let graph = CodeGraph::new();
assert!(graph.is_empty());

pub fn indexed_files(&self) -> impl Iterator<Item = (FileId, &Path)>

Returns an iterator over all indexed file paths.

This is useful for enumerating all files that have been processed and added to the graph.

Example

use sqry_core::graph::unified::concurrent::CodeGraph;

let graph = CodeGraph::new();
for (file_id, path) in graph.indexed_files() {
    println!("File {}: {}", file_id.index(), path.display());
}

pub fn confidence(&self) -> &HashMap<String, ConfidenceMetadata>

Returns the per-language confidence metadata.

This contains analysis confidence information collected during graph build, primarily used by language plugins (e.g., Rust) to track analysis quality.

pub fn merge_confidence(&mut self, language: &str, metadata: ConfidenceMetadata)

Merges confidence metadata for a language.

If confidence already exists for the language, this merges the new metadata (taking the lower confidence level and combining limitations). Otherwise, it inserts the new confidence.

pub fn set_confidence( &mut self, confidence: HashMap<String, ConfidenceMetadata>, )

Sets the confidence metadata map directly.

This is primarily used when loading a graph from serialized state.

Trait Implementations

impl Clone for CodeGraph

fn clone(&self) -> CodeGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CodeGraph

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

Formats the value using the given formatter.

impl Default for CodeGraph

fn default() -> Self

Returns the “default value” for a type.

impl GraphMemorySize for CodeGraph

fn heap_bytes(&self) -> usize

Estimates the total heap bytes owned by this CodeGraph.

Sums heap usage across every component the graph owns: node arena, bidirectional edge store (forward + reverse CSR + tombstones + delta buffer), string interner, file registry, auxiliary indices, sparse macro/classpath metadata, provenance stores, and the per-language confidence map. Used by the sqryd daemon’s admission controller and workspace retention reaper to enforce memory budgets.