@titan-design/code-graph 0.7.0 → 0.9.0

package/README.md

@@ -18,7 +18,7 @@ const { snapshotId, files, nodes, edges, reused } = await indexPaths(store, {
   ref: "head",
 });
 listNodes(store, snapshotId); // file / module / external nodes, symbols on request
-listEdges(store, snapshotId); // imports / re-exports, references on request
+listEdges(store, snapshotId); // imports / re-exports, references and calls on request
 ```
 
 ## What was extracted, and what was not
@@ -148,7 +148,7 @@ always recomputed over the whole assembled graph, so a heavily-reused run and a
 
 ## Store layout
 
-`openCodeGraph` opens the database with the kit's pragmas and runs three migrations.
+`openCodeGraph` opens the database with the kit's pragmas and runs four migrations.
 
 It refuses a database stamped past `SCHEMA_VERSION` with `SchemaTooNewError`: a code graph
 database belongs to one build, so a higher version means a newer build already moved the
@@ -163,10 +163,11 @@ every consumer reads directly: `node.language`, `node.role`, `snapshot.commit_ha
 Domain tables in `schema.ts`: `edge` (snapshot-scoped, keyed
 `(snapshot_id, src_id, dst_id, kind)` — the kit's own edge table is bi-temporal, which is the
 wrong time model for a population re-indexed all at once), `metric`, `id_alias`, and
-`file_fingerprint`.
+`file_fingerprint`. Migration 4 adds `finding` and `verdict`, both keyed
+`(snapshot_id, key)` on a `findingKey` and pruned with their snapshot.
 
 The symbol layer is hidden by default. `listNodes` drops `symbol` nodes and `listEdges` drops
-`references` edges unless you ask for them, so a caller reasoning about module structure sees
+`references` and `calls` edges unless you ask for them (`includeReferences` covers both), so a caller reasoning about module structure sees
 the graph it expects and does not have one import of thirty names read as thirty
 dependencies.
 
@@ -342,6 +343,23 @@ Python, and are written on every function or file, zeros included:
   `...`, `continue`, a bare or `None`/`null`/`undefined` return, or one call to a logger,
   `print`, `warn` or `console`).
 
