pnpm 6.32.2 → 6.32.5

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (33) hide show
  1. package/README.md +3 -0
  2. package/dist/node_modules/.modules.yaml +1 -1
  3. package/dist/node_modules/.pnpm/lock.yaml +26 -21
  4. package/dist/node_modules/debug/package.json +1 -1
  5. package/dist/node_modules/debug/src/common.js +1 -1
  6. package/dist/node_modules/gauge/lib/index.js +1 -2
  7. package/dist/node_modules/gauge/package.json +13 -12
  8. package/dist/node_modules/graceful-fs/LICENSE +1 -1
  9. package/dist/node_modules/graceful-fs/graceful-fs.js +23 -4
  10. package/dist/node_modules/graceful-fs/package.json +1 -1
  11. package/dist/node_modules/graceful-fs/polyfills.js +35 -28
  12. package/dist/node_modules/semver/bin/semver.js +17 -8
  13. package/dist/node_modules/semver/classes/comparator.js +3 -2
  14. package/dist/node_modules/semver/classes/index.js +1 -1
  15. package/dist/node_modules/semver/classes/range.js +31 -22
  16. package/dist/node_modules/semver/functions/cmp.js +8 -4
  17. package/dist/node_modules/semver/functions/coerce.js +3 -2
  18. package/dist/node_modules/semver/functions/parse.js +1 -1
  19. package/dist/node_modules/semver/internal/constants.js +2 -2
  20. package/dist/node_modules/semver/internal/identifiers.js +1 -1
  21. package/dist/node_modules/semver/internal/parse-options.js +3 -3
  22. package/dist/node_modules/semver/internal/re.js +3 -3
  23. package/dist/node_modules/semver/node_modules/lru-cache/LICENSE +15 -0
  24. package/dist/node_modules/semver/node_modules/lru-cache/index.js +798 -0
  25. package/dist/node_modules/semver/node_modules/lru-cache/package.json +44 -0
  26. package/dist/node_modules/semver/package.json +46 -13
  27. package/dist/node_modules/semver/ranges/min-version.js +2 -1
  28. package/dist/node_modules/semver/ranges/outside.js +1 -1
  29. package/dist/node_modules/semver/ranges/simplify.js +15 -12
  30. package/dist/node_modules/semver/ranges/subset.js +53 -31
  31. package/dist/pnpm.cjs +1010 -1051
  32. package/package.json +15 -15
  33. package/dist/node_modules/gauge/lib/demo.js +0 -45
@@ -0,0 +1,44 @@
1
+ {
2
+ "name": "lru-cache",
3
+ "description": "A cache object that deletes the least-recently-used items.",
4
+ "version": "7.7.3",
5
+ "author": "Isaac Z. Schlueter <i@izs.me>",
6
+ "keywords": [
7
+ "mru",
8
+ "lru",
9
+ "cache"
10
+ ],
11
+ "scripts": {
12
+ "build": "",
13
+ "test": "tap",
14
+ "snap": "tap",
15
+ "size": "size-limit",
16
+ "preversion": "npm test",
17
+ "postversion": "npm publish",
18
+ "prepublishOnly": "git push origin --follow-tags"
19
+ },
20
+ "main": "index.js",
21
+ "repository": "git://github.com/isaacs/node-lru-cache.git",
22
+ "devDependencies": {
23
+ "@size-limit/preset-small-lib": "^7.0.8",
24
+ "benchmark": "^2.1.4",
25
+ "clock-mock": "^1.0.4",
26
+ "size-limit": "^7.0.8",
27
+ "tap": "^15.1.6"
28
+ },
29
+ "license": "ISC",
30
+ "files": [
31
+ "index.js"
32
+ ],
33
+ "engines": {
34
+ "node": ">=12"
35
+ },
36
+ "tap": {
37
+ "coverage-map": "map.js"
38
+ },
39
+ "size-limit": [
40
+ {
41
+ "path": "./index.js"
42
+ }
43
+ ]
44
+ }
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "semver",
3
- "version": "7.3.5",
3
+ "version": "7.3.6",
4
4
  "description": "The semantic version parser used by npm.",
5
5
  "main": "index.js",
