@sheetxl/scripting-react 0.8.0-beta.1 → 0.8.0-beta.10
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/browser/esm/{Cls8yeIK4VLB6jx7.mjs → B1-evL6_FxctVica.mjs} +161 -159
- package/browser/esm/{DVwFOTQu-orFdbBG.mjs → C4dnHSqs5tpSawv4.mjs} +44 -44
- package/browser/esm/{B_Y2Mt7_n3R6KUaa.mjs → D2pLdOQduUDnV2hi.mjs} +2 -2
- package/browser/esm/index.mjs +428 -263
- package/node/esm/index.mjs +441 -276
- package/package.json +11 -11
- package/resources/locales/de/ui.msg.json +1 -0
- package/resources/locales/en/ui.msg.json +2 -0
- package/types/src/ScriptEditorCommands.d.ts +2 -0
- package/types/src/mergeImports.d.ts +64 -0
- package/browser/cjs/BAh9DnP6CTFXt1HI.cjs +0 -1
- package/browser/cjs/Bf_pmg4C0o1aKVy-.cjs +0 -2
- package/browser/cjs/CsWMPekp2nRo3bHt.cjs +0 -11
- package/browser/cjs/index.cjs +0 -9
|
@@ -1,10 +1,10 @@
|
|
|
1
1
|
/**
|
|
2
|
-
* @license @sheetxl/scripting-react - Scripting React - Monaco based script editor and scripting UI for SheetXL. - v0.8.0-beta.
|
|
2
|
+
* @license @sheetxl/scripting-react - Scripting React - Monaco based script editor and scripting UI for SheetXL. - v0.8.0-beta.10
|
|
3
3
|
*
|
|
4
4
|
* (C) 2026-present SheetXL Inc. & Michael T. Ford
|
|
5
5
|
* License: The license can be found at https://www.sheetxl.com/license.
|
|
6
6
|
*/
|
|
7
|
-
import { t as e } from "./
|
|
7
|
+
import { t as e } from "./D2pLdOQduUDnV2hi.mjs";
|
|
8
8
|
var t = e((e) => {
|
|
9
9
|
Object.defineProperty(e, "__esModule", { value: !0 }), e.DummySourceCache = void 0, e.DummySourceCache = function() {
|
|
10
10
|
function e() {}
|
|
@@ -44,7 +44,7 @@ var t = e((e) => {
|
|
|
44
44
|
c((r = r.apply(e, t || [])).next());
|
|
45
45
|
});
|
|
46
46
|
}, n = e && e.__generator || function(e, t) {
|
|
47
|
-
var n, r, i, a
|
|
47
|
+
var n, r, i, a = {
|
|
48
48
|
label: 0,
|
|
49
49
|
sent: function() {
|
|
50
50
|
if (1 & i[0]) throw i[1];
|
|
@@ -52,67 +52,67 @@ var t = e((e) => {
|
|
|
52
52
|
},
|
|
53
53
|
trys: [],
|
|
54
54
|
ops: []
|
|
55
|
-
}
|
|
56
|
-
return a = {
|
|
55
|
+
}, o = {
|
|
57
56
|
next: s(0),
|
|
58
57
|
throw: s(1),
|
|
59
58
|
return: s(2)
|
|
60
|
-
}
|
|
59
|
+
};
|
|
60
|
+
return typeof Symbol == "function" && (o[Symbol.iterator] = function() {
|
|
61
61
|
return this;
|
|
62
|
-
}),
|
|
63
|
-
function s(
|
|
62
|
+
}), o;
|
|
63
|
+
function s(o) {
|
|
64
64
|
return function(s) {
|
|
65
|
-
return function(
|
|
65
|
+
return function(o) {
|
|
66
66
|
if (n) throw TypeError("Generator is already executing.");
|
|
67
|
-
for (;
|
|
68
|
-
if (n = 1, r && (i = 2 &
|
|
69
|
-
switch (r = 0, i && (
|
|
67
|
+
for (; a;) try {
|
|
68
|
+
if (n = 1, r && (i = 2 & o[0] ? r.return : o[0] ? r.throw || ((i = r.return) && i.call(r), 0) : r.next) && !(i = i.call(r, o[1])).done) return i;
|
|
69
|
+
switch (r = 0, i && (o = [2 & o[0], i.value]), o[0]) {
|
|
70
70
|
case 0:
|
|
71
71
|
case 1:
|
|
72
|
-
i =
|
|
72
|
+
i = o;
|
|
73
73
|
break;
|
|
74
|
-
case 4: return
|
|
75
|
-
value:
|
|
74
|
+
case 4: return a.label++, {
|
|
75
|
+
value: o[1],
|
|
76
76
|
done: !1
|
|
77
77
|
};
|
|
78
78
|
case 5:
|
|
79
|
-
|
|
79
|
+
a.label++, r = o[1], o = [0];
|
|
80
80
|
continue;
|
|
81
81
|
case 7:
|
|
82
|
-
|
|
82
|
+
o = a.ops.pop(), a.trys.pop();
|
|
83
83
|
continue;
|
|
84
84
|
default:
|
|
85
|
-
if (i =
|
|
86
|
-
|
|
85
|
+
if (i = a.trys, !((i = i.length > 0 && i[i.length - 1]) || o[0] !== 6 && o[0] !== 2)) {
|
|
86
|
+
a = 0;
|
|
87
87
|
continue;
|
|
88
88
|
}
|
|
89
|
-
if (
|
|
90
|
-
|
|
89
|
+
if (o[0] === 3 && (!i || o[1] > i[0] && o[1] < i[3])) {
|
|
90
|
+
a.label = o[1];
|
|
91
91
|
break;
|
|
92
92
|
}
|
|
93
|
-
if (
|
|
94
|
-
|
|
93
|
+
if (o[0] === 6 && a.label < i[1]) {
|
|
94
|
+
a.label = i[1], i = o;
|
|
95
95
|
break;
|
|
96
96
|
}
|
|
97
|
-
if (i &&
|
|
98
|
-
|
|
97
|
+
if (i && a.label < i[2]) {
|
|
98
|
+
a.label = i[2], a.ops.push(o);
|
|
99
99
|
break;
|
|
100
100
|
}
|
|
101
|
-
i[2] &&
|
|
101
|
+
i[2] && a.ops.pop(), a.trys.pop();
|
|
102
102
|
continue;
|
|
103
103
|
}
|
|
104
|
-
|
|
104
|
+
o = t.call(e, a);
|
|
105
105
|
} catch (e) {
|
|
106
|
-
|
|
106
|
+
o = [6, e], r = 0;
|
|
107
107
|
} finally {
|
|
108
108
|
n = i = 0;
|
|
109
109
|
}
|
|
110
|
-
if (5 &
|
|
110
|
+
if (5 & o[0]) throw o[1];
|
|
111
111
|
return {
|
|
112
|
-
value:
|
|
112
|
+
value: o[0] ? o[1] : void 0,
|
|
113
113
|
done: !0
|
|
114
114
|
};
|
|
115
|
-
}([
|
|
115
|
+
}([o, s]);
|
|
116
116
|
};
|
|
117
117
|
}
|
|
118
118
|
};
|
|
@@ -165,21 +165,23 @@ var t = e((e) => {
|
|
|
165
165
|
n = 47;
|
|
166
166
|
}
|
|
167
167
|
if (n === 47) {
|
|
168
|
-
if (a !== s - 1 && o !== 1)
|
|
169
|
-
if (
|
|
170
|
-
if (r.length
|
|
171
|
-
|
|
172
|
-
|
|
173
|
-
|
|
168
|
+
if (a !== s - 1 && o !== 1) {
|
|
169
|
+
if (a !== s - 1 && o === 2) {
|
|
170
|
+
if (r.length < 2 || i !== 2 || r.charCodeAt(r.length - 1) !== 46 || r.charCodeAt(r.length - 2) !== 46) {
|
|
171
|
+
if (r.length > 2) {
|
|
172
|
+
var c = r.lastIndexOf("/");
|
|
173
|
+
if (c !== r.length - 1) {
|
|
174
|
+
c === -1 ? (r = "", i = 0) : i = (r = r.slice(0, c)).length - 1 - r.lastIndexOf("/"), a = s, o = 0;
|
|
175
|
+
continue;
|
|
176
|
+
}
|
|
177
|
+
} else if (r.length === 2 || r.length === 1) {
|
|
178
|
+
r = "", i = 0, a = s, o = 0;
|
|
174
179
|
continue;
|
|
175
180
|
}
|
|
176
|
-
} else if (r.length === 2 || r.length === 1) {
|
|
177
|
-
r = "", i = 0, a = s, o = 0;
|
|
178
|
-
continue;
|
|
179
181
|
}
|
|
180
|
-
|
|
181
|
-
|
|
182
|
-
}
|
|
182
|
+
t && (r.length > 0 ? r += "/.." : r = "..", i = 2);
|
|
183
|
+
} else r.length > 0 ? r += "/" + e.slice(a + 1, s) : r = e.slice(a + 1, s), i = s - a - 1;
|
|
184
|
+
}
|
|
183
185
|
a = s, o = 0;
|
|
184
186
|
} else n === 46 && o !== -1 ? ++o : o = -1;
|
|
185
187
|
}
|
|
@@ -525,7 +527,7 @@ var t = e((e) => {
|
|
|
525
527
|
c((r = r.apply(e, t || [])).next());
|
|
526
528
|
});
|
|
527
529
|
}, d = e && e.__generator || function(e, t) {
|
|
528
|
-
var n, r, i, a
|
|
530
|
+
var n, r, i, a = {
|
|
529
531
|
label: 0,
|
|
530
532
|
sent: function() {
|
|
531
533
|
if (1 & i[0]) throw i[1];
|
|
@@ -533,67 +535,67 @@ var t = e((e) => {
|
|
|
533
535
|
},
|
|
534
536
|
trys: [],
|
|
535
537
|
ops: []
|
|
536
|
-
}
|
|
537
|
-
return a = {
|
|
538
|
+
}, o = {
|
|
538
539
|
next: s(0),
|
|
539
540
|
throw: s(1),
|
|
540
541
|
return: s(2)
|
|
541
|
-
}
|
|
542
|
+
};
|
|
543
|
+
return typeof Symbol == "function" && (o[Symbol.iterator] = function() {
|
|
542
544
|
return this;
|
|
543
|
-
}),
|
|
544
|
-
function s(
|
|
545
|
+
}), o;
|
|
546
|
+
function s(o) {
|
|
545
547
|
return function(s) {
|
|
546
|
-
return function(
|
|
548
|
+
return function(o) {
|
|
547
549
|
if (n) throw TypeError("Generator is already executing.");
|
|
548
|
-
for (;
|
|
549
|
-
if (n = 1, r && (i = 2 &
|
|
550
|
-
switch (r = 0, i && (
|
|
550
|
+
for (; a;) try {
|
|
551
|
+
if (n = 1, r && (i = 2 & o[0] ? r.return : o[0] ? r.throw || ((i = r.return) && i.call(r), 0) : r.next) && !(i = i.call(r, o[1])).done) return i;
|
|
552
|
+
switch (r = 0, i && (o = [2 & o[0], i.value]), o[0]) {
|
|
551
553
|
case 0:
|
|
552
554
|
case 1:
|
|
553
|
-
i =
|
|
555
|
+
i = o;
|
|
554
556
|
break;
|
|
555
|
-
case 4: return
|
|
556
|
-
value:
|
|
557
|
+
case 4: return a.label++, {
|
|
558
|
+
value: o[1],
|
|
557
559
|
done: !1
|
|
558
560
|
};
|
|
559
561
|
case 5:
|
|
560
|
-
|
|
562
|
+
a.label++, r = o[1], o = [0];
|
|
561
563
|
continue;
|
|
562
564
|
case 7:
|
|
563
|
-
|
|
565
|
+
o = a.ops.pop(), a.trys.pop();
|
|
564
566
|
continue;
|
|
565
567
|
default:
|
|
566
|
-
if (i =
|
|
567
|
-
|
|
568
|
+
if (i = a.trys, !((i = i.length > 0 && i[i.length - 1]) || o[0] !== 6 && o[0] !== 2)) {
|
|
569
|
+
a = 0;
|
|
568
570
|
continue;
|
|
569
571
|
}
|
|
570
|
-
if (
|
|
571
|
-
|
|
572
|
+
if (o[0] === 3 && (!i || o[1] > i[0] && o[1] < i[3])) {
|
|
573
|
+
a.label = o[1];
|
|
572
574
|
break;
|
|
573
575
|
}
|
|
574
|
-
if (
|
|
575
|
-
|
|
576
|
+
if (o[0] === 6 && a.label < i[1]) {
|
|
577
|
+
a.label = i[1], i = o;
|
|
576
578
|
break;
|
|
577
579
|
}
|
|
578
|
-
if (i &&
|
|
579
|
-
|
|
580
|
+
if (i && a.label < i[2]) {
|
|
581
|
+
a.label = i[2], a.ops.push(o);
|
|
580
582
|
break;
|
|
581
583
|
}
|
|
582
|
-
i[2] &&
|
|
584
|
+
i[2] && a.ops.pop(), a.trys.pop();
|
|
583
585
|
continue;
|
|
584
586
|
}
|
|
585
|
-
|
|
587
|
+
o = t.call(e, a);
|
|
586
588
|
} catch (e) {
|
|
587
|
-
|
|
589
|
+
o = [6, e], r = 0;
|
|
588
590
|
} finally {
|
|
589
591
|
n = i = 0;
|
|
590
592
|
}
|
|
591
|
-
if (5 &
|
|
593
|
+
if (5 & o[0]) throw o[1];
|
|
592
594
|
return {
|
|
593
|
-
value:
|
|
595
|
+
value: o[0] ? o[1] : void 0,
|
|
594
596
|
done: !0
|
|
595
597
|
};
|
|
596
|
-
}([
|
|
598
|
+
}([o, s]);
|
|
597
599
|
};
|
|
598
600
|
}
|
|
599
601
|
}, f = e && e.__values || function(e) {
|
|
@@ -968,7 +970,7 @@ var t = e((e) => {
|
|
|
968
970
|
c((r = r.apply(e, t || [])).next());
|
|
969
971
|
});
|
|
970
972
|
}, f = e && e.__generator || function(e, t) {
|
|
971
|
-
var n, r, i, a
|
|
973
|
+
var n, r, i, a = {
|
|
972
974
|
label: 0,
|
|
973
975
|
sent: function() {
|
|
974
976
|
if (1 & i[0]) throw i[1];
|
|
@@ -976,67 +978,67 @@ var t = e((e) => {
|
|
|
976
978
|
},
|
|
977
979
|
trys: [],
|
|
978
980
|
ops: []
|
|
979
|
-
}
|
|
980
|
-
return a = {
|
|
981
|
+
}, o = {
|
|
981
982
|
next: s(0),
|
|
982
983
|
throw: s(1),
|
|
983
984
|
return: s(2)
|
|
984
|
-
}
|
|
985
|
+
};
|
|
986
|
+
return typeof Symbol == "function" && (o[Symbol.iterator] = function() {
|
|
985
987
|
return this;
|
|
986
|
-
}),
|
|
987
|
-
function s(
|
|
988
|
+
}), o;
|
|
989
|
+
function s(o) {
|
|
988
990
|
return function(s) {
|
|
989
|
-
return function(
|
|
991
|
+
return function(o) {
|
|
990
992
|
if (n) throw TypeError("Generator is already executing.");
|
|
991
|
-
for (;
|
|
992
|
-
if (n = 1, r && (i = 2 &
|
|
993
|
-
switch (r = 0, i && (
|
|
993
|
+
for (; a;) try {
|
|
994
|
+
if (n = 1, r && (i = 2 & o[0] ? r.return : o[0] ? r.throw || ((i = r.return) && i.call(r), 0) : r.next) && !(i = i.call(r, o[1])).done) return i;
|
|
995
|
+
switch (r = 0, i && (o = [2 & o[0], i.value]), o[0]) {
|
|
994
996
|
case 0:
|
|
995
997
|
case 1:
|
|
996
|
-
i =
|
|
998
|
+
i = o;
|
|
997
999
|
break;
|
|
998
|
-
case 4: return
|
|
999
|
-
value:
|
|
1000
|
+
case 4: return a.label++, {
|
|
1001
|
+
value: o[1],
|
|
1000
1002
|
done: !1
|
|
1001
1003
|
};
|
|
1002
1004
|
case 5:
|
|
1003
|
-
|
|
1005
|
+
a.label++, r = o[1], o = [0];
|
|
1004
1006
|
continue;
|
|
1005
1007
|
case 7:
|
|
1006
|
-
|
|
1008
|
+
o = a.ops.pop(), a.trys.pop();
|
|
1007
1009
|
continue;
|
|
1008
1010
|
default:
|
|
1009
|
-
if (i =
|
|
1010
|
-
|
|
1011
|
+
if (i = a.trys, !((i = i.length > 0 && i[i.length - 1]) || o[0] !== 6 && o[0] !== 2)) {
|
|
1012
|
+
a = 0;
|
|
1011
1013
|
continue;
|
|
1012
1014
|
}
|
|
1013
|
-
if (
|
|
1014
|
-
|
|
1015
|
+
if (o[0] === 3 && (!i || o[1] > i[0] && o[1] < i[3])) {
|
|
1016
|
+
a.label = o[1];
|
|
1015
1017
|
break;
|
|
1016
1018
|
}
|
|
1017
|
-
if (
|
|
1018
|
-
|
|
1019
|
+
if (o[0] === 6 && a.label < i[1]) {
|
|
1020
|
+
a.label = i[1], i = o;
|
|
1019
1021
|
break;
|
|
1020
1022
|
}
|
|
1021
|
-
if (i &&
|
|
1022
|
-
|
|
1023
|
+
if (i && a.label < i[2]) {
|
|
1024
|
+
a.label = i[2], a.ops.push(o);
|
|
1023
1025
|
break;
|
|
1024
1026
|
}
|
|
1025
|
-
i[2] &&
|
|
1027
|
+
i[2] && a.ops.pop(), a.trys.pop();
|
|
1026
1028
|
continue;
|
|
1027
1029
|
}
|
|
1028
|
-
|
|
1030
|
+
o = t.call(e, a);
|
|
1029
1031
|
} catch (e) {
|
|
1030
|
-
|
|
1032
|
+
o = [6, e], r = 0;
|
|
1031
1033
|
} finally {
|
|
1032
1034
|
n = i = 0;
|
|
1033
1035
|
}
|
|
1034
|
-
if (5 &
|
|
1036
|
+
if (5 & o[0]) throw o[1];
|
|
1035
1037
|
return {
|
|
1036
|
-
value:
|
|
1038
|
+
value: o[0] ? o[1] : void 0,
|
|
1037
1039
|
done: !0
|
|
1038
1040
|
};
|
|
1039
|
-
}([
|
|
1041
|
+
}([o, s]);
|
|
1040
1042
|
};
|
|
1041
1043
|
}
|
|
1042
1044
|
}, p = e && e.__values || function(e) {
|
|
@@ -1191,7 +1193,7 @@ var t = e((e) => {
|
|
|
1191
1193
|
c((r = r.apply(e, t || [])).next());
|
|
1192
1194
|
});
|
|
1193
1195
|
}, n = e && e.__generator || function(e, t) {
|
|
1194
|
-
var n, r, i, a
|
|
1196
|
+
var n, r, i, a = {
|
|
1195
1197
|
label: 0,
|
|
1196
1198
|
sent: function() {
|
|
1197
1199
|
if (1 & i[0]) throw i[1];
|
|
@@ -1199,67 +1201,67 @@ var t = e((e) => {
|
|
|
1199
1201
|
},
|
|
1200
1202
|
trys: [],
|
|
1201
1203
|
ops: []
|
|
1202
|
-
}
|
|
1203
|
-
return a = {
|
|
1204
|
+
}, o = {
|
|
1204
1205
|
next: s(0),
|
|
1205
1206
|
throw: s(1),
|
|
1206
1207
|
return: s(2)
|
|
1207
|
-
}
|
|
1208
|
+
};
|
|
1209
|
+
return typeof Symbol == "function" && (o[Symbol.iterator] = function() {
|
|
1208
1210
|
return this;
|
|
1209
|
-
}),
|
|
1210
|
-
function s(
|
|
1211
|
+
}), o;
|
|
1212
|
+
function s(o) {
|
|
1211
1213
|
return function(s) {
|
|
1212
|
-
return function(
|
|
1214
|
+
return function(o) {
|
|
1213
1215
|
if (n) throw TypeError("Generator is already executing.");
|
|
1214
|
-
for (;
|
|
1215
|
-
if (n = 1, r && (i = 2 &
|
|
1216
|
-
switch (r = 0, i && (
|
|
1216
|
+
for (; a;) try {
|
|
1217
|
+
if (n = 1, r && (i = 2 & o[0] ? r.return : o[0] ? r.throw || ((i = r.return) && i.call(r), 0) : r.next) && !(i = i.call(r, o[1])).done) return i;
|
|
1218
|
+
switch (r = 0, i && (o = [2 & o[0], i.value]), o[0]) {
|
|
1217
1219
|
case 0:
|
|
1218
1220
|
case 1:
|
|
1219
|
-
i =
|
|
1221
|
+
i = o;
|
|
1220
1222
|
break;
|
|
1221
|
-
case 4: return
|
|
1222
|
-
value:
|
|
1223
|
+
case 4: return a.label++, {
|
|
1224
|
+
value: o[1],
|
|
1223
1225
|
done: !1
|
|
1224
1226
|
};
|
|
1225
1227
|
case 5:
|
|
1226
|
-
|
|
1228
|
+
a.label++, r = o[1], o = [0];
|
|
1227
1229
|
continue;
|
|
1228
1230
|
case 7:
|
|
1229
|
-
|
|
1231
|
+
o = a.ops.pop(), a.trys.pop();
|
|
1230
1232
|
continue;
|
|
1231
1233
|
default:
|
|
1232
|
-
if (i =
|
|
1233
|
-
|
|
1234
|
+
if (i = a.trys, !((i = i.length > 0 && i[i.length - 1]) || o[0] !== 6 && o[0] !== 2)) {
|
|
1235
|
+
a = 0;
|
|
1234
1236
|
continue;
|
|
1235
1237
|
}
|
|
1236
|
-
if (
|
|
1237
|
-
|
|
1238
|
+
if (o[0] === 3 && (!i || o[1] > i[0] && o[1] < i[3])) {
|
|
1239
|
+
a.label = o[1];
|
|
1238
1240
|
break;
|
|
1239
1241
|
}
|
|
1240
|
-
if (
|
|
1241
|
-
|
|
1242
|
+
if (o[0] === 6 && a.label < i[1]) {
|
|
1243
|
+
a.label = i[1], i = o;
|
|
1242
1244
|
break;
|
|
1243
1245
|
}
|
|
1244
|
-
if (i &&
|
|
1245
|
-
|
|
1246
|
+
if (i && a.label < i[2]) {
|
|
1247
|
+
a.label = i[2], a.ops.push(o);
|
|
1246
1248
|
break;
|
|
1247
1249
|
}
|
|
1248
|
-
i[2] &&
|
|
1250
|
+
i[2] && a.ops.pop(), a.trys.pop();
|
|
1249
1251
|
continue;
|
|
1250
1252
|
}
|
|
1251
|
-
|
|
1253
|
+
o = t.call(e, a);
|
|
1252
1254
|
} catch (e) {
|
|
1253
|
-
|
|
1255
|
+
o = [6, e], r = 0;
|
|
1254
1256
|
} finally {
|
|
1255
1257
|
n = i = 0;
|
|
1256
1258
|
}
|
|
1257
|
-
if (5 &
|
|
1259
|
+
if (5 & o[0]) throw o[1];
|
|
1258
1260
|
return {
|
|
1259
|
-
value:
|
|
1261
|
+
value: o[0] ? o[1] : void 0,
|
|
1260
1262
|
done: !0
|
|
1261
1263
|
};
|
|
1262
|
-
}([
|
|
1264
|
+
}([o, s]);
|
|
1263
1265
|
};
|
|
1264
1266
|
}
|
|
1265
1267
|
}, r = e && e.__values || function(e) {
|
|
@@ -1352,7 +1354,7 @@ var t = e((e) => {
|
|
|
1352
1354
|
c((r = r.apply(e, t || [])).next());
|
|
1353
1355
|
});
|
|
1354
1356
|
}, n = e && e.__generator || function(e, t) {
|
|
1355
|
-
var n, r, i, a
|
|
1357
|
+
var n, r, i, a = {
|
|
1356
1358
|
label: 0,
|
|
1357
1359
|
sent: function() {
|
|
1358
1360
|
if (1 & i[0]) throw i[1];
|
|
@@ -1360,67 +1362,67 @@ var t = e((e) => {
|
|
|
1360
1362
|
},
|
|
1361
1363
|
trys: [],
|
|
1362
1364
|
ops: []
|
|
1363
|
-
}
|
|
1364
|
-
return a = {
|
|
1365
|
+
}, o = {
|
|
1365
1366
|
next: s(0),
|
|
1366
1367
|
throw: s(1),
|
|
1367
1368
|
return: s(2)
|
|
1368
|
-
}
|
|
1369
|
+
};
|
|
1370
|
+
return typeof Symbol == "function" && (o[Symbol.iterator] = function() {
|
|
1369
1371
|
return this;
|
|
1370
|
-
}),
|
|
1371
|
-
function s(
|
|
1372
|
+
}), o;
|
|
1373
|
+
function s(o) {
|
|
1372
1374
|
return function(s) {
|
|
1373
|
-
return function(
|
|
1375
|
+
return function(o) {
|
|
1374
1376
|
if (n) throw TypeError("Generator is already executing.");
|
|
1375
|
-
for (;
|
|
1376
|
-
if (n = 1, r && (i = 2 &
|
|
1377
|
-
switch (r = 0, i && (
|
|
1377
|
+
for (; a;) try {
|
|
1378
|
+
if (n = 1, r && (i = 2 & o[0] ? r.return : o[0] ? r.throw || ((i = r.return) && i.call(r), 0) : r.next) && !(i = i.call(r, o[1])).done) return i;
|
|
1379
|
+
switch (r = 0, i && (o = [2 & o[0], i.value]), o[0]) {
|
|
1378
1380
|
case 0:
|
|
1379
1381
|
case 1:
|
|
1380
|
-
i =
|
|
1382
|
+
i = o;
|
|
1381
1383
|
break;
|
|
1382
|
-
case 4: return
|
|
1383
|
-
value:
|
|
1384
|
+
case 4: return a.label++, {
|
|
1385
|
+
value: o[1],
|
|
1384
1386
|
done: !1
|
|
1385
1387
|
};
|
|
1386
1388
|
case 5:
|
|
1387
|
-
|
|
1389
|
+
a.label++, r = o[1], o = [0];
|
|
1388
1390
|
continue;
|
|
1389
1391
|
case 7:
|
|
1390
|
-
|
|
1392
|
+
o = a.ops.pop(), a.trys.pop();
|
|
1391
1393
|
continue;
|
|
1392
1394
|
default:
|
|
1393
|
-
if (i =
|
|
1394
|
-
|
|
1395
|
+
if (i = a.trys, !((i = i.length > 0 && i[i.length - 1]) || o[0] !== 6 && o[0] !== 2)) {
|
|
1396
|
+
a = 0;
|
|
1395
1397
|
continue;
|
|
1396
1398
|
}
|
|
1397
|
-
if (
|
|
1398
|
-
|
|
1399
|
+
if (o[0] === 3 && (!i || o[1] > i[0] && o[1] < i[3])) {
|
|
1400
|
+
a.label = o[1];
|
|
1399
1401
|
break;
|
|
1400
1402
|
}
|
|
1401
|
-
if (
|
|
1402
|
-
|
|
1403
|
+
if (o[0] === 6 && a.label < i[1]) {
|
|
1404
|
+
a.label = i[1], i = o;
|
|
1403
1405
|
break;
|
|
1404
1406
|
}
|
|
1405
|
-
if (i &&
|
|
1406
|
-
|
|
1407
|
+
if (i && a.label < i[2]) {
|
|
1408
|
+
a.label = i[2], a.ops.push(o);
|
|
1407
1409
|
break;
|
|
1408
1410
|
}
|
|
1409
|
-
i[2] &&
|
|
1411
|
+
i[2] && a.ops.pop(), a.trys.pop();
|
|
1410
1412
|
continue;
|
|
1411
1413
|
}
|
|
1412
|
-
|
|
1414
|
+
o = t.call(e, a);
|
|
1413
1415
|
} catch (e) {
|
|
1414
|
-
|
|
1416
|
+
o = [6, e], r = 0;
|
|
1415
1417
|
} finally {
|
|
1416
1418
|
n = i = 0;
|
|
1417
1419
|
}
|
|
1418
|
-
if (5 &
|
|
1420
|
+
if (5 & o[0]) throw o[1];
|
|
1419
1421
|
return {
|
|
1420
|
-
value:
|
|
1422
|
+
value: o[0] ? o[1] : void 0,
|
|
1421
1423
|
done: !0
|
|
1422
1424
|
};
|
|
1423
|
-
}([
|
|
1425
|
+
}([o, s]);
|
|
1424
1426
|
};
|
|
1425
1427
|
}
|
|
1426
1428
|
};
|