@harbour-enterprises/superdoc 0.11.23 → 0.11.24

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.
@@ -12693,7 +12693,7 @@ Actual: ` + p3.attribValue
12693
12693
  checkFnExists: function(r22, e) {
12694
12694
  return r22 + "Fn" in e;
12695
12695
  }
12696
- }, tc$2 = jo$2, me$2 = Ti$2, Tt$1 = Si$2.isArray, j, le$3;
12696
+ }, tc$2 = jo$2, me$2 = Ti$2, Tt$1 = Si$2.isArray, j, le$2;
12697
12697
  function rc$2(r22) {
12698
12698
  return j = me$2.copyOptions(r22), me$2.ensureFlagExists("ignoreDeclaration", j), me$2.ensureFlagExists("ignoreInstruction", j), me$2.ensureFlagExists("ignoreAttributes", j), me$2.ensureFlagExists("ignoreText", j), me$2.ensureFlagExists("ignoreComment", j), me$2.ensureFlagExists("ignoreCdata", j), me$2.ensureFlagExists("ignoreDoctype", j), me$2.ensureFlagExists("compact", j), me$2.ensureFlagExists("alwaysChildren", j), me$2.ensureFlagExists("addParent", j), me$2.ensureFlagExists("trim", j), me$2.ensureFlagExists("nativeType", j), me$2.ensureFlagExists("nativeTypeAttributes", j), me$2.ensureFlagExists("sanitize", j), me$2.ensureFlagExists("instructionHasAttributes", j), me$2.ensureFlagExists("captureSpacesBetweenElements", j), me$2.ensureAlwaysArrayExists(j), me$2.ensureKeyExists("declaration", j), me$2.ensureKeyExists("instruction", j), me$2.ensureKeyExists("attributes", j), me$2.ensureKeyExists("text", j), me$2.ensureKeyExists("comment", j), me$2.ensureKeyExists("cdata", j), me$2.ensureKeyExists("doctype", j), me$2.ensureKeyExists("type", j), me$2.ensureKeyExists("name", j), me$2.ensureKeyExists("elements", j), me$2.ensureKeyExists("parent", j), j;
12699
12699
  }
@@ -12707,37 +12707,37 @@ Actual: ` + p3.attribValue
12707
12707
  function Yt$3(r22, e) {
12708
12708
  var t;
12709
12709
  if (j.compact) {
12710
- if (!le$3[j[r22 + "Key"]] && (Tt$1(j.alwaysArray) ? j.alwaysArray.indexOf(j[r22 + "Key"]) !== -1 : j.alwaysArray) && (le$3[j[r22 + "Key"]] = []), le$3[j[r22 + "Key"]] && !Tt$1(le$3[j[r22 + "Key"]]) && (le$3[j[r22 + "Key"]] = [le$3[j[r22 + "Key"]]]), r22 + "Fn" in j && typeof e == "string" && (e = j[r22 + "Fn"](e, le$3)), r22 === "instruction" && ("instructionFn" in j || "instructionNameFn" in j)) {
12710
+ if (!le$2[j[r22 + "Key"]] && (Tt$1(j.alwaysArray) ? j.alwaysArray.indexOf(j[r22 + "Key"]) !== -1 : j.alwaysArray) && (le$2[j[r22 + "Key"]] = []), le$2[j[r22 + "Key"]] && !Tt$1(le$2[j[r22 + "Key"]]) && (le$2[j[r22 + "Key"]] = [le$2[j[r22 + "Key"]]]), r22 + "Fn" in j && typeof e == "string" && (e = j[r22 + "Fn"](e, le$2)), r22 === "instruction" && ("instructionFn" in j || "instructionNameFn" in j)) {
12711
12711
  for (t in e)
12712
12712
  if (e.hasOwnProperty(t))
12713
12713
  if ("instructionFn" in j)
12714
- e[t] = j.instructionFn(e[t], t, le$3);
12714
+ e[t] = j.instructionFn(e[t], t, le$2);
12715
12715
  else {
12716
12716
  var n = e[t];
12717
- delete e[t], e[j.instructionNameFn(t, n, le$3)] = n;
12717
+ delete e[t], e[j.instructionNameFn(t, n, le$2)] = n;
12718
12718
  }
12719
12719
  }
12720
- Tt$1(le$3[j[r22 + "Key"]]) ? le$3[j[r22 + "Key"]].push(e) : le$3[j[r22 + "Key"]] = e;
12720
+ Tt$1(le$2[j[r22 + "Key"]]) ? le$2[j[r22 + "Key"]].push(e) : le$2[j[r22 + "Key"]] = e;
12721
12721
  } else {
12722
- le$3[j.elementsKey] || (le$3[j.elementsKey] = []);
12722
+ le$2[j.elementsKey] || (le$2[j.elementsKey] = []);
12723
12723
  var i3 = {};
12724
12724
  if (i3[j.typeKey] = r22, r22 === "instruction") {
12725
12725
  for (t in e)
12726
12726
  if (e.hasOwnProperty(t))
12727
12727
  break;
12728
- i3[j.nameKey] = "instructionNameFn" in j ? j.instructionNameFn(t, e, le$3) : t, j.instructionHasAttributes ? (i3[j.attributesKey] = e[t][j.attributesKey], "instructionFn" in j && (i3[j.attributesKey] = j.instructionFn(i3[j.attributesKey], t, le$3))) : ("instructionFn" in j && (e[t] = j.instructionFn(e[t], t, le$3)), i3[j.instructionKey] = e[t]);
12728
+ i3[j.nameKey] = "instructionNameFn" in j ? j.instructionNameFn(t, e, le$2) : t, j.instructionHasAttributes ? (i3[j.attributesKey] = e[t][j.attributesKey], "instructionFn" in j && (i3[j.attributesKey] = j.instructionFn(i3[j.attributesKey], t, le$2))) : ("instructionFn" in j && (e[t] = j.instructionFn(e[t], t, le$2)), i3[j.instructionKey] = e[t]);
12729
12729
  } else
12730
- r22 + "Fn" in j && (e = j[r22 + "Fn"](e, le$3)), i3[j[r22 + "Key"]] = e;
12731
- j.addParent && (i3[j.parentKey] = le$3), le$3[j.elementsKey].push(i3);
12730
+ r22 + "Fn" in j && (e = j[r22 + "Fn"](e, le$2)), i3[j[r22 + "Key"]] = e;
12731
+ j.addParent && (i3[j.parentKey] = le$2), le$2[j.elementsKey].push(i3);
12732
12732
  }
12733
12733
  }
12734
12734
  function la$1(r22) {
12735
- if ("attributesFn" in j && r22 && (r22 = j.attributesFn(r22, le$3)), (j.trim || "attributeValueFn" in j || "attributeNameFn" in j || j.nativeTypeAttributes) && r22) {
12735
+ if ("attributesFn" in j && r22 && (r22 = j.attributesFn(r22, le$2)), (j.trim || "attributeValueFn" in j || "attributeNameFn" in j || j.nativeTypeAttributes) && r22) {
12736
12736
  var e;
12737
12737
  for (e in r22)
12738
- if (r22.hasOwnProperty(e) && (j.trim && (r22[e] = r22[e].trim()), j.nativeTypeAttributes && (r22[e] = ua$1(r22[e])), "attributeValueFn" in j && (r22[e] = j.attributeValueFn(r22[e], e, le$3)), "attributeNameFn" in j)) {
12738
+ if (r22.hasOwnProperty(e) && (j.trim && (r22[e] = r22[e].trim()), j.nativeTypeAttributes && (r22[e] = ua$1(r22[e])), "attributeValueFn" in j && (r22[e] = j.attributeValueFn(r22[e], e, le$2)), "attributeNameFn" in j)) {
12739
12739
  var t = r22[e];
12740
- delete r22[e], r22[j.attributeNameFn(e, r22[e], le$3)] = t;
12740
+ delete r22[e], r22[j.attributeNameFn(e, r22[e], le$2)] = t;
12741
12741
  }
12742
12742
  }
12743
12743
  return r22;
@@ -12752,7 +12752,7 @@ Actual: ` + p3.attribValue
12752
12752
  if (r22.name.toLowerCase() === "xml") {
12753
12753
  if (j.ignoreDeclaration)
12754
12754
  return;
12755
- le$3[j.declarationKey] = {}, Object.keys(e).length && (le$3[j.declarationKey][j.attributesKey] = e), j.addParent && (le$3[j.declarationKey][j.parentKey] = le$3);
12755
+ le$2[j.declarationKey] = {}, Object.keys(e).length && (le$2[j.declarationKey][j.attributesKey] = e), j.addParent && (le$2[j.declarationKey][j.parentKey] = le$2);
12756
12756
  } else {
12757
12757
  if (j.ignoreInstruction)
12758
12758
  return;
@@ -12763,17 +12763,17 @@ Actual: ` + p3.attribValue
12763
12763
  }
12764
12764
  function ic$2(r22, e) {
12765
12765
  var t;
12766
- if (typeof r22 == "object" && (e = r22.attributes, r22 = r22.name), e = la$1(e), "elementNameFn" in j && (r22 = j.elementNameFn(r22, le$3)), j.compact) {
12766
+ if (typeof r22 == "object" && (e = r22.attributes, r22 = r22.name), e = la$1(e), "elementNameFn" in j && (r22 = j.elementNameFn(r22, le$2)), j.compact) {
12767
12767
  if (t = {}, !j.ignoreAttributes && e && Object.keys(e).length) {
12768
12768
  t[j.attributesKey] = {};
12769
12769
  var n;
12770
12770
  for (n in e)
12771
12771
  e.hasOwnProperty(n) && (t[j.attributesKey][n] = e[n]);
12772
12772
  }
12773
- !(r22 in le$3) && (Tt$1(j.alwaysArray) ? j.alwaysArray.indexOf(r22) !== -1 : j.alwaysArray) && (le$3[r22] = []), le$3[r22] && !Tt$1(le$3[r22]) && (le$3[r22] = [le$3[r22]]), Tt$1(le$3[r22]) ? le$3[r22].push(t) : le$3[r22] = t;
12773
+ !(r22 in le$2) && (Tt$1(j.alwaysArray) ? j.alwaysArray.indexOf(r22) !== -1 : j.alwaysArray) && (le$2[r22] = []), le$2[r22] && !Tt$1(le$2[r22]) && (le$2[r22] = [le$2[r22]]), Tt$1(le$2[r22]) ? le$2[r22].push(t) : le$2[r22] = t;
12774
12774
  } else
12775
- le$3[j.elementsKey] || (le$3[j.elementsKey] = []), t = {}, t[j.typeKey] = "element", t[j.nameKey] = r22, !j.ignoreAttributes && e && Object.keys(e).length && (t[j.attributesKey] = e), j.alwaysChildren && (t[j.elementsKey] = []), le$3[j.elementsKey].push(t);
12776
- t[j.parentKey] = le$3, le$3 = t;
12775
+ le$2[j.elementsKey] || (le$2[j.elementsKey] = []), t = {}, t[j.typeKey] = "element", t[j.nameKey] = r22, !j.ignoreAttributes && e && Object.keys(e).length && (t[j.attributesKey] = e), j.alwaysChildren && (t[j.elementsKey] = []), le$2[j.elementsKey].push(t);
12776
+ t[j.parentKey] = le$2, le$2 = t;
12777
12777
  }
12778
12778
  function sc$2(r22) {
12779
12779
  j.ignoreText || !r22.trim() && !j.captureSpacesBetweenElements || (j.trim && (r22 = r22.trim()), j.nativeType && (r22 = ua$1(r22)), j.sanitize && (r22 = r22.replace(/&/g, "&amp;").replace(/</g, "&lt;").replace(/>/g, "&gt;")), Yt$3("text", r22));
@@ -12782,8 +12782,8 @@ Actual: ` + p3.attribValue
12782
12782
  j.ignoreComment || (j.trim && (r22 = r22.trim()), Yt$3("comment", r22));
12783
12783
  }
12784
12784
  function ac$2(r22) {
12785
- var e = le$3[j.parentKey];
12786
- j.addParent || delete le$3[j.parentKey], le$3 = e;
12785
+ var e = le$2[j.parentKey];
12786
+ j.addParent || delete le$2[j.parentKey], le$2 = e;
12787
12787
  }
12788
12788
  function uc$2(r22) {
12789
12789
  j.ignoreCdata || (j.trim && (r22 = r22.trim()), Yt$3("cdata", r22));
@@ -12796,7 +12796,7 @@ Actual: ` + p3.attribValue
12796
12796
  }
12797
12797
  var ca$2 = function(r22, e) {
12798
12798
  var t = tc$2.parser(true, {}), n = {};
12799
- if (le$3 = n, j = rc$2(e), t.opt = { strictEntities: true }, t.onopentag = ic$2, t.ontext = sc$2, t.oncomment = oc$2, t.onclosetag = ac$2, t.onerror = cc$2, t.oncdata = uc$2, t.ondoctype = lc$2, t.onprocessinginstruction = nc$2, t.write(r22).close(), n[j.elementsKey]) {
12799
+ if (le$2 = n, j = rc$2(e), t.opt = { strictEntities: true }, t.onopentag = ic$2, t.ontext = sc$2, t.oncomment = oc$2, t.onclosetag = ac$2, t.onerror = cc$2, t.oncdata = uc$2, t.ondoctype = lc$2, t.onprocessinginstruction = nc$2, t.write(r22).close(), n[j.elementsKey]) {
12800
12800
  var i3 = n[j.elementsKey];
12801
12801
  delete n[j.elementsKey], n[j.elementsKey] = i3, delete n.text;
12802
12802
  }
@@ -13688,7 +13688,7 @@ Actual: ` + p3.attribValue
13688
13688
  we$1.none = [];
13689
13689
  let pr$1 = class pr extends Error {
13690
13690
  };
13691
- let ae$3 = class ae2 {
13691
+ let ae$4 = class ae2 {
13692
13692
  /**
13693
13693
  Create a slice. When specifying a non-zero open depth, you must
13694
13694
  make sure that there are nodes of at least that depth at the
@@ -13768,7 +13768,7 @@ Actual: ` + p3.attribValue
13768
13768
  return new ae2(e, n, i3);
13769
13769
  }
13770
13770
  };
13771
- ae$3.empty = new ae$3(Q$2.empty, 0, 0);
13771
+ ae$4.empty = new ae$4(Q$2.empty, 0, 0);
13772
13772
  function Ea$2(r22, e, t) {
13773
13773
  let { index: n, offset: i3 } = r22.findIndex(e), s = r22.maybeChild(n), { index: o, offset: a } = r22.findIndex(t);
13774
13774
  if (i3 == e || s.isText) {
@@ -14294,9 +14294,9 @@ Actual: ` + p3.attribValue
14294
14294
  */
14295
14295
  slice(e, t = this.content.size, n = false) {
14296
14296
  if (e == t)
14297
- return ae$3.empty;
14297
+ return ae$4.empty;
14298
14298
  let i3 = this.resolve(e), s = this.resolve(t), o = n ? 0 : i3.sharedDepth(t), a = i3.start(o), c3 = i3.node(o).content.cut(i3.pos - a, s.pos - a);
14299
- return new ae$3(c3, i3.depth - o, s.depth - o);
14299
+ return new ae$4(c3, i3.depth - o, s.depth - o);
14300
14300
  }
14301
14301
  /**
14302
14302
  Replace the part of the document between the given positions with
@@ -15337,7 +15337,7 @@ Actual: ` + p3.attribValue
15337
15337
  */
15338
15338
  parseSlice(e, t = {}) {
15339
15339
  let n = new co$3(this, t, true);
15340
- return n.addAll(e, we$1.none, t.from, t.to), ae$3.maxOpen(n.finish());
15340
+ return n.addAll(e, we$1.none, t.from, t.to), ae$4.maxOpen(n.finish());
15341
15341
  }
15342
15342
  /**
15343
15343
  @internal
@@ -16311,7 +16311,7 @@ Actual: ` + p3.attribValue
16311
16311
  super(), this.from = e, this.to = t, this.mark = n;
16312
16312
  }
16313
16313
  apply(e) {
16314
- let t = e.slice(this.from, this.to), n = e.resolve(this.from), i3 = n.node(n.sharedDepth(this.to)), s = new ae$3(Bi$2(t.content, (o, a) => !o.isAtom || !a.type.allowsMarkType(this.mark.type) ? o : o.mark(this.mark.addToSet(o.marks)), i3), t.openStart, t.openEnd);
16314
+ let t = e.slice(this.from, this.to), n = e.resolve(this.from), i3 = n.node(n.sharedDepth(this.to)), s = new ae$4(Bi$2(t.content, (o, a) => !o.isAtom || !a.type.allowsMarkType(this.mark.type) ? o : o.mark(this.mark.addToSet(o.marks)), i3), t.openStart, t.openEnd);
16315
16315
  return Ce$2.fromReplace(e, this.from, this.to, s);
16316
16316
  }
16317
16317
  invert() {
@@ -16350,7 +16350,7 @@ Actual: ` + p3.attribValue
16350
16350
  super(), this.from = e, this.to = t, this.mark = n;
16351
16351
  }
16352
16352
  apply(e) {
16353
- let t = e.slice(this.from, this.to), n = new ae$3(Bi$2(t.content, (i3) => i3.mark(this.mark.removeFromSet(i3.marks)), e), t.openStart, t.openEnd);
16353
+ let t = e.slice(this.from, this.to), n = new ae$4(Bi$2(t.content, (i3) => i3.mark(this.mark.removeFromSet(i3.marks)), e), t.openStart, t.openEnd);
16354
16354
  return Ce$2.fromReplace(e, this.from, this.to, n);
16355
16355
  }
16356
16356
  invert() {
@@ -16393,7 +16393,7 @@ Actual: ` + p3.attribValue
16393
16393
  if (!t)
16394
16394
  return Ce$2.fail("No node at mark step's position");
16395
16395
  let n = t.type.create(t.attrs, null, this.mark.addToSet(t.marks));
16396
- return Ce$2.fromReplace(e, this.pos, this.pos + 1, new ae$3(Q$2.from(n), 0, t.isLeaf ? 0 : 1));
16396
+ return Ce$2.fromReplace(e, this.pos, this.pos + 1, new ae$4(Q$2.from(n), 0, t.isLeaf ? 0 : 1));
16397
16397
  }
16398
16398
  invert(e) {
16399
16399
  let t = e.nodeAt(this.pos);
@@ -16437,7 +16437,7 @@ Actual: ` + p3.attribValue
16437
16437
  if (!t)
16438
16438
  return Ce$2.fail("No node at mark step's position");
16439
16439
  let n = t.type.create(t.attrs, null, this.mark.removeFromSet(t.marks));
16440
- return Ce$2.fromReplace(e, this.pos, this.pos + 1, new ae$3(Q$2.from(n), 0, t.isLeaf ? 0 : 1));
16440
+ return Ce$2.fromReplace(e, this.pos, this.pos + 1, new ae$4(Q$2.from(n), 0, t.isLeaf ? 0 : 1));
16441
16441
  }
16442
16442
  invert(e) {
16443
16443
  let t = e.nodeAt(this.pos);
@@ -16490,10 +16490,10 @@ Actual: ` + p3.attribValue
16490
16490
  if (!(e instanceof Ie2) || e.structure || this.structure)
16491
16491
  return null;
16492
16492
  if (this.from + this.slice.size == e.from && !this.slice.openEnd && !e.slice.openStart) {
16493
- let t = this.slice.size + e.slice.size == 0 ? ae$3.empty : new ae$3(this.slice.content.append(e.slice.content), this.slice.openStart, e.slice.openEnd);
16493
+ let t = this.slice.size + e.slice.size == 0 ? ae$4.empty : new ae$4(this.slice.content.append(e.slice.content), this.slice.openStart, e.slice.openEnd);
16494
16494
  return new Ie2(this.from, this.to + (e.to - e.from), t, this.structure);
16495
16495
  } else if (e.to == this.from && !this.slice.openStart && !e.slice.openEnd) {
16496
- let t = this.slice.size + e.slice.size == 0 ? ae$3.empty : new ae$3(e.slice.content.append(this.slice.content), e.slice.openStart, this.slice.openEnd);
16496
+ let t = this.slice.size + e.slice.size == 0 ? ae$4.empty : new ae$4(e.slice.content.append(this.slice.content), e.slice.openStart, this.slice.openEnd);
16497
16497
  return new Ie2(e.from, this.to, t, this.structure);
16498
16498
  } else
16499
16499
  return null;
@@ -16508,7 +16508,7 @@ Actual: ` + p3.attribValue
16508
16508
  static fromJSON(e, t) {
16509
16509
  if (typeof t.from != "number" || typeof t.to != "number")
16510
16510
  throw new RangeError("Invalid input for ReplaceStep.fromJSON");
16511
- return new Ie2(t.from, t.to, ae$3.fromJSON(e, t.slice), !!t.structure);
16511
+ return new Ie2(t.from, t.to, ae$4.fromJSON(e, t.slice), !!t.structure);
16512
16512
  }
16513
16513
  };
16514
16514
  Oe$3.jsonID("replace", Ie$2);
@@ -16566,7 +16566,7 @@ Actual: ` + p3.attribValue
16566
16566
  static fromJSON(e, t) {
16567
16567
  if (typeof t.from != "number" || typeof t.to != "number" || typeof t.gapFrom != "number" || typeof t.gapTo != "number" || typeof t.insert != "number")
16568
16568
  throw new RangeError("Invalid input for ReplaceAroundStep.fromJSON");
16569
- return new $e2(t.from, t.to, t.gapFrom, t.gapTo, ae$3.fromJSON(e, t.slice), t.insert, !!t.structure);
16569
+ return new $e2(t.from, t.to, t.gapFrom, t.gapTo, ae$4.fromJSON(e, t.slice), t.insert, !!t.structure);
16570
16570
  }
16571
16571
  };
16572
16572
  Oe$3.jsonID("replaceAround", $e$2);
@@ -16628,7 +16628,7 @@ Actual: ` + p3.attribValue
16628
16628
  for (let u = 0; u < s.childCount; u++) {
16629
16629
  let c3 = s.child(u), l = a + c3.nodeSize, h3 = n.matchType(c3.type);
16630
16630
  if (!h3)
16631
- o.push(new Ie$2(a, l, ae$3.empty));
16631
+ o.push(new Ie$2(a, l, ae$4.empty));
16632
16632
  else {
16633
16633
  n = h3;
16634
16634
  for (let g = 0; g < c3.marks.length; g++)
@@ -16636,14 +16636,14 @@ Actual: ` + p3.attribValue
16636
16636
  if (i3 && c3.isText && t.whitespace != "pre") {
16637
16637
  let g, E3 = /\r?\n|\r/g, D3;
16638
16638
  for (; g = E3.exec(c3.text); )
16639
- D3 || (D3 = new ae$3(Q$2.from(t.schema.text(" ", t.allowedMarks(c3.marks))), 0, 0)), o.push(new Ie$2(a + g.index, a + g.index + g[0].length, D3));
16639
+ D3 || (D3 = new ae$4(Q$2.from(t.schema.text(" ", t.allowedMarks(c3.marks))), 0, 0)), o.push(new Ie$2(a + g.index, a + g.index + g[0].length, D3));
16640
16640
  }
16641
16641
  }
16642
16642
  a = l;
16643
16643
  }
16644
16644
  if (!n.validEnd) {
16645
16645
  let u = n.fillBefore(Q$2.empty, true);
16646
- r22.replace(a, a, new ae$3(u, 0, 0));
16646
+ r22.replace(a, a, new ae$4(u, 0, 0));
16647
16647
  }
16648
16648
  for (let u = o.length - 1; u >= 0; u--)
16649
16649
  r22.step(o[u]);
@@ -16669,7 +16669,7 @@ Actual: ` + p3.attribValue
16669
16669
  let g = Q$2.empty, E3 = 0;
16670
16670
  for (let D3 = s, v = false; D3 > t; D3--)
16671
16671
  v || i3.after(D3 + 1) < i3.end(D3) ? (v = true, g = Q$2.from(i3.node(D3).copy(g)), E3++) : c3++;
16672
- r22.step(new $e$2(u, c3, o, a, new ae$3(l.append(g), h3, E3), l.size - h3, true));
16672
+ r22.step(new $e$2(u, c3, o, a, new ae$4(l.append(g), h3, E3), l.size - h3, true));
16673
16673
  }
16674
16674
  function Ip$1(r22, e, t = null, n = r22) {
16675
16675
  let i3 = cf$2(r22, e), s = i3 && ff$2(n, e);
@@ -16705,7 +16705,7 @@ Actual: ` + p3.attribValue
16705
16705
  n = Q$2.from(t[o].type.create(t[o].attrs, n));
16706
16706
  }
16707
16707
  let i3 = e.start, s = e.end;
16708
- r22.step(new $e$2(i3, s, i3, s, new ae$3(n, 0, 0), t.length, true));
16708
+ r22.step(new $e$2(i3, s, i3, s, new ae$4(n, 0, 0), t.length, true));
16709
16709
  }
16710
16710
  function mf$2(r22, e, t, n, i3) {
16711
16711
  if (!n.isTextblock)
@@ -16721,7 +16721,7 @@ Actual: ` + p3.attribValue
16721
16721
  }
16722
16722
  c3 === false && Ga$2(r22, o, a, s), ki$2(r22, r22.mapping.slice(s).map(a, 1), n, void 0, c3 === null);
16723
16723
  let l = r22.mapping.slice(s), h3 = l.map(a, 1), g = l.map(a + o.nodeSize, 1);
16724
- return r22.step(new $e$2(h3, g, h3 + 1, g - 1, new ae$3(Q$2.from(n.create(u, null, o.marks)), 0, 0), 1, true)), c3 === true && za$2(r22, o, a, s), false;
16724
+ return r22.step(new $e$2(h3, g, h3 + 1, g - 1, new ae$4(Q$2.from(n.create(u, null, o.marks)), 0, 0), 1, true)), c3 === true && za$2(r22, o, a, s), false;
16725
16725
  }
16726
16726
  });
16727
16727
  }
@@ -16759,7 +16759,7 @@ Actual: ` + p3.attribValue
16759
16759
  return r22.replaceWith(e, e + s.nodeSize, o);
16760
16760
  if (!t.validContent(s.content))
16761
16761
  throw new RangeError("Invalid content for node type " + t.name);
16762
- r22.step(new $e$2(e, e + s.nodeSize, e + 1, e + s.nodeSize - 1, new ae$3(Q$2.from(o), 0, 0), 1, true));
16762
+ r22.step(new $e$2(e, e + s.nodeSize, e + 1, e + s.nodeSize - 1, new ae$4(Q$2.from(o), 0, 0), 1, true));
16763
16763
  }
16764
16764
  function Rp$1(r22, e, t = 1, n) {
16765
16765
  let i3 = r22.resolve(e), s = i3.depth - t, o = n && n[n.length - 1] || i3.parent;
@@ -16785,7 +16785,7 @@ Actual: ` + p3.attribValue
16785
16785
  let l = n && n[c3];
16786
16786
  o = Q$2.from(l ? l.type.create(l.attrs, o) : i3.node(a).copy(o));
16787
16787
  }
16788
- r22.step(new Ie$2(e, e, new ae$3(s.append(o), t, t), true));
16788
+ r22.step(new Ie$2(e, e, new ae$4(s.append(o), t, t), true));
16789
16789
  }
16790
16790
  function Pp$1(r22, e) {
16791
16791
  let t = r22.resolve(e), n = t.index();
@@ -16828,7 +16828,7 @@ Actual: ` + p3.attribValue
16828
16828
  }
16829
16829
  o.inlineContent && ki$2(r22, e + t - 1, o, s.node().contentMatchAt(s.index()), n == null);
16830
16830
  let u = r22.mapping.slice(a), c3 = u.map(e - t);
16831
- if (r22.step(new Ie$2(c3, u.map(e + t, -1), ae$3.empty, true)), n === true) {
16831
+ if (r22.step(new Ie$2(c3, u.map(e + t, -1), ae$4.empty, true)), n === true) {
16832
16832
  let l = r22.doc.resolve(c3);
16833
16833
  za$2(r22, l.node(), l.before(), r22.steps.length);
16834
16834
  }
@@ -16877,7 +16877,7 @@ Actual: ` + p3.attribValue
16877
16877
  }
16878
16878
  return null;
16879
16879
  }
16880
- function xf$2(r22, e, t = e, n = ae$3.empty) {
16880
+ function xf$2(r22, e, t = e, n = ae$4.empty) {
16881
16881
  if (e == t && !n.size)
16882
16882
  return null;
16883
16883
  let i3 = r22.resolve(e), s = r22.resolve(t);
@@ -16913,7 +16913,7 @@ Actual: ` + p3.attribValue
16913
16913
  let s = this.placed, o = n.depth, a = i3.depth;
16914
16914
  for (; o && a && s.childCount == 1; )
16915
16915
  s = s.firstChild.content, o--, a--;
16916
- let u = new ae$3(s, o, a);
16916
+ let u = new ae$4(s, o, a);
16917
16917
  return e > -1 ? new $e$2(n.pos, e, this.$to.pos, this.$to.end(), u, t) : u.size || n.pos != this.$to.pos ? new Ie$2(n.pos, i3.pos, u) : null;
16918
16918
  }
16919
16919
  // Find a position on the start spine of `this.unplaced` that has
@@ -16947,15 +16947,15 @@ Actual: ` + p3.attribValue
16947
16947
  }
16948
16948
  openMore() {
16949
16949
  let { content: e, openStart: t, openEnd: n } = this.unplaced, i3 = ri$2(e, t);
16950
- return !i3.childCount || i3.firstChild.isLeaf ? false : (this.unplaced = new ae$3(e, t + 1, Math.max(n, i3.size + t >= e.size - n ? t + 1 : 0)), true);
16950
+ return !i3.childCount || i3.firstChild.isLeaf ? false : (this.unplaced = new ae$4(e, t + 1, Math.max(n, i3.size + t >= e.size - n ? t + 1 : 0)), true);
16951
16951
  }
16952
16952
  dropNode() {
16953
16953
  let { content: e, openStart: t, openEnd: n } = this.unplaced, i3 = ri$2(e, t);
16954
16954
  if (i3.childCount <= 1 && t > 0) {
16955
16955
  let s = e.size - t <= t + i3.size;
16956
- this.unplaced = new ae$3(Ut$3(e, t - 1, 1), t - 1, s ? t - 1 : n);
16956
+ this.unplaced = new ae$4(Ut$3(e, t - 1, 1), t - 1, s ? t - 1 : n);
16957
16957
  } else
16958
- this.unplaced = new ae$3(Ut$3(e, t, 1), t, n);
16958
+ this.unplaced = new ae$4(Ut$3(e, t, 1), t, n);
16959
16959
  }
16960
16960
  // Move content from the unplaced slice at `sliceDepth` to the
16961
16961
  // frontier node at `frontierDepth`. Close that frontier node when
@@ -16985,7 +16985,7 @@ Actual: ` + p3.attribValue
16985
16985
  let w = F3.lastChild;
16986
16986
  this.frontier.push({ type: w.type, match: w.contentMatchAt(w.childCount) }), F3 = w.content;
16987
16987
  }
16988
- this.unplaced = D3 ? e == 0 ? ae$3.empty : new ae$3(Ut$3(o.content, e - 1, 1), e - 1, E3 < 0 ? o.openEnd : e - 1) : new ae$3(Ut$3(o.content, e, c3), o.openStart, o.openEnd);
16988
+ this.unplaced = D3 ? e == 0 ? ae$4.empty : new ae$4(Ut$3(o.content, e - 1, 1), e - 1, E3 < 0 ? o.openEnd : e - 1) : new ae$4(Ut$3(o.content, e, c3), o.openStart, o.openEnd);
16989
16989
  }
16990
16990
  mustMoveInline() {
16991
16991
  if (!this.$to.parent.isTextblock)
@@ -17104,7 +17104,7 @@ Actual: ` + p3.attribValue
17104
17104
  F3 < 0 && (w = false, F3 = -F3);
17105
17105
  let B3 = i3.node(F3 - 1), R = i3.index(F3 - 1);
17106
17106
  if (B3.canReplaceWith(R, R, D3.type, D3.marks))
17107
- return r22.replace(i3.before(F3), w ? s.after(F3) : t, new ae$3(Ka$2(n.content, 0, n.openStart, E3), E3, n.openEnd));
17107
+ return r22.replace(i3.before(F3), w ? s.after(F3) : t, new ae$4(Ka$2(n.content, 0, n.openStart, E3), E3, n.openEnd));
17108
17108
  }
17109
17109
  }
17110
17110
  let h3 = r22.steps.length;
@@ -17129,7 +17129,7 @@ Actual: ` + p3.attribValue
17129
17129
  let i3 = bf$2(r22.doc, e, n.type);
17130
17130
  i3 != null && (e = t = i3);
17131
17131
  }
17132
- r22.replaceRange(e, t, new ae$3(Q$2.from(n), 0, 0));
17132
+ r22.replaceRange(e, t, new ae$4(Q$2.from(n), 0, 0));
17133
17133
  }
17134
17134
  function Sf$2(r22, e, t) {
17135
17135
  let n = r22.doc.resolve(e), i3 = r22.doc.resolve(t), s = Xa$2(n, i3);
@@ -17171,7 +17171,7 @@ Actual: ` + p3.attribValue
17171
17171
  n[s] = t.attrs[s];
17172
17172
  n[this.attr] = this.value;
17173
17173
  let i3 = t.type.create(n, null, t.marks);
17174
- return Ce$2.fromReplace(e, this.pos, this.pos + 1, new ae$3(Q$2.from(i3), 0, t.isLeaf ? 0 : 1));
17174
+ return Ce$2.fromReplace(e, this.pos, this.pos + 1, new ae$4(Q$2.from(i3), 0, t.isLeaf ? 0 : 1));
17175
17175
  }
17176
17176
  getMap() {
17177
17177
  return je$2.empty;
@@ -17284,7 +17284,7 @@ Actual: ` + p3.attribValue
17284
17284
  Replace the part of the document between `from` and `to` with the
17285
17285
  given `slice`.
17286
17286
  */
17287
- replace(e, t = e, n = ae$3.empty) {
17287
+ replace(e, t = e, n = ae$4.empty) {
17288
17288
  let i3 = xf$2(this.doc, e, t, n);
17289
17289
  return i3 && this.step(i3), this;
17290
17290
  }
@@ -17293,13 +17293,13 @@ Actual: ` + p3.attribValue
17293
17293
  fragment, node, or array of nodes.
17294
17294
  */
17295
17295
  replaceWith(e, t, n) {
17296
- return this.replace(e, t, new ae$3(Q$2.from(n), 0, 0));
17296
+ return this.replace(e, t, new ae$4(Q$2.from(n), 0, 0));
17297
17297
  }
17298
17298
  /**
17299
17299
  Delete the content between the given positions.
17300
17300
  */
17301
17301
  delete(e, t) {
17302
- return this.replace(e, t, ae$3.empty);
17302
+ return this.replace(e, t, ae$4.empty);
17303
17303
  }
17304
17304
  /**
17305
17305
  Insert the given content at the given position.
@@ -17522,14 +17522,14 @@ Actual: ` + p3.attribValue
17522
17522
  Replace the selection with a slice or, if no slice is given,
17523
17523
  delete the selection. Will append to the given transaction.
17524
17524
  */
17525
- replace(e, t = ae$3.empty) {
17525
+ replace(e, t = ae$4.empty) {
17526
17526
  let n = t.content.lastChild, i3 = null;
17527
17527
  for (let a = 0; a < t.openEnd; a++)
17528
17528
  i3 = n, n = n.lastChild;
17529
17529
  let s = e.steps.length, o = this.ranges;
17530
17530
  for (let a = 0; a < o.length; a++) {
17531
17531
  let { $from: u, $to: c3 } = o[a], l = e.mapping.slice(s);
17532
- e.replaceRange(l.map(u.pos), l.map(c3.pos), a ? ae$3.empty : t), a == 0 && xo$3(e, s, (n ? n.isInline : i3 && i3.isTextblock) ? -1 : 1);
17532
+ e.replaceRange(l.map(u.pos), l.map(c3.pos), a ? ae$4.empty : t), a == 0 && xo$3(e, s, (n ? n.isInline : i3 && i3.isTextblock) ? -1 : 1);
17533
17533
  }
17534
17534
  }
17535
17535
  /**
@@ -17655,8 +17655,8 @@ Actual: ` + p3.attribValue
17655
17655
  let i3 = e.resolve(t.map(this.anchor));
17656
17656
  return new tt2(i3.parent.inlineContent ? i3 : n, n);
17657
17657
  }
17658
- replace(e, t = ae$3.empty) {
17659
- if (super.replace(e, t), t == ae$3.empty) {
17658
+ replace(e, t = ae$4.empty) {
17659
+ if (super.replace(e, t), t == ae$4.empty) {
17660
17660
  let n = this.$from.marksAcross(this.$to);
17661
17661
  n && e.ensureMarks(n);
17662
17662
  }
@@ -17731,7 +17731,7 @@ Actual: ` + p3.attribValue
17731
17731
  return n ? Ee$2.near(s) : new We2(s);
17732
17732
  }
17733
17733
  content() {
17734
- return new ae$3(Q$2.from(this.node), 0, 0);
17734
+ return new ae$4(Q$2.from(this.node), 0, 0);
17735
17735
  }
17736
17736
  eq(e) {
17737
17737
  return e instanceof We2 && e.anchor == this.anchor;
@@ -17786,8 +17786,8 @@ Actual: ` + p3.attribValue
17786
17786
  constructor(e) {
17787
17787
  super(e.resolve(0), e.resolve(e.content.size));
17788
17788
  }
17789
- replace(e, t = ae$3.empty) {
17790
- if (t == ae$3.empty) {
17789
+ replace(e, t = ae$4.empty) {
17790
+ if (t == ae$4.empty) {
17791
17791
  e.delete(0, e.doc.content.size);
17792
17792
  let n = Ee$2.atStart(e.doc);
17793
17793
  n.eq(e.selection) || e.setSelection(n);
@@ -24066,7 +24066,7 @@ Actual: ` + p3.attribValue
24066
24066
  return;
24067
24067
  }
24068
24068
  }
24069
- static updateDocumentVersion(e = this.convertedXml, t = "0.11.23") {
24069
+ static updateDocumentVersion(e = this.convertedXml, t = "0.11.24") {
24070
24070
  const n = "docProps/custom.xml";
24071
24071
  e[n] || (e[n] = Bu$2());
24072
24072
  const i3 = e["docProps/custom.xml"];
@@ -24329,7 +24329,7 @@ Actual: ` + p3.attribValue
24329
24329
  function Bu$2() {
24330
24330
  return Wf$1;
24331
24331
  }
24332
- function ku$2(r22 = 2, e = "0.11.23") {
24332
+ function ku$2(r22 = 2, e = "0.11.24") {
24333
24333
  return {
24334
24334
  type: "element",
24335
24335
  name: "property",
@@ -29137,8 +29137,8 @@ Actual: ` + p3.attribValue
29137
29137
  if (t.someProp("transformPastedText", (f) => {
29138
29138
  e = f(e, o || r, t);
29139
29139
  }), o)
29140
- return e ? new ae$3(Q$2.from(t.state.schema.text(e.replace(/\r\n?/g, `
29141
- `))), 0, 0) : ae$3.empty;
29140
+ return e ? new ae$4(Q$2.from(t.state.schema.text(e.replace(/\r\n?/g, `
29141
+ `))), 0, 0) : ae$4.empty;
29142
29142
  let u = t.someProp("clipboardTextParser", (f) => f(e, i3, r, t));
29143
29143
  if (u)
29144
29144
  a = u;
@@ -29171,7 +29171,7 @@ Actual: ` + p3.attribValue
29171
29171
  }
29172
29172
  })), d)
29173
29173
  a = dh$1(_a$1(a, +d[1], +d[2]), d[4]);
29174
- else if (a = ae$3.maxOpen(sh$1(a.content, i3), true), a.openStart || a.openEnd) {
29174
+ else if (a = ae$4.maxOpen(sh$1(a.content, i3), true), a.openStart || a.openEnd) {
29175
29175
  let u = 0, f = 0;
29176
29176
  for (let p3 = a.content.firstChild; u < a.openStart && !p3.type.spec.isolating; u++, p3 = p3.firstChild)
29177
29177
  ;
@@ -29232,7 +29232,7 @@ Actual: ` + p3.attribValue
29232
29232
  return t.childCount > 1 && (o = 0), i3 < r - 1 && (a = _o$2(a, e, n, r, i3 + 1, o)), i3 >= n && (a = e < 0 ? s.contentMatchAt(0).fillBefore(a, o <= i3).append(a) : a.append(s.contentMatchAt(s.childCount).fillBefore(Q$2.empty, true))), t.replaceChild(e < 0 ? 0 : t.childCount - 1, s.copy(a));
29233
29233
  }
29234
29234
  function _a$1(t, e, n) {
29235
- return e < t.openStart && (t = new ae$3(_o$2(t.content, -1, e, t.openStart, 0, t.openEnd), e, t.openEnd)), n < t.openEnd && (t = new ae$3(_o$2(t.content, 1, n, t.openEnd, 0, 0), t.openStart, n)), t;
29235
+ return e < t.openStart && (t = new ae$4(_o$2(t.content, -1, e, t.openStart, 0, t.openEnd), e, t.openEnd)), n < t.openEnd && (t = new ae$4(_o$2(t.content, 1, n, t.openEnd, 0, 0), t.openStart, n)), t;
29236
29236
  }
29237
29237
  const qc$1 = {
29238
29238
  thead: ["table"],
@@ -29286,7 +29286,7 @@ Actual: ` + p3.attribValue
29286
29286
  break;
29287
29287
  i3 = Q$2.from(l.create(r[a + 1], i3)), o++, s++;
29288
29288
  }
29289
- return new ae$3(i3, o, s);
29289
+ return new ae$4(i3, o, s);
29290
29290
  }
29291
29291
  const Ce$1 = {}, Ae$1 = {}, uh$1 = { touchstart: true, touchmove: true };
29292
29292
  let fh$1 = class fh {
@@ -29602,7 +29602,7 @@ Actual: ` + p3.attribValue
29602
29602
  }
29603
29603
  function mr$1(t, e, n, r, i3) {
29604
29604
  let o = Hc$1(t, e, n, r, t.state.selection.$from);
29605
- if (t.someProp("handlePaste", (l) => l(t, i3, o || ae$3.empty)))
29605
+ if (t.someProp("handlePaste", (l) => l(t, i3, o || ae$4.empty)))
29606
29606
  return true;
29607
29607
  if (!o)
29608
29608
  return false;
@@ -29668,7 +29668,7 @@ Actual: ` + p3.attribValue
29668
29668
  s = h3(s, t);
29669
29669
  }) : s = Hc$1(t, Zc$1(n.dataTransfer), hr ? null : n.dataTransfer.getData("text/html"), false, o);
29670
29670
  let a = !!(r && ed$1(t, n));
29671
- if (t.someProp("handleDrop", (h3) => h3(t, n, s || ae$3.empty, a))) {
29671
+ if (t.someProp("handleDrop", (h3) => h3(t, n, s || ae$4.empty, a))) {
29672
29672
  n.preventDefault();
29673
29673
  return;
29674
29674
  }
@@ -31532,7 +31532,7 @@ Actual: ` + p3.attribValue
31532
31532
  ).filter((r) => r !== null), n = this._tr.replace(
31533
31533
  0,
31534
31534
  this.prosemirrorView.state.doc.content.size,
31535
- new ae$3(Q$2.from(e), 0, 0)
31535
+ new ae$4(Q$2.from(e), 0, 0)
31536
31536
  );
31537
31537
  n.setMeta(te$1, { snapshot: null, prevSnapshot: null }), this.prosemirrorView.dispatch(n);
31538
31538
  });
@@ -31549,7 +31549,7 @@ Actual: ` + p3.attribValue
31549
31549
  ).filter((i3) => i3 !== null), r = this._tr.replace(
31550
31550
  0,
31551
31551
  this.prosemirrorView.state.doc.content.size,
31552
- new ae$3(Q$2.from(n), 0, 0)
31552
+ new ae$4(Q$2.from(n), 0, 0)
31553
31553
  );
31554
31554
  if (e) {
31555
31555
  const i3 = zt$1(En$1(e.anchor, 0), r.doc.content.size), o = zt$1(En$1(e.head, 0), r.doc.content.size);
@@ -31614,7 +31614,7 @@ Actual: ` + p3.attribValue
31614
31614
  ) : null).filter((u) => u !== null), d = this._tr.replace(
31615
31615
  0,
31616
31616
  this.prosemirrorView.state.doc.content.size,
31617
- new ae$3(Q$2.from(c3), 0, 0)
31617
+ new ae$4(Q$2.from(c3), 0, 0)
31618
31618
  );
31619
31619
  this.prosemirrorView.dispatch(
31620
31620
  d.setMeta(te$1, { isChangeOrigin: true })
@@ -31660,7 +31660,7 @@ Actual: ` + p3.attribValue
31660
31660
  let s = this._tr.replace(
31661
31661
  0,
31662
31662
  this.prosemirrorView.state.doc.content.size,
31663
- new ae$3(Q$2.from(o), 0, 0)
31663
+ new ae$4(Q$2.from(o), 0, 0)
31664
31664
  );
31665
31665
  dg(s, this.beforeTransactionSelection, this), s = s.setMeta(te$1, { isChangeOrigin: true, isUndoRedoOperation: n.origin instanceof N__namespace.UndoManager }), this.beforeTransactionSelection !== null && this._isLocalCursorInView() && s.scrollIntoView(), this.prosemirrorView.dispatch(s);
31666
31666
  });
@@ -32472,7 +32472,7 @@ Actual: ` + p3.attribValue
32472
32472
  return false;
32473
32473
  };
32474
32474
  }
32475
- function le$2(t, e) {
32475
+ function ae$3(t, e) {
32476
32476
  if (typeof t == "string") {
32477
32477
  if (!e.nodes[t])
32478
32478
  throw Error(`There is no node type named '${t}' in schema.`);
@@ -32599,7 +32599,7 @@ Actual: ` + p3.attribValue
32599
32599
  * @returns The node attrs.
32600
32600
  */
32601
32601
  static getNodeAttributes(e, n) {
32602
- const r = le$2(n, e.schema), { from: i3, to: o } = e.selection, s = [];
32602
+ const r = ae$3(n, e.schema), { from: i3, to: o } = e.selection, s = [];
32603
32603
  e.doc.nodesBetween(i3, o, (l) => {
32604
32604
  s.push(l);
32605
32605
  });
@@ -33165,7 +33165,7 @@ Actual: ` + p3.attribValue
33165
33165
  options: i3.options,
33166
33166
  storage: i3.storage,
33167
33167
  editor: e,
33168
- type: le$2(i3.name, this.schema)
33168
+ type: ae$3(i3.name, this.schema)
33169
33169
  }, a = I$1(i3, "addNodeView", s);
33170
33170
  if (!a) return [];
33171
33171
  const l = (c3, d, u, f) => {
@@ -33244,7 +33244,7 @@ Actual: ` + p3.attribValue
33244
33244
  return true;
33245
33245
  if (r.parent.content.size == 0 && (In$2(o, "end") || We$3.isSelectable(o)))
33246
33246
  for (let s = r.depth; ; s--) {
33247
- let a = xf$2(t.doc, r.before(s), r.after(s), ae$3.empty);
33247
+ let a = xf$2(t.doc, r.before(s), r.after(s), ae$4.empty);
33248
33248
  if (a && a.slice.size < a.to - a.from) {
33249
33249
  if (e) {
33250
33250
  let l = t.tr.step(a);
@@ -33303,7 +33303,7 @@ Actual: ` + p3.attribValue
33303
33303
  if (Ed$1(t, i3, e, 1))
33304
33304
  return true;
33305
33305
  if (r.parent.content.size == 0 && (In$2(o, "start") || We$3.isSelectable(o))) {
33306
- let s = xf$2(t.doc, r.before(), r.after(), ae$3.empty);
33306
+ let s = xf$2(t.doc, r.before(), r.after(), ae$4.empty);
33307
33307
  if (s && s.slice.size < s.to - s.from) {
33308
33308
  if (e) {
33309
33309
  let a = t.tr.step(s);
@@ -33450,7 +33450,7 @@ Actual: ` + p3.attribValue
33450
33450
  for (let b = s.length - 1; b >= 0; b--)
33451
33451
  h3 = Q$2.from(s[b].create(null, h3));
33452
33452
  h3 = Q$2.from(i3.copy(h3));
33453
- let m = t.tr.step(new $e$2(e.pos - 1, p3, e.pos, p3, new ae$3(h3, 1, 0), s.length, true)), g = m.doc.resolve(p3 + 2 * s.length);
33453
+ let m = t.tr.step(new $e$2(e.pos - 1, p3, e.pos, p3, new ae$4(h3, 1, 0), s.length, true)), g = m.doc.resolve(p3 + 2 * s.length);
33454
33454
  g.nodeAfter && g.nodeAfter.type == i3.type && Pp$1(m.doc, g.pos) && m.join(g.pos), n(m.scrollIntoView());
33455
33455
  }
33456
33456
  return true;
@@ -33470,7 +33470,7 @@ Actual: ` + p3.attribValue
33470
33470
  let b = Q$2.empty;
33471
33471
  for (let x3 = h3.length - 1; x3 >= 0; x3--)
33472
33472
  b = Q$2.from(h3[x3].copy(b));
33473
- let w = t.tr.step(new $e$2(e.pos - h3.length, e.pos + o.nodeSize, e.pos + g, e.pos + o.nodeSize - g, new ae$3(b, h3.length, 0), 0, true));
33473
+ let w = t.tr.step(new $e$2(e.pos - h3.length, e.pos + o.nodeSize, e.pos + g, e.pos + o.nodeSize - g, new ae$4(b, h3.length, 0), 0, true));
33474
33474
  n(w.scrollIntoView());
33475
33475
  }
33476
33476
  return true;
@@ -33692,11 +33692,11 @@ Actual: ` + p3.attribValue
33692
33692
  });
33693
33693
  }), true;
33694
33694
  }, My = (t, e = {}) => ({ state: n, dispatch: r, chain: i3 }) => {
33695
- const o = le$2(t, n.schema);
33695
+ const o = ae$3(t, n.schema);
33696
33696
  return o.isTextblock ? i3().command(({ commands: s }) => sl$1(o, e)(n) ? true : s.clearNodes()).command(({ state: s }) => sl$1(o, e)(s, r)).run() : false;
33697
33697
  };
33698
33698
  function Ri$1(t, e, n = {}) {
33699
- const { from: r, to: i3, empty: o } = t.selection, s = e ? le$2(e, t.schema) : null, a = [];
33699
+ const { from: r, to: i3, empty: o } = t.selection, s = e ? ae$3(e, t.schema) : null, a = [];
33700
33700
  t.doc.nodesBetween(r, i3, (u, f) => {
33701
33701
  if (u.isText) return;
33702
33702
  const p3 = Math.max(r, f), h3 = Math.min(i3, f + u.nodeSize);
@@ -33710,7 +33710,7 @@ Actual: ` + p3.attribValue
33710
33710
  return o ? !!c3.length : c3.reduce((u, f) => u + f.to - f.from, 0) >= l;
33711
33711
  }
33712
33712
  const Cy = (t, e, n = {}) => ({ state: r, commands: i3 }) => {
33713
- const o = le$2(t, r.schema), s = le$2(e, r.schema);
33713
+ const o = ae$3(t, r.schema), s = ae$3(e, r.schema);
33714
33714
  return Ri$1(r, o, n) ? i3.setNode(s) : i3.setNode(o, n);
33715
33715
  }, Ay = () => ({ state: t, dispatch: e }) => ly(t, e), Oy = () => ({ state: t, dispatch: e }) => Vs(t, e), Ty = (t, e = {}) => ({ tr: n, state: r, dispatch: i3 }) => {
33716
33716
  let o = null, s = null;
@@ -33718,7 +33718,7 @@ Actual: ` + p3.attribValue
33718
33718
  typeof t == "string" ? t : t.name,
33719
33719
  r.schema
33720
33720
  );
33721
- return a ? (a === "node" && (o = le$2(t, r.schema)), a === "mark" && (s = St$1(t, r.schema)), i3 && n.selection.ranges.forEach((l) => {
33721
+ return a ? (a === "node" && (o = ae$3(t, r.schema)), a === "mark" && (s = St$1(t, r.schema)), i3 && n.selection.ranges.forEach((l) => {
33722
33722
  const c3 = l.$from.pos, d = l.$to.pos;
33723
33723
  r.doc.nodesBetween(c3, d, (u, f) => {
33724
33724
  o && o === u.type && n.setNodeMarkup(f, void 0, { ...u.attrs, ...e }), s && u.marks.length && u.marks.forEach((p3) => {
@@ -33735,7 +33735,7 @@ Actual: ` + p3.attribValue
33735
33735
  typeof t == "string" ? t : t.name,
33736
33736
  r.schema
33737
33737
  );
33738
- return a ? (a === "node" && (o = le$2(t, r.schema)), a === "mark" && (s = St$1(t, r.schema)), i3 && n.selection.ranges.forEach((l) => {
33738
+ return a ? (a === "node" && (o = ae$3(t, r.schema)), a === "mark" && (s = St$1(t, r.schema)), i3 && n.selection.ranges.forEach((l) => {
33739
33739
  r.doc.nodesBetween(l.$from.pos, l.$to.pos, (c3, d) => {
33740
33740
  o && o === c3.type && n.setNodeMarkup(d, void 0, Wp$1(c3.attrs, e)), s && c3.marks.length && c3.marks.forEach((u) => {
33741
33741
  s === u.type && n.addMark(d, d + c3.nodeSize, s.create(Wp$1(u.attrs, e)));
@@ -33899,7 +33899,7 @@ Actual: ` + p3.attribValue
33899
33899
  let o = Q$2.empty;
33900
33900
  for (let d = n.length - 1; d >= 0; d--)
33901
33901
  o = Q$2.from(n[d].type.create(n[d].attrs, o));
33902
- t.step(new $e$2(e.start - (r ? 2 : 0), e.end, e.start, e.end, new ae$3(o, 0, 0), n.length, true));
33902
+ t.step(new $e$2(e.start - (r ? 2 : 0), e.end, e.start, e.end, new ae$4(o, 0, 0), n.length, true));
33903
33903
  let s = 0;
33904
33904
  for (let d = 0; d < n.length; d++)
33905
33905
  n[d].type == i3 && (s = d + 1);
@@ -33916,7 +33916,7 @@ Actual: ` + p3.attribValue
33916
33916
  }
33917
33917
  function Ky(t, e, n, r) {
33918
33918
  let i3 = t.tr, o = r.end, s = r.$to.end(r.depth);
33919
- o < s && (i3.step(new $e$2(o - 1, s, o, s, new ae$3(Q$2.from(n.create(null, r.parent.copy())), 1, 0), 1, true)), r = new _c$2(i3.doc.resolve(r.$from.pos), i3.doc.resolve(s), r.depth));
33919
+ o < s && (i3.step(new $e$2(o - 1, s, o, s, new ae$4(Q$2.from(n.create(null, r.parent.copy())), 1, 0), 1, true)), r = new _c$2(i3.doc.resolve(r.$from.pos), i3.doc.resolve(s), r.depth));
33920
33920
  const a = Np$1(r);
33921
33921
  if (a == null)
33922
33922
  return false;
@@ -33935,7 +33935,7 @@ Actual: ` + p3.attribValue
33935
33935
  if (!c3.canReplace(d + (a ? 0 : 1), d + 1, s.content.append(l ? Q$2.empty : Q$2.from(i3))))
33936
33936
  return false;
33937
33937
  let u = o.pos, f = u + s.nodeSize;
33938
- return r.step(new $e$2(u - (a ? 1 : 0), f + (l ? 1 : 0), u + 1, f - 1, new ae$3((a ? Q$2.empty : Q$2.from(i3.copy(Q$2.empty))).append(l ? Q$2.empty : Q$2.from(i3.copy(Q$2.empty))), a ? 0 : 1, l ? 0 : 1), a ? 0 : 1)), e(r.scrollIntoView()), true;
33938
+ return r.step(new $e$2(u - (a ? 1 : 0), f + (l ? 1 : 0), u + 1, f - 1, new ae$4((a ? Q$2.empty : Q$2.from(i3.copy(Q$2.empty))).append(l ? Q$2.empty : Q$2.from(i3.copy(Q$2.empty))), a ? 0 : 1, l ? 0 : 1), a ? 0 : 1)), e(r.scrollIntoView()), true;
33939
33939
  }
33940
33940
  function Jy(t) {
33941
33941
  return function(e, n) {
@@ -33949,14 +33949,14 @@ Actual: ` + p3.attribValue
33949
33949
  if (l.type != t)
33950
33950
  return false;
33951
33951
  if (n) {
33952
- let c3 = l.lastChild && l.lastChild.type == a.type, d = Q$2.from(c3 ? t.create() : null), u = new ae$3(Q$2.from(t.create(null, Q$2.from(a.type.create(null, d)))), c3 ? 3 : 1, 0), f = o.start, p3 = o.end;
33952
+ let c3 = l.lastChild && l.lastChild.type == a.type, d = Q$2.from(c3 ? t.create() : null), u = new ae$4(Q$2.from(t.create(null, Q$2.from(a.type.create(null, d)))), c3 ? 3 : 1, 0), f = o.start, p3 = o.end;
33953
33953
  n(e.tr.step(new $e$2(f - (c3 ? 3 : 1), p3, f, p3, u, 1, true)).scrollIntoView());
33954
33954
  }
33955
33955
  return true;
33956
33956
  };
33957
33957
  }
33958
33958
  const Yy = (t, e = {}) => ({ state: n, dispatch: r }) => {
33959
- const i3 = le$2(t, n.schema);
33959
+ const i3 = ae$3(t, n.schema);
33960
33960
  return jy(i3, e)(n, r);
33961
33961
  }, Ki$1 = (t, e) => {
33962
33962
  for (let n = t.depth; n > 0; n--) {
@@ -35136,7 +35136,7 @@ Actual: ` + p3.attribValue
35136
35136
  const i3 = t.doc.nodeAt(r);
35137
35137
  return n.node.type === i3?.type && Pp$1(t.doc, r) && t.join(r), true;
35138
35138
  }, Qy = (t, e, n, r = {}) => (i3) => {
35139
- const { editor: o, tr: s, state: a, dispatch: l, chain: c3, can: d, commands: u } = i3, { extensions: f, splittableMarks: p3 } = o.extensionService, h3 = le$2(t, a.schema), m = le$2(e, a.schema), { selection: g, storedMarks: b } = a, { $from: w, $to: x3 } = g, y = w.blockRange(x3), S = b || g.$to.parentOffset && g.$from.marks();
35139
+ const { editor: o, tr: s, state: a, dispatch: l, chain: c3, can: d, commands: u } = i3, { extensions: f, splittableMarks: p3 } = o.extensionService, h3 = ae$3(t, a.schema), m = ae$3(e, a.schema), { selection: g, storedMarks: b } = a, { $from: w, $to: x3 } = g, y = w.blockRange(x3), S = b || g.$to.parentOffset && g.$from.marks();
35140
35140
  if (!y) return false;
35141
35141
  const k = je$1((V) => es$1(V.type.name, f))(g), { numbering: C3 } = o.converter;
35142
35142
  if (y.depth >= 1 && k && y.depth - k.depth <= 1) {
@@ -35181,7 +35181,7 @@ Actual: ` + p3.attribValue
35181
35181
  const { definitions: n, abstracts: r } = e, i3 = n[t].elements[0].attributes["w:val"];
35182
35182
  return delete n[t], delete r[i3], e;
35183
35183
  }, nb = (t) => (e) => {
35184
- const { tr: n, state: r, dispatch: i3, editor: o } = e, s = le$2(t, r.schema), { $from: a, $to: l, node: c3 } = r.selection;
35184
+ const { tr: n, state: r, dispatch: i3, editor: o } = e, s = ae$3(t, r.schema), { $from: a, $to: l, node: c3 } = r.selection;
35185
35185
  if (c3 && c3.isBlock || a.depth < 2 || !a.sameParent(l))
35186
35186
  return false;
35187
35187
  const d = a.node(-1);
@@ -35204,7 +35204,7 @@ Actual: ` + p3.attribValue
35204
35204
  ), y = s.contentMatch.defaultType?.createAndFill(x3) || void 0;
35205
35205
  g = g.append(Q$2.from(s.createAndFill(null, y) || void 0));
35206
35206
  const S = a.before(a.depth - (b - 1));
35207
- n.replace(S, a.after(-w), new ae$3(g, 4 - b, 0));
35207
+ n.replace(S, a.after(-w), new ae$4(g, 4 - b, 0));
35208
35208
  let k = -1;
35209
35209
  n.doc.nodesBetween(S, n.doc.content.size, (C3, R) => {
35210
35210
  if (k > -1) return false;
@@ -35233,10 +35233,10 @@ Actual: ` + p3.attribValue
35233
35233
  }
35234
35234
  return true;
35235
35235
  }, rb = (t) => ({ state: e, dispatch: n }) => {
35236
- const r = le$2(t, e.schema);
35236
+ const r = ae$3(t, e.schema);
35237
35237
  return Jy(r)(e, n);
35238
35238
  }, ib = (t) => ({ state: e, dispatch: n }) => {
35239
- const r = le$2(t, e.schema);
35239
+ const r = ae$3(t, e.schema);
35240
35240
  return qy(r)(e, n);
35241
35241
  }, ob = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
35242
35242
  __proto__: null,
@@ -35440,7 +35440,7 @@ Actual: ` + p3.attribValue
35440
35440
  const f = new Ie$2(
35441
35441
  l.map(Math.max(e, u)),
35442
35442
  l.map(Math.min(n, u + d.nodeSize)),
35443
- ae$3.empty
35443
+ ae$4.empty
35444
35444
  );
35445
35445
  t.maybeStep(f).failed || l.appendMap(f.getMap());
35446
35446
  } else d.isInline && !d.marks.find((f) => f.type.name === Pi$2) ? (c3.push(d), t.addMark(
@@ -35568,7 +35568,7 @@ Actual: ` + p3.attribValue
35568
35568
  getMarkType: St$1,
35569
35569
  getMarksBetween: fb,
35570
35570
  getMarksFromSelection: $i$1,
35571
- getNodeType: le$2,
35571
+ getNodeType: ae$3,
35572
35572
  getSchemaTypeByName: Zn$2,
35573
35573
  getSchemaTypeNameByName: Fr$1,
35574
35574
  isActive: zd$1,
@@ -36898,7 +36898,7 @@ Actual: ` + p3.attribValue
36898
36898
  * @returns {Y.Doc | undefined} Updated Y.Doc if any, otherwise undefined
36899
36899
  */
36900
36900
  processCollaborationMigrations() {
36901
- if (console.debug("[checkVersionMigrations] Current editor version", "0.11.23"), !this.options.ydoc) return;
36901
+ if (console.debug("[checkVersionMigrations] Current editor version", "0.11.24"), !this.options.ydoc) return;
36902
36902
  let r = this.options.ydoc.getMap("meta").get("version");
36903
36903
  r || (r = "initial"), console.debug("[checkVersionMigrations] Document version", r);
36904
36904
  const i3 = fl$1(r) || [], s = this.state.plugins.find((c3) => c3.key.startsWith("y-sync"));
@@ -37612,7 +37612,7 @@ Actual: ` + p3.attribValue
37612
37612
  return ne2.valid(r) ? new ne2(r) : Ee$2.near(r);
37613
37613
  }
37614
37614
  content() {
37615
- return ae$3.empty;
37615
+ return ae$4.empty;
37616
37616
  }
37617
37617
  eq(e) {
37618
37618
  return e instanceof ne2 && e.head == this.head;
@@ -37784,7 +37784,7 @@ Actual: ` + p3.attribValue
37784
37784
  let i3 = Q$2.empty;
37785
37785
  for (let s = r.length - 1; s >= 0; s--)
37786
37786
  i3 = Q$2.from(r[s].createAndFill(null, i3));
37787
- let o = t.state.tr.replace(n.pos, n.pos, new ae$3(i3, 0, 0));
37787
+ let o = t.state.tr.replace(n.pos, n.pos, new ae$4(i3, 0, 0));
37788
37788
  return o.setSelection(tt$2.near(o.doc.resolve(n.pos + 1))), t.dispatch(o), false;
37789
37789
  }
37790
37790
  function Kb(t) {
@@ -38314,13 +38314,13 @@ Actual: ` + p3.attribValue
38314
38314
  Array.isArray(w.listLevel) || (w.listLevel = JSON.parse(w.listLevel));
38315
38315
  let V = [...w.listLevel.slice(0, -1), w.listLevel.at(-1) + 1];
38316
38316
  if (!(R === w.lvlText && $ === w.listNumberingType && hl$1(M, V))) {
38317
- let { selection: H3, storedMarks: oe2 } = r, ae2 = oe2 || H3.$to.parentOffset && H3.$from.marks();
38317
+ let { selection: H3, storedMarks: oe2 } = r, le2 = oe2 || H3.$to.parentOffset && H3.$from.marks();
38318
38318
  s.setNodeMarkup(C3, void 0, {
38319
38319
  ...k.attrs,
38320
38320
  listLevel: V,
38321
38321
  lvlText: w.lvlText,
38322
38322
  listNumberingType: w.listNumberingType
38323
- }), ae2 && s.ensureMarks(ae2), l = true;
38323
+ }), le2 && s.ensureMarks(le2), l = true;
38324
38324
  }
38325
38325
  w = {
38326
38326
  ...w,
@@ -39420,10 +39420,10 @@ Actual: ` + p3.attribValue
39420
39420
  insideV: { size: t, color: e }
39421
39421
  }), W0 = (t, e, n, r, i3 = null) => {
39422
39422
  const o = {
39423
- table: le$2("table", t),
39424
- tableRow: le$2("tableRow", t),
39425
- tableCell: le$2("tableCell", t),
39426
- tableHeader: le$2("tableHeader", t)
39423
+ table: ae$3("table", t),
39424
+ tableRow: ae$3("tableRow", t),
39425
+ tableCell: ae$3("tableCell", t),
39426
+ tableHeader: ae$3("tableHeader", t)
39427
39427
  }, s = [], a = [];
39428
39428
  for (let d = 0; d < n; d++) {
39429
39429
  const u = Ml$1(o.tableCell, i3);
@@ -39796,16 +39796,16 @@ Actual: ` + p3.attribValue
39796
39796
  s.push(e.child(l).copy(Q$2.from(c3)));
39797
39797
  }
39798
39798
  const a = this.isColSelection() && this.isRowSelection() ? e : s;
39799
- return new ae$3(Q$2.from(a), 1, 1);
39799
+ return new ae$4(Q$2.from(a), 1, 1);
39800
39800
  }
39801
- replace(e, n = ae$3.empty) {
39801
+ replace(e, n = ae$4.empty) {
39802
39802
  const r = e.steps.length, i3 = this.ranges;
39803
39803
  for (let s = 0; s < i3.length; s++) {
39804
39804
  const { $from: a, $to: l } = i3[s], c3 = e.mapping.slice(r);
39805
39805
  e.replace(
39806
39806
  c3.map(a.pos),
39807
39807
  c3.map(l.pos),
39808
- s ? ae$3.empty : n
39808
+ s ? ae$4.empty : n
39809
39809
  );
39810
39810
  }
39811
39811
  const o = Ee$2.findFrom(
@@ -39815,7 +39815,7 @@ Actual: ` + p3.attribValue
39815
39815
  o && e.setSelection(o);
39816
39816
  }
39817
39817
  replaceWith(e, n) {
39818
- this.replace(e, new ae$3(Q$2.from(n), 0, 0));
39818
+ this.replace(e, new ae$4(Q$2.from(n), 0, 0));
39819
39819
  }
39820
39820
  forEachCell(e) {
39821
39821
  const n = this.$anchorCell.node(-1), r = re$2.get(n), i3 = this.$anchorCell.start(-1), o = r.cellsInRect(
@@ -40459,7 +40459,7 @@ Actual: ` + p3.attribValue
40459
40459
  o.content.eq(i3) || r.replace(
40460
40460
  r.mapping.map(s + 1),
40461
40461
  r.mapping.map(s + o.nodeSize - 1),
40462
- new ae$3(i3, 0, 0)
40462
+ new ae$4(i3, 0, 0)
40463
40463
  );
40464
40464
  }), r.docChanged && e(r);
40465
40465
  }
@@ -40477,14 +40477,14 @@ Actual: ` + p3.attribValue
40477
40477
  const d = l ? 0 : Math.max(0, n - 1), u = l < e.childCount - 1 ? 0 : Math.max(0, r - 1);
40478
40478
  (d || u) && (c3 = gs(
40479
40479
  ke$1(s).row,
40480
- new ae$3(c3, d, u)
40480
+ new ae$4(c3, d, u)
40481
40481
  ).content), a.push(c3);
40482
40482
  }
40483
40483
  else if (o == "cell" || o == "header_cell")
40484
40484
  a.push(
40485
40485
  n || r ? gs(
40486
40486
  ke$1(s).row,
40487
- new ae$3(e, n, r)
40487
+ new ae$4(e, n, r)
40488
40488
  ).content : e
40489
40489
  );
40490
40490
  else
@@ -40651,7 +40651,7 @@ Actual: ` + p3.attribValue
40651
40651
  u.replace(
40652
40652
  u.mapping.slice(f).map(m + n),
40653
40653
  u.mapping.slice(f).map(g + n),
40654
- new ae$3(i3.rows[h3 - a], 0, 0)
40654
+ new ae$4(i3.rows[h3 - a], 0, 0)
40655
40655
  );
40656
40656
  }
40657
40657
  p3(), u.setSelection(
@@ -41231,10 +41231,10 @@ Actual: ` + p3.attribValue
41231
41231
  addCommands() {
41232
41232
  return {
41233
41233
  insertTable: ({ rows: t = 3, cols: e = 3, withHeaderRow: n = false } = {}) => ({ tr: r, dispatch: i3, editor: o }) => {
41234
- const s = W0(o.schema, t, e, n);
41234
+ const s = o.schema.text("​"), a = ae$3("paragraph", o.schema).create(null, s), l = W0(o.schema, t, e, n, a);
41235
41235
  if (i3) {
41236
- const a = r.selection.from + 1;
41237
- r.replaceSelectionWith(s).scrollIntoView().setSelection(tt$2.near(r.doc.resolve(a)));
41236
+ const c3 = r.selection.from + 1;
41237
+ r.replaceSelectionWith(l).scrollIntoView().setSelection(tt$2.near(r.doc.resolve(c3)));
41238
41238
  }
41239
41239
  return true;
41240
41240
  },
@@ -43244,7 +43244,7 @@ Actual: ` + p3.attribValue
43244
43244
  const c3 = new Ie$2(
43245
43245
  s.map(Math.max(l, t)),
43246
43246
  s.map(Math.min(l + a.nodeSize, e)),
43247
- ae$3.empty
43247
+ ae$4.empty
43248
43248
  );
43249
43249
  i3.step(c3), s.appendMap(c3.getMap());
43250
43250
  } else if (a.marks && a.marks.find((c3) => c3.type.name === xr$2)) {
@@ -43286,7 +43286,7 @@ Actual: ` + p3.attribValue
43286
43286
  const c3 = new Ie$2(
43287
43287
  s.map(Math.max(l, t)),
43288
43288
  s.map(Math.min(l + a.nodeSize, e)),
43289
- ae$3.empty
43289
+ ae$4.empty
43290
43290
  );
43291
43291
  i3.step(c3), s.appendMap(c3.getMap());
43292
43292
  } else if (a.marks && a.marks.find((c3) => c3.type.name === Oi$2)) {
@@ -43927,8 +43927,8 @@ Actual: ` + p3.attribValue
43927
43927
  if (f === Gn$2 && V) {
43928
43928
  var z3 = V[i3];
43929
43929
  Object.keys($).forEach(function(H3) {
43930
- var oe2 = [qe$2, Ue$1].indexOf(H3) >= 0 ? 1 : -1, ae2 = [Ne$1, Ue$1].indexOf(H3) >= 0 ? "y" : "x";
43931
- $[H3] += z3[ae2] * oe2;
43930
+ var oe2 = [qe$2, Ue$1].indexOf(H3) >= 0 ? 1 : -1, le2 = [Ne$1, Ue$1].indexOf(H3) >= 0 ? "y" : "x";
43931
+ $[H3] += z3[le2] * oe2;
43932
43932
  });
43933
43933
  }
43934
43934
  return $;
@@ -43972,14 +43972,14 @@ Actual: ` + p3.attribValue
43972
43972
  allowedAutoPlacements: m
43973
43973
  }) : Pe2);
43974
43974
  }, []), S = e.rects.reference, k = e.rects.popper, C3 = /* @__PURE__ */ new Map(), R = true, M = y[0], $ = 0; $ < y.length; $++) {
43975
- var V = y[$], z3 = ot(V), H3 = Bn$1(V) === Rn$2, oe2 = [Ne$1, Ue$1].indexOf(z3) >= 0, ae2 = oe2 ? "width" : "height", fe2 = Ar$1(e, {
43975
+ var V = y[$], z3 = ot(V), H3 = Bn$1(V) === Rn$2, oe2 = [Ne$1, Ue$1].indexOf(z3) >= 0, le2 = oe2 ? "width" : "height", fe2 = Ar$1(e, {
43976
43976
  placement: V,
43977
43977
  boundary: d,
43978
43978
  rootBoundary: u,
43979
43979
  altBoundary: f,
43980
43980
  padding: c3
43981
43981
  }), se2 = oe2 ? H3 ? qe$2 : Ee$1 : H3 ? Ue$1 : Ne$1;
43982
- S[ae2] > k[ae2] && (se2 = ki$1(se2));
43982
+ S[le2] > k[le2] && (se2 = ki$1(se2));
43983
43983
  var Q3 = ki$1(se2), pe2 = [];
43984
43984
  if (o && pe2.push(fe2[z3] <= 0), a && pe2.push(fe2[se2] <= 0, fe2[Q3] <= 0), pe2.every(function(Ke2) {
43985
43985
  return Ke2;
@@ -44119,10 +44119,10 @@ Actual: ` + p3.attribValue
44119
44119
  };
44120
44120
  if (k) {
44121
44121
  if (o) {
44122
- var H3, oe2 = y === "y" ? Ne$1 : Ee$1, ae2 = y === "y" ? Ue$1 : qe$2, fe2 = y === "y" ? "height" : "width", se2 = k[y], Q3 = se2 + g[oe2], pe2 = se2 - g[ae2], he2 = p3 ? -R[fe2] / 2 : 0, Te2 = w === Rn$2 ? C3[fe2] : R[fe2], Be = w === Rn$2 ? -R[fe2] : -C3[fe2], dt2 = e.elements.arrow, Ke2 = p3 && dt2 ? ta$1(dt2) : {
44122
+ var H3, oe2 = y === "y" ? Ne$1 : Ee$1, le2 = y === "y" ? Ue$1 : qe$2, fe2 = y === "y" ? "height" : "width", se2 = k[y], Q3 = se2 + g[oe2], pe2 = se2 - g[le2], he2 = p3 ? -R[fe2] / 2 : 0, Te2 = w === Rn$2 ? C3[fe2] : R[fe2], Be = w === Rn$2 ? -R[fe2] : -C3[fe2], dt2 = e.elements.arrow, Ke2 = p3 && dt2 ? ta$1(dt2) : {
44123
44123
  width: 0,
44124
44124
  height: 0
44125
- }, Pe2 = e.modifiersData["arrow#persistent"] ? e.modifiersData["arrow#persistent"].padding : uf$1(), Xe2 = Pe2[oe2], Mt2 = Pe2[ae2], Je2 = ar$1(0, C3[fe2], Ke2[fe2]), pn2 = x3 ? C3[fe2] / 2 - he2 - Je2 - Xe2 - $.mainAxis : Te2 - Je2 - Xe2 - $.mainAxis, Ct2 = x3 ? -C3[fe2] / 2 + he2 + Je2 + Mt2 + $.mainAxis : Be + Je2 + Mt2 + $.mainAxis, hn2 = e.elements.arrow && zr$1(e.elements.arrow), $r2 = hn2 ? y === "y" ? hn2.clientTop || 0 : hn2.clientLeft || 0 : 0, Wn2 = (H3 = V?.[y]) != null ? H3 : 0, Vr2 = se2 + pn2 - Wn2 - $r2, Hr2 = se2 + Ct2 - Wn2, Un2 = ar$1(p3 ? Bi$1(Q3, Vr2) : Q3, se2, p3 ? an$2(pe2, Hr2) : pe2);
44125
+ }, Pe2 = e.modifiersData["arrow#persistent"] ? e.modifiersData["arrow#persistent"].padding : uf$1(), Xe2 = Pe2[oe2], Mt2 = Pe2[le2], Je2 = ar$1(0, C3[fe2], Ke2[fe2]), pn2 = x3 ? C3[fe2] / 2 - he2 - Je2 - Xe2 - $.mainAxis : Te2 - Je2 - Xe2 - $.mainAxis, Ct2 = x3 ? -C3[fe2] / 2 + he2 + Je2 + Mt2 + $.mainAxis : Be + Je2 + Mt2 + $.mainAxis, hn2 = e.elements.arrow && zr$1(e.elements.arrow), $r2 = hn2 ? y === "y" ? hn2.clientTop || 0 : hn2.clientLeft || 0 : 0, Wn2 = (H3 = V?.[y]) != null ? H3 : 0, Vr2 = se2 + pn2 - Wn2 - $r2, Hr2 = se2 + Ct2 - Wn2, Un2 = ar$1(p3 ? Bi$1(Q3, Vr2) : Q3, se2, p3 ? an$2(pe2, Hr2) : pe2);
44126
44126
  k[y] = Un2, z3[y] = Un2 - se2;
44127
44127
  }
44128
44128
  if (a) {
@@ -44756,7 +44756,7 @@ Actual: ` + p3.attribValue
44756
44756
  var v = H3().parentNode;
44757
44757
  return v ? Hk(v) : document;
44758
44758
  }
44759
- function ae2() {
44759
+ function le2() {
44760
44760
  return Cs(k);
44761
44761
  }
44762
44762
  function fe2(v) {
@@ -44841,7 +44841,7 @@ Actual: ` + p3.attribValue
44841
44841
  pn2(v, O);
44842
44842
  }
44843
44843
  function pn2(v, O) {
44844
- var F3 = ae2().box;
44844
+ var F3 = le2().box;
44845
44845
  function K3(U) {
44846
44846
  U.target === F3 && (Co$2(F3, "remove", K3), O());
44847
44847
  }
@@ -44939,7 +44939,7 @@ Actual: ` + p3.attribValue
44939
44939
  fn: function(Jr2) {
44940
44940
  var gn2 = Jr2.state;
44941
44941
  if (z3()) {
44942
- var Rf2 = ae2(), Gi2 = Rf2.box;
44942
+ var Rf2 = le2(), Gi2 = Rf2.box;
44943
44943
  ["placement", "reference-hidden", "escaped"].forEach(function(Yr2) {
44944
44944
  Yr2 === "placement" ? Gi2.setAttribute("data-placement", gn2.placement) : gn2.attributes.popper["data-popper-" + Yr2] ? Gi2.setAttribute("data-" + Yr2, "") : Gi2.removeAttribute("data-" + Yr2);
44945
44945
  }), gn2.attributes.popper = {};
@@ -45052,14 +45052,14 @@ Actual: ` + p3.attribValue
45052
45052
  var v = y.state.isVisible, O = y.state.isDestroyed, F3 = !y.state.isEnabled, K3 = rt$2.isTouch && !y.props.touch, U = So$2(y.props.duration, 0, Re$2.duration);
45053
45053
  if (!(v || O || F3 || K3) && !H3().hasAttribute("disabled") && (Q3("onShow", [y], false), y.props.onShow(y) !== false)) {
45054
45054
  if (y.state.isVisible = true, z3() && (k.style.visibility = "visible"), se2(), Pe2(), y.state.isMounted || (k.style.transition = "none"), z3()) {
45055
- var xe = ae2(), ze2 = xe.box, mn2 = xe.content;
45055
+ var xe = le2(), ze2 = xe.box, mn2 = xe.content;
45056
45056
  Mo$2([ze2, mn2], 0);
45057
45057
  }
45058
45058
  f = function() {
45059
45059
  var Kt2;
45060
45060
  if (!(!y.state.isVisible || c3)) {
45061
45061
  if (c3 = true, k.offsetHeight, k.style.transition = y.props.moveTransition, z3() && y.props.animation) {
45062
- var Yi2 = ae2(), Jr2 = Yi2.box, gn2 = Yi2.content;
45062
+ var Yi2 = le2(), Jr2 = Yi2.box, gn2 = Yi2.content;
45063
45063
  Mo$2([Jr2, gn2], U), tc$1([Jr2, gn2], "visible");
45064
45064
  }
45065
45065
  pe2(), he2(), Ql$1(Ao$1, y), (Kt2 = y.popperInstance) == null || Kt2.forceUpdate(), Q3("onMount", [y]), y.props.animation && z3() && Je2(U, function() {
@@ -45074,7 +45074,7 @@ Actual: ` + p3.attribValue
45074
45074
  var v = !y.state.isVisible, O = y.state.isDestroyed, F3 = !y.state.isEnabled, K3 = So$2(y.props.duration, 1, Re$2.duration);
45075
45075
  if (!(v || O || F3) && (Q3("onHide", [y], false), y.props.onHide(y) !== false)) {
45076
45076
  if (y.state.isVisible = false, y.state.isShown = false, c3 = false, s = false, z3() && (k.style.visibility = "hidden"), Te2(), Xe2(), se2(true), z3()) {
45077
- var U = ae2(), xe = U.box, ze2 = U.content;
45077
+ var U = le2(), xe = U.box, ze2 = U.content;
45078
45078
  y.props.animation && (Mo$2([xe, ze2], K3), tc$1([xe, ze2], "hidden"));
45079
45079
  }
45080
45080
  pe2(), he2(), y.props.animation ? z3() && Mt2(K3, y.unmount) : y.unmount();
@@ -45451,8 +45451,8 @@ Actual: ` + p3.attribValue
45451
45451
  t.descendants(($, V) => {
45452
45452
  let z3 = $, H3 = V;
45453
45453
  if (b = e?.coordsAtPos(H3), !b) return;
45454
- let oe2 = b.bottom > c3, ae2 = z3.type.name === "hardBreak";
45455
- if (z3.attrs?.pageBreakSource === "sectPr" && (t.nodeAt(H3 + z3.nodeSize)?.attrs?.pageBreakSource === "sectPr" || (ae2 = true), l === 1)) {
45454
+ let oe2 = b.bottom > c3, le2 = z3.type.name === "hardBreak";
45455
+ if (z3.attrs?.pageBreakSource === "sectPr" && (t.nodeAt(H3 + z3.nodeSize)?.attrs?.pageBreakSource === "sectPr" || (le2 = true), l === 1)) {
45456
45456
  const pe2 = Yt$2(l, "headerIds", n, z3);
45457
45457
  i3.pop();
45458
45458
  const he2 = li$1(s, o, r, pe2), Te2 = ci$1({ editor: n, header: he2, isFirstHeader: true });
@@ -45465,7 +45465,7 @@ Actual: ` + p3.attribValue
45465
45465
  (he2 || Te2) && (oe2 = true);
45466
45466
  }
45467
45467
  }
45468
- if (ae2 || oe2) {
45468
+ if (le2 || oe2) {
45469
45469
  const se2 = e.state.doc.resolve(H3), Q3 = Ki$1(se2, (Je2) => Je2.type.name === "tableRow");
45470
45470
  Q3 && (z3 = Q3.node, H3 = Q3.pos);
45471
45471
  const {
@@ -45625,9 +45625,9 @@ Actual: ` + p3.attribValue
45625
45625
  s = s.addToEnd(e.schema.text(f, i3));
45626
45626
  else if (u = c3[f.group]) {
45627
45627
  let p3 = n.matchStart + u[0], h3 = n.matchStart + u[1];
45628
- f.copy ? s = s.append(e.doc.slice(p3, h3).content) : ((s != Q$2.empty || p3 > a) && (o.push({ from: a, to: p3, insert: new ae$3(s, 0, 0) }), s = Q$2.empty), a = h3);
45628
+ f.copy ? s = s.append(e.doc.slice(p3, h3).content) : ((s != Q$2.empty || p3 > a) && (o.push({ from: a, to: p3, insert: new ae$4(s, 0, 0) }), s = Q$2.empty), a = h3);
45629
45629
  }
45630
- return (s != Q$2.empty || a < n.to) && o.push({ from: a, to: n.to, insert: new ae$3(s, 0, 0) }), o;
45630
+ return (s != Q$2.empty || a < n.to) && o.push({ from: a, to: n.to, insert: new ae$4(s, 0, 0) }), o;
45631
45631
  }
45632
45632
  };
45633
45633
  const kx = new class {
@@ -70798,7 +70798,7 @@ ${style2}
70798
70798
  this.config.colors = shuffleArray(this.config.colors);
70799
70799
  this.userColorMap = /* @__PURE__ */ new Map();
70800
70800
  this.colorIndex = 0;
70801
- this.version = "0.11.23";
70801
+ this.version = "0.11.24";
70802
70802
  console.debug("🦋 [superdoc] Using SuperDoc version:", this.version);
70803
70803
  this.superdocId = config.superdocId || v4();
70804
70804
  this.colors = this.config.colors;