@pie-element/shared-editor-runtime 0.1.1-next.0 → 0.1.1-next.1

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.
Files changed (30) hide show
  1. package/dist/browser/{dist-BzUsSMiM.js → dist-BsIpHitF.js} +3 -3
  2. package/dist/browser/{dist-BzUsSMiM.js.map → dist-BsIpHitF.js.map} +1 -1
  3. package/dist/browser/{dist-DyMj6m6j.js → dist-BwzOz38C.js} +23 -16
  4. package/dist/browser/{dist-DyMj6m6j.js.map → dist-BwzOz38C.js.map} +1 -1
  5. package/dist/browser/{dist-86k79VvK.js → dist-CF7SJxlB.js} +3 -3
  6. package/dist/browser/{dist-86k79VvK.js.map → dist-CF7SJxlB.js.map} +1 -1
  7. package/dist/browser/{dist-DlTupuCB.js → dist-CL31Mguj.js} +1352 -1335
  8. package/dist/browser/dist-CL31Mguj.js.map +1 -0
  9. package/dist/browser/{dist-BiHYI9ZI.js → dist-Pg4oVkv2.js} +146 -147
  10. package/dist/browser/dist-Pg4oVkv2.js.map +1 -0
  11. package/dist/browser/prosemirror-state/index.js +1 -1
  12. package/dist/browser/tiptap-core/index.js +1 -1
  13. package/dist/browser/tiptap-extension-character-count/index.js +1 -1
  14. package/dist/browser/tiptap-extension-image/index.js +1 -1
  15. package/dist/browser/tiptap-extension-list-item/index.js +1 -1
  16. package/dist/browser/tiptap-extension-placeholder/index.js +1 -1
  17. package/dist/browser/tiptap-extension-subscript/index.js +1 -1
  18. package/dist/browser/tiptap-extension-superscript/index.js +1 -1
  19. package/dist/browser/tiptap-extension-table/index.js +1 -1
  20. package/dist/browser/tiptap-extension-table-cell/index.js +1 -1
  21. package/dist/browser/tiptap-extension-table-header/index.js +1 -1
  22. package/dist/browser/tiptap-extension-table-row/index.js +1 -1
  23. package/dist/browser/tiptap-extension-text-align/index.js +1 -1
  24. package/dist/browser/tiptap-extension-text-style/index.js +1 -1
  25. package/dist/browser/tiptap-extensions/index.js +1 -1
  26. package/dist/browser/tiptap-pm-state/index.js +1 -1
  27. package/dist/browser/tiptap-starter-kit/index.js +4 -4
  28. package/package.json +1 -1
  29. package/dist/browser/dist-BiHYI9ZI.js.map +0 -1
  30. package/dist/browser/dist-DlTupuCB.js.map +0 -1
@@ -64,7 +64,7 @@ e.prototype = {
64
64
  return new e(n);
65
65
  };
66
66
  //#endregion
