@erase2d/fabric 1.1.8 → 1.1.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/README.md +19 -5
- package/dist/_virtual/_rollupPluginBabelHelpers.js +351 -450
- package/dist/_virtual/_rollupPluginBabelHelpers.js.map +1 -1
- package/dist/index.d.ts +0 -1
- package/dist/index.d.ts.map +1 -1
- package/package.json +1 -1
- package/tsconfig.json +5 -2
- package/types/fabric.d.ts +2 -0
- package/types/index.d.ts +1 -0
- package/dist/core/dist/src/erase.js +0 -36
- package/dist/core/dist/src/erase.js.map +0 -1
- package/dist/fabric/src/ClippingGroup.js +0 -46
- package/dist/fabric/src/ClippingGroup.js.map +0 -1
- package/dist/fabric/src/EraserBrush.js +0 -433
- package/dist/fabric/src/EraserBrush.js.map +0 -1
- package/dist/fabric/src/ErasingEffect.js +0 -117
- package/dist/fabric/src/ErasingEffect.js.map +0 -1
- package/dist/fabric/src/isTransparent.js +0 -52
- package/dist/fabric/src/isTransparent.js.map +0 -1
- package/dist/src/ClippingGroup.d.ts +0 -8
- package/dist/src/ClippingGroup.d.ts.map +0 -1
- package/dist/src/EraserBrush.d.ts +0 -114
- package/dist/src/EraserBrush.d.ts.map +0 -1
- package/dist/src/ErasingEffect.d.ts +0 -27
- package/dist/src/ErasingEffect.d.ts.map +0 -1
- package/dist/src/isTransparent.d.ts +0 -7
- package/dist/src/isTransparent.d.ts.map +0 -1
|
@@ -1,6 +1,97 @@
|
|
|
1
|
+
function _OverloadYield(e, d) {
|
|
2
|
+
this.v = e, this.k = d;
|
|
3
|
+
}
|
|
4
|
+
function _arrayLikeToArray(r, a) {
|
|
5
|
+
(null == a || a > r.length) && (a = r.length);
|
|
6
|
+
for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e];
|
|
7
|
+
return n;
|
|
8
|
+
}
|
|
9
|
+
function _arrayWithHoles(r) {
|
|
10
|
+
if (Array.isArray(r)) return r;
|
|
11
|
+
}
|
|
12
|
+
function _arrayWithoutHoles(r) {
|
|
13
|
+
if (Array.isArray(r)) return _arrayLikeToArray(r);
|
|
14
|
+
}
|
|
15
|
+
function _assertThisInitialized(e) {
|
|
16
|
+
if (void 0 === e) throw new ReferenceError("this hasn't been initialised - super() hasn't been called");
|
|
17
|
+
return e;
|
|
18
|
+
}
|
|
19
|
+
function asyncGeneratorStep(n, t, e, r, o, a, c) {
|
|
20
|
+
try {
|
|
21
|
+
var i = n[a](c),
|
|
22
|
+
u = i.value;
|
|
23
|
+
} catch (n) {
|
|
24
|
+
return void e(n);
|
|
25
|
+
}
|
|
26
|
+
i.done ? t(u) : Promise.resolve(u).then(r, o);
|
|
27
|
+
}
|
|
28
|
+
function _asyncToGenerator(n) {
|
|
29
|
+
return function () {
|
|
30
|
+
var t = this,
|
|
31
|
+
e = arguments;
|
|
32
|
+
return new Promise(function (r, o) {
|
|
33
|
+
var a = n.apply(t, e);
|
|
34
|
+
function _next(n) {
|
|
35
|
+
asyncGeneratorStep(a, r, o, _next, _throw, "next", n);
|
|
36
|
+
}
|
|
37
|
+
function _throw(n) {
|
|
38
|
+
asyncGeneratorStep(a, r, o, _next, _throw, "throw", n);
|
|
39
|
+
}
|
|
40
|
+
_next(void 0);
|
|
41
|
+
});
|
|
42
|
+
};
|
|
43
|
+
}
|
|
1
44
|
function _callSuper(t, o, e) {
|
|
2
45
|
return o = _getPrototypeOf(o), _possibleConstructorReturn(t, _isNativeReflectConstruct() ? Reflect.construct(o, e || [], _getPrototypeOf(t).constructor) : o.apply(t, e));
|
|
3
46
|
}
|
|
47
|
+
function _classCallCheck(a, n) {
|
|
48
|
+
if (!(a instanceof n)) throw new TypeError("Cannot call a class as a function");
|
|
49
|
+
}
|
|
50
|
+
function _defineProperties(e, r) {
|
|
51
|
+
for (var t = 0; t < r.length; t++) {
|
|
52
|
+
var o = r[t];
|
|
53
|
+
o.enumerable = o.enumerable || false, o.configurable = true, "value" in o && (o.writable = true), Object.defineProperty(e, _toPropertyKey(o.key), o);
|
|
54
|
+
}
|
|
55
|
+
}
|
|
56
|
+
function _createClass(e, r, t) {
|
|
57
|
+
return r && _defineProperties(e.prototype, r), Object.defineProperty(e, "prototype", {
|
|
58
|
+
writable: false
|
|
59
|
+
}), e;
|
|
60
|
+
}
|
|
61
|
+
function _defineProperty(e, r, t) {
|
|
62
|
+
return (r = _toPropertyKey(r)) in e ? Object.defineProperty(e, r, {
|
|
63
|
+
value: t,
|
|
64
|
+
enumerable: true,
|
|
65
|
+
configurable: true,
|
|
66
|
+
writable: true
|
|
67
|
+
}) : e[r] = t, e;
|
|
68
|
+
}
|
|
69
|
+
function _get() {
|
|
70
|
+
return _get = "undefined" != typeof Reflect && Reflect.get ? Reflect.get.bind() : function (e, t, r) {
|
|
71
|
+
var p = _superPropBase(e, t);
|
|
72
|
+
if (p) {
|
|
73
|
+
var n = Object.getOwnPropertyDescriptor(p, t);
|
|
74
|
+
return n.get ? n.get.call(arguments.length < 3 ? e : r) : n.value;
|
|
75
|
+
}
|
|
76
|
+
}, _get.apply(null, arguments);
|
|
77
|
+
}
|
|
78
|
+
function _getPrototypeOf(t) {
|
|
79
|
+
return _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function (t) {
|
|
80
|
+
return t.__proto__ || Object.getPrototypeOf(t);
|
|
81
|
+
}, _getPrototypeOf(t);
|
|
82
|
+
}
|
|
83
|
+
function _inherits(t, e) {
|
|
84
|
+
if ("function" != typeof e && null !== e) throw new TypeError("Super expression must either be null or a function");
|
|
85
|
+
t.prototype = Object.create(e && e.prototype, {
|
|
86
|
+
constructor: {
|
|
87
|
+
value: t,
|
|
88
|
+
writable: true,
|
|
89
|
+
configurable: true
|
|
90
|
+
}
|
|
91
|
+
}), Object.defineProperty(t, "prototype", {
|
|
92
|
+
writable: false
|
|
93
|
+
}), e && _setPrototypeOf(t, e);
|
|
94
|
+
}
|
|
4
95
|
function _isNativeReflectConstruct() {
|
|
5
96
|
try {
|
|
6
97
|
var t = !Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {}));
|
|
@@ -9,6 +100,9 @@ function _isNativeReflectConstruct() {
|
|
|
9
100
|
return !!t;
|
|
10
101
|
})();
|
|
11
102
|
}
|
|
103
|
+
function _iterableToArray(r) {
|
|
104
|
+
if ("undefined" != typeof Symbol && null != r[Symbol.iterator] || null != r["@@iterator"]) return Array.from(r);
|
|
105
|
+
}
|
|
12
106
|
function _iterableToArrayLimit(r, l) {
|
|
13
107
|
var t = null == r ? null : "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"];
|
|
14
108
|
if (null != t) {
|
|
@@ -17,15 +111,15 @@ function _iterableToArrayLimit(r, l) {
|
|
|
17
111
|
i,
|
|
18
112
|
u,
|
|
19
113
|
a = [],
|
|
20
|
-
f =
|
|
21
|
-
o =
|
|
114
|
+
f = true,
|
|
115
|
+
o = false;
|
|
22
116
|
try {
|
|
23
117
|
if (i = (t = t.call(r)).next, 0 === l) {
|
|
24
118
|
if (Object(t) !== t) return;
|
|
25
119
|
f = !1;
|
|
26
120
|
} else for (; !(f = (e = i.call(t)).done) && (a.push(e.value), a.length !== l); f = !0);
|
|
27
121
|
} catch (r) {
|
|
28
|
-
o =
|
|
122
|
+
o = true, n = r;
|
|
29
123
|
} finally {
|
|
30
124
|
try {
|
|
31
125
|
if (!f && null != t.return && (u = t.return(), Object(u) !== u)) return;
|
|
@@ -36,6 +130,12 @@ function _iterableToArrayLimit(r, l) {
|
|
|
36
130
|
return a;
|
|
37
131
|
}
|
|
38
132
|
}
|
|
133
|
+
function _nonIterableRest() {
|
|
134
|
+
throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
135
|
+
}
|
|
136
|
+
function _nonIterableSpread() {
|
|
137
|
+
throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
138
|
+
}
|
|
39
139
|
function ownKeys(e, r) {
|
|
40
140
|
var t = Object.keys(e);
|
|
41
141
|
if (Object.getOwnPropertySymbols) {
|
|
@@ -49,7 +149,7 @@ function ownKeys(e, r) {
|
|
|
49
149
|
function _objectSpread2(e) {
|
|
50
150
|
for (var r = 1; r < arguments.length; r++) {
|
|
51
151
|
var t = null != arguments[r] ? arguments[r] : {};
|
|
52
|
-
r % 2 ? ownKeys(Object(t),
|
|
152
|
+
r % 2 ? ownKeys(Object(t), true).forEach(function (r) {
|
|
53
153
|
_defineProperty(e, r, t[r]);
|
|
54
154
|
}) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) {
|
|
55
155
|
Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r));
|
|
@@ -57,312 +157,204 @@ function _objectSpread2(e) {
|
|
|
57
157
|
}
|
|
58
158
|
return e;
|
|
59
159
|
}
|
|
60
|
-
function
|
|
61
|
-
|
|
62
|
-
|
|
63
|
-
|
|
64
|
-
|
|
65
|
-
|
|
66
|
-
|
|
67
|
-
|
|
68
|
-
|
|
69
|
-
|
|
70
|
-
|
|
71
|
-
|
|
72
|
-
|
|
73
|
-
c =
|
|
74
|
-
|
|
75
|
-
|
|
76
|
-
|
|
77
|
-
|
|
78
|
-
|
|
79
|
-
|
|
80
|
-
|
|
81
|
-
|
|
82
|
-
|
|
83
|
-
|
|
84
|
-
|
|
85
|
-
|
|
86
|
-
|
|
87
|
-
|
|
88
|
-
|
|
89
|
-
|
|
90
|
-
|
|
91
|
-
|
|
92
|
-
|
|
93
|
-
|
|
94
|
-
|
|
95
|
-
|
|
96
|
-
|
|
97
|
-
|
|
98
|
-
|
|
99
|
-
|
|
100
|
-
|
|
101
|
-
|
|
102
|
-
|
|
103
|
-
|
|
104
|
-
|
|
105
|
-
|
|
106
|
-
|
|
107
|
-
|
|
160
|
+
function _possibleConstructorReturn(t, e) {
|
|
161
|
+
if (e && ("object" == typeof e || "function" == typeof e)) return e;
|
|
162
|
+
if (void 0 !== e) throw new TypeError("Derived constructors may only return object or undefined");
|
|
163
|
+
return _assertThisInitialized(t);
|
|
164
|
+
}
|
|
165
|
+
function _regenerator() {
|
|
166
|
+
/*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/babel/babel/blob/main/packages/babel-helpers/LICENSE */
|
|
167
|
+
var e,
|
|
168
|
+
t,
|
|
169
|
+
r = "function" == typeof Symbol ? Symbol : {},
|
|
170
|
+
n = r.iterator || "@@iterator",
|
|
171
|
+
o = r.toStringTag || "@@toStringTag";
|
|
172
|
+
function i(r, n, o, i) {
|
|
173
|
+
var c = n && n.prototype instanceof Generator ? n : Generator,
|
|
174
|
+
u = Object.create(c.prototype);
|
|
175
|
+
return _regeneratorDefine(u, "_invoke", function (r, n, o) {
|
|
176
|
+
var i,
|
|
177
|
+
c,
|
|
178
|
+
u,
|
|
179
|
+
f = 0,
|
|
180
|
+
p = o || [],
|
|
181
|
+
y = false,
|
|
182
|
+
G = {
|
|
183
|
+
p: 0,
|
|
184
|
+
n: 0,
|
|
185
|
+
v: e,
|
|
186
|
+
a: d,
|
|
187
|
+
f: d.bind(e, 4),
|
|
188
|
+
d: function (t, r) {
|
|
189
|
+
return i = t, c = 0, u = e, G.n = r, a;
|
|
190
|
+
}
|
|
191
|
+
};
|
|
192
|
+
function d(r, n) {
|
|
193
|
+
for (c = r, u = n, t = 0; !y && f && !o && t < p.length; t++) {
|
|
194
|
+
var o,
|
|
195
|
+
i = p[t],
|
|
196
|
+
d = G.p,
|
|
197
|
+
l = i[2];
|
|
198
|
+
r > 3 ? (o = l === n) && (u = i[(c = i[4]) ? 5 : (c = 3, 3)], i[4] = i[5] = e) : i[0] <= d && ((o = r < 2 && d < i[1]) ? (c = 0, G.v = n, G.n = i[1]) : d < l && (o = r < 3 || i[0] > n || n > l) && (i[4] = r, i[5] = n, G.n = l, c = 0));
|
|
199
|
+
}
|
|
200
|
+
if (o || r > 1) return a;
|
|
201
|
+
throw y = true, n;
|
|
202
|
+
}
|
|
203
|
+
return function (o, p, l) {
|
|
204
|
+
if (f > 1) throw TypeError("Generator is already running");
|
|
205
|
+
for (y && 1 === p && d(p, l), c = p, u = l; (t = c < 2 ? e : u) || !y;) {
|
|
206
|
+
i || (c ? c < 3 ? (c > 1 && (G.n = -1), d(c, u)) : G.n = u : G.v = u);
|
|
207
|
+
try {
|
|
208
|
+
if (f = 2, i) {
|
|
209
|
+
if (c || (o = "next"), t = i[o]) {
|
|
210
|
+
if (!(t = t.call(i, u))) throw TypeError("iterator result is not an object");
|
|
211
|
+
if (!t.done) return t;
|
|
212
|
+
u = t.value, c < 2 && (c = 0);
|
|
213
|
+
} else 1 === c && (t = i.return) && t.call(i), c < 2 && (u = TypeError("The iterator does not provide a '" + o + "' method"), c = 1);
|
|
214
|
+
i = e;
|
|
215
|
+
} else if ((t = (y = G.n < 0) ? u : r.call(n, G)) !== a) break;
|
|
216
|
+
} catch (t) {
|
|
217
|
+
i = e, c = 1, u = t;
|
|
218
|
+
} finally {
|
|
219
|
+
f = 1;
|
|
220
|
+
}
|
|
221
|
+
}
|
|
222
|
+
return {
|
|
223
|
+
value: t,
|
|
224
|
+
done: y
|
|
225
|
+
};
|
|
108
226
|
};
|
|
109
|
-
}
|
|
227
|
+
}(r, o, i), true), u;
|
|
110
228
|
}
|
|
111
|
-
|
|
112
|
-
var h = "suspendedStart",
|
|
113
|
-
l = "suspendedYield",
|
|
114
|
-
f = "executing",
|
|
115
|
-
s = "completed",
|
|
116
|
-
y = {};
|
|
229
|
+
var a = {};
|
|
117
230
|
function Generator() {}
|
|
118
231
|
function GeneratorFunction() {}
|
|
119
232
|
function GeneratorFunctionPrototype() {}
|
|
120
|
-
|
|
121
|
-
|
|
233
|
+
t = Object.getPrototypeOf;
|
|
234
|
+
var c = [][n] ? t(t([][n]())) : (_regeneratorDefine(t = {}, n, function () {
|
|
235
|
+
return this;
|
|
236
|
+
}), t),
|
|
237
|
+
u = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(c);
|
|
238
|
+
function f(e) {
|
|
239
|
+
return Object.setPrototypeOf ? Object.setPrototypeOf(e, GeneratorFunctionPrototype) : (e.__proto__ = GeneratorFunctionPrototype, _regeneratorDefine(e, o, "GeneratorFunction")), e.prototype = Object.create(u), e;
|
|
240
|
+
}
|
|
241
|
+
return GeneratorFunction.prototype = GeneratorFunctionPrototype, _regeneratorDefine(u, "constructor", GeneratorFunctionPrototype), _regeneratorDefine(GeneratorFunctionPrototype, "constructor", GeneratorFunction), GeneratorFunction.displayName = "GeneratorFunction", _regeneratorDefine(GeneratorFunctionPrototype, o, "GeneratorFunction"), _regeneratorDefine(u), _regeneratorDefine(u, o, "Generator"), _regeneratorDefine(u, n, function () {
|
|
122
242
|
return this;
|
|
243
|
+
}), _regeneratorDefine(u, "toString", function () {
|
|
244
|
+
return "[object Generator]";
|
|
245
|
+
}), (_regenerator = function () {
|
|
246
|
+
return {
|
|
247
|
+
w: i,
|
|
248
|
+
m: f
|
|
249
|
+
};
|
|
250
|
+
})();
|
|
251
|
+
}
|
|
252
|
+
function _regeneratorAsync(n, e, r, t, o) {
|
|
253
|
+
var a = _regeneratorAsyncGen(n, e, r, t, o);
|
|
254
|
+
return a.next().then(function (n) {
|
|
255
|
+
return n.done ? n.value : a.next();
|
|
123
256
|
});
|
|
124
|
-
|
|
125
|
-
|
|
126
|
-
|
|
127
|
-
|
|
128
|
-
|
|
129
|
-
|
|
130
|
-
|
|
131
|
-
|
|
257
|
+
}
|
|
258
|
+
function _regeneratorAsyncGen(r, e, t, o, n) {
|
|
259
|
+
return new _regeneratorAsyncIterator(_regenerator().w(r, e, t, o), n || Promise);
|
|
260
|
+
}
|
|
261
|
+
function _regeneratorAsyncIterator(t, e) {
|
|
262
|
+
function n(r, o, i, f) {
|
|
263
|
+
try {
|
|
264
|
+
var c = t[r](o),
|
|
265
|
+
u = c.value;
|
|
266
|
+
return u instanceof _OverloadYield ? e.resolve(u.v).then(function (t) {
|
|
267
|
+
n("next", t, i, f);
|
|
268
|
+
}, function (t) {
|
|
269
|
+
n("throw", t, i, f);
|
|
270
|
+
}) : e.resolve(u).then(function (t) {
|
|
271
|
+
c.value = t, i(c);
|
|
272
|
+
}, function (t) {
|
|
273
|
+
return n("throw", t, i, f);
|
|
132
274
|
});
|
|
133
|
-
})
|
|
275
|
+
} catch (t) {
|
|
276
|
+
f(t);
|
|
277
|
+
}
|
|
134
278
|
}
|
|
135
|
-
|
|
136
|
-
|
|
137
|
-
|
|
138
|
-
|
|
139
|
-
|
|
140
|
-
|
|
141
|
-
|
|
142
|
-
|
|
143
|
-
}, function (t) {
|
|
144
|
-
invoke("throw", t, i, a);
|
|
145
|
-
}) : e.resolve(h).then(function (t) {
|
|
146
|
-
u.value = t, i(u);
|
|
147
|
-
}, function (t) {
|
|
148
|
-
return invoke("throw", t, i, a);
|
|
149
|
-
});
|
|
150
|
-
}
|
|
151
|
-
a(c.arg);
|
|
279
|
+
var r;
|
|
280
|
+
this.next || (_regeneratorDefine(_regeneratorAsyncIterator.prototype), _regeneratorDefine(_regeneratorAsyncIterator.prototype, "function" == typeof Symbol && Symbol.asyncIterator || "@asyncIterator", function () {
|
|
281
|
+
return this;
|
|
282
|
+
})), _regeneratorDefine(this, "_invoke", function (t, o, i) {
|
|
283
|
+
function f() {
|
|
284
|
+
return new e(function (e, r) {
|
|
285
|
+
n(t, i, e, r);
|
|
286
|
+
});
|
|
152
287
|
}
|
|
153
|
-
|
|
154
|
-
|
|
155
|
-
|
|
156
|
-
|
|
157
|
-
|
|
158
|
-
|
|
159
|
-
|
|
160
|
-
|
|
161
|
-
|
|
162
|
-
}
|
|
163
|
-
});
|
|
288
|
+
return r = r ? r.then(f, f) : f();
|
|
289
|
+
}, true);
|
|
290
|
+
}
|
|
291
|
+
function _regeneratorDefine(e, r, n, t) {
|
|
292
|
+
var i = Object.defineProperty;
|
|
293
|
+
try {
|
|
294
|
+
i({}, "", {});
|
|
295
|
+
} catch (e) {
|
|
296
|
+
i = 0;
|
|
164
297
|
}
|
|
165
|
-
function
|
|
166
|
-
|
|
167
|
-
|
|
168
|
-
|
|
169
|
-
|
|
170
|
-
|
|
171
|
-
|
|
172
|
-
|
|
173
|
-
|
|
298
|
+
_regeneratorDefine = function (e, r, n, t) {
|
|
299
|
+
function o(r, n) {
|
|
300
|
+
_regeneratorDefine(e, r, function (e) {
|
|
301
|
+
return this._invoke(r, n, e);
|
|
302
|
+
});
|
|
303
|
+
}
|
|
304
|
+
r ? i ? i(e, r, {
|
|
305
|
+
value: n,
|
|
306
|
+
enumerable: !t,
|
|
307
|
+
configurable: !t,
|
|
308
|
+
writable: !t
|
|
309
|
+
}) : e[r] = n : (o("next", 0), o("throw", 1), o("return", 2));
|
|
310
|
+
}, _regeneratorDefine(e, r, n, t);
|
|
311
|
+
}
|
|
312
|
+
function _regeneratorKeys(e) {
|
|
313
|
+
var n = Object(e),
|
|
314
|
+
r = [];
|
|
315
|
+
for (var t in n) r.unshift(t);
|
|
316
|
+
return function e() {
|
|
317
|
+
for (; r.length;) if ((t = r.pop()) in n) return e.value = t, e.done = false, e;
|
|
318
|
+
return e.done = true, e;
|
|
319
|
+
};
|
|
320
|
+
}
|
|
321
|
+
function _regeneratorValues(e) {
|
|
322
|
+
if (null != e) {
|
|
323
|
+
var t = e["function" == typeof Symbol && Symbol.iterator || "@@iterator"],
|
|
324
|
+
r = 0;
|
|
325
|
+
if (t) return t.call(e);
|
|
326
|
+
if ("function" == typeof e.next) return e;
|
|
327
|
+
if (!isNaN(e.length)) return {
|
|
328
|
+
next: function () {
|
|
329
|
+
return e && r >= e.length && (e = void 0), {
|
|
330
|
+
value: e && e[r++],
|
|
331
|
+
done: !e
|
|
174
332
|
};
|
|
175
333
|
}
|
|
176
|
-
for (n.method = i, n.arg = a;;) {
|
|
177
|
-
var c = n.delegate;
|
|
178
|
-
if (c) {
|
|
179
|
-
var u = maybeInvokeDelegate(c, n);
|
|
180
|
-
if (u) {
|
|
181
|
-
if (u === y) continue;
|
|
182
|
-
return u;
|
|
183
|
-
}
|
|
184
|
-
}
|
|
185
|
-
if ("next" === n.method) n.sent = n._sent = n.arg;else if ("throw" === n.method) {
|
|
186
|
-
if (o === h) throw o = s, n.arg;
|
|
187
|
-
n.dispatchException(n.arg);
|
|
188
|
-
} else "return" === n.method && n.abrupt("return", n.arg);
|
|
189
|
-
o = f;
|
|
190
|
-
var p = tryCatch(e, r, n);
|
|
191
|
-
if ("normal" === p.type) {
|
|
192
|
-
if (o = n.done ? s : l, p.arg === y) continue;
|
|
193
|
-
return {
|
|
194
|
-
value: p.arg,
|
|
195
|
-
done: n.done
|
|
196
|
-
};
|
|
197
|
-
}
|
|
198
|
-
"throw" === p.type && (o = s, n.method = "throw", n.arg = p.arg);
|
|
199
|
-
}
|
|
200
334
|
};
|
|
201
335
|
}
|
|
202
|
-
|
|
203
|
-
|
|
204
|
-
|
|
205
|
-
|
|
206
|
-
|
|
207
|
-
|
|
208
|
-
|
|
209
|
-
|
|
210
|
-
|
|
211
|
-
|
|
212
|
-
|
|
213
|
-
|
|
214
|
-
|
|
215
|
-
|
|
216
|
-
|
|
217
|
-
|
|
218
|
-
var e = t.completion || {};
|
|
219
|
-
e.type = "normal", delete e.arg, t.completion = e;
|
|
220
|
-
}
|
|
221
|
-
function Context(t) {
|
|
222
|
-
this.tryEntries = [{
|
|
223
|
-
tryLoc: "root"
|
|
224
|
-
}], t.forEach(pushTryEntry, this), this.reset(!0);
|
|
225
|
-
}
|
|
226
|
-
function values(e) {
|
|
227
|
-
if (e || "" === e) {
|
|
228
|
-
var r = e[a];
|
|
229
|
-
if (r) return r.call(e);
|
|
230
|
-
if ("function" == typeof e.next) return e;
|
|
231
|
-
if (!isNaN(e.length)) {
|
|
232
|
-
var o = -1,
|
|
233
|
-
i = function next() {
|
|
234
|
-
for (; ++o < e.length;) if (n.call(e, o)) return next.value = e[o], next.done = !1, next;
|
|
235
|
-
return next.value = t, next.done = !0, next;
|
|
236
|
-
};
|
|
237
|
-
return i.next = i;
|
|
238
|
-
}
|
|
239
|
-
}
|
|
240
|
-
throw new TypeError(typeof e + " is not iterable");
|
|
241
|
-
}
|
|
242
|
-
return GeneratorFunction.prototype = GeneratorFunctionPrototype, o(g, "constructor", {
|
|
243
|
-
value: GeneratorFunctionPrototype,
|
|
244
|
-
configurable: !0
|
|
245
|
-
}), o(GeneratorFunctionPrototype, "constructor", {
|
|
246
|
-
value: GeneratorFunction,
|
|
247
|
-
configurable: !0
|
|
248
|
-
}), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, "GeneratorFunction"), e.isGeneratorFunction = function (t) {
|
|
249
|
-
var e = "function" == typeof t && t.constructor;
|
|
250
|
-
return !!e && (e === GeneratorFunction || "GeneratorFunction" === (e.displayName || e.name));
|
|
251
|
-
}, e.mark = function (t) {
|
|
252
|
-
return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, "GeneratorFunction")), t.prototype = Object.create(g), t;
|
|
253
|
-
}, e.awrap = function (t) {
|
|
254
|
-
return {
|
|
255
|
-
__await: t
|
|
256
|
-
};
|
|
257
|
-
}, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, c, function () {
|
|
258
|
-
return this;
|
|
259
|
-
}), e.AsyncIterator = AsyncIterator, e.async = function (t, r, n, o, i) {
|
|
260
|
-
void 0 === i && (i = Promise);
|
|
261
|
-
var a = new AsyncIterator(wrap(t, r, n, o), i);
|
|
262
|
-
return e.isGeneratorFunction(r) ? a : a.next().then(function (t) {
|
|
263
|
-
return t.done ? t.value : a.next();
|
|
264
|
-
});
|
|
265
|
-
}, defineIteratorMethods(g), define(g, u, "Generator"), define(g, a, function () {
|
|
266
|
-
return this;
|
|
267
|
-
}), define(g, "toString", function () {
|
|
268
|
-
return "[object Generator]";
|
|
269
|
-
}), e.keys = function (t) {
|
|
270
|
-
var e = Object(t),
|
|
271
|
-
r = [];
|
|
272
|
-
for (var n in e) r.push(n);
|
|
273
|
-
return r.reverse(), function next() {
|
|
274
|
-
for (; r.length;) {
|
|
275
|
-
var t = r.pop();
|
|
276
|
-
if (t in e) return next.value = t, next.done = !1, next;
|
|
277
|
-
}
|
|
278
|
-
return next.done = !0, next;
|
|
279
|
-
};
|
|
280
|
-
}, e.values = values, Context.prototype = {
|
|
281
|
-
constructor: Context,
|
|
282
|
-
reset: function (e) {
|
|
283
|
-
if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = "next", this.arg = t, this.tryEntries.forEach(resetTryEntry), !e) for (var r in this) "t" === r.charAt(0) && n.call(this, r) && !isNaN(+r.slice(1)) && (this[r] = t);
|
|
284
|
-
},
|
|
285
|
-
stop: function () {
|
|
286
|
-
this.done = !0;
|
|
287
|
-
var t = this.tryEntries[0].completion;
|
|
288
|
-
if ("throw" === t.type) throw t.arg;
|
|
289
|
-
return this.rval;
|
|
290
|
-
},
|
|
291
|
-
dispatchException: function (e) {
|
|
292
|
-
if (this.done) throw e;
|
|
293
|
-
var r = this;
|
|
294
|
-
function handle(n, o) {
|
|
295
|
-
return a.type = "throw", a.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o;
|
|
296
|
-
}
|
|
297
|
-
for (var o = this.tryEntries.length - 1; o >= 0; --o) {
|
|
298
|
-
var i = this.tryEntries[o],
|
|
299
|
-
a = i.completion;
|
|
300
|
-
if ("root" === i.tryLoc) return handle("end");
|
|
301
|
-
if (i.tryLoc <= this.prev) {
|
|
302
|
-
var c = n.call(i, "catchLoc"),
|
|
303
|
-
u = n.call(i, "finallyLoc");
|
|
304
|
-
if (c && u) {
|
|
305
|
-
if (this.prev < i.catchLoc) return handle(i.catchLoc, !0);
|
|
306
|
-
if (this.prev < i.finallyLoc) return handle(i.finallyLoc);
|
|
307
|
-
} else if (c) {
|
|
308
|
-
if (this.prev < i.catchLoc) return handle(i.catchLoc, !0);
|
|
309
|
-
} else {
|
|
310
|
-
if (!u) throw new Error("try statement without catch or finally");
|
|
311
|
-
if (this.prev < i.finallyLoc) return handle(i.finallyLoc);
|
|
312
|
-
}
|
|
313
|
-
}
|
|
314
|
-
}
|
|
315
|
-
},
|
|
316
|
-
abrupt: function (t, e) {
|
|
317
|
-
for (var r = this.tryEntries.length - 1; r >= 0; --r) {
|
|
318
|
-
var o = this.tryEntries[r];
|
|
319
|
-
if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) {
|
|
320
|
-
var i = o;
|
|
321
|
-
break;
|
|
322
|
-
}
|
|
323
|
-
}
|
|
324
|
-
i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null);
|
|
325
|
-
var a = i ? i.completion : {};
|
|
326
|
-
return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, y) : this.complete(a);
|
|
327
|
-
},
|
|
328
|
-
complete: function (t, e) {
|
|
329
|
-
if ("throw" === t.type) throw t.arg;
|
|
330
|
-
return "break" === t.type || "continue" === t.type ? this.next = t.arg : "return" === t.type ? (this.rval = this.arg = t.arg, this.method = "return", this.next = "end") : "normal" === t.type && e && (this.next = e), y;
|
|
331
|
-
},
|
|
332
|
-
finish: function (t) {
|
|
333
|
-
for (var e = this.tryEntries.length - 1; e >= 0; --e) {
|
|
334
|
-
var r = this.tryEntries[e];
|
|
335
|
-
if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y;
|
|
336
|
-
}
|
|
337
|
-
},
|
|
338
|
-
catch: function (t) {
|
|
339
|
-
for (var e = this.tryEntries.length - 1; e >= 0; --e) {
|
|
340
|
-
var r = this.tryEntries[e];
|
|
341
|
-
if (r.tryLoc === t) {
|
|
342
|
-
var n = r.completion;
|
|
343
|
-
if ("throw" === n.type) {
|
|
344
|
-
var o = n.arg;
|
|
345
|
-
resetTryEntry(r);
|
|
346
|
-
}
|
|
347
|
-
return o;
|
|
348
|
-
}
|
|
349
|
-
}
|
|
350
|
-
throw new Error("illegal catch attempt");
|
|
351
|
-
},
|
|
352
|
-
delegateYield: function (e, r, n) {
|
|
353
|
-
return this.delegate = {
|
|
354
|
-
iterator: values(e),
|
|
355
|
-
resultName: r,
|
|
356
|
-
nextLoc: n
|
|
357
|
-
}, "next" === this.method && (this.arg = t), y;
|
|
358
|
-
}
|
|
359
|
-
}, e;
|
|
336
|
+
throw new TypeError(typeof e + " is not iterable");
|
|
337
|
+
}
|
|
338
|
+
function _setPrototypeOf(t, e) {
|
|
339
|
+
return _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function (t, e) {
|
|
340
|
+
return t.__proto__ = e, t;
|
|
341
|
+
}, _setPrototypeOf(t, e);
|
|
342
|
+
}
|
|
343
|
+
function _slicedToArray(r, e) {
|
|
344
|
+
return _arrayWithHoles(r) || _iterableToArrayLimit(r, e) || _unsupportedIterableToArray(r, e) || _nonIterableRest();
|
|
345
|
+
}
|
|
346
|
+
function _superPropBase(t, o) {
|
|
347
|
+
for (; !{}.hasOwnProperty.call(t, o) && null !== (t = _getPrototypeOf(t)););
|
|
348
|
+
return t;
|
|
349
|
+
}
|
|
350
|
+
function _toConsumableArray(r) {
|
|
351
|
+
return _arrayWithoutHoles(r) || _iterableToArray(r) || _unsupportedIterableToArray(r) || _nonIterableSpread();
|
|
360
352
|
}
|
|
361
353
|
function _toPrimitive(t, r) {
|
|
362
354
|
if ("object" != typeof t || !t) return t;
|
|
363
355
|
var e = t[Symbol.toPrimitive];
|
|
364
356
|
if (void 0 !== e) {
|
|
365
|
-
var i = e.call(t, r
|
|
357
|
+
var i = e.call(t, r);
|
|
366
358
|
if ("object" != typeof i) return i;
|
|
367
359
|
throw new TypeError("@@toPrimitive must return a primitive value.");
|
|
368
360
|
}
|
|
@@ -370,174 +362,83 @@ function _toPrimitive(t, r) {
|
|
|
370
362
|
}
|
|
371
363
|
function _toPropertyKey(t) {
|
|
372
364
|
var i = _toPrimitive(t, "string");
|
|
373
|
-
return "symbol" == typeof i ? i :
|
|
374
|
-
}
|
|
375
|
-
function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) {
|
|
376
|
-
try {
|
|
377
|
-
var info = gen[key](arg);
|
|
378
|
-
var value = info.value;
|
|
379
|
-
} catch (error) {
|
|
380
|
-
reject(error);
|
|
381
|
-
return;
|
|
382
|
-
}
|
|
383
|
-
if (info.done) {
|
|
384
|
-
resolve(value);
|
|
385
|
-
} else {
|
|
386
|
-
Promise.resolve(value).then(_next, _throw);
|
|
387
|
-
}
|
|
365
|
+
return "symbol" == typeof i ? i : i + "";
|
|
388
366
|
}
|
|
389
|
-
function
|
|
390
|
-
|
|
391
|
-
|
|
392
|
-
|
|
393
|
-
return
|
|
394
|
-
var gen = fn.apply(self, args);
|
|
395
|
-
function _next(value) {
|
|
396
|
-
asyncGeneratorStep(gen, resolve, reject, _next, _throw, "next", value);
|
|
397
|
-
}
|
|
398
|
-
function _throw(err) {
|
|
399
|
-
asyncGeneratorStep(gen, resolve, reject, _next, _throw, "throw", err);
|
|
400
|
-
}
|
|
401
|
-
_next(undefined);
|
|
402
|
-
});
|
|
403
|
-
};
|
|
404
|
-
}
|
|
405
|
-
function _classCallCheck(instance, Constructor) {
|
|
406
|
-
if (!(instance instanceof Constructor)) {
|
|
407
|
-
throw new TypeError("Cannot call a class as a function");
|
|
367
|
+
function _unsupportedIterableToArray(r, a) {
|
|
368
|
+
if (r) {
|
|
369
|
+
if ("string" == typeof r) return _arrayLikeToArray(r, a);
|
|
370
|
+
var t = {}.toString.call(r).slice(8, -1);
|
|
371
|
+
return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0;
|
|
408
372
|
}
|
|
409
373
|
}
|
|
410
|
-
function
|
|
411
|
-
|
|
412
|
-
|
|
413
|
-
|
|
414
|
-
|
|
415
|
-
|
|
416
|
-
|
|
417
|
-
|
|
418
|
-
}
|
|
419
|
-
function _createClass(Constructor, protoProps, staticProps) {
|
|
420
|
-
if (protoProps) _defineProperties(Constructor.prototype, protoProps);
|
|
421
|
-
if (staticProps) _defineProperties(Constructor, staticProps);
|
|
422
|
-
Object.defineProperty(Constructor, "prototype", {
|
|
423
|
-
writable: false
|
|
424
|
-
});
|
|
425
|
-
return Constructor;
|
|
426
|
-
}
|
|
427
|
-
function _defineProperty(obj, key, value) {
|
|
428
|
-
key = _toPropertyKey(key);
|
|
429
|
-
if (key in obj) {
|
|
430
|
-
Object.defineProperty(obj, key, {
|
|
431
|
-
value: value,
|
|
432
|
-
enumerable: true,
|
|
433
|
-
configurable: true,
|
|
434
|
-
writable: true
|
|
435
|
-
});
|
|
436
|
-
} else {
|
|
437
|
-
obj[key] = value;
|
|
438
|
-
}
|
|
439
|
-
return obj;
|
|
440
|
-
}
|
|
441
|
-
function _inherits(subClass, superClass) {
|
|
442
|
-
if (typeof superClass !== "function" && superClass !== null) {
|
|
443
|
-
throw new TypeError("Super expression must either be null or a function");
|
|
374
|
+
function _regeneratorRuntime() {
|
|
375
|
+
|
|
376
|
+
var r = _regenerator(),
|
|
377
|
+
e = r.m(_regeneratorRuntime),
|
|
378
|
+
t = (Object.getPrototypeOf ? Object.getPrototypeOf(e) : e.__proto__).constructor;
|
|
379
|
+
function n(r) {
|
|
380
|
+
var e = "function" == typeof r && r.constructor;
|
|
381
|
+
return !!e && (e === t || "GeneratorFunction" === (e.displayName || e.name));
|
|
444
382
|
}
|
|
445
|
-
|
|
446
|
-
|
|
447
|
-
|
|
448
|
-
|
|
449
|
-
|
|
450
|
-
}
|
|
451
|
-
});
|
|
452
|
-
Object.defineProperty(subClass, "prototype", {
|
|
453
|
-
writable: false
|
|
454
|
-
});
|
|
455
|
-
if (superClass) _setPrototypeOf(subClass, superClass);
|
|
456
|
-
}
|
|
457
|
-
function _getPrototypeOf(o) {
|
|
458
|
-
_getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function _getPrototypeOf(o) {
|
|
459
|
-
return o.__proto__ || Object.getPrototypeOf(o);
|
|
383
|
+
var o = {
|
|
384
|
+
throw: 1,
|
|
385
|
+
return: 2,
|
|
386
|
+
break: 3,
|
|
387
|
+
continue: 3
|
|
460
388
|
};
|
|
461
|
-
|
|
462
|
-
|
|
463
|
-
function
|
|
464
|
-
|
|
465
|
-
|
|
466
|
-
|
|
467
|
-
|
|
468
|
-
|
|
469
|
-
|
|
470
|
-
|
|
471
|
-
|
|
472
|
-
|
|
473
|
-
|
|
474
|
-
|
|
475
|
-
|
|
476
|
-
|
|
477
|
-
|
|
478
|
-
|
|
479
|
-
|
|
480
|
-
|
|
481
|
-
|
|
482
|
-
|
|
483
|
-
|
|
484
|
-
|
|
485
|
-
|
|
486
|
-
|
|
487
|
-
|
|
488
|
-
|
|
489
|
-
|
|
490
|
-
}
|
|
491
|
-
|
|
492
|
-
if (typeof Reflect !== "undefined" && Reflect.get) {
|
|
493
|
-
_get = Reflect.get.bind();
|
|
494
|
-
} else {
|
|
495
|
-
_get = function _get(target, property, receiver) {
|
|
496
|
-
var base = _superPropBase(target, property);
|
|
497
|
-
if (!base) return;
|
|
498
|
-
var desc = Object.getOwnPropertyDescriptor(base, property);
|
|
499
|
-
if (desc.get) {
|
|
500
|
-
return desc.get.call(arguments.length < 3 ? target : receiver);
|
|
389
|
+
function a(r) {
|
|
390
|
+
var e, t;
|
|
391
|
+
return function (n) {
|
|
392
|
+
e || (e = {
|
|
393
|
+
stop: function () {
|
|
394
|
+
return t(n.a, 2);
|
|
395
|
+
},
|
|
396
|
+
catch: function () {
|
|
397
|
+
return n.v;
|
|
398
|
+
},
|
|
399
|
+
abrupt: function (r, e) {
|
|
400
|
+
return t(n.a, o[r], e);
|
|
401
|
+
},
|
|
402
|
+
delegateYield: function (r, o, a) {
|
|
403
|
+
return e.resultName = o, t(n.d, _regeneratorValues(r), a);
|
|
404
|
+
},
|
|
405
|
+
finish: function (r) {
|
|
406
|
+
return t(n.f, r);
|
|
407
|
+
}
|
|
408
|
+
}, t = function (r, t, o) {
|
|
409
|
+
n.p = e.prev, n.n = e.next;
|
|
410
|
+
try {
|
|
411
|
+
return r(t, o);
|
|
412
|
+
} finally {
|
|
413
|
+
e.next = n.n;
|
|
414
|
+
}
|
|
415
|
+
}), e.resultName && (e[e.resultName] = n.v, e.resultName = void 0), e.sent = n.v, e.next = n.n;
|
|
416
|
+
try {
|
|
417
|
+
return r.call(this, e);
|
|
418
|
+
} finally {
|
|
419
|
+
n.p = e.prev, n.n = e.next;
|
|
501
420
|
}
|
|
502
|
-
return desc.value;
|
|
503
421
|
};
|
|
504
422
|
}
|
|
505
|
-
return
|
|
506
|
-
|
|
507
|
-
function
|
|
508
|
-
|
|
509
|
-
}
|
|
510
|
-
|
|
511
|
-
|
|
512
|
-
|
|
513
|
-
|
|
514
|
-
|
|
515
|
-
|
|
516
|
-
function
|
|
517
|
-
|
|
518
|
-
}
|
|
519
|
-
|
|
520
|
-
|
|
521
|
-
}
|
|
522
|
-
|
|
523
|
-
if (!o) return;
|
|
524
|
-
if (typeof o === "string") return _arrayLikeToArray(o, minLen);
|
|
525
|
-
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
526
|
-
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
527
|
-
if (n === "Map" || n === "Set") return Array.from(o);
|
|
528
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen);
|
|
529
|
-
}
|
|
530
|
-
function _arrayLikeToArray(arr, len) {
|
|
531
|
-
if (len == null || len > arr.length) len = arr.length;
|
|
532
|
-
for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i];
|
|
533
|
-
return arr2;
|
|
534
|
-
}
|
|
535
|
-
function _nonIterableSpread() {
|
|
536
|
-
throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
537
|
-
}
|
|
538
|
-
function _nonIterableRest() {
|
|
539
|
-
throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
423
|
+
return (_regeneratorRuntime = function () {
|
|
424
|
+
return {
|
|
425
|
+
wrap: function (e, t, n, o) {
|
|
426
|
+
return r.w(a(e), t, n, o && o.reverse());
|
|
427
|
+
},
|
|
428
|
+
isGeneratorFunction: n,
|
|
429
|
+
mark: r.m,
|
|
430
|
+
awrap: function (r, e) {
|
|
431
|
+
return new _OverloadYield(r, e);
|
|
432
|
+
},
|
|
433
|
+
AsyncIterator: _regeneratorAsyncIterator,
|
|
434
|
+
async: function (r, e, t, o, u) {
|
|
435
|
+
return (n(e) ? _regeneratorAsyncGen : _regeneratorAsync)(a(r), e, t, o, u);
|
|
436
|
+
},
|
|
437
|
+
keys: _regeneratorKeys,
|
|
438
|
+
values: _regeneratorValues
|
|
439
|
+
};
|
|
440
|
+
})();
|
|
540
441
|
}
|
|
541
442
|
|
|
542
|
-
export { _arrayLikeToArray as arrayLikeToArray, _arrayWithHoles as arrayWithHoles, _arrayWithoutHoles as arrayWithoutHoles, _assertThisInitialized as assertThisInitialized, _asyncToGenerator as asyncToGenerator, _callSuper as callSuper, _classCallCheck as classCallCheck, _createClass as createClass, _defineProperty as defineProperty, _get as get, _getPrototypeOf as getPrototypeOf, _inherits as inherits, _isNativeReflectConstruct as isNativeReflectConstruct, _iterableToArray as iterableToArray, _iterableToArrayLimit as iterableToArrayLimit, _nonIterableRest as nonIterableRest, _nonIterableSpread as nonIterableSpread, _objectSpread2 as objectSpread2, _possibleConstructorReturn as possibleConstructorReturn, _regeneratorRuntime as regeneratorRuntime, _setPrototypeOf as setPrototypeOf, _slicedToArray as slicedToArray, _superPropBase as superPropBase, _toConsumableArray as toConsumableArray, _toPrimitive as toPrimitive, _toPropertyKey as toPropertyKey, _unsupportedIterableToArray as unsupportedIterableToArray };
|
|
443
|
+
export { _OverloadYield as OverloadYield, _arrayLikeToArray as arrayLikeToArray, _arrayWithHoles as arrayWithHoles, _arrayWithoutHoles as arrayWithoutHoles, _assertThisInitialized as assertThisInitialized, _asyncToGenerator as asyncToGenerator, _callSuper as callSuper, _classCallCheck as classCallCheck, _createClass as createClass, _defineProperty as defineProperty, _get as get, _getPrototypeOf as getPrototypeOf, _inherits as inherits, _isNativeReflectConstruct as isNativeReflectConstruct, _iterableToArray as iterableToArray, _iterableToArrayLimit as iterableToArrayLimit, _nonIterableRest as nonIterableRest, _nonIterableSpread as nonIterableSpread, _objectSpread2 as objectSpread2, _possibleConstructorReturn as possibleConstructorReturn, _regenerator as regenerator, _regeneratorAsync as regeneratorAsync, _regeneratorAsyncGen as regeneratorAsyncGen, _regeneratorAsyncIterator as regeneratorAsyncIterator, _regeneratorDefine as regeneratorDefine, _regeneratorKeys as regeneratorKeys, _regeneratorRuntime as regeneratorRuntime, _regeneratorValues as regeneratorValues, _setPrototypeOf as setPrototypeOf, _slicedToArray as slicedToArray, _superPropBase as superPropBase, _toConsumableArray as toConsumableArray, _toPrimitive as toPrimitive, _toPropertyKey as toPropertyKey, _unsupportedIterableToArray as unsupportedIterableToArray };
|
|
543
444
|
//# sourceMappingURL=_rollupPluginBabelHelpers.js.map
|