+Call-graph metrics (TP-323) come from `calls` edges, one per caller and callee symbol, each
+carrying the literal arguments of every call site in `attrs.sites`. TypeScript resolves a
+call or `new` through the type checker to one in-repo declaration. Python resolves only a
+bare name declared at module level in the same file, a bare name bound by `from <in-repo
+module> import`, and `self.<name>()` to a method of the enclosing class or a base class
+declared in the same file. Anything else is dropped, never guessed, and an edge whose target
+has no symbol node is pruned. The caller is the enclosing function, method or class, or the
+file for a module-level call. Each function, method and class gets `symbol_caller_count`
+(distinct callers, recursion excluded) and `symbol_single_caller_helper` (1 when a
+non-exported, non-dunder symbol has exactly one caller and it is a symbol). A callable with 2
+or more resolved call sites also gets `symbol_constant_params`: parameters every site passes
+the same literal, or none passes. Callers found only through unresolved calls are missing, so
+a private method that tests call on an instance can read as a single-caller helper. These
+metrics need edges from every file, so they are recomputed on each index. Under reuse, an
+unchanged caller's edge to a callee that moved behind a re-export stays pruned until the
+caller changes, as `references` edges do.
+
 PageRank, relevance, and symbol coupling run at query time over one snapshot:
 
 ```ts

package/dist/index.d.ts

@@ -121,7 +121,7 @@ declare class CodeGraphStore {
     listNodes(snapshotId: number, opts?: {
         includeSymbols?: boolean;
     }): GraphNode[];
-    /** See {@link listNodes}: `references` edges are the symbol layer, excluded by default. */
+    /** See {@link listNodes}: `references` and `calls` edges are the symbol layer, excluded by default. */
     listEdges(snapshotId: number, opts?: {
         includeReferences?: boolean;
     }): GraphEdge[];
@@ -137,7 +137,7 @@ declare class CodeGraphStore {
         limit?: number;
         kind?: string;
     }): TopMetricRow[];
-    /** Edges into or out of one node; `references` edges are excluded unless asked, as in {@link listEdges}. */
+    /** Edges into or out of one node; symbol-layer edges are excluded unless asked, as in {@link listEdges}. */
     listEdgesTouching(snapshotId: number, nodeId: string, opts?: {
         includeReferences?: boolean;
     }): GraphEdge[];
@@ -175,8 +175,14 @@ declare const KIT: {
  * `file_fingerprint` is the reuse basis the incremental indexer diffs against.
  */
 declare const DOMAIN_DDL = "\n  CREATE TABLE IF NOT EXISTS edge (\n    snapshot_id INTEGER NOT NULL,\n    src_id      TEXT NOT NULL,\n    dst_id      TEXT NOT NULL,\n    kind        TEXT NOT NULL,\n    attrs       TEXT,\n    PRIMARY KEY (snapshot_id, src_id, dst_id, kind)\n  );\n  CREATE INDEX IF NOT EXISTS idx_edge_dst ON edge(snapshot_id, dst_id);\n  CREATE INDEX IF NOT EXISTS idx_edge_kind ON edge(snapshot_id, kind);\n\n  CREATE TABLE IF NOT EXISTS metric (\n    snapshot_id INTEGER NOT NULL,\n    node_id     TEXT NOT NULL,\n    name        TEXT NOT NULL,\n    value       REAL,\n    unit        TEXT,\n    PRIMARY KEY (snapshot_id, node_id, name)\n  );\n  CREATE INDEX IF NOT EXISTS idx_metric_name ON metric(snapshot_id, name);\n\n  CREATE TABLE IF NOT EXISTS id_alias (\n    snapshot_id INTEGER NOT NULL,\n    old_id      TEXT NOT NULL,\n    new_id      TEXT NOT NULL,\n    reason      TEXT NOT NULL,\n    PRIMARY KEY (snapshot_id, old_id, new_id)\n  );\n\n  CREATE TABLE IF NOT EXISTS file_fingerprint (\n    snapshot_id     INTEGER NOT NULL,\n    file_id         TEXT NOT NULL,\n    content_hash    TEXT NOT NULL,\n    structural_hash TEXT,\n    PRIMARY KEY (snapshot_id, file_id)\n  );\n";
+/**
+ * Stored audit findings and model verdicts. `key` is a `findingKey`, not `Finding.id`,
+ * because an external tool's id embeds its line number and can repeat within one audit.
+ * The whole `Finding` and a verdict's citations live in `attrs`.
+ */
+declare const FINDING_DDL = "\n  CREATE TABLE IF NOT EXISTS finding (\n    snapshot_id  INTEGER NOT NULL,\n    key          TEXT NOT NULL,\n    finding_id   TEXT NOT NULL,\n    tool         TEXT NOT NULL,\n    signal       TEXT NOT NULL,\n    path         TEXT NOT NULL,\n    line_start   INTEGER,\n    line_end     INTEGER,\n    severity     TEXT NOT NULL,\n    excerpt_hash TEXT,\n    attrs        TEXT NOT NULL,\n    PRIMARY KEY (snapshot_id, key)\n  );\n  CREATE INDEX IF NOT EXISTS idx_finding_path ON finding(snapshot_id, path);\n\n  CREATE TABLE IF NOT EXISTS verdict (\n    snapshot_id  INTEGER NOT NULL,\n    key          TEXT NOT NULL,\n    verdict      TEXT NOT NULL CHECK (verdict IN ('confirmed', 'justified', 'unclear')),\n    rationale    TEXT NOT NULL,\n    excerpt_hash TEXT NOT NULL,\n    model        TEXT,\n    run_id       TEXT,\n    cost_usd     REAL,\n    provenance   TEXT,\n    control_run  TEXT,\n    carried_from INTEGER,\n    attrs        TEXT NOT NULL,\n    PRIMARY KEY (snapshot_id, key)\n  );\n";
 /** Every table keyed by `snapshot_id`. No DDL above declares a foreign key, so dropping a snapshot walks this list. */
-declare const SNAPSHOT_SCOPED_TABLES: readonly ["node", "edge", "metric", "id_alias", "file_fingerprint"];
+declare const SNAPSHOT_SCOPED_TABLES: readonly ["node", "edge", "metric", "id_alias", "file_fingerprint", "finding", "verdict"];
 declare const MIGRATIONS: Migration[];
 /** The top of this package's schema. A code graph database is never shared, so this is the top of one. */
 declare const SCHEMA_VERSION: number;
@@ -205,7 +211,7 @@ declare function runPrune(store: CodeGraphStore, options?: PruneOptions & {
  * index version is never reused, so a change to node/edge shape or to a metric's
  * value for the same bytes can never be carried forward from an incompatible graph.
  */
-declare const INDEX_VERSION = "0.17.0";
+declare const INDEX_VERSION = "0.18.0";
 interface IndexOptions {
     /** Roots to walk. Node ids are still rooted at the git toplevel, so importers across roots share an id space. */
     paths: string[];
@@ -448,7 +454,7 @@ declare function readSourceFiles(filePaths: readonly string[]): Promise<ReadFile
  * Everything from a prior snapshot needed to rebuild an unchanged file's
  * contribution to the graph without re-parsing it: its content fingerprint,
  * the node table (to look up external-node names), outbound edges grouped by
- * source, and the source-content metrics (loc, complexity, lcom4, ...).
+ * source file (a symbol's `calls` edges under the file declaring it), and the source-content metrics (loc, complexity, lcom4, ...).
  */
 interface ReuseBasis {
     snapshotId: number;
@@ -494,10 +500,11 @@ declare function edgeWeight(e: GraphEdge): number;
 /**
  * Drop `references` edges (C-53) whose target `symbol` node doesn't exist — an
  * aliased re-export chain, or a barrel that changed under a reused file, can
- * resolve a name to an origin that doesn't declare it. Only `references` can
- * dangle (imports/re-exports resolve to always-emitted file/external nodes);
- * metrics already guard unknown ids, so this just keeps the persisted edge set
- * clean. Mutates `edges` in place.
+ * resolve a name to an origin that doesn't declare it. `calls` edges (TP-323)
+ * are dropped the same way, which is how a callee name that maps to no symbol
+ * node is discarded rather than guessed. Only these two can dangle
+ * (imports/re-exports resolve to always-emitted file/external nodes). Mutates
+ * `edges` in place.
  */
 declare function pruneDanglingReferences(nodes: ReadonlyMap<string, GraphNode>, edges: Map<string, GraphEdge>): void;
 /**
@@ -1120,7 +1127,7 @@ type MetricDirection = "higher-worse" | "lower-worse" | "neutral";
 /** A missing row reads as zero (a sparse writer's floor) or is left out of means, percentiles, and ranks. */
 type MetricAbsence = "zero" | "exclude";
 /** The code-graph module that writes the metric, for provenance. */
-type MetricSource = "degree" | "source-metrics" | "lcom" | "exception-handling" | "dead-code" | "growth-risk" | "history" | "test-linker" | "coverage";
+type MetricSource = "degree" | "source-metrics" | "lcom" | "call-graph" | "exception-handling" | "dead-code" | "growth-risk" | "history" | "test-linker" | "coverage";
 interface MetricDescriptor {
     /** The stored name, or a template such as `churn_{w}` when {@link windowed} is set. */
     name: string;
@@ -1190,6 +1197,10 @@ interface MetricOutlierRule {
     percentile: number;
     /** Fewest nodes that must carry the metric before any is judged; defaults to 20. */
     minSample?: number;
+    /** A node is flagged only if its value also exceeds this absolute floor, guarding sparse metrics whose percentile sits at or near zero. */
+    floor?: number;
+    /** When true, rank and gate on the pool of carriers with a non-zero value only; zero-valued nodes are never flagged. */
+    rankNonZero?: boolean;
     severity?: Severity;
 }
 interface ForbidImportRule {
@@ -1294,6 +1305,67 @@ interface ExternalDiagnostic {
 declare function toFindings(result: CheckResult): Finding[];
 declare function externalToFinding(input: ExternalDiagnostic): Finding;
 
+type VerdictLabel = "confirmed" | "justified" | "unclear";
+interface VerdictCitation {
+    path: string;
+    lineStart: number;
+    lineEnd: number;
+    quote: string;
+}
+/** A finding as stored against a snapshot, addressed by its `findingKey`. */
+interface StoredFinding {
+    key: string;
+    finding: Finding;
+    /** Hash of the excerpt a reader would be shown for this finding; carry-forward compares it. */
+    excerptHash?: string;
+}
+/** A model's judgement of one stored finding, after its citations were verified. */
+interface StoredVerdict {
+    key: string;
+    verdict: VerdictLabel;
+    rationale: string;
+    citations: VerdictCitation[];
+    /** Hash of the excerpt the verdict judged. */
+    excerptHash: string;
+    model?: string;
+    costUsd?: number;
+    runId?: string;
+    provenance?: string;
+    controlRun?: "ok" | "provisional";
+    dropped?: string[];
+    /** The snapshot this verdict was carried from, when carry-forward copied it. */
+    carriedFrom?: number;
+}
+interface FindingKeyInput {
+    finding: Finding;
+    /** The innermost symbol node id containing the finding; the finding's path when absent. */
+    anchor?: string;
+    /** The source text of the flagged lines. */
+    flaggedText: string;
+    excerptHash?: string;
+}
+/** Whitespace-insensitive, so reindenting or reflowing the flagged lines keeps the key. */
+declare function normalizeFlaggedText(text: string): string;
+declare function hashText(text: string): string;
+/**
+ * A finding's identity across snapshots: no line number, so an inserted line above it
+ * keeps the key, and a collision ordinal separates same-rule findings on the same text.
+ */
+declare function findingKey(input: FindingKeyInput, ordinal?: number): string;
+/** Key a whole audit's findings, numbering collisions in source order so the result ignores input order. */
+declare function keyFindings(inputs: readonly FindingKeyInput[]): StoredFinding[];
+/** Insert or replace findings by key within one snapshot. */
+declare function saveFindings(store: CodeGraphStore, snapshotId: number, findings: readonly StoredFinding[]): void;
+declare function listFindings(store: CodeGraphStore, snapshotId: number): StoredFinding[];
+/** Insert or replace verdicts by key within one snapshot. */
+declare function saveVerdicts(store: CodeGraphStore, snapshotId: number, verdicts: readonly StoredVerdict[]): void;
+declare function listVerdicts(store: CodeGraphStore, snapshotId: number): StoredVerdict[];
+/**
+ * Copy each verdict of `from` onto the finding in `to` with the same key whose excerpt hash
+ * equals the one the verdict judged. A verdict `to` already holds is kept. Returns the count copied.
+ */
+declare function carryForwardVerdicts(store: CodeGraphStore, from: number, to: number): number;
+
 /** Glob when the pattern has a `*` (`**` crosses directories, `*` stays in a segment); otherwise a case-sensitive substring. */
 declare function patternToRegex(pattern: string): RegExp;
 declare function compilePatterns(patterns: readonly string[] | undefined): RegExp[];
@@ -1614,4 +1686,4 @@ declare function getConventionMap(store: CodeGraphStore, snapshotId: number, mod
  */
 declare function findConventions(store: CodeGraphStore, snapshotId: number, query: string, embedder: Embedder, model: string, opts?: FindConventionsOptions): Promise<ConventionQueryResult>;
 
-export { ALIAS_BASE_ATTR, ALL_ROLES, type AliasChain, type AliasChainInput, type AliasChainOptions, type AliasLoader, type AliasResolution, COMMUNITY_SUMMARY_NAMESPACE, COVERAGE_METRIC_NAME, type CachedEmbedResult, type CheckDiff, type CheckResult, type CheckRule, type CheckRulesFile, type CheckSnapshotOptions, type CheckSnapshotResult, type CheckViolation, CodeGraphStore, type ConventionArea, type ConventionCorpus, type ConventionCoverage, type ConventionMap, type ConventionMatch, type ConventionOptions, type ConventionQueryResult, type ConventionSymbol, DEAD_CODE_METRIC_NAMES, DEFAULT_CHURN_WINDOWS, DEFAULT_OUTLIER_MIN_SAMPLE, DOMAIN_DDL, type DeepAst, type DeepAstInput, type DiffCheckResultsOptions, type DiffSnapshotsOptions, EXCEPTION_METRIC_NAMES, type EdgeKind, type EmbedAttempt, type EmbedCoverage, type EmbedSnapshotResult, type EmbeddableSymbol, type ExternalDiagnostic, type FileFingerprint, type FindConventionsOptions, type FindSimilarOptions, type Finding, type ForbidImportRule, GROWTH_RISK_METRIC_NAMES, type GraphDiff, type GraphDiffSummary, type GraphEdge, type GraphFragment, type GraphMetric, type GraphNode, type HistoryMetricsOptions, INDEX_VERSION, type IdAlias, type IdAliasReason, type IndexOptions, type IndexResult, type IstanbulCoverage, KIT, LanguageExtractor, type LanguageExtractorOptions, type LayeredDepsRule, type LineSpan, type Lineage, type LineageSnapshot, type LineageStep, type LinkMethod, type LinkTestsOptions, type LoadedHistory, METRIC_CATALOGUE, MIGRATIONS, type MemberInfo, type MetricAbsence, type MetricAggregate, type MetricDelta, type MetricDescriptor, type MetricDirection, type MetricMaxRule, type MetricMinRule, type MetricOutlierRule, type MetricProductMaxRule, type MetricRollup, type MetricSource, type MetricUnit, type NoInternalOnlyBarrelsRule, type NodeKind, type NodeRename, type NodeRole, type PackageFlag, type PackageLayer, type PackageStats, type PageRankOptions, type PageRankResult, type PageRankRow, type PairCoupling, type PairFlag, type ParamInfo, type PartitionQualityInput, type PartitionQualityResult, type PriorSnapshotOptions, type PruneOptions, type PrunePlan, type PruneResult, PythonGraphExtractor, type ReadFile, type ReferenceEdgeLite, type RelevanceOptions, type ResolveAliasOptions, type ReuseBasis, type RuleStore, type RunChecksOptions, SCHEMA_VERSION, SNAPSHOT_SCOPED_TABLES, SOURCE_METRIC_NAMES, SYMBOL_EMBEDDING_NAMESPACE, SYMBOL_ID_SEP, SYMBOL_METRIC_NAMES, type Severity, type SimilarCandidate, type SimilarResult, type SnapshotInsert, type SnapshotRow, type SnapshotSpec, type SourceLanguage, type SummarizeConventionsResult, type Summarizer, type SymbolConsumers, type SymbolCouplingOptions, type SymbolCouplingPair, type SymbolSpan, type TestCoverageOwnershipOptions, type TestSourceLink, type TopMetricRow, TsMorphGraphExtractor, type TsMorphGraphExtractorOptions, type UnchangedViolation, type ValidateRulesOptions, aggregateMetrics, aliasChain, annotateRoles, attributeCoverage, buildAliases, buildConventionAreas, buildEmbedText, buildFileModuleNodes, buildIndexerMetrics, buildLineage, canonicalEdgeKind, canonicalMetricName, canonicalRole, checkSnapshot, classifyRole, collectDeclaredNames, collectDeclaredSpans, compilePatterns, computeDeadCodeMetrics, computeDeepAst, computeGrowthRiskMetrics, computeMetrics, computePageRank, computePartitionQuality, computeRecencyWindows, computeRelevance, computeRoleHints, computeSourceMetrics, computeSymbolConsumers, computeSymbolCoupling, computeTestCoverageOwnership, createAliasChain, defaultTargetCount, describeMetric, describeMetrics, detectCommunities, detectGitHead, detectGitToplevel, detectRenames, diffCheckResults, diffSnapshots, edgeWeight, embedSnapshot, embedTextsCached, externalId, externalToFinding, fileId, findConventions, findSimilarCapability, getConventionMap, getEdgeWeight, groupTestsBySource, hashContent, hashEmbedText, indexPaths, invertBuckets, isGeneratedByHeuristic, isGeneratedFile, isInsideGitRepo, lineagePath, linkTestsToSources, listEdges, listEdgesTouching, listEmbeddableSymbols, listMetrics, listMetricsForNode, listNodes, loadCheckRules, loadGeneratedPatterns, loadHistoryMetrics, loadLineage, matchesAny, moduleId, openCodeGraph, packageId, parentModuleId, parseSymbolId, patternToRegex, percentileOf, planPrune, priorSnapshotForRef, pruneDanglingReferences, readSourceFiles, rebasedViolationKey, resolveAlias, resolveBarrelEdges, resolveChurnWindows, resolveGitRef, resolveSnapshot, runChecks, runPrune, snapshotPageRank, snapshotReferenceEdges, snapshotRelevance, snapshotSymbolConsumers, snapshotSymbolCoupling, snapshotViolations, structuralSignature, summarizeConventions, symbolId, testCoverageCountMetrics, toFindings, tryEmbedSnapshot, validateRules, violationKey, walkSourceFiles, windowSuffix };
+export { ALIAS_BASE_ATTR, ALL_ROLES, type AliasChain, type AliasChainInput, type AliasChainOptions, type AliasLoader, type AliasResolution, COMMUNITY_SUMMARY_NAMESPACE, COVERAGE_METRIC_NAME, type CachedEmbedResult, type CheckDiff, type CheckResult, type CheckRule, type CheckRulesFile, type CheckSnapshotOptions, type CheckSnapshotResult, type CheckViolation, CodeGraphStore, type ConventionArea, type ConventionCorpus, type ConventionCoverage, type ConventionMap, type ConventionMatch, type ConventionOptions, type ConventionQueryResult, type ConventionSymbol, DEAD_CODE_METRIC_NAMES, DEFAULT_CHURN_WINDOWS, DEFAULT_OUTLIER_MIN_SAMPLE, DOMAIN_DDL, type DeepAst, type DeepAstInput, type DiffCheckResultsOptions, type DiffSnapshotsOptions, EXCEPTION_METRIC_NAMES, type EdgeKind, type EmbedAttempt, type EmbedCoverage, type EmbedSnapshotResult, type EmbeddableSymbol, type ExternalDiagnostic, FINDING_DDL, type FileFingerprint, type FindConventionsOptions, type FindSimilarOptions, type Finding, type FindingKeyInput, type ForbidImportRule, GROWTH_RISK_METRIC_NAMES, type GraphDiff, type GraphDiffSummary, type GraphEdge, type GraphFragment, type GraphMetric, type GraphNode, type HistoryMetricsOptions, INDEX_VERSION, type IdAlias, type IdAliasReason, type IndexOptions, type IndexResult, type IstanbulCoverage, KIT, LanguageExtractor, type LanguageExtractorOptions, type LayeredDepsRule, type LineSpan, type Lineage, type LineageSnapshot, type LineageStep, type LinkMethod, type LinkTestsOptions, type LoadedHistory, METRIC_CATALOGUE, MIGRATIONS, type MemberInfo, type MetricAbsence, type MetricAggregate, type MetricDelta, type MetricDescriptor, type MetricDirection, type MetricMaxRule, type MetricMinRule, type MetricOutlierRule, type MetricProductMaxRule, type MetricRollup, type MetricSource, type MetricUnit, type NoInternalOnlyBarrelsRule, type NodeKind, type NodeRename, type NodeRole, type PackageFlag, type PackageLayer, type PackageStats, type PageRankOptions, type PageRankResult, type PageRankRow, type PairCoupling, type PairFlag, type ParamInfo, type PartitionQualityInput, type PartitionQualityResult, type PriorSnapshotOptions, type PruneOptions, type PrunePlan, type PruneResult, PythonGraphExtractor, type ReadFile, type ReferenceEdgeLite, type RelevanceOptions, type ResolveAliasOptions, type ReuseBasis, type RuleStore, type RunChecksOptions, SCHEMA_VERSION, SNAPSHOT_SCOPED_TABLES, SOURCE_METRIC_NAMES, SYMBOL_EMBEDDING_NAMESPACE, SYMBOL_ID_SEP, SYMBOL_METRIC_NAMES, type Severity, type SimilarCandidate, type SimilarResult, type SnapshotInsert, type SnapshotRow, type SnapshotSpec, type SourceLanguage, type StoredFinding, type StoredVerdict, type SummarizeConventionsResult, type Summarizer, type SymbolConsumers, type SymbolCouplingOptions, type SymbolCouplingPair, type SymbolSpan, type TestCoverageOwnershipOptions, type TestSourceLink, type TopMetricRow, TsMorphGraphExtractor, type TsMorphGraphExtractorOptions, type UnchangedViolation, type ValidateRulesOptions, type VerdictCitation, type VerdictLabel, aggregateMetrics, aliasChain, annotateRoles, attributeCoverage, buildAliases, buildConventionAreas, buildEmbedText, buildFileModuleNodes, buildIndexerMetrics, buildLineage, canonicalEdgeKind, canonicalMetricName, canonicalRole, carryForwardVerdicts, checkSnapshot, classifyRole, collectDeclaredNames, collectDeclaredSpans, compilePatterns, computeDeadCodeMetrics, computeDeepAst, computeGrowthRiskMetrics, computeMetrics, computePageRank, computePartitionQuality, computeRecencyWindows, computeRelevance, computeRoleHints, computeSourceMetrics, computeSymbolConsumers, computeSymbolCoupling, computeTestCoverageOwnership, createAliasChain, defaultTargetCount, describeMetric, describeMetrics, detectCommunities, detectGitHead, detectGitToplevel, detectRenames, diffCheckResults, diffSnapshots, edgeWeight, embedSnapshot, embedTextsCached, externalId, externalToFinding, fileId, findConventions, findSimilarCapability, findingKey, getConventionMap, getEdgeWeight, groupTestsBySource, hashContent, hashEmbedText, hashText, indexPaths, invertBuckets, isGeneratedByHeuristic, isGeneratedFile, isInsideGitRepo, keyFindings, lineagePath, linkTestsToSources, listEdges, listEdgesTouching, listEmbeddableSymbols, listFindings, listMetrics, listMetricsForNode, listNodes, listVerdicts, loadCheckRules, loadGeneratedPatterns, loadHistoryMetrics, loadLineage, matchesAny, moduleId, normalizeFlaggedText, openCodeGraph, packageId, parentModuleId, parseSymbolId, patternToRegex, percentileOf, planPrune, priorSnapshotForRef, pruneDanglingReferences, readSourceFiles, rebasedViolationKey, resolveAlias, resolveBarrelEdges, resolveChurnWindows, resolveGitRef, resolveSnapshot, runChecks, runPrune, saveFindings, saveVerdicts, snapshotPageRank, snapshotReferenceEdges, snapshotRelevance, snapshotSymbolConsumers, snapshotSymbolCoupling, snapshotViolations, structuralSignature, summarizeConventions, symbolId, testCoverageCountMetrics, toFindings, tryEmbedSnapshot, validateRules, violationKey, walkSourceFiles, windowSuffix };