/
utils.ts
250 lines (230 loc) · 7.01 KB
/
utils.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
238
239
240
241
242
243
244
245
246
247
248
249
250
import { defaultHashing } from '../../hasher/hashing-impl';
import {
LockFileData,
PackageDependency,
PackageVersions,
} from './lock-file-type';
import { workspaceRoot } from '../workspace-root';
import { existsSync, readFileSync } from 'fs';
import {
ProjectGraph,
ProjectGraphExternalNode,
} from '../../config/project-graph';
/**
* Simple sort function to ensure keys are ordered alphabetically
* @param obj
* @returns
*/
export function sortObject<T = string>(
obj: Record<string, T>,
valueTransformator: (value: T) => any = (value) => value,
descending = false,
sortFunction?: (a: string, b: string) => number
): Record<string, T> | undefined {
const keys = Object.keys(obj);
if (keys.length === 0) {
return;
}
keys.sort(sortFunction);
if (descending) {
keys.reverse();
}
const result: Record<string, T> = {};
keys.forEach((key) => {
result[key] = valueTransformator(obj[key]);
});
return result;
}
/**
* Apply simple hashing of the content using the default hashing implementation
* @param fileContent
* @returns
*/
export function hashString(fileContent: string): string {
return defaultHashing.hashArray([fileContent]);
}
export function isRootVersion(packageName: string, version: string): boolean {
const fullPath = `${workspaceRoot}/node_modules/${packageName}/package.json`;
if (existsSync(fullPath)) {
const content = readFileSync(fullPath, 'utf-8');
return JSON.parse(content).version === version;
} else {
return false;
}
}
/**
* Returns node name depending whether it's root version or nested
*/
export function getNodeName(
dep: string,
version: string,
rootVersion: boolean
): `npm:${string}` {
return rootVersion ? `npm:${dep}` : `npm:${dep}@${version}`;
}
export type TransitiveLookupFunctionInput = {
packageName: string;
parentPackages: string[];
versions: PackageVersions;
version: string;
};
type TransitiveLookupFunction = (
data: TransitiveLookupFunctionInput
) => PackageDependency;
export function mapExternalNodes(
lockFileData: LockFileData,
transitiveLookupFn: TransitiveLookupFunction
) {
const result: ProjectGraph = {
dependencies: {},
externalNodes: {},
nodes: {},
};
const versionCache: Record<string, string> = {};
Object.entries(lockFileData.dependencies).forEach(
([packageName, versions]) => {
Object.values(versions).forEach(
({ version, rootVersion, dependencies, peerDependencies }) => {
// save external node
const nodeName = getNodeName(packageName, version, rootVersion);
result.externalNodes[nodeName] = {
type: 'npm',
name: nodeName,
data: {
version,
packageName,
},
};
const combinedDependencies =
dependencies || peerDependencies
? {
...(dependencies || {}),
...(peerDependencies || {}),
}
: undefined;
if (combinedDependencies) {
const nodeDependencies = [];
const transitiveDeps = mapTransitiveDependencies(
[packageName],
lockFileData.dependencies,
combinedDependencies,
versionCache,
transitiveLookupFn
);
transitiveDeps.forEach((target) => {
nodeDependencies.push({
type: 'static',
source: nodeName,
target,
});
});
result.dependencies[nodeName] = nodeDependencies;
}
}
);
}
);
return result;
}
// Finds the maching version of each dependency of the package and
// maps each {package}:{versionRange} pair to "npm:{package}@{version}" (when transitive) or "npm:{package}" (when root)
function mapTransitiveDependencies(
parentPackages: string[],
packages: Record<string, PackageVersions>,
dependencies: Record<string, string>,
versionCache: Record<string, string>,
transitiveLookupFn: TransitiveLookupFunction
): string[] {
if (!dependencies) {
return [];
}
const result: string[] = [];
Object.keys(dependencies).forEach((packageName) => {
const versions = packages[packageName];
// some of the peer dependencies might not be installed,
// we don't have them as nodes in externalNodes
// so there's no need to map them as dependencies
if (!versions) {
return;
}
// fix for pnpm versions that might have suffixes - `1.2.3_@babel+core@4.5.6`
const version = dependencies[packageName].split('_')[0];
const key = `${packageName}@${version}`;
// if we already processed this dependency, use the version from the cache
if (versionCache[key]) {
result.push(versionCache[key]);
} else {
const matchedVersion = versions[`${packageName}@${version}`]
? version
: transitiveLookupFn({
packageName,
parentPackages,
versions,
version,
})?.version;
// for some peer dependencies, we won't find installed version so we'll just ignore these
if (matchedVersion) {
const nodeName = getNodeName(
packageName,
matchedVersion,
versions[`${packageName}@${matchedVersion}`]?.rootVersion
);
result.push(nodeName);
versionCache[key] = nodeName;
}
}
});
return result;
}
export function hashExternalNodes(projectGraph: ProjectGraph) {
Object.keys(projectGraph.externalNodes).forEach((key) => {
if (!projectGraph.externalNodes[key].data.hash) {
// hash it using it's dependencies
hashExternalNode(projectGraph.externalNodes[key], projectGraph);
}
});
}
function hashExternalNode(node: ProjectGraphExternalNode, graph: ProjectGraph) {
const hashKey = `${node.data.packageName}@${node.data.version}`;
if (!graph.dependencies[node.name]) {
node.data.hash = hashString(hashKey);
} else {
const hashingInput = [hashKey];
traverseExternalNodesDependencies(node.name, graph, hashingInput);
node.data.hash = defaultHashing.hashArray(hashingInput.sort());
}
}
function traverseExternalNodesDependencies(
projectName: string,
graph: ProjectGraph,
visited: string[]
) {
graph.dependencies[projectName].forEach((d) => {
const target = graph.externalNodes[d.target];
const targetKey = `${target.data.packageName}@${target.data.version}`;
if (visited.indexOf(targetKey) === -1) {
visited.push(targetKey);
if (graph.dependencies[d.target]) {
traverseExternalNodesDependencies(d.target, graph, visited);
}
}
});
}
/**
* Generate new hash based on the original hash and pruning input parameters - packages and project name
* @param originalHash
* @param packages
* @param projectName
* @returns
*/
export function generatePrunnedHash(
originalHash: string,
packages: string[],
projectName?: string
) {
const hashingInput = [originalHash, ...packages];
if (projectName) {
hashingInput.push(projectName);
}
return defaultHashing.hashArray(hashingInput);
}