@socketsecurity/cli-with-sentry 1.0.0 → 1.0.1
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.
- package/dist/cli.js +539 -862
- package/dist/cli.js.map +1 -1
- package/dist/constants.js +4 -4
- package/dist/constants.js.map +1 -1
- package/dist/shadow-npm-inject.js +1 -61
- package/dist/shadow-npm-inject.js.map +1 -1
- package/dist/types/cli.d.mts +1 -0
- package/dist/types/commands/fix/agent-fix.d.mts +36 -0
- package/dist/types/commands/fix/agent-fix.d.mts.map +1 -0
- package/dist/types/commands/fix/cmd-fix.d.mts.map +1 -1
- package/dist/types/commands/fix/get-actual-tree.d.mts +3 -0
- package/dist/types/commands/fix/get-actual-tree.d.mts.map +1 -0
- package/dist/types/commands/fix/handle-fix.d.mts +11 -1
- package/dist/types/commands/fix/handle-fix.d.mts.map +1 -1
- package/dist/types/commands/fix/npm-fix.d.mts +2 -10
- package/dist/types/commands/fix/npm-fix.d.mts.map +1 -1
- package/dist/types/commands/fix/pnpm-fix.d.mts +2 -10
- package/dist/types/commands/fix/pnpm-fix.d.mts.map +1 -1
- package/dist/types/commands/manifest/convert_gradle_to_maven.d.mts.map +1 -1
- package/dist/types/commands/optimize/get-overrides-by-agent.d.mts +35 -2
- package/dist/types/commands/optimize/get-overrides-by-agent.d.mts.map +1 -1
- package/dist/types/commands/repository/output-list-repos.d.mts.map +1 -1
- package/dist/types/commands/scan/cmd-scan-create.d.mts.map +1 -1
- package/dist/types/commands/scan/cmd-scan-github.d.mts.map +1 -1
- package/dist/types/commands/scan/handle-create-github-scan.d.mts.map +1 -1
- package/dist/types/commands/scan/output-scan-github.d.mts +3 -0
- package/dist/types/commands/scan/output-scan-github.d.mts.map +1 -0
- package/dist/types/commands/scan/suggest-org-slug.d.mts.map +1 -1
- package/dist/types/commands/scan/suggest-to-persist-orgslug.d.mts +2 -0
- package/dist/types/commands/scan/suggest-to-persist-orgslug.d.mts.map +1 -0
- package/dist/types/utils/config.d.mts +2 -1
- package/dist/types/utils/config.d.mts.map +1 -1
- package/dist/types/utils/determine-org-slug.d.mts.map +1 -1
- package/dist/types/utils/lockfile.d.mts +2 -0
- package/dist/types/utils/lockfile.d.mts.map +1 -0
- package/dist/types/utils/meow-with-subcommands.d.mts +1 -1
- package/dist/types/utils/meow-with-subcommands.d.mts.map +1 -1
- package/dist/types/utils/package-environment.d.mts +11 -11
- package/dist/types/utils/package-environment.d.mts.map +1 -1
- package/dist/types/utils/pnpm.d.mts +1 -1
- package/dist/types/utils/pnpm.d.mts.map +1 -1
- package/dist/types/utils/semver.d.mts.map +1 -1
- package/dist/utils.js +114 -29
- package/dist/utils.js.map +1 -1
- package/dist/vendor.js +7129 -7118
- package/external/@coana-tech/cli/cli.mjs +14035 -3820
- package/external/@socketsecurity/registry/external/@npmcli/package-json/index.js +7 -7
- package/external/@socketsecurity/registry/external/@socketregistry/packageurl-js.js +12 -8
- package/external/@socketsecurity/registry/external/cacache.js +6 -6
- package/external/@socketsecurity/registry/external/libnpmpack.js +47 -45
- package/external/@socketsecurity/registry/external/make-fetch-happen.js +37 -36
- package/external/@socketsecurity/registry/external/pacote.js +45 -44
- package/external/blessed-contrib/lib/widget/charts/bar.js +6 -3
- package/external/blessed-contrib/lib/widget/charts/line.js +6 -3
- package/package.json +28 -28
- package/dist/types/commands/fix/run-fix.d.mts +0 -12
- package/dist/types/commands/fix/run-fix.d.mts.map +0 -1
|
@@ -3258,7 +3258,7 @@ function requireUtf32() {
|
|
|
3258
3258
|
dst[offset++] = high >> 8
|
|
3259
3259
|
|
|
3260
3260
|
// Low surrogate is written below.
|
|
3261
|
-
|
|
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
|
-
|
|
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
|
-
|
|
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
|
-
|
|
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
|
-
|
|
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 (
|
|
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 (
|
|
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 (
|
|
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 (
|
|
4785
|
+
for (var i = 0x81; i <= 0xfe; i++) {
|
|
4786
4786
|
const secondByteNode = this.decodeTables[NODE_START - firstByteNode[i]]
|
|
4787
|
-
for (
|
|
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 (
|
|
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 (
|
|
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
|
-
|
|
5088
|
+
var uCode = str.charCodeAt(i++)
|
|
5089
5089
|
} else {
|
|
5090
|
-
|
|
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
|
-
|
|
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
|
-
|
|
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 (
|
|
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
|
-
|
|
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
|
-
|
|
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
|
-
|
|
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 (
|
|
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 (
|
|
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 (
|
|
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 (
|
|
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 (
|
|
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 (
|
|
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 (
|
|
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 (
|
|
24217
|
-
|
|
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 (
|
|
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 (
|
|
24297
|
-
for (
|
|
24298
|
-
|
|
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 (
|
|
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
|
-
|
|
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
|
-
|
|
41889
|
+
var response = await remote(revalidateRequest, {
|
|
41889
41890
|
...options,
|
|
41890
41891
|
headers: undefined
|
|
41891
41892
|
})
|
|
@@ -3727,8 +3727,8 @@ function requireBraceExpansion() {
|
|
|
3727
3727
|
const pre = m.pre
|
|
3728
3728
|
const post = m.post.length ? expand(m.post, false) : ['']
|
|
3729
3729
|
if (m.pre.endsWith('\u0024' /*'$'*/)) {
|
|
3730
|
-
for (
|
|
3731
|
-
|
|
3730
|
+
for (var k = 0; k < post.length; k++) {
|
|
3731
|
+
var expansion = pre + '{' + m.body + '}' + post[k]
|
|
3732
3732
|
expansions.push(expansion)
|
|
3733
3733
|
}
|
|
3734
3734
|
} else {
|
|
@@ -3803,13 +3803,13 @@ function requireBraceExpansion() {
|
|
|
3803
3803
|
}
|
|
3804
3804
|
} else {
|
|
3805
3805
|
N = []
|
|
3806
|
-
for (
|
|
3806
|
+
for (var j = 0; j < n.length; j++) {
|
|
3807
3807
|
N.push.apply(N, expand(n[j], false))
|
|
3808
3808
|
}
|
|
3809
3809
|
}
|
|
3810
|
-
for (
|
|
3811
|
-
for (
|
|
3812
|
-
|
|
3810
|
+
for (var j = 0; j < N.length; j++) {
|
|
3811
|
+
for (var k = 0; k < post.length; k++) {
|
|
3812
|
+
var expansion = pre + N[j] + post[k]
|
|
3813
3813
|
if (!isTop || isSequence || expansion) {
|
|
3814
3814
|
expansions.push(expansion)
|
|
3815
3815
|
}
|
|
@@ -11648,7 +11648,7 @@ function requireRetry$1() {
|
|
|
11648
11648
|
throw new Error('minTimeout is greater than maxTimeout')
|
|
11649
11649
|
}
|
|
11650
11650
|
const timeouts = []
|
|
11651
|
-
for (
|
|
11651
|
+
for (var i = 0; i < opts.retries; i++) {
|
|
11652
11652
|
timeouts.push(this.createTimeout(i, opts))
|
|
11653
11653
|
}
|
|
11654
11654
|
if (options && options.forever && !timeouts.length) {
|
|
@@ -28454,7 +28454,7 @@ function requireYallist() {
|
|
|
28454
28454
|
}
|
|
28455
28455
|
}
|
|
28456
28456
|
Yallist.prototype.get = function (n) {
|
|
28457
|
-
for (
|
|
28457
|
+
for (var i = 0, walker = this.head; walker !== null && i < n; i++) {
|
|
28458
28458
|
// abort out of the list early if we hit a cycle
|
|
28459
28459
|
walker = walker.next
|
|
28460
28460
|
}
|
|
@@ -28463,7 +28463,7 @@ function requireYallist() {
|
|
|
28463
28463
|
}
|
|
28464
28464
|
}
|
|
28465
28465
|
Yallist.prototype.getReverse = function (n) {
|
|
28466
|
-
for (
|
|
28466
|
+
for (var i = 0, walker = this.tail; walker !== null && i < n; i++) {
|
|
28467
28467
|
// abort out of the list early if we hit a cycle
|
|
28468
28468
|
walker = walker.prev
|
|
28469
28469
|
}
|
|
@@ -28558,7 +28558,7 @@ function requireYallist() {
|
|
|
28558
28558
|
if (to > this.length) {
|
|
28559
28559
|
to = this.length
|
|
28560
28560
|
}
|
|
28561
|
-
for (
|
|
28561
|
+
for (var i = 0, walker = this.head; walker !== null && i < from; i++) {
|
|
28562
28562
|
walker = walker.next
|
|
28563
28563
|
}
|
|
28564
28564
|
for (; walker !== null && i < to; i++, walker = walker.next) {
|
|
@@ -28586,7 +28586,7 @@ function requireYallist() {
|
|
|
28586
28586
|
to = this.length
|
|
28587
28587
|
}
|
|
28588
28588
|
for (
|
|
28589
|
-
|
|
28589
|
+
var i = this.length, walker = this.tail;
|
|
28590
28590
|
walker !== null && i > to;
|
|
28591
28591
|
i--
|
|
28592
28592
|
) {
|
|
@@ -28604,11 +28604,11 @@ function requireYallist() {
|
|
|
28604
28604
|
if (start < 0) {
|
|
28605
28605
|
start = this.length + start
|
|
28606
28606
|
}
|
|
28607
|
-
for (
|
|
28607
|
+
for (var i = 0, walker = this.head; walker !== null && i < start; i++) {
|
|
28608
28608
|
walker = walker.next
|
|
28609
28609
|
}
|
|
28610
28610
|
const ret = []
|
|
28611
|
-
for (
|
|
28611
|
+
for (var i = 0; walker && i < deleteCount; i++) {
|
|
28612
28612
|
ret.push(walker.value)
|
|
28613
28613
|
walker = this.removeNode(walker)
|
|
28614
28614
|
}
|
|
@@ -28618,7 +28618,7 @@ function requireYallist() {
|
|
|
28618
28618
|
if (walker !== this.head && walker !== this.tail) {
|
|
28619
28619
|
walker = walker.prev
|
|
28620
28620
|
}
|
|
28621
|
-
for (
|
|
28621
|
+
for (var i = 0; i < nodes.length; i++) {
|
|
28622
28622
|
walker = insert(this, walker, nodes[i])
|
|
28623
28623
|
}
|
|
28624
28624
|
return ret
|
|
@@ -37022,7 +37022,7 @@ function requireUtf32() {
|
|
|
37022
37022
|
dst[offset++] = high >> 8
|
|
37023
37023
|
|
|
37024
37024
|
// Low surrogate is written below.
|
|
37025
|
-
|
|
37025
|
+
var codepoint = 0xdc00 | (codepoint & 0x3ff)
|
|
37026
37026
|
}
|
|
37027
37027
|
|
|
37028
37028
|
// Write BMP char or low surrogate.
|
|
@@ -37469,7 +37469,7 @@ function requireUtf7() {
|
|
|
37469
37469
|
// "+-" -> "+"
|
|
37470
37470
|
res += '+'
|
|
37471
37471
|
} else {
|
|
37472
|
-
|
|
37472
|
+
var b64str =
|
|
37473
37473
|
base64Accum + this.iconv.decode(buf.slice(lastI, i), 'ascii')
|
|
37474
37474
|
res += this.iconv.decode(Buffer.from(b64str, 'base64'), 'utf16-be')
|
|
37475
37475
|
}
|
|
@@ -37486,7 +37486,7 @@ function requireUtf7() {
|
|
|
37486
37486
|
if (!inBase64) {
|
|
37487
37487
|
res += this.iconv.decode(buf.slice(lastI), 'ascii') // Write direct chars.
|
|
37488
37488
|
} else {
|
|
37489
|
-
|
|
37489
|
+
var b64str = base64Accum + this.iconv.decode(buf.slice(lastI), 'ascii')
|
|
37490
37490
|
const canBeDecoded = b64str.length - (b64str.length % 8) // Minimal chunk: 2 quads -> 2x3 bytes -> 3 chars.
|
|
37491
37491
|
base64Accum = b64str.slice(canBeDecoded) // The rest will be decoded in future.
|
|
37492
37492
|
b64str = b64str.slice(0, canBeDecoded)
|
|
@@ -37648,7 +37648,7 @@ function requireUtf7() {
|
|
|
37648
37648
|
// "&-" -> "&"
|
|
37649
37649
|
res += '&'
|
|
37650
37650
|
} else {
|
|
37651
|
-
|
|
37651
|
+
var b64str =
|
|
37652
37652
|
base64Accum +
|
|
37653
37653
|
this.iconv.decode(buf.slice(lastI, i), 'ascii').replace(/,/g, '/')
|
|
37654
37654
|
res += this.iconv.decode(Buffer.from(b64str, 'base64'), 'utf16-be')
|
|
@@ -37666,7 +37666,7 @@ function requireUtf7() {
|
|
|
37666
37666
|
if (!inBase64) {
|
|
37667
37667
|
res += this.iconv.decode(buf.slice(lastI), 'ascii') // Write direct chars.
|
|
37668
37668
|
} else {
|
|
37669
|
-
|
|
37669
|
+
var b64str =
|
|
37670
37670
|
base64Accum +
|
|
37671
37671
|
this.iconv.decode(buf.slice(lastI), 'ascii').replace(/,/g, '/')
|
|
37672
37672
|
const canBeDecoded = b64str.length - (b64str.length % 8) // Minimal chunk: 2 quads -> 2x3 bytes -> 3 chars.
|
|
@@ -37725,7 +37725,7 @@ function requireSbcsCodec() {
|
|
|
37725
37725
|
}
|
|
37726
37726
|
if (codecOptions.chars.length === 128) {
|
|
37727
37727
|
let asciiString = ''
|
|
37728
|
-
for (
|
|
37728
|
+
for (var i = 0; i < 128; i++) {
|
|
37729
37729
|
asciiString += String.fromCharCode(i)
|
|
37730
37730
|
}
|
|
37731
37731
|
codecOptions.chars = asciiString + codecOptions.chars
|
|
@@ -37737,7 +37737,7 @@ function requireSbcsCodec() {
|
|
|
37737
37737
|
65536,
|
|
37738
37738
|
iconv.defaultCharSingleByte.charCodeAt(0)
|
|
37739
37739
|
)
|
|
37740
|
-
for (
|
|
37740
|
+
for (var i = 0; i < codecOptions.chars.length; i++) {
|
|
37741
37741
|
encodeBuf[codecOptions.chars.charCodeAt(i)] = i
|
|
37742
37742
|
}
|
|
37743
37743
|
this.encodeBuf = encodeBuf
|
|
@@ -38530,7 +38530,7 @@ function requireDbcsCodec() {
|
|
|
38530
38530
|
this.decodeTableSeq = []
|
|
38531
38531
|
|
|
38532
38532
|
// Actual mapping tables consist of chunks. Use them to fill up decode tables.
|
|
38533
|
-
for (
|
|
38533
|
+
for (var i = 0; i < mappingTable.length; i++) {
|
|
38534
38534
|
this._addDecodeChunk(mappingTable[i])
|
|
38535
38535
|
}
|
|
38536
38536
|
|
|
@@ -38546,9 +38546,9 @@ function requireDbcsCodec() {
|
|
|
38546
38546
|
|
|
38547
38547
|
// Fill out the tree
|
|
38548
38548
|
const firstByteNode = this.decodeTables[0]
|
|
38549
|
-
for (
|
|
38549
|
+
for (var i = 0x81; i <= 0xfe; i++) {
|
|
38550
38550
|
const secondByteNode = this.decodeTables[NODE_START - firstByteNode[i]]
|
|
38551
|
-
for (
|
|
38551
|
+
for (var j = 0x30; j <= 0x39; j++) {
|
|
38552
38552
|
if (secondByteNode[j] === UNASSIGNED) {
|
|
38553
38553
|
secondByteNode[j] = NODE_START - commonThirdByteNodeIdx
|
|
38554
38554
|
} else if (secondByteNode[j] > NODE_START) {
|
|
@@ -38674,7 +38674,7 @@ function requireDbcsCodec() {
|
|
|
38674
38674
|
const part = chunk[k]
|
|
38675
38675
|
if (typeof part === 'string') {
|
|
38676
38676
|
// String, write as-is.
|
|
38677
|
-
for (
|
|
38677
|
+
for (var l = 0; l < part.length; ) {
|
|
38678
38678
|
const code = part.charCodeAt(l++)
|
|
38679
38679
|
if (0xd800 <= code && code < 0xdc00) {
|
|
38680
38680
|
// Decode surrogate
|
|
@@ -38707,7 +38707,7 @@ function requireDbcsCodec() {
|
|
|
38707
38707
|
} else if (typeof part === 'number') {
|
|
38708
38708
|
// Integer, meaning increasing sequence starting with prev character.
|
|
38709
38709
|
let charCode = writeTable[curAddr - 1] + 1
|
|
38710
|
-
for (
|
|
38710
|
+
for (var l = 0; l < part; l++) {
|
|
38711
38711
|
writeTable[curAddr++] = charCode++
|
|
38712
38712
|
}
|
|
38713
38713
|
} else {
|
|
@@ -38849,9 +38849,9 @@ function requireDbcsCodec() {
|
|
|
38849
38849
|
if (i == str.length) {
|
|
38850
38850
|
break
|
|
38851
38851
|
}
|
|
38852
|
-
|
|
38852
|
+
var uCode = str.charCodeAt(i++)
|
|
38853
38853
|
} else {
|
|
38854
|
-
|
|
38854
|
+
var uCode = nextChar
|
|
38855
38855
|
nextChar = -1
|
|
38856
38856
|
}
|
|
38857
38857
|
|
|
@@ -38924,7 +38924,7 @@ function requireDbcsCodec() {
|
|
|
38924
38924
|
// Use GB18030 algorithm to find character(s) to write.
|
|
38925
38925
|
const idx = findIdx(this.gb18030.uChars, uCode)
|
|
38926
38926
|
if (idx != -1) {
|
|
38927
|
-
|
|
38927
|
+
dbcsCode =
|
|
38928
38928
|
this.gb18030.gbChars[idx] + (uCode - this.gb18030.uChars[idx])
|
|
38929
38929
|
newBuf[j++] = 0x81 + Math.floor(dbcsCode / 12600)
|
|
38930
38930
|
dbcsCode = dbcsCode % 12600
|
|
@@ -38969,9 +38969,10 @@ function requireDbcsCodec() {
|
|
|
38969
38969
|
|
|
38970
38970
|
let newBuf = Buffer.alloc(10),
|
|
38971
38971
|
j = 0
|
|
38972
|
+
let dbcsCode
|
|
38972
38973
|
if (this.seqObj) {
|
|
38973
38974
|
// We're in the sequence.
|
|
38974
|
-
|
|
38975
|
+
dbcsCode = this.seqObj[DEF_CHAR]
|
|
38975
38976
|
if (dbcsCode !== undefined) {
|
|
38976
38977
|
// Write beginning of the sequence.
|
|
38977
38978
|
if (dbcsCode < 0x100) {
|
|
@@ -39015,7 +39016,7 @@ function requireDbcsCodec() {
|
|
|
39015
39016
|
seqStart = -this.prevBytes.length,
|
|
39016
39017
|
// idx of the start of current parsed sequence.
|
|
39017
39018
|
uCode
|
|
39018
|
-
for (
|
|
39019
|
+
for (var i = 0, j = 0; i < buf.length; i++) {
|
|
39019
39020
|
const curByte = i >= 0 ? buf[i] : prevBytes[i + prevOffset]
|
|
39020
39021
|
|
|
39021
39022
|
// Lookup in current trie node.
|
|
@@ -39028,13 +39029,13 @@ function requireDbcsCodec() {
|
|
|
39028
39029
|
i = seqStart // Skip one byte ('i' will be incremented by the for loop) and try to parse again.
|
|
39029
39030
|
} else if (uCode === GB18030_CODE) {
|
|
39030
39031
|
if (i >= 3) {
|
|
39031
|
-
|
|
39032
|
+
var ptr =
|
|
39032
39033
|
(buf[i - 3] - 0x81) * 12600 +
|
|
39033
39034
|
(buf[i - 2] - 0x30) * 1260 +
|
|
39034
39035
|
(buf[i - 1] - 0x81) * 10 +
|
|
39035
39036
|
(curByte - 0x30)
|
|
39036
39037
|
} else {
|
|
39037
|
-
|
|
39038
|
+
var ptr =
|
|
39038
39039
|
(prevBytes[i - 3 + prevOffset] - 0x81) * 12600 +
|
|
39039
39040
|
((i - 2 >= 0 ? buf[i - 2] : prevBytes[i - 2 + prevOffset]) - 0x30) *
|
|
39040
39041
|
1260 +
|
|
@@ -46849,7 +46850,7 @@ function requireLib$6() {
|
|
|
46849
46850
|
// ignoring coverage so tests don't have to fake support (or lack of) for brotli
|
|
46850
46851
|
// istanbul ignore next
|
|
46851
46852
|
try {
|
|
46852
|
-
|
|
46853
|
+
var decoder = new zlib.BrotliDecompress()
|
|
46853
46854
|
} catch (err) {
|
|
46854
46855
|
reject(err)
|
|
46855
46856
|
finalize()
|
|
@@ -48338,7 +48339,7 @@ function requireCharset() {
|
|
|
48338
48339
|
|
|
48339
48340
|
function parseAcceptCharset(accept) {
|
|
48340
48341
|
const accepts = accept.split(',')
|
|
48341
|
-
for (
|
|
48342
|
+
for (var i = 0, j = 0; i < accepts.length; i++) {
|
|
48342
48343
|
const charset = parseCharset(accepts[i].trim(), i)
|
|
48343
48344
|
if (charset) {
|
|
48344
48345
|
accepts[j++] = charset
|
|
@@ -48518,7 +48519,7 @@ function requireEncoding$1() {
|
|
|
48518
48519
|
const accepts = accept.split(',')
|
|
48519
48520
|
let hasIdentity = false
|
|
48520
48521
|
let minQuality = 1
|
|
48521
|
-
for (
|
|
48522
|
+
for (var i = 0, j = 0; i < accepts.length; i++) {
|
|
48522
48523
|
const encoding = parseEncoding(accepts[i].trim(), i)
|
|
48523
48524
|
if (encoding) {
|
|
48524
48525
|
accepts[j++] = encoding
|
|
@@ -48725,7 +48726,7 @@ function requireLanguage() {
|
|
|
48725
48726
|
|
|
48726
48727
|
function parseAcceptLanguage(accept) {
|
|
48727
48728
|
const accepts = accept.split(',')
|
|
48728
|
-
for (
|
|
48729
|
+
for (var i = 0, j = 0; i < accepts.length; i++) {
|
|
48729
48730
|
const language = parseLanguage(accepts[i].trim(), i)
|
|
48730
48731
|
if (language) {
|
|
48731
48732
|
accepts[j++] = language
|
|
@@ -48917,7 +48918,7 @@ function requireMediaType() {
|
|
|
48917
48918
|
|
|
48918
48919
|
function parseAccept(accept) {
|
|
48919
48920
|
const accepts = splitMediaTypes(accept)
|
|
48920
|
-
for (
|
|
48921
|
+
for (var i = 0, j = 0; i < accepts.length; i++) {
|
|
48921
48922
|
const mediaType = parseMediaType(accepts[i].trim(), i)
|
|
48922
48923
|
if (mediaType) {
|
|
48923
48924
|
accepts[j++] = mediaType
|
|
@@ -49133,7 +49134,7 @@ function requireMediaType() {
|
|
|
49133
49134
|
|
|
49134
49135
|
function splitMediaTypes(accept) {
|
|
49135
49136
|
const accepts = accept.split(',')
|
|
49136
|
-
for (
|
|
49137
|
+
for (var i = 1, j = 0; i < accepts.length; i++) {
|
|
49137
49138
|
if (quoteCount(accepts[j]) % 2 == 0) {
|
|
49138
49139
|
accepts[++j] = accepts[i]
|
|
49139
49140
|
} else {
|
|
@@ -49153,7 +49154,7 @@ function requireMediaType() {
|
|
|
49153
49154
|
|
|
49154
49155
|
function splitParameters(str) {
|
|
49155
49156
|
const parameters = str.split(';')
|
|
49156
|
-
for (
|
|
49157
|
+
for (var i = 1, j = 0; i < parameters.length; i++) {
|
|
49157
49158
|
if (quoteCount(parameters[j]) % 2 == 0) {
|
|
49158
49159
|
parameters[++j] = parameters[i]
|
|
49159
49160
|
} else {
|
|
@@ -49163,7 +49164,7 @@ function requireMediaType() {
|
|
|
49163
49164
|
|
|
49164
49165
|
// trim parameters
|
|
49165
49166
|
parameters.length = j + 1
|
|
49166
|
-
for (
|
|
49167
|
+
for (var i = 0; i < parameters.length; i++) {
|
|
49167
49168
|
parameters[i] = parameters[i].trim()
|
|
49168
49169
|
}
|
|
49169
49170
|
return parameters
|
|
@@ -60037,7 +60038,7 @@ function requireEntry$1() {
|
|
|
60037
60038
|
static async find(request, options) {
|
|
60038
60039
|
try {
|
|
60039
60040
|
// compacts the index and returns an array of unique entries
|
|
60040
|
-
|
|
60041
|
+
var matches = await cacache.index.compact(
|
|
60041
60042
|
options.cachePath,
|
|
60042
60043
|
cacheKey(request),
|
|
60043
60044
|
(A, B) => {
|
|
@@ -60329,7 +60330,7 @@ function requireEntry$1() {
|
|
|
60329
60330
|
// user supplied options, since we have already defined
|
|
60330
60331
|
// them on the new request object. if they're still in the
|
|
60331
60332
|
// options then those will overwrite the ones from the policy
|
|
60332
|
-
|
|
60333
|
+
var response = await remote(revalidateRequest, {
|
|
60333
60334
|
...options,
|
|
60334
60335
|
headers: undefined
|
|
60335
60336
|
})
|
|
@@ -60853,7 +60854,7 @@ function requireJsonparse() {
|
|
|
60853
60854
|
// check for carry over of a multi byte char split between data chunks
|
|
60854
60855
|
// & fill temp buffer it with start of this data chunk up to the boundary limit set in the last iteration
|
|
60855
60856
|
if (this.bytes_remaining > 0) {
|
|
60856
|
-
for (
|
|
60857
|
+
for (var j = 0; j < this.bytes_remaining; j++) {
|
|
60857
60858
|
this.temp_buffs[this.bytes_in_sequence][
|
|
60858
60859
|
this.bytes_in_sequence - this.bytes_remaining + j
|
|
60859
60860
|
] = buffer[j]
|
|
@@ -6,10 +6,13 @@ var require$$0$1 = require('../../../../blessed/lib/widgets/box');
|
|
|
6
6
|
function getAugmentedNamespace(n) {
|
|
7
7
|
if (Object.prototype.hasOwnProperty.call(n, '__esModule')) return n;
|
|
8
8
|
var f = n.default;
|
|
9
|
-
var a;
|
|
10
9
|
if (typeof f == "function") {
|
|
11
|
-
a = function a () {
|
|
12
|
-
|
|
10
|
+
var a = function a () {
|
|
11
|
+
var isInstance = false;
|
|
12
|
+
try {
|
|
13
|
+
isInstance = this instanceof a;
|
|
14
|
+
} catch {}
|
|
15
|
+
if (isInstance) {
|
|
13
16
|
return Reflect.construct(f, arguments, this.constructor);
|
|
14
17
|
}
|
|
15
18
|
return f.apply(this, arguments);
|
|
@@ -6,10 +6,13 @@ var require$$2$1 = require('../../../../blessed/lib/widgets/node');
|
|
|
6
6
|
function getAugmentedNamespace(n) {
|
|
7
7
|
if (Object.prototype.hasOwnProperty.call(n, '__esModule')) return n;
|
|
8
8
|
var f = n.default;
|
|
9
|
-
var a;
|
|
10
9
|
if (typeof f == "function") {
|
|
11
|
-
a = function a () {
|
|
12
|
-
|
|
10
|
+
var a = function a () {
|
|
11
|
+
var isInstance = false;
|
|
12
|
+
try {
|
|
13
|
+
isInstance = this instanceof a;
|
|
14
|
+
} catch {}
|
|
15
|
+
if (isInstance) {
|
|
13
16
|
return Reflect.construct(f, arguments, this.constructor);
|
|
14
17
|
}
|
|
15
18
|
return f.apply(this, arguments);
|