stzCodeGraph

(no comment in the source: the name reads as a sentence) initno extension

(no comment in the source: the name reads as a sentence) set rootno extension

language identity (subclasses override)no extension

(no comment in the source: the name reads as a sentence) file extensionno extension

tree-sitter scanning (real parse in the engine, no runtime) -------- Parse one source string via the vendored tree-sitter grammar for THIS language; ingest the shared line protocol it emits.no extension

(no comment in the source: the name reads as a sentence) build graphno extension

structure queriesno extension

(no comment in the source: the name reads as a sentence) classesno extension

(no comment in the source: the name reads as a sentence) number of classesno extension

(no comment in the source: the name reads as a sentence) number of methodsno extension

(no comment in the source: the name reads as a sentence) functionsno extension

(no comment in the source: the name reads as a sentence) number of functionsno extension

(no comment in the source: the name reads as a sentence) methods ofno extension

Every method as [ class, method, line ] -- the locus a code RULE needs (MethodsOf gives names only). @aMethods is [ class, method, file, line ]. The uniform graph-owned verb: the code graph checks ITSELF against the code rule set, in the unified finding shape -- so an stzRuleReport can Collect it like any other graph. (StzCheckCode remains the per-line adapter for source snippets; this is the whole-graph, unified-shape path.)no extension

(no comment in the source: the name reads as a sentence) rules are soundno extension

(no comment in the source: the name reads as a sentence) methods with linesno extension

Every module-level function as [ function, line ].no extension

every class that DEFINES this methodno extension

(no comment in the source: the name reads as a sentence) parents ofno extension

convenience: the FIRST parent (single-inheritance languages, or the MRO spine of a multiple-inheritance one), "" if none.no extension

(no comment in the source: the name reads as a sentence) file ofno extension

(no comment in the source: the name reads as a sentence) imports ofno extension

(no comment in the source: the name reads as a sentence) number of importsno extension

the inheritance chain up to a root, following the FIRST base (the MRO spine); multiple bases are visited by DescendantsOf/ImpactOf.no extension

(no comment in the source: the name reads as a sentence) subclasses ofno extension

(no comment in the source: the name reads as a sentence) descendants ofno extension

IMPACT: classes defining the method + every descendant that INHERITS it (does not redefine).no extension

(no comment in the source: the name reads as a sentence) cascadeno extension

CALL edges (present only with a real-parse backend)no extension

(no comment in the source: the name reads as a sentence) call edgesno extension

(no comment in the source: the name reads as a sentence) callers ofno extension

(no comment in the source: the name reads as a sentence) callees ofno extension

every DEFINED function/method that NO recorded call reaches (a dead-code candidate). dunder methods are runtime entry points, never dead. Name- based over the call edges -- honest about dynamic dispatch (a call through a variable can't be seen), so it names candidates, not proof.no extension

every DEFINED function/method that can reach ITSELF through >=1 call (i.e. participates in a call cycle, direct or indirect recursion).no extension

(no comment in the source: the name reads as a sentence) statsno extension