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
|
const t = require('tap')
const optionalSet = require('../lib/optional-set.js')
const calcDepFlags = require('../lib/calc-dep-flags.js')
const Node = require('../lib/node.js')
/*
tree (PROD a, PROD c, OPT i)
+-- a (OPT o)
+-- b (PROD c)
+-- c (OPT b)
+-- o (PROD m)
+-- m (PROD n)
+-- n ()
+-- OPT i (PROD j)
+-- j ()
Gathering the optional set from:
j: [i],
a: [],
o: [m, n],
b: []
*/
const tree = new Node({
path: '/path/to/tree',
pkg: {
dependencies: {
a: '',
c: '',
},
optionalDependencies: {
i: '',
},
},
children: [
// [name, deps, optDeps]
['a', [], ['o']],
['b', ['c'], []],
['c', [], ['b']],
['o', ['m'], []],
['m', ['n'], []],
['n', [], []],
['i', ['j'], []],
['j', [], []],
].map(([name, deps, optDeps]) => ({
pkg: {
name,
version: '1.0.0',
dependencies: deps.reduce((d, n) => {
d[n] = ''
return d
}, {}),
optionalDependencies: optDeps.reduce((d, n) => {
d[n] = ''
return d
}, {}),
},
})),
})
calcDepFlags(tree)
const nodeJ = tree.children.get('j')
const nodeI = tree.children.get('i')
const nodeA = tree.children.get('a')
const nodeO = tree.children.get('o')
const nodeM = tree.children.get('m')
const nodeN = tree.children.get('n')
const nodeB = tree.children.get('b')
const setJ = optionalSet(nodeJ)
t.equal(setJ.has(nodeJ), true, 'gathering from j includes j')
t.equal(setJ.has(nodeI), true, 'gathering from j includes i')
t.equal(setJ.size, 2, 'two nodes in j set')
const setA = optionalSet(nodeA)
t.equal(setA.size, 0, 'gathering from a is empty set')
const setO = optionalSet(nodeO)
t.equal(setO.size, 3, 'three nodes in o set')
t.equal(setO.has(nodeO), true, 'set o includes o')
t.equal(setO.has(nodeM), true, 'set o includes m')
t.equal(setO.has(nodeN), true, 'set o includes n')
const setN = optionalSet(nodeO)
t.equal(setN.size, 3, 'three nodes in n set')
t.equal(setN.has(nodeO), true, 'set n includes o')
t.equal(setN.has(nodeM), true, 'set n includes m')
t.equal(setN.has(nodeN), true, 'set n includes n')
const setB = optionalSet(nodeB)
t.equal(setB.size, 1, 'gathering from b is only b')
t.equal(setB.has(nodeB), true, 'set b includes b')
|
