(evidence: SemanticEvidence[], mapNode: (node: GraphNode, edge: SemanticEvidence, side: 'source' | 'target') => string | undefined)
| 168 | } |
| 169 | |
| 170 | function aggregate(evidence: SemanticEvidence[], mapNode: (node: GraphNode, edge: SemanticEvidence, side: 'source' | 'target') => string | undefined): SemanticEdge[] { |
| 171 | const edges = new Map<string, SemanticEdge>(); |
| 172 | const seen = new Set<string>(); |
| 173 | for (const finding of evidence) { |
| 174 | const evidenceId = `${identity(finding.source)}:${finding.type}:${identity(finding.target)}:${finding.id ?? ''}:${finding.line ?? ''}`; |
| 175 | if (seen.has(evidenceId)) continue; |
| 176 | seen.add(evidenceId); |
| 177 | const source = mapNode(finding.source, finding, 'source'); |
| 178 | const target = mapNode(finding.target, finding, 'target'); |
| 179 | // Area/file internal edges appear on drill-down; real recursive calls remain evidence. |
| 180 | if (!source || !target || (source === target && !source.startsWith('symbol:'))) continue; |
| 181 | const id = `${source}→${finding.type}→${target}`; |
| 182 | const edge = edges.get(id) ?? { id, source, target, type: finding.type, count: 0, evidence: [] }; |
| 183 | edge.evidence.push(finding); edge.count++; edges.set(id, edge); |
| 184 | } |
| 185 | return [...edges.values()].map(edge => ({ ...edge, evidence: edge.evidence.sort((a, b) => |
| 186 | compare(`${identity(a.source)}:${identity(a.target)}:${a.id ?? ''}`, `${identity(b.source)}:${identity(b.target)}:${b.id ?? ''}`)) })) |
| 187 | .sort((a, b) => compare(a.id, b.id)); |
| 188 | } |
| 189 | |
| 190 | function bounded(value: number | undefined, fallback: number, maximum: number): number { |
| 191 | return Number.isFinite(value) ? Math.max(1, Math.min(maximum, Math.floor(value!))) : fallback; |
no test coverage detected