6
6
  "scripts": {
@@ -8,34 +8,67 @@
8
8
  "snap": "tap",
9
9
  "preversion": "npm test",
10
10
  "postversion": "npm publish",
11
- "postpublish": "git push origin --follow-tags"
11
+ "postpublish": "git push origin --follow-tags",
12
+ "lint": "eslint \"**/*.js\"",
13
+ "postlint": "template-oss-check",
14
+ "lintfix": "npm run lint -- --fix",
15
+ "prepublishOnly": "git push origin --follow-tags",
16
+ "posttest": "npm run lint",
17
+ "template-oss-apply": "template-oss-apply --force"
12
18
  },
13
19
  "devDependencies": {
14
- "tap": "^14.10.7"
20
+ "@npmcli/eslint-config": "^3.0.1",
21
+ "@npmcli/template-oss": "3.2.2",
22
+ "tap": "^16.0.0"
15
23
  },
16
24
  "license": "ISC",
17
- "repository": "https://github.com/npm/node-semver",
25
+ "repository": {
26
+ "type": "git",
27
+ "url": "https://github.com/npm/node-semver.git"
28
+ },
18
29
  "bin": {
19
30
  "semver": "bin/semver.js"
20
31
  },
21
32
  "files": [
22
- "bin/**/*.js",
23
- "range.bnf",
24
- "classes/**/*.js",
25
- "functions/**/*.js",
26
- "internal/**/*.js",
27
- "ranges/**/*.js",
33
+ "bin/",
34
+ "classes/",
35
+ "functions/",
36
+ "internal/",
37
+ "ranges/",
28
38
  "index.js",
29
- "preload.js"
39
+ "preload.js",
40
+ "range.bnf"
30
41
  ],
31
42
  "tap": {
32
43
  "check-coverage": true,
33
44
  "coverage-map": "map.js"
34
45
  },
35
46
  "engines": {
36
- "node": ">=10"
47
+ "node": "^10.0.0 || ^12.0.0 || ^14.0.0 || >=16.0.0"
37
48
  },
38
49
  "dependencies": {
39
- "lru-cache": "^6.0.0"
50
+ "lru-cache": "^7.4.0"
51
+ },
52
+ "author": "GitHub Inc.",
53
+ "templateOSS": {
54
+ "//@npmcli/template-oss": "This file is partially managed by @npmcli/template-oss. Edits may be overwritten.",
55
+ "version": "3.2.2",
56
+ "ciVersions": [
57
+ "10.0.0",
58
+ "10.x",
59
+ "12.x",
60
+ "14.x",
61
+ "16.x"
62
+ ],
63
+ "distPaths": [
64
+ "bin/",
65
+ "classes/",
66
+ "functions/",
67
+ "internal/",
68
+ "ranges/",
69
+ "index.js",
70
+ "preload.js",
71
+ "range.bnf"
72
+ ]
40
73
  }
41
74
  }
@@ -47,8 +47,9 @@ const minVersion = (range, loose) => {
47
47
  throw new Error(`Unexpected operation: ${comparator.operator}`)
48
48
  }
49
49
  })
50
- if (setMin && (!minver || gt(minver, setMin)))
50
+ if (setMin && (!minver || gt(minver, setMin))) {
51
51
  minver = setMin
52
+ }
52
53
  }
53
54
 
