Every edge by its ends' natural keys, and every reference left unresolved.
(root: string, graph: CodeGraph)
| 69 | |
| 70 | /** Every edge by its ends' natural keys, and every reference left unresolved. */ |
| 71 | function stateOf(root: string, graph: CodeGraph): string[] { |
| 72 | const keys = new Map( |
| 73 | graph.getFiles() |
| 74 | .flatMap((file) => graph.getNodesInFile(file.path)) |
| 75 | .map((n) => [n.id, `${n.kind} ${n.filePath}:${n.qualifiedName}:${n.startLine}`] as const) |
| 76 | ); |
| 77 | const edges = graph.getOutgoingEdgesFrom([...keys.keys()]) |
| 78 | .map((e) => `${e.kind} ${keys.get(e.source)} -> ${keys.get(e.target) ?? e.target} @${e.line}:${e.column} ${JSON.stringify(e.metadata ?? {})}`); |
| 79 | const db = DatabaseConnection.open(getDatabasePath(root)); |
| 80 | try { |
| 81 | const refs = (db.getDb() |
| 82 | .prepare('SELECT reference_name, reference_kind, file_path, line, col, status, name_tail FROM unresolved_refs') |
| 83 | .all() as Array<Record<string, unknown>>) |
| 84 | .map((r) => `ref ${r.file_path}:${r.line}:${r.col} ${r.reference_kind} ${r.reference_name} ${r.status} ${r.name_tail}`); |
| 85 | return [...edges, ...refs].sort(); |
| 86 | } finally { |
| 87 | db.close(); |
| 88 | } |
| 89 | } |
| 90 | |
| 91 | /** Where each reference to `refName` landed: `<source> -> <target kind> <file>::<qualified name>`. */ |
| 92 | function targetsOf(graph: CodeGraph, refName: string): string[] { |
no test coverage detected