star-horse-lowcode 2.7.31 → 2.7.32

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/dist/index.es.js CHANGED
@@ -104350,13 +104350,6 @@ const useDesignFormStore = defineStore("designForm", () => {
104350
104350
  };
104351
104351
  compList.value = [];
104352
104352
  formData.value = { index: 1 };
104353
- if (typeof window !== "undefined") {
104354
- requestIdleCallback(() => {
104355
- if (compList.value.length === 0) {
104356
- gc();
104357
- }
104358
- });
104359
- }
104360
104353
  historyRecord.value = {
104361
104354
  index: -1,
104362
104355
  maxStep: 20,
@@ -105632,7 +105625,7 @@ function F$7(n) {
105632
105625
  var e = typeof n;
105633
105626
  return n != null && (e == "object" || e == "function");
105634
105627
  }
105635
- var Vr$2 = NaN, dc$2 = /^[-+]0x[0-9a-f]+$/i, hc$2 = /^0b[01]+$/i, pc$4 = /^0o[0-7]+$/i, gc$3 = parseInt;
105628
+ var Vr$2 = NaN, dc$2 = /^[-+]0x[0-9a-f]+$/i, hc$2 = /^0b[01]+$/i, pc$4 = /^0o[0-7]+$/i, gc$2 = parseInt;
105636
105629
  function tn$2(n) {
105637
105630
  if (typeof n == "number")
105638
105631
  return n;
@@ -105646,7 +105639,7 @@ function tn$2(n) {
105646
105639
  return n === 0 ? n : +n;
105647
105640
  n = Vi$2(n);
105648
105641
  var t = hc$2.test(n);
105649
- return t || pc$4.test(n) ? gc$3(n.slice(2), t ? 2 : 8) : dc$2.test(n) ? Vr$2 : +n;
105642
+ return t || pc$4.test(n) ? gc$2(n.slice(2), t ? 2 : 8) : dc$2.test(n) ? Vr$2 : +n;
105650
105643
  }
105651
105644
  var _c$2 = 1 / 0, vc$2 = 17976931348623157e292;
105652
105645
  function vn$1(n) {
@@ -130113,7 +130106,7 @@ function hu$1() {
130113
130106
  return a.length ? [s, { changes: a, sequential: true }] : s;
130114
130107
  });
130115
130108
  }
130116
- const pc$3 = /* @__PURE__ */ T$4.define(), gc$2 = /* @__PURE__ */ new N$4();
130109
+ const pc$3 = /* @__PURE__ */ T$4.define(), gc$1 = /* @__PURE__ */ new N$4();
130117
130110
  function fu$1(s) {
130118
130111
  let t = s.firstChild, e = s.lastChild;
130119
130112
  return t && t.to < e.from ? { from: t.to, to: e.type.isError ? s.to : e.from } : null;
@@ -130129,7 +130122,7 @@ function mc$1(s, t, e) {
130129
130122
  continue;
130130
130123
  if (r && l.from < t)
130131
130124
  break;
130132
- let a = l.type.prop(gc$2);
130125
+ let a = l.type.prop(gc$1);
130133
130126
  if (a && (l.to < i.length - 50 || i.length == s.doc.length || !bc$1(l))) {
130134
130127
  let h = a(l, s);
130135
130128
  h && h.from <= e && h.from >= t && h.to > e && (r = h);
@@ -134139,7 +134132,7 @@ const F0 = Gf$1({
134139
134132
  Object: /* @__PURE__ */ au({ except: /^\s*\}/ }),
134140
134133
  Array: /* @__PURE__ */ au({ except: /^\s*\]/ })
134141
134134
  }),
134142
- /* @__PURE__ */ gc$2.add({
134135
+ /* @__PURE__ */ gc$1.add({
134143
134136
  "Object Array": fu$1
134144
134137
  })
134145
134138
  ]
@@ -136857,7 +136850,7 @@ function af(t, e, n) {
136857
136850
  }
136858
136851
  }
136859
136852
  }
136860
- function gc$1(t) {
136853
+ function gc(t) {
136861
136854
  wm(t, true);
136862
136855
  }
136863
136856
  function wm(t, e) {
@@ -137110,9 +137103,9 @@ function K$2(t, e) {
137110
137103
  var [n, r] = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : [0, 0], a = t, s = null, i = null, l = $r$1, c = false, u = function(f) {
137111
137104
  c = true, d(!(arguments.length > 1 && arguments[1] !== void 0) || arguments[1], f);
137112
137105
  }, d = (f, v) => {
137113
- l !== (l = f) && (l ? (s ? gc$1(s) : v && (s = pa(() => v(a))), i && Qs(i, () => {
137106
+ l !== (l = f) && (l ? (s ? gc(s) : v && (s = pa(() => v(a))), i && Qs(i, () => {
137114
137107
  i = null;
137115
- })) : (i ? gc$1(i) : v && (i = pa(() => v(a, [n + 1, r]))), s && Qs(s, () => {
137108
+ })) : (i ? gc(i) : v && (i = pa(() => v(a, [n + 1, r]))), s && Qs(s, () => {
137116
137109
  s = null;
137117
137110
  })));
137118
137111
  };
@@ -137146,7 +137139,7 @@ function ar(t, e, n, r, a) {
137146
137139
  }
137147
137140
  for (S = 0; S < H; S += 1) if (W = C(q = h[S], S), (V = te.get(W)) !== void 0) {
137148
137141
  var Se;
137149
- if (Q && My(V, q, S, y), V.e.f & Pa && (gc$1(V.e), J && ((Se = V.a) === null || Se === void 0 || Se.unfix(), (j ?? (j = /* @__PURE__ */ new Set())).delete(V))), V !== re) {
137142
+ if (Q && My(V, q, S, y), V.e.f & Pa && (gc(V.e), J && ((Se = V.a) === null || Se === void 0 || Se.unfix(), (j ?? (j = /* @__PURE__ */ new Set())).delete(V))), V !== re) {
137150
137143
  if (O !== void 0 && O.has(V)) {
137151
137144
  if (Te.length < Pe.length) {
137152
137145
  var we, De = Pe[0];
@@ -137202,7 +137195,7 @@ function ar(t, e, n, r, a) {
137202
137195
  (ee = V.a) === null || ee === void 0 || ee.apply();
137203
137196
  }
137204
137197
  }), tr.first = g.first && g.first.e, tr.last = fe && fe.e;
137205
- }(f, l, i, a, e, r, n), s !== null && (v === 0 ? c ? gc$1(c) : c = pa(() => s(i)) : c !== null && Qs(c, () => {
137198
+ }(f, l, i, a, e, r, n), s !== null && (v === 0 ? c ? gc(c) : c = pa(() => s(i)) : c !== null && Qs(c, () => {
137206
137199
  c = null;
137207
137200
  })), o$2(d));
137208
137201
  });