@modern-js/plugin-data-loader 2.19.0 → 2.20.0
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/CHANGELOG.md +16 -0
- package/dist/cjs/cli/generateClient.js +2 -6
- package/dist/cjs/server/index.js +5 -48
- package/dist/esm/cli/createRequest.js +4 -133
- package/dist/esm/cli/data.js +13 -374
- package/dist/esm/cli/loader.js +4 -190
- package/dist/esm/runtime/index.js +6 -198
- package/dist/esm/runtime/response.js +5 -203
- package/dist/esm/server/index.js +3 -132
- package/package.json +8 -8
package/dist/esm/cli/loader.js
CHANGED
|
@@ -1,192 +1,6 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
for (var i = 0, arr2 = new Array(len); i < len; i++)
|
|
5
|
-
arr2[i] = arr[i];
|
|
6
|
-
return arr2;
|
|
7
|
-
}
|
|
8
|
-
function _array_with_holes(arr) {
|
|
9
|
-
if (Array.isArray(arr))
|
|
10
|
-
return arr;
|
|
11
|
-
}
|
|
12
|
-
function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) {
|
|
13
|
-
try {
|
|
14
|
-
var info = gen[key](arg);
|
|
15
|
-
var value = info.value;
|
|
16
|
-
} catch (error) {
|
|
17
|
-
reject(error);
|
|
18
|
-
return;
|
|
19
|
-
}
|
|
20
|
-
if (info.done) {
|
|
21
|
-
resolve(value);
|
|
22
|
-
} else {
|
|
23
|
-
Promise.resolve(value).then(_next, _throw);
|
|
24
|
-
}
|
|
25
|
-
}
|
|
26
|
-
function _async_to_generator(fn) {
|
|
27
|
-
return function() {
|
|
28
|
-
var self = this, args = arguments;
|
|
29
|
-
return new Promise(function(resolve, reject) {
|
|
30
|
-
var gen = fn.apply(self, args);
|
|
31
|
-
function _next(value) {
|
|
32
|
-
asyncGeneratorStep(gen, resolve, reject, _next, _throw, "next", value);
|
|
33
|
-
}
|
|
34
|
-
function _throw(err) {
|
|
35
|
-
asyncGeneratorStep(gen, resolve, reject, _next, _throw, "throw", err);
|
|
36
|
-
}
|
|
37
|
-
_next(void 0);
|
|
38
|
-
});
|
|
39
|
-
};
|
|
40
|
-
}
|
|
41
|
-
function _iterable_to_array_limit(arr, i) {
|
|
42
|
-
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
43
|
-
if (_i == null)
|
|
44
|
-
return;
|
|
45
|
-
var _arr = [];
|
|
46
|
-
var _n = true;
|
|
47
|
-
var _d = false;
|
|
48
|
-
var _s, _e;
|
|
49
|
-
try {
|
|
50
|
-
for (_i = _i.call(arr); !(_n = (_s = _i.next()).done); _n = true) {
|
|
51
|
-
_arr.push(_s.value);
|
|
52
|
-
if (i && _arr.length === i)
|
|
53
|
-
break;
|
|
54
|
-
}
|
|
55
|
-
} catch (err) {
|
|
56
|
-
_d = true;
|
|
57
|
-
_e = err;
|
|
58
|
-
} finally {
|
|
59
|
-
try {
|
|
60
|
-
if (!_n && _i["return"] != null)
|
|
61
|
-
_i["return"]();
|
|
62
|
-
} finally {
|
|
63
|
-
if (_d)
|
|
64
|
-
throw _e;
|
|
65
|
-
}
|
|
66
|
-
}
|
|
67
|
-
return _arr;
|
|
68
|
-
}
|
|
69
|
-
function _non_iterable_rest() {
|
|
70
|
-
throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
71
|
-
}
|
|
72
|
-
function _sliced_to_array(arr, i) {
|
|
73
|
-
return _array_with_holes(arr) || _iterable_to_array_limit(arr, i) || _unsupported_iterable_to_array(arr, i) || _non_iterable_rest();
|
|
74
|
-
}
|
|
75
|
-
function _unsupported_iterable_to_array(o, minLen) {
|
|
76
|
-
if (!o)
|
|
77
|
-
return;
|
|
78
|
-
if (typeof o === "string")
|
|
79
|
-
return _array_like_to_array(o, minLen);
|
|
80
|
-
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
81
|
-
if (n === "Object" && o.constructor)
|
|
82
|
-
n = o.constructor.name;
|
|
83
|
-
if (n === "Map" || n === "Set")
|
|
84
|
-
return Array.from(n);
|
|
85
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n))
|
|
86
|
-
return _array_like_to_array(o, minLen);
|
|
87
|
-
}
|
|
88
|
-
var __generator = function(thisArg, body) {
|
|
89
|
-
var f, y, t, g, _ = {
|
|
90
|
-
label: 0,
|
|
91
|
-
sent: function() {
|
|
92
|
-
if (t[0] & 1)
|
|
93
|
-
throw t[1];
|
|
94
|
-
return t[1];
|
|
95
|
-
},
|
|
96
|
-
trys: [],
|
|
97
|
-
ops: []
|
|
98
|
-
};
|
|
99
|
-
return g = {
|
|
100
|
-
next: verb(0),
|
|
101
|
-
"throw": verb(1),
|
|
102
|
-
"return": verb(2)
|
|
103
|
-
}, typeof Symbol === "function" && (g[Symbol.iterator] = function() {
|
|
104
|
-
return this;
|
|
105
|
-
}), g;
|
|
106
|
-
function verb(n) {
|
|
107
|
-
return function(v) {
|
|
108
|
-
return step([
|
|
109
|
-
n,
|
|
110
|
-
v
|
|
111
|
-
]);
|
|
112
|
-
};
|
|
113
|
-
}
|
|
114
|
-
function step(op) {
|
|
115
|
-
if (f)
|
|
116
|
-
throw new TypeError("Generator is already executing.");
|
|
117
|
-
while (_)
|
|
118
|
-
try {
|
|
119
|
-
if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done)
|
|
120
|
-
return t;
|
|
121
|
-
if (y = 0, t)
|
|
122
|
-
op = [
|
|
123
|
-
op[0] & 2,
|
|
124
|
-
t.value
|
|
125
|
-
];
|
|
126
|
-
switch (op[0]) {
|
|
127
|
-
case 0:
|
|
128
|
-
case 1:
|
|
129
|
-
t = op;
|
|
130
|
-
break;
|
|
131
|
-
case 4:
|
|
132
|
-
_.label++;
|
|
133
|
-
return {
|
|
134
|
-
value: op[1],
|
|
135
|
-
done: false
|
|
136
|
-
};
|
|
137
|
-
case 5:
|
|
138
|
-
_.label++;
|
|
139
|
-
y = op[1];
|
|
140
|
-
op = [
|
|
141
|
-
0
|
|
142
|
-
];
|
|
143
|
-
continue;
|
|
144
|
-
case 7:
|
|
145
|
-
op = _.ops.pop();
|
|
146
|
-
_.trys.pop();
|
|
147
|
-
continue;
|
|
148
|
-
default:
|
|
149
|
-
if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) {
|
|
150
|
-
_ = 0;
|
|
151
|
-
continue;
|
|
152
|
-
}
|
|
153
|
-
if (op[0] === 3 && (!t || op[1] > t[0] && op[1] < t[3])) {
|
|
154
|
-
_.label = op[1];
|
|
155
|
-
break;
|
|
156
|
-
}
|
|
157
|
-
if (op[0] === 6 && _.label < t[1]) {
|
|
158
|
-
_.label = t[1];
|
|
159
|
-
t = op;
|
|
160
|
-
break;
|
|
161
|
-
}
|
|
162
|
-
if (t && _.label < t[2]) {
|
|
163
|
-
_.label = t[2];
|
|
164
|
-
_.ops.push(op);
|
|
165
|
-
break;
|
|
166
|
-
}
|
|
167
|
-
if (t[2])
|
|
168
|
-
_.ops.pop();
|
|
169
|
-
_.trys.pop();
|
|
170
|
-
continue;
|
|
171
|
-
}
|
|
172
|
-
op = body.call(thisArg, _);
|
|
173
|
-
} catch (e) {
|
|
174
|
-
op = [
|
|
175
|
-
6,
|
|
176
|
-
e
|
|
177
|
-
];
|
|
178
|
-
y = 0;
|
|
179
|
-
} finally {
|
|
180
|
-
f = t = 0;
|
|
181
|
-
}
|
|
182
|
-
if (op[0] & 5)
|
|
183
|
-
throw op[1];
|
|
184
|
-
return {
|
|
185
|
-
value: op[0] ? op[1] : void 0,
|
|
186
|
-
done: true
|
|
187
|
-
};
|
|
188
|
-
}
|
|
189
|
-
};
|
|
1
|
+
import { _ as _async_to_generator } from "@swc/helpers/_/_async_to_generator";
|
|
2
|
+
import { _ as _sliced_to_array } from "@swc/helpers/_/_sliced_to_array";
|
|
3
|
+
import { _ as _ts_generator } from "@swc/helpers/_/_ts_generator";
|
|
190
4
|
import { generateClient } from "./generateClient";
|
|
191
5
|
export default function loader(source) {
|
|
192
6
|
return _loader.apply(this, arguments);
|
|
@@ -194,7 +8,7 @@ export default function loader(source) {
|
|
|
194
8
|
function _loader() {
|
|
195
9
|
_loader = _async_to_generator(function(source) {
|
|
196
10
|
var _this__compiler, target, resourceQuery, options, code;
|
|
197
|
-
return
|
|
11
|
+
return _ts_generator(this, function(_state) {
|
|
198
12
|
this.cacheable();
|
|
199
13
|
target = (_this__compiler = this._compiler) === null || _this__compiler === void 0 ? void 0 : _this__compiler.options.target;
|
|
200
14
|
if (target === "node") {
|
|
@@ -1,199 +1,7 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
arr2[i] = arr[i];
|
|
6
|
-
return arr2;
|
|
7
|
-
}
|
|
8
|
-
function _array_with_holes(arr) {
|
|
9
|
-
if (Array.isArray(arr))
|
|
10
|
-
return arr;
|
|
11
|
-
}
|
|
12
|
-
function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) {
|
|
13
|
-
try {
|
|
14
|
-
var info = gen[key](arg);
|
|
15
|
-
var value = info.value;
|
|
16
|
-
} catch (error) {
|
|
17
|
-
reject(error);
|
|
18
|
-
return;
|
|
19
|
-
}
|
|
20
|
-
if (info.done) {
|
|
21
|
-
resolve(value);
|
|
22
|
-
} else {
|
|
23
|
-
Promise.resolve(value).then(_next, _throw);
|
|
24
|
-
}
|
|
25
|
-
}
|
|
26
|
-
function _async_to_generator(fn) {
|
|
27
|
-
return function() {
|
|
28
|
-
var self = this, args = arguments;
|
|
29
|
-
return new Promise(function(resolve, reject) {
|
|
30
|
-
var gen = fn.apply(self, args);
|
|
31
|
-
function _next(value) {
|
|
32
|
-
asyncGeneratorStep(gen, resolve, reject, _next, _throw, "next", value);
|
|
33
|
-
}
|
|
34
|
-
function _throw(err) {
|
|
35
|
-
asyncGeneratorStep(gen, resolve, reject, _next, _throw, "throw", err);
|
|
36
|
-
}
|
|
37
|
-
_next(void 0);
|
|
38
|
-
});
|
|
39
|
-
};
|
|
40
|
-
}
|
|
41
|
-
function _instanceof(left, right) {
|
|
42
|
-
if (right != null && typeof Symbol !== "undefined" && right[Symbol.hasInstance]) {
|
|
43
|
-
return !!right[Symbol.hasInstance](left);
|
|
44
|
-
} else {
|
|
45
|
-
return left instanceof right;
|
|
46
|
-
}
|
|
47
|
-
}
|
|
48
|
-
function _iterable_to_array_limit(arr, i) {
|
|
49
|
-
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
50
|
-
if (_i == null)
|
|
51
|
-
return;
|
|
52
|
-
var _arr = [];
|
|
53
|
-
var _n = true;
|
|
54
|
-
var _d = false;
|
|
55
|
-
var _s, _e;
|
|
56
|
-
try {
|
|
57
|
-
for (_i = _i.call(arr); !(_n = (_s = _i.next()).done); _n = true) {
|
|
58
|
-
_arr.push(_s.value);
|
|
59
|
-
if (i && _arr.length === i)
|
|
60
|
-
break;
|
|
61
|
-
}
|
|
62
|
-
} catch (err) {
|
|
63
|
-
_d = true;
|
|
64
|
-
_e = err;
|
|
65
|
-
} finally {
|
|
66
|
-
try {
|
|
67
|
-
if (!_n && _i["return"] != null)
|
|
68
|
-
_i["return"]();
|
|
69
|
-
} finally {
|
|
70
|
-
if (_d)
|
|
71
|
-
throw _e;
|
|
72
|
-
}
|
|
73
|
-
}
|
|
74
|
-
return _arr;
|
|
75
|
-
}
|
|
76
|
-
function _non_iterable_rest() {
|
|
77
|
-
throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
78
|
-
}
|
|
79
|
-
function _sliced_to_array(arr, i) {
|
|
80
|
-
return _array_with_holes(arr) || _iterable_to_array_limit(arr, i) || _unsupported_iterable_to_array(arr, i) || _non_iterable_rest();
|
|
81
|
-
}
|
|
82
|
-
function _unsupported_iterable_to_array(o, minLen) {
|
|
83
|
-
if (!o)
|
|
84
|
-
return;
|
|
85
|
-
if (typeof o === "string")
|
|
86
|
-
return _array_like_to_array(o, minLen);
|
|
87
|
-
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
88
|
-
if (n === "Object" && o.constructor)
|
|
89
|
-
n = o.constructor.name;
|
|
90
|
-
if (n === "Map" || n === "Set")
|
|
91
|
-
return Array.from(n);
|
|
92
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n))
|
|
93
|
-
return _array_like_to_array(o, minLen);
|
|
94
|
-
}
|
|
95
|
-
var __generator = function(thisArg, body) {
|
|
96
|
-
var f, y, t, g, _ = {
|
|
97
|
-
label: 0,
|
|
98
|
-
sent: function() {
|
|
99
|
-
if (t[0] & 1)
|
|
100
|
-
throw t[1];
|
|
101
|
-
return t[1];
|
|
102
|
-
},
|
|
103
|
-
trys: [],
|
|
104
|
-
ops: []
|
|
105
|
-
};
|
|
106
|
-
return g = {
|
|
107
|
-
next: verb(0),
|
|
108
|
-
"throw": verb(1),
|
|
109
|
-
"return": verb(2)
|
|
110
|
-
}, typeof Symbol === "function" && (g[Symbol.iterator] = function() {
|
|
111
|
-
return this;
|
|
112
|
-
}), g;
|
|
113
|
-
function verb(n) {
|
|
114
|
-
return function(v) {
|
|
115
|
-
return step([
|
|
116
|
-
n,
|
|
117
|
-
v
|
|
118
|
-
]);
|
|
119
|
-
};
|
|
120
|
-
}
|
|
121
|
-
function step(op) {
|
|
122
|
-
if (f)
|
|
123
|
-
throw new TypeError("Generator is already executing.");
|
|
124
|
-
while (_)
|
|
125
|
-
try {
|
|
126
|
-
if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done)
|
|
127
|
-
return t;
|
|
128
|
-
if (y = 0, t)
|
|
129
|
-
op = [
|
|
130
|
-
op[0] & 2,
|
|
131
|
-
t.value
|
|
132
|
-
];
|
|
133
|
-
switch (op[0]) {
|
|
134
|
-
case 0:
|
|
135
|
-
case 1:
|
|
136
|
-
t = op;
|
|
137
|
-
break;
|
|
138
|
-
case 4:
|
|
139
|
-
_.label++;
|
|
140
|
-
return {
|
|
141
|
-
value: op[1],
|
|
142
|
-
done: false
|
|
143
|
-
};
|
|
144
|
-
case 5:
|
|
145
|
-
_.label++;
|
|
146
|
-
y = op[1];
|
|
147
|
-
op = [
|
|
148
|
-
0
|
|
149
|
-
];
|
|
150
|
-
continue;
|
|
151
|
-
case 7:
|
|
152
|
-
op = _.ops.pop();
|
|
153
|
-
_.trys.pop();
|
|
154
|
-
continue;
|
|
155
|
-
default:
|
|
156
|
-
if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) {
|
|
157
|
-
_ = 0;
|
|
158
|
-
continue;
|
|
159
|
-
}
|
|
160
|
-
if (op[0] === 3 && (!t || op[1] > t[0] && op[1] < t[3])) {
|
|
161
|
-
_.label = op[1];
|
|
162
|
-
break;
|
|
163
|
-
}
|
|
164
|
-
if (op[0] === 6 && _.label < t[1]) {
|
|
165
|
-
_.label = t[1];
|
|
166
|
-
t = op;
|
|
167
|
-
break;
|
|
168
|
-
}
|
|
169
|
-
if (t && _.label < t[2]) {
|
|
170
|
-
_.label = t[2];
|
|
171
|
-
_.ops.push(op);
|
|
172
|
-
break;
|
|
173
|
-
}
|
|
174
|
-
if (t[2])
|
|
175
|
-
_.ops.pop();
|
|
176
|
-
_.trys.pop();
|
|
177
|
-
continue;
|
|
178
|
-
}
|
|
179
|
-
op = body.call(thisArg, _);
|
|
180
|
-
} catch (e) {
|
|
181
|
-
op = [
|
|
182
|
-
6,
|
|
183
|
-
e
|
|
184
|
-
];
|
|
185
|
-
y = 0;
|
|
186
|
-
} finally {
|
|
187
|
-
f = t = 0;
|
|
188
|
-
}
|
|
189
|
-
if (op[0] & 5)
|
|
190
|
-
throw op[1];
|
|
191
|
-
return {
|
|
192
|
-
value: op[0] ? op[1] : void 0,
|
|
193
|
-
done: true
|
|
194
|
-
};
|
|
195
|
-
}
|
|
196
|
-
};
|
|
1
|
+
import { _ as _async_to_generator } from "@swc/helpers/_/_async_to_generator";
|
|
2
|
+
import { _ as _instanceof } from "@swc/helpers/_/_instanceof";
|
|
3
|
+
import { _ as _sliced_to_array } from "@swc/helpers/_/_sliced_to_array";
|
|
4
|
+
import { _ as _ts_generator } from "@swc/helpers/_/_ts_generator";
|
|
197
5
|
import { installGlobals, writeReadableStreamToWritable, Response as NodeResponse } from "@remix-run/node";
|
|
198
6
|
import { createStaticHandler, ErrorResponse, UNSAFE_DEFERRED_SYMBOL as DEFERRED_SYMBOL, transformNestedRoutes } from "@modern-js/utils/runtime/router";
|
|
199
7
|
import { isPlainObject } from "@modern-js/utils/lodash";
|
|
@@ -290,7 +98,7 @@ var createLoaderRequest = function(context) {
|
|
|
290
98
|
var sendLoaderResponse = function() {
|
|
291
99
|
var _ref = _async_to_generator(function(res, nodeResponse) {
|
|
292
100
|
var _iteratorNormalCompletion, _didIteratorError, _iteratorError, _iterator, _step, _step_value, key, value;
|
|
293
|
-
return
|
|
101
|
+
return _ts_generator(this, function(_state) {
|
|
294
102
|
switch (_state.label) {
|
|
295
103
|
case 0:
|
|
296
104
|
res.statusMessage = nodeResponse.statusText;
|
|
@@ -347,7 +155,7 @@ var sendLoaderResponse = function() {
|
|
|
347
155
|
export var handleRequest = function() {
|
|
348
156
|
var _ref = _async_to_generator(function(param) {
|
|
349
157
|
var context, serverRoutes, routesConfig, method, query, routeId, entry, basename, routes, queryRoute, res, logger, request, response, deferredData, body, init, headers, error, message;
|
|
350
|
-
return
|
|
158
|
+
return _ts_generator(this, function(_state) {
|
|
351
159
|
switch (_state.label) {
|
|
352
160
|
case 0:
|
|
353
161
|
context = param.context, serverRoutes = param.serverRoutes, routesConfig = param.routes;
|
|
@@ -1,205 +1,7 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
arr2[i] = arr[i];
|
|
6
|
-
return arr2;
|
|
7
|
-
}
|
|
8
|
-
function _array_with_holes(arr) {
|
|
9
|
-
if (Array.isArray(arr))
|
|
10
|
-
return arr;
|
|
11
|
-
}
|
|
12
|
-
function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) {
|
|
13
|
-
try {
|
|
14
|
-
var info = gen[key](arg);
|
|
15
|
-
var value = info.value;
|
|
16
|
-
} catch (error) {
|
|
17
|
-
reject(error);
|
|
18
|
-
return;
|
|
19
|
-
}
|
|
20
|
-
if (info.done) {
|
|
21
|
-
resolve(value);
|
|
22
|
-
} else {
|
|
23
|
-
Promise.resolve(value).then(_next, _throw);
|
|
24
|
-
}
|
|
25
|
-
}
|
|
26
|
-
function _async_to_generator(fn) {
|
|
27
|
-
return function() {
|
|
28
|
-
var self = this, args = arguments;
|
|
29
|
-
return new Promise(function(resolve, reject) {
|
|
30
|
-
var gen = fn.apply(self, args);
|
|
31
|
-
function _next(value) {
|
|
32
|
-
asyncGeneratorStep(gen, resolve, reject, _next, _throw, "next", value);
|
|
33
|
-
}
|
|
34
|
-
function _throw(err) {
|
|
35
|
-
asyncGeneratorStep(gen, resolve, reject, _next, _throw, "throw", err);
|
|
36
|
-
}
|
|
37
|
-
_next(void 0);
|
|
38
|
-
});
|
|
39
|
-
};
|
|
40
|
-
}
|
|
41
|
-
function _define_property(obj, key, value) {
|
|
42
|
-
if (key in obj) {
|
|
43
|
-
Object.defineProperty(obj, key, {
|
|
44
|
-
value: value,
|
|
45
|
-
enumerable: true,
|
|
46
|
-
configurable: true,
|
|
47
|
-
writable: true
|
|
48
|
-
});
|
|
49
|
-
} else {
|
|
50
|
-
obj[key] = value;
|
|
51
|
-
}
|
|
52
|
-
return obj;
|
|
53
|
-
}
|
|
54
|
-
function _iterable_to_array_limit(arr, i) {
|
|
55
|
-
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
56
|
-
if (_i == null)
|
|
57
|
-
return;
|
|
58
|
-
var _arr = [];
|
|
59
|
-
var _n = true;
|
|
60
|
-
var _d = false;
|
|
61
|
-
var _s, _e;
|
|
62
|
-
try {
|
|
63
|
-
for (_i = _i.call(arr); !(_n = (_s = _i.next()).done); _n = true) {
|
|
64
|
-
_arr.push(_s.value);
|
|
65
|
-
if (i && _arr.length === i)
|
|
66
|
-
break;
|
|
67
|
-
}
|
|
68
|
-
} catch (err) {
|
|
69
|
-
_d = true;
|
|
70
|
-
_e = err;
|
|
71
|
-
} finally {
|
|
72
|
-
try {
|
|
73
|
-
if (!_n && _i["return"] != null)
|
|
74
|
-
_i["return"]();
|
|
75
|
-
} finally {
|
|
76
|
-
if (_d)
|
|
77
|
-
throw _e;
|
|
78
|
-
}
|
|
79
|
-
}
|
|
80
|
-
return _arr;
|
|
81
|
-
}
|
|
82
|
-
function _non_iterable_rest() {
|
|
83
|
-
throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
84
|
-
}
|
|
85
|
-
function _sliced_to_array(arr, i) {
|
|
86
|
-
return _array_with_holes(arr) || _iterable_to_array_limit(arr, i) || _unsupported_iterable_to_array(arr, i) || _non_iterable_rest();
|
|
87
|
-
}
|
|
88
|
-
function _unsupported_iterable_to_array(o, minLen) {
|
|
89
|
-
if (!o)
|
|
90
|
-
return;
|
|
91
|
-
if (typeof o === "string")
|
|
92
|
-
return _array_like_to_array(o, minLen);
|
|
93
|
-
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
94
|
-
if (n === "Object" && o.constructor)
|
|
95
|
-
n = o.constructor.name;
|
|
96
|
-
if (n === "Map" || n === "Set")
|
|
97
|
-
return Array.from(n);
|
|
98
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n))
|
|
99
|
-
return _array_like_to_array(o, minLen);
|
|
100
|
-
}
|
|
101
|
-
var __generator = function(thisArg, body) {
|
|
102
|
-
var f, y, t, g, _ = {
|
|
103
|
-
label: 0,
|
|
104
|
-
sent: function() {
|
|
105
|
-
if (t[0] & 1)
|
|
106
|
-
throw t[1];
|
|
107
|
-
return t[1];
|
|
108
|
-
},
|
|
109
|
-
trys: [],
|
|
110
|
-
ops: []
|
|
111
|
-
};
|
|
112
|
-
return g = {
|
|
113
|
-
next: verb(0),
|
|
114
|
-
"throw": verb(1),
|
|
115
|
-
"return": verb(2)
|
|
116
|
-
}, typeof Symbol === "function" && (g[Symbol.iterator] = function() {
|
|
117
|
-
return this;
|
|
118
|
-
}), g;
|
|
119
|
-
function verb(n) {
|
|
120
|
-
return function(v) {
|
|
121
|
-
return step([
|
|
122
|
-
n,
|
|
123
|
-
v
|
|
124
|
-
]);
|
|
125
|
-
};
|
|
126
|
-
}
|
|
127
|
-
function step(op) {
|
|
128
|
-
if (f)
|
|
129
|
-
throw new TypeError("Generator is already executing.");
|
|
130
|
-
while (_)
|
|
131
|
-
try {
|
|
132
|
-
if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done)
|
|
133
|
-
return t;
|
|
134
|
-
if (y = 0, t)
|
|
135
|
-
op = [
|
|
136
|
-
op[0] & 2,
|
|
137
|
-
t.value
|
|
138
|
-
];
|
|
139
|
-
switch (op[0]) {
|
|
140
|
-
case 0:
|
|
141
|
-
case 1:
|
|
142
|
-
t = op;
|
|
143
|
-
break;
|
|
144
|
-
case 4:
|
|
145
|
-
_.label++;
|
|
146
|
-
return {
|
|
147
|
-
value: op[1],
|
|
148
|
-
done: false
|
|
149
|
-
};
|
|
150
|
-
case 5:
|
|
151
|
-
_.label++;
|
|
152
|
-
y = op[1];
|
|
153
|
-
op = [
|
|
154
|
-
0
|
|
155
|
-
];
|
|
156
|
-
continue;
|
|
157
|
-
case 7:
|
|
158
|
-
op = _.ops.pop();
|
|
159
|
-
_.trys.pop();
|
|
160
|
-
continue;
|
|
161
|
-
default:
|
|
162
|
-
if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) {
|
|
163
|
-
_ = 0;
|
|
164
|
-
continue;
|
|
165
|
-
}
|
|
166
|
-
if (op[0] === 3 && (!t || op[1] > t[0] && op[1] < t[3])) {
|
|
167
|
-
_.label = op[1];
|
|
168
|
-
break;
|
|
169
|
-
}
|
|
170
|
-
if (op[0] === 6 && _.label < t[1]) {
|
|
171
|
-
_.label = t[1];
|
|
172
|
-
t = op;
|
|
173
|
-
break;
|
|
174
|
-
}
|
|
175
|
-
if (t && _.label < t[2]) {
|
|
176
|
-
_.label = t[2];
|
|
177
|
-
_.ops.push(op);
|
|
178
|
-
break;
|
|
179
|
-
}
|
|
180
|
-
if (t[2])
|
|
181
|
-
_.ops.pop();
|
|
182
|
-
_.trys.pop();
|
|
183
|
-
continue;
|
|
184
|
-
}
|
|
185
|
-
op = body.call(thisArg, _);
|
|
186
|
-
} catch (e) {
|
|
187
|
-
op = [
|
|
188
|
-
6,
|
|
189
|
-
e
|
|
190
|
-
];
|
|
191
|
-
y = 0;
|
|
192
|
-
} finally {
|
|
193
|
-
f = t = 0;
|
|
194
|
-
}
|
|
195
|
-
if (op[0] & 5)
|
|
196
|
-
throw op[1];
|
|
197
|
-
return {
|
|
198
|
-
value: op[0] ? op[1] : void 0,
|
|
199
|
-
done: true
|
|
200
|
-
};
|
|
201
|
-
}
|
|
202
|
-
};
|
|
1
|
+
import { _ as _async_to_generator } from "@swc/helpers/_/_async_to_generator";
|
|
2
|
+
import { _ as _define_property } from "@swc/helpers/_/_define_property";
|
|
3
|
+
import { _ as _sliced_to_array } from "@swc/helpers/_/_sliced_to_array";
|
|
4
|
+
import { _ as _ts_generator } from "@swc/helpers/_/_ts_generator";
|
|
203
5
|
import { TextEncoder } from "util";
|
|
204
6
|
import { serializeJson } from "@modern-js/utils/runtime-node";
|
|
205
7
|
function isTrackedPromise(value) {
|
|
@@ -212,7 +14,7 @@ export function createDeferredReadableStream(deferredData, signal) {
|
|
|
212
14
|
start: function start(controller) {
|
|
213
15
|
return _async_to_generator(function() {
|
|
214
16
|
var criticalData, preresolvedKeys, _iteratorNormalCompletion, _didIteratorError, _iteratorError, _iterator, _step, _step_value, key, value, _iteratorNormalCompletion1, _didIteratorError1, _iteratorError1, _iterator1, _step1, preresolvedKey, unsubscribe;
|
|
215
|
-
return
|
|
17
|
+
return _ts_generator(this, function(_state) {
|
|
216
18
|
switch (_state.label) {
|
|
217
19
|
case 0:
|
|
218
20
|
criticalData = {};
|