@socketsecurity/cli-with-sentry 1.0.0 → 1.0.2

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 (66) hide show
  1. package/dist/cli.js +618 -887
  2. package/dist/cli.js.map +1 -1
  3. package/dist/constants.js +4 -4
  4. package/dist/constants.js.map +1 -1
  5. package/dist/shadow-npm-inject.js +1 -61
  6. package/dist/shadow-npm-inject.js.map +1 -1
  7. package/dist/types/cli.d.mts +1 -0
  8. package/dist/types/commands/fix/agent-fix.d.mts +36 -0
  9. package/dist/types/commands/fix/agent-fix.d.mts.map +1 -0
  10. package/dist/types/commands/fix/cmd-fix.d.mts.map +1 -1
  11. package/dist/types/commands/fix/get-actual-tree.d.mts +3 -0
  12. package/dist/types/commands/fix/get-actual-tree.d.mts.map +1 -0
  13. package/dist/types/commands/fix/handle-fix.d.mts +2 -1
  14. package/dist/types/commands/fix/handle-fix.d.mts.map +1 -1
  15. package/dist/types/commands/fix/npm-fix.d.mts +2 -10
  16. package/dist/types/commands/fix/npm-fix.d.mts.map +1 -1
  17. package/dist/types/commands/fix/pnpm-fix.d.mts +2 -10
  18. package/dist/types/commands/fix/pnpm-fix.d.mts.map +1 -1
  19. package/dist/types/commands/manifest/convert_gradle_to_maven.d.mts.map +1 -1
  20. package/dist/types/commands/optimize/add-overrides.d.mts.map +1 -1
  21. package/dist/types/commands/optimize/get-overrides-by-agent.d.mts +36 -3
  22. package/dist/types/commands/optimize/get-overrides-by-agent.d.mts.map +1 -1
  23. package/dist/types/commands/repository/output-list-repos.d.mts.map +1 -1
  24. package/dist/types/commands/scan/cmd-scan-create.d.mts.map +1 -1
  25. package/dist/types/commands/scan/cmd-scan-github.d.mts.map +1 -1
  26. package/dist/types/commands/scan/handle-create-github-scan.d.mts.map +1 -1
  27. package/dist/types/commands/scan/output-scan-github.d.mts +3 -0
  28. package/dist/types/commands/scan/output-scan-github.d.mts.map +1 -0
  29. package/dist/types/commands/scan/scan-reachability.d.mts.map +1 -1
  30. package/dist/types/commands/scan/suggest-org-slug.d.mts.map +1 -1
  31. package/dist/types/commands/scan/suggest-to-persist-orgslug.d.mts +2 -0
  32. package/dist/types/commands/scan/suggest-to-persist-orgslug.d.mts.map +1 -0
  33. package/dist/types/utils/cmd.d.mts +1 -0
  34. package/dist/types/utils/cmd.d.mts.map +1 -1
  35. package/dist/types/utils/coana.d.mts +4 -0
  36. package/dist/types/utils/coana.d.mts.map +1 -0
  37. package/dist/types/utils/config.d.mts +2 -1
  38. package/dist/types/utils/config.d.mts.map +1 -1
  39. package/dist/types/utils/determine-org-slug.d.mts.map +1 -1
  40. package/dist/types/utils/lockfile.d.mts +2 -0
  41. package/dist/types/utils/lockfile.d.mts.map +1 -0
  42. package/dist/types/utils/meow-with-subcommands.d.mts +1 -1
  43. package/dist/types/utils/meow-with-subcommands.d.mts.map +1 -1
  44. package/dist/types/utils/package-environment.d.mts +11 -11
  45. package/dist/types/utils/package-environment.d.mts.map +1 -1
  46. package/dist/types/utils/pnpm.d.mts +1 -1
  47. package/dist/types/utils/pnpm.d.mts.map +1 -1
  48. package/dist/types/utils/semver.d.mts.map +1 -1
  49. package/dist/utils.js +160 -30
  50. package/dist/utils.js.map +1 -1
  51. package/dist/vendor.js +8021 -7993
  52. package/external/@coana-tech/cli/cli.mjs +14035 -3820
  53. package/external/@socketsecurity/registry/external/@npmcli/package-json/index.js +7 -7
  54. package/external/@socketsecurity/registry/external/@socketregistry/packageurl-js.js +12 -8
  55. package/external/@socketsecurity/registry/external/browserslist.js +374 -347
  56. package/external/@socketsecurity/registry/external/cacache.js +6 -6
  57. package/external/@socketsecurity/registry/external/libnpmpack.js +47 -45
  58. package/external/@socketsecurity/registry/external/make-fetch-happen.js +37 -36
  59. package/external/@socketsecurity/registry/external/pacote.js +45 -44
  60. package/external/@socketsecurity/registry/lib/spawn.js +11 -2
  61. package/external/@socketsecurity/registry/manifest.json +2 -2
  62. package/external/blessed-contrib/lib/widget/charts/bar.js +6 -3
  63. package/external/blessed-contrib/lib/widget/charts/line.js +6 -3
  64. package/package.json +31 -31
  65. package/dist/types/commands/fix/run-fix.d.mts +0 -12
  66. package/dist/types/commands/fix/run-fix.d.mts.map +0 -1
