-
Notifications
You must be signed in to change notification settings - Fork 414
/
DepsGraph.ts
131 lines (109 loc) · 3.61 KB
/
DepsGraph.ts
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
import { types as t } from '@babel/core';
import ScopeManager, { PromisedNode, resolveNode } from './scope';
type Action = (this: DepsGraph, a: t.Node, b: t.Node) => void;
function addEdge(this: DepsGraph, a: t.Node, b: t.Node) {
if (this.dependencies.has(a) && this.dependencies.get(a)!.has(b)) {
// edge has been already added∂ƒ
return;
}
this.edges.push([a, b]);
if (this.dependencies.has(a)) {
this.dependencies.get(a)!.add(b);
} else {
this.dependencies.set(a, new Set([b]));
}
if (this.dependents.has(b)) {
this.dependents.get(b)!.add(a);
} else {
this.dependents.set(b, new Set([a]));
}
}
export default class DepsGraph {
public readonly imports: Map<string, t.Identifier[]> = new Map();
public readonly importAliases: Map<t.Identifier, string> = new Map();
public readonly importTypes: Map<string, 'wildcard' | 'default'> = new Map();
protected readonly edges: Array<[t.Node, t.Node]> = [];
protected readonly exports: Map<string, t.Node> = new Map();
protected readonly dependencies: Map<t.Node, Set<t.Node>> = new Map();
protected readonly dependents: Map<t.Node, Set<t.Node>> = new Map();
private actionQueue: Array<
[Action, t.Node | PromisedNode, t.Node | PromisedNode]
> = [];
private processQueue() {
if (this.actionQueue.length === 0) {
return;
}
for (const [action, a, b] of this.actionQueue) {
const resolvedA = resolveNode(a);
const resolvedB = resolveNode(b);
if (resolvedA && resolvedB) {
action.call(this, resolvedA, resolvedB);
}
}
this.actionQueue = [];
}
private getAllReferences(id: string): t.Identifier[] {
const [, name] = id.split(':');
const declaration = this.scope.getDeclaration(id)!;
const allReferences = [
...Array.from(this.dependencies.get(declaration) || []),
...Array.from(this.dependents.get(declaration) || []),
].filter((i) => t.isIdentifier(i) && i.name === name) as t.Identifier[];
allReferences.push(declaration);
return allReferences;
}
constructor(protected scope: ScopeManager) {}
addEdge(dependent: t.Node | PromisedNode, dependency: t.Node | PromisedNode) {
this.actionQueue.push([addEdge, dependent, dependency]);
}
addExport(name: string, node: t.Node) {
this.exports.set(name, node);
}
getDependenciesByBinding(id: string) {
this.processQueue();
const allReferences = this.getAllReferences(id);
const dependencies = [];
for (let [a, b] of this.edges) {
if (t.isIdentifier(a) && allReferences.includes(a)) {
dependencies.push(b);
}
}
return dependencies;
}
getDependentsByBinding(id: string) {
this.processQueue();
const allReferences = this.getAllReferences(id);
const dependents = [];
for (let [a, b] of this.edges) {
if (t.isIdentifier(b) && allReferences.includes(b)) {
dependents.push(a);
}
}
return dependents;
}
findDependencies(like: Object) {
this.processQueue();
return this.edges
.filter(([a]) => t.shallowEqual(a, like))
.map(([, b]) => b);
}
findDependents(like: object) {
this.processQueue();
return this.edges
.filter(([, b]) => t.shallowEqual(b, like))
.map(([a]) => a);
}
getDependencies(nodes: t.Node[]) {
this.processQueue();
return nodes.reduce(
(acc, node) => acc.concat(Array.from(this.dependencies.get(node) || [])),
[] as t.Node[]
);
}
getLeafs(only: string[] | null): Array<t.Node | undefined> {
this.processQueue();
return only
? only.map((name) => this.exports.get(name))
: Array.from(this.exports.values());
}
}