54
55
  if (minver && range.test(minver)) {
@@ -1,6 +1,6 @@
1
1
  const SemVer = require('../classes/semver')
2
2
  const Comparator = require('../classes/comparator')
3
- const {ANY} = Comparator
3
+ const { ANY } = Comparator
4
4
  const Range = require('../classes/range')
5
5
  const satisfies = require('../functions/satisfies')
6
6
  const gt = require('../functions/gt')
@@ -5,38 +5,41 @@ const satisfies = require('../functions/satisfies.js')
5
5
  const compare = require('../functions/compare.js')
6
6
  module.exports = (versions, range, options) => {
7
7
  const set = []
8
- let min = null
8
+ let first = null
9
9
  let prev = null
10
10
  const v = versions.sort((a, b) => compare(a, b, options))
11
11
  for (const version of v) {
12
12
  const included = satisfies(version, range, options)
13
13
  if (included) {
14
14
  prev = version
15
- if (!min)
16
- min = version
15
+ if (!first) {
16
+ first = version
17
+ }
17
18
  } else {
18
19
  if (prev) {
19
- set.push([min, prev])
20
+ set.push([first, prev])
20
21
  }
21
22
  prev = null
22
- min = null
23
+ first = null
23
24
  }
24
25
  }
25
- if (min)
26
- set.push([min, null])
26
+ if (first) {
27
+ set.push([first, null])
28
+ }
27
29
 
28
30
  const ranges = []
29
31
  for (const [min, max] of set) {
30
- if (min === max)
32
+ if (min === max) {
31
33
  ranges.push(min)
32
- else if (!max && min === v[0])
34
+ } else if (!max && min === v[0]) {
33
35
  ranges.push('*')
34
- else if (!max)
36
+ } else if (!max) {
35
37
  ranges.push(`>=${min}`)
36
- else if (min === v[0])
38
+ } else if (min === v[0]) {
37
39
  ranges.push(`<=${max}`)
38
- else
40
+ } else {
39
41
  ranges.push(`${min} - ${max}`)
42
+ }
40
43
  }
41
44
  const simplified = ranges.join(' || ')
42
45
  const original = typeof range.raw === 'string' ? range.raw : String(range)
@@ -41,8 +41,9 @@ const compare = require('../functions/compare.js')
41
41
  // - Else return true
42
42
 
43
43
  const subset = (sub, dom, options = {}) => {
44
- if (sub === dom)
44
+ if (sub === dom) {
45
45
  return true
46
+ }
46
47
 
47
48
  sub = new Range(sub, options)
48
49
  dom = new Range(dom, options)
@@ -52,73 +53,84 @@ const subset = (sub, dom, options = {}) => {
52
53
  for (const simpleDom of dom.set) {
53
54
  const isSub = simpleSubset(simpleSub, simpleDom, options)
54
55
  sawNonNull = sawNonNull || isSub !== null
55
- if (isSub)
56
+ if (isSub) {
56
57
  continue OUTER
58
+ }
57
59
  }
58
60
  // the null set is a subset of everything, but null simple ranges in
59
61
  // a complex range should be ignored. so if we saw a non-null range,
60
62
  // then we know this isn't a subset, but if EVERY simple range was null,
61
63
  // then it is a subset.
62
- if (sawNonNull)
64
+ if (sawNonNull) {
63
65
  return false
66
+ }
64
67
  }
65
68
  return true
66
69
  }
67
70
 
68
71
  const simpleSubset = (sub, dom, options) => {
69
- if (sub === dom)
72
+ if (sub === dom) {
70
73
  return true
74
+ }
71
75
 
72
76
  if (sub.length === 1 && sub[0].semver === ANY) {
73
- if (dom.length === 1 && dom[0].semver === ANY)
77
+ if (dom.length === 1 && dom[0].semver === ANY) {
74
78
  return true
75
- else if (options.includePrerelease)
76
- sub = [ new Comparator('>=0.0.0-0') ]
77
- else
78
- sub = [ new Comparator('>=0.0.0') ]
79
+ } else if (options.includePrerelease) {
80
+ sub = [new Comparator('>=0.0.0-0')]
81
+ } else {
82
+ sub = [new Comparator('>=0.0.0')]
83
+ }
79
84
  }
80
85
 
81
86
  if (dom.length === 1 && dom[0].semver === ANY) {
82
- if (options.includePrerelease)
87
+ if (options.includePrerelease) {
83
88
  return true
84
- else
85
- dom = [ new Comparator('>=0.0.0') ]
89
+ } else {
90
+ dom = [new Comparator('>=0.0.0')]
91
+ }
86
92
  }
87
93
 
88
94
  const eqSet = new Set()
89
95
  let gt, lt
90
96
  for (const c of sub) {
91
- if (c.operator === '>' || c.operator === '>=')
97
+ if (c.operator === '>' || c.operator === '>=') {
92
98
  gt = higherGT(gt, c, options)
93
- else if (c.operator === '<' || c.operator === '<=')
99
+ } else if (c.operator === '<' || c.operator === '<=') {
94
100
  lt = lowerLT(lt, c, options)
95
- else
101
+ } else {
96
102
  eqSet.add(c.semver)
103
+ }
97
104
  }
98
105
 
99
- if (eqSet.size > 1)
106
+ if (eqSet.size > 1) {
100
107
  return null
108
+ }
101
109
 
102
110
  let gtltComp
103
111
  if (gt && lt) {
104
112
  gtltComp = compare(gt.semver, lt.semver, options)
105
- if (gtltComp > 0)
113
+ if (gtltComp > 0) {
106
114
  return null
107
- else if (gtltComp === 0 && (gt.operator !== '>=' || lt.operator !== '<='))
115
+ } else if (gtltComp === 0 && (gt.operator !== '>=' || lt.operator !== '<=')) {
108
116
  return null
117
+ }
109
118
  }
110
119
 
111
120
  // will iterate one or zero times
112
121
  for (const eq of eqSet) {
113
- if (gt && !satisfies(eq, String(gt), options))
122
+ if (gt && !satisfies(eq, String(gt), options)) {
114
123
  return null
124
+ }
115
125
 
116
- if (lt && !satisfies(eq, String(lt), options))
126
+ if (lt && !satisfies(eq, String(lt), options)) {
117
127
  return null
128
+ }
118
129
 
119
130
  for (const c of dom) {
120
- if (!satisfies(eq, String(c), options))
131
+ if (!satisfies(eq, String(c), options)) {
121
132
  return false
133
+ }
122
134
  }
123
135
 
124
136
  return true
@@ -154,10 +166,12 @@ const simpleSubset = (sub, dom, options) => {
154
166
  }
155
167
  if (c.operator === '>' || c.operator === '>=') {
156
168
  higher = higherGT(gt, c, options)
157
- if (higher === c && higher !== gt)
169
+ if (higher === c && higher !== gt) {
158
170
  return false
159
- } else if (gt.operator === '>=' && !satisfies(gt.semver, String(c), options))
171
+ }
172
+ } else if (gt.operator === '>=' && !satisfies(gt.semver, String(c), options)) {
160
173
  return false
174
+ }
161
175
  }
162
176
  if (lt) {
163
177
  if (needDomLTPre) {
@@ -170,37 +184,44 @@ const simpleSubset = (sub, dom, options) => {
170
184
  }
171
185
  if (c.operator === '<' || c.operator === '<=') {
172
186
  lower = lowerLT(lt, c, options)
173
- if (lower === c && lower !== lt)
187
+ if (lower === c && lower !== lt) {
174
188
  return false
175
- } else if (lt.operator === '<=' && !satisfies(lt.semver, String(c), options))
189
+ }
190
+ } else if (lt.operator === '<=' && !satisfies(lt.semver, String(c), options)) {
176
191
  return false
192
+ }
177
193
  }
178
- if (!c.operator && (lt || gt) && gtltComp !== 0)
194
+ if (!c.operator && (lt || gt) && gtltComp !== 0) {
179
195
  return false
196
+ }
180
197
  }
181
198
 
182
199
  // if there was a < or >, and nothing in the dom, then must be false
183
200
  // UNLESS it was limited by another range in the other direction.
184
201
  // Eg, >1.0.0 <1.0.1 is still a subset of <2.0.0
185
- if (gt && hasDomLT && !lt && gtltComp !== 0)
202
+ if (gt && hasDomLT && !lt && gtltComp !== 0) {
186
203
  return false
204
+ }
187
205
 
188
- if (lt && hasDomGT && !gt && gtltComp !== 0)
206
+ if (lt && hasDomGT && !gt && gtltComp !== 0) {
189
207
  return false
208
+ }
190
209
 
191
210
  // we needed a prerelease range in a specific tuple, but didn't get one
192
211
  // then this isn't a subset. eg >=1.2.3-pre is not a subset of >=1.0.0,
193
212
  // because it includes prereleases in the 1.2.3 tuple
194
- if (needDomGTPre || needDomLTPre)
213
+ if (needDomGTPre || needDomLTPre) {
195
214
  return false
215
+ }
196
216
 
197
217
  return true
198
218
  }
199
219
 
200
220
  // >=1.2.3 is lower than >1.2.3
201
221
  const higherGT = (a, b, options) => {
202
- if (!a)
222
+ if (!a) {
203
223
  return b
224
+ }
204
225
  const comp = compare(a.semver, b.semver, options)
205
226
  return comp > 0 ? a
206
227
  : comp < 0 ? b
@@ -210,8 +231,9 @@ const higherGT = (a, b, options) => {
210
231
 
211
232
  // <=1.2.3 is higher than <1.2.3
212
233
  const lowerLT = (a, b, options) => {
213
- if (!a)
234
+ if (!a) {
214
235
  return b
236
+ }
215
237
  const comp = compare(a.semver, b.semver, options)
216
238
  return comp < 0 ? a
217
239
  : comp > 0 ? b