@@ -10386,8 +10386,8 @@ function requireBraceExpansion() {
10386
10386
  const pre = m.pre
10387
10387
  const post = m.post.length ? expand(m.post, false) : ['']
10388
10388
  if (m.pre.endsWith('\u0024' /*'$'*/)) {
10389
- for (let k = 0; k < post.length; k++) {
10390
- const expansion = pre + '{' + m.body + '}' + post[k]
10389
+ for (var k = 0; k < post.length; k++) {
10390
+ var expansion = pre + '{' + m.body + '}' + post[k]
10391
10391
  expansions.push(expansion)
10392
10392
  }
10393
10393
  } else {
@@ -10462,13 +10462,13 @@ function requireBraceExpansion() {
10462
10462
  }
10463
10463
  } else {
10464
10464
  N = []
10465
- for (let j = 0; j < n.length; j++) {
10465
+ for (var j = 0; j < n.length; j++) {
10466
10466
  N.push.apply(N, expand(n[j], false))
10467
10467
  }
10468
10468
  }
10469
- for (let j = 0; j < N.length; j++) {
10470
- for (let k = 0; k < post.length; k++) {
10471
- const expansion = pre + N[j] + post[k]
10469
+ for (var j = 0; j < N.length; j++) {
10470
+ for (var k = 0; k < post.length; k++) {
10471
+ var expansion = pre + N[j] + post[k]
10472
10472
  if (!isTop || isSequence || expansion) {
10473
10473
  expansions.push(expansion)
10474
10474
  }
@@ -3729,8 +3729,8 @@ function requireBraceExpansion() {
3729
3729
  const pre = m.pre
3730
3730
  const post = m.post.length ? expand(m.post, false) : ['']
3731
3731
  if (m.pre.endsWith('\u0024' /*'$'*/)) {
3732
- for (let k = 0; k < post.length; k++) {
3733
- const expansion = pre + '{' + m.body + '}' + post[k]
3732
+ for (var k = 0; k < post.length; k++) {
3733
+ var expansion = pre + '{' + m.body + '}' + post[k]
3734
3734
  expansions.push(expansion)
3735
3735
  }
3736
3736
  } else {
@@ -3805,13 +3805,13 @@ function requireBraceExpansion() {
3805
3805
  }
3806
3806
  } else {
3807
3807
  N = []
3808
- for (let j = 0; j < n.length; j++) {
3808
+ for (var j = 0; j < n.length; j++) {
3809
3809
  N.push.apply(N, expand(n[j], false))
3810
3810
  }
3811
3811
  }
3812
- for (let j = 0; j < N.length; j++) {
3813
- for (let k = 0; k < post.length; k++) {
3814
- const expansion = pre + N[j] + post[k]
3812
+ for (var j = 0; j < N.length; j++) {
3813
+ for (var k = 0; k < post.length; k++) {
3814
+ var expansion = pre + N[j] + post[k]
3815
3815
  if (!isTop || isSequence || expansion) {
3816
3816
  expansions.push(expansion)
3817
3817
  }
@@ -11650,7 +11650,7 @@ function requireRetry$1() {
11650
11650
  throw new Error('minTimeout is greater than maxTimeout')
11651
11651
  }
11652
11652
  const timeouts = []
11653
- for (let i = 0; i < opts.retries; i++) {
11653
+ for (var i = 0; i < opts.retries; i++) {
11654
11654
  timeouts.push(this.createTimeout(i, opts))
11655
11655
  }
11656
11656
  if (options && options.forever && !timeouts.length) {
@@ -28456,7 +28456,7 @@ function requireYallist() {
28456
28456
  }
28457
28457
  }
28458
28458
  Yallist.prototype.get = function (n) {
28459
- for (let i = 0, walker = this.head; walker !== null && i < n; i++) {
28459
+ for (var i = 0, walker = this.head; walker !== null && i < n; i++) {
28460
28460
  // abort out of the list early if we hit a cycle
28461
28461
  walker = walker.next
28462
28462
  }
@@ -28465,7 +28465,7 @@ function requireYallist() {
28465
28465
  }
28466
28466
  }
28467
28467
  Yallist.prototype.getReverse = function (n) {
28468
- for (let i = 0, walker = this.tail; walker !== null && i < n; i++) {
28468
+ for (var i = 0, walker = this.tail; walker !== null && i < n; i++) {
28469
28469
  // abort out of the list early if we hit a cycle
28470
28470
  walker = walker.prev
28471
28471
  }
@@ -28560,7 +28560,7 @@ function requireYallist() {
28560
28560
  if (to > this.length) {
28561
28561
  to = this.length
28562
28562
  }
28563
- for (let i = 0, walker = this.head; walker !== null && i < from; i++) {
28563
+ for (var i = 0, walker = this.head; walker !== null && i < from; i++) {
28564
28564
  walker = walker.next
28565
28565
  }
28566
28566
  for (; walker !== null && i < to; i++, walker = walker.next) {
@@ -28588,7 +28588,7 @@ function requireYallist() {
28588
28588
  to = this.length
28589
28589
  }
28590
28590
  for (
28591
- let i = this.length, walker = this.tail;
28591
+ var i = this.length, walker = this.tail;
28592
28592
  walker !== null && i > to;
28593
28593
  i--
28594
28594
  ) {
@@ -28606,11 +28606,11 @@ function requireYallist() {
28606
28606
  if (start < 0) {
28607
28607
  start = this.length + start
28608
28608
  }
28609
- for (let i = 0, walker = this.head; walker !== null && i < start; i++) {
28609
+ for (var i = 0, walker = this.head; walker !== null && i < start; i++) {
28610
28610
  walker = walker.next
28611
28611
  }
28612
28612
  const ret = []
28613
- for (let i = 0; walker && i < deleteCount; i++) {
28613
+ for (var i = 0; walker && i < deleteCount; i++) {
28614
28614
  ret.push(walker.value)
28615
28615
  walker = this.removeNode(walker)
28616
28616
  }
@@ -28620,7 +28620,7 @@ function requireYallist() {
28620
28620
  if (walker !== this.head && walker !== this.tail) {
28621
28621
  walker = walker.prev
28622
28622
  }
28623
- for (let i = 0; i < nodes.length; i++) {
28623
+ for (var i = 0; i < nodes.length; i++) {
28624
28624
  walker = insert(this, walker, nodes[i])
28625
28625
  }
28626
28626
  return ret
@@ -37024,7 +37024,7 @@ function requireUtf32() {
37024
37024
  dst[offset++] = high >> 8
37025
37025
 
37026
37026
  // Low surrogate is written below.
37027
- let codepoint = 0xdc00 | (codepoint & 0x3ff)
37027
+ var codepoint = 0xdc00 | (codepoint & 0x3ff)
37028
37028
  }
37029
37029
 
37030
37030
  // Write BMP char or low surrogate.
@@ -37471,7 +37471,7 @@ function requireUtf7() {
37471
37471
  // "+-" -> "+"
37472
37472
  res += '+'
37473
37473
  } else {
37474
- let b64str =
37474
+ var b64str =
37475
37475
  base64Accum + this.iconv.decode(buf.slice(lastI, i), 'ascii')
37476
37476
  res += this.iconv.decode(Buffer.from(b64str, 'base64'), 'utf16-be')
37477
37477
  }
@@ -37488,7 +37488,7 @@ function requireUtf7() {
37488
37488
  if (!inBase64) {
37489
37489
  res += this.iconv.decode(buf.slice(lastI), 'ascii') // Write direct chars.
37490
37490
  } else {
37491
- let b64str = base64Accum + this.iconv.decode(buf.slice(lastI), 'ascii')
37491
+ var b64str = base64Accum + this.iconv.decode(buf.slice(lastI), 'ascii')
37492
37492
  const canBeDecoded = b64str.length - (b64str.length % 8) // Minimal chunk: 2 quads -> 2x3 bytes -> 3 chars.
37493
37493
  base64Accum = b64str.slice(canBeDecoded) // The rest will be decoded in future.
37494
37494
  b64str = b64str.slice(0, canBeDecoded)
@@ -37650,7 +37650,7 @@ function requireUtf7() {
37650
37650
  // "&-" -> "&"
37651
37651
  res += '&'
37652
37652
  } else {
37653
- let b64str =
37653
+ var b64str =
37654
37654
  base64Accum +
37655
37655
  this.iconv.decode(buf.slice(lastI, i), 'ascii').replace(/,/g, '/')
37656
37656
  res += this.iconv.decode(Buffer.from(b64str, 'base64'), 'utf16-be')
@@ -37668,7 +37668,7 @@ function requireUtf7() {
37668
37668
  if (!inBase64) {
37669
37669
  res += this.iconv.decode(buf.slice(lastI), 'ascii') // Write direct chars.
37670
37670
  } else {
37671
- let b64str =
37671
+ var b64str =
37672
37672
  base64Accum +
37673
37673
  this.iconv.decode(buf.slice(lastI), 'ascii').replace(/,/g, '/')
37674
37674
  const canBeDecoded = b64str.length - (b64str.length % 8) // Minimal chunk: 2 quads -> 2x3 bytes -> 3 chars.
@@ -37727,7 +37727,7 @@ function requireSbcsCodec() {
37727
37727
  }
37728
37728
  if (codecOptions.chars.length === 128) {
37729
37729
  let asciiString = ''
37730
- for (let i = 0; i < 128; i++) {
37730
+ for (var i = 0; i < 128; i++) {
37731
37731
  asciiString += String.fromCharCode(i)
37732
37732
  }
37733
37733
  codecOptions.chars = asciiString + codecOptions.chars
@@ -37739,7 +37739,7 @@ function requireSbcsCodec() {
37739
37739
  65536,
37740
37740
  iconv.defaultCharSingleByte.charCodeAt(0)
37741
37741
  )
37742
- for (let i = 0; i < codecOptions.chars.length; i++) {
37742
+ for (var i = 0; i < codecOptions.chars.length; i++) {
37743
37743
  encodeBuf[codecOptions.chars.charCodeAt(i)] = i
37744
37744
  }
37745
37745
  this.encodeBuf = encodeBuf
@@ -38532,7 +38532,7 @@ function requireDbcsCodec() {
38532
38532
  this.decodeTableSeq = []
38533
38533
 
38534
38534
  // Actual mapping tables consist of chunks. Use them to fill up decode tables.
38535
- for (let i = 0; i < mappingTable.length; i++) {
38535
+ for (var i = 0; i < mappingTable.length; i++) {
38536
38536
  this._addDecodeChunk(mappingTable[i])
38537
38537
  }
38538
38538
 
@@ -38548,9 +38548,9 @@ function requireDbcsCodec() {
38548
38548
 
38549
38549
  // Fill out the tree
38550
38550
  const firstByteNode = this.decodeTables[0]
38551
- for (let i = 0x81; i <= 0xfe; i++) {
38551
+ for (var i = 0x81; i <= 0xfe; i++) {
38552
38552
  const secondByteNode = this.decodeTables[NODE_START - firstByteNode[i]]
38553
- for (let j = 0x30; j <= 0x39; j++) {
38553
+ for (var j = 0x30; j <= 0x39; j++) {
38554
38554
  if (secondByteNode[j] === UNASSIGNED) {
38555
38555
  secondByteNode[j] = NODE_START - commonThirdByteNodeIdx
38556
38556
  } else if (secondByteNode[j] > NODE_START) {
@@ -38676,7 +38676,7 @@ function requireDbcsCodec() {
38676
38676
  const part = chunk[k]
38677
38677
  if (typeof part === 'string') {
38678
38678
  // String, write as-is.
38679
- for (let l = 0; l < part.length; ) {
38679
+ for (var l = 0; l < part.length; ) {
38680
38680
  const code = part.charCodeAt(l++)
38681
38681
  if (0xd800 <= code && code < 0xdc00) {
38682
38682
  // Decode surrogate
@@ -38709,7 +38709,7 @@ function requireDbcsCodec() {
38709
38709
  } else if (typeof part === 'number') {
38710
38710
  // Integer, meaning increasing sequence starting with prev character.
38711
38711
  let charCode = writeTable[curAddr - 1] + 1
38712
- for (let l = 0; l < part; l++) {
38712
+ for (var l = 0; l < part; l++) {
38713
38713
  writeTable[curAddr++] = charCode++
38714
38714
  }
38715
38715
  } else {
@@ -38851,9 +38851,9 @@ function requireDbcsCodec() {
38851
38851
  if (i == str.length) {
38852
38852
  break
38853
38853
  }
38854
- let uCode = str.charCodeAt(i++)
38854
+ var uCode = str.charCodeAt(i++)
38855
38855
  } else {
38856
- let uCode = nextChar
38856
+ var uCode = nextChar
38857
38857
  nextChar = -1
38858
38858
  }
38859
38859
 
@@ -38926,7 +38926,7 @@ function requireDbcsCodec() {
38926
38926
  // Use GB18030 algorithm to find character(s) to write.
38927
38927
  const idx = findIdx(this.gb18030.uChars, uCode)
38928
38928
  if (idx != -1) {
38929
- let dbcsCode =
38929
+ dbcsCode =
38930
38930
  this.gb18030.gbChars[idx] + (uCode - this.gb18030.uChars[idx])
38931
38931
  newBuf[j++] = 0x81 + Math.floor(dbcsCode / 12600)
38932
38932
  dbcsCode = dbcsCode % 12600
@@ -38971,9 +38971,10 @@ function requireDbcsCodec() {
38971
38971
 
38972
38972
  let newBuf = Buffer.alloc(10),
38973
38973
  j = 0
38974
+ let dbcsCode
38974
38975
  if (this.seqObj) {
38975
38976
  // We're in the sequence.
38976
- const dbcsCode = this.seqObj[DEF_CHAR]
38977
+ dbcsCode = this.seqObj[DEF_CHAR]
38977
38978
  if (dbcsCode !== undefined) {
38978
38979
  // Write beginning of the sequence.
38979
38980
  if (dbcsCode < 0x100) {
@@ -39017,7 +39018,7 @@ function requireDbcsCodec() {
39017
39018
  seqStart = -this.prevBytes.length,
39018
39019
  // idx of the start of current parsed sequence.
39019
39020
  uCode
39020
- for (let i = 0, j = 0; i < buf.length; i++) {
39021
+ for (var i = 0, j = 0; i < buf.length; i++) {
39021
39022
  const curByte = i >= 0 ? buf[i] : prevBytes[i + prevOffset]
39022
39023
 
39023
39024
  // Lookup in current trie node.
@@ -39030,13 +39031,13 @@ function requireDbcsCodec() {
39030
39031
  i = seqStart // Skip one byte ('i' will be incremented by the for loop) and try to parse again.
39031
39032
  } else if (uCode === GB18030_CODE) {
39032
39033
  if (i >= 3) {
39033
- const ptr =
39034
+ var ptr =
39034
39035
  (buf[i - 3] - 0x81) * 12600 +
39035
39036
  (buf[i - 2] - 0x30) * 1260 +
39036
39037
  (buf[i - 1] - 0x81) * 10 +
39037
39038
  (curByte - 0x30)
39038
39039
  } else {
39039
- const ptr =
39040
+ var ptr =
39040
39041
  (prevBytes[i - 3 + prevOffset] - 0x81) * 12600 +
39041
39042
  ((i - 2 >= 0 ? buf[i - 2] : prevBytes[i - 2 + prevOffset]) - 0x30) *
39042
39043
  1260 +
@@ -46851,7 +46852,7 @@ function requireLib$q() {
46851
46852
  // ignoring coverage so tests don't have to fake support (or lack of) for brotli
46852
46853
  // istanbul ignore next
46853
46854
  try {
46854
- const decoder = new zlib.BrotliDecompress()
46855
+ var decoder = new zlib.BrotliDecompress()
46855
46856
  } catch (err) {
46856
46857
  reject(err)
46857
46858
  finalize()
@@ -48340,7 +48341,7 @@ function requireCharset() {
48340
48341
 
48341
48342
  function parseAcceptCharset(accept) {
48342
48343
  const accepts = accept.split(',')
48343
- for (let i = 0, j = 0; i < accepts.length; i++) {
48344
+ for (var i = 0, j = 0; i < accepts.length; i++) {
48344
48345
  const charset = parseCharset(accepts[i].trim(), i)
48345
48346
  if (charset) {
48346
48347
  accepts[j++] = charset
@@ -48520,7 +48521,7 @@ function requireEncoding$3() {
48520
48521
  const accepts = accept.split(',')
48521
48522
  let hasIdentity = false
48522
48523
  let minQuality = 1
48523
- for (let i = 0, j = 0; i < accepts.length; i++) {
48524
+ for (var i = 0, j = 0; i < accepts.length; i++) {
48524
48525
  const encoding = parseEncoding(accepts[i].trim(), i)
48525
48526
  if (encoding) {
48526
48527
  accepts[j++] = encoding
@@ -48727,7 +48728,7 @@ function requireLanguage() {
48727
48728
 
48728
48729
  function parseAcceptLanguage(accept) {
48729
48730
  const accepts = accept.split(',')
48730
- for (let i = 0, j = 0; i < accepts.length; i++) {
48731
+ for (var i = 0, j = 0; i < accepts.length; i++) {
48731
48732
  const language = parseLanguage(accepts[i].trim(), i)
48732
48733
  if (language) {
48733
48734
  accepts[j++] = language
@@ -48919,7 +48920,7 @@ function requireMediaType() {
48919
48920
 
48920
48921
  function parseAccept(accept) {
48921
48922
  const accepts = splitMediaTypes(accept)
48922
- for (let i = 0, j = 0; i < accepts.length; i++) {
48923
+ for (var i = 0, j = 0; i < accepts.length; i++) {
48923
48924
  const mediaType = parseMediaType(accepts[i].trim(), i)
48924
48925
  if (mediaType) {
48925
48926
  accepts[j++] = mediaType
@@ -49135,7 +49136,7 @@ function requireMediaType() {
49135
49136
 
49136
49137
  function splitMediaTypes(accept) {
49137
49138
  const accepts = accept.split(',')
49138
- for (let i = 1, j = 0; i < accepts.length; i++) {
49139
+ for (var i = 1, j = 0; i < accepts.length; i++) {
49139
49140
  if (quoteCount(accepts[j]) % 2 == 0) {
49140
49141
  accepts[++j] = accepts[i]
49141
49142
  } else {
@@ -49155,7 +49156,7 @@ function requireMediaType() {
49155
49156
 
49156
49157
  function splitParameters(str) {
49157
49158
  const parameters = str.split(';')
49158
- for (let i = 1, j = 0; i < parameters.length; i++) {
49159
+ for (var i = 1, j = 0; i < parameters.length; i++) {
49159
49160
  if (quoteCount(parameters[j]) % 2 == 0) {
49160
49161
  parameters[++j] = parameters[i]
49161
49162
  } else {
@@ -49165,7 +49166,7 @@ function requireMediaType() {
49165
49166
 
49166
49167
  // trim parameters
49167
49168
  parameters.length = j + 1
49168
- for (let i = 0; i < parameters.length; i++) {
49169
+ for (var i = 0; i < parameters.length; i++) {
49169
49170
  parameters[i] = parameters[i].trim()
49170
49171
  }
49171
49172
  return parameters
@@ -60039,7 +60040,7 @@ function requireEntry$3() {
60039
60040
  static async find(request, options) {
60040
60041
  try {
60041
60042
  // compacts the index and returns an array of unique entries
60042
- const matches = await cacache.index.compact(
60043
+ var matches = await cacache.index.compact(
60043
60044
  options.cachePath,
60044
60045
  cacheKey(request),
60045
60046
  (A, B) => {
@@ -60331,7 +60332,7 @@ function requireEntry$3() {
60331
60332
  // user supplied options, since we have already defined
60332
60333
  // them on the new request object. if they're still in the
60333
60334
  // options then those will overwrite the ones from the policy
60334
- const response = await remote(revalidateRequest, {
60335
+ var response = await remote(revalidateRequest, {
60335
60336
  ...options,
60336
60337
  headers: undefined
60337
60338
  })
@@ -60855,7 +60856,7 @@ function requireJsonparse() {
60855
60856
  // check for carry over of a multi byte char split between data chunks
60856
60857
  // & fill temp buffer it with start of this data chunk up to the boundary limit set in the last iteration
60857
60858
  if (this.bytes_remaining > 0) {
60858
- for (let j = 0; j < this.bytes_remaining; j++) {
60859
+ for (var j = 0; j < this.bytes_remaining; j++) {
60859
60860
  this.temp_buffs[this.bytes_in_sequence][
60860
60861
  this.bytes_in_sequence - this.bytes_remaining + j
60861
60862
  ] = buffer[j]
@@ -125915,6 +125916,7 @@ function requireReify() {
125915
125916
  const { walkUp } = requireCommonjs()
125916
125917
  const { log, time } = requireLib$M()
125917
125918
  const rpj = requireLib$b()
125919
+ const hgi = requireLib$L()
125918
125920
  const { dirname, resolve, relative, join } = require$$0$6
125919
125921
  const { depth: dfwalk } = requireLib$j()
125920
125922
  const { lstat, mkdir, rm, symlink } = require$$1$7
@@ -126833,7 +126835,7 @@ function requireReify() {
126833
126835
  // Shrinkwrap and Node classes carefully, so for now, just treat
126834
126836
  // the default reg as the magical animal that it has been.
126835
126837
  try {
126836
- const resolvedURL = new URL(resolved)
126838
+ const resolvedURL = hgi.parseUrl(resolved)
126837
126839
  if (
126838
126840
  this.options.replaceRegistryHost === resolvedURL.hostname ||
126839
126841
  this.options.replaceRegistryHost === 'always'
@@ -3258,7 +3258,7 @@ function requireUtf32() {
3258
3258
  dst[offset++] = high >> 8
3259
3259
 
3260
3260
  // Low surrogate is written below.
3261
- let codepoint = 0xdc00 | (codepoint & 0x3ff)
3261
+ var codepoint = 0xdc00 | (codepoint & 0x3ff)
3262
3262
  }
3263
3263
 
3264
3264
  // Write BMP char or low surrogate.
@@ -3705,7 +3705,7 @@ function requireUtf7() {
3705
3705
  // "+-" -> "+"
3706
3706
  res += '+'
3707
3707
  } else {
3708
- let b64str =
3708
+ var b64str =
3709
3709
  base64Accum + this.iconv.decode(buf.slice(lastI, i), 'ascii')
3710
3710
  res += this.iconv.decode(Buffer.from(b64str, 'base64'), 'utf16-be')
3711
3711
  }
@@ -3722,7 +3722,7 @@ function requireUtf7() {
3722
3722
  if (!inBase64) {
3723
3723
  res += this.iconv.decode(buf.slice(lastI), 'ascii') // Write direct chars.
3724
3724
  } else {
3725
- let b64str = base64Accum + this.iconv.decode(buf.slice(lastI), 'ascii')
3725
+ var b64str = base64Accum + this.iconv.decode(buf.slice(lastI), 'ascii')
3726
3726
  const canBeDecoded = b64str.length - (b64str.length % 8) // Minimal chunk: 2 quads -> 2x3 bytes -> 3 chars.
3727
3727
  base64Accum = b64str.slice(canBeDecoded) // The rest will be decoded in future.
3728
3728
  b64str = b64str.slice(0, canBeDecoded)
@@ -3884,7 +3884,7 @@ function requireUtf7() {
3884
3884
  // "&-" -> "&"
3885
3885
  res += '&'
3886
3886
  } else {
3887
- let b64str =
3887
+ var b64str =
3888
3888
  base64Accum +
3889
3889
  this.iconv.decode(buf.slice(lastI, i), 'ascii').replace(/,/g, '/')
3890
3890
  res += this.iconv.decode(Buffer.from(b64str, 'base64'), 'utf16-be')
@@ -3902,7 +3902,7 @@ function requireUtf7() {
3902
3902
  if (!inBase64) {
3903
3903
  res += this.iconv.decode(buf.slice(lastI), 'ascii') // Write direct chars.
3904
3904
  } else {
3905
- let b64str =
3905
+ var b64str =
3906
3906
  base64Accum +
3907
3907
  this.iconv.decode(buf.slice(lastI), 'ascii').replace(/,/g, '/')
3908
3908
  const canBeDecoded = b64str.length - (b64str.length % 8) // Minimal chunk: 2 quads -> 2x3 bytes -> 3 chars.
@@ -3961,7 +3961,7 @@ function requireSbcsCodec() {
3961
3961
  }
3962
3962
  if (codecOptions.chars.length === 128) {
3963
3963
  let asciiString = ''
3964
- for (let i = 0; i < 128; i++) {
3964
+ for (var i = 0; i < 128; i++) {
3965
3965
  asciiString += String.fromCharCode(i)
3966
3966
  }
3967
3967
  codecOptions.chars = asciiString + codecOptions.chars
@@ -3973,7 +3973,7 @@ function requireSbcsCodec() {
3973
3973
  65536,
3974
3974
  iconv.defaultCharSingleByte.charCodeAt(0)
3975
3975
  )
3976
- for (let i = 0; i < codecOptions.chars.length; i++) {
3976
+ for (var i = 0; i < codecOptions.chars.length; i++) {
3977
3977
  encodeBuf[codecOptions.chars.charCodeAt(i)] = i
3978
3978
  }
3979
3979
  this.encodeBuf = encodeBuf
@@ -4766,7 +4766,7 @@ function requireDbcsCodec() {
4766
4766
  this.decodeTableSeq = []
4767
4767
 
4768
4768
  // Actual mapping tables consist of chunks. Use them to fill up decode tables.
4769
- for (let i = 0; i < mappingTable.length; i++) {
4769
+ for (var i = 0; i < mappingTable.length; i++) {
4770
4770
  this._addDecodeChunk(mappingTable[i])
4771
4771
  }
4772
4772
 
@@ -4782,9 +4782,9 @@ function requireDbcsCodec() {
4782
4782
 
4783
4783
  // Fill out the tree
4784
4784
  const firstByteNode = this.decodeTables[0]
4785
- for (let i = 0x81; i <= 0xfe; i++) {
4785
+ for (var i = 0x81; i <= 0xfe; i++) {
4786
4786
  const secondByteNode = this.decodeTables[NODE_START - firstByteNode[i]]
4787
- for (let j = 0x30; j <= 0x39; j++) {
4787
+ for (var j = 0x30; j <= 0x39; j++) {
4788
4788
  if (secondByteNode[j] === UNASSIGNED) {
4789
4789
  secondByteNode[j] = NODE_START - commonThirdByteNodeIdx
4790
4790
  } else if (secondByteNode[j] > NODE_START) {
@@ -4910,7 +4910,7 @@ function requireDbcsCodec() {
4910
4910
  const part = chunk[k]
4911
4911
  if (typeof part === 'string') {
4912
4912
  // String, write as-is.
4913
- for (let l = 0; l < part.length; ) {
4913
+ for (var l = 0; l < part.length; ) {
4914
4914
  const code = part.charCodeAt(l++)
4915
4915
  if (0xd800 <= code && code < 0xdc00) {
4916
4916
  // Decode surrogate
@@ -4943,7 +4943,7 @@ function requireDbcsCodec() {
4943
4943
  } else if (typeof part === 'number') {
4944
4944
  // Integer, meaning increasing sequence starting with prev character.
4945
4945
  let charCode = writeTable[curAddr - 1] + 1
4946
- for (let l = 0; l < part; l++) {
4946
+ for (var l = 0; l < part; l++) {
4947
4947
  writeTable[curAddr++] = charCode++
4948
4948
  }
4949
4949
  } else {
@@ -5085,9 +5085,9 @@ function requireDbcsCodec() {
5085
5085
  if (i == str.length) {
5086
5086
  break
5087
5087
  }
5088
- let uCode = str.charCodeAt(i++)
5088
+ var uCode = str.charCodeAt(i++)
5089
5089
  } else {
5090
- let uCode = nextChar
5090
+ var uCode = nextChar
5091
5091
  nextChar = -1
5092
5092
  }
5093
5093
 
@@ -5160,7 +5160,7 @@ function requireDbcsCodec() {
5160
5160
  // Use GB18030 algorithm to find character(s) to write.
5161
5161
  const idx = findIdx(this.gb18030.uChars, uCode)
5162
5162
  if (idx != -1) {
5163
- let dbcsCode =
5163
+ dbcsCode =
5164
5164
  this.gb18030.gbChars[idx] + (uCode - this.gb18030.uChars[idx])
5165
5165
  newBuf[j++] = 0x81 + Math.floor(dbcsCode / 12600)
5166
5166
  dbcsCode = dbcsCode % 12600
@@ -5205,9 +5205,10 @@ function requireDbcsCodec() {
5205
5205
 
5206
5206
  let newBuf = Buffer.alloc(10),
5207
5207
  j = 0
5208
+ let dbcsCode
5208
5209
  if (this.seqObj) {
5209
5210
  // We're in the sequence.
5210
- const dbcsCode = this.seqObj[DEF_CHAR]
5211
+ dbcsCode = this.seqObj[DEF_CHAR]
5211
5212
  if (dbcsCode !== undefined) {
5212
5213
  // Write beginning of the sequence.
5213
5214
  if (dbcsCode < 0x100) {
@@ -5251,7 +5252,7 @@ function requireDbcsCodec() {
5251
5252
  seqStart = -this.prevBytes.length,
5252
5253
  // idx of the start of current parsed sequence.
5253
5254
  uCode
5254
- for (let i = 0, j = 0; i < buf.length; i++) {
5255
+ for (var i = 0, j = 0; i < buf.length; i++) {
5255
5256
  const curByte = i >= 0 ? buf[i] : prevBytes[i + prevOffset]
5256
5257
 
5257
5258
  // Lookup in current trie node.
@@ -5264,13 +5265,13 @@ function requireDbcsCodec() {
5264
5265
  i = seqStart // Skip one byte ('i' will be incremented by the for loop) and try to parse again.
5265
5266
  } else if (uCode === GB18030_CODE) {
5266
5267
  if (i >= 3) {
5267
- const ptr =
5268
+ var ptr =
5268
5269
  (buf[i - 3] - 0x81) * 12600 +
5269
5270
  (buf[i - 2] - 0x30) * 1260 +
5270
5271
  (buf[i - 1] - 0x81) * 10 +
5271
5272
  (curByte - 0x30)
5272
5273
  } else {
5273
- const ptr =
5274
+ var ptr =
5274
5275
  (prevBytes[i - 3 + prevOffset] - 0x81) * 12600 +
5275
5276
  ((i - 2 >= 0 ? buf[i - 2] : prevBytes[i - 2 + prevOffset]) - 0x30) *
5276
5277
  1260 +
@@ -13085,7 +13086,7 @@ function requireLib$9() {
13085
13086
  // ignoring coverage so tests don't have to fake support (or lack of) for brotli
13086
13087
  // istanbul ignore next
13087
13088
  try {
13088
- const decoder = new zlib.BrotliDecompress()
13089
+ var decoder = new zlib.BrotliDecompress()
13089
13090
  } catch (err) {
13090
13091
  reject(err)
13091
13092
  finalize()
@@ -13867,7 +13868,7 @@ function requireCharset() {
13867
13868
 
13868
13869
  function parseAcceptCharset(accept) {
13869
13870
  const accepts = accept.split(',')
13870
- for (let i = 0, j = 0; i < accepts.length; i++) {
13871
+ for (var i = 0, j = 0; i < accepts.length; i++) {
13871
13872
  const charset = parseCharset(accepts[i].trim(), i)
13872
13873
  if (charset) {
13873
13874
  accepts[j++] = charset
@@ -14047,7 +14048,7 @@ function requireEncoding() {
14047
14048
  const accepts = accept.split(',')
14048
14049
  let hasIdentity = false
14049
14050
  let minQuality = 1
14050
- for (let i = 0, j = 0; i < accepts.length; i++) {
14051
+ for (var i = 0, j = 0; i < accepts.length; i++) {
14051
14052
  const encoding = parseEncoding(accepts[i].trim(), i)
14052
14053
  if (encoding) {
14053
14054
  accepts[j++] = encoding
@@ -14254,7 +14255,7 @@ function requireLanguage() {
14254
14255
 
14255
14256
  function parseAcceptLanguage(accept) {
14256
14257
  const accepts = accept.split(',')
14257
- for (let i = 0, j = 0; i < accepts.length; i++) {
14258
+ for (var i = 0, j = 0; i < accepts.length; i++) {
14258
14259
  const language = parseLanguage(accepts[i].trim(), i)
14259
14260
  if (language) {
14260
14261
  accepts[j++] = language
@@ -14446,7 +14447,7 @@ function requireMediaType() {
14446
14447
 
14447
14448
  function parseAccept(accept) {
14448
14449
  const accepts = splitMediaTypes(accept)
14449
- for (let i = 0, j = 0; i < accepts.length; i++) {
14450
+ for (var i = 0, j = 0; i < accepts.length; i++) {
14450
14451
  const mediaType = parseMediaType(accepts[i].trim(), i)
14451
14452
  if (mediaType) {
14452
14453
  accepts[j++] = mediaType
@@ -14662,7 +14663,7 @@ function requireMediaType() {
14662
14663
 
14663
14664
  function splitMediaTypes(accept) {
14664
14665
  const accepts = accept.split(',')
14665
- for (let i = 1, j = 0; i < accepts.length; i++) {
14666
+ for (var i = 1, j = 0; i < accepts.length; i++) {
14666
14667
  if (quoteCount(accepts[j]) % 2 == 0) {
14667
14668
  accepts[++j] = accepts[i]
14668
14669
  } else {
@@ -14682,7 +14683,7 @@ function requireMediaType() {
14682
14683
 
14683
14684
  function splitParameters(str) {
14684
14685
  const parameters = str.split(';')
14685
- for (let i = 1, j = 0; i < parameters.length; i++) {
14686
+ for (var i = 1, j = 0; i < parameters.length; i++) {
14686
14687
  if (quoteCount(parameters[j]) % 2 == 0) {
14687
14688
  parameters[++j] = parameters[i]
14688
14689
  } else {
@@ -14692,7 +14693,7 @@ function requireMediaType() {
14692
14693
 
14693
14694
  // trim parameters
14694
14695
  parameters.length = j + 1
14695
- for (let i = 0; i < parameters.length; i++) {
14696
+ for (var i = 0; i < parameters.length; i++) {
14696
14697
  parameters[i] = parameters[i].trim()
14697
14698
  }
14698
14699
  return parameters
@@ -24213,8 +24214,8 @@ function requireBraceExpansion() {
24213
24214
  const pre = m.pre
24214
24215
  const post = m.post.length ? expand(m.post, false) : ['']
24215
24216
  if (m.pre.endsWith('\u0024' /*'$'*/)) {
24216
- for (let k = 0; k < post.length; k++) {
24217
- const expansion = pre + '{' + m.body + '}' + post[k]
24217
+ for (var k = 0; k < post.length; k++) {
24218
+ var expansion = pre + '{' + m.body + '}' + post[k]
24218
24219
  expansions.push(expansion)
24219
24220
  }
24220
24221
  } else {
@@ -24289,13 +24290,13 @@ function requireBraceExpansion() {
24289
24290
  }
24290
24291
  } else {
24291
24292
  N = []
24292
- for (let j = 0; j < n.length; j++) {
24293
+ for (var j = 0; j < n.length; j++) {
24293
24294
  N.push.apply(N, expand(n[j], false))
24294
24295
  }
24295
24296
  }
24296
- for (let j = 0; j < N.length; j++) {
24297
- for (let k = 0; k < post.length; k++) {
24298
- const expansion = pre + N[j] + post[k]
24297
+ for (var j = 0; j < N.length; j++) {
24298
+ for (var k = 0; k < post.length; k++) {
24299
+ var expansion = pre + N[j] + post[k]
24299
24300
  if (!isTop || isSequence || expansion) {
24300
24301
  expansions.push(expansion)
24301
24302
  }
@@ -30805,7 +30806,7 @@ function requireRetry$1() {
30805
30806
  throw new Error('minTimeout is greater than maxTimeout')
30806
30807
  }
30807
30808
  const timeouts = []
30808
- for (let i = 0; i < opts.retries; i++) {
30809
+ for (var i = 0; i < opts.retries; i++) {
30809
30810
  timeouts.push(this.createTimeout(i, opts))
30810
30811
  }
30811
30812
  if (options && options.forever && !timeouts.length) {
@@ -41593,7 +41594,7 @@ function requireEntry() {
41593
41594
  static async find(request, options) {
41594
41595
  try {
41595
41596
  // compacts the index and returns an array of unique entries
41596
- const matches = await cacache.index.compact(
41597
+ var matches = await cacache.index.compact(
41597
41598
  options.cachePath,
41598
41599
  cacheKey(request),
41599
41600
  (A, B) => {
@@ -41885,7 +41886,7 @@ function requireEntry() {
41885
41886
  // user supplied options, since we have already defined
41886
41887
  // them on the new request object. if they're still in the
41887
41888
  // options then those will overwrite the ones from the policy
41888
- const response = await remote(revalidateRequest, {
41889
+ var response = await remote(revalidateRequest, {
41889
41890
  ...options,
41890
41891
  headers: undefined
41891
41892
  })