67
- //#region ../../../node_modules/.bun/prosemirror-model@1.25.11/node_modules/prosemirror-model/dist/index.js
67
+ //#region ../../../node_modules/.bun/prosemirror-model@1.25.12/node_modules/prosemirror-model/dist/index.js
68
68
  function t(e, n, a) {
69
69
  for (let o = 0;; o++) {
70
70
  if (o == e.childCount || o == n.childCount) return e.childCount == n.childCount ? null : a;
@@ -312,8 +312,7 @@ var l = class e {
312
312
  if (!t) throw RangeError("Invalid input for Mark.fromJSON");
313
313
  let n = e.marks[t.type];
314
314
  if (!n) throw RangeError(`There is no mark type ${t.type} in this schema`);
315
- let r = n.create(t.attrs);
316
- return n.checkAttrs(r.attrs), r;
315
+ return n.create(t.attrs);
317
316
  }
318
317
  static sameSet(e, t) {
319
318
  if (e == t) return !0;
@@ -737,11 +736,11 @@ var re = class e {
737
736
  return e.content.size ? this.canReplace(this.childCount, this.childCount, e.content) : this.type.compatibleContent(e.type);
738
737
  }
739
738
  check() {
740
- this.type.checkContent(this.content), this.type.checkAttrs(this.attrs);
739
+ this.type.checkContent(this.content), de(this.type.attrs, this.attrs, "node", this.type.name);
741
740
  let e = l.none;
742
741
  for (let t = 0; t < this.marks.length; t++) {
743
742
  let n = this.marks[t];
744
- n.type.checkAttrs(n.attrs), e = n.addToSet(e);
743
+ de(n.type.attrs, n.attrs, "mark", n.type.name), e = n.addToSet(e);
745
744
  }
746
745
  if (!l.sameSet(e, this.marks)) throw RangeError(`Invalid collection of marks for node ${this.type.name}: ${this.marks.map((e) => e.type.name)}`);
747
746
  this.content.forEach((e) => e.check());
@@ -765,8 +764,8 @@ var re = class e {
765
764
  if (typeof t.text != "string") throw RangeError("Invalid text node in JSON");
766
765
  return e.text(t.text, n);
767
766
  }
768
- let r = a.fromJSON(e, t.content), i = e.nodeType(t.type).create(t.attrs, r, n);
769
- return i.type.checkAttrs(i.attrs), i;
767
+ let r = a.fromJSON(e, t.content);
768
+ return e.nodeType(t.type).create(t.attrs, r, n);
770
769
  }
771
770
  };
772
771
  x.prototype.text = void 0;
@@ -808,17 +807,21 @@ function ue(e, t) {
808
807
  for (let n = e.length - 1; n >= 0; n--) t = e[n].type.name + "(" + t + ")";
809
808
  return t;
810
809
  }
810
+ function de(e, t, n, r) {
811
+ for (let i in t) if (!(i in e)) throw RangeError(`Unsupported attribute ${i} for ${n} of type ${r}`);
812
+ for (let n in e) e[n].validate && e[n].validate(t[n]);
813
+ }
811
814
  var S = class e {
812
815
  constructor(e) {
813
816
  this.validEnd = e, this.next = [], this.wrapCache = [];
814
817
  }
815
818
  static parse(t, n) {
816
- let r = new de(t, n);
819
+ let r = new fe(t, n);
817
820
  if (r.next == null) return e.empty;
818
- let i = fe(r);
821
+ let i = pe(r);
819
822
  r.next && r.err("Unexpected trailing text");
820
- let a = Se(ye(i));
821
- return Ce(a, r), a;
823
+ let a = Ce(be(i));
824
+ return we(a, r), a;
822
825
  }
823
826
  matchType(e) {
824
827
  for (let t = 0; t < this.next.length; t++) if (this.next[t].type == e) return this.next[t].next;
@@ -910,7 +913,7 @@ var S = class e {
910
913
  }
911
914
  };
912
915
  S.empty = new S(!0);
913
- var de = class {
916
+ var fe = class {
914
917
  constructor(e, t) {
915
918
  this.string = e, this.nodeTypes = t, this.inline = null, this.pos = 0, this.tokens = e.split(/\s*(?=\b|\W|$)/), this.tokens[this.tokens.length - 1] == "" && this.tokens.pop(), this.tokens[0] == "" && this.tokens.shift();
916
919
  }
@@ -924,28 +927,28 @@ var de = class {
924
927
  throw SyntaxError(e + " (in content expression '" + this.string + "')");
925
928
  }
926
929
  };
927
- function fe(e) {
930
+ function pe(e) {
928
931
  let t = [];
929
932
  do
930
- t.push(pe(e));
933
+ t.push(me(e));
931
934
  while (e.eat("|"));
932
935
  return t.length == 1 ? t[0] : {
933
936
  type: "choice",
934
937
  exprs: t
935
938
  };
936
939
  }
937
- function pe(e) {
940
+ function me(e) {
938
941
  let t = [];
939
942
  do
940
- t.push(me(e));
943
+ t.push(he(e));
941
944
  while (e.next && e.next != ")" && e.next != "|");
942
945
  return t.length == 1 ? t[0] : {
943
946
  type: "seq",
944
947
  exprs: t
945
948
  };
946
949
  }
947
- function me(e) {
948
- let t = ve(e);
950
+ function he(e) {
951
+ let t = ye(e);
949
952
  for (;;) if (e.eat("+")) t = {
950
953
  type: "plus",
951
954
  expr: t
@@ -958,25 +961,25 @@ function me(e) {
958
961
  type: "opt",
959
962
  expr: t
960
963
  };
961
- else if (e.eat("{")) t = ge(e, t);
964
+ else if (e.eat("{")) t = _e(e, t);
962
965
  else break;
963
966
  return t;
964
967
  }
965
- function he(e) {
968
+ function ge(e) {
966
969
  /\D/.test(e.next) && e.err("Expected number, got '" + e.next + "'");
967
970
  let t = Number(e.next);
968
971
  return e.pos++, t;
969
972
  }
970
- function ge(e, t) {
971
- let n = he(e), r = n;
972
- return e.eat(",") && (r = e.next == "}" ? -1 : he(e)), e.eat("}") || e.err("Unclosed braced range"), {
973
+ function _e(e, t) {
974
+ let n = ge(e), r = n;
975
+ return e.eat(",") && (r = e.next == "}" ? -1 : ge(e)), e.eat("}") || e.err("Unclosed braced range"), {
973
976
  type: "range",
974
977
  min: n,
975
978
  max: r,
976
979
  expr: t
977
980
  };
978
981
  }
979
- function _e(e, t) {
982
+ function ve(e, t) {
980
983
  let n = e.nodeTypes, r = n[t];
981
984
  if (r) return [r];
982
985
  let i = [];
@@ -986,13 +989,13 @@ function _e(e, t) {
986
989
  }
987
990
  return i.length == 0 && e.err("No node type or group '" + t + "' found"), i;
988
991
  }
989
- function ve(e) {
992
+ function ye(e) {
990
993
  if (e.eat("(")) {
991
- let t = fe(e);
994
+ let t = pe(e);
992
995
  return e.eat(")") || e.err("Missing closing paren"), t;
993
996
  } else if (/\W/.test(e.next)) e.err("Unexpected token '" + e.next + "'");
994
997
  else {
995
- let t = _e(e, e.next).map((t) => (e.inline == null ? e.inline = t.isInline : e.inline != t.isInline && e.err("Mixing inline and block content"), {
998
+ let t = ve(e, e.next).map((t) => (e.inline == null ? e.inline = t.isInline : e.inline != t.isInline && e.err("Mixing inline and block content"), {
996
999
  type: "name",
997
1000
  value: t
998
1001
  }));
@@ -1002,7 +1005,7 @@ function ve(e) {
1002
1005
  };
1003
1006
  }
1004
1007
  }
1005
- function ye(e) {
1008
+ function be(e) {
1006
1009
  let t = [[]];
1007
1010
  return i(a(e, 0), n()), t;
1008
1011
  function n() {
@@ -1048,12 +1051,12 @@ function ye(e) {
1048
1051
  else throw Error("Unknown expr type");
1049
1052
  }
1050
1053
  }
1051
- function be(e, t) {
1054
+ function xe(e, t) {
1052
1055
  return t - e;
1053
1056
  }
1054
- function xe(e, t) {
1057
+ function Se(e, t) {
1055
1058
  let n = [];
1056
- return r(t), n.sort(be);
1059
+ return r(t), n.sort(xe);
1057
1060
  function r(t) {
1058
1061
  let i = e[t];
1059
1062
  if (i.length == 1 && !i[0].term) return r(i[0].to);
@@ -1064,9 +1067,9 @@ function xe(e, t) {
1064
1067
  }
1065
1068
  }
1066
1069
  }
1067
- function Se(e) {
1070
+ function Ce(e) {
1068
1071
  let t = Object.create(null);
1069
- return n(xe(e, 0));
1072
+ return n(Se(e, 0));
1070
1073
  function n(r) {
1071
1074
  let i = [];
1072
1075
  r.forEach((t) => {
@@ -1074,14 +1077,14 @@ function Se(e) {
1074
1077
  if (!t) return;
1075
1078
  let r;
1076
1079
  for (let e = 0; e < i.length; e++) i[e][0] == t && (r = i[e][1]);
1077
- xe(e, n).forEach((e) => {
1080
+ Se(e, n).forEach((e) => {
1078
1081
  r || i.push([t, r = []]), r.indexOf(e) == -1 && r.push(e);
1079
1082
  });
1080
1083
  });
1081
1084
  });
1082
1085
  let a = t[r.join(",")] = new S(r.indexOf(e.length - 1) > -1);
1083
1086
  for (let e = 0; e < i.length; e++) {
1084
- let r = i[e][1].sort(be);
1087
+ let r = i[e][1].sort(xe);
1085
1088
  a.next.push({
1086
1089
  type: i[e][0],
1087
1090
  next: t[r.join(",")] || n(r)
@@ -1090,7 +1093,7 @@ function Se(e) {
1090
1093
  return a;
1091
1094
  }
1092
1095
  }
1093
- function Ce(e, t) {
1096
+ function we(e, t) {
1094
1097
  for (let n = 0, r = [e]; n < r.length; n++) {
1095
1098
  let e = r[n], i = !e.validEnd, a = [];
1096
1099
  for (let t = 0; t < e.next.length; t++) {
@@ -1100,7 +1103,7 @@ function Ce(e, t) {
1100
1103
  i && t.err("Only non-generatable nodes (" + a.join(", ") + ") in a required position (see https://prosemirror.net/docs/guide/#generatable)");
1101
1104
  }
1102
1105
  }
1103
- function we(e) {
1106
+ function Te(e) {
1104
1107
  let t = Object.create(null);
1105
1108
  for (let n in e) {
1106
1109
  let r = e[n];
@@ -1109,23 +1112,17 @@ function we(e) {
1109
1112
  }
1110
1113
  return t;
1111
1114
  }
1112
- function Te(e, t) {
1115
+ function Ee(e, t) {
1113
1116
  let n = Object.create(null);
1114
1117
  for (let r in e) {
1115
- let i = t && t[r];
1116
- if (i === void 0) {
1117
- let t = e[r];
1118
- if (t.hasDefault) i = t.default;
1119
- else throw RangeError("No value supplied for attribute " + r);
1120
- }
1121
- n[r] = i;
1118
+ let i = e[r], a = t && t[r];
1119
+ if (a === void 0) if (i.hasDefault) a = i.default;
1120
+ else throw RangeError("No value supplied for attribute " + r);
1121
+ else i.validate && i.validate(a);
1122
+ n[r] = a;
1122
1123
  }
1123
1124
  return n;
1124
1125
  }
1125
- function Ee(e, t, n, r) {
1126
- for (let i in t) if (!(i in e)) throw RangeError(`Unsupported attribute ${i} for ${n} of type ${r}`);
1127
- for (let n in e) e[n].validate && e[n].validate(t[n]);
1128
- }
1129
1126
  function De(e, t) {
1130
1127
  let n = Object.create(null);
1131
1128
  if (t) for (let r in t) n[r] = new Ae(e, r, t[r]);
@@ -1133,7 +1130,7 @@ function De(e, t) {
1133
1130
  }
1134
1131
  var Oe = class e {
1135
1132
  constructor(e, t, n) {
1136
- this.name = e, this.schema = t, this.spec = n, this.markSet = null, this.groups = n.group ? n.group.split(" ") : [], this.attrs = De(e, n.attrs), this.defaultAttrs = we(this.attrs), this.contentMatch = null, this.inlineContent = null, this.isBlock = !(n.inline || e == "text"), this.isText = e == "text";
1133
+ this.name = e, this.schema = t, this.spec = n, this.markSet = null, this.groups = n.group ? n.group.split(" ") : [], this.attrs = De(e, n.attrs), this.defaultAttrs = Te(this.attrs), this.contentMatch = null, this.inlineContent = null, this.isBlock = !(n.inline || e == "text"), this.isText = e == "text";
1137
1134
  }
1138
1135
  get isInline() {
1139
1136
  return !this.isBlock;
@@ -1161,7 +1158,7 @@ var Oe = class e {
1161
1158
  return this == e || this.contentMatch.compatible(e.contentMatch);
1162
1159
  }
1163
1160
  computeAttrs(e) {
1164
- return !e && this.defaultAttrs ? this.defaultAttrs : Te(this.attrs, e);
1161
+ return !e && this.defaultAttrs ? this.defaultAttrs : Ee(this.attrs, e);
1165
1162
  }
1166
1163
  create(e = null, t, n) {
1167
1164
  if (this.isText) throw Error("NodeType.create can't construct text nodes");
@@ -1188,9 +1185,7 @@ var Oe = class e {
1188
1185
  checkContent(e) {
1189
1186
  if (!this.validContent(e)) throw RangeError(`Invalid content for node ${this.name}: ${e.toString().slice(0, 50)}`);
1190
1187
  }
1191
- checkAttrs(e) {
1192
- Ee(this.attrs, e, "node", this.name);
1193
- }
1188
+ checkAttrs(e) {}
1194
1189
  allowsMarkType(e) {
1195
1190
  return this.markSet == null || this.markSet.indexOf(e) > -1;
1196
1191
  }
@@ -1232,11 +1227,11 @@ var Ae = class {
1232
1227
  }, je = class e {
1233
1228
  constructor(e, t, n, r) {
1234
1229
  this.name = e, this.rank = t, this.schema = n, this.spec = r, this.attrs = De(e, r.attrs), this.excluded = null;
1235
- let i = we(this.attrs);
1230
+ let i = Te(this.attrs);
1236
1231
  this.instance = i ? new l(this, i) : null;
1237
1232
  }
1238
1233
  create(e = null) {
1239
- return !e && this.instance ? this.instance : new l(this, Te(this.attrs, e));
1234
+ return !e && this.instance ? this.instance : new l(this, Ee(this.attrs, e));
1240
1235
  }
1241
1236
  static compile(t, n) {
1242
1237
  let r = Object.create(null), i = 0;
@@ -1249,9 +1244,6 @@ var Ae = class {
1249
1244
  isInSet(e) {
1250
1245
  for (let t = 0; t < e.length; t++) if (e[t].type == this) return e[t];
1251
1246
  }
1252
- checkAttrs(e) {
1253
- Ee(this.attrs, e, "mark", this.name);
1254
- }
1255
1247
  excludes(e) {
1256
1248
  return this.excluded.indexOf(e) > -1;
1257
1249
  }
@@ -1837,7 +1829,7 @@ function D(e, t, n, r) {
1837
1829
  };
1838
1830
  }
1839
1831
  //#endregion
1840
- //#region ../../../node_modules/.bun/prosemirror-transform@1.12.0/node_modules/prosemirror-transform/dist/index.js
1832
+ //#region ../../../node_modules/.bun/prosemirror-transform@1.12.2/node_modules/prosemirror-transform/dist/index.js
1841
1833
  var Qe = 65535, $e = 2 ** 16;
1842
1834
  function et(e, t) {
1843
1835
  return e + t * $e;
@@ -1888,8 +1880,8 @@ var rt = 1, it = 2, at = 4, ot = 8, O = class {
1888
1880
  if (e <= u) {
1889
1881
  let i = c ? e == s ? -1 : e == u ? 1 : t : t, a = s + r + (i < 0 ? 0 : l);
1890
1882
  if (n) return a;
1891
- let d = e == (t < 0 ? s : u) ? null : et(o / 3, e - s), f = e == s ? it : e == u ? rt : at;
1892
- return (t < 0 ? e != s : e != u) && (f |= ot), new O(a, f, d);
1883
+ let d = e == (t < 0 ? s : u) ? null : et(o / 3, e - s), f = 0;
1884
+ return c && (f |= e == s ? it : e == u ? rt : at, (t < 0 ? e != s : e != u) && (f |= ot)), new O(a, f, d);
1893
1885
  }
1894
1886
  r += l - c;
1895
1887
  }
@@ -2585,7 +2577,7 @@ var Pt = class {
2585
2577
  }
2586
2578
  for (let t = 1; t <= 2; t++) for (let n = t == 1 ? e : this.unplaced.openStart; n >= 0; n--) {
2587
2579
  let e, r = null;
2588
- n ? (r = W(this.unplaced.content, n - 1).firstChild, e = r.content) : e = this.unplaced.content;
2580
+ n ? (r = Ft(this.unplaced.content, n - 1).firstChild, e = r.content) : e = this.unplaced.content;
2589
2581
  let i = e.firstChild;
2590
2582
  for (let e = this.depth; e >= 0; e--) {
2591
2583
  let { type: o, match: s } = this.frontier[e], c, l = null;
@@ -2606,11 +2598,11 @@ var Pt = class {
2606
2598
  }
2607
2599
  }
2608
2600
  openMore() {
2609
- let { content: e, openStart: t, openEnd: n } = this.unplaced, r = W(e, t);
2610
- return !r.childCount || r.firstChild.isLeaf ? !1 : (this.unplaced = new d(e, t + 1, Math.max(n, r.size + t >= e.size - n ? t + 1 : 0)), !0);
2601
+ let { content: e, openStart: t, openEnd: n } = this.unplaced;
2602
+ return zt(e, -1) <= t ? !1 : (this.unplaced.size > 1 && zt(e, 1) > n && n++, this.unplaced = new d(e, t + 1, n), !0);
2611
2603
  }
2612
2604
  dropNode() {
2613
- let { content: e, openStart: t, openEnd: n } = this.unplaced, r = W(e, t);
2605
+ let { content: e, openStart: t, openEnd: n } = this.unplaced, r = Ft(e, t);
2614
2606
  if (r.childCount <= 1 && t > 0) {
2615
2607
  let i = e.size - t <= t + r.size;
2616
2608
  this.unplaced = new d(H(e, t - 1, 1), t - 1, i ? t - 1 : n);
@@ -2628,7 +2620,7 @@ var Pt = class {
2628
2620
  for (; l < s.childCount;) {
2629
2621
  let e = s.child(l), t = f.matchType(e.type);
2630
2622
  if (!t) break;
2631
- l++, (l > 1 || c == 0 || e.content.size) && (f = t, u.push(Ft(e.mark(p.allowedMarks(e.marks)), l == 1 ? c : 0, l == s.childCount ? m : -1)));
2623
+ l++, (l > 1 || c == 0 || e.content.size) && (f = t, u.push(It(e.mark(p.allowedMarks(e.marks)), l == 1 ? c : 0, l == s.childCount ? m : -1)));
2632
2624
  }
2633
2625
  let h = l == s.childCount;
2634
2626
  h || (m = -1), this.placed = U(this.placed, t, a.from(u)), this.frontier[t].match = f, h && m < 0 && n && n.type == this.frontier[this.depth].type && this.frontier.length > 1 && this.closeFrontierNode();
@@ -2644,17 +2636,17 @@ var Pt = class {
2644
2636
  mustMoveInline() {
2645
2637
  if (!this.$to.parent.isTextblock) return -1;
2646
2638
  let e = this.frontier[this.depth], t;
2647
- if (!e.type.isTextblock || !G(this.$to, this.$to.depth, e.type, e.match, !1) || this.$to.depth == this.depth && (t = this.findCloseLevel(this.$to)) && t.depth == this.depth) return -1;
2639
+ if (!e.type.isTextblock || !W(this.$to, this.$to.depth, e.type, e.match, !1) || this.$to.depth == this.depth && (t = this.findCloseLevel(this.$to)) && t.depth == this.depth) return -1;
2648
2640
  let { depth: n } = this.$to, r = this.$to.after(n);
2649
2641
  for (; n > 1 && r == this.$to.end(--n);) ++r;
2650
2642
  return r;
2651
2643
  }
2652
2644
  findCloseLevel(e) {
2653
2645
  scan: for (let t = Math.min(this.depth, e.depth); t >= 0; t--) {
2654
- let { match: n, type: r } = this.frontier[t], i = t < e.depth && e.end(t + 1) == e.pos + (e.depth - (t + 1)), a = G(e, t, r, n, i);
2646
+ let { match: n, type: r } = this.frontier[t], i = t < e.depth && e.end(t + 1) == e.pos + (e.depth - (t + 1)), a = W(e, t, r, n, i);
2655
2647
  if (a) {
2656
2648
  for (let n = t - 1; n >= 0; n--) {
2657
- let { match: t, type: r } = this.frontier[n], i = G(e, n, r, t, !0);
2649
+ let { match: t, type: r } = this.frontier[n], i = W(e, n, r, t, !0);
2658
2650
  if (!i || i.childCount) continue scan;
2659
2651
  }
2660
2652
  return {
@@ -2694,33 +2686,40 @@ function H(e, t, n) {
2694
2686
  function U(e, t, n) {
2695
2687
  return t == 0 ? e.append(n) : e.replaceChild(e.childCount - 1, e.lastChild.copy(U(e.lastChild.content, t - 1, n)));
2696
2688
  }
2697
- function W(e, t) {
2689
+ function Ft(e, t) {
2698
2690
  for (let n = 0; n < t; n++) e = e.firstChild.content;
2699
2691
  return e;
2700
2692
  }
2701
- function Ft(e, t, n) {
2693
+ function It(e, t, n) {
2702
2694
  if (t <= 0) return e;
2703
2695
  let r = e.content;
2704
- return t > 1 && (r = r.replaceChild(0, Ft(r.firstChild, t - 1, r.childCount == 1 ? n - 1 : 0))), t > 0 && (r = e.type.contentMatch.fillBefore(r).append(r), n <= 0 && (r = r.append(e.type.contentMatch.matchFragment(r).fillBefore(a.empty, !0)))), e.copy(r);
2696
+ return t > 1 && (r = r.replaceChild(0, It(r.firstChild, t - 1, r.childCount == 1 ? n - 1 : 0))), t > 0 && (r = e.type.contentMatch.fillBefore(r).append(r), n <= 0 && (r = r.append(e.type.contentMatch.matchFragment(r).fillBefore(a.empty, !0)))), e.copy(r);
2705
2697
  }
2706
- function G(e, t, n, r, i) {
2698
+ function W(e, t, n, r, i) {
2707
2699
  let a = e.node(t), o = i ? e.indexAfter(t) : e.index(t);
2708
2700
  if (o == a.childCount && !n.compatibleContent(a.type)) return null;
2709
2701
  let s = r.fillBefore(a.content, !0, o);
2710
- return s && !It(n, a.content, o) ? s : null;
2702
+ return s && !Lt(n, a.content, o) ? s : null;
2711
2703
  }
2712
- function It(e, t, n) {
2704
+ function Lt(e, t, n) {
2713
2705
  for (let r = n; r < t.childCount; r++) if (!e.allowsMarks(t.child(r).marks)) return !0;
2714
2706
  return !1;
2715
2707
  }
2716
- function Lt(e) {
2708
+ function Rt(e) {
2717
2709
  return e.spec.defining || e.spec.definingForContent;
2718
2710
  }
2719
- function Rt(e, t, n, r) {
2711
+ function zt(e, t) {
2712
+ for (let n = 0;; n++) {
2713
+ let r = t < 0 ? e.firstChild : e.lastChild;
2714
+ if (!r || r.isAtom) return n;
2715
+ e = r.content;
2716
+ }
2717
+ }
2718
+ function Bt(e, t, n, r) {
2720
2719
  if (!r.size) return e.deleteRange(t, n);
2721
2720
  let i = e.doc.resolve(t), a = e.doc.resolve(n);
2722
2721
  if (Nt(i, a, r)) return e.step(new R(t, n, r));
2723
- let o = Ht(i, a);
2722
+ let o = Wt(i, a);
2724
2723
  o[o.length - 1] == 0 && o.pop();
2725
2724
  let s = -(i.depth + 1);
2726
2725
  o.unshift(s);
@@ -2736,7 +2735,7 @@ function Rt(e, t, n, r) {
2736
2735
  e = n.content;
2737
2736
  }
2738
2737
  for (let e = u - 1; e >= 0; e--) {
2739
- let t = l[e], n = Lt(t.type);
2738
+ let t = l[e], n = Rt(t.type);
2740
2739
  if (n && !t.sameMarkup(i.node(Math.abs(s) - 1))) u = e;
2741
2740
  else if (n || !t.type.isTextblock) break;
2742
2741
  }
@@ -2746,7 +2745,7 @@ function Rt(e, t, n, r) {
2746
2745
  let l = o[(t + c) % o.length], u = !0;
2747
2746
  l < 0 && (u = !1, l = -l);
2748
2747
  let p = i.node(l - 1), m = i.index(l - 1);
2749
- if (p.canReplaceWith(m, m, f.type, f.marks)) return e.replace(i.before(l), u ? a.after(l) : n, new d(zt(r.content, 0, r.openStart, s), s, r.openEnd));
2748
+ if (p.canReplaceWith(m, m, f.type, f.marks)) return e.replace(i.before(l), u ? a.after(l) : n, new d(Vt(r.content, 0, r.openStart, s), s, r.openEnd));
2750
2749
  }
2751
2750
  }
2752
2751
  let f = e.steps.length;
@@ -2755,10 +2754,10 @@ function Rt(e, t, n, r) {
2755
2754
  e < 0 || (t = i.before(e), n = a.after(e));
2756
2755
  }
2757
2756
  }
2758
- function zt(e, t, n, r, i) {
2757
+ function Vt(e, t, n, r, i) {
2759
2758
  if (t < n) {
2760
2759
  let i = e.firstChild;
2761
- e = e.replaceChild(0, i.copy(zt(i.content, t + 1, n, r, i)));
2760
+ e = e.replaceChild(0, i.copy(Vt(i.content, t + 1, n, r, i)));
2762
2761
  }
2763
2762
  if (t > r) {
2764
2763
  let t = i.contentMatchAt(0), n = t.fillBefore(e).append(e);
@@ -2766,14 +2765,14 @@ function zt(e, t, n, r, i) {
2766
2765
  }
2767
2766
  return e;
2768
2767
  }
2769
- function Bt(e, t, n, r) {
2768
+ function Ht(e, t, n, r) {
2770
2769
  if (!r.isInline && t == n && e.doc.resolve(t).parent.content.size) {
2771
2770
  let i = At(e.doc, t, r.type);
2772
2771
  i != null && (t = n = i);
2773
2772
  }
2774
2773
  e.replaceRange(t, n, new d(a.from(r), 0, 0));
2775
2774
  }
2776
- function Vt(e, t, n) {
2775
+ function Ut(e, t, n) {
2777
2776
  let r = e.doc.resolve(t), i = e.doc.resolve(n);
2778
2777
  if (r.parent.isTextblock && i.parent.isTextblock && r.start() != i.start() && r.parentOffset == 0 && i.parentOffset == 0) {
2779
2778
  let a = r.sharedDepth(n), o = !1;
@@ -2785,7 +2784,7 @@ function Vt(e, t, n) {
2785
2784
  r = e.doc.resolve(t), i = e.doc.resolve(n);
2786
2785
  }
2787
2786
  }
2788
- let a = Ht(r, i);
2787
+ let a = Wt(r, i);
2789
2788
  for (let t = 0; t < a.length; t++) {
2790
2789
  let n = a[t], o = t == a.length - 1;
2791
2790
  if (o && n == 0 || r.node(n).type.contentMatch.validEnd) return e.delete(r.start(n), i.end(n));
@@ -2794,7 +2793,7 @@ function Vt(e, t, n) {
2794
2793
  for (let a = 1; a <= r.depth && a <= i.depth; a++) if (t - r.start(a) == r.depth - a && n > r.end(a) && i.end(a) - n != i.depth - a && r.start(a - 1) == i.start(a - 1) && r.node(a - 1).canReplace(r.index(a - 1), i.index(a - 1))) return e.delete(r.before(a), n);
2795
2794
  e.delete(t, n);
2796
2795
  }
2797
- function Ht(e, t) {
2796
+ function Wt(e, t) {
2798
2797
  let n = [], r = Math.min(e.depth, t.depth);
2799
2798
  for (let i = r; i >= 0; i--) {
2800
2799
  let r = e.start(i);
@@ -2803,7 +2802,7 @@ function Ht(e, t) {
2803
2802
  }
2804
2803
  return n;
2805
2804
  }
2806
- var Ut = class e extends j {
2805
+ var Gt = class e extends j {
2807
2806
  constructor(e, t, n) {
2808
2807
  super(), this.pos = e, this.attr = t, this.value = n;
2809
2808
  }
@@ -2839,8 +2838,8 @@ var Ut = class e extends j {
2839
2838
  return new e(n.pos, n.attr, n.value);
2840
2839
  }
2841
2840
  };
2842
- j.jsonID("attr", Ut);
2843
- var Wt = class e extends j {
2841
+ j.jsonID("attr", Gt);
2842
+ var Kt = class e extends j {
2844
2843
  constructor(e, t) {
2845
2844
  super(), this.attr = e, this.value = t;
2846
2845
  }
@@ -2872,13 +2871,13 @@ var Wt = class e extends j {
2872
2871
  return new e(n.attr, n.value);
2873
2872
  }
2874
2873
  };
2875
- j.jsonID("docAttr", Wt);
2876
- var K = class extends Error {};
2877
- K = function e(t) {
2874
+ j.jsonID("docAttr", Kt);
2875
+ var G = class extends Error {};
2876
+ G = function e(t) {
2878
2877
  let n = Error.call(this, t);
2879
2878
  return n.__proto__ = e.prototype, n;
2880
- }, K.prototype = Object.create(Error.prototype), K.prototype.constructor = K, K.prototype.name = "TransformError";
2881
- var Gt = class {
2879
+ }, G.prototype = Object.create(Error.prototype), G.prototype.constructor = G, G.prototype.name = "TransformError";
2880
+ var qt = class {
2882
2881
  constructor(e) {
2883
2882
  this.doc = e, this.steps = [], this.docs = [], this.mapping = new st();
2884
2883
  }
@@ -2887,7 +2886,7 @@ var Gt = class {
2887
2886
  }
2888
2887
  step(e) {
2889
2888
  let t = this.maybeStep(e);
2890
- if (t.failed) throw new K(t.failed);
2889
+ if (t.failed) throw new G(t.failed);
2891
2890
  return this;
2892
2891
  }
2893
2892
  maybeStep(e) {
@@ -2927,13 +2926,13 @@ var Gt = class {
2927
2926
  return this.replaceWith(e, e, t);
2928
2927
  }
2929
2928
  replaceRange(e, t, n) {
2930
- return Rt(this, e, t, n), this;
2929
+ return Bt(this, e, t, n), this;
2931
2930
  }
2932
2931
  replaceRangeWith(e, t, n) {
2933
- return Bt(this, e, t, n), this;
2932
+ return Ht(this, e, t, n), this;
2934
2933
  }
2935
2934
  deleteRange(e, t) {
2936
- return Vt(this, e, t), this;
2935
+ return Ut(this, e, t), this;
2937
2936
  }
2938
2937
  lift(e, t) {
2939
2938
  return ft(this, e, t), this;
@@ -2951,10 +2950,10 @@ var Gt = class {
2951
2950
  return St(this, e, t, n, r), this;
2952
2951
  }
2953
2952
  setNodeAttribute(e, t, n) {
2954
- return this.step(new Ut(e, t, n)), this;
2953
+ return this.step(new Gt(e, t, n)), this;
2955
2954
  }
2956
2955
  setDocAttribute(e, t) {
2957
- return this.step(new Wt(e, t)), this;
2956
+ return this.step(new Kt(e, t)), this;
2958
2957
  }
2959
2958
  addNodeMark(e, t) {
2960
2959
  return this.step(new I(e, t)), this;
@@ -2982,9 +2981,9 @@ var Gt = class {
2982
2981
  clearIncompatible(e, t, n) {
2983
2982
  return V(this, e, t, n), this;
2984
2983
  }
2985
- }, Kt = Object.create(null), q = class {
2984
+ }, K = Object.create(null), q = class {
2986
2985
  constructor(e, t, n) {
2987
- this.$anchor = e, this.$head = t, this.ranges = n || [new qt(e.min(t), e.max(t))];
2986
+ this.$anchor = e, this.$head = t, this.ranges = n || [new Jt(e.min(t), e.max(t))];
2988
2987
  }
2989
2988
  get anchor() {
2990
2989
  return this.$anchor.pos;
@@ -3018,14 +3017,14 @@ var Gt = class {
3018
3017
  let i = e.steps.length, a = this.ranges;
3019
3018
  for (let o = 0; o < a.length; o++) {
3020
3019
  let { $from: s, $to: c } = a[o], l = e.mapping.slice(i);
3021
- e.replaceRange(l.map(s.pos), l.map(c.pos), o ? d.empty : t), o == 0 && $t(e, i, (n ? n.isInline : r && r.isTextblock) ? -1 : 1);
3020
+ e.replaceRange(l.map(s.pos), l.map(c.pos), o ? d.empty : t), o == 0 && en(e, i, (n ? n.isInline : r && r.isTextblock) ? -1 : 1);
3022
3021
  }
3023
3022
  }
3024
3023
  replaceWith(e, t) {
3025
3024
  let n = e.steps.length, r = this.ranges;
3026
3025
  for (let i = 0; i < r.length; i++) {
3027
3026
  let { $from: a, $to: o } = r[i], s = e.mapping.slice(n), c = s.map(a.pos), l = s.map(o.pos);
3028
- i ? e.deleteRange(c, l) : (e.replaceRangeWith(c, l, t), $t(e, n, t.isInline ? -1 : 1));
3027
+ i ? e.deleteRange(c, l) : (e.replaceRangeWith(c, l, t), en(e, n, t.isInline ? -1 : 1));
3029
3028
  }
3030
3029
  }
3031
3030
  static findFrom(e, t, n = !1) {
@@ -3048,30 +3047,30 @@ var Gt = class {
3048
3047
  }
3049
3048
  static fromJSON(e, t) {
3050
3049
  if (!t || !t.type) throw RangeError("Invalid input for Selection.fromJSON");
3051
- let n = Kt[t.type];
3050
+ let n = K[t.type];
3052
3051
  if (!n) throw RangeError(`No selection type ${t.type} defined`);
3053
3052
  return n.fromJSON(e, t);
3054
3053
  }
3055
3054
  static jsonID(e, t) {
3056
- if (e in Kt) throw RangeError("Duplicate use of selection JSON ID " + e);
3057
- return Kt[e] = t, t.prototype.jsonID = e, t;
3055
+ if (e in K) throw RangeError("Duplicate use of selection JSON ID " + e);
3056
+ return K[e] = t, t.prototype.jsonID = e, t;
3058
3057
  }
3059
3058
  getBookmark() {
3060
3059
  return J.between(this.$anchor, this.$head).getBookmark();
3061
3060
  }
3062
3061
  };
3063
3062
  q.prototype.visible = !0;
3064
- var qt = class {
3063
+ var Jt = class {
3065
3064
  constructor(e, t) {
3066
3065
  this.$from = e, this.$to = t;
3067
3066
  }
3068
- }, Jt = !1;
3069
- function Yt(e) {
3070
- !Jt && !e.parent.inlineContent && (Jt = !0, console.warn("TextSelection endpoint not pointing into a node with inline content (" + e.parent.type.name + ")"));
3067
+ }, Yt = !1;
3068
+ function Xt(e) {
3069
+ !Yt && !e.parent.inlineContent && (Yt = !0, console.warn("TextSelection endpoint not pointing into a node with inline content (" + e.parent.type.name + ")"));
3071
3070
  }
3072
3071
  var J = class e extends q {
3073
3072
  constructor(e, t = e) {
3074
- Yt(e), Yt(t), super(e, t);
3073
+ Xt(e), Xt(t), super(e, t);
3075
3074
  }
3076
3075
  get $cursor() {
3077
3076
  return this.$anchor.pos == this.$head.pos ? this.$head : null;
@@ -3092,7 +3091,7 @@ var J = class e extends q {
3092
3091
  return t instanceof e && t.anchor == this.anchor && t.head == this.head;
3093
3092
  }
3094
3093
  getBookmark() {
3095
- return new Xt(this.anchor, this.head);
3094
+ return new Zt(this.anchor, this.head);
3096
3095
  }
3097
3096
  toJSON() {
3098
3097
  return {
@@ -3120,7 +3119,7 @@ var J = class e extends q {
3120
3119
  }
3121
3120
  };
3122
3121
  q.jsonID("text", J);
3123
- var Xt = class e {
3122
+ var Zt = class e {
3124
3123
  constructor(e, t) {
3125
3124
  this.anchor = e, this.head = t;
3126
3125
  }
@@ -3152,7 +3151,7 @@ var Xt = class e {
3152
3151
  };
3153
3152
  }
3154
3153
  getBookmark() {
3155
- return new Zt(this.anchor);
3154
+ return new Qt(this.anchor);
3156
3155
  }
3157
3156
  static fromJSON(t, n) {
3158
3157
  if (typeof n.anchor != "number") throw RangeError("Invalid input for NodeSelection.fromJSON");
@@ -3166,13 +3165,13 @@ var Xt = class e {
3166
3165
  }
3167
3166
  };
3168
3167
  Y.prototype.visible = !1, q.jsonID("node", Y);
3169
- var Zt = class e {
3168
+ var Qt = class e {
3170
3169
  constructor(e) {
3171
3170
  this.anchor = e;
3172
3171
  }
3173
3172
  map(t) {
3174
3173
  let { deleted: n, pos: r } = t.mapResult(this.anchor);
3175
- return n ? new Xt(r, r) : new e(r);
3174
+ return n ? new Zt(r, r) : new e(r);
3176
3175
  }
3177
3176
  resolve(e) {
3178
3177
  let t = e.resolve(this.anchor), n = t.nodeAfter;
@@ -3202,11 +3201,11 @@ var Zt = class e {
3202
3201
  return t instanceof e;
3203
3202
  }
3204
3203
  getBookmark() {
3205
- return Qt;
3204
+ return $t;
3206
3205
  }
3207
3206
  };
3208
3207
  q.jsonID("all", X);
3209
- var Qt = {
3208
+ var $t = {
3210
3209
  map() {
3211
3210
  return this;
3212
3211
  },
@@ -3226,7 +3225,7 @@ function Z(e, t, n, r, i, a = !1) {
3226
3225
  }
3227
3226
  return null;
3228
3227
  }
3229
- function $t(e, t, n) {
3228
+ function en(e, t, n) {
3230
3229
  let r = e.steps.length - 1;
3231
3230
  if (r < t) return;
3232
3231
  let i = e.steps[r];
@@ -3236,7 +3235,7 @@ function $t(e, t, n) {
3236
3235
  o ??= r;
3237
3236
  }), e.setSelection(q.near(e.doc.resolve(o), n));
3238
3237
  }
3239
- var en = 1, tn = 2, nn = 4, rn = class extends Gt {
3238
+ var tn = 1, nn = 2, rn = 4, an = class extends qt {
3240
3239
  constructor(e) {
3241
3240
  super(e.doc), this.curSelectionFor = 0, this.updated = 0, this.meta = Object.create(null), this.time = Date.now(), this.curSelection = e.selection, this.storedMarks = e.storedMarks;
3242
3241
  }
@@ -3245,13 +3244,13 @@ var en = 1, tn = 2, nn = 4, rn = class extends Gt {
3245
3244
  }
3246
3245
  setSelection(e) {
3247
3246
  if (e.$from.doc != this.doc) throw RangeError("Selection passed to setSelection must point at the current document");
3248
- return this.curSelection = e, this.curSelectionFor = this.steps.length, this.updated = (this.updated | en) & -3, this.storedMarks = null, this;
3247
+ return this.curSelection = e, this.curSelectionFor = this.steps.length, this.updated = (this.updated | tn) & -3, this.storedMarks = null, this;
3249
3248
  }
3250
3249
  get selectionSet() {
3251
- return (this.updated & en) > 0;
3250
+ return (this.updated & tn) > 0;
3252
3251
  }
3253
3252
  setStoredMarks(e) {
3254
- return this.storedMarks = e, this.updated |= tn, this;
3253
+ return this.storedMarks = e, this.updated |= nn, this;
3255
3254
  }
3256
3255
  ensureMarks(e) {
3257
3256
  return l.sameSet(this.storedMarks || this.selection.$from.marks(), e) || this.setStoredMarks(e), this;
@@ -3263,7 +3262,7 @@ var en = 1, tn = 2, nn = 4, rn = class extends Gt {
3263
3262
  return this.ensureMarks(e.removeFromSet(this.storedMarks || this.selection.$head.marks()));
3264
3263
  }
3265
3264
  get storedMarksSet() {
3266
- return (this.updated & tn) > 0;
3265
+ return (this.updated & nn) > 0;
3267
3266
  }
3268
3267
  addStep(e, t) {
3269
3268
  super.addStep(e, t), this.updated &= -3, this.storedMarks = null;
@@ -3305,20 +3304,20 @@ var en = 1, tn = 2, nn = 4, rn = class extends Gt {
3305
3304
  return !0;
3306
3305
  }
3307
3306
  scrollIntoView() {
3308
- return this.updated |= nn, this;
3307
+ return this.updated |= rn, this;
3309
3308
  }
3310
3309
  get scrolledIntoView() {
3311
- return (this.updated & nn) > 0;
3310
+ return (this.updated & rn) > 0;
3312
3311
  }
3313
3312
  };
3314
- function an(e, t) {
3313
+ function on(e, t) {
3315
3314
  return !t || !e ? e : e.bind(t);
3316
3315
  }
3317
3316
  var Q = class {
3318
3317
  constructor(e, t, n) {
3319
- this.name = e, this.init = an(t.init, n), this.apply = an(t.apply, n);
3318
+ this.name = e, this.init = on(t.init, n), this.apply = on(t.apply, n);
3320
3319
  }
3321
- }, on = [
3320
+ }, sn = [
3322
3321
  new Q("doc", {
3323
3322
  init(e) {
3324
3323
  return e.doc || e.schema.topNodeType.createAndFill();
@@ -3351,14 +3350,14 @@ var Q = class {
3351
3350
  return e.scrolledIntoView ? t + 1 : t;
3352
3351
  }
3353
3352
  })
3354
- ], sn = class {
3353
+ ], cn = class {
3355
3354
  constructor(e, t) {
3356
- this.schema = e, this.plugins = [], this.pluginsByKey = Object.create(null), this.fields = on.slice(), t && t.forEach((e) => {
3355
+ this.schema = e, this.plugins = [], this.pluginsByKey = Object.create(null), this.fields = sn.slice(), t && t.forEach((e) => {
3357
3356
  if (this.pluginsByKey[e.key]) throw RangeError("Adding different instances of a keyed plugin (" + e.key + ")");
3358
3357
  this.plugins.push(e), this.pluginsByKey[e.key] = e, e.spec.state && this.fields.push(new Q(e.key, e.spec.state, e));
3359
3358
  });
3360
3359
  }
3361
- }, cn = class e {
3360
+ }, ln = class e {
3362
3361
  constructor(e) {
3363
3362
  this.config = e;
3364
3363
  }
@@ -3425,15 +3424,15 @@ var Q = class {
3425
3424
  return n;
3426
3425
  }
3427
3426
  get tr() {
3428
- return new rn(this);
3427
+ return new an(this);
3429
3428
  }
3430
3429
  static create(t) {
3431
- let n = new sn(t.doc ? t.doc.type.schema : t.schema, t.plugins), r = new e(n);
3430
+ let n = new cn(t.doc ? t.doc.type.schema : t.schema, t.plugins), r = new e(n);
3432
3431
  for (let e = 0; e < n.fields.length; e++) r[n.fields[e].name] = n.fields[e].init(t, r);
3433
3432
  return r;
3434
3433
  }
3435
3434
  reconfigure(t) {
3436
- let n = new sn(this.schema, t.plugins), r = n.fields, i = new e(n);
3435
+ let n = new cn(this.schema, t.plugins), r = n.fields, i = new e(n);
3437
3436
  for (let e = 0; e < r.length; e++) {
3438
3437
  let n = r[e].name;
3439
3438
  i[n] = this.hasOwnProperty(n) ? this[n] : r[e].init(t, i);
@@ -3455,7 +3454,7 @@ var Q = class {
3455
3454
  static fromJSON(t, n, r) {
3456
3455
  if (!n) throw RangeError("Invalid input for EditorState.fromJSON");
3457
3456
  if (!t.schema) throw RangeError("Required config field 'schema' missing");
3458
- let i = new sn(t.schema, t.plugins), a = new e(i);
3457
+ let i = new cn(t.schema, t.plugins), a = new e(i);
3459
3458
  return i.fields.forEach((e) => {
3460
3459
  if (e.name == "doc") a.doc = x.fromJSON(t.schema, n.doc);
3461
3460
  else if (e.name == "selection") a.selection = q.fromJSON(a.doc, n.selection);
@@ -3473,27 +3472,27 @@ var Q = class {
3473
3472
  }), a;
3474
3473
  }
3475
3474
  };
3476
- function ln(e, t, n) {
3475
+ function un(e, t, n) {
3477
3476
  for (let r in e) {
3478
3477
  let i = e[r];
3479
- i instanceof Function ? i = i.bind(t) : r == "handleDOMEvents" && (i = ln(i, t, {})), n[r] = i;
3478
+ i instanceof Function ? i = i.bind(t) : r == "handleDOMEvents" && (i = un(i, t, {})), n[r] = i;
3480
3479
  }
3481
3480
  return n;
3482
3481
  }
3483
- var un = class {
3482
+ var dn = class {
3484
3483
  constructor(e) {
3485
- this.spec = e, this.props = {}, e.props && ln(e.props, this, this.props), this.key = e.key ? e.key.key : dn("plugin");
3484
+ this.spec = e, this.props = {}, e.props && un(e.props, this, this.props), this.key = e.key ? e.key.key : fn("plugin");
3486
3485
  }
3487
3486
  getState(e) {
3488
3487
  return e[this.key];
3489
3488
  }
3490
3489
  }, $ = Object.create(null);
3491
- function dn(e) {
3490
+ function fn(e) {
3492
3491
  return e in $ ? e + "$" + ++$[e] : ($[e] = 0, e + "$");
3493
3492
  }
3494
- var fn = class {
3493
+ var pn = class {
3495
3494
  constructor(e = "key") {
3496
- this.key = dn(e);
3495
+ this.key = fn(e);
3497
3496
  }
3498
3497
  get(e) {
3499
3498
  return e.config.pluginsByKey[this.key];
@@ -3503,6 +3502,6 @@ var fn = class {
3503
3502
  }
3504
3503
  };
3505
3504
  //#endregion
3506
- export { qe as C, se as D, x as E, Me as O, Ie as S, l as T, jt as _, fn as a, dt as b, J as c, F as d, z as f, Ct as g, Tt as h, un as i, d as k, rn as l, Gt as m, cn as n, q as o, R as p, Y as r, qt as s, X as t, st as u, pt as v, a as w, Mt as x, Ot as y };
3505
+ export { qe as C, se as D, x as E, Me as O, Ie as S, l as T, jt as _, pn as a, dt as b, J as c, F as d, z as f, Ct as g, Tt as h, dn as i, d as k, an as l, qt as m, ln as n, q as o, R as p, Y as r, Jt as s, X as t, st as u, pt as v, a as w, Mt as x, Ot as y };
3507
3506
 
3508
- //# sourceMappingURL=dist-BiHYI9ZI.js.map
3507
+ //# sourceMappingURL=dist-Pg4oVkv2.js.map