* Roll the edge table up to module granularity, for a file → module * assignment the caller decides. * * The architecture map's single query: cross-module edge counts by kind, * the `declared` subset of each (see QueryBuilder.aggregateModuleGraph), * and the busiest symbol pai
(
assignments: ReadonlyArray<{ filePath: string; module: string }>,
options: {
kinds: readonly Edge['kind'][];
minConfidence: number;
topPairsPerLink: number;
pairKinds: readonly Edge['kind'][];
}
)
| 2639 | * the number of modules rather than the number of edges. |
| 2640 | */ |
| 2641 | getModuleAggregation( |
| 2642 | assignments: ReadonlyArray<{ filePath: string; module: string }>, |
| 2643 | options: { |
| 2644 | kinds: readonly Edge['kind'][]; |
| 2645 | minConfidence: number; |
| 2646 | topPairsPerLink: number; |
| 2647 | pairKinds: readonly Edge['kind'][]; |
| 2648 | } |
| 2649 | ): ReturnType<QueryBuilder['aggregateModuleGraph']> { |
| 2650 | return this.queries.aggregateModuleGraph(assignments, options); |
| 2651 | } |
| 2652 | |
| 2653 | /** |
| 2654 | * Every ordered pair of files where one reaches into the other. See |
no test coverage detected