Repository navigation
Expand file tree
/
Copy pathentryPoints.js
More file actions
110 lines (97 loc) · 3.05 KB
/
Copy pathentryPoints.js
File metadata and controls
110 lines (97 loc) · 3.05 KB
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
const entryPoints = [
{ dirs: [], bundleName: "main" },
{ dirs: ['cache'] },
{ dirs: ['core'] },
{ dirs: ['errors'] },
{ dirs: ['link', 'batch'] },
{ dirs: ['link', 'batch-http'] },
{ dirs: ['link', 'context'] },
{ dirs: ['link', 'core'] },
{ dirs: ['link', 'error'] },
{ dirs: ['link', 'http'] },
{ dirs: ['link', 'persisted-queries'] },
{ dirs: ['link', 'retry'] },
{ dirs: ['link', 'schema'] },
{ dirs: ['link', 'utils'] },
{ dirs: ['link', 'ws'] },
{ dirs: ['react'] },
{ dirs: ['react', 'components'] },
{ dirs: ['react', 'context'] },
{ dirs: ['react', 'data'] },
{ dirs: ['react', 'hoc'] },
{ dirs: ['react', 'hooks'] },
{ dirs: ['react', 'parser'] },
{ dirs: ['react', 'ssr'] },
{ dirs: ['utilities'] },
{ dirs: ['testing'], extensions: [".js", ".jsx"] },
];
const lookupTrie = Object.create(null);
entryPoints.forEach(info => {
let node = lookupTrie;
info.dirs.forEach(dir => {
const dirs = node.dirs || (node.dirs = Object.create(null));
node = dirs[dir] || (dirs[dir] = { isEntry: false });
});
node.isEntry = true;
});
exports.forEach = function(callback, context) {
entryPoints.forEach(callback, context);
};
exports.map = function map(callback, context) {
return entryPoints.map(callback, context);
};
const path = require("path").posix;
exports.check = function (id, parentId) {
const resolved = path.resolve(path.dirname(parentId), id);
const importedParts = partsAfterDist(resolved);
if (importedParts) {
const entryPointIndex = lengthOfLongestEntryPoint(importedParts);
if (entryPointIndex === importedParts.length) {
return true;
}
if (entryPointIndex >= 0) {
const parentParts = partsAfterDist(parentId);
const parentEntryPointIndex = lengthOfLongestEntryPoint(parentParts);
const sameEntryPoint =
entryPointIndex === parentEntryPointIndex &&
arraysEqualUpTo(importedParts, parentParts, entryPointIndex);
// If the imported ID and the parent ID have the same longest entry
// point prefix, then this import is safely confined within that
// entry point. Returning false lets Rollup know this import is not
// external, and can be bundled into the CJS bundle that we build
// for this shared entry point.
if (sameEntryPoint) {
return false;
}
console.warn(`Risky cross-entry-point nested import of ${id} in ${
partsAfterDist(parentId).join("/")
}`);
}
}
return false;
};
function partsAfterDist(id) {
const parts = id.split(path.sep);
const distIndex = parts.lastIndexOf("dist");
if (distIndex >= 0) {
return parts.slice(distIndex + 1);
}
}
function lengthOfLongestEntryPoint(parts) {
let node = lookupTrie;
let longest = -1;
for (let i = 0; node && i < parts.length; ++i) {
if (node.isEntry) longest = i;
node = node.dirs && node.dirs[parts[i]];
}
if (node && node.isEntry) {
return parts.length;
}
return longest;
}
function arraysEqualUpTo(a, b, end) {
for (let i = 0; i < end; ++i) {
if (a[i] !== b[i]) return false;
}
return true;
}