@hero-design/rn 8.141.3 → 8.141.4
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 +6 -0
- package/assets/fonts/hero-icons-mobile.ttf +0 -0
- package/lib/assets/fonts/hero-icons-mobile.ttf +0 -0
- package/lib/index.js +883 -1072
- package/package.json +1 -1
package/lib/index.js
CHANGED
|
@@ -271,306 +271,130 @@ function _possibleConstructorReturn(t, e) {
|
|
|
271
271
|
if (void 0 !== e) throw new TypeError("Derived constructors may only return object or undefined");
|
|
272
272
|
return _assertThisInitialized(t);
|
|
273
273
|
}
|
|
274
|
-
function
|
|
275
|
-
|
|
276
|
-
|
|
277
|
-
|
|
278
|
-
|
|
279
|
-
|
|
280
|
-
|
|
281
|
-
|
|
282
|
-
|
|
283
|
-
|
|
284
|
-
|
|
285
|
-
|
|
286
|
-
|
|
287
|
-
|
|
288
|
-
|
|
289
|
-
|
|
290
|
-
|
|
291
|
-
|
|
292
|
-
|
|
293
|
-
|
|
294
|
-
|
|
295
|
-
|
|
296
|
-
|
|
297
|
-
|
|
298
|
-
|
|
299
|
-
|
|
300
|
-
|
|
301
|
-
|
|
302
|
-
|
|
303
|
-
|
|
304
|
-
|
|
305
|
-
|
|
306
|
-
|
|
307
|
-
|
|
308
|
-
|
|
309
|
-
|
|
310
|
-
|
|
311
|
-
|
|
312
|
-
|
|
313
|
-
|
|
314
|
-
|
|
315
|
-
|
|
316
|
-
|
|
317
|
-
|
|
318
|
-
|
|
319
|
-
|
|
320
|
-
|
|
321
|
-
|
|
274
|
+
function _regenerator() {
|
|
275
|
+
/*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/babel/babel/blob/main/packages/babel-helpers/LICENSE */
|
|
276
|
+
var e,
|
|
277
|
+
t,
|
|
278
|
+
r = "function" == typeof Symbol ? Symbol : {},
|
|
279
|
+
n = r.iterator || "@@iterator",
|
|
280
|
+
o = r.toStringTag || "@@toStringTag";
|
|
281
|
+
function i(r, n, o, i) {
|
|
282
|
+
var c = n && n.prototype instanceof Generator ? n : Generator,
|
|
283
|
+
u = Object.create(c.prototype);
|
|
284
|
+
return _regeneratorDefine(u, "_invoke", function (r, n, o) {
|
|
285
|
+
var i,
|
|
286
|
+
c,
|
|
287
|
+
u,
|
|
288
|
+
f = 0,
|
|
289
|
+
p = o || [],
|
|
290
|
+
y = false,
|
|
291
|
+
G = {
|
|
292
|
+
p: 0,
|
|
293
|
+
n: 0,
|
|
294
|
+
v: e,
|
|
295
|
+
a: d,
|
|
296
|
+
f: d.bind(e, 4),
|
|
297
|
+
d: function (t, r) {
|
|
298
|
+
return i = t, c = 0, u = e, G.n = r, a;
|
|
299
|
+
}
|
|
300
|
+
};
|
|
301
|
+
function d(r, n) {
|
|
302
|
+
for (c = r, u = n, t = 0; !y && f && !o && t < p.length; t++) {
|
|
303
|
+
var o,
|
|
304
|
+
i = p[t],
|
|
305
|
+
d = G.p,
|
|
306
|
+
l = i[2];
|
|
307
|
+
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));
|
|
308
|
+
}
|
|
309
|
+
if (o || r > 1) return a;
|
|
310
|
+
throw y = true, n;
|
|
311
|
+
}
|
|
312
|
+
return function (o, p, l) {
|
|
313
|
+
if (f > 1) throw TypeError("Generator is already running");
|
|
314
|
+
for (y && 1 === p && d(p, l), c = p, u = l; (t = c < 2 ? e : u) || !y;) {
|
|
315
|
+
i || (c ? c < 3 ? (c > 1 && (G.n = -1), d(c, u)) : G.n = u : G.v = u);
|
|
316
|
+
try {
|
|
317
|
+
if (f = 2, i) {
|
|
318
|
+
if (c || (o = "next"), t = i[o]) {
|
|
319
|
+
if (!(t = t.call(i, u))) throw TypeError("iterator result is not an object");
|
|
320
|
+
if (!t.done) return t;
|
|
321
|
+
u = t.value, c < 2 && (c = 0);
|
|
322
|
+
} else 1 === c && (t = i.return) && t.call(i), c < 2 && (u = TypeError("The iterator does not provide a '" + o + "' method"), c = 1);
|
|
323
|
+
i = e;
|
|
324
|
+
} else if ((t = (y = G.n < 0) ? u : r.call(n, G)) !== a) break;
|
|
325
|
+
} catch (t) {
|
|
326
|
+
i = e, c = 1, u = t;
|
|
327
|
+
} finally {
|
|
328
|
+
f = 1;
|
|
329
|
+
}
|
|
330
|
+
}
|
|
331
|
+
return {
|
|
332
|
+
value: t,
|
|
333
|
+
done: y
|
|
334
|
+
};
|
|
322
335
|
};
|
|
323
|
-
}
|
|
336
|
+
}(r, o, i), true), u;
|
|
324
337
|
}
|
|
325
|
-
|
|
326
|
-
var h = "suspendedStart",
|
|
327
|
-
l = "suspendedYield",
|
|
328
|
-
f = "executing",
|
|
329
|
-
s = "completed",
|
|
330
|
-
y = {};
|
|
338
|
+
var a = {};
|
|
331
339
|
function Generator() {}
|
|
332
340
|
function GeneratorFunction() {}
|
|
333
341
|
function GeneratorFunctionPrototype() {}
|
|
334
|
-
|
|
335
|
-
|
|
342
|
+
t = Object.getPrototypeOf;
|
|
343
|
+
var c = [][n] ? t(t([][n]())) : (_regeneratorDefine(t = {}, n, function () {
|
|
344
|
+
return this;
|
|
345
|
+
}), t),
|
|
346
|
+
u = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(c);
|
|
347
|
+
function f(e) {
|
|
348
|
+
return Object.setPrototypeOf ? Object.setPrototypeOf(e, GeneratorFunctionPrototype) : (e.__proto__ = GeneratorFunctionPrototype, _regeneratorDefine(e, o, "GeneratorFunction")), e.prototype = Object.create(u), e;
|
|
349
|
+
}
|
|
350
|
+
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 () {
|
|
336
351
|
return this;
|
|
337
|
-
})
|
|
338
|
-
|
|
339
|
-
|
|
340
|
-
|
|
341
|
-
|
|
342
|
-
|
|
343
|
-
|
|
344
|
-
|
|
345
|
-
|
|
352
|
+
}), _regeneratorDefine(u, "toString", function () {
|
|
353
|
+
return "[object Generator]";
|
|
354
|
+
}), (_regenerator = function () {
|
|
355
|
+
return {
|
|
356
|
+
w: i,
|
|
357
|
+
m: f
|
|
358
|
+
};
|
|
359
|
+
})();
|
|
360
|
+
}
|
|
361
|
+
function _regeneratorDefine(e, r, n, t) {
|
|
362
|
+
var i = Object.defineProperty;
|
|
363
|
+
try {
|
|
364
|
+
i({}, "", {});
|
|
365
|
+
} catch (e) {
|
|
366
|
+
i = 0;
|
|
367
|
+
}
|
|
368
|
+
_regeneratorDefine = function (e, r, n, t) {
|
|
369
|
+
function o(r, n) {
|
|
370
|
+
_regeneratorDefine(e, r, function (e) {
|
|
371
|
+
return this._invoke(r, n, e);
|
|
346
372
|
});
|
|
347
|
-
}
|
|
348
|
-
|
|
349
|
-
|
|
350
|
-
|
|
351
|
-
|
|
352
|
-
|
|
353
|
-
|
|
354
|
-
|
|
355
|
-
|
|
356
|
-
|
|
357
|
-
|
|
358
|
-
|
|
359
|
-
|
|
360
|
-
|
|
361
|
-
|
|
362
|
-
|
|
363
|
-
|
|
364
|
-
|
|
365
|
-
|
|
366
|
-
|
|
367
|
-
var r;
|
|
368
|
-
o(this, "_invoke", {
|
|
369
|
-
value: function (t, n) {
|
|
370
|
-
function callInvokeWithMethodAndArg() {
|
|
371
|
-
return new e(function (e, r) {
|
|
372
|
-
invoke(t, n, e, r);
|
|
373
|
-
});
|
|
374
|
-
}
|
|
375
|
-
return r = r ? r.then(callInvokeWithMethodAndArg, callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg();
|
|
376
|
-
}
|
|
377
|
-
});
|
|
378
|
-
}
|
|
379
|
-
function makeInvokeMethod(e, r, n) {
|
|
380
|
-
var o = h;
|
|
381
|
-
return function (i, a) {
|
|
382
|
-
if (o === f) throw Error("Generator is already running");
|
|
383
|
-
if (o === s) {
|
|
384
|
-
if ("throw" === i) throw a;
|
|
385
|
-
return {
|
|
386
|
-
value: t,
|
|
387
|
-
done: true
|
|
373
|
+
}
|
|
374
|
+
r ? i ? i(e, r, {
|
|
375
|
+
value: n,
|
|
376
|
+
enumerable: !t,
|
|
377
|
+
configurable: !t,
|
|
378
|
+
writable: !t
|
|
379
|
+
}) : e[r] = n : (o("next", 0), o("throw", 1), o("return", 2));
|
|
380
|
+
}, _regeneratorDefine(e, r, n, t);
|
|
381
|
+
}
|
|
382
|
+
function _regeneratorValues(e) {
|
|
383
|
+
if (null != e) {
|
|
384
|
+
var t = e["function" == typeof Symbol && Symbol.iterator || "@@iterator"],
|
|
385
|
+
r = 0;
|
|
386
|
+
if (t) return t.call(e);
|
|
387
|
+
if ("function" == typeof e.next) return e;
|
|
388
|
+
if (!isNaN(e.length)) return {
|
|
389
|
+
next: function () {
|
|
390
|
+
return e && r >= e.length && (e = void 0), {
|
|
391
|
+
value: e && e[r++],
|
|
392
|
+
done: !e
|
|
388
393
|
};
|
|
389
394
|
}
|
|
390
|
-
for (n.method = i, n.arg = a;;) {
|
|
391
|
-
var c = n.delegate;
|
|
392
|
-
if (c) {
|
|
393
|
-
var u = maybeInvokeDelegate(c, n);
|
|
394
|
-
if (u) {
|
|
395
|
-
if (u === y) continue;
|
|
396
|
-
return u;
|
|
397
|
-
}
|
|
398
|
-
}
|
|
399
|
-
if ("next" === n.method) n.sent = n._sent = n.arg;else if ("throw" === n.method) {
|
|
400
|
-
if (o === h) throw o = s, n.arg;
|
|
401
|
-
n.dispatchException(n.arg);
|
|
402
|
-
} else "return" === n.method && n.abrupt("return", n.arg);
|
|
403
|
-
o = f;
|
|
404
|
-
var p = tryCatch(e, r, n);
|
|
405
|
-
if ("normal" === p.type) {
|
|
406
|
-
if (o = n.done ? s : l, p.arg === y) continue;
|
|
407
|
-
return {
|
|
408
|
-
value: p.arg,
|
|
409
|
-
done: n.done
|
|
410
|
-
};
|
|
411
|
-
}
|
|
412
|
-
"throw" === p.type && (o = s, n.method = "throw", n.arg = p.arg);
|
|
413
|
-
}
|
|
414
395
|
};
|
|
415
396
|
}
|
|
416
|
-
|
|
417
|
-
var n = r.method,
|
|
418
|
-
o = e.iterator[n];
|
|
419
|
-
if (o === t) return r.delegate = null, "throw" === n && e.iterator.return && (r.method = "return", r.arg = t, maybeInvokeDelegate(e, r), "throw" === r.method) || "return" !== n && (r.method = "throw", r.arg = new TypeError("The iterator does not provide a '" + n + "' method")), y;
|
|
420
|
-
var i = tryCatch(o, e.iterator, r.arg);
|
|
421
|
-
if ("throw" === i.type) return r.method = "throw", r.arg = i.arg, r.delegate = null, y;
|
|
422
|
-
var a = i.arg;
|
|
423
|
-
return a ? a.done ? (r[e.resultName] = a.value, r.next = e.nextLoc, "return" !== r.method && (r.method = "next", r.arg = t), r.delegate = null, y) : a : (r.method = "throw", r.arg = new TypeError("iterator result is not an object"), r.delegate = null, y);
|
|
424
|
-
}
|
|
425
|
-
function pushTryEntry(t) {
|
|
426
|
-
var e = {
|
|
427
|
-
tryLoc: t[0]
|
|
428
|
-
};
|
|
429
|
-
1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e);
|
|
430
|
-
}
|
|
431
|
-
function resetTryEntry(t) {
|
|
432
|
-
var e = t.completion || {};
|
|
433
|
-
e.type = "normal", delete e.arg, t.completion = e;
|
|
434
|
-
}
|
|
435
|
-
function Context(t) {
|
|
436
|
-
this.tryEntries = [{
|
|
437
|
-
tryLoc: "root"
|
|
438
|
-
}], t.forEach(pushTryEntry, this), this.reset(true);
|
|
439
|
-
}
|
|
440
|
-
function values(e) {
|
|
441
|
-
if (e || "" === e) {
|
|
442
|
-
var r = e[a];
|
|
443
|
-
if (r) return r.call(e);
|
|
444
|
-
if ("function" == typeof e.next) return e;
|
|
445
|
-
if (!isNaN(e.length)) {
|
|
446
|
-
var o = -1,
|
|
447
|
-
i = function next() {
|
|
448
|
-
for (; ++o < e.length;) if (n.call(e, o)) return next.value = e[o], next.done = false, next;
|
|
449
|
-
return next.value = t, next.done = true, next;
|
|
450
|
-
};
|
|
451
|
-
return i.next = i;
|
|
452
|
-
}
|
|
453
|
-
}
|
|
454
|
-
throw new TypeError(typeof e + " is not iterable");
|
|
455
|
-
}
|
|
456
|
-
return GeneratorFunction.prototype = GeneratorFunctionPrototype, o(g, "constructor", {
|
|
457
|
-
value: GeneratorFunctionPrototype,
|
|
458
|
-
configurable: true
|
|
459
|
-
}), o(GeneratorFunctionPrototype, "constructor", {
|
|
460
|
-
value: GeneratorFunction,
|
|
461
|
-
configurable: true
|
|
462
|
-
}), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, "GeneratorFunction"), e.isGeneratorFunction = function (t) {
|
|
463
|
-
var e = "function" == typeof t && t.constructor;
|
|
464
|
-
return !!e && (e === GeneratorFunction || "GeneratorFunction" === (e.displayName || e.name));
|
|
465
|
-
}, e.mark = function (t) {
|
|
466
|
-
return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, "GeneratorFunction")), t.prototype = Object.create(g), t;
|
|
467
|
-
}, e.awrap = function (t) {
|
|
468
|
-
return {
|
|
469
|
-
__await: t
|
|
470
|
-
};
|
|
471
|
-
}, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, c, function () {
|
|
472
|
-
return this;
|
|
473
|
-
}), e.AsyncIterator = AsyncIterator, e.async = function (t, r, n, o, i) {
|
|
474
|
-
void 0 === i && (i = Promise);
|
|
475
|
-
var a = new AsyncIterator(wrap(t, r, n, o), i);
|
|
476
|
-
return e.isGeneratorFunction(r) ? a : a.next().then(function (t) {
|
|
477
|
-
return t.done ? t.value : a.next();
|
|
478
|
-
});
|
|
479
|
-
}, defineIteratorMethods(g), define(g, u, "Generator"), define(g, a, function () {
|
|
480
|
-
return this;
|
|
481
|
-
}), define(g, "toString", function () {
|
|
482
|
-
return "[object Generator]";
|
|
483
|
-
}), e.keys = function (t) {
|
|
484
|
-
var e = Object(t),
|
|
485
|
-
r = [];
|
|
486
|
-
for (var n in e) r.push(n);
|
|
487
|
-
return r.reverse(), function next() {
|
|
488
|
-
for (; r.length;) {
|
|
489
|
-
var t = r.pop();
|
|
490
|
-
if (t in e) return next.value = t, next.done = false, next;
|
|
491
|
-
}
|
|
492
|
-
return next.done = true, next;
|
|
493
|
-
};
|
|
494
|
-
}, e.values = values, Context.prototype = {
|
|
495
|
-
constructor: Context,
|
|
496
|
-
reset: function (e) {
|
|
497
|
-
if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = false, 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);
|
|
498
|
-
},
|
|
499
|
-
stop: function () {
|
|
500
|
-
this.done = true;
|
|
501
|
-
var t = this.tryEntries[0].completion;
|
|
502
|
-
if ("throw" === t.type) throw t.arg;
|
|
503
|
-
return this.rval;
|
|
504
|
-
},
|
|
505
|
-
dispatchException: function (e) {
|
|
506
|
-
if (this.done) throw e;
|
|
507
|
-
var r = this;
|
|
508
|
-
function handle(n, o) {
|
|
509
|
-
return a.type = "throw", a.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o;
|
|
510
|
-
}
|
|
511
|
-
for (var o = this.tryEntries.length - 1; o >= 0; --o) {
|
|
512
|
-
var i = this.tryEntries[o],
|
|
513
|
-
a = i.completion;
|
|
514
|
-
if ("root" === i.tryLoc) return handle("end");
|
|
515
|
-
if (i.tryLoc <= this.prev) {
|
|
516
|
-
var c = n.call(i, "catchLoc"),
|
|
517
|
-
u = n.call(i, "finallyLoc");
|
|
518
|
-
if (c && u) {
|
|
519
|
-
if (this.prev < i.catchLoc) return handle(i.catchLoc, true);
|
|
520
|
-
if (this.prev < i.finallyLoc) return handle(i.finallyLoc);
|
|
521
|
-
} else if (c) {
|
|
522
|
-
if (this.prev < i.catchLoc) return handle(i.catchLoc, true);
|
|
523
|
-
} else {
|
|
524
|
-
if (!u) throw Error("try statement without catch or finally");
|
|
525
|
-
if (this.prev < i.finallyLoc) return handle(i.finallyLoc);
|
|
526
|
-
}
|
|
527
|
-
}
|
|
528
|
-
}
|
|
529
|
-
},
|
|
530
|
-
abrupt: function (t, e) {
|
|
531
|
-
for (var r = this.tryEntries.length - 1; r >= 0; --r) {
|
|
532
|
-
var o = this.tryEntries[r];
|
|
533
|
-
if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) {
|
|
534
|
-
var i = o;
|
|
535
|
-
break;
|
|
536
|
-
}
|
|
537
|
-
}
|
|
538
|
-
i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null);
|
|
539
|
-
var a = i ? i.completion : {};
|
|
540
|
-
return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, y) : this.complete(a);
|
|
541
|
-
},
|
|
542
|
-
complete: function (t, e) {
|
|
543
|
-
if ("throw" === t.type) throw t.arg;
|
|
544
|
-
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;
|
|
545
|
-
},
|
|
546
|
-
finish: function (t) {
|
|
547
|
-
for (var e = this.tryEntries.length - 1; e >= 0; --e) {
|
|
548
|
-
var r = this.tryEntries[e];
|
|
549
|
-
if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y;
|
|
550
|
-
}
|
|
551
|
-
},
|
|
552
|
-
catch: function (t) {
|
|
553
|
-
for (var e = this.tryEntries.length - 1; e >= 0; --e) {
|
|
554
|
-
var r = this.tryEntries[e];
|
|
555
|
-
if (r.tryLoc === t) {
|
|
556
|
-
var n = r.completion;
|
|
557
|
-
if ("throw" === n.type) {
|
|
558
|
-
var o = n.arg;
|
|
559
|
-
resetTryEntry(r);
|
|
560
|
-
}
|
|
561
|
-
return o;
|
|
562
|
-
}
|
|
563
|
-
}
|
|
564
|
-
throw Error("illegal catch attempt");
|
|
565
|
-
},
|
|
566
|
-
delegateYield: function (e, r, n) {
|
|
567
|
-
return this.delegate = {
|
|
568
|
-
iterator: values(e),
|
|
569
|
-
resultName: r,
|
|
570
|
-
nextLoc: n
|
|
571
|
-
}, "next" === this.method && (this.arg = t), y;
|
|
572
|
-
}
|
|
573
|
-
}, e;
|
|
397
|
+
throw new TypeError(typeof e + " is not iterable");
|
|
574
398
|
}
|
|
575
399
|
function _setPrototypeOf(t, e) {
|
|
576
400
|
return _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function (t, e) {
|
|
@@ -4288,28 +4112,28 @@ var Values = /*#__PURE__*/function () {
|
|
|
4288
4112
|
}
|
|
4289
4113
|
}, {
|
|
4290
4114
|
key: "_setFromRGB",
|
|
4291
|
-
value: function _setFromRGB(
|
|
4292
|
-
var
|
|
4293
|
-
r =
|
|
4294
|
-
g =
|
|
4295
|
-
b =
|
|
4296
|
-
a =
|
|
4297
|
-
var
|
|
4298
|
-
this.rgb =
|
|
4299
|
-
this.alpha =
|
|
4115
|
+
value: function _setFromRGB(_ref0) {
|
|
4116
|
+
var _ref1 = _slicedToArray(_ref0, 4),
|
|
4117
|
+
r = _ref1[0],
|
|
4118
|
+
g = _ref1[1],
|
|
4119
|
+
b = _ref1[2],
|
|
4120
|
+
a = _ref1[3];
|
|
4121
|
+
var _ref10 = [[r, g, b], a];
|
|
4122
|
+
this.rgb = _ref10[0];
|
|
4123
|
+
this.alpha = _ref10[1];
|
|
4300
4124
|
return this;
|
|
4301
4125
|
}
|
|
4302
4126
|
}, {
|
|
4303
4127
|
key: "_setFromHSL",
|
|
4304
|
-
value: function _setFromHSL(
|
|
4305
|
-
var
|
|
4306
|
-
h =
|
|
4307
|
-
s =
|
|
4308
|
-
l =
|
|
4309
|
-
a =
|
|
4310
|
-
var
|
|
4311
|
-
this.rgb =
|
|
4312
|
-
this.alpha =
|
|
4128
|
+
value: function _setFromHSL(_ref11) {
|
|
4129
|
+
var _ref12 = _slicedToArray(_ref11, 4),
|
|
4130
|
+
h = _ref12[0],
|
|
4131
|
+
s = _ref12[1],
|
|
4132
|
+
l = _ref12[2],
|
|
4133
|
+
a = _ref12[3];
|
|
4134
|
+
var _ref13 = [hsl2rgb$1([h, s, l]).map(Math.round), a];
|
|
4135
|
+
this.rgb = _ref13[0];
|
|
4136
|
+
this.alpha = _ref13[1];
|
|
4313
4137
|
return this;
|
|
4314
4138
|
}
|
|
4315
4139
|
}]);
|
|
@@ -4398,10 +4222,10 @@ var BASE_COLORS = {
|
|
|
4398
4222
|
windsorGrey: '#606065',
|
|
4399
4223
|
woodsmoke: '#121214'
|
|
4400
4224
|
};
|
|
4401
|
-
var colorScales = Object.entries(BASE_COLORS).reduce(function (acc,
|
|
4402
|
-
var
|
|
4403
|
-
key =
|
|
4404
|
-
value =
|
|
4225
|
+
var colorScales = Object.entries(BASE_COLORS).reduce(function (acc, _ref14) {
|
|
4226
|
+
var _ref15 = _slicedToArray(_ref14, 2),
|
|
4227
|
+
key = _ref15[0],
|
|
4228
|
+
value = _ref15[1];
|
|
4405
4229
|
return Object.assign(Object.assign({}, acc), _defineProperty({}, key, createColorScales(value)));
|
|
4406
4230
|
}, {});
|
|
4407
4231
|
var blue$1 = colorScales.blue,
|
|
@@ -17625,41 +17449,40 @@ function selection_dispatch (type, params) {
|
|
|
17625
17449
|
return this.each((typeof params === "function" ? dispatchFunction : dispatchConstant)(type, params));
|
|
17626
17450
|
}
|
|
17627
17451
|
|
|
17628
|
-
var _marked = /*#__PURE__*/
|
|
17452
|
+
var _marked = /*#__PURE__*/_regenerator().m(_callee);
|
|
17629
17453
|
function _callee() {
|
|
17630
17454
|
var groups, j, m, group, i, n, node;
|
|
17631
|
-
return
|
|
17632
|
-
while (1) switch (_context.
|
|
17455
|
+
return _regenerator().w(function (_context) {
|
|
17456
|
+
while (1) switch (_context.n) {
|
|
17633
17457
|
case 0:
|
|
17634
17458
|
groups = this._groups, j = 0, m = groups.length;
|
|
17635
17459
|
case 1:
|
|
17636
17460
|
if (!(j < m)) {
|
|
17637
|
-
_context.
|
|
17461
|
+
_context.n = 5;
|
|
17638
17462
|
break;
|
|
17639
17463
|
}
|
|
17640
17464
|
group = groups[j], i = 0, n = group.length;
|
|
17641
17465
|
case 2:
|
|
17642
17466
|
if (!(i < n)) {
|
|
17643
|
-
_context.
|
|
17467
|
+
_context.n = 4;
|
|
17644
17468
|
break;
|
|
17645
17469
|
}
|
|
17646
17470
|
if (!(node = group[i])) {
|
|
17647
|
-
_context.
|
|
17471
|
+
_context.n = 3;
|
|
17648
17472
|
break;
|
|
17649
17473
|
}
|
|
17650
|
-
_context.
|
|
17474
|
+
_context.n = 3;
|
|
17651
17475
|
return node;
|
|
17652
17476
|
case 3:
|
|
17653
17477
|
++i;
|
|
17654
|
-
_context.
|
|
17478
|
+
_context.n = 2;
|
|
17655
17479
|
break;
|
|
17656
17480
|
case 4:
|
|
17657
17481
|
++j;
|
|
17658
|
-
_context.
|
|
17482
|
+
_context.n = 1;
|
|
17659
17483
|
break;
|
|
17660
17484
|
case 5:
|
|
17661
|
-
|
|
17662
|
-
return _context.stop();
|
|
17485
|
+
return _context.a(2);
|
|
17663
17486
|
}
|
|
17664
17487
|
}, _marked, this);
|
|
17665
17488
|
}
|
|
@@ -19252,7 +19075,7 @@ function selection_transition (name) {
|
|
|
19252
19075
|
selection.prototype.interrupt = selection_interrupt;
|
|
19253
19076
|
selection.prototype.transition = selection_transition;
|
|
19254
19077
|
|
|
19255
|
-
var _templateObject$1, _templateObject2, _templateObject3, _templateObject4, _templateObject5, _templateObject6, _templateObject7, _templateObject8, _templateObject9,
|
|
19078
|
+
var _templateObject$1, _templateObject2, _templateObject3, _templateObject4, _templateObject5, _templateObject6, _templateObject7, _templateObject8, _templateObject9, _templateObject0, _templateObject1, _templateObject10, _templateObject11, _templateObject12;
|
|
19256
19079
|
var pi = Math.PI,
|
|
19257
19080
|
tau = 2 * pi,
|
|
19258
19081
|
epsilon = 1e-6,
|
|
@@ -19377,12 +19200,12 @@ var Path = /*#__PURE__*/function () {
|
|
|
19377
19200
|
|
|
19378
19201
|
// Is this path empty? Move to (x0,y0).
|
|
19379
19202
|
if (this._x1 === null) {
|
|
19380
|
-
this._append(
|
|
19203
|
+
this._append(_templateObject0 || (_templateObject0 = _taggedTemplateLiteral(["M", ",", ""])), x0, y0);
|
|
19381
19204
|
}
|
|
19382
19205
|
|
|
19383
19206
|
// Or, is (x0,y0) not coincident with the previous point? Line to (x0,y0).
|
|
19384
19207
|
else if (Math.abs(this._x1 - x0) > epsilon || Math.abs(this._y1 - y0) > epsilon) {
|
|
19385
|
-
this._append(
|
|
19208
|
+
this._append(_templateObject1 || (_templateObject1 = _taggedTemplateLiteral(["L", ",", ""])), x0, y0);
|
|
19386
19209
|
}
|
|
19387
19210
|
|
|
19388
19211
|
// Is this arc empty? We’re done.
|
|
@@ -19393,18 +19216,18 @@ var Path = /*#__PURE__*/function () {
|
|
|
19393
19216
|
|
|
19394
19217
|
// Is this a complete circle? Draw two arcs to complete the circle.
|
|
19395
19218
|
if (da > tauEpsilon) {
|
|
19396
|
-
this._append(
|
|
19219
|
+
this._append(_templateObject10 || (_templateObject10 = _taggedTemplateLiteral(["A", ",", ",0,1,", ",", ",", "A", ",", ",0,1,", ",", ",", ""])), r, r, cw, x - dx, y - dy, r, r, cw, this._x1 = x0, this._y1 = y0);
|
|
19397
19220
|
}
|
|
19398
19221
|
|
|
19399
19222
|
// Is this arc non-empty? Draw an arc!
|
|
19400
19223
|
else if (da > epsilon) {
|
|
19401
|
-
this._append(
|
|
19224
|
+
this._append(_templateObject11 || (_templateObject11 = _taggedTemplateLiteral(["A", ",", ",0,", ",", ",", ",", ""])), r, r, +(da >= pi), cw, this._x1 = x + r * Math.cos(a1), this._y1 = y + r * Math.sin(a1));
|
|
19402
19225
|
}
|
|
19403
19226
|
}
|
|
19404
19227
|
}, {
|
|
19405
19228
|
key: "rect",
|
|
19406
19229
|
value: function rect(x, y, w, h) {
|
|
19407
|
-
this._append(
|
|
19230
|
+
this._append(_templateObject12 || (_templateObject12 = _taggedTemplateLiteral(["M", ",", "h", "v", "h", "Z"])), this._x0 = this._x1 = +x, this._y0 = this._y1 = +y, w = +w, +h, -w);
|
|
19408
19231
|
}
|
|
19409
19232
|
}, {
|
|
19410
19233
|
key: "toString",
|
|
@@ -21694,10 +21517,10 @@ var StyledBorderBackDrop = index$c(reactNative.View)(function (_ref9) {
|
|
|
21694
21517
|
borderColor: genBorderColor(theme, themeState, themeFocused, themeFilled)
|
|
21695
21518
|
});
|
|
21696
21519
|
});
|
|
21697
|
-
var StyledTextInputContainer = index$c(reactNative.View)(function (
|
|
21698
|
-
var theme =
|
|
21699
|
-
themeVariant =
|
|
21700
|
-
themeState =
|
|
21520
|
+
var StyledTextInputContainer = index$c(reactNative.View)(function (_ref0) {
|
|
21521
|
+
var theme = _ref0.theme,
|
|
21522
|
+
themeVariant = _ref0.themeVariant,
|
|
21523
|
+
themeState = _ref0.themeState;
|
|
21701
21524
|
return _objectSpread2(_objectSpread2(_objectSpread2({
|
|
21702
21525
|
flexDirection: 'row',
|
|
21703
21526
|
alignItems: 'center',
|
|
@@ -21714,8 +21537,8 @@ var StyledTextInputContainer = index$c(reactNative.View)(function (_ref10) {
|
|
|
21714
21537
|
});
|
|
21715
21538
|
// Outer wrapper that owns flex-grow/shrink and provides the positioning context
|
|
21716
21539
|
// for StyledLabelContainerInsideTextInput (position: absolute).
|
|
21717
|
-
var StyledInputContentContainer = index$c(reactNative.View)(function (
|
|
21718
|
-
var themeHasLabel =
|
|
21540
|
+
var StyledInputContentContainer = index$c(reactNative.View)(function (_ref1) {
|
|
21541
|
+
var themeHasLabel = _ref1.themeHasLabel;
|
|
21719
21542
|
return {
|
|
21720
21543
|
flexGrow: 2,
|
|
21721
21544
|
flexShrink: 1,
|
|
@@ -21723,9 +21546,9 @@ var StyledInputContentContainer = index$c(reactNative.View)(function (_ref11) {
|
|
|
21723
21546
|
justifyContent: themeHasLabel ? 'flex-start' : 'center'
|
|
21724
21547
|
};
|
|
21725
21548
|
});
|
|
21726
|
-
var StyledTextInputAndLabelContainer = index$c(reactNative.View)(function (
|
|
21727
|
-
var theme =
|
|
21728
|
-
themeHasLabel =
|
|
21549
|
+
var StyledTextInputAndLabelContainer = index$c(reactNative.View)(function (_ref10) {
|
|
21550
|
+
var theme = _ref10.theme,
|
|
21551
|
+
themeHasLabel = _ref10.themeHasLabel;
|
|
21729
21552
|
return _objectSpread2({
|
|
21730
21553
|
flexDirection: 'row',
|
|
21731
21554
|
alignItems: 'center',
|
|
@@ -21734,15 +21557,15 @@ var StyledTextInputAndLabelContainer = index$c(reactNative.View)(function (_ref1
|
|
|
21734
21557
|
paddingTop: theme.__hd__.textInput.space.inputAndLabelContainerPaddingTop
|
|
21735
21558
|
});
|
|
21736
21559
|
});
|
|
21737
|
-
var StyledErrorAndHelpTextContainer = index$c(reactNative.View)(function (
|
|
21738
|
-
var theme =
|
|
21560
|
+
var StyledErrorAndHelpTextContainer = index$c(reactNative.View)(function (_ref11) {
|
|
21561
|
+
var theme = _ref11.theme;
|
|
21739
21562
|
return {
|
|
21740
21563
|
minHeight: theme.__hd__.textInput.sizes.errorAndHelpTextContainerMinHeight,
|
|
21741
21564
|
paddingTop: theme.__hd__.textInput.space.errorAndHelpTextContainerPaddingTop
|
|
21742
21565
|
};
|
|
21743
21566
|
});
|
|
21744
|
-
var StyledErrorAndMaxLengthContainer = index$c(reactNative.View)(function (
|
|
21745
|
-
var theme =
|
|
21567
|
+
var StyledErrorAndMaxLengthContainer = index$c(reactNative.View)(function (_ref12) {
|
|
21568
|
+
var theme = _ref12.theme;
|
|
21746
21569
|
return {
|
|
21747
21570
|
flexDirection: 'row',
|
|
21748
21571
|
justifyContent: 'space-between',
|
|
@@ -22424,9 +22247,9 @@ var DatePickerCalendar = function DatePickerCalendar(_ref2) {
|
|
|
22424
22247
|
setMonthPickerVisible = _useState8[1];
|
|
22425
22248
|
var shouldHideToolbar = reactNative.Platform.OS === 'ios' && monthPickerVisible;
|
|
22426
22249
|
var _useState9 = React.useState(value || new Date()),
|
|
22427
|
-
|
|
22428
|
-
selectingDate =
|
|
22429
|
-
setSelectingDate =
|
|
22250
|
+
_useState0 = _slicedToArray(_useState9, 2),
|
|
22251
|
+
selectingDate = _useState0[0],
|
|
22252
|
+
setSelectingDate = _useState0[1];
|
|
22430
22253
|
var _useFormatDate = useFormatDate({
|
|
22431
22254
|
value: value,
|
|
22432
22255
|
displayFormat: displayFormat,
|
|
@@ -30361,15 +30184,15 @@ var StyledInput$1 = index$c(reactNative.TextInput)(function (_ref9) {
|
|
|
30361
30184
|
color: theme.__hd__.toolbar.colors.text
|
|
30362
30185
|
};
|
|
30363
30186
|
});
|
|
30364
|
-
var StyledPrefix = index$c(reactNative.View)(function (
|
|
30365
|
-
var theme =
|
|
30187
|
+
var StyledPrefix = index$c(reactNative.View)(function (_ref0) {
|
|
30188
|
+
var theme = _ref0.theme;
|
|
30366
30189
|
return {
|
|
30367
30190
|
marginRight: theme.__hd__.toolbar.space.affixInnerMargin,
|
|
30368
30191
|
maxHeight: '100%'
|
|
30369
30192
|
};
|
|
30370
30193
|
});
|
|
30371
|
-
var StyledSuffix = index$c(reactNative.View)(function (
|
|
30372
|
-
var theme =
|
|
30194
|
+
var StyledSuffix = index$c(reactNative.View)(function (_ref1) {
|
|
30195
|
+
var theme = _ref1.theme;
|
|
30373
30196
|
return {
|
|
30374
30197
|
marginLeft: theme.__hd__.toolbar.space.affixInnerMargin,
|
|
30375
30198
|
maxHeight: '100%'
|
|
@@ -32589,13 +32412,13 @@ function requireLib() {
|
|
|
32589
32412
|
intersection: function intersection(e, t) {
|
|
32590
32413
|
var r = De(e, ge),
|
|
32591
32414
|
_Ce$edges9 = Ce.edges(e),
|
|
32592
|
-
_Ce$
|
|
32593
|
-
n = _Ce$
|
|
32594
|
-
o = _Ce$
|
|
32595
|
-
_Ce$
|
|
32596
|
-
_Ce$
|
|
32597
|
-
u = _Ce$
|
|
32598
|
-
a = _Ce$
|
|
32415
|
+
_Ce$edges0 = _slicedToArray(_Ce$edges9, 2),
|
|
32416
|
+
n = _Ce$edges0[0],
|
|
32417
|
+
o = _Ce$edges0[1],
|
|
32418
|
+
_Ce$edges1 = Ce.edges(t),
|
|
32419
|
+
_Ce$edges10 = _slicedToArray(_Ce$edges1, 2),
|
|
32420
|
+
u = _Ce$edges10[0],
|
|
32421
|
+
a = _Ce$edges10[1],
|
|
32599
32422
|
i = Me.isBefore(n, u) ? u : n,
|
|
32600
32423
|
s = Me.isBefore(o, a) ? o : a;
|
|
32601
32424
|
return Me.isBefore(s, i) ? null : function (e) {
|
|
@@ -32632,25 +32455,24 @@ function requireLib() {
|
|
|
32632
32455
|
isRange: function isRange(e) {
|
|
32633
32456
|
return n(e) && Me.isPoint(e.anchor) && Me.isPoint(e.focus);
|
|
32634
32457
|
},
|
|
32635
|
-
points: /*#__PURE__*/
|
|
32636
|
-
return
|
|
32637
|
-
while (1) switch (_context.
|
|
32458
|
+
points: /*#__PURE__*/_regenerator().m(function points(e) {
|
|
32459
|
+
return _regenerator().w(function (_context) {
|
|
32460
|
+
while (1) switch (_context.n) {
|
|
32638
32461
|
case 0:
|
|
32639
|
-
_context.
|
|
32462
|
+
_context.n = 1;
|
|
32640
32463
|
return [e.anchor, "anchor"];
|
|
32641
32464
|
case 1:
|
|
32642
|
-
_context.
|
|
32465
|
+
_context.n = 2;
|
|
32643
32466
|
return [e.focus, "focus"];
|
|
32644
32467
|
case 2:
|
|
32645
|
-
|
|
32646
|
-
return _context.stop();
|
|
32468
|
+
return _context.a(2);
|
|
32647
32469
|
}
|
|
32648
32470
|
}, points);
|
|
32649
32471
|
}),
|
|
32650
32472
|
start: function start(e) {
|
|
32651
|
-
var _Ce$
|
|
32652
|
-
_Ce$
|
|
32653
|
-
t = _Ce$
|
|
32473
|
+
var _Ce$edges11 = Ce.edges(e),
|
|
32474
|
+
_Ce$edges12 = _slicedToArray(_Ce$edges11, 1),
|
|
32475
|
+
t = _Ce$edges12[0];
|
|
32654
32476
|
return t;
|
|
32655
32477
|
},
|
|
32656
32478
|
transform: function transform(e, t) {
|
|
@@ -32712,40 +32534,39 @@ function requireLib() {
|
|
|
32712
32534
|
},
|
|
32713
32535
|
ancestors: function ancestors(e, t) {
|
|
32714
32536
|
var r = arguments.length > 2 && void 0 !== arguments[2] ? arguments[2] : {};
|
|
32715
|
-
return /*#__PURE__*/
|
|
32537
|
+
return /*#__PURE__*/_regenerator().m(function _callee() {
|
|
32716
32538
|
var _iterator9, _step9, n, o, _t7;
|
|
32717
|
-
return
|
|
32718
|
-
while (1) switch (_context2.
|
|
32539
|
+
return _regenerator().w(function (_context2) {
|
|
32540
|
+
while (1) switch (_context2.p = _context2.n) {
|
|
32719
32541
|
case 0:
|
|
32720
32542
|
_iterator9 = _createForOfIteratorHelper(ie.ancestors(t, r));
|
|
32721
|
-
_context2.
|
|
32543
|
+
_context2.p = 1;
|
|
32722
32544
|
_iterator9.s();
|
|
32723
32545
|
case 2:
|
|
32724
32546
|
if ((_step9 = _iterator9.n()).done) {
|
|
32725
|
-
_context2.
|
|
32547
|
+
_context2.n = 4;
|
|
32726
32548
|
break;
|
|
32727
32549
|
}
|
|
32728
32550
|
n = _step9.value;
|
|
32729
32551
|
o = [Ae.ancestor(e, n), n];
|
|
32730
|
-
_context2.
|
|
32552
|
+
_context2.n = 3;
|
|
32731
32553
|
return o;
|
|
32732
32554
|
case 3:
|
|
32733
|
-
_context2.
|
|
32555
|
+
_context2.n = 2;
|
|
32734
32556
|
break;
|
|
32735
32557
|
case 4:
|
|
32736
|
-
_context2.
|
|
32558
|
+
_context2.n = 6;
|
|
32737
32559
|
break;
|
|
32738
32560
|
case 5:
|
|
32739
|
-
_context2.
|
|
32740
|
-
_t7 = _context2
|
|
32561
|
+
_context2.p = 5;
|
|
32562
|
+
_t7 = _context2.v;
|
|
32741
32563
|
_iterator9.e(_t7);
|
|
32742
32564
|
case 6:
|
|
32743
|
-
_context2.
|
|
32565
|
+
_context2.p = 6;
|
|
32744
32566
|
_iterator9.f();
|
|
32745
|
-
return _context2.
|
|
32567
|
+
return _context2.f(6);
|
|
32746
32568
|
case 7:
|
|
32747
|
-
|
|
32748
|
-
return _context2.stop();
|
|
32569
|
+
return _context2.a(2);
|
|
32749
32570
|
}
|
|
32750
32571
|
}, _callee, null, [[1, 5, 6, 7]]);
|
|
32751
32572
|
})();
|
|
@@ -32758,28 +32579,27 @@ function requireLib() {
|
|
|
32758
32579
|
},
|
|
32759
32580
|
children: function children(e, t) {
|
|
32760
32581
|
var r = arguments.length > 2 && void 0 !== arguments[2] ? arguments[2] : {};
|
|
32761
|
-
return /*#__PURE__*/
|
|
32582
|
+
return /*#__PURE__*/_regenerator().m(function _callee2() {
|
|
32762
32583
|
var _r$reverse, n, o, u, a, i, s;
|
|
32763
|
-
return
|
|
32764
|
-
while (1) switch (_context3.
|
|
32584
|
+
return _regenerator().w(function (_context3) {
|
|
32585
|
+
while (1) switch (_context3.n) {
|
|
32765
32586
|
case 0:
|
|
32766
32587
|
_r$reverse = r.reverse, n = _r$reverse === void 0 ? false : _r$reverse, o = Ae.ancestor(e, t), u = o.children, a = n ? u.length - 1 : 0;
|
|
32767
32588
|
case 1:
|
|
32768
32589
|
if (!(n ? a >= 0 : a < u.length)) {
|
|
32769
|
-
_context3.
|
|
32590
|
+
_context3.n = 4;
|
|
32770
32591
|
break;
|
|
32771
32592
|
}
|
|
32772
32593
|
i = Ae.child(o, a), s = t.concat(a);
|
|
32773
|
-
_context3.
|
|
32594
|
+
_context3.n = 2;
|
|
32774
32595
|
return [i, s];
|
|
32775
32596
|
case 2:
|
|
32776
32597
|
a = n ? a - 1 : a + 1;
|
|
32777
32598
|
case 3:
|
|
32778
|
-
_context3.
|
|
32599
|
+
_context3.n = 1;
|
|
32779
32600
|
break;
|
|
32780
32601
|
case 4:
|
|
32781
|
-
|
|
32782
|
-
return _context3.stop();
|
|
32602
|
+
return _context3.a(2);
|
|
32783
32603
|
}
|
|
32784
32604
|
}, _callee2);
|
|
32785
32605
|
})();
|
|
@@ -32795,88 +32615,86 @@ function requireLib() {
|
|
|
32795
32615
|
},
|
|
32796
32616
|
descendants: function descendants(e) {
|
|
32797
32617
|
var t = arguments.length > 1 && void 0 !== arguments[1] ? arguments[1] : {};
|
|
32798
|
-
return /*#__PURE__*/
|
|
32799
|
-
var
|
|
32800
|
-
return
|
|
32801
|
-
while (1) switch (_context4.
|
|
32618
|
+
return /*#__PURE__*/_regenerator().m(function _callee3() {
|
|
32619
|
+
var _iterator0, _step0, _step0$value, r, n, _t8, _t9;
|
|
32620
|
+
return _regenerator().w(function (_context4) {
|
|
32621
|
+
while (1) switch (_context4.p = _context4.n) {
|
|
32802
32622
|
case 0:
|
|
32803
|
-
|
|
32804
|
-
_context4.
|
|
32805
|
-
|
|
32623
|
+
_iterator0 = _createForOfIteratorHelper(Ae.nodes(e, t));
|
|
32624
|
+
_context4.p = 1;
|
|
32625
|
+
_iterator0.s();
|
|
32806
32626
|
case 2:
|
|
32807
|
-
if ((
|
|
32808
|
-
_context4.
|
|
32627
|
+
if ((_step0 = _iterator0.n()).done) {
|
|
32628
|
+
_context4.n = 4;
|
|
32809
32629
|
break;
|
|
32810
32630
|
}
|
|
32811
|
-
|
|
32631
|
+
_step0$value = _slicedToArray(_step0.value, 2), r = _step0$value[0], n = _step0$value[1];
|
|
32812
32632
|
_t8 = 0 !== n.length;
|
|
32813
32633
|
if (!_t8) {
|
|
32814
|
-
_context4.
|
|
32634
|
+
_context4.n = 3;
|
|
32815
32635
|
break;
|
|
32816
32636
|
}
|
|
32817
|
-
_context4.
|
|
32637
|
+
_context4.n = 3;
|
|
32818
32638
|
return [r, n];
|
|
32819
32639
|
case 3:
|
|
32820
|
-
_context4.
|
|
32640
|
+
_context4.n = 2;
|
|
32821
32641
|
break;
|
|
32822
32642
|
case 4:
|
|
32823
|
-
_context4.
|
|
32643
|
+
_context4.n = 6;
|
|
32824
32644
|
break;
|
|
32825
32645
|
case 5:
|
|
32826
|
-
_context4.
|
|
32827
|
-
_t9 = _context4
|
|
32828
|
-
|
|
32646
|
+
_context4.p = 5;
|
|
32647
|
+
_t9 = _context4.v;
|
|
32648
|
+
_iterator0.e(_t9);
|
|
32829
32649
|
case 6:
|
|
32830
|
-
_context4.
|
|
32831
|
-
|
|
32832
|
-
return _context4.
|
|
32650
|
+
_context4.p = 6;
|
|
32651
|
+
_iterator0.f();
|
|
32652
|
+
return _context4.f(6);
|
|
32833
32653
|
case 7:
|
|
32834
|
-
|
|
32835
|
-
return _context4.stop();
|
|
32654
|
+
return _context4.a(2);
|
|
32836
32655
|
}
|
|
32837
32656
|
}, _callee3, null, [[1, 5, 6, 7]]);
|
|
32838
32657
|
})();
|
|
32839
32658
|
},
|
|
32840
32659
|
elements: function elements(e) {
|
|
32841
32660
|
var t = arguments.length > 1 && void 0 !== arguments[1] ? arguments[1] : {};
|
|
32842
|
-
return /*#__PURE__*/
|
|
32843
|
-
var
|
|
32844
|
-
return
|
|
32845
|
-
while (1) switch (_context5.
|
|
32661
|
+
return /*#__PURE__*/_regenerator().m(function _callee4() {
|
|
32662
|
+
var _iterator1, _step1, _step1$value, r, n, _t0, _t1;
|
|
32663
|
+
return _regenerator().w(function (_context5) {
|
|
32664
|
+
while (1) switch (_context5.p = _context5.n) {
|
|
32846
32665
|
case 0:
|
|
32847
|
-
|
|
32848
|
-
_context5.
|
|
32849
|
-
|
|
32666
|
+
_iterator1 = _createForOfIteratorHelper(Ae.nodes(e, t));
|
|
32667
|
+
_context5.p = 1;
|
|
32668
|
+
_iterator1.s();
|
|
32850
32669
|
case 2:
|
|
32851
|
-
if ((
|
|
32852
|
-
_context5.
|
|
32670
|
+
if ((_step1 = _iterator1.n()).done) {
|
|
32671
|
+
_context5.n = 4;
|
|
32853
32672
|
break;
|
|
32854
32673
|
}
|
|
32855
|
-
|
|
32856
|
-
|
|
32857
|
-
if (!
|
|
32858
|
-
_context5.
|
|
32674
|
+
_step1$value = _slicedToArray(_step1.value, 2), r = _step1$value[0], n = _step1$value[1];
|
|
32675
|
+
_t0 = Be.isElement(r);
|
|
32676
|
+
if (!_t0) {
|
|
32677
|
+
_context5.n = 3;
|
|
32859
32678
|
break;
|
|
32860
32679
|
}
|
|
32861
|
-
_context5.
|
|
32680
|
+
_context5.n = 3;
|
|
32862
32681
|
return [r, n];
|
|
32863
32682
|
case 3:
|
|
32864
|
-
_context5.
|
|
32683
|
+
_context5.n = 2;
|
|
32865
32684
|
break;
|
|
32866
32685
|
case 4:
|
|
32867
|
-
_context5.
|
|
32686
|
+
_context5.n = 6;
|
|
32868
32687
|
break;
|
|
32869
32688
|
case 5:
|
|
32870
|
-
_context5.
|
|
32871
|
-
|
|
32872
|
-
|
|
32689
|
+
_context5.p = 5;
|
|
32690
|
+
_t1 = _context5.v;
|
|
32691
|
+
_iterator1.e(_t1);
|
|
32873
32692
|
case 6:
|
|
32874
|
-
_context5.
|
|
32875
|
-
|
|
32876
|
-
return _context5.
|
|
32693
|
+
_context5.p = 6;
|
|
32694
|
+
_iterator1.f();
|
|
32695
|
+
return _context5.f(6);
|
|
32877
32696
|
case 7:
|
|
32878
|
-
|
|
32879
|
-
return _context5.stop();
|
|
32697
|
+
return _context5.a(2);
|
|
32880
32698
|
}
|
|
32881
32699
|
}, _callee4, null, [[1, 5, 6, 7]]);
|
|
32882
32700
|
})();
|
|
@@ -32893,10 +32711,10 @@ function requireLib() {
|
|
|
32893
32711
|
return X({
|
|
32894
32712
|
children: e.children
|
|
32895
32713
|
}, function (e) {
|
|
32896
|
-
var _Ce$
|
|
32897
|
-
_Ce$
|
|
32898
|
-
r = _Ce$
|
|
32899
|
-
n = _Ce$
|
|
32714
|
+
var _Ce$edges13 = Ce.edges(t),
|
|
32715
|
+
_Ce$edges14 = _slicedToArray(_Ce$edges13, 2),
|
|
32716
|
+
r = _Ce$edges14[0],
|
|
32717
|
+
n = _Ce$edges14[1],
|
|
32900
32718
|
o = Ae.nodes(e, {
|
|
32901
32719
|
reverse: true,
|
|
32902
32720
|
pass: function pass(e) {
|
|
@@ -32905,12 +32723,12 @@ function requireLib() {
|
|
|
32905
32723
|
return !Ce.includes(t, r);
|
|
32906
32724
|
}
|
|
32907
32725
|
});
|
|
32908
|
-
var
|
|
32909
|
-
|
|
32726
|
+
var _iterator10 = _createForOfIteratorHelper(o),
|
|
32727
|
+
_step10;
|
|
32910
32728
|
try {
|
|
32911
|
-
for (
|
|
32912
|
-
var
|
|
32913
|
-
u =
|
|
32729
|
+
for (_iterator10.s(); !(_step10 = _iterator10.n()).done;) {
|
|
32730
|
+
var _step10$value = _slicedToArray(_step10.value, 2),
|
|
32731
|
+
u = _step10$value[1];
|
|
32914
32732
|
if (!Ce.includes(t, u)) {
|
|
32915
32733
|
var a = Ae.parent(e, u),
|
|
32916
32734
|
i = u[u.length - 1];
|
|
@@ -32926,9 +32744,9 @@ function requireLib() {
|
|
|
32926
32744
|
}
|
|
32927
32745
|
}
|
|
32928
32746
|
} catch (err) {
|
|
32929
|
-
|
|
32747
|
+
_iterator10.e(err);
|
|
32930
32748
|
} finally {
|
|
32931
|
-
|
|
32749
|
+
_iterator10.f();
|
|
32932
32750
|
}
|
|
32933
32751
|
Se.isEditor(e) && (e.selection = null);
|
|
32934
32752
|
}).children;
|
|
@@ -32980,40 +32798,39 @@ function requireLib() {
|
|
|
32980
32798
|
},
|
|
32981
32799
|
levels: function levels(e, t) {
|
|
32982
32800
|
var r = arguments.length > 2 && void 0 !== arguments[2] ? arguments[2] : {};
|
|
32983
|
-
return /*#__PURE__*/
|
|
32984
|
-
var
|
|
32985
|
-
return
|
|
32986
|
-
while (1) switch (_context6.
|
|
32801
|
+
return /*#__PURE__*/_regenerator().m(function _callee5() {
|
|
32802
|
+
var _iterator11, _step11, n, o, _t10;
|
|
32803
|
+
return _regenerator().w(function (_context6) {
|
|
32804
|
+
while (1) switch (_context6.p = _context6.n) {
|
|
32987
32805
|
case 0:
|
|
32988
|
-
|
|
32989
|
-
_context6.
|
|
32990
|
-
|
|
32806
|
+
_iterator11 = _createForOfIteratorHelper(ie.levels(t, r));
|
|
32807
|
+
_context6.p = 1;
|
|
32808
|
+
_iterator11.s();
|
|
32991
32809
|
case 2:
|
|
32992
|
-
if ((
|
|
32993
|
-
_context6.
|
|
32810
|
+
if ((_step11 = _iterator11.n()).done) {
|
|
32811
|
+
_context6.n = 4;
|
|
32994
32812
|
break;
|
|
32995
32813
|
}
|
|
32996
|
-
n =
|
|
32814
|
+
n = _step11.value;
|
|
32997
32815
|
o = Ae.get(e, n);
|
|
32998
|
-
_context6.
|
|
32816
|
+
_context6.n = 3;
|
|
32999
32817
|
return [o, n];
|
|
33000
32818
|
case 3:
|
|
33001
|
-
_context6.
|
|
32819
|
+
_context6.n = 2;
|
|
33002
32820
|
break;
|
|
33003
32821
|
case 4:
|
|
33004
|
-
_context6.
|
|
32822
|
+
_context6.n = 6;
|
|
33005
32823
|
break;
|
|
33006
32824
|
case 5:
|
|
33007
|
-
_context6.
|
|
33008
|
-
|
|
33009
|
-
|
|
32825
|
+
_context6.p = 5;
|
|
32826
|
+
_t10 = _context6.v;
|
|
32827
|
+
_iterator11.e(_t10);
|
|
33010
32828
|
case 6:
|
|
33011
|
-
_context6.
|
|
33012
|
-
|
|
33013
|
-
return _context6.
|
|
32829
|
+
_context6.p = 6;
|
|
32830
|
+
_iterator11.f();
|
|
32831
|
+
return _context6.f(6);
|
|
33014
32832
|
case 7:
|
|
33015
|
-
|
|
33016
|
-
return _context6.stop();
|
|
32833
|
+
return _context6.a(2);
|
|
33017
32834
|
}
|
|
33018
32835
|
}, _callee5, null, [[1, 5, 6, 7]]);
|
|
33019
32836
|
})();
|
|
@@ -33023,60 +32840,59 @@ function requireLib() {
|
|
|
33023
32840
|
},
|
|
33024
32841
|
nodes: function nodes(e) {
|
|
33025
32842
|
var t = arguments.length > 1 && void 0 !== arguments[1] ? arguments[1] : {};
|
|
33026
|
-
return /*#__PURE__*/
|
|
33027
|
-
var r, _t$reverse4, n, _t$from, o, u, a, i, s, l, c,
|
|
33028
|
-
return
|
|
33029
|
-
while (1) switch (_context7.
|
|
32843
|
+
return /*#__PURE__*/_regenerator().m(function _callee6() {
|
|
32844
|
+
var r, _t$reverse4, n, _t$from, o, u, a, i, s, l, c, _t11;
|
|
32845
|
+
return _regenerator().w(function (_context7) {
|
|
32846
|
+
while (1) switch (_context7.n) {
|
|
33030
32847
|
case 0:
|
|
33031
32848
|
r = t.pass, _t$reverse4 = t.reverse, n = _t$reverse4 === void 0 ? false : _t$reverse4, _t$from = t.from, o = _t$from === void 0 ? [] : _t$from, u = t.to, a = new Set(), i = [], s = e;
|
|
33032
32849
|
case 1:
|
|
33033
32850
|
if (!(!u || !(n ? ie.isBefore(i, u) : ie.isAfter(i, u)))) {
|
|
33034
|
-
_context7.
|
|
32851
|
+
_context7.n = 7;
|
|
33035
32852
|
break;
|
|
33036
32853
|
}
|
|
33037
|
-
|
|
33038
|
-
if (
|
|
33039
|
-
_context7.
|
|
32854
|
+
_t11 = a.has(s);
|
|
32855
|
+
if (_t11) {
|
|
32856
|
+
_context7.n = 2;
|
|
33040
32857
|
break;
|
|
33041
32858
|
}
|
|
33042
|
-
_context7.
|
|
32859
|
+
_context7.n = 2;
|
|
33043
32860
|
return [s, i];
|
|
33044
32861
|
case 2:
|
|
33045
32862
|
if (!(a.has(s) || Ve.isText(s) || 0 === s.children.length || null != r && false !== r([s, i]))) {
|
|
33046
|
-
_context7.
|
|
32863
|
+
_context7.n = 5;
|
|
33047
32864
|
break;
|
|
33048
32865
|
}
|
|
33049
32866
|
if (!(0 === i.length)) {
|
|
33050
|
-
_context7.
|
|
32867
|
+
_context7.n = 3;
|
|
33051
32868
|
break;
|
|
33052
32869
|
}
|
|
33053
|
-
return _context7.
|
|
32870
|
+
return _context7.a(3, 7);
|
|
33054
32871
|
case 3:
|
|
33055
32872
|
if (n) {
|
|
33056
|
-
_context7.
|
|
32873
|
+
_context7.n = 4;
|
|
33057
32874
|
break;
|
|
33058
32875
|
}
|
|
33059
32876
|
l = ie.next(i);
|
|
33060
32877
|
if (!Ae.has(e, l)) {
|
|
33061
|
-
_context7.
|
|
32878
|
+
_context7.n = 4;
|
|
33062
32879
|
break;
|
|
33063
32880
|
}
|
|
33064
32881
|
i = l, s = Ae.get(e, i);
|
|
33065
|
-
return _context7.
|
|
32882
|
+
return _context7.a(3, 6);
|
|
33066
32883
|
case 4:
|
|
33067
32884
|
n && 0 !== i[i.length - 1] ? (i = ie.previous(i), s = Ae.get(e, i)) : (i = ie.parent(i), s = Ae.get(e, i), a.add(s));
|
|
33068
|
-
_context7.
|
|
32885
|
+
_context7.n = 6;
|
|
33069
32886
|
break;
|
|
33070
32887
|
case 5:
|
|
33071
32888
|
a.add(s);
|
|
33072
32889
|
c = n ? s.children.length - 1 : 0;
|
|
33073
32890
|
ie.isAncestor(i, o) && (c = o[i.length]), i = i.concat(c), s = Ae.get(e, i);
|
|
33074
32891
|
case 6:
|
|
33075
|
-
_context7.
|
|
32892
|
+
_context7.n = 1;
|
|
33076
32893
|
break;
|
|
33077
32894
|
case 7:
|
|
33078
|
-
|
|
33079
|
-
return _context7.stop();
|
|
32895
|
+
return _context7.a(2);
|
|
33080
32896
|
}
|
|
33081
32897
|
}, _callee6);
|
|
33082
32898
|
})();
|
|
@@ -33092,44 +32908,43 @@ function requireLib() {
|
|
|
33092
32908
|
},
|
|
33093
32909
|
texts: function texts(e) {
|
|
33094
32910
|
var t = arguments.length > 1 && void 0 !== arguments[1] ? arguments[1] : {};
|
|
33095
|
-
return /*#__PURE__*/
|
|
33096
|
-
var
|
|
33097
|
-
return
|
|
33098
|
-
while (1) switch (_context8.
|
|
32911
|
+
return /*#__PURE__*/_regenerator().m(function _callee7() {
|
|
32912
|
+
var _iterator12, _step12, _step12$value, r, n, _t12, _t13;
|
|
32913
|
+
return _regenerator().w(function (_context8) {
|
|
32914
|
+
while (1) switch (_context8.p = _context8.n) {
|
|
33099
32915
|
case 0:
|
|
33100
|
-
|
|
33101
|
-
_context8.
|
|
33102
|
-
|
|
32916
|
+
_iterator12 = _createForOfIteratorHelper(Ae.nodes(e, t));
|
|
32917
|
+
_context8.p = 1;
|
|
32918
|
+
_iterator12.s();
|
|
33103
32919
|
case 2:
|
|
33104
|
-
if ((
|
|
33105
|
-
_context8.
|
|
32920
|
+
if ((_step12 = _iterator12.n()).done) {
|
|
32921
|
+
_context8.n = 4;
|
|
33106
32922
|
break;
|
|
33107
32923
|
}
|
|
33108
|
-
|
|
33109
|
-
|
|
33110
|
-
if (!
|
|
33111
|
-
_context8.
|
|
32924
|
+
_step12$value = _slicedToArray(_step12.value, 2), r = _step12$value[0], n = _step12$value[1];
|
|
32925
|
+
_t12 = Ve.isText(r);
|
|
32926
|
+
if (!_t12) {
|
|
32927
|
+
_context8.n = 3;
|
|
33112
32928
|
break;
|
|
33113
32929
|
}
|
|
33114
|
-
_context8.
|
|
32930
|
+
_context8.n = 3;
|
|
33115
32931
|
return [r, n];
|
|
33116
32932
|
case 3:
|
|
33117
|
-
_context8.
|
|
32933
|
+
_context8.n = 2;
|
|
33118
32934
|
break;
|
|
33119
32935
|
case 4:
|
|
33120
|
-
_context8.
|
|
32936
|
+
_context8.n = 6;
|
|
33121
32937
|
break;
|
|
33122
32938
|
case 5:
|
|
33123
|
-
_context8.
|
|
33124
|
-
|
|
33125
|
-
|
|
32939
|
+
_context8.p = 5;
|
|
32940
|
+
_t13 = _context8.v;
|
|
32941
|
+
_iterator12.e(_t13);
|
|
33126
32942
|
case 6:
|
|
33127
|
-
_context8.
|
|
33128
|
-
|
|
33129
|
-
return _context8.
|
|
32943
|
+
_context8.p = 6;
|
|
32944
|
+
_iterator12.f();
|
|
32945
|
+
return _context8.f(6);
|
|
33130
32946
|
case 7:
|
|
33131
|
-
|
|
33132
|
-
return _context8.stop();
|
|
32947
|
+
return _context8.a(2);
|
|
33133
32948
|
}
|
|
33134
32949
|
}, _callee7, null, [[1, 5, 6, 7]]);
|
|
33135
32950
|
})();
|
|
@@ -33593,30 +33408,30 @@ function requireLib() {
|
|
|
33593
33408
|
},
|
|
33594
33409
|
decorations: function decorations(e, t) {
|
|
33595
33410
|
var r = [Ie({}, e)];
|
|
33596
|
-
var
|
|
33597
|
-
|
|
33411
|
+
var _iterator13 = _createForOfIteratorHelper(t),
|
|
33412
|
+
_step13;
|
|
33598
33413
|
try {
|
|
33599
|
-
for (
|
|
33600
|
-
var n =
|
|
33414
|
+
for (_iterator13.s(); !(_step13 = _iterator13.n()).done;) {
|
|
33415
|
+
var n = _step13.value;
|
|
33601
33416
|
var _n5 = n,
|
|
33602
33417
|
o = _n5.anchor,
|
|
33603
33418
|
u = _n5.focus,
|
|
33604
33419
|
a = _n5.merge,
|
|
33605
33420
|
i = De(n, ze),
|
|
33606
|
-
_Ce$
|
|
33607
|
-
_Ce$
|
|
33608
|
-
s = _Ce$
|
|
33609
|
-
l = _Ce$
|
|
33421
|
+
_Ce$edges15 = Ce.edges(n),
|
|
33422
|
+
_Ce$edges16 = _slicedToArray(_Ce$edges15, 2),
|
|
33423
|
+
s = _Ce$edges16[0],
|
|
33424
|
+
l = _Ce$edges16[1],
|
|
33610
33425
|
c = [],
|
|
33611
33426
|
f = 0,
|
|
33612
33427
|
d = s.offset,
|
|
33613
33428
|
h = l.offset,
|
|
33614
33429
|
v = null != a ? a : Object.assign;
|
|
33615
|
-
var
|
|
33616
|
-
|
|
33430
|
+
var _iterator14 = _createForOfIteratorHelper(r),
|
|
33431
|
+
_step14;
|
|
33617
33432
|
try {
|
|
33618
|
-
for (
|
|
33619
|
-
var p =
|
|
33433
|
+
for (_iterator14.s(); !(_step14 = _iterator14.n()).done;) {
|
|
33434
|
+
var p = _step14.value;
|
|
33620
33435
|
var D = p.text.length,
|
|
33621
33436
|
g = f;
|
|
33622
33437
|
if (f += D, d <= g && f <= h) v(p, i), c.push(p);else if (d !== h && (d === f || h === g) || d > f || h < g || h === g && 0 !== g) c.push(p);else {
|
|
@@ -33643,16 +33458,16 @@ function requireLib() {
|
|
|
33643
33458
|
}
|
|
33644
33459
|
}
|
|
33645
33460
|
} catch (err) {
|
|
33646
|
-
|
|
33461
|
+
_iterator14.e(err);
|
|
33647
33462
|
} finally {
|
|
33648
|
-
|
|
33463
|
+
_iterator14.f();
|
|
33649
33464
|
}
|
|
33650
33465
|
r = c;
|
|
33651
33466
|
}
|
|
33652
33467
|
} catch (err) {
|
|
33653
|
-
|
|
33468
|
+
_iterator13.e(err);
|
|
33654
33469
|
} finally {
|
|
33655
|
-
|
|
33470
|
+
_iterator13.f();
|
|
33656
33471
|
}
|
|
33657
33472
|
return r;
|
|
33658
33473
|
}
|
|
@@ -33676,12 +33491,12 @@ function requireLib() {
|
|
|
33676
33491
|
u = We.None,
|
|
33677
33492
|
a = 0,
|
|
33678
33493
|
i = null;
|
|
33679
|
-
var
|
|
33680
|
-
|
|
33494
|
+
var _iterator15 = _createForOfIteratorHelper(n),
|
|
33495
|
+
_step15;
|
|
33681
33496
|
try {
|
|
33682
|
-
for (
|
|
33497
|
+
for (_iterator15.s(); !(_step15 = _iterator15.n()).done;) {
|
|
33683
33498
|
var _ref3, _ref4;
|
|
33684
|
-
var s =
|
|
33499
|
+
var s = _step15.value;
|
|
33685
33500
|
var l = s.codePointAt(0);
|
|
33686
33501
|
if (!l) break;
|
|
33687
33502
|
var c = lt(s, l);
|
|
@@ -33691,9 +33506,9 @@ function requireLib() {
|
|
|
33691
33506
|
a += s.length;
|
|
33692
33507
|
}
|
|
33693
33508
|
} catch (err) {
|
|
33694
|
-
|
|
33509
|
+
_iterator15.e(err);
|
|
33695
33510
|
} finally {
|
|
33696
|
-
|
|
33511
|
+
_iterator15.f();
|
|
33697
33512
|
}
|
|
33698
33513
|
return a || 1;
|
|
33699
33514
|
},
|
|
@@ -33720,42 +33535,41 @@ function requireLib() {
|
|
|
33720
33535
|
}
|
|
33721
33536
|
return !Ke.test(t);
|
|
33722
33537
|
},
|
|
33723
|
-
Ye = /*#__PURE__*/
|
|
33538
|
+
Ye = /*#__PURE__*/_regenerator().m(function Ye(e) {
|
|
33724
33539
|
var t, r, n, o;
|
|
33725
|
-
return
|
|
33726
|
-
while (1) switch (_context9.
|
|
33540
|
+
return _regenerator().w(function (_context9) {
|
|
33541
|
+
while (1) switch (_context9.n) {
|
|
33727
33542
|
case 0:
|
|
33728
33543
|
t = e.length - 1, r = 0;
|
|
33729
33544
|
case 1:
|
|
33730
33545
|
if (!(r < e.length)) {
|
|
33731
|
-
_context9.
|
|
33546
|
+
_context9.n = 5;
|
|
33732
33547
|
break;
|
|
33733
33548
|
}
|
|
33734
33549
|
n = e.charAt(t - r);
|
|
33735
33550
|
if (!Qe(n.charCodeAt(0))) {
|
|
33736
|
-
_context9.
|
|
33551
|
+
_context9.n = 3;
|
|
33737
33552
|
break;
|
|
33738
33553
|
}
|
|
33739
33554
|
o = e.charAt(t - r - 1);
|
|
33740
33555
|
if (!Ge(o.charCodeAt(0))) {
|
|
33741
|
-
_context9.
|
|
33556
|
+
_context9.n = 3;
|
|
33742
33557
|
break;
|
|
33743
33558
|
}
|
|
33744
|
-
_context9.
|
|
33559
|
+
_context9.n = 2;
|
|
33745
33560
|
return o + n;
|
|
33746
33561
|
case 2:
|
|
33747
33562
|
r++;
|
|
33748
|
-
return _context9.
|
|
33563
|
+
return _context9.a(3, 4);
|
|
33749
33564
|
case 3:
|
|
33750
|
-
_context9.
|
|
33565
|
+
_context9.n = 4;
|
|
33751
33566
|
return n;
|
|
33752
33567
|
case 4:
|
|
33753
33568
|
r++;
|
|
33754
|
-
_context9.
|
|
33569
|
+
_context9.n = 1;
|
|
33755
33570
|
break;
|
|
33756
33571
|
case 5:
|
|
33757
|
-
|
|
33758
|
-
return _context9.stop();
|
|
33572
|
+
return _context9.a(2);
|
|
33759
33573
|
}
|
|
33760
33574
|
}, Ye);
|
|
33761
33575
|
}),
|
|
@@ -33885,30 +33699,30 @@ function requireLib() {
|
|
|
33885
33699
|
}
|
|
33886
33700
|
};
|
|
33887
33701
|
if (r) {
|
|
33888
|
-
var
|
|
33889
|
-
|
|
33702
|
+
var _iterator16 = _createForOfIteratorHelper((n = [], o = new Set(), u)),
|
|
33703
|
+
_step16;
|
|
33890
33704
|
try {
|
|
33891
|
-
for (
|
|
33892
|
-
var s =
|
|
33705
|
+
for (_iterator16.s(); !(_step16 = _iterator16.n()).done;) {
|
|
33706
|
+
var s = _step16.value;
|
|
33893
33707
|
i(r(s));
|
|
33894
33708
|
}
|
|
33895
33709
|
} catch (err) {
|
|
33896
|
-
|
|
33710
|
+
_iterator16.e(err);
|
|
33897
33711
|
} finally {
|
|
33898
|
-
|
|
33712
|
+
_iterator16.f();
|
|
33899
33713
|
}
|
|
33900
33714
|
} else n = u, o = a;
|
|
33901
|
-
var
|
|
33902
|
-
|
|
33715
|
+
var _iterator17 = _createForOfIteratorHelper(t),
|
|
33716
|
+
_step17;
|
|
33903
33717
|
try {
|
|
33904
|
-
for (
|
|
33905
|
-
var l =
|
|
33718
|
+
for (_iterator17.s(); !(_step17 = _iterator17.n()).done;) {
|
|
33719
|
+
var l = _step17.value;
|
|
33906
33720
|
i(l);
|
|
33907
33721
|
}
|
|
33908
33722
|
} catch (err) {
|
|
33909
|
-
|
|
33723
|
+
_iterator17.e(err);
|
|
33910
33724
|
} finally {
|
|
33911
|
-
|
|
33725
|
+
_iterator17.f();
|
|
33912
33726
|
}
|
|
33913
33727
|
ee.set(e, n), te.set(e, o);
|
|
33914
33728
|
}
|
|
@@ -34115,41 +33929,41 @@ function requireLib() {
|
|
|
34115
33929
|
apply: function apply() {
|
|
34116
33930
|
for (var t = arguments.length, r = new Array(t), n = 0; n < t; n++) r[n] = arguments[n];
|
|
34117
33931
|
return function (e, t) {
|
|
34118
|
-
var
|
|
34119
|
-
|
|
33932
|
+
var _iterator18 = _createForOfIteratorHelper(Se.pathRefs(e)),
|
|
33933
|
+
_step18;
|
|
34120
33934
|
try {
|
|
34121
|
-
for (
|
|
34122
|
-
var r =
|
|
33935
|
+
for (_iterator18.s(); !(_step18 = _iterator18.n()).done;) {
|
|
33936
|
+
var r = _step18.value;
|
|
34123
33937
|
Y.transform(r, t);
|
|
34124
33938
|
}
|
|
34125
33939
|
} catch (err) {
|
|
34126
|
-
|
|
33940
|
+
_iterator18.e(err);
|
|
34127
33941
|
} finally {
|
|
34128
|
-
|
|
33942
|
+
_iterator18.f();
|
|
34129
33943
|
}
|
|
34130
|
-
var
|
|
34131
|
-
|
|
33944
|
+
var _iterator19 = _createForOfIteratorHelper(Se.pointRefs(e)),
|
|
33945
|
+
_step19;
|
|
34132
33946
|
try {
|
|
34133
|
-
for (
|
|
34134
|
-
var n =
|
|
33947
|
+
for (_iterator19.s(); !(_step19 = _iterator19.n()).done;) {
|
|
33948
|
+
var n = _step19.value;
|
|
34135
33949
|
G.transform(n, t);
|
|
34136
33950
|
}
|
|
34137
33951
|
} catch (err) {
|
|
34138
|
-
|
|
33952
|
+
_iterator19.e(err);
|
|
34139
33953
|
} finally {
|
|
34140
|
-
|
|
33954
|
+
_iterator19.f();
|
|
34141
33955
|
}
|
|
34142
|
-
var
|
|
34143
|
-
|
|
33956
|
+
var _iterator20 = _createForOfIteratorHelper(Se.rangeRefs(e)),
|
|
33957
|
+
_step20;
|
|
34144
33958
|
try {
|
|
34145
|
-
for (
|
|
34146
|
-
var o =
|
|
33959
|
+
for (_iterator20.s(); !(_step20 = _iterator20.n()).done;) {
|
|
33960
|
+
var o = _step20.value;
|
|
34147
33961
|
Q.transform(o, t);
|
|
34148
33962
|
}
|
|
34149
33963
|
} catch (err) {
|
|
34150
|
-
|
|
33964
|
+
_iterator20.e(err);
|
|
34151
33965
|
} finally {
|
|
34152
|
-
|
|
33966
|
+
_iterator20.f();
|
|
34153
33967
|
}
|
|
34154
33968
|
if (!function (e) {
|
|
34155
33969
|
return Bt.get(e) || false;
|
|
@@ -34278,9 +34092,9 @@ function requireLib() {
|
|
|
34278
34092
|
if (n || (u = Se.unhangRange(e, u, {
|
|
34279
34093
|
voids: o
|
|
34280
34094
|
})), Ce.isCollapsed(u)) u = u.anchor;else {
|
|
34281
|
-
var _Ce$
|
|
34282
|
-
_Ce$
|
|
34283
|
-
i = _Ce$
|
|
34095
|
+
var _Ce$edges17 = Ce.edges(u),
|
|
34096
|
+
_Ce$edges18 = _slicedToArray(_Ce$edges17, 2),
|
|
34097
|
+
i = _Ce$edges18[1];
|
|
34284
34098
|
if (!o && Se["void"](e, {
|
|
34285
34099
|
at: i
|
|
34286
34100
|
})) return;
|
|
@@ -34332,26 +34146,26 @@ function requireLib() {
|
|
|
34332
34146
|
C = _Ae$last2[1],
|
|
34333
34147
|
y = [],
|
|
34334
34148
|
B = function B(t) {
|
|
34335
|
-
var
|
|
34336
|
-
r =
|
|
34337
|
-
n =
|
|
34149
|
+
var _t14 = _slicedToArray(t, 2),
|
|
34150
|
+
r = _t14[0],
|
|
34151
|
+
n = _t14[1];
|
|
34338
34152
|
return !(0 === n.length || !p && (D && ie.isAncestor(n, m) && Be.isElement(r) && !e.isVoid(r) && !e.isInline(r) || g && ie.isAncestor(n, C) && Be.isElement(r) && !e.isVoid(r) && !e.isInline(r)));
|
|
34339
34153
|
};
|
|
34340
|
-
var
|
|
34154
|
+
var _iterator21 = _createForOfIteratorHelper(Ae.nodes({
|
|
34341
34155
|
children: t
|
|
34342
34156
|
}, {
|
|
34343
34157
|
pass: B
|
|
34344
34158
|
})),
|
|
34345
|
-
|
|
34159
|
+
_step21;
|
|
34346
34160
|
try {
|
|
34347
|
-
for (
|
|
34348
|
-
var b =
|
|
34161
|
+
for (_iterator21.s(); !(_step21 = _iterator21.n()).done;) {
|
|
34162
|
+
var b = _step21.value;
|
|
34349
34163
|
B(b) && y.push(b);
|
|
34350
34164
|
}
|
|
34351
34165
|
} catch (err) {
|
|
34352
|
-
|
|
34166
|
+
_iterator21.e(err);
|
|
34353
34167
|
} finally {
|
|
34354
|
-
|
|
34168
|
+
_iterator21.f();
|
|
34355
34169
|
}
|
|
34356
34170
|
var E = [],
|
|
34357
34171
|
w = [],
|
|
@@ -34466,9 +34280,9 @@ function requireLib() {
|
|
|
34466
34280
|
normalizeNode: function normalizeNode() {
|
|
34467
34281
|
for (var t = arguments.length, r = new Array(t), n = 0; n < t; n++) r[n] = arguments[n];
|
|
34468
34282
|
return function (e, t) {
|
|
34469
|
-
var
|
|
34470
|
-
r =
|
|
34471
|
-
n =
|
|
34283
|
+
var _t15 = _slicedToArray(t, 2),
|
|
34284
|
+
r = _t15[0],
|
|
34285
|
+
n = _t15[1];
|
|
34472
34286
|
if (!Ve.isText(r)) if (Be.isElement(r) && 0 === r.children.length) yt.insertNodes(e, {
|
|
34473
34287
|
text: ""
|
|
34474
34288
|
}, {
|
|
@@ -34589,31 +34403,31 @@ function requireLib() {
|
|
|
34589
34403
|
if (ie.equals(s, l)) return [];
|
|
34590
34404
|
var c = [],
|
|
34591
34405
|
f = [];
|
|
34592
|
-
var
|
|
34593
|
-
|
|
34406
|
+
var _iterator22 = _createForOfIteratorHelper(ie.ancestors(s)),
|
|
34407
|
+
_step22;
|
|
34594
34408
|
try {
|
|
34595
|
-
for (
|
|
34596
|
-
var d =
|
|
34409
|
+
for (_iterator22.s(); !(_step22 = _iterator22.n()).done;) {
|
|
34410
|
+
var d = _step22.value;
|
|
34597
34411
|
var h = ie.transform(d, t);
|
|
34598
34412
|
c.push(h);
|
|
34599
34413
|
}
|
|
34600
34414
|
} catch (err) {
|
|
34601
|
-
|
|
34415
|
+
_iterator22.e(err);
|
|
34602
34416
|
} finally {
|
|
34603
|
-
|
|
34417
|
+
_iterator22.f();
|
|
34604
34418
|
}
|
|
34605
|
-
var
|
|
34606
|
-
|
|
34419
|
+
var _iterator23 = _createForOfIteratorHelper(ie.ancestors(l)),
|
|
34420
|
+
_step23;
|
|
34607
34421
|
try {
|
|
34608
|
-
for (
|
|
34609
|
-
var v =
|
|
34422
|
+
for (_iterator23.s(); !(_step23 = _iterator23.n()).done;) {
|
|
34423
|
+
var v = _step23.value;
|
|
34610
34424
|
var p = ie.transform(v, t);
|
|
34611
34425
|
f.push(p);
|
|
34612
34426
|
}
|
|
34613
34427
|
} catch (err) {
|
|
34614
|
-
|
|
34428
|
+
_iterator23.e(err);
|
|
34615
34429
|
} finally {
|
|
34616
|
-
|
|
34430
|
+
_iterator23.f();
|
|
34617
34431
|
}
|
|
34618
34432
|
var D = f[f.length - 1],
|
|
34619
34433
|
g = l[l.length - 1],
|
|
@@ -34654,26 +34468,26 @@ function requireLib() {
|
|
|
34654
34468
|
if (o) {
|
|
34655
34469
|
var a = Se.path(e, o),
|
|
34656
34470
|
i = "lowest" === n;
|
|
34657
|
-
var
|
|
34471
|
+
var _iterator24 = _createForOfIteratorHelper(Se.levels(e, {
|
|
34658
34472
|
at: a,
|
|
34659
34473
|
voids: r,
|
|
34660
34474
|
match: u,
|
|
34661
34475
|
reverse: i
|
|
34662
34476
|
})),
|
|
34663
|
-
|
|
34477
|
+
_step24;
|
|
34664
34478
|
try {
|
|
34665
|
-
for (
|
|
34666
|
-
var
|
|
34667
|
-
s =
|
|
34668
|
-
l =
|
|
34479
|
+
for (_iterator24.s(); !(_step24 = _iterator24.n()).done;) {
|
|
34480
|
+
var _step24$value = _slicedToArray(_step24.value, 2),
|
|
34481
|
+
s = _step24$value[0],
|
|
34482
|
+
l = _step24$value[1];
|
|
34669
34483
|
if (!Ve.isText(s)) if (Ce.isRange(o)) {
|
|
34670
34484
|
if (ie.isAncestor(l, o.anchor.path) && ie.isAncestor(l, o.focus.path)) return [s, l];
|
|
34671
34485
|
} else if (!ie.equals(a, l)) return [s, l];
|
|
34672
34486
|
}
|
|
34673
34487
|
} catch (err) {
|
|
34674
|
-
|
|
34488
|
+
_iterator24.e(err);
|
|
34675
34489
|
} finally {
|
|
34676
|
-
|
|
34490
|
+
_iterator24.f();
|
|
34677
34491
|
}
|
|
34678
34492
|
}
|
|
34679
34493
|
}.apply(void 0, [e].concat(r));
|
|
@@ -34692,20 +34506,20 @@ function requireLib() {
|
|
|
34692
34506
|
_n$distance = n.distance,
|
|
34693
34507
|
u = _n$distance === void 0 ? 1 : _n$distance,
|
|
34694
34508
|
a = 0;
|
|
34695
|
-
var
|
|
34509
|
+
var _iterator25 = _createForOfIteratorHelper(Se.positions(e, Ft(Ft({}, n), {}, {
|
|
34696
34510
|
at: o
|
|
34697
34511
|
}))),
|
|
34698
|
-
|
|
34512
|
+
_step25;
|
|
34699
34513
|
try {
|
|
34700
|
-
for (
|
|
34701
|
-
var i =
|
|
34514
|
+
for (_iterator25.s(); !(_step25 = _iterator25.n()).done;) {
|
|
34515
|
+
var i = _step25.value;
|
|
34702
34516
|
if (a > u) break;
|
|
34703
34517
|
0 !== a && (r = i), a++;
|
|
34704
34518
|
}
|
|
34705
34519
|
} catch (err) {
|
|
34706
|
-
|
|
34520
|
+
_iterator25.e(err);
|
|
34707
34521
|
} finally {
|
|
34708
|
-
|
|
34522
|
+
_iterator25.f();
|
|
34709
34523
|
}
|
|
34710
34524
|
return r;
|
|
34711
34525
|
}.apply(void 0, [e].concat(r));
|
|
@@ -34724,21 +34538,21 @@ function requireLib() {
|
|
|
34724
34538
|
_n$distance2 = n.distance,
|
|
34725
34539
|
u = _n$distance2 === void 0 ? 1 : _n$distance2,
|
|
34726
34540
|
a = 0;
|
|
34727
|
-
var
|
|
34541
|
+
var _iterator26 = _createForOfIteratorHelper(Se.positions(e, xt(xt({}, n), {}, {
|
|
34728
34542
|
at: o,
|
|
34729
34543
|
reverse: true
|
|
34730
34544
|
}))),
|
|
34731
|
-
|
|
34545
|
+
_step26;
|
|
34732
34546
|
try {
|
|
34733
|
-
for (
|
|
34734
|
-
var i =
|
|
34547
|
+
for (_iterator26.s(); !(_step26 = _iterator26.n()).done;) {
|
|
34548
|
+
var i = _step26.value;
|
|
34735
34549
|
if (a > u) break;
|
|
34736
34550
|
0 !== a && (r = i), a++;
|
|
34737
34551
|
}
|
|
34738
34552
|
} catch (err) {
|
|
34739
|
-
|
|
34553
|
+
_iterator26.e(err);
|
|
34740
34554
|
} finally {
|
|
34741
|
-
|
|
34555
|
+
_iterator26.f();
|
|
34742
34556
|
}
|
|
34743
34557
|
return r;
|
|
34744
34558
|
}.apply(void 0, [e].concat(r));
|
|
@@ -34751,14 +34565,14 @@ function requireLib() {
|
|
|
34751
34565
|
r = _t$edge === void 0 ? "anchor" : _t$edge,
|
|
34752
34566
|
n = e.selection;
|
|
34753
34567
|
if (n) if ("anchor" === r) yt.select(e, n.anchor);else if ("focus" === r) yt.select(e, n.focus);else if ("start" === r) {
|
|
34754
|
-
var _Ce$
|
|
34755
|
-
_Ce$
|
|
34756
|
-
o = _Ce$
|
|
34568
|
+
var _Ce$edges19 = Ce.edges(n),
|
|
34569
|
+
_Ce$edges20 = _slicedToArray(_Ce$edges19, 1),
|
|
34570
|
+
o = _Ce$edges20[0];
|
|
34757
34571
|
yt.select(e, o);
|
|
34758
34572
|
} else if ("end" === r) {
|
|
34759
|
-
var _Ce$
|
|
34760
|
-
_Ce$
|
|
34761
|
-
u = _Ce$
|
|
34573
|
+
var _Ce$edges21 = Ce.edges(n),
|
|
34574
|
+
_Ce$edges22 = _slicedToArray(_Ce$edges21, 2),
|
|
34575
|
+
u = _Ce$edges22[1];
|
|
34762
34576
|
yt.select(e, u);
|
|
34763
34577
|
}
|
|
34764
34578
|
}.apply(void 0, [e].concat(r));
|
|
@@ -34809,18 +34623,18 @@ function requireLib() {
|
|
|
34809
34623
|
voids: i
|
|
34810
34624
|
});else if (!Ce.isCollapsed(s)) {
|
|
34811
34625
|
if (!l) {
|
|
34812
|
-
var _Ce$
|
|
34813
|
-
_Ce$
|
|
34814
|
-
v = _Ce$
|
|
34626
|
+
var _Ce$edges23 = Ce.edges(s),
|
|
34627
|
+
_Ce$edges24 = _slicedToArray(_Ce$edges23, 2),
|
|
34628
|
+
v = _Ce$edges24[1],
|
|
34815
34629
|
p = Se.end(e, []);
|
|
34816
34630
|
Me.equals(v, p) || (s = Se.unhangRange(e, s, {
|
|
34817
34631
|
voids: i
|
|
34818
34632
|
}));
|
|
34819
34633
|
}
|
|
34820
|
-
var _Ce$
|
|
34821
|
-
_Ce$
|
|
34822
|
-
D = _Ce$
|
|
34823
|
-
g = _Ce$
|
|
34634
|
+
var _Ce$edges25 = Ce.edges(s),
|
|
34635
|
+
_Ce$edges26 = _slicedToArray(_Ce$edges25, 2),
|
|
34636
|
+
D = _Ce$edges26[0],
|
|
34637
|
+
g = _Ce$edges26[1],
|
|
34824
34638
|
m = Se.above(e, {
|
|
34825
34639
|
match: function match(t) {
|
|
34826
34640
|
return Be.isElement(t) && Se.isBlock(e, t);
|
|
@@ -34861,14 +34675,14 @@ function requireLib() {
|
|
|
34861
34675
|
}
|
|
34862
34676
|
var F,
|
|
34863
34677
|
O = [];
|
|
34864
|
-
var
|
|
34678
|
+
var _iterator27 = _createForOfIteratorHelper(Se.nodes(e, {
|
|
34865
34679
|
at: s,
|
|
34866
34680
|
voids: i
|
|
34867
34681
|
})),
|
|
34868
|
-
|
|
34682
|
+
_step27;
|
|
34869
34683
|
try {
|
|
34870
|
-
for (
|
|
34871
|
-
var x =
|
|
34684
|
+
for (_iterator27.s(); !(_step27 = _iterator27.n()).done;) {
|
|
34685
|
+
var x = _step27.value;
|
|
34872
34686
|
var _x = x,
|
|
34873
34687
|
_x2 = _slicedToArray(_x, 2),
|
|
34874
34688
|
P = _x2[0],
|
|
@@ -34876,13 +34690,13 @@ function requireLib() {
|
|
|
34876
34690
|
F && 0 === ie.compare(S, F) || (!i && Be.isElement(P) && (Se.isVoid(e, P) || Se.isElementReadOnly(e, P)) || !ie.isCommon(S, D.path) && !ie.isCommon(S, g.path)) && (O.push(x), F = S);
|
|
34877
34691
|
}
|
|
34878
34692
|
} catch (err) {
|
|
34879
|
-
|
|
34693
|
+
_iterator27.e(err);
|
|
34880
34694
|
} finally {
|
|
34881
|
-
|
|
34695
|
+
_iterator27.f();
|
|
34882
34696
|
}
|
|
34883
34697
|
var k = Array.from(O, function (t) {
|
|
34884
|
-
var
|
|
34885
|
-
r =
|
|
34698
|
+
var _t16 = _slicedToArray(t, 2),
|
|
34699
|
+
r = _t16[1];
|
|
34886
34700
|
return Se.pathRef(e, r);
|
|
34887
34701
|
}),
|
|
34888
34702
|
j = Se.pointRef(e, D),
|
|
@@ -35106,15 +34920,15 @@ function requireLib() {
|
|
|
35106
34920
|
s = r.match,
|
|
35107
34921
|
l = r.select;
|
|
35108
34922
|
if (Ae.isNode(t) && (t = [t]), 0 !== t.length) {
|
|
35109
|
-
var
|
|
35110
|
-
|
|
35111
|
-
c =
|
|
34923
|
+
var _t17 = t,
|
|
34924
|
+
_t18 = _slicedToArray(_t17, 1),
|
|
34925
|
+
c = _t18[0];
|
|
35112
34926
|
if (i || (i = qe(e), false !== l && (l = true)), null == l && (l = false), Ce.isRange(i)) if (n || (i = Se.unhangRange(e, i, {
|
|
35113
34927
|
voids: o
|
|
35114
34928
|
})), Ce.isCollapsed(i)) i = i.anchor;else {
|
|
35115
|
-
var _Ce$
|
|
35116
|
-
_Ce$
|
|
35117
|
-
f = _Ce$
|
|
34929
|
+
var _Ce$edges27 = Ce.edges(i),
|
|
34930
|
+
_Ce$edges28 = _slicedToArray(_Ce$edges27, 2),
|
|
34931
|
+
f = _Ce$edges28[1],
|
|
35118
34932
|
d = Se.pointRef(e, f);
|
|
35119
34933
|
yt["delete"](e, {
|
|
35120
34934
|
at: i
|
|
@@ -35181,17 +34995,17 @@ function requireLib() {
|
|
|
35181
34995
|
return t.concat(r);
|
|
35182
34996
|
}))) : B.push(t);
|
|
35183
34997
|
};
|
|
35184
|
-
var
|
|
35185
|
-
|
|
34998
|
+
var _iterator28 = _createForOfIteratorHelper(t),
|
|
34999
|
+
_step28;
|
|
35186
35000
|
try {
|
|
35187
|
-
for (
|
|
35188
|
-
var n =
|
|
35001
|
+
for (_iterator28.s(); !(_step28 = _iterator28.n()).done;) {
|
|
35002
|
+
var n = _step28.value;
|
|
35189
35003
|
r();
|
|
35190
35004
|
}
|
|
35191
35005
|
} catch (err) {
|
|
35192
|
-
|
|
35006
|
+
_iterator28.e(err);
|
|
35193
35007
|
} finally {
|
|
35194
|
-
|
|
35008
|
+
_iterator28.f();
|
|
35195
35009
|
}
|
|
35196
35010
|
}, function () {
|
|
35197
35011
|
bt(e, B, function (e) {
|
|
@@ -35204,11 +35018,11 @@ function requireLib() {
|
|
|
35204
35018
|
});
|
|
35205
35019
|
});
|
|
35206
35020
|
} else {
|
|
35207
|
-
var
|
|
35208
|
-
|
|
35021
|
+
var _iterator29 = _createForOfIteratorHelper(t),
|
|
35022
|
+
_step29;
|
|
35209
35023
|
try {
|
|
35210
|
-
for (
|
|
35211
|
-
var b =
|
|
35024
|
+
for (_iterator29.s(); !(_step29 = _iterator29.n()).done;) {
|
|
35025
|
+
var b = _step29.value;
|
|
35212
35026
|
var E = m.concat(C);
|
|
35213
35027
|
C++, e.apply({
|
|
35214
35028
|
type: "insert_node",
|
|
@@ -35217,9 +35031,9 @@ function requireLib() {
|
|
|
35217
35031
|
}), i = ie.next(i);
|
|
35218
35032
|
}
|
|
35219
35033
|
} catch (err) {
|
|
35220
|
-
|
|
35034
|
+
_iterator29.e(err);
|
|
35221
35035
|
} finally {
|
|
35222
|
-
|
|
35036
|
+
_iterator29.f();
|
|
35223
35037
|
}
|
|
35224
35038
|
}
|
|
35225
35039
|
if (i = ie.previous(i), l) {
|
|
@@ -35295,53 +35109,52 @@ function requireLib() {
|
|
|
35295
35109
|
for (var t = arguments.length, r = new Array(t), n = 0; n < t; n++) r[n] = arguments[n];
|
|
35296
35110
|
return function (e) {
|
|
35297
35111
|
var t = arguments.length > 1 && void 0 !== arguments[1] ? arguments[1] : {};
|
|
35298
|
-
return /*#__PURE__*/
|
|
35299
|
-
var _t$at3, r, _t$reverse6, n, _t$voids3, o, u, a, i,
|
|
35300
|
-
return
|
|
35301
|
-
while (1) switch (
|
|
35112
|
+
return /*#__PURE__*/_regenerator().m(function _callee8() {
|
|
35113
|
+
var _t$at3, r, _t$reverse6, n, _t$voids3, o, u, a, i, _iterator30, _step30, _step30$value, s, l, _t19;
|
|
35114
|
+
return _regenerator().w(function (_context0) {
|
|
35115
|
+
while (1) switch (_context0.p = _context0.n) {
|
|
35302
35116
|
case 0:
|
|
35303
35117
|
_t$at3 = t.at, r = _t$at3 === void 0 ? e.selection : _t$at3, _t$reverse6 = t.reverse, n = _t$reverse6 === void 0 ? false : _t$reverse6, _t$voids3 = t.voids, o = _t$voids3 === void 0 ? false : _t$voids3, u = t.match;
|
|
35304
35118
|
if (!(null == u && (u = function u() {
|
|
35305
35119
|
return true;
|
|
35306
35120
|
}), r)) {
|
|
35307
|
-
|
|
35121
|
+
_context0.n = 8;
|
|
35308
35122
|
break;
|
|
35309
35123
|
}
|
|
35310
35124
|
a = [], i = Se.path(e, r);
|
|
35311
|
-
|
|
35312
|
-
|
|
35313
|
-
|
|
35125
|
+
_iterator30 = _createForOfIteratorHelper(Ae.levels(e, i));
|
|
35126
|
+
_context0.p = 1;
|
|
35127
|
+
_iterator30.s();
|
|
35314
35128
|
case 2:
|
|
35315
|
-
if ((
|
|
35316
|
-
|
|
35129
|
+
if ((_step30 = _iterator30.n()).done) {
|
|
35130
|
+
_context0.n = 4;
|
|
35317
35131
|
break;
|
|
35318
35132
|
}
|
|
35319
|
-
|
|
35133
|
+
_step30$value = _slicedToArray(_step30.value, 2), s = _step30$value[0], l = _step30$value[1];
|
|
35320
35134
|
if (!(u(s, l) && (a.push([s, l]), !o && Be.isElement(s) && Se.isVoid(e, s)))) {
|
|
35321
|
-
|
|
35135
|
+
_context0.n = 3;
|
|
35322
35136
|
break;
|
|
35323
35137
|
}
|
|
35324
|
-
return
|
|
35138
|
+
return _context0.a(3, 4);
|
|
35325
35139
|
case 3:
|
|
35326
|
-
|
|
35140
|
+
_context0.n = 2;
|
|
35327
35141
|
break;
|
|
35328
35142
|
case 4:
|
|
35329
|
-
|
|
35143
|
+
_context0.n = 6;
|
|
35330
35144
|
break;
|
|
35331
35145
|
case 5:
|
|
35332
|
-
|
|
35333
|
-
|
|
35334
|
-
|
|
35146
|
+
_context0.p = 5;
|
|
35147
|
+
_t19 = _context0.v;
|
|
35148
|
+
_iterator30.e(_t19);
|
|
35335
35149
|
case 6:
|
|
35336
|
-
|
|
35337
|
-
|
|
35338
|
-
return
|
|
35150
|
+
_context0.p = 6;
|
|
35151
|
+
_iterator30.f();
|
|
35152
|
+
return _context0.f(6);
|
|
35339
35153
|
case 7:
|
|
35340
35154
|
n && a.reverse();
|
|
35341
|
-
return
|
|
35155
|
+
return _context0.d(_regeneratorValues(a), 8);
|
|
35342
35156
|
case 8:
|
|
35343
|
-
|
|
35344
|
-
return _context10.stop();
|
|
35157
|
+
return _context0.a(2);
|
|
35345
35158
|
}
|
|
35346
35159
|
}, _callee8, null, [[1, 5, 6, 7]]);
|
|
35347
35160
|
})();
|
|
@@ -35369,8 +35182,8 @@ function requireLib() {
|
|
|
35369
35182
|
voids: o
|
|
35370
35183
|
}),
|
|
35371
35184
|
i = Array.from(a, function (t) {
|
|
35372
|
-
var
|
|
35373
|
-
r =
|
|
35185
|
+
var _t20 = _slicedToArray(t, 2),
|
|
35186
|
+
r = _t20[1];
|
|
35374
35187
|
return Se.pathRef(e, r);
|
|
35375
35188
|
});
|
|
35376
35189
|
for (var _i5 = 0, _i4 = i; _i5 < _i4.length; _i5++) {
|
|
@@ -35439,8 +35252,8 @@ function requireLib() {
|
|
|
35439
35252
|
if (n) {
|
|
35440
35253
|
if (null == r) if (ie.isPath(n)) {
|
|
35441
35254
|
var _Se$parent9 = Se.parent(e, n),
|
|
35442
|
-
_Se$
|
|
35443
|
-
i = _Se$
|
|
35255
|
+
_Se$parent0 = _slicedToArray(_Se$parent9, 1),
|
|
35256
|
+
i = _Se$parent0[0];
|
|
35444
35257
|
r = function r(e) {
|
|
35445
35258
|
return i.children.includes(e);
|
|
35446
35259
|
};
|
|
@@ -35450,9 +35263,9 @@ function requireLib() {
|
|
|
35450
35263
|
if (!o && Ce.isRange(n) && (n = Se.unhangRange(e, n, {
|
|
35451
35264
|
voids: u
|
|
35452
35265
|
})), Ce.isRange(n)) if (Ce.isCollapsed(n)) n = n.anchor;else {
|
|
35453
|
-
var _Ce$
|
|
35454
|
-
_Ce$
|
|
35455
|
-
s = _Ce$
|
|
35266
|
+
var _Ce$edges29 = Ce.edges(n),
|
|
35267
|
+
_Ce$edges30 = _slicedToArray(_Ce$edges29, 2),
|
|
35268
|
+
s = _Ce$edges30[1],
|
|
35456
35269
|
l = Se.pointRef(e, s);
|
|
35457
35270
|
yt["delete"](e, {
|
|
35458
35271
|
at: n
|
|
@@ -35588,8 +35401,8 @@ function requireLib() {
|
|
|
35588
35401
|
voids: u
|
|
35589
35402
|
}),
|
|
35590
35403
|
l = Array.from(s, function (t) {
|
|
35591
|
-
var
|
|
35592
|
-
r =
|
|
35404
|
+
var _t21 = _slicedToArray(t, 2),
|
|
35405
|
+
r = _t21[1];
|
|
35593
35406
|
return Se.pathRef(e, r);
|
|
35594
35407
|
});
|
|
35595
35408
|
for (var _i6 = 0, _l2 = l; _i6 < _l2.length; _i6++) {
|
|
@@ -35629,9 +35442,9 @@ function requireLib() {
|
|
|
35629
35442
|
s = [a.path, i];
|
|
35630
35443
|
if (ie.isPath(u) && 0 === u.length) throw new Error("Cannot get the next node from the root node!");
|
|
35631
35444
|
if (null == o) if (ie.isPath(u)) {
|
|
35632
|
-
var _Se$
|
|
35633
|
-
_Se$
|
|
35634
|
-
l = _Se$
|
|
35445
|
+
var _Se$parent1 = Se.parent(e, u),
|
|
35446
|
+
_Se$parent10 = _slicedToArray(_Se$parent1, 1),
|
|
35447
|
+
l = _Se$parent10[0];
|
|
35635
35448
|
o = function o(e) {
|
|
35636
35449
|
return l.children.includes(e);
|
|
35637
35450
|
};
|
|
@@ -35644,8 +35457,8 @@ function requireLib() {
|
|
|
35644
35457
|
mode: r,
|
|
35645
35458
|
voids: n
|
|
35646
35459
|
}),
|
|
35647
|
-
_Se$
|
|
35648
|
-
c = _Se$
|
|
35460
|
+
_Se$nodes0 = _slicedToArray(_Se$nodes9, 1),
|
|
35461
|
+
c = _Se$nodes0[0];
|
|
35649
35462
|
return c;
|
|
35650
35463
|
}
|
|
35651
35464
|
}
|
|
@@ -35663,16 +35476,16 @@ function requireLib() {
|
|
|
35663
35476
|
for (var t = arguments.length, r = new Array(t), n = 0; n < t; n++) r[n] = arguments[n];
|
|
35664
35477
|
return function (e) {
|
|
35665
35478
|
var t = arguments.length > 1 && void 0 !== arguments[1] ? arguments[1] : {};
|
|
35666
|
-
return /*#__PURE__*/
|
|
35667
|
-
var _t$at8, r, _t$mode6, n, _t$universal, o, _t$reverse8, u, _t$voids8, a, _t$ignoreNonSelectabl, i, s, l, c, f, d, h, v, p,
|
|
35668
|
-
return
|
|
35669
|
-
while (1) switch (
|
|
35479
|
+
return /*#__PURE__*/_regenerator().m(function _callee9() {
|
|
35480
|
+
var _t$at8, r, _t$mode6, n, _t$universal, o, _t$reverse8, u, _t$voids8, a, _t$ignoreNonSelectabl, i, s, l, c, f, d, h, v, p, _iterator31, _step31, _step31$value, D, g, m, C, _t23, _t24, _t25, _t26;
|
|
35481
|
+
return _regenerator().w(function (_context1) {
|
|
35482
|
+
while (1) switch (_context1.p = _context1.n) {
|
|
35670
35483
|
case 0:
|
|
35671
35484
|
_t$at8 = t.at, r = _t$at8 === void 0 ? e.selection : _t$at8, _t$mode6 = t.mode, n = _t$mode6 === void 0 ? "all" : _t$mode6, _t$universal = t.universal, o = _t$universal === void 0 ? false : _t$universal, _t$reverse8 = t.reverse, u = _t$reverse8 === void 0 ? false : _t$reverse8, _t$voids8 = t.voids, a = _t$voids8 === void 0 ? false : _t$voids8, _t$ignoreNonSelectabl = t.ignoreNonSelectable, i = _t$ignoreNonSelectabl === void 0 ? false : _t$ignoreNonSelectabl, s = t.match;
|
|
35672
35485
|
if (!(s || (s = function s() {
|
|
35673
35486
|
return true;
|
|
35674
35487
|
}), r)) {
|
|
35675
|
-
|
|
35488
|
+
_context1.n = 15;
|
|
35676
35489
|
break;
|
|
35677
35490
|
}
|
|
35678
35491
|
if (ke(r)) l = r[0], c = r[1];else {
|
|
@@ -35688,108 +35501,107 @@ function requireLib() {
|
|
|
35688
35501
|
from: l,
|
|
35689
35502
|
to: c,
|
|
35690
35503
|
pass: function pass(t) {
|
|
35691
|
-
var
|
|
35692
|
-
r =
|
|
35504
|
+
var _t22 = _slicedToArray(t, 1),
|
|
35505
|
+
r = _t22[0];
|
|
35693
35506
|
return !(!Be.isElement(r) || (a || !Se.isVoid(e, r) && !Se.isElementReadOnly(e, r)) && (!i || Se.isSelectable(e, r)));
|
|
35694
35507
|
}
|
|
35695
35508
|
}), p = [];
|
|
35696
|
-
|
|
35697
|
-
|
|
35698
|
-
|
|
35509
|
+
_iterator31 = _createForOfIteratorHelper(v);
|
|
35510
|
+
_context1.p = 1;
|
|
35511
|
+
_iterator31.s();
|
|
35699
35512
|
case 2:
|
|
35700
|
-
if ((
|
|
35701
|
-
|
|
35513
|
+
if ((_step31 = _iterator31.n()).done) {
|
|
35514
|
+
_context1.n = 9;
|
|
35702
35515
|
break;
|
|
35703
35516
|
}
|
|
35704
|
-
|
|
35517
|
+
_step31$value = _slicedToArray(_step31.value, 2), D = _step31$value[0], g = _step31$value[1];
|
|
35705
35518
|
if (!(!i || !Be.isElement(D) || Se.isSelectable(e, D))) {
|
|
35706
|
-
|
|
35519
|
+
_context1.n = 8;
|
|
35707
35520
|
break;
|
|
35708
35521
|
}
|
|
35709
35522
|
m = h && 0 === ie.compare(g, h[1]);
|
|
35710
35523
|
if (!("highest" !== n || !m)) {
|
|
35711
|
-
|
|
35524
|
+
_context1.n = 8;
|
|
35712
35525
|
break;
|
|
35713
35526
|
}
|
|
35714
35527
|
if (!s(D, g)) {
|
|
35715
|
-
|
|
35528
|
+
_context1.n = 7;
|
|
35716
35529
|
break;
|
|
35717
35530
|
}
|
|
35718
35531
|
if (!("lowest" === n && m)) {
|
|
35719
|
-
|
|
35532
|
+
_context1.n = 3;
|
|
35720
35533
|
break;
|
|
35721
35534
|
}
|
|
35722
35535
|
h = [D, g];
|
|
35723
|
-
|
|
35536
|
+
_context1.n = 6;
|
|
35724
35537
|
break;
|
|
35725
35538
|
case 3:
|
|
35726
35539
|
C = "lowest" === n ? h : [D, g];
|
|
35727
|
-
|
|
35728
|
-
if (!
|
|
35729
|
-
|
|
35540
|
+
_t23 = C;
|
|
35541
|
+
if (!_t23) {
|
|
35542
|
+
_context1.n = 5;
|
|
35730
35543
|
break;
|
|
35731
35544
|
}
|
|
35732
35545
|
if (!o) {
|
|
35733
|
-
|
|
35546
|
+
_context1.n = 4;
|
|
35734
35547
|
break;
|
|
35735
35548
|
}
|
|
35736
35549
|
p.push(C);
|
|
35737
|
-
|
|
35550
|
+
_context1.n = 5;
|
|
35738
35551
|
break;
|
|
35739
35552
|
case 4:
|
|
35740
|
-
|
|
35553
|
+
_context1.n = 5;
|
|
35741
35554
|
return C;
|
|
35742
35555
|
case 5:
|
|
35743
35556
|
h = [D, g];
|
|
35744
35557
|
case 6:
|
|
35745
|
-
|
|
35558
|
+
_context1.n = 8;
|
|
35746
35559
|
break;
|
|
35747
35560
|
case 7:
|
|
35748
35561
|
if (!(o && !m && Ve.isText(D))) {
|
|
35749
|
-
|
|
35562
|
+
_context1.n = 8;
|
|
35750
35563
|
break;
|
|
35751
35564
|
}
|
|
35752
|
-
return
|
|
35565
|
+
return _context1.a(2);
|
|
35753
35566
|
case 8:
|
|
35754
|
-
|
|
35567
|
+
_context1.n = 2;
|
|
35755
35568
|
break;
|
|
35756
35569
|
case 9:
|
|
35757
|
-
|
|
35570
|
+
_context1.n = 11;
|
|
35758
35571
|
break;
|
|
35759
35572
|
case 10:
|
|
35760
|
-
|
|
35761
|
-
|
|
35762
|
-
|
|
35573
|
+
_context1.p = 10;
|
|
35574
|
+
_t24 = _context1.v;
|
|
35575
|
+
_iterator31.e(_t24);
|
|
35763
35576
|
case 11:
|
|
35764
|
-
|
|
35765
|
-
|
|
35766
|
-
return
|
|
35577
|
+
_context1.p = 11;
|
|
35578
|
+
_iterator31.f();
|
|
35579
|
+
return _context1.f(11);
|
|
35767
35580
|
case 12:
|
|
35768
|
-
|
|
35769
|
-
if (!
|
|
35770
|
-
|
|
35581
|
+
_t25 = "lowest" === n && h;
|
|
35582
|
+
if (!_t25) {
|
|
35583
|
+
_context1.n = 14;
|
|
35771
35584
|
break;
|
|
35772
35585
|
}
|
|
35773
35586
|
if (!o) {
|
|
35774
|
-
|
|
35587
|
+
_context1.n = 13;
|
|
35775
35588
|
break;
|
|
35776
35589
|
}
|
|
35777
35590
|
p.push(h);
|
|
35778
|
-
|
|
35591
|
+
_context1.n = 14;
|
|
35779
35592
|
break;
|
|
35780
35593
|
case 13:
|
|
35781
|
-
|
|
35594
|
+
_context1.n = 14;
|
|
35782
35595
|
return h;
|
|
35783
35596
|
case 14:
|
|
35784
|
-
|
|
35785
|
-
if (!
|
|
35786
|
-
|
|
35597
|
+
_t26 = o;
|
|
35598
|
+
if (!_t26) {
|
|
35599
|
+
_context1.n = 15;
|
|
35787
35600
|
break;
|
|
35788
35601
|
}
|
|
35789
|
-
return
|
|
35602
|
+
return _context1.d(_regeneratorValues(p), 15);
|
|
35790
35603
|
case 15:
|
|
35791
|
-
|
|
35792
|
-
return _context11.stop();
|
|
35604
|
+
return _context1.a(2);
|
|
35793
35605
|
}
|
|
35794
35606
|
}, _callee9, null, [[1, 10, 11, 12]]);
|
|
35795
35607
|
})();
|
|
@@ -35825,11 +35637,11 @@ function requireLib() {
|
|
|
35825
35637
|
ee.set(e, a), te.set(e, i);
|
|
35826
35638
|
}
|
|
35827
35639
|
0 !== o(e).length && Se.withoutNormalizing(e, function () {
|
|
35828
|
-
var
|
|
35829
|
-
|
|
35640
|
+
var _iterator32 = _createForOfIteratorHelper(o(e)),
|
|
35641
|
+
_step32;
|
|
35830
35642
|
try {
|
|
35831
|
-
for (
|
|
35832
|
-
var t =
|
|
35643
|
+
for (_iterator32.s(); !(_step32 = _iterator32.n()).done;) {
|
|
35644
|
+
var t = _step32.value;
|
|
35833
35645
|
if (Ae.has(e, t)) {
|
|
35834
35646
|
var r = Se.node(e, t),
|
|
35835
35647
|
_r4 = r,
|
|
@@ -35842,9 +35654,9 @@ function requireLib() {
|
|
|
35842
35654
|
}
|
|
35843
35655
|
}
|
|
35844
35656
|
} catch (err) {
|
|
35845
|
-
|
|
35657
|
+
_iterator32.e(err);
|
|
35846
35658
|
} finally {
|
|
35847
|
-
|
|
35659
|
+
_iterator32.f();
|
|
35848
35660
|
}
|
|
35849
35661
|
for (var s = o(e), l = s.length, c = 0; 0 !== s.length;) {
|
|
35850
35662
|
if (!e.shouldNormalize({
|
|
@@ -35946,10 +35758,10 @@ function requireLib() {
|
|
|
35946
35758
|
};
|
|
35947
35759
|
}
|
|
35948
35760
|
if (Ce.isRange(t)) {
|
|
35949
|
-
var _Ce$
|
|
35950
|
-
_Ce$
|
|
35951
|
-
s = _Ce$
|
|
35952
|
-
l = _Ce$
|
|
35761
|
+
var _Ce$edges31 = Ce.edges(t),
|
|
35762
|
+
_Ce$edges32 = _slicedToArray(_Ce$edges31, 2),
|
|
35763
|
+
s = _Ce$edges32[0],
|
|
35764
|
+
l = _Ce$edges32[1];
|
|
35953
35765
|
return "start" === n ? s : l;
|
|
35954
35766
|
}
|
|
35955
35767
|
return t;
|
|
@@ -35983,10 +35795,10 @@ function requireLib() {
|
|
|
35983
35795
|
for (var t = arguments.length, r = new Array(t), n = 0; n < t; n++) r[n] = arguments[n];
|
|
35984
35796
|
return function (e) {
|
|
35985
35797
|
var t = arguments.length > 1 && void 0 !== arguments[1] ? arguments[1] : {};
|
|
35986
|
-
return /*#__PURE__*/
|
|
35987
|
-
var _t$at9, r, _t$unit5, n, _t$reverse9, o, _t$voids9, u, _t$ignoreNonSelectabl2, a, i, _Ce$
|
|
35988
|
-
return
|
|
35989
|
-
while (1) switch (
|
|
35798
|
+
return /*#__PURE__*/_regenerator().m(function _callee0() {
|
|
35799
|
+
var _t$at9, r, _t$unit5, n, _t$reverse9, o, _t$voids9, u, _t$ignoreNonSelectabl2, a, i, _Ce$edges33, _Ce$edges34, s, l, c, f, d, h, v, p, _iterator33, _step33, _step33$value, D, g, m, C, y, B, _t27, _t28;
|
|
35800
|
+
return _regenerator().w(function (_context10) {
|
|
35801
|
+
while (1) switch (_context10.p = _context10.n) {
|
|
35990
35802
|
case 0:
|
|
35991
35803
|
B = function _B(e, t, r) {
|
|
35992
35804
|
return "character" === t ? Ue(e, r) : "word" === t ? function (e) {
|
|
@@ -36007,42 +35819,42 @@ function requireLib() {
|
|
|
36007
35819
|
};
|
|
36008
35820
|
_t$at9 = t.at, r = _t$at9 === void 0 ? e.selection : _t$at9, _t$unit5 = t.unit, n = _t$unit5 === void 0 ? "offset" : _t$unit5, _t$reverse9 = t.reverse, o = _t$reverse9 === void 0 ? false : _t$reverse9, _t$voids9 = t.voids, u = _t$voids9 === void 0 ? false : _t$voids9, _t$ignoreNonSelectabl2 = t.ignoreNonSelectable, a = _t$ignoreNonSelectabl2 === void 0 ? false : _t$ignoreNonSelectabl2;
|
|
36009
35821
|
if (!r) {
|
|
36010
|
-
|
|
35822
|
+
_context10.n = 17;
|
|
36011
35823
|
break;
|
|
36012
35824
|
}
|
|
36013
|
-
i = Se.range(e, r), _Ce$
|
|
36014
|
-
|
|
35825
|
+
i = Se.range(e, r), _Ce$edges33 = Ce.edges(i), _Ce$edges34 = _slicedToArray(_Ce$edges33, 2), s = _Ce$edges34[0], l = _Ce$edges34[1], c = o ? l : s, f = false, d = "", h = 0, v = 0, p = 0;
|
|
35826
|
+
_iterator33 = _createForOfIteratorHelper(Se.nodes(e, {
|
|
36015
35827
|
at: r,
|
|
36016
35828
|
reverse: o,
|
|
36017
35829
|
voids: u,
|
|
36018
35830
|
ignoreNonSelectable: a
|
|
36019
35831
|
}));
|
|
36020
|
-
|
|
36021
|
-
|
|
35832
|
+
_context10.p = 1;
|
|
35833
|
+
_iterator33.s();
|
|
36022
35834
|
case 2:
|
|
36023
|
-
if ((
|
|
36024
|
-
|
|
35835
|
+
if ((_step33 = _iterator33.n()).done) {
|
|
35836
|
+
_context10.n = 14;
|
|
36025
35837
|
break;
|
|
36026
35838
|
}
|
|
36027
|
-
|
|
35839
|
+
_step33$value = _slicedToArray(_step33.value, 2), D = _step33$value[0], g = _step33$value[1];
|
|
36028
35840
|
if (!Be.isElement(D)) {
|
|
36029
|
-
|
|
35841
|
+
_context10.n = 6;
|
|
36030
35842
|
break;
|
|
36031
35843
|
}
|
|
36032
35844
|
if (!(!u && (e.isVoid(D) || e.isElementReadOnly(D)))) {
|
|
36033
|
-
|
|
35845
|
+
_context10.n = 4;
|
|
36034
35846
|
break;
|
|
36035
35847
|
}
|
|
36036
|
-
|
|
35848
|
+
_context10.n = 3;
|
|
36037
35849
|
return Se.start(e, g);
|
|
36038
35850
|
case 3:
|
|
36039
|
-
return
|
|
35851
|
+
return _context10.a(3, 13);
|
|
36040
35852
|
case 4:
|
|
36041
35853
|
if (!e.isInline(D)) {
|
|
36042
|
-
|
|
35854
|
+
_context10.n = 5;
|
|
36043
35855
|
break;
|
|
36044
35856
|
}
|
|
36045
|
-
return
|
|
35857
|
+
return _context10.a(3, 13);
|
|
36046
35858
|
case 5:
|
|
36047
35859
|
if (Se.hasInlines(e, D)) {
|
|
36048
35860
|
m = ie.isAncestor(g, l.path) ? l : Se.end(e, g), C = ie.isAncestor(g, s.path) ? s : Se.start(e, g);
|
|
@@ -36055,17 +35867,17 @@ function requireLib() {
|
|
|
36055
35867
|
}
|
|
36056
35868
|
case 6:
|
|
36057
35869
|
if (!Ve.isText(D)) {
|
|
36058
|
-
|
|
35870
|
+
_context10.n = 13;
|
|
36059
35871
|
break;
|
|
36060
35872
|
}
|
|
36061
35873
|
y = ie.equals(g, c.path);
|
|
36062
35874
|
y ? (v = o ? c.offset : D.text.length - c.offset, p = c.offset) : (v = D.text.length, p = o ? v : 0);
|
|
36063
|
-
|
|
36064
|
-
if (!
|
|
36065
|
-
|
|
35875
|
+
_t27 = y || f || "offset" === n;
|
|
35876
|
+
if (!_t27) {
|
|
35877
|
+
_context10.n = 8;
|
|
36066
35878
|
break;
|
|
36067
35879
|
}
|
|
36068
|
-
|
|
35880
|
+
_context10.n = 7;
|
|
36069
35881
|
return {
|
|
36070
35882
|
path: g,
|
|
36071
35883
|
offset: p
|
|
@@ -36074,52 +35886,51 @@ function requireLib() {
|
|
|
36074
35886
|
f = false;
|
|
36075
35887
|
case 8:
|
|
36076
35888
|
if (!(0 === h)) {
|
|
36077
|
-
|
|
35889
|
+
_context10.n = 10;
|
|
36078
35890
|
break;
|
|
36079
35891
|
}
|
|
36080
35892
|
if (!("" === d)) {
|
|
36081
|
-
|
|
35893
|
+
_context10.n = 9;
|
|
36082
35894
|
break;
|
|
36083
35895
|
}
|
|
36084
|
-
return
|
|
35896
|
+
return _context10.a(3, 13);
|
|
36085
35897
|
case 9:
|
|
36086
35898
|
h = B(d, n, o), d = Je(d, h, o)[1];
|
|
36087
35899
|
case 10:
|
|
36088
35900
|
if (!(p = o ? p - h : p + h, (v -= h) < 0)) {
|
|
36089
|
-
|
|
35901
|
+
_context10.n = 11;
|
|
36090
35902
|
break;
|
|
36091
35903
|
}
|
|
36092
35904
|
h = -v;
|
|
36093
|
-
return
|
|
35905
|
+
return _context10.a(3, 13);
|
|
36094
35906
|
case 11:
|
|
36095
35907
|
h = 0;
|
|
36096
|
-
|
|
35908
|
+
_context10.n = 12;
|
|
36097
35909
|
return {
|
|
36098
35910
|
path: g,
|
|
36099
35911
|
offset: p
|
|
36100
35912
|
};
|
|
36101
35913
|
case 12:
|
|
36102
|
-
|
|
35914
|
+
_context10.n = 8;
|
|
36103
35915
|
break;
|
|
36104
35916
|
case 13:
|
|
36105
|
-
|
|
35917
|
+
_context10.n = 2;
|
|
36106
35918
|
break;
|
|
36107
35919
|
case 14:
|
|
36108
|
-
|
|
35920
|
+
_context10.n = 16;
|
|
36109
35921
|
break;
|
|
36110
35922
|
case 15:
|
|
36111
|
-
|
|
36112
|
-
|
|
36113
|
-
|
|
35923
|
+
_context10.p = 15;
|
|
35924
|
+
_t28 = _context10.v;
|
|
35925
|
+
_iterator33.e(_t28);
|
|
36114
35926
|
case 16:
|
|
36115
|
-
|
|
36116
|
-
|
|
36117
|
-
return
|
|
35927
|
+
_context10.p = 16;
|
|
35928
|
+
_iterator33.f();
|
|
35929
|
+
return _context10.f(16);
|
|
36118
35930
|
case 17:
|
|
36119
|
-
|
|
36120
|
-
return _context12.stop();
|
|
35931
|
+
return _context10.a(2);
|
|
36121
35932
|
}
|
|
36122
|
-
},
|
|
35933
|
+
}, _callee0, null, [[1, 15, 16, 17]]);
|
|
36123
35934
|
})();
|
|
36124
35935
|
}.apply(void 0, [e].concat(r));
|
|
36125
35936
|
},
|
|
@@ -36129,11 +35940,11 @@ function requireLib() {
|
|
|
36129
35940
|
var t = arguments.length > 1 && void 0 !== arguments[1] ? arguments[1] : {},
|
|
36130
35941
|
_t$mode7 = t.mode,
|
|
36131
35942
|
r = _t$mode7 === void 0 ? "lowest" : _t$mode7,
|
|
36132
|
-
_t$
|
|
36133
|
-
n = _t$
|
|
35943
|
+
_t$voids0 = t.voids,
|
|
35944
|
+
n = _t$voids0 === void 0 ? false : _t$voids0,
|
|
36134
35945
|
o = t.match,
|
|
36135
|
-
_t$
|
|
36136
|
-
u = _t$
|
|
35946
|
+
_t$at0 = t.at,
|
|
35947
|
+
u = _t$at0 === void 0 ? e.selection : _t$at0;
|
|
36137
35948
|
if (u) {
|
|
36138
35949
|
var a = Se.before(e, u, {
|
|
36139
35950
|
voids: n
|
|
@@ -36145,24 +35956,24 @@ function requireLib() {
|
|
|
36145
35956
|
s = [a.path, i];
|
|
36146
35957
|
if (ie.isPath(u) && 0 === u.length) throw new Error("Cannot get the previous node from the root node!");
|
|
36147
35958
|
if (null == o) if (ie.isPath(u)) {
|
|
36148
|
-
var _Se$
|
|
36149
|
-
_Se$
|
|
36150
|
-
l = _Se$
|
|
35959
|
+
var _Se$parent11 = Se.parent(e, u),
|
|
35960
|
+
_Se$parent12 = _slicedToArray(_Se$parent11, 1),
|
|
35961
|
+
l = _Se$parent12[0];
|
|
36151
35962
|
o = function o(e) {
|
|
36152
35963
|
return l.children.includes(e);
|
|
36153
35964
|
};
|
|
36154
35965
|
} else o = function o() {
|
|
36155
35966
|
return true;
|
|
36156
35967
|
};
|
|
36157
|
-
var _Se$
|
|
35968
|
+
var _Se$nodes1 = Se.nodes(e, {
|
|
36158
35969
|
reverse: true,
|
|
36159
35970
|
at: s,
|
|
36160
35971
|
match: o,
|
|
36161
35972
|
mode: r,
|
|
36162
35973
|
voids: n
|
|
36163
35974
|
}),
|
|
36164
|
-
_Se$
|
|
36165
|
-
c = _Se$
|
|
35975
|
+
_Se$nodes10 = _slicedToArray(_Se$nodes1, 1),
|
|
35976
|
+
c = _Se$nodes10[0];
|
|
36166
35977
|
return c;
|
|
36167
35978
|
}
|
|
36168
35979
|
}
|
|
@@ -36208,12 +36019,12 @@ function requireLib() {
|
|
|
36208
36019
|
Se.withoutNormalizing(e, function () {
|
|
36209
36020
|
var _t$hanging3 = t.hanging,
|
|
36210
36021
|
r = _t$hanging3 === void 0 ? false : _t$hanging3,
|
|
36211
|
-
_t$
|
|
36212
|
-
n = _t$
|
|
36022
|
+
_t$voids1 = t.voids,
|
|
36023
|
+
n = _t$voids1 === void 0 ? false : _t$voids1,
|
|
36213
36024
|
_t$mode8 = t.mode,
|
|
36214
36025
|
o = _t$mode8 === void 0 ? "lowest" : _t$mode8,
|
|
36215
|
-
_t$
|
|
36216
|
-
u = _t$
|
|
36026
|
+
_t$at1 = t.at,
|
|
36027
|
+
u = _t$at1 === void 0 ? e.selection : _t$at1,
|
|
36217
36028
|
a = t.match;
|
|
36218
36029
|
if (u) {
|
|
36219
36030
|
null == a && (a = ie.isPath(u) ? He(e, u) : function (t) {
|
|
@@ -36228,8 +36039,8 @@ function requireLib() {
|
|
|
36228
36039
|
voids: n
|
|
36229
36040
|
}),
|
|
36230
36041
|
s = Array.from(i, function (t) {
|
|
36231
|
-
var
|
|
36232
|
-
r =
|
|
36042
|
+
var _t29 = _slicedToArray(t, 2),
|
|
36043
|
+
r = _t29[1];
|
|
36233
36044
|
return Se.pathRef(e, r);
|
|
36234
36045
|
});
|
|
36235
36046
|
for (var _i7 = 0, _s2 = s; _i7 < _s2.length; _i7++) {
|
|
@@ -36292,10 +36103,10 @@ function requireLib() {
|
|
|
36292
36103
|
var f = Se.rangeRef(e, o, {
|
|
36293
36104
|
affinity: "inward"
|
|
36294
36105
|
}),
|
|
36295
|
-
_Ce$
|
|
36296
|
-
_Ce$
|
|
36297
|
-
d = _Ce$
|
|
36298
|
-
h = _Ce$
|
|
36106
|
+
_Ce$edges35 = Ce.edges(o),
|
|
36107
|
+
_Ce$edges36 = _slicedToArray(_Ce$edges35, 2),
|
|
36108
|
+
d = _Ce$edges36[0],
|
|
36109
|
+
h = _Ce$edges36[1],
|
|
36299
36110
|
v = "lowest" === s ? "lowest" : "highest",
|
|
36300
36111
|
p = Se.isEnd(e, h, h.path);
|
|
36301
36112
|
yt.splitNodes(e, {
|
|
@@ -36314,7 +36125,7 @@ function requireLib() {
|
|
|
36314
36125
|
always: !D
|
|
36315
36126
|
}), o = f.unref(), null == r.at && yt.select(e, o);
|
|
36316
36127
|
}
|
|
36317
|
-
var
|
|
36128
|
+
var _iterator34 = _createForOfIteratorHelper((u || (u = function u(e, t) {
|
|
36318
36129
|
return e !== t;
|
|
36319
36130
|
}), Se.nodes(e, {
|
|
36320
36131
|
at: o,
|
|
@@ -36322,12 +36133,12 @@ function requireLib() {
|
|
|
36322
36133
|
mode: s,
|
|
36323
36134
|
voids: c
|
|
36324
36135
|
}))),
|
|
36325
|
-
|
|
36136
|
+
_step34;
|
|
36326
36137
|
try {
|
|
36327
|
-
for (
|
|
36328
|
-
var
|
|
36329
|
-
g =
|
|
36330
|
-
m =
|
|
36138
|
+
for (_iterator34.s(); !(_step34 = _iterator34.n()).done;) {
|
|
36139
|
+
var _step34$value = _slicedToArray(_step34.value, 2),
|
|
36140
|
+
g = _step34$value[0],
|
|
36141
|
+
m = _step34$value[1];
|
|
36331
36142
|
var C = {},
|
|
36332
36143
|
y = {};
|
|
36333
36144
|
if (0 !== m.length) {
|
|
@@ -36342,9 +36153,9 @@ function requireLib() {
|
|
|
36342
36153
|
}
|
|
36343
36154
|
}
|
|
36344
36155
|
} catch (err) {
|
|
36345
|
-
|
|
36156
|
+
_iterator34.e(err);
|
|
36346
36157
|
} finally {
|
|
36347
|
-
|
|
36158
|
+
_iterator34.f();
|
|
36348
36159
|
}
|
|
36349
36160
|
}
|
|
36350
36161
|
});
|
|
@@ -36395,11 +36206,11 @@ function requireLib() {
|
|
|
36395
36206
|
Se.withoutNormalizing(e, function () {
|
|
36396
36207
|
var _t$mode9 = t.mode,
|
|
36397
36208
|
r = _t$mode9 === void 0 ? "lowest" : _t$mode9,
|
|
36398
|
-
_t$
|
|
36399
|
-
n = _t$
|
|
36209
|
+
_t$voids10 = t.voids,
|
|
36210
|
+
n = _t$voids10 === void 0 ? false : _t$voids10,
|
|
36400
36211
|
o = t.match,
|
|
36401
|
-
_t$
|
|
36402
|
-
u = _t$
|
|
36212
|
+
_t$at10 = t.at,
|
|
36213
|
+
u = _t$at10 === void 0 ? e.selection : _t$at10,
|
|
36403
36214
|
_t$height = t.height,
|
|
36404
36215
|
a = _t$height === void 0 ? 0 : _t$height,
|
|
36405
36216
|
_t$always = t.always,
|
|
@@ -36408,9 +36219,9 @@ function requireLib() {
|
|
|
36408
36219
|
return Be.isElement(t) && Se.isBlock(e, t);
|
|
36409
36220
|
}), Ce.isRange(u) && (u = function (e, t) {
|
|
36410
36221
|
if (Ce.isCollapsed(t)) return t.anchor;
|
|
36411
|
-
var _Ce$
|
|
36412
|
-
_Ce$
|
|
36413
|
-
r = _Ce$
|
|
36222
|
+
var _Ce$edges37 = Ce.edges(t),
|
|
36223
|
+
_Ce$edges38 = _slicedToArray(_Ce$edges37, 2),
|
|
36224
|
+
r = _Ce$edges38[1],
|
|
36414
36225
|
n = Se.pointRef(e, r);
|
|
36415
36226
|
return yt["delete"](e, {
|
|
36416
36227
|
at: t
|
|
@@ -36418,9 +36229,9 @@ function requireLib() {
|
|
|
36418
36229
|
}(e, u)), ie.isPath(u)) {
|
|
36419
36230
|
var s = u,
|
|
36420
36231
|
l = Se.point(e, s),
|
|
36421
|
-
_Se$
|
|
36422
|
-
_Se$
|
|
36423
|
-
c = _Se$
|
|
36232
|
+
_Se$parent13 = Se.parent(e, s),
|
|
36233
|
+
_Se$parent14 = _slicedToArray(_Se$parent13, 1),
|
|
36234
|
+
c = _Se$parent14[0];
|
|
36424
36235
|
o = function o(e) {
|
|
36425
36236
|
return e === c;
|
|
36426
36237
|
}, a = l.path.length - s.length + 1, u = l, i = true;
|
|
@@ -36431,14 +36242,14 @@ function requireLib() {
|
|
|
36431
36242
|
affinity: "backward"
|
|
36432
36243
|
});
|
|
36433
36244
|
try {
|
|
36434
|
-
var _Se$
|
|
36245
|
+
var _Se$nodes11 = Se.nodes(e, {
|
|
36435
36246
|
at: u,
|
|
36436
36247
|
match: o,
|
|
36437
36248
|
mode: r,
|
|
36438
36249
|
voids: n
|
|
36439
36250
|
}),
|
|
36440
|
-
_Se$
|
|
36441
|
-
h = _Se$
|
|
36251
|
+
_Se$nodes12 = _slicedToArray(_Se$nodes11, 1),
|
|
36252
|
+
h = _Se$nodes12[0];
|
|
36442
36253
|
if (!h) return;
|
|
36443
36254
|
var v = Se["void"](e, {
|
|
36444
36255
|
at: u,
|
|
@@ -36469,17 +36280,17 @@ function requireLib() {
|
|
|
36469
36280
|
y = _h2[1],
|
|
36470
36281
|
B = u.path.slice(0, C),
|
|
36471
36282
|
b = 0 === a ? u.offset : u.path[C] + 0;
|
|
36472
|
-
var
|
|
36283
|
+
var _iterator35 = _createForOfIteratorHelper(Se.levels(e, {
|
|
36473
36284
|
at: B,
|
|
36474
36285
|
reverse: !0,
|
|
36475
36286
|
voids: n
|
|
36476
36287
|
})),
|
|
36477
|
-
|
|
36288
|
+
_step35;
|
|
36478
36289
|
try {
|
|
36479
|
-
for (
|
|
36480
|
-
var
|
|
36481
|
-
E =
|
|
36482
|
-
w =
|
|
36290
|
+
for (_iterator35.s(); !(_step35 = _iterator35.n()).done;) {
|
|
36291
|
+
var _step35$value = _slicedToArray(_step35.value, 2),
|
|
36292
|
+
E = _step35$value[0],
|
|
36293
|
+
w = _step35$value[1];
|
|
36483
36294
|
var A = !1;
|
|
36484
36295
|
if (w.length < y.length || 0 === w.length || !n && Be.isElement(E) && Se.isVoid(e, E)) break;
|
|
36485
36296
|
var F = d.current,
|
|
@@ -36497,9 +36308,9 @@ function requireLib() {
|
|
|
36497
36308
|
b = w[w.length - 1] + (A || O ? 1 : 0);
|
|
36498
36309
|
}
|
|
36499
36310
|
} catch (err) {
|
|
36500
|
-
|
|
36311
|
+
_iterator35.e(err);
|
|
36501
36312
|
} finally {
|
|
36502
|
-
|
|
36313
|
+
_iterator35.f();
|
|
36503
36314
|
}
|
|
36504
36315
|
if (null == t.at) {
|
|
36505
36316
|
var P = f.current || Se.end(e, []);
|
|
@@ -36528,29 +36339,29 @@ function requireLib() {
|
|
|
36528
36339
|
_r$voids5 = r.voids,
|
|
36529
36340
|
n = _r$voids5 === void 0 ? false : _r$voids5,
|
|
36530
36341
|
o = Se.range(e, t),
|
|
36531
|
-
_Ce$
|
|
36532
|
-
_Ce$
|
|
36533
|
-
u = _Ce$
|
|
36534
|
-
a = _Ce$
|
|
36342
|
+
_Ce$edges39 = Ce.edges(o),
|
|
36343
|
+
_Ce$edges40 = _slicedToArray(_Ce$edges39, 2),
|
|
36344
|
+
u = _Ce$edges40[0],
|
|
36345
|
+
a = _Ce$edges40[1],
|
|
36535
36346
|
i = "";
|
|
36536
|
-
var
|
|
36347
|
+
var _iterator36 = _createForOfIteratorHelper(Se.nodes(e, {
|
|
36537
36348
|
at: o,
|
|
36538
36349
|
match: Ve.isText,
|
|
36539
36350
|
voids: n
|
|
36540
36351
|
})),
|
|
36541
|
-
|
|
36352
|
+
_step36;
|
|
36542
36353
|
try {
|
|
36543
|
-
for (
|
|
36544
|
-
var
|
|
36545
|
-
s =
|
|
36546
|
-
l =
|
|
36354
|
+
for (_iterator36.s(); !(_step36 = _iterator36.n()).done;) {
|
|
36355
|
+
var _step36$value = _slicedToArray(_step36.value, 2),
|
|
36356
|
+
s = _step36$value[0],
|
|
36357
|
+
l = _step36$value[1];
|
|
36547
36358
|
var c = s.text;
|
|
36548
36359
|
ie.equals(l, a.path) && (c = c.slice(0, a.offset)), ie.equals(l, u.path) && (c = c.slice(u.offset)), i += c;
|
|
36549
36360
|
}
|
|
36550
36361
|
} catch (err) {
|
|
36551
|
-
|
|
36362
|
+
_iterator36.e(err);
|
|
36552
36363
|
} finally {
|
|
36553
|
-
|
|
36364
|
+
_iterator36.f();
|
|
36554
36365
|
}
|
|
36555
36366
|
return i;
|
|
36556
36367
|
}.apply(void 0, [e].concat(r));
|
|
@@ -36561,10 +36372,10 @@ function requireLib() {
|
|
|
36561
36372
|
var r = arguments.length > 2 && void 0 !== arguments[2] ? arguments[2] : {},
|
|
36562
36373
|
_r$voids6 = r.voids,
|
|
36563
36374
|
n = _r$voids6 === void 0 ? false : _r$voids6,
|
|
36564
|
-
_Ce$
|
|
36565
|
-
_Ce$
|
|
36566
|
-
o = _Ce$
|
|
36567
|
-
u = _Ce$
|
|
36375
|
+
_Ce$edges41 = Ce.edges(t),
|
|
36376
|
+
_Ce$edges42 = _slicedToArray(_Ce$edges41, 2),
|
|
36377
|
+
o = _Ce$edges42[0],
|
|
36378
|
+
u = _Ce$edges42[1];
|
|
36568
36379
|
if (0 !== o.offset || 0 !== u.offset || Ce.isCollapsed(t) || ie.hasPrevious(u.path)) return t;
|
|
36569
36380
|
var a = Se.above(e, {
|
|
36570
36381
|
at: u,
|
|
@@ -36579,18 +36390,18 @@ function requireLib() {
|
|
|
36579
36390
|
focus: u
|
|
36580
36391
|
},
|
|
36581
36392
|
l = true;
|
|
36582
|
-
var
|
|
36393
|
+
var _iterator37 = _createForOfIteratorHelper(Se.nodes(e, {
|
|
36583
36394
|
at: s,
|
|
36584
36395
|
match: Ve.isText,
|
|
36585
36396
|
reverse: true,
|
|
36586
36397
|
voids: n
|
|
36587
36398
|
})),
|
|
36588
|
-
|
|
36399
|
+
_step37;
|
|
36589
36400
|
try {
|
|
36590
|
-
for (
|
|
36591
|
-
var
|
|
36592
|
-
c =
|
|
36593
|
-
f =
|
|
36401
|
+
for (_iterator37.s(); !(_step37 = _iterator37.n()).done;) {
|
|
36402
|
+
var _step37$value = _slicedToArray(_step37.value, 2),
|
|
36403
|
+
c = _step37$value[0],
|
|
36404
|
+
f = _step37$value[1];
|
|
36594
36405
|
if (l) l = !1;else if ("" !== c.text || ie.isBefore(f, i)) {
|
|
36595
36406
|
u = {
|
|
36596
36407
|
path: f,
|
|
@@ -36600,9 +36411,9 @@ function requireLib() {
|
|
|
36600
36411
|
}
|
|
36601
36412
|
}
|
|
36602
36413
|
} catch (err) {
|
|
36603
|
-
|
|
36414
|
+
_iterator37.e(err);
|
|
36604
36415
|
} finally {
|
|
36605
|
-
|
|
36416
|
+
_iterator37.f();
|
|
36606
36417
|
}
|
|
36607
36418
|
return {
|
|
36608
36419
|
anchor: o,
|
|
@@ -36616,17 +36427,17 @@ function requireLib() {
|
|
|
36616
36427
|
var r = arguments.length > 2 && void 0 !== arguments[2] ? arguments[2] : {};
|
|
36617
36428
|
Array.isArray(t) || (t = [t]);
|
|
36618
36429
|
var n = {};
|
|
36619
|
-
var
|
|
36620
|
-
|
|
36430
|
+
var _iterator38 = _createForOfIteratorHelper(t),
|
|
36431
|
+
_step38;
|
|
36621
36432
|
try {
|
|
36622
|
-
for (
|
|
36623
|
-
var o =
|
|
36433
|
+
for (_iterator38.s(); !(_step38 = _iterator38.n()).done;) {
|
|
36434
|
+
var o = _step38.value;
|
|
36624
36435
|
n[o] = null;
|
|
36625
36436
|
}
|
|
36626
36437
|
} catch (err) {
|
|
36627
|
-
|
|
36438
|
+
_iterator38.e(err);
|
|
36628
36439
|
} finally {
|
|
36629
|
-
|
|
36440
|
+
_iterator38.f();
|
|
36630
36441
|
}
|
|
36631
36442
|
yt.setNodes(e, n, r);
|
|
36632
36443
|
}.apply(void 0, [e].concat(r));
|
|
@@ -36636,14 +36447,14 @@ function requireLib() {
|
|
|
36636
36447
|
return function (e) {
|
|
36637
36448
|
var t = arguments.length > 1 && void 0 !== arguments[1] ? arguments[1] : {};
|
|
36638
36449
|
Se.withoutNormalizing(e, function () {
|
|
36639
|
-
var _t$
|
|
36640
|
-
r = _t$
|
|
36450
|
+
var _t$mode0 = t.mode,
|
|
36451
|
+
r = _t$mode0 === void 0 ? "lowest" : _t$mode0,
|
|
36641
36452
|
_t$split = t.split,
|
|
36642
36453
|
n = _t$split === void 0 ? false : _t$split,
|
|
36643
|
-
_t$
|
|
36644
|
-
o = _t$
|
|
36645
|
-
_t$
|
|
36646
|
-
u = _t$
|
|
36454
|
+
_t$voids11 = t.voids,
|
|
36455
|
+
o = _t$voids11 === void 0 ? false : _t$voids11,
|
|
36456
|
+
_t$at11 = t.at,
|
|
36457
|
+
u = _t$at11 === void 0 ? e.selection : _t$at11,
|
|
36647
36458
|
a = t.match;
|
|
36648
36459
|
if (u) {
|
|
36649
36460
|
null == a && (a = ie.isPath(u) ? He(e, u) : function (t) {
|
|
@@ -36657,15 +36468,15 @@ function requireLib() {
|
|
|
36657
36468
|
voids: o
|
|
36658
36469
|
}),
|
|
36659
36470
|
l = Array.from(s, function (t) {
|
|
36660
|
-
var
|
|
36661
|
-
r =
|
|
36471
|
+
var _t30 = _slicedToArray(t, 2),
|
|
36472
|
+
r = _t30[1];
|
|
36662
36473
|
return Se.pathRef(e, r);
|
|
36663
36474
|
}).reverse(),
|
|
36664
36475
|
c = function c() {
|
|
36665
36476
|
var t = f.unref(),
|
|
36666
36477
|
_Se$node9 = Se.node(e, t),
|
|
36667
|
-
_Se$
|
|
36668
|
-
r = _Se$
|
|
36478
|
+
_Se$node0 = _slicedToArray(_Se$node9, 1),
|
|
36479
|
+
r = _Se$node0[0],
|
|
36669
36480
|
u = Se.range(e, t);
|
|
36670
36481
|
n && i && (u = Ce.intersection(i.current, u)), yt.liftNodes(e, {
|
|
36671
36482
|
at: u,
|
|
@@ -36675,17 +36486,17 @@ function requireLib() {
|
|
|
36675
36486
|
voids: o
|
|
36676
36487
|
});
|
|
36677
36488
|
};
|
|
36678
|
-
var
|
|
36679
|
-
|
|
36489
|
+
var _iterator39 = _createForOfIteratorHelper(l),
|
|
36490
|
+
_step39;
|
|
36680
36491
|
try {
|
|
36681
|
-
for (
|
|
36682
|
-
var f =
|
|
36492
|
+
for (_iterator39.s(); !(_step39 = _iterator39.n()).done;) {
|
|
36493
|
+
var f = _step39.value;
|
|
36683
36494
|
c();
|
|
36684
36495
|
}
|
|
36685
36496
|
} catch (err) {
|
|
36686
|
-
|
|
36497
|
+
_iterator39.e(err);
|
|
36687
36498
|
} finally {
|
|
36688
|
-
|
|
36499
|
+
_iterator39.f();
|
|
36689
36500
|
}
|
|
36690
36501
|
i && i.unref();
|
|
36691
36502
|
}
|
|
@@ -36736,10 +36547,10 @@ function requireLib() {
|
|
|
36736
36547
|
} : function (t) {
|
|
36737
36548
|
return Be.isElement(t) && Se.isBlock(e, t);
|
|
36738
36549
|
}), o && Ce.isRange(i)) {
|
|
36739
|
-
var _Ce$
|
|
36740
|
-
_Ce$
|
|
36741
|
-
s = _Ce$
|
|
36742
|
-
l = _Ce$
|
|
36550
|
+
var _Ce$edges43 = Ce.edges(i),
|
|
36551
|
+
_Ce$edges44 = _slicedToArray(_Ce$edges43, 2),
|
|
36552
|
+
s = _Ce$edges44[0],
|
|
36553
|
+
l = _Ce$edges44[1],
|
|
36743
36554
|
c = Se.rangeRef(e, i, {
|
|
36744
36555
|
affinity: "inward"
|
|
36745
36556
|
});
|
|
@@ -36815,9 +36626,9 @@ function requireLib() {
|
|
|
36815
36626
|
shouldMergeNodesRemovePrevNode: function shouldMergeNodesRemovePrevNode() {
|
|
36816
36627
|
for (var t = arguments.length, r = new Array(t), n = 0; n < t; n++) r[n] = arguments[n];
|
|
36817
36628
|
return function (e, t) {
|
|
36818
|
-
var
|
|
36819
|
-
r =
|
|
36820
|
-
n =
|
|
36629
|
+
var _t31 = _slicedToArray(t, 2),
|
|
36630
|
+
r = _t31[0],
|
|
36631
|
+
n = _t31[1];
|
|
36821
36632
|
return Be.isElement(r) && Se.isEmpty(e, r) || Ve.isText(r) && "" === r.text && 0 !== n[n.length - 1];
|
|
36822
36633
|
}.apply(void 0, [e].concat(r));
|
|
36823
36634
|
}
|
|
@@ -36911,8 +36722,8 @@ function requireLib() {
|
|
|
36911
36722
|
S = "center" === s ? w + y / 2 - x + F : "end" === s ? b + F : w - x;
|
|
36912
36723
|
var k = [];
|
|
36913
36724
|
for (var _e8 = 0; _e8 < h.length; _e8++) {
|
|
36914
|
-
var
|
|
36915
|
-
_t$getBoundingClientR =
|
|
36725
|
+
var _t32 = h[_e8],
|
|
36726
|
+
_t$getBoundingClientR = _t32.getBoundingClientRect(),
|
|
36916
36727
|
_r6 = _t$getBoundingClientR.height,
|
|
36917
36728
|
_n7 = _t$getBoundingClientR.width,
|
|
36918
36729
|
_o7 = _t$getBoundingClientR.top,
|
|
@@ -36920,25 +36731,25 @@ function requireLib() {
|
|
|
36920
36731
|
_l4 = _t$getBoundingClientR.bottom,
|
|
36921
36732
|
_c5 = _t$getBoundingClientR.left;
|
|
36922
36733
|
if ("if-needed" === a && B >= 0 && w >= 0 && E <= D && b <= p && B >= _o7 && E <= _l4 && w >= _c5 && b <= _u5) return k;
|
|
36923
|
-
var _f5 = getComputedStyle(
|
|
36734
|
+
var _f5 = getComputedStyle(_t32),
|
|
36924
36735
|
_v2 = parseInt(_f5.borderLeftWidth, 10),
|
|
36925
36736
|
_A = parseInt(_f5.borderTopWidth, 10),
|
|
36926
36737
|
_F = parseInt(_f5.borderRightWidth, 10),
|
|
36927
36738
|
_O = parseInt(_f5.borderBottomWidth, 10);
|
|
36928
36739
|
var _x3 = 0,
|
|
36929
36740
|
_j = 0;
|
|
36930
|
-
var _T = "offsetWidth" in
|
|
36931
|
-
_M = "offsetHeight" in
|
|
36932
|
-
_R = "offsetWidth" in
|
|
36933
|
-
_N = "offsetHeight" in
|
|
36934
|
-
if (d ===
|
|
36741
|
+
var _T = "offsetWidth" in _t32 ? _t32.offsetWidth - _t32.clientWidth - _v2 - _F : 0,
|
|
36742
|
+
_M = "offsetHeight" in _t32 ? _t32.offsetHeight - _t32.clientHeight - _A - _O : 0,
|
|
36743
|
+
_R = "offsetWidth" in _t32 ? 0 === _t32.offsetWidth ? 0 : _n7 / _t32.offsetWidth : 0,
|
|
36744
|
+
_N = "offsetHeight" in _t32 ? 0 === _t32.offsetHeight ? 0 : _r6 / _t32.offsetHeight : 0;
|
|
36745
|
+
if (d === _t32) _x3 = "start" === i ? P : "end" === i ? P - D : "nearest" === i ? er(m, m + D, D, _A, _O, m + P, m + P + C, C) : P - D / 2, _j = "start" === s ? S : "center" === s ? S - p / 2 : "end" === s ? S - p : er(g, g + p, p, _v2, _F, g + S, g + S + y, y), _x3 = Math.max(0, _x3 + m), _j = Math.max(0, _j + g);else {
|
|
36935
36746
|
_x3 = "start" === i ? P - _o7 - _A : "end" === i ? P - _l4 + _O + _M : "nearest" === i ? er(_o7, _l4, _r6, _A, _O + _M, P, P + C, C) : P - (_o7 + _r6 / 2) + _M / 2, _j = "start" === s ? S - _c5 - _v2 : "center" === s ? S - (_c5 + _n7 / 2) + _T / 2 : "end" === s ? S - _u5 + _F + _T : er(_c5, _u5, _n7, _v2, _F + _T, S, S + y, y);
|
|
36936
|
-
var _e9 =
|
|
36937
|
-
_a6 =
|
|
36938
|
-
_x3 = 0 === _N ? 0 : Math.max(0, Math.min(_a6 + _x3 / _N,
|
|
36747
|
+
var _e9 = _t32.scrollLeft,
|
|
36748
|
+
_a6 = _t32.scrollTop;
|
|
36749
|
+
_x3 = 0 === _N ? 0 : Math.max(0, Math.min(_a6 + _x3 / _N, _t32.scrollHeight - _r6 / _N + _M)), _j = 0 === _R ? 0 : Math.max(0, Math.min(_e9 + _j / _R, _t32.scrollWidth - _n7 / _R + _T)), P += _a6 - _x3, S += _e9 - _j;
|
|
36939
36750
|
}
|
|
36940
36751
|
k.push({
|
|
36941
|
-
el:
|
|
36752
|
+
el: _t32,
|
|
36942
36753
|
top: _x3,
|
|
36943
36754
|
left: _j
|
|
36944
36755
|
});
|
|
@@ -37005,29 +36816,29 @@ function requireLib() {
|
|
|
37005
36816
|
var u = r.find(function (e) {
|
|
37006
36817
|
var t = e.addedNodes,
|
|
37007
36818
|
r = e.removedNodes;
|
|
37008
|
-
var
|
|
37009
|
-
|
|
36819
|
+
var _iterator40 = _createForOfIteratorHelper(t),
|
|
36820
|
+
_step40;
|
|
37010
36821
|
try {
|
|
37011
|
-
for (
|
|
37012
|
-
var o =
|
|
36822
|
+
for (_iterator40.s(); !(_step40 = _iterator40.n()).done;) {
|
|
36823
|
+
var o = _step40.value;
|
|
37013
36824
|
if (o === n || o.contains(n)) return !0;
|
|
37014
36825
|
}
|
|
37015
36826
|
} catch (err) {
|
|
37016
|
-
|
|
36827
|
+
_iterator40.e(err);
|
|
37017
36828
|
} finally {
|
|
37018
|
-
|
|
36829
|
+
_iterator40.f();
|
|
37019
36830
|
}
|
|
37020
|
-
var
|
|
37021
|
-
|
|
36831
|
+
var _iterator41 = _createForOfIteratorHelper(r),
|
|
36832
|
+
_step41;
|
|
37022
36833
|
try {
|
|
37023
|
-
for (
|
|
37024
|
-
var u =
|
|
36834
|
+
for (_iterator41.s(); !(_step41 = _iterator41.n()).done;) {
|
|
36835
|
+
var u = _step41.value;
|
|
37025
36836
|
if (u === n || u.contains(n)) return !0;
|
|
37026
36837
|
}
|
|
37027
36838
|
} catch (err) {
|
|
37028
|
-
|
|
36839
|
+
_iterator41.e(err);
|
|
37029
36840
|
} finally {
|
|
37030
|
-
|
|
36841
|
+
_iterator41.f();
|
|
37031
36842
|
}
|
|
37032
36843
|
});
|
|
37033
36844
|
return !(!u || u === t) && _mr(e, u, r);
|
|
@@ -37132,10 +36943,10 @@ function requireLib() {
|
|
|
37132
36943
|
},
|
|
37133
36944
|
findEventRange: function findEventRange(e, t) {
|
|
37134
36945
|
"nativeEvent" in t && (t = t.nativeEvent);
|
|
37135
|
-
var
|
|
37136
|
-
r =
|
|
37137
|
-
n =
|
|
37138
|
-
o =
|
|
36946
|
+
var _t33 = t,
|
|
36947
|
+
r = _t33.clientX,
|
|
36948
|
+
n = _t33.clientY,
|
|
36949
|
+
o = _t33.target;
|
|
37139
36950
|
if (null == r || null == n) throw new Error("Cannot resolve a Slate range from a DOM event: ".concat(t));
|
|
37140
36951
|
var u,
|
|
37141
36952
|
a = ln.toSlateNode(e, t.target),
|
|
@@ -37272,9 +37083,9 @@ function requireLib() {
|
|
|
37272
37083
|
},
|
|
37273
37084
|
toDOMPoint: function toDOMPoint(e, t) {
|
|
37274
37085
|
var r,
|
|
37275
|
-
_Se$
|
|
37276
|
-
_Se$
|
|
37277
|
-
n = _Se$
|
|
37086
|
+
_Se$node1 = Se.node(e, t.path),
|
|
37087
|
+
_Se$node10 = _slicedToArray(_Se$node1, 1),
|
|
37088
|
+
n = _Se$node10[0],
|
|
37278
37089
|
o = ln.toDOMNode(e, n);
|
|
37279
37090
|
Se["void"](e, {
|
|
37280
37091
|
at: t
|
|
@@ -37317,10 +37128,10 @@ function requireLib() {
|
|
|
37317
37128
|
_ref9 = _slicedToArray(_ref8, 2),
|
|
37318
37129
|
s = _ref9[0],
|
|
37319
37130
|
l = _ref9[1],
|
|
37320
|
-
|
|
37321
|
-
|
|
37322
|
-
c =
|
|
37323
|
-
f =
|
|
37131
|
+
_ref0 = o ? u : a,
|
|
37132
|
+
_ref1 = _slicedToArray(_ref0, 2),
|
|
37133
|
+
c = _ref1[0],
|
|
37134
|
+
f = _ref1[1],
|
|
37324
37135
|
d = !!(lr(s) ? s : s.parentElement).getAttribute("data-slate-zero-width"),
|
|
37325
37136
|
h = !!(lr(c) ? c : c.parentElement).getAttribute("data-slate-zero-width");
|
|
37326
37137
|
return i.setStart(s, d ? 1 : l), i.setEnd(c, h ? 1 : f), i;
|
|
@@ -37337,10 +37148,10 @@ function requireLib() {
|
|
|
37337
37148
|
o = r.suppressThrow,
|
|
37338
37149
|
_r$searchDirection = r.searchDirection,
|
|
37339
37150
|
u = _r$searchDirection === void 0 ? "backward" : _r$searchDirection,
|
|
37340
|
-
|
|
37341
|
-
var
|
|
37342
|
-
t =
|
|
37343
|
-
r =
|
|
37151
|
+
_ref10 = n ? t : function (e) {
|
|
37152
|
+
var _e0 = _slicedToArray(e, 2),
|
|
37153
|
+
t = _e0[0],
|
|
37154
|
+
r = _e0[1];
|
|
37344
37155
|
if (lr(t) && t.childNodes.length) {
|
|
37345
37156
|
var n = r === t.childNodes.length,
|
|
37346
37157
|
o = n ? r - 1 : r;
|
|
@@ -37353,9 +37164,9 @@ function requireLib() {
|
|
|
37353
37164
|
}
|
|
37354
37165
|
return [t, r];
|
|
37355
37166
|
}(t),
|
|
37356
|
-
|
|
37357
|
-
a =
|
|
37358
|
-
i =
|
|
37167
|
+
_ref11 = _slicedToArray(_ref10, 2),
|
|
37168
|
+
a = _ref11[0],
|
|
37169
|
+
i = _ref11[1],
|
|
37359
37170
|
s = a.parentNode,
|
|
37360
37171
|
l = null,
|
|
37361
37172
|
c = 0;
|
|
@@ -37663,22 +37474,22 @@ function requireLib() {
|
|
|
37663
37474
|
}
|
|
37664
37475
|
var bn = function bn(e, t) {
|
|
37665
37476
|
var r = [];
|
|
37666
|
-
var
|
|
37477
|
+
var _iterator42 = _createForOfIteratorHelper(Se.levels(e, {
|
|
37667
37478
|
at: t
|
|
37668
37479
|
})),
|
|
37669
|
-
|
|
37480
|
+
_step42;
|
|
37670
37481
|
try {
|
|
37671
|
-
for (
|
|
37672
|
-
var
|
|
37673
|
-
n =
|
|
37674
|
-
o =
|
|
37482
|
+
for (_iterator42.s(); !(_step42 = _iterator42.n()).done;) {
|
|
37483
|
+
var _step42$value = _slicedToArray(_step42.value, 2),
|
|
37484
|
+
n = _step42$value[0],
|
|
37485
|
+
o = _step42$value[1];
|
|
37675
37486
|
var u = ln.findKey(e, n);
|
|
37676
37487
|
r.push([o, u]);
|
|
37677
37488
|
}
|
|
37678
37489
|
} catch (err) {
|
|
37679
|
-
|
|
37490
|
+
_iterator42.e(err);
|
|
37680
37491
|
} finally {
|
|
37681
|
-
|
|
37492
|
+
_iterator42.f();
|
|
37682
37493
|
}
|
|
37683
37494
|
return r;
|
|
37684
37495
|
},
|
|
@@ -38209,7 +38020,7 @@ function requireLib() {
|
|
|
38209
38020
|
o.current = false;
|
|
38210
38021
|
};
|
|
38211
38022
|
}, []), o.current),
|
|
38212
|
-
|
|
38023
|
+
_ref12 = (0, e.useState)(function () {
|
|
38213
38024
|
return function (e) {
|
|
38214
38025
|
var t = e.editor,
|
|
38215
38026
|
r = e.scheduleOnDOMSelectionChange,
|
|
@@ -38304,8 +38115,8 @@ function requireLib() {
|
|
|
38304
38115
|
});
|
|
38305
38116
|
},
|
|
38306
38117
|
v = function v(e) {
|
|
38307
|
-
var
|
|
38308
|
-
o =
|
|
38118
|
+
var _ref14 = arguments.length > 1 && void 0 !== arguments[1] ? arguments[1] : {},
|
|
38119
|
+
o = _ref14.at;
|
|
38309
38120
|
l = false, on["delete"](t), r.cancel(), n.cancel(), p() && f(), nn.set(t, {
|
|
38310
38121
|
at: o,
|
|
38311
38122
|
run: e
|
|
@@ -38373,10 +38184,10 @@ function requireLib() {
|
|
|
38373
38184
|
f = true;
|
|
38374
38185
|
if (n.startsWith("delete")) {
|
|
38375
38186
|
if (Ce.isExpanded(o)) {
|
|
38376
|
-
var _Ce$
|
|
38377
|
-
_Ce$
|
|
38378
|
-
d = _Ce$
|
|
38379
|
-
p = _Ce$
|
|
38187
|
+
var _Ce$edges45 = Ce.edges(o),
|
|
38188
|
+
_Ce$edges46 = _slicedToArray(_Ce$edges45, 2),
|
|
38189
|
+
d = _Ce$edges46[0],
|
|
38190
|
+
p = _Ce$edges46[1];
|
|
38380
38191
|
if (Ae.leaf(t, d.path).text.length === d.offset && 0 === p.offset) {
|
|
38381
38192
|
var D = Se.next(t, {
|
|
38382
38193
|
at: d.path,
|
|
@@ -38389,10 +38200,10 @@ function requireLib() {
|
|
|
38389
38200
|
}
|
|
38390
38201
|
}
|
|
38391
38202
|
var C = n.endsWith("Backward") ? "backward" : "forward",
|
|
38392
|
-
_Ce$
|
|
38393
|
-
_Ce$
|
|
38394
|
-
y = _Ce$
|
|
38395
|
-
B = _Ce$
|
|
38203
|
+
_Ce$edges47 = Ce.edges(o),
|
|
38204
|
+
_Ce$edges48 = _slicedToArray(_Ce$edges47, 2),
|
|
38205
|
+
y = _Ce$edges48[0],
|
|
38206
|
+
B = _Ce$edges48[1],
|
|
38396
38207
|
_Se$leaf7 = Se.leaf(t, y.path),
|
|
38397
38208
|
_Se$leaf8 = _slicedToArray(_Se$leaf7, 2),
|
|
38398
38209
|
b = _Se$leaf8[0],
|
|
@@ -38562,10 +38373,10 @@ function requireLib() {
|
|
|
38562
38373
|
at: o
|
|
38563
38374
|
});
|
|
38564
38375
|
if (ie.equals(o.anchor.path, o.focus.path)) {
|
|
38565
|
-
var _Ce$
|
|
38566
|
-
_Ce$
|
|
38567
|
-
N = _Ce$
|
|
38568
|
-
_ = _Ce$
|
|
38376
|
+
var _Ce$edges49 = Ce.edges(o),
|
|
38377
|
+
_Ce$edges50 = _slicedToArray(_Ce$edges49, 2),
|
|
38378
|
+
N = _Ce$edges50[0],
|
|
38379
|
+
_ = _Ce$edges50[1],
|
|
38569
38380
|
z = {
|
|
38570
38381
|
start: N.offset,
|
|
38571
38382
|
end: _.offset,
|
|
@@ -38615,14 +38426,14 @@ function requireLib() {
|
|
|
38615
38426
|
editor: u
|
|
38616
38427
|
}, n));
|
|
38617
38428
|
}),
|
|
38618
|
-
|
|
38619
|
-
i =
|
|
38429
|
+
_ref13 = _slicedToArray(_ref12, 1),
|
|
38430
|
+
i = _ref13[0];
|
|
38620
38431
|
return function (t, r, n) {
|
|
38621
|
-
var
|
|
38432
|
+
var _ref15 = (0, e.useState)(function () {
|
|
38622
38433
|
return new MutationObserver(r);
|
|
38623
38434
|
}),
|
|
38624
|
-
|
|
38625
|
-
o =
|
|
38435
|
+
_ref16 = _slicedToArray(_ref15, 1),
|
|
38436
|
+
o = _ref16[0];
|
|
38626
38437
|
Oo(function () {
|
|
38627
38438
|
o.takeRecords();
|
|
38628
38439
|
}), (0, e.useEffect)(function () {
|
|
@@ -38676,9 +38487,9 @@ function requireLib() {
|
|
|
38676
38487
|
a = function a() {
|
|
38677
38488
|
return "".concat(null != n ? n : "").concat(o ? "\n" : "");
|
|
38678
38489
|
},
|
|
38679
|
-
|
|
38680
|
-
|
|
38681
|
-
i =
|
|
38490
|
+
_ref17 = (0, e.useState)(a),
|
|
38491
|
+
_ref18 = _slicedToArray(_ref17, 1),
|
|
38492
|
+
i = _ref18[0];
|
|
38682
38493
|
return Oo(function () {
|
|
38683
38494
|
var e = a();
|
|
38684
38495
|
u.current && u.current.textContent !== e && (u.current.textContent = e);
|
|
@@ -38753,10 +38564,10 @@ function requireLib() {
|
|
|
38753
38564
|
l = Eo(),
|
|
38754
38565
|
c = (0, e.useRef)(null),
|
|
38755
38566
|
f = (0, e.useRef)(null),
|
|
38756
|
-
|
|
38757
|
-
|
|
38758
|
-
d =
|
|
38759
|
-
h =
|
|
38567
|
+
_ref19 = (0, e.useState)(false),
|
|
38568
|
+
_ref20 = _slicedToArray(_ref19, 2),
|
|
38569
|
+
d = _ref20[0],
|
|
38570
|
+
h = _ref20[1],
|
|
38760
38571
|
v = (0, e.useRef)(null),
|
|
38761
38572
|
p = (0, e.useCallback)(function (e) {
|
|
38762
38573
|
if (function (e, t) {
|
|
@@ -38989,18 +38800,18 @@ function requireLib() {
|
|
|
38989
38800
|
m = Se.range(c, p),
|
|
38990
38801
|
C = s && Ce.intersection(m, s),
|
|
38991
38802
|
y = l([D, p]);
|
|
38992
|
-
var
|
|
38993
|
-
|
|
38803
|
+
var _iterator43 = _createForOfIteratorHelper(n),
|
|
38804
|
+
_step43;
|
|
38994
38805
|
try {
|
|
38995
|
-
for (
|
|
38996
|
-
var B =
|
|
38806
|
+
for (_iterator43.s(); !(_step43 = _iterator43.n()).done;) {
|
|
38807
|
+
var B = _step43.value;
|
|
38997
38808
|
var b = Ce.intersection(B, m);
|
|
38998
38809
|
b && y.push(b);
|
|
38999
38810
|
}
|
|
39000
38811
|
} catch (err) {
|
|
39001
|
-
|
|
38812
|
+
_iterator43.e(err);
|
|
39002
38813
|
} finally {
|
|
39003
|
-
|
|
38814
|
+
_iterator43.f();
|
|
39004
38815
|
}
|
|
39005
38816
|
Be.isElement(D) ? d.push(t().createElement(Go.Provider, {
|
|
39006
38817
|
key: "provider-".concat(g.id),
|
|
@@ -39177,18 +38988,18 @@ function requireLib() {
|
|
|
39177
38988
|
D = _r$disableDefaultStyl === void 0 ? false : _r$disableDefaultStyl,
|
|
39178
38989
|
g = Co(r, su),
|
|
39179
38990
|
m = nu(),
|
|
39180
|
-
|
|
39181
|
-
|
|
39182
|
-
C =
|
|
39183
|
-
y =
|
|
38991
|
+
_ref21 = (0, e.useState)(false),
|
|
38992
|
+
_ref22 = _slicedToArray(_ref21, 2),
|
|
38993
|
+
C = _ref22[0],
|
|
38994
|
+
y = _ref22[1],
|
|
39184
38995
|
B = (0, e.useRef)(null),
|
|
39185
38996
|
b = (0, e.useRef)([]),
|
|
39186
|
-
|
|
39187
|
-
|
|
39188
|
-
E =
|
|
39189
|
-
w =
|
|
38997
|
+
_ref23 = (0, e.useState)(),
|
|
38998
|
+
_ref24 = _slicedToArray(_ref23, 2),
|
|
38999
|
+
E = _ref24[0],
|
|
39000
|
+
w = _ref24[1],
|
|
39190
39001
|
A = (0, e.useRef)(false),
|
|
39191
|
-
|
|
39002
|
+
_ref25 = function () {
|
|
39192
39003
|
var t = Eo(),
|
|
39193
39004
|
r = (0, e.useRef)(false),
|
|
39194
39005
|
n = (0, e.useRef)(0),
|
|
@@ -39210,13 +39021,13 @@ function requireLib() {
|
|
|
39210
39021
|
onUserInput: o
|
|
39211
39022
|
};
|
|
39212
39023
|
}(),
|
|
39213
|
-
F =
|
|
39214
|
-
O =
|
|
39215
|
-
|
|
39024
|
+
F = _ref25.onUserInput,
|
|
39025
|
+
O = _ref25.receivedUserInput,
|
|
39026
|
+
_ref26 = (0, e.useReducer)(function (e) {
|
|
39216
39027
|
return e + 1;
|
|
39217
39028
|
}, 0),
|
|
39218
|
-
|
|
39219
|
-
x =
|
|
39029
|
+
_ref27 = _slicedToArray(_ref26, 2),
|
|
39030
|
+
x = _ref27[1];
|
|
39220
39031
|
un.set(m, x), Xr.set(m, l);
|
|
39221
39032
|
var P = (0, e.useMemo)(function () {
|
|
39222
39033
|
return {
|
|
@@ -39325,9 +39136,9 @@ function requireLib() {
|
|
|
39325
39136
|
var s = null,
|
|
39326
39137
|
l = requestAnimationFrame(function () {
|
|
39327
39138
|
if (i) {
|
|
39328
|
-
var e = function e(
|
|
39139
|
+
var e = function e(_e1) {
|
|
39329
39140
|
try {
|
|
39330
|
-
wo.toDOMNode(m, m).focus(), a(
|
|
39141
|
+
wo.toDOMNode(m, m).focus(), a(_e1);
|
|
39331
39142
|
} catch (e) {}
|
|
39332
39143
|
};
|
|
39333
39144
|
e(), s = setTimeout(function () {
|
|
@@ -39580,17 +39391,17 @@ function requireLib() {
|
|
|
39580
39391
|
}, [g.onBeforeInput, m, l]),
|
|
39581
39392
|
onInput: (0, e.useCallback)(function (e) {
|
|
39582
39393
|
if (!gu(e, g.onInput)) if (S.current) S.current.handleInput();else {
|
|
39583
|
-
var
|
|
39584
|
-
|
|
39394
|
+
var _iterator44 = _createForOfIteratorHelper(b.current),
|
|
39395
|
+
_step44;
|
|
39585
39396
|
try {
|
|
39586
|
-
for (
|
|
39587
|
-
var t =
|
|
39397
|
+
for (_iterator44.s(); !(_step44 = _iterator44.n()).done;) {
|
|
39398
|
+
var t = _step44.value;
|
|
39588
39399
|
t();
|
|
39589
39400
|
}
|
|
39590
39401
|
} catch (err) {
|
|
39591
|
-
|
|
39402
|
+
_iterator44.e(err);
|
|
39592
39403
|
} finally {
|
|
39593
|
-
|
|
39404
|
+
_iterator44.f();
|
|
39594
39405
|
}
|
|
39595
39406
|
if (b.current = [], !wo.isFocused(m)) {
|
|
39596
39407
|
var r = e.nativeEvent,
|
|
@@ -39882,7 +39693,7 @@ function requireLib() {
|
|
|
39882
39693
|
return "object" == _typeof(e) && "function" == typeof e.behavior;
|
|
39883
39694
|
}(t)) return t.behavior(rr(e, t));
|
|
39884
39695
|
var n = "boolean" == typeof t || null == t ? void 0 : t.behavior;
|
|
39885
|
-
var
|
|
39696
|
+
var _iterator45 = _createForOfIteratorHelper(rr(e, function (e) {
|
|
39886
39697
|
return false === e ? {
|
|
39887
39698
|
block: "end",
|
|
39888
39699
|
inline: "nearest"
|
|
@@ -39893,25 +39704,25 @@ function requireLib() {
|
|
|
39893
39704
|
inline: "nearest"
|
|
39894
39705
|
};
|
|
39895
39706
|
}(t))),
|
|
39896
|
-
|
|
39707
|
+
_step45;
|
|
39897
39708
|
try {
|
|
39898
|
-
for (
|
|
39899
|
-
var
|
|
39900
|
-
o =
|
|
39901
|
-
u =
|
|
39902
|
-
a =
|
|
39903
|
-
var
|
|
39904
|
-
|
|
39709
|
+
for (_iterator45.s(); !(_step45 = _iterator45.n()).done;) {
|
|
39710
|
+
var _step45$value = _step45.value,
|
|
39711
|
+
o = _step45$value.el,
|
|
39712
|
+
u = _step45$value.top,
|
|
39713
|
+
a = _step45$value.left;
|
|
39714
|
+
var _e10 = u - r.top + r.bottom,
|
|
39715
|
+
_t34 = a - r.left + r.right;
|
|
39905
39716
|
o.scroll({
|
|
39906
|
-
top:
|
|
39907
|
-
left:
|
|
39717
|
+
top: _e10,
|
|
39718
|
+
left: _t34,
|
|
39908
39719
|
behavior: n
|
|
39909
39720
|
});
|
|
39910
39721
|
}
|
|
39911
39722
|
} catch (err) {
|
|
39912
|
-
|
|
39723
|
+
_iterator45.e(err);
|
|
39913
39724
|
} finally {
|
|
39914
|
-
|
|
39725
|
+
_iterator45.f();
|
|
39915
39726
|
}
|
|
39916
39727
|
}(r, {
|
|
39917
39728
|
scrollMode: "if-needed"
|
|
@@ -39954,7 +39765,7 @@ function requireLib() {
|
|
|
39954
39765
|
_t$useState2 = _slicedToArray(_t$useState, 2),
|
|
39955
39766
|
c = _t$useState2[0],
|
|
39956
39767
|
f = _t$useState2[1],
|
|
39957
|
-
|
|
39768
|
+
_ref28 = function (t) {
|
|
39958
39769
|
var r = (0, e.useRef)([]).current,
|
|
39959
39770
|
n = (0, e.useRef)({
|
|
39960
39771
|
editor: t
|
|
@@ -39980,8 +39791,8 @@ function requireLib() {
|
|
|
39980
39791
|
onChange: o
|
|
39981
39792
|
};
|
|
39982
39793
|
}(n),
|
|
39983
|
-
d =
|
|
39984
|
-
h =
|
|
39794
|
+
d = _ref28.selectorContext,
|
|
39795
|
+
h = _ref28.onChange,
|
|
39985
39796
|
v = (0, e.useCallback)(function (e) {
|
|
39986
39797
|
var t;
|
|
39987
39798
|
u && u(n.children), "set_selection" === (null == e || null === (t = e.operation) || void 0 === t ? void 0 : t.type) ? null == a || a(n.selection) : null == i || i(n.children), f(function (e) {
|
|
@@ -39996,10 +39807,10 @@ function requireLib() {
|
|
|
39996
39807
|
Gr.set(n, function () {});
|
|
39997
39808
|
};
|
|
39998
39809
|
}, [n, v]);
|
|
39999
|
-
var
|
|
40000
|
-
|
|
40001
|
-
p =
|
|
40002
|
-
D =
|
|
39810
|
+
var _ref29 = (0, e.useState)(wo.isFocused(n)),
|
|
39811
|
+
_ref30 = _slicedToArray(_ref29, 2),
|
|
39812
|
+
p = _ref30[0],
|
|
39813
|
+
D = _ref30[1];
|
|
40003
39814
|
return (0, e.useEffect)(function () {
|
|
40004
39815
|
D(wo.isFocused(n));
|
|
40005
39816
|
}, [n]), Oo(function () {
|
|
@@ -40047,8 +39858,8 @@ function requireLib() {
|
|
|
40047
39858
|
at: r.selection
|
|
40048
39859
|
});
|
|
40049
39860
|
if (t) {
|
|
40050
|
-
var
|
|
40051
|
-
n =
|
|
39861
|
+
var _t35 = _slicedToArray(t, 2),
|
|
39862
|
+
n = _t35[1],
|
|
40052
39863
|
o = Se.range(r, n, r.selection.anchor),
|
|
40053
39864
|
a = function (e, t) {
|
|
40054
39865
|
var r = Se.range(e, Ce.end(t)),
|
|
@@ -40214,23 +40025,23 @@ function requireLib() {
|
|
|
40214
40025
|
case "set_selection":
|
|
40215
40026
|
zr.set(r, true);
|
|
40216
40027
|
}
|
|
40217
|
-
for (var
|
|
40218
|
-
var
|
|
40219
|
-
m =
|
|
40220
|
-
C =
|
|
40221
|
-
var _Se$
|
|
40222
|
-
_Se$
|
|
40223
|
-
y = _Se$
|
|
40028
|
+
for (var _i0 = 0, _o0 = o; _i0 < _o0.length; _i0++) {
|
|
40029
|
+
var _o0$_i = _slicedToArray(_o0[_i0], 2),
|
|
40030
|
+
m = _o0$_i[0],
|
|
40031
|
+
C = _o0$_i[1];
|
|
40032
|
+
var _Se$node11 = Se.node(r, m),
|
|
40033
|
+
_Se$node12 = _slicedToArray(_Se$node11, 1),
|
|
40034
|
+
y = _Se$node12[0];
|
|
40224
40035
|
$r.set(y, C);
|
|
40225
40036
|
}
|
|
40226
|
-
for (var
|
|
40227
|
-
var _u6$_i = _slicedToArray(_u6[
|
|
40037
|
+
for (var _i1 = 0, _u6 = u; _i1 < _u6.length; _i1++) {
|
|
40038
|
+
var _u6$_i = _slicedToArray(_u6[_i1], 2),
|
|
40228
40039
|
B = _u6$_i[0],
|
|
40229
40040
|
b = _u6$_i[1];
|
|
40230
40041
|
if (B.current) {
|
|
40231
|
-
var _Se$
|
|
40232
|
-
_Se$
|
|
40233
|
-
E = _Se$
|
|
40042
|
+
var _Se$node13 = Se.node(r, B.current),
|
|
40043
|
+
_Se$node14 = _slicedToArray(_Se$node13, 1),
|
|
40044
|
+
E = _Se$node14[0];
|
|
40234
40045
|
$r.set(E, b);
|
|
40235
40046
|
}
|
|
40236
40047
|
B.unref();
|
|
@@ -40238,10 +40049,10 @@ function requireLib() {
|
|
|
40238
40049
|
}, r.setFragmentData = function (e) {
|
|
40239
40050
|
var n = r.selection;
|
|
40240
40051
|
if (n) {
|
|
40241
|
-
var _Ce$
|
|
40242
|
-
_Ce$
|
|
40243
|
-
o = _Ce$
|
|
40244
|
-
u = _Ce$
|
|
40052
|
+
var _Ce$edges51 = Ce.edges(n),
|
|
40053
|
+
_Ce$edges52 = _slicedToArray(_Ce$edges51, 2),
|
|
40054
|
+
o = _Ce$edges52[0],
|
|
40055
|
+
u = _Ce$edges52[1],
|
|
40245
40056
|
a = Se["void"](r, {
|
|
40246
40057
|
at: o.path
|
|
40247
40058
|
}),
|
|
@@ -40255,8 +40066,8 @@ function requireLib() {
|
|
|
40255
40066
|
if (l.childNodes.forEach(function (e) {
|
|
40256
40067
|
e.textContent && "" !== e.textContent.trim() && (c = e);
|
|
40257
40068
|
}), i) {
|
|
40258
|
-
var
|
|
40259
|
-
f =
|
|
40069
|
+
var _i10 = _slicedToArray(i, 1),
|
|
40070
|
+
f = _i10[0],
|
|
40260
40071
|
d = s.cloneRange(),
|
|
40261
40072
|
h = ln.toDOMNode(r, f);
|
|
40262
40073
|
d.setEndAfter(h), l = d.cloneContents();
|
|
@@ -40281,9 +40092,9 @@ function requireLib() {
|
|
|
40281
40092
|
}, r.insertFragmentData = function (e) {
|
|
40282
40093
|
var n = e.getData("application/".concat(t)) || function (e) {
|
|
40283
40094
|
var t = e.getData("text/html"),
|
|
40284
|
-
|
|
40285
|
-
|
|
40286
|
-
r =
|
|
40095
|
+
_ref31 = t.match(Dr) || [],
|
|
40096
|
+
_ref32 = _slicedToArray(_ref31, 2),
|
|
40097
|
+
r = _ref32[1];
|
|
40287
40098
|
return r;
|
|
40288
40099
|
}(e);
|
|
40289
40100
|
if (n) {
|
|
@@ -40297,19 +40108,19 @@ function requireLib() {
|
|
|
40297
40108
|
if (t) {
|
|
40298
40109
|
var n = t.split(/\r\n|\r|\n/),
|
|
40299
40110
|
o = false;
|
|
40300
|
-
var
|
|
40301
|
-
|
|
40111
|
+
var _iterator46 = _createForOfIteratorHelper(n),
|
|
40112
|
+
_step46;
|
|
40302
40113
|
try {
|
|
40303
|
-
for (
|
|
40304
|
-
var u =
|
|
40114
|
+
for (_iterator46.s(); !(_step46 = _iterator46.n()).done;) {
|
|
40115
|
+
var u = _step46.value;
|
|
40305
40116
|
o && yt.splitNodes(r, {
|
|
40306
40117
|
always: !0
|
|
40307
40118
|
}), r.insertText(u), o = !0;
|
|
40308
40119
|
}
|
|
40309
40120
|
} catch (err) {
|
|
40310
|
-
|
|
40121
|
+
_iterator46.e(err);
|
|
40311
40122
|
} finally {
|
|
40312
|
-
|
|
40123
|
+
_iterator46.f();
|
|
40313
40124
|
}
|
|
40314
40125
|
return true;
|
|
40315
40126
|
}
|
|
@@ -40319,8 +40130,8 @@ function requireLib() {
|
|
|
40319
40130
|
t && t(e), o(e);
|
|
40320
40131
|
}, r;
|
|
40321
40132
|
}(t, arguments.length > 1 && void 0 !== arguments[1] ? arguments[1] : "x-slate-fragment");
|
|
40322
|
-
var
|
|
40323
|
-
r =
|
|
40133
|
+
var _t36 = t,
|
|
40134
|
+
r = _t36.onChange;
|
|
40324
40135
|
return t.onChange = function (e) {
|
|
40325
40136
|
(bu < 18 ? mo().unstable_batchedUpdates : function (e) {
|
|
40326
40137
|
return e();
|
|
@@ -40387,17 +40198,17 @@ function requireLib() {
|
|
|
40387
40198
|
var n = r[r.length - 1];
|
|
40388
40199
|
n.selectionBefore && yt.setSelection(t, n.selectionBefore), Su.withoutSaving(t, function () {
|
|
40389
40200
|
Se.withoutNormalizing(t, function () {
|
|
40390
|
-
var
|
|
40391
|
-
|
|
40201
|
+
var _iterator47 = _createForOfIteratorHelper(n.operations),
|
|
40202
|
+
_step47;
|
|
40392
40203
|
try {
|
|
40393
|
-
for (
|
|
40394
|
-
var e =
|
|
40204
|
+
for (_iterator47.s(); !(_step47 = _iterator47.n()).done;) {
|
|
40205
|
+
var e = _step47.value;
|
|
40395
40206
|
t.apply(e);
|
|
40396
40207
|
}
|
|
40397
40208
|
} catch (err) {
|
|
40398
|
-
|
|
40209
|
+
_iterator47.e(err);
|
|
40399
40210
|
} finally {
|
|
40400
|
-
|
|
40211
|
+
_iterator47.f();
|
|
40401
40212
|
}
|
|
40402
40213
|
});
|
|
40403
40214
|
}), e.redos.pop(), t.writeHistory("undos", n);
|
|
@@ -40410,17 +40221,17 @@ function requireLib() {
|
|
|
40410
40221
|
Su.withoutSaving(t, function () {
|
|
40411
40222
|
Se.withoutNormalizing(t, function () {
|
|
40412
40223
|
var e = n.operations.map(xe.inverse).reverse();
|
|
40413
|
-
var
|
|
40414
|
-
|
|
40224
|
+
var _iterator48 = _createForOfIteratorHelper(e),
|
|
40225
|
+
_step48;
|
|
40415
40226
|
try {
|
|
40416
|
-
for (
|
|
40417
|
-
var r =
|
|
40227
|
+
for (_iterator48.s(); !(_step48 = _iterator48.n()).done;) {
|
|
40228
|
+
var r = _step48.value;
|
|
40418
40229
|
t.apply(r);
|
|
40419
40230
|
}
|
|
40420
40231
|
} catch (err) {
|
|
40421
|
-
|
|
40232
|
+
_iterator48.e(err);
|
|
40422
40233
|
} finally {
|
|
40423
|
-
|
|
40234
|
+
_iterator48.f();
|
|
40424
40235
|
}
|
|
40425
40236
|
n.selectionBefore && yt.setSelection(t, n.selectionBefore);
|
|
40426
40237
|
});
|
|
@@ -41107,12 +40918,12 @@ function requireLib() {
|
|
|
41107
40918
|
});
|
|
41108
40919
|
};
|
|
41109
40920
|
var ai = function ai() {
|
|
41110
|
-
var e = function e(
|
|
41111
|
-
if (Ta(
|
|
41112
|
-
var t = (r =
|
|
41113
|
-
console[t]("%c ".concat(
|
|
41114
|
-
data:
|
|
41115
|
-
event:
|
|
40921
|
+
var e = function e(_e11) {
|
|
40922
|
+
if (Ta(_e11)) {
|
|
40923
|
+
var t = (r = _e11.data.data) && Object.keys(r).length < 1 ? "groupCollapsed" : "group";
|
|
40924
|
+
console[t]("%c ".concat(_e11.data.type, " "), "color: limegreen;"), console.log({
|
|
40925
|
+
data: _e11.data.data,
|
|
40926
|
+
event: _e11
|
|
41116
40927
|
}), console.groupEnd();
|
|
41117
40928
|
}
|
|
41118
40929
|
var r;
|
|
@@ -42132,9 +41943,9 @@ function requireLib() {
|
|
|
42132
41943
|
}, t().createElement("code", null, JSON.stringify(r, null, 2)));
|
|
42133
41944
|
},
|
|
42134
41945
|
Fs = function Fs(e) {
|
|
42135
|
-
return t = function t(
|
|
41946
|
+
return t = function t(_t37) {
|
|
42136
41947
|
return function () {
|
|
42137
|
-
return e(
|
|
41948
|
+
return e(_t37(_t37)).apply(void 0, arguments);
|
|
42138
41949
|
};
|
|
42139
41950
|
}, function () {
|
|
42140
41951
|
return e(t(t)).apply(void 0, arguments);
|