-
Notifications
You must be signed in to change notification settings - Fork 37
/
createPackageGraph.ts
161 lines (134 loc) · 5.07 KB
/
createPackageGraph.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
import type { PackageInfos } from "../types/PackageInfo";
import type { DependencyMap } from "./createDependencyMap";
import type { PackageGraph } from "../types/PackageGraph";
import { createDependencyMap } from "./createDependencyMap";
import micromatch from "micromatch";
// Reference: https://github.com/pnpm/pnpm/blob/597047fc056dd25b83638a9ab3df0df1c555ee49/packages/filter-workspace-packages/src/parsePackageSelector.ts
export interface PackageGraphFilter {
namePatterns: string[];
includeDependencies?: boolean;
includeDependents?: boolean;
withDevDependencies?: boolean;
withPeerDependencies?: boolean;
}
/** Package graph visitor is called as it visits every package in dependency order */
interface PackageGraphVisitor {
(pkg: string, dependencies: string[], dependents: string[]): void;
}
export function createPackageGraph(
packages: PackageInfos,
filters?: PackageGraphFilter[] | PackageGraphFilter
): PackageGraph {
/** set of packages being accumulated as the graph is filtered */
const packageSet = new Set<string>();
/** array of package names & its dependency being accumulated as the graph is filtered */
const edges: PackageGraph["dependencies"] = [];
const edgeKeys: Set<string> = new Set();
let dependencyMapWithPeerDevDeps: DependencyMap | undefined = undefined;
let dependencyMapWithPeerDeps: DependencyMap | undefined = undefined;
let dependencyMapWithDevDeps: DependencyMap | undefined = undefined;
let dependencyMapWithoutPeerDevDeps: DependencyMap | undefined = undefined;
function visitorForFilter(
filter: PackageGraphFilter | undefined,
pkg: string,
dependencies: string[],
dependents: string[]
) {
packageSet.add(pkg);
if (!filter || (filter.includeDependencies && dependencies)) {
for (const dep of dependencies) {
const key = edgeKey(pkg, dep);
if (!edgeKeys.has(key)) {
edgeKeys.add(key);
edges.push({ name: pkg, dependency: dep });
}
packageSet.add(dep);
}
}
if (!filter || (filter.includeDependents && dependents)) {
for (const dep of dependents) {
const key = edgeKey(dep, pkg);
if (!edgeKeys.has(key)) {
edgeKeys.add(key);
edges.push({ name: dep, dependency: pkg });
}
packageSet.add(dep);
}
}
}
if (filters) {
filters = Array.isArray(filters) ? filters : [filters];
for (const filter of filters) {
const visitor = visitorForFilter.bind(undefined, filter);
const dependencyMap = getDependencyMapForFilter(packages, filter);
visitPackageGraph(packages, dependencyMap, visitor, filter);
}
} else {
const visitor = visitorForFilter.bind(undefined, undefined);
const dependencyMap = getDependencyMapForFilter(packages);
visitPackageGraph(packages, dependencyMap, visitor);
}
return { packages: [...packageSet], dependencies: edges };
/** calculates a key, for looking up whether an edge is already added */
function edgeKey(name: string, dependency: string) {
return `${name}->${dependency}`;
}
/** gets the dependencyMap for a filter - with or without devDeps */
function getDependencyMapForFilter(packages: PackageInfos, filter?: PackageGraphFilter) {
if (!filter) {
return createDependencyMap(packages);
}
if (filter.withDevDependencies && filter.withPeerDependencies) {
dependencyMapWithPeerDevDeps ??= createDependencyMap(packages, filter);
return dependencyMapWithPeerDevDeps;
}
if (filter.withDevDependencies && !filter.withPeerDependencies) {
dependencyMapWithDevDeps ??= createDependencyMap(packages, filter);
return dependencyMapWithDevDeps;
}
if (!filter.withDevDependencies && filter.withPeerDependencies) {
dependencyMapWithPeerDeps ??= createDependencyMap(packages, filter);
return dependencyMapWithPeerDeps;
}
dependencyMapWithoutPeerDevDeps ??= createDependencyMap(packages, filter);
return dependencyMapWithoutPeerDevDeps;
}
}
function visitPackageGraph(
packages: PackageInfos,
dependencyMap: DependencyMap,
visitor: PackageGraphVisitor,
filter?: PackageGraphFilter
) {
const visited = new Set<string>();
const packageNames = Object.keys(packages);
const stack: string[] = filter ? micromatch(packageNames, filter.namePatterns) : packageNames;
while (stack.length > 0) {
const pkg = stack.pop()!;
if (visited.has(pkg)) {
continue;
}
const nextPkgs: Set<string> = new Set();
let dependencies: string[] = [];
let dependents: string[] = [];
if (!filter || filter.includeDependencies) {
dependencies = [...(dependencyMap.dependencies.get(pkg) ?? [])];
for (const dep of dependencies) {
nextPkgs.add(dep);
}
}
if (!filter || filter.includeDependents) {
dependents = [...(dependencyMap.dependents.get(pkg) ?? [])];
for (const dep of dependents) {
nextPkgs.add(dep);
}
}
visitor(pkg, dependencies, dependents);
visited.add(pkg);
if (nextPkgs.size > 0) {
for (const nextPkg of nextPkgs) {
stack.push(nextPkg);
}
}
}
}