Enum GraphProvider 

pub enum GraphProvider {
    PropertyGraph(CodeGraph),
    GraphIndex(ProjectIndex),
}

Variants

PropertyGraph(CodeGraph)

GraphIndex(ProjectIndex)

Implementations

impl GraphProvider

The tool-facing surface. Every file, symbol and edge it returns has passed the serve-time source check (property_graph::served, G04): the property graph carries its gate for the request that opened it, the index backend gets one per call. The *_unchecked accessors below are the raw store reads and stay private to this facade.

pub fn dependencies(&self, file_path: &str) -> Vec<String>

pub fn dependents(&self, file_path: &str) -> Vec<String>

pub fn related(&self, file_path: &str, depth: usize) -> Vec<String>

Files reached from file_path within depth. The walk itself runs over served files only: nothing is reached through a file that is not served now (property_graph::queries::impact_analysis, ProjectIndex::get_related_served).

pub fn file_paths(&self) -> Vec<String>

pub fn find_symbols( &self, name: &str, file_filter: Option<&str>, kind_filter: Option<&str>, ) -> Vec<SymbolInfo>

pub fn all_symbols(&self) -> Vec<SymbolInfo>

Every symbol with its file + line span (unfiltered by name).

pub fn get_symbol(&self, key: &str) -> Option<SymbolInfo>

pub fn edges(&self) -> Vec<EdgeInfo>

pub fn get_file_entry(&self, path: &str) -> Option<FileInfo>

pub fn related_files_scored( &self, file_path: &str, limit: usize, ) -> Vec<(String, f64)>

Scored related files using multi-edge weights (unscored deps and dependents for the index backend). Only served neighbours are ranked, and limit is applied after the check: a file that is not served now takes no slot from one that is.

pub fn node_count(&self) -> Option<usize>

pub fn edge_count(&self) -> Option<usize>

pub fn file_count(&self) -> usize

pub fn symbol_count(&self) -> usize

pub fn find_symbol_by_handle(&self, handle: &SymbolHandle) -> Option<SymbolInfo>

Resolve a stable SymbolHandle to its current SymbolInfo, robust to line drift. Resolution order:

1. Exact (path, name) — the unique {file}::{name} index key, so the common case is a single O(1) lookup that ignores the @Lline hint entirely (the symbol may have moved since the handle was emitted).
2. Otherwise, same-file candidates whose name matches exactly or by its unqualified tail (Config::load ↔ load), ranked by exact-name first, then nearest line to the handle hint, then lowest line, then name — a total, deterministic order (#498).

Returns None only when no symbol in that file plausibly matches. The @Lline is never a hard requirement, so this is strictly more robust than a brittle line-only reference.

pub fn edges_by_kind(&self, kind: &str) -> Vec<EdgeInfo>

pub fn file_entries(&self) -> Vec<FileInfo>

Every catalogued file as FileInfo. Backend-agnostic equivalent of iterating ProjectIndex::files — used by stats/bootstrap consumers that need per-file language + token counts, not just paths.

pub fn last_scan(&self) -> String

pub fn materialize_project_index(&self, project_root: &str) -> ProjectIndex

Reconstruct a full ProjectIndex from this provider — the inverse of the graph_index→PG mirror (populate_from_project_index). Lets the remaining legacy ProjectIndex consumers be sourced from the PropertyGraph (parity-proven lossless, #682.3) so the redundant JSON store can be retired (#696 phase C). For the GraphIndex backend it clones the index it already holds.

pub fn index_dir(project_root: &str) -> Option<PathBuf>