forked from babel/babel
/
ancestry.ts
237 lines (198 loc) 路 5.82 KB
/
ancestry.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
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
// This file contains that retrieve or validate anything related to the current paths ancestry.
import { VISITOR_KEYS } from "@babel/types";
import type * as t from "@babel/types";
import NodePath from "./index";
/**
* Starting at the parent path of the current `NodePath` and going up the
* tree, return the first `NodePath` that causes the provided `callback`
* to return a truthy value, or `null` if the `callback` never returns a
* truthy value.
*/
export function findParent(
this: NodePath,
callback: (path: NodePath) => boolean,
): NodePath | null {
let path = this;
while ((path = path.parentPath)) {
if (callback(path)) return path;
}
return null;
}
/**
* Starting at current `NodePath` and going up the tree, return the first
* `NodePath` that causes the provided `callback` to return a truthy value,
* or `null` if the `callback` never returns a truthy value.
*/
export function find(
this: NodePath,
callback: (path: NodePath) => boolean,
): NodePath | null {
let path = this;
do {
if (callback(path)) return path;
} while ((path = path.parentPath));
return null;
}
/**
* Get the parent function of the current path.
*/
export function getFunctionParent(this: NodePath): NodePath<t.Function> | null {
return this.findParent(p => p.isFunction()) as NodePath<t.Function> | null;
}
/**
* Walk up the tree until we hit a parent node path in a list.
*/
export function getStatementParent(this: NodePath): NodePath<t.Statement> {
let path = this;
do {
if (
!path.parentPath ||
(Array.isArray(path.container) && path.isStatement())
) {
break;
} else {
path = path.parentPath;
}
} while (path);
if (path && (path.isProgram() || path.isFile())) {
throw new Error(
"File/Program node, we can't possibly find a statement parent to this",
);
}
return path as NodePath<t.Statement>;
}
/**
* Get the deepest common ancestor and then from it, get the earliest relationship path
* to that ancestor.
*
* Earliest is defined as being "before" all the other nodes in terms of list container
* position and visiting key.
*/
export function getEarliestCommonAncestorFrom(
this: NodePath,
paths: Array<NodePath>,
): NodePath {
return this.getDeepestCommonAncestorFrom(
paths,
function (deepest, i, ancestries) {
let earliest;
const keys = VISITOR_KEYS[deepest.type];
for (const ancestry of ancestries) {
const path = ancestry[i + 1];
// first path
if (!earliest) {
earliest = path;
continue;
}
// handle containers
if (path.listKey && earliest.listKey === path.listKey) {
// we're in the same container so check if we're earlier
if (path.key < earliest.key) {
earliest = path;
continue;
}
}
// handle keys
const earliestKeyIndex = keys.indexOf(earliest.parentKey);
const currentKeyIndex = keys.indexOf(path.parentKey as string);
if (earliestKeyIndex > currentKeyIndex) {
// key appears before so it's earlier
earliest = path;
}
}
return earliest;
},
);
}
/**
* Get the earliest path in the tree where the provided `paths` intersect.
*
* TODO: Possible optimisation target.
*/
export function getDeepestCommonAncestorFrom(
this: NodePath,
paths: Array<NodePath>,
filter?: (deepest: t.Node, i: number, ancestries: NodePath[][]) => NodePath,
): NodePath {
if (!paths.length) {
return this;
}
if (paths.length === 1) {
return paths[0];
}
// minimum depth of the tree so we know the highest node
let minDepth = Infinity;
// last common ancestor
let lastCommonIndex, lastCommon;
// get the ancestors of the path, breaking when the parent exceeds ourselves
const ancestries = paths.map(path => {
const ancestry: NodePath[] = [];
do {
ancestry.unshift(path);
} while ((path = path.parentPath) && path !== this);
// save min depth to avoid going too far in
if (ancestry.length < minDepth) {
minDepth = ancestry.length;
}
return ancestry;
});
// get the first ancestry so we have a seed to assess all other ancestries with
const first = ancestries[0];
// check ancestor equality
depthLoop: for (let i = 0; i < minDepth; i++) {
const shouldMatch = first[i];
for (const ancestry of ancestries) {
if (ancestry[i] !== shouldMatch) {
// we've hit a snag
break depthLoop;
}
}
// next iteration may break so store these so they can be returned
lastCommonIndex = i;
lastCommon = shouldMatch;
}
if (lastCommon) {
if (filter) {
return filter(lastCommon, lastCommonIndex, ancestries);
} else {
return lastCommon;
}
} else {
throw new Error("Couldn't find intersection");
}
}
/**
* Build an array of node paths containing the entire ancestry of the current node path.
*
* NOTE: The current node path is included in this.
*/
export function getAncestry(this: NodePath): Array<NodePath> {
let path = this;
const paths = [];
do {
paths.push(path);
} while ((path = path.parentPath));
return paths;
}
/**
* A helper to find if `this` path is an ancestor of @param maybeDescendant
*/
export function isAncestor(this: NodePath, maybeDescendant: NodePath): boolean {
return maybeDescendant.isDescendant(this);
}
/**
* A helper to find if `this` path is a descendant of @param maybeAncestor
*/
export function isDescendant(this: NodePath, maybeAncestor: NodePath): boolean {
return !!this.findParent(parent => parent === maybeAncestor);
}
export function inType(this: NodePath, ...candidateTypes: string[]): boolean {
let path = this;
while (path) {
for (const type of candidateTypes) {
if (path.node.type === type) return true;
}
path = path.parentPath;
}
return false;
}