CLAUDE.md@codenib/graph ยท diff
git:20260725.1d299f1 to git:20261104.2c5f286
9 added, 0 removed. Audit A to A.
What this update changes in the checks
No check changed: every fixed check gives the same answer before and after this update.
A tripped check is a label, not a verdict: read the matched text and the lines below. This week's updates that newly trip a check.
# graph/ โ rules
`CodeGraph` (`code_graph.py`) is an [igraph](https://igraph.org)-backed semantic
graph: directories/files/symbols as vertices, containment + reference as edges.
`roi_subgraph.py` extracts a region-of-interest subgraph; `traverse_graph.py`
and `dependency.py` walk it; `graph/incremental/` patches the graph in place
from LSP edits.
## Conventions
- **Node / edge types are centralized in [`codenib/types.py`](../types.py).**
Vertices: `directory`, `file`, `symbol`, `class`, `function`, `method`,
`field`. Edges: `contain`, `reference`. Use the `NODE_TYPE_*` / `EDGE_TYPE_*`
constants and `is_symbol_node()` โ never hard-code the string literals.
- **Persisted-graph schema is versioned.** `_SCHEMA_VERSION` in `code_graph.py`
guards the pickle: `load_graph()` raises if an on-disk `schema_version`
mismatches, so stale caches fail loudly instead of drifting. **Bump
`_SCHEMA_VERSION` whenever you change vertex/edge attributes or the top-level
pickle keys**, and expect cached `graph.pkl` files to be regenerated.
- **C++ decoder parity.** `core/` is a C++ backend (libigraph) mirroring
`CodeGraph` / `SCIPGraphDecoder`. If you change graph construction or the
serialized layout, keep the C++ decoder in sync โ divergence is a silent
correctness bug, not a build error.
+ ## Static path checks
+
+ - Admit actual compiler completion, not permission flags that merely allow a
+ partial build. Keep the source and artifact authentication gates intact.
+ - A line-only reference anchor cannot distinguish several same-named reads on
+ that line. Preserve unresolved candidates rather than sharing one call's proof.
+ - Diff relevance covers every possible unguarded upstream caller, including
+ name-matched callers outside the selected indexed witness.
+
## Incremental patching (`graph/incremental/`)
- One patcher per language (`patcher_python.py`, `patcher_go.py`,
`patcher_cpp.py`, `patcher_rust.py`, `patcher_ts.py`), all on
`patcher_base.py`, driven by `lsp_client.py` + `change_mgr.py`.
- A new language needs a `patcher_<lang>.py` that subclasses the base; don't
fork the dispatch logic in `graph_patcher.py`.