@storm-software/linting-tools 1.125.49 → 1.125.51
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/README.md +1 -1
- package/bin/{chunk-SYUIP3RP.cjs → chunk-MX64X5OQ.cjs} +1621 -1639
- package/bin/chunk-SIYPQQ5S.js +3603 -0
- package/{dist/dist-Q6NSKOVX.js → bin/dist-ESSQX654.js} +5980 -6088
- package/{dist/dist-RV66BQUW.cjs → bin/dist-Z7KHUEYW.cjs} +5952 -6060
- package/bin/lint.cjs +1 -2
- package/bin/lint.js +1 -2
- package/bin/{multipart-parser-U5I4L3OD.cjs → multipart-parser-3T5DJYET.cjs} +66 -68
- package/bin/{multipart-parser-7S4MT5FT.js → multipart-parser-SLBG6V3T.js} +79 -80
- package/dist/{chunk-SYUIP3RP.cjs → chunk-MX64X5OQ.cjs} +1621 -1639
- package/dist/chunk-SIYPQQ5S.js +3603 -0
- package/{bin/dist-Q6NSKOVX.js → dist/dist-ESSQX654.js} +5980 -6088
- package/{bin/dist-RV66BQUW.cjs → dist/dist-Z7KHUEYW.cjs} +5952 -6060
- package/dist/index.cjs +1 -2
- package/dist/index.js +1 -2
- package/dist/{multipart-parser-U5I4L3OD.cjs → multipart-parser-3T5DJYET.cjs} +66 -68
- package/dist/{multipart-parser-7S4MT5FT.js → multipart-parser-SLBG6V3T.js} +79 -80
- package/package.json +2 -2
- package/bin/chunk-P5LNP3NP.js +0 -3634
- package/dist/chunk-P5LNP3NP.js +0 -3634
package/bin/lint.cjs
CHANGED
|
@@ -316120,7 +316120,7 @@ async function resolveConfig(source, options, sourceOptions = {}) {
|
|
|
316120
316120
|
}
|
|
316121
316121
|
const _merger = options.merger || _chunkOGN3PGNWcjs.defu;
|
|
316122
316122
|
if (options.giget !== false && GIGET_PREFIXES.some((prefix) => source.startsWith(prefix))) {
|
|
316123
|
-
const { downloadTemplate } = await Promise.resolve().then(() => _interopRequireWildcard2(require("./dist-
|
|
316123
|
+
const { downloadTemplate } = await Promise.resolve().then(() => _interopRequireWildcard2(require("./dist-Z7KHUEYW.cjs")));
|
|
316124
316124
|
const { digest } = await Promise.resolve().then(() => _interopRequireWildcard2(require("./dist-WO6IEKCS.cjs")));
|
|
316125
316125
|
const cloneName = source.replace(/\W+/g, "_").split("_").splice(0, 3).join("_") + "_" + digest(source).slice(0, 10).replace(/[-_]/g, "");
|
|
316126
316126
|
let cloneDir;
|
|
@@ -319913,7 +319913,6 @@ function findFolderUp(startPath, endFileNames = [], endDirectoryNames = []) {
|
|
|
319913
319913
|
|
|
319914
319914
|
// ../config-tools/src/utilities/find-workspace-root.ts
|
|
319915
319915
|
var rootFiles = [
|
|
319916
|
-
"storm-workspace.json",
|
|
319917
319916
|
"storm-workspace.json",
|
|
319918
319917
|
"storm-workspace.yaml",
|
|
319919
319918
|
"storm-workspace.yml",
|
package/bin/lint.js
CHANGED
|
@@ -316758,7 +316758,7 @@ async function resolveConfig(source, options, sourceOptions = {}) {
|
|
|
316758
316758
|
}
|
|
316759
316759
|
const _merger = options.merger || defu;
|
|
316760
316760
|
if (options.giget !== false && GIGET_PREFIXES.some((prefix) => source.startsWith(prefix))) {
|
|
316761
|
-
const { downloadTemplate } = await import("./dist-
|
|
316761
|
+
const { downloadTemplate } = await import("./dist-ESSQX654.js");
|
|
316762
316762
|
const { digest } = await import("./dist-U7CCIWJZ.js");
|
|
316763
316763
|
const cloneName = source.replace(/\W+/g, "_").split("_").splice(0, 3).join("_") + "_" + digest(source).slice(0, 10).replace(/[-_]/g, "");
|
|
316764
316764
|
let cloneDir;
|
|
@@ -320548,7 +320548,6 @@ function findFolderUp(startPath, endFileNames = [], endDirectoryNames = []) {
|
|
|
320548
320548
|
|
|
320549
320549
|
// ../config-tools/src/utilities/find-workspace-root.ts
|
|
320550
320550
|
var rootFiles = [
|
|
320551
|
-
"storm-workspace.json",
|
|
320552
320551
|
"storm-workspace.json",
|
|
320553
320552
|
"storm-workspace.yaml",
|
|
320554
320553
|
"storm-workspace.yml",
|
|
@@ -1,22 +1,21 @@
|
|
|
1
1
|
"use strict";Object.defineProperty(exports, "__esModule", {value: true});
|
|
2
2
|
|
|
3
3
|
|
|
4
|
-
var
|
|
4
|
+
var _chunkMX64X5OQcjs = require('./chunk-MX64X5OQ.cjs');
|
|
5
5
|
|
|
6
6
|
|
|
7
7
|
|
|
8
8
|
|
|
9
9
|
var _chunkLEE4QE6Pcjs = require('./chunk-LEE4QE6P.cjs');
|
|
10
10
|
|
|
11
|
-
// ../../node_modules/.pnpm/node-fetch-native@1.6.
|
|
11
|
+
// ../../node_modules/.pnpm/node-fetch-native@1.6.7/node_modules/node-fetch-native/dist/chunks/multipart-parser.cjs
|
|
12
12
|
var require_multipart_parser = _chunkLEE4QE6Pcjs.__commonJS.call(void 0, {
|
|
13
|
-
"../../node_modules/.pnpm/node-fetch-native@1.6.
|
|
13
|
+
"../../node_modules/.pnpm/node-fetch-native@1.6.7/node_modules/node-fetch-native/dist/chunks/multipart-parser.cjs"(exports) {
|
|
14
14
|
_chunkLEE4QE6Pcjs.init_cjs_shims.call(void 0, );
|
|
15
|
-
var
|
|
16
|
-
var c = (
|
|
17
|
-
|
|
18
|
-
|
|
19
|
-
_chunkLEE4QE6Pcjs.__require.call(void 0, "http"), _chunkLEE4QE6Pcjs.__require.call(void 0, "https"), _chunkLEE4QE6Pcjs.__require.call(void 0, "zlib"), _chunkLEE4QE6Pcjs.__require.call(void 0, "stream"), _chunkLEE4QE6Pcjs.__require.call(void 0, "buffer"), _chunkLEE4QE6Pcjs.__require.call(void 0, "util"), _chunkSYUIP3RPcjs.require_node_fetch_native_DhEqb06g.call(void 0, ), _chunkLEE4QE6Pcjs.__require.call(void 0, "url"), _chunkLEE4QE6Pcjs.__require.call(void 0, "net");
|
|
15
|
+
var y = Object.defineProperty;
|
|
16
|
+
var c = (R, o) => y(R, "name", { value: o, configurable: true });
|
|
17
|
+
var node = _chunkMX64X5OQcjs.require_node.call(void 0, );
|
|
18
|
+
_chunkLEE4QE6Pcjs.__require.call(void 0, "http"), _chunkLEE4QE6Pcjs.__require.call(void 0, "https"), _chunkLEE4QE6Pcjs.__require.call(void 0, "zlib"), _chunkLEE4QE6Pcjs.__require.call(void 0, "stream"), _chunkLEE4QE6Pcjs.__require.call(void 0, "buffer"), _chunkLEE4QE6Pcjs.__require.call(void 0, "util"), _chunkMX64X5OQcjs.require_node_fetch_native_DhEqb06g.call(void 0, ), _chunkLEE4QE6Pcjs.__require.call(void 0, "url"), _chunkLEE4QE6Pcjs.__require.call(void 0, "net"), _chunkLEE4QE6Pcjs.__require.call(void 0, "fs"), _chunkLEE4QE6Pcjs.__require.call(void 0, "path");
|
|
20
19
|
var s = 0;
|
|
21
20
|
var S = { START_BOUNDARY: s++, HEADER_FIELD_START: s++, HEADER_FIELD: s++, HEADER_VALUE_START: s++, HEADER_VALUE: s++, HEADER_VALUE_ALMOST_DONE: s++, HEADERS_ALMOST_DONE: s++, PART_DATA_START: s++, PART_DATA: s++, END: s++ };
|
|
22
21
|
var f = 1;
|
|
@@ -28,151 +27,150 @@ var require_multipart_parser = _chunkLEE4QE6Pcjs.__commonJS.call(void 0, {
|
|
|
28
27
|
var COLON = 58;
|
|
29
28
|
var A = 97;
|
|
30
29
|
var Z = 122;
|
|
31
|
-
var lower = c((
|
|
30
|
+
var lower = c((R) => R | 32, "lower");
|
|
32
31
|
var noop = c(() => {
|
|
33
32
|
}, "noop");
|
|
34
|
-
var
|
|
35
|
-
|
|
36
|
-
|
|
37
|
-
|
|
38
|
-
|
|
39
|
-
|
|
40
|
-
--` + a;
|
|
41
|
-
const t = new Uint8Array(a.length);
|
|
42
|
-
for (let n = 0; n < a.length; n++) t[n] = a.charCodeAt(n), this.boundaryChars[t[n]] = true;
|
|
33
|
+
var g = class g {
|
|
34
|
+
constructor(o) {
|
|
35
|
+
this.index = 0, this.flags = 0, this.onHeaderEnd = noop, this.onHeaderField = noop, this.onHeadersEnd = noop, this.onHeaderValue = noop, this.onPartBegin = noop, this.onPartData = noop, this.onPartEnd = noop, this.boundaryChars = {}, o = `\r
|
|
36
|
+
--` + o;
|
|
37
|
+
const t = new Uint8Array(o.length);
|
|
38
|
+
for (let n = 0; n < o.length; n++) t[n] = o.charCodeAt(n), this.boundaryChars[t[n]] = true;
|
|
43
39
|
this.boundary = t, this.lookbehind = new Uint8Array(this.boundary.length + 8), this.state = S.START_BOUNDARY;
|
|
44
40
|
}
|
|
45
|
-
write(
|
|
41
|
+
write(o) {
|
|
46
42
|
let t = 0;
|
|
47
|
-
const n =
|
|
48
|
-
let E = this.index, { lookbehind:
|
|
49
|
-
const b = this.boundary.length, m = b - 1, O =
|
|
43
|
+
const n = o.length;
|
|
44
|
+
let E = this.index, { lookbehind: l, boundary: h, boundaryChars: H, index: e, state: a, flags: d } = this;
|
|
45
|
+
const b = this.boundary.length, m = b - 1, O = o.length;
|
|
50
46
|
let r, P;
|
|
51
47
|
const u = c((D) => {
|
|
52
48
|
this[D + "Mark"] = t;
|
|
53
49
|
}, "mark"), i = c((D) => {
|
|
54
50
|
delete this[D + "Mark"];
|
|
55
|
-
}, "clear"), T = c((D, p,
|
|
56
|
-
(p === void 0 || p !==
|
|
51
|
+
}, "clear"), T = c((D, p, _, N) => {
|
|
52
|
+
(p === void 0 || p !== _) && this[D](N && N.subarray(p, _));
|
|
57
53
|
}, "callback"), L = c((D, p) => {
|
|
58
|
-
const
|
|
59
|
-
|
|
54
|
+
const _ = D + "Mark";
|
|
55
|
+
_ in this && (p ? (T(D, this[_], t, o), delete this[_]) : (T(D, this[_], o.length, o), this[_] = 0));
|
|
60
56
|
}, "dataCallback");
|
|
61
|
-
for (t = 0; t < n; t++) switch (r =
|
|
57
|
+
for (t = 0; t < n; t++) switch (r = o[t], a) {
|
|
62
58
|
case S.START_BOUNDARY:
|
|
63
59
|
if (e === h.length - 2) {
|
|
64
|
-
if (r === HYPHEN)
|
|
60
|
+
if (r === HYPHEN) d |= F.LAST_BOUNDARY;
|
|
65
61
|
else if (r !== CR) return;
|
|
66
62
|
e++;
|
|
67
63
|
break;
|
|
68
64
|
} else if (e - 1 === h.length - 2) {
|
|
69
|
-
if (
|
|
70
|
-
else if (!(
|
|
65
|
+
if (d & F.LAST_BOUNDARY && r === HYPHEN) a = S.END, d = 0;
|
|
66
|
+
else if (!(d & F.LAST_BOUNDARY) && r === LF) e = 0, T("onPartBegin"), a = S.HEADER_FIELD_START;
|
|
71
67
|
else return;
|
|
72
68
|
break;
|
|
73
69
|
}
|
|
74
70
|
r !== h[e + 2] && (e = -2), r === h[e + 2] && e++;
|
|
75
71
|
break;
|
|
76
72
|
case S.HEADER_FIELD_START:
|
|
77
|
-
|
|
73
|
+
a = S.HEADER_FIELD, u("onHeaderField"), e = 0;
|
|
78
74
|
case S.HEADER_FIELD:
|
|
79
75
|
if (r === CR) {
|
|
80
|
-
i("onHeaderField"),
|
|
76
|
+
i("onHeaderField"), a = S.HEADERS_ALMOST_DONE;
|
|
81
77
|
break;
|
|
82
78
|
}
|
|
83
79
|
if (e++, r === HYPHEN) break;
|
|
84
80
|
if (r === COLON) {
|
|
85
81
|
if (e === 1) return;
|
|
86
|
-
L("onHeaderField", true),
|
|
82
|
+
L("onHeaderField", true), a = S.HEADER_VALUE_START;
|
|
87
83
|
break;
|
|
88
84
|
}
|
|
89
85
|
if (P = lower(r), P < A || P > Z) return;
|
|
90
86
|
break;
|
|
91
87
|
case S.HEADER_VALUE_START:
|
|
92
88
|
if (r === SPACE) break;
|
|
93
|
-
u("onHeaderValue"),
|
|
89
|
+
u("onHeaderValue"), a = S.HEADER_VALUE;
|
|
94
90
|
case S.HEADER_VALUE:
|
|
95
|
-
r === CR && (L("onHeaderValue", true), T("onHeaderEnd"),
|
|
91
|
+
r === CR && (L("onHeaderValue", true), T("onHeaderEnd"), a = S.HEADER_VALUE_ALMOST_DONE);
|
|
96
92
|
break;
|
|
97
93
|
case S.HEADER_VALUE_ALMOST_DONE:
|
|
98
94
|
if (r !== LF) return;
|
|
99
|
-
|
|
95
|
+
a = S.HEADER_FIELD_START;
|
|
100
96
|
break;
|
|
101
97
|
case S.HEADERS_ALMOST_DONE:
|
|
102
98
|
if (r !== LF) return;
|
|
103
|
-
T("onHeadersEnd"),
|
|
99
|
+
T("onHeadersEnd"), a = S.PART_DATA_START;
|
|
104
100
|
break;
|
|
105
101
|
case S.PART_DATA_START:
|
|
106
|
-
|
|
102
|
+
a = S.PART_DATA, u("onPartData");
|
|
107
103
|
case S.PART_DATA:
|
|
108
104
|
if (E = e, e === 0) {
|
|
109
|
-
for (t += m; t < O && !(
|
|
110
|
-
t -= m, r =
|
|
105
|
+
for (t += m; t < O && !(o[t] in H); ) t += b;
|
|
106
|
+
t -= m, r = o[t];
|
|
111
107
|
}
|
|
112
108
|
if (e < h.length) h[e] === r ? (e === 0 && L("onPartData", true), e++) : e = 0;
|
|
113
|
-
else if (e === h.length) e++, r === CR ?
|
|
114
|
-
else if (e - 1 === h.length) if (
|
|
109
|
+
else if (e === h.length) e++, r === CR ? d |= F.PART_BOUNDARY : r === HYPHEN ? d |= F.LAST_BOUNDARY : e = 0;
|
|
110
|
+
else if (e - 1 === h.length) if (d & F.PART_BOUNDARY) {
|
|
115
111
|
if (e = 0, r === LF) {
|
|
116
|
-
|
|
112
|
+
d &= ~F.PART_BOUNDARY, T("onPartEnd"), T("onPartBegin"), a = S.HEADER_FIELD_START;
|
|
117
113
|
break;
|
|
118
114
|
}
|
|
119
|
-
} else
|
|
120
|
-
if (e > 0)
|
|
115
|
+
} else d & F.LAST_BOUNDARY && r === HYPHEN ? (T("onPartEnd"), a = S.END, d = 0) : e = 0;
|
|
116
|
+
if (e > 0) l[e - 1] = r;
|
|
121
117
|
else if (E > 0) {
|
|
122
|
-
const D = new Uint8Array(
|
|
118
|
+
const D = new Uint8Array(l.buffer, l.byteOffset, l.byteLength);
|
|
123
119
|
T("onPartData", 0, E, D), E = 0, u("onPartData"), t--;
|
|
124
120
|
}
|
|
125
121
|
break;
|
|
126
122
|
case S.END:
|
|
127
123
|
break;
|
|
128
124
|
default:
|
|
129
|
-
throw new Error(`Unexpected state entered: ${
|
|
125
|
+
throw new Error(`Unexpected state entered: ${a}`);
|
|
130
126
|
}
|
|
131
|
-
L("onHeaderField"), L("onHeaderValue"), L("onPartData"), this.index = e, this.state =
|
|
127
|
+
L("onHeaderField"), L("onHeaderValue"), L("onPartData"), this.index = e, this.state = a, this.flags = d;
|
|
132
128
|
}
|
|
133
129
|
end() {
|
|
134
130
|
if (this.state === S.HEADER_FIELD_START && this.index === 0 || this.state === S.PART_DATA && this.index === this.boundary.length) this.onPartEnd();
|
|
135
131
|
else if (this.state !== S.END) throw new Error("MultipartParser.end(): stream ended unexpectedly");
|
|
136
132
|
}
|
|
137
133
|
};
|
|
138
|
-
|
|
139
|
-
|
|
140
|
-
|
|
141
|
-
const
|
|
134
|
+
c(g, "MultipartParser");
|
|
135
|
+
var MultipartParser = g;
|
|
136
|
+
function _fileName(R) {
|
|
137
|
+
const o = R.match(/\bfilename=("(.*?)"|([^()<>@,;:\\"/[\]?={}\s\t]+))($|;\s)/i);
|
|
138
|
+
if (!o) return;
|
|
139
|
+
const t = o[2] || o[3] || "";
|
|
142
140
|
let n = t.slice(t.lastIndexOf("\\") + 1);
|
|
143
|
-
return n = n.replace(/%22/g, '"'), n = n.replace(/&#(\d{4});/g, (E,
|
|
141
|
+
return n = n.replace(/%22/g, '"'), n = n.replace(/&#(\d{4});/g, (E, l) => String.fromCharCode(l)), n;
|
|
144
142
|
}
|
|
145
143
|
c(_fileName, "_fileName");
|
|
146
|
-
async function toFormData(
|
|
147
|
-
if (!/multipart/i.test(
|
|
148
|
-
const t =
|
|
144
|
+
async function toFormData(R, o) {
|
|
145
|
+
if (!/multipart/i.test(o)) throw new TypeError("Failed to fetch");
|
|
146
|
+
const t = o.match(/boundary=(?:"([^"]+)"|([^;]+))/i);
|
|
149
147
|
if (!t) throw new TypeError("no or bad content-type header, no multipart boundary");
|
|
150
148
|
const n = new MultipartParser(t[1] || t[2]);
|
|
151
|
-
let E,
|
|
152
|
-
const
|
|
149
|
+
let E, l, h, H, e, a;
|
|
150
|
+
const d = [], b = new node.FormData(), m = c((i) => {
|
|
153
151
|
h += u.decode(i, { stream: true });
|
|
154
152
|
}, "onPartData"), O = c((i) => {
|
|
155
|
-
|
|
153
|
+
d.push(i);
|
|
156
154
|
}, "appendToFile"), r = c(() => {
|
|
157
|
-
const i = new node.File(
|
|
155
|
+
const i = new node.File(d, a, { type: e });
|
|
158
156
|
b.append(H, i);
|
|
159
157
|
}, "appendFileToFormData"), P = c(() => {
|
|
160
158
|
b.append(H, h);
|
|
161
159
|
}, "appendEntryToFormData"), u = new TextDecoder("utf-8");
|
|
162
160
|
u.decode(), n.onPartBegin = function() {
|
|
163
|
-
n.onPartData = m, n.onPartEnd = P, E = "",
|
|
161
|
+
n.onPartData = m, n.onPartEnd = P, E = "", l = "", h = "", H = "", e = "", a = null, d.length = 0;
|
|
164
162
|
}, n.onHeaderField = function(i) {
|
|
165
163
|
E += u.decode(i, { stream: true });
|
|
166
164
|
}, n.onHeaderValue = function(i) {
|
|
167
|
-
|
|
165
|
+
l += u.decode(i, { stream: true });
|
|
168
166
|
}, n.onHeaderEnd = function() {
|
|
169
|
-
if (
|
|
170
|
-
const i =
|
|
171
|
-
i && (H = i[2] || i[3] || ""),
|
|
172
|
-
} else E === "content-type" && (e =
|
|
173
|
-
|
|
167
|
+
if (l += u.decode(), E = E.toLowerCase(), E === "content-disposition") {
|
|
168
|
+
const i = l.match(/\bname=("([^"]*)"|([^()<>@,;:\\"/[\]?={}\s\t]+))/i);
|
|
169
|
+
i && (H = i[2] || i[3] || ""), a = _fileName(l), a && (n.onPartData = O, n.onPartEnd = r);
|
|
170
|
+
} else E === "content-type" && (e = l);
|
|
171
|
+
l = "", E = "";
|
|
174
172
|
};
|
|
175
|
-
for await (const i of
|
|
173
|
+
for await (const i of R) n.write(i);
|
|
176
174
|
return n.end(), b;
|
|
177
175
|
}
|
|
178
176
|
c(toFormData, "toFormData"), exports.toFormData = toFormData;
|
|
@@ -1,40 +1,40 @@
|
|
|
1
1
|
import {
|
|
2
|
-
|
|
3
|
-
Zt,
|
|
2
|
+
br,
|
|
4
3
|
init_node,
|
|
5
|
-
init_node_fetch_native_DfbY2q_x
|
|
6
|
-
|
|
4
|
+
init_node_fetch_native_DfbY2q_x,
|
|
5
|
+
qn
|
|
6
|
+
} from "./chunk-SIYPQQ5S.js";
|
|
7
7
|
import {
|
|
8
8
|
__esm,
|
|
9
9
|
init_esm_shims
|
|
10
10
|
} from "./chunk-6LQDTTG3.js";
|
|
11
11
|
|
|
12
|
-
// ../../node_modules/.pnpm/node-fetch-native@1.6.
|
|
13
|
-
function
|
|
14
|
-
const
|
|
15
|
-
if (!
|
|
16
|
-
const n =
|
|
12
|
+
// ../../node_modules/.pnpm/node-fetch-native@1.6.7/node_modules/node-fetch-native/dist/chunks/multipart-parser.mjs
|
|
13
|
+
function v(u) {
|
|
14
|
+
const a = u.match(/\bfilename=("(.*?)"|([^()<>@,;:\\"/[\]?={}\s\t]+))($|;\s)/i);
|
|
15
|
+
if (!a) return;
|
|
16
|
+
const n = a[2] || a[3] || "";
|
|
17
17
|
let r = n.slice(n.lastIndexOf("\\") + 1);
|
|
18
18
|
return r = r.replace(/%22/g, '"'), r = r.replace(/&#(\d{4});/g, (d, l) => String.fromCharCode(l)), r;
|
|
19
19
|
}
|
|
20
|
-
async function
|
|
21
|
-
if (!/multipart/i.test(
|
|
22
|
-
const n =
|
|
20
|
+
async function Z(u, a) {
|
|
21
|
+
if (!/multipart/i.test(a)) throw new TypeError("Failed to fetch");
|
|
22
|
+
const n = a.match(/boundary=(?:"([^"]+)"|([^;]+))/i);
|
|
23
23
|
if (!n) throw new TypeError("no or bad content-type header, no multipart boundary");
|
|
24
|
-
const r = new
|
|
25
|
-
let d, l, c,
|
|
26
|
-
const A = [], H = new
|
|
24
|
+
const r = new k(n[1] || n[2]);
|
|
25
|
+
let d, l, c, p, e, i;
|
|
26
|
+
const A = [], H = new br(), O = E((s) => {
|
|
27
27
|
c += f.decode(s, { stream: true });
|
|
28
28
|
}, "onPartData"), y = E((s) => {
|
|
29
29
|
A.push(s);
|
|
30
|
-
}, "appendToFile"),
|
|
31
|
-
const s = new
|
|
32
|
-
H.append(
|
|
30
|
+
}, "appendToFile"), o = E(() => {
|
|
31
|
+
const s = new qn(A, i, { type: e });
|
|
32
|
+
H.append(p, s);
|
|
33
33
|
}, "appendFileToFormData"), L = E(() => {
|
|
34
|
-
H.append(
|
|
34
|
+
H.append(p, c);
|
|
35
35
|
}, "appendEntryToFormData"), f = new TextDecoder("utf-8");
|
|
36
36
|
f.decode(), r.onPartBegin = function() {
|
|
37
|
-
r.onPartData = O, r.onPartEnd = L, d = "", l = "", c = "",
|
|
37
|
+
r.onPartData = O, r.onPartEnd = L, d = "", l = "", c = "", p = "", e = "", i = null, A.length = 0;
|
|
38
38
|
}, r.onHeaderField = function(s) {
|
|
39
39
|
d += f.decode(s, { stream: true });
|
|
40
40
|
}, r.onHeaderValue = function(s) {
|
|
@@ -42,122 +42,119 @@ async function v(_, o) {
|
|
|
42
42
|
}, r.onHeaderEnd = function() {
|
|
43
43
|
if (l += f.decode(), d = d.toLowerCase(), d === "content-disposition") {
|
|
44
44
|
const s = l.match(/\bname=("([^"]*)"|([^()<>@,;:\\"/[\]?={}\s\t]+))/i);
|
|
45
|
-
s && (
|
|
45
|
+
s && (p = s[2] || s[3] || ""), i = v(l), i && (r.onPartData = y, r.onPartEnd = o);
|
|
46
46
|
} else d === "content-type" && (e = l);
|
|
47
47
|
l = "", d = "";
|
|
48
48
|
};
|
|
49
|
-
for await (const s of
|
|
49
|
+
for await (const s of u) r.write(s);
|
|
50
50
|
return r.end(), H;
|
|
51
51
|
}
|
|
52
|
-
var
|
|
52
|
+
var B, E, D, t, w, R, g, N, x, P, C, I, M, $, m, F, k;
|
|
53
53
|
var init_multipart_parser = __esm({
|
|
54
|
-
"../../node_modules/.pnpm/node-fetch-native@1.6.
|
|
54
|
+
"../../node_modules/.pnpm/node-fetch-native@1.6.7/node_modules/node-fetch-native/dist/chunks/multipart-parser.mjs"() {
|
|
55
55
|
init_esm_shims();
|
|
56
56
|
init_node();
|
|
57
57
|
init_node_fetch_native_DfbY2q_x();
|
|
58
|
-
|
|
59
|
-
E = (
|
|
58
|
+
B = Object.defineProperty;
|
|
59
|
+
E = (u, a) => B(u, "name", { value: a, configurable: true });
|
|
60
60
|
D = 0;
|
|
61
61
|
t = { START_BOUNDARY: D++, HEADER_FIELD_START: D++, HEADER_FIELD: D++, HEADER_VALUE_START: D++, HEADER_VALUE: D++, HEADER_VALUE_ALMOST_DONE: D++, HEADERS_ALMOST_DONE: D++, PART_DATA_START: D++, PART_DATA: D++, END: D++ };
|
|
62
|
-
|
|
63
|
-
|
|
62
|
+
w = 1;
|
|
63
|
+
R = { PART_BOUNDARY: w, LAST_BOUNDARY: w *= 2 };
|
|
64
64
|
g = 10;
|
|
65
65
|
N = 13;
|
|
66
|
-
|
|
67
|
-
|
|
68
|
-
|
|
69
|
-
|
|
70
|
-
|
|
71
|
-
|
|
72
|
-
|
|
66
|
+
x = 32;
|
|
67
|
+
P = 45;
|
|
68
|
+
C = 58;
|
|
69
|
+
I = 97;
|
|
70
|
+
M = 122;
|
|
71
|
+
$ = E((u) => u | 32, "lower");
|
|
72
|
+
m = E(() => {
|
|
73
73
|
}, "noop");
|
|
74
|
-
|
|
75
|
-
|
|
76
|
-
|
|
77
|
-
|
|
78
|
-
|
|
79
|
-
|
|
80
|
-
--` + o;
|
|
81
|
-
const n = new Uint8Array(o.length);
|
|
82
|
-
for (let r = 0; r < o.length; r++) n[r] = o.charCodeAt(r), this.boundaryChars[n[r]] = true;
|
|
74
|
+
F = class F2 {
|
|
75
|
+
constructor(a) {
|
|
76
|
+
this.index = 0, this.flags = 0, this.onHeaderEnd = m, this.onHeaderField = m, this.onHeadersEnd = m, this.onHeaderValue = m, this.onPartBegin = m, this.onPartData = m, this.onPartEnd = m, this.boundaryChars = {}, a = `\r
|
|
77
|
+
--` + a;
|
|
78
|
+
const n = new Uint8Array(a.length);
|
|
79
|
+
for (let r = 0; r < a.length; r++) n[r] = a.charCodeAt(r), this.boundaryChars[n[r]] = true;
|
|
83
80
|
this.boundary = n, this.lookbehind = new Uint8Array(this.boundary.length + 8), this.state = t.START_BOUNDARY;
|
|
84
81
|
}
|
|
85
|
-
write(
|
|
82
|
+
write(a) {
|
|
86
83
|
let n = 0;
|
|
87
|
-
const r =
|
|
88
|
-
let d = this.index, { lookbehind: l, boundary: c, boundaryChars:
|
|
89
|
-
const H = this.boundary.length, O = H - 1, y =
|
|
90
|
-
let
|
|
84
|
+
const r = a.length;
|
|
85
|
+
let d = this.index, { lookbehind: l, boundary: c, boundaryChars: p, index: e, state: i, flags: A } = this;
|
|
86
|
+
const H = this.boundary.length, O = H - 1, y = a.length;
|
|
87
|
+
let o, L;
|
|
91
88
|
const f = E((h) => {
|
|
92
89
|
this[h + "Mark"] = n;
|
|
93
90
|
}, "mark"), s = E((h) => {
|
|
94
91
|
delete this[h + "Mark"];
|
|
95
|
-
}, "clear"), T = E((h,
|
|
96
|
-
(
|
|
97
|
-
}, "callback"), b = E((h,
|
|
98
|
-
const
|
|
99
|
-
|
|
92
|
+
}, "clear"), T = E((h, S, _, U) => {
|
|
93
|
+
(S === void 0 || S !== _) && this[h](U && U.subarray(S, _));
|
|
94
|
+
}, "callback"), b = E((h, S) => {
|
|
95
|
+
const _ = h + "Mark";
|
|
96
|
+
_ in this && (S ? (T(h, this[_], n, a), delete this[_]) : (T(h, this[_], a.length, a), this[_] = 0));
|
|
100
97
|
}, "dataCallback");
|
|
101
|
-
for (n = 0; n < r; n++) switch (
|
|
98
|
+
for (n = 0; n < r; n++) switch (o = a[n], i) {
|
|
102
99
|
case t.START_BOUNDARY:
|
|
103
100
|
if (e === c.length - 2) {
|
|
104
|
-
if (
|
|
105
|
-
else if (
|
|
101
|
+
if (o === P) A |= R.LAST_BOUNDARY;
|
|
102
|
+
else if (o !== N) return;
|
|
106
103
|
e++;
|
|
107
104
|
break;
|
|
108
105
|
} else if (e - 1 === c.length - 2) {
|
|
109
|
-
if (A &
|
|
110
|
-
else if (!(A &
|
|
106
|
+
if (A & R.LAST_BOUNDARY && o === P) i = t.END, A = 0;
|
|
107
|
+
else if (!(A & R.LAST_BOUNDARY) && o === g) e = 0, T("onPartBegin"), i = t.HEADER_FIELD_START;
|
|
111
108
|
else return;
|
|
112
109
|
break;
|
|
113
110
|
}
|
|
114
|
-
|
|
111
|
+
o !== c[e + 2] && (e = -2), o === c[e + 2] && e++;
|
|
115
112
|
break;
|
|
116
113
|
case t.HEADER_FIELD_START:
|
|
117
114
|
i = t.HEADER_FIELD, f("onHeaderField"), e = 0;
|
|
118
115
|
case t.HEADER_FIELD:
|
|
119
|
-
if (
|
|
116
|
+
if (o === N) {
|
|
120
117
|
s("onHeaderField"), i = t.HEADERS_ALMOST_DONE;
|
|
121
118
|
break;
|
|
122
119
|
}
|
|
123
|
-
if (e++,
|
|
124
|
-
if (
|
|
120
|
+
if (e++, o === P) break;
|
|
121
|
+
if (o === C) {
|
|
125
122
|
if (e === 1) return;
|
|
126
123
|
b("onHeaderField", true), i = t.HEADER_VALUE_START;
|
|
127
124
|
break;
|
|
128
125
|
}
|
|
129
|
-
if (L =
|
|
126
|
+
if (L = $(o), L < I || L > M) return;
|
|
130
127
|
break;
|
|
131
128
|
case t.HEADER_VALUE_START:
|
|
132
|
-
if (
|
|
129
|
+
if (o === x) break;
|
|
133
130
|
f("onHeaderValue"), i = t.HEADER_VALUE;
|
|
134
131
|
case t.HEADER_VALUE:
|
|
135
|
-
|
|
132
|
+
o === N && (b("onHeaderValue", true), T("onHeaderEnd"), i = t.HEADER_VALUE_ALMOST_DONE);
|
|
136
133
|
break;
|
|
137
134
|
case t.HEADER_VALUE_ALMOST_DONE:
|
|
138
|
-
if (
|
|
135
|
+
if (o !== g) return;
|
|
139
136
|
i = t.HEADER_FIELD_START;
|
|
140
137
|
break;
|
|
141
138
|
case t.HEADERS_ALMOST_DONE:
|
|
142
|
-
if (
|
|
139
|
+
if (o !== g) return;
|
|
143
140
|
T("onHeadersEnd"), i = t.PART_DATA_START;
|
|
144
141
|
break;
|
|
145
142
|
case t.PART_DATA_START:
|
|
146
143
|
i = t.PART_DATA, f("onPartData");
|
|
147
144
|
case t.PART_DATA:
|
|
148
145
|
if (d = e, e === 0) {
|
|
149
|
-
for (n += O; n < y && !(
|
|
150
|
-
n -= O,
|
|
146
|
+
for (n += O; n < y && !(a[n] in p); ) n += H;
|
|
147
|
+
n -= O, o = a[n];
|
|
151
148
|
}
|
|
152
|
-
if (e < c.length) c[e] ===
|
|
153
|
-
else if (e === c.length) e++,
|
|
154
|
-
else if (e - 1 === c.length) if (A &
|
|
155
|
-
if (e = 0,
|
|
156
|
-
A &= ~
|
|
149
|
+
if (e < c.length) c[e] === o ? (e === 0 && b("onPartData", true), e++) : e = 0;
|
|
150
|
+
else if (e === c.length) e++, o === N ? A |= R.PART_BOUNDARY : o === P ? A |= R.LAST_BOUNDARY : e = 0;
|
|
151
|
+
else if (e - 1 === c.length) if (A & R.PART_BOUNDARY) {
|
|
152
|
+
if (e = 0, o === g) {
|
|
153
|
+
A &= ~R.PART_BOUNDARY, T("onPartEnd"), T("onPartBegin"), i = t.HEADER_FIELD_START;
|
|
157
154
|
break;
|
|
158
155
|
}
|
|
159
|
-
} else A &
|
|
160
|
-
if (e > 0) l[e - 1] =
|
|
156
|
+
} else A & R.LAST_BOUNDARY && o === P ? (T("onPartEnd"), i = t.END, A = 0) : e = 0;
|
|
157
|
+
if (e > 0) l[e - 1] = o;
|
|
161
158
|
else if (d > 0) {
|
|
162
159
|
const h = new Uint8Array(l.buffer, l.byteOffset, l.byteLength);
|
|
163
160
|
T("onPartData", 0, d, h), d = 0, f("onPartData"), n--;
|
|
@@ -175,11 +172,13 @@ var init_multipart_parser = __esm({
|
|
|
175
172
|
else if (this.state !== t.END) throw new Error("MultipartParser.end(): stream ended unexpectedly");
|
|
176
173
|
}
|
|
177
174
|
};
|
|
178
|
-
E(
|
|
179
|
-
|
|
175
|
+
E(F, "MultipartParser");
|
|
176
|
+
k = F;
|
|
177
|
+
E(v, "_fileName");
|
|
178
|
+
E(Z, "toFormData");
|
|
180
179
|
}
|
|
181
180
|
});
|
|
182
181
|
init_multipart_parser();
|
|
183
182
|
export {
|
|
184
|
-
|
|
183
|
+
Z as toFormData
|
|
185
184
|
};
|