lithent 1.21.1 → 1.21.2

package/dist/lithent.mjs

@@ -1,7 +1,7 @@
-const h = Symbol.for("lithentWDomSymbol"), P = { value: "" }, v = { value: null }, a = { value: !1 }, p = /* @__PURE__ */ new WeakMap(), V = /* @__PURE__ */ new WeakSet();
-let K = !1;
+const h = Symbol.for("lithentWDomSymbol"), P = { value: "" }, v = { value: null }, a = { value: !1 }, f = /* @__PURE__ */ new WeakMap(), W = /* @__PURE__ */ new WeakSet();
+let D = !1;
 const Ce = (e) => {
-  p.set(e, {
+  f.set(e, {
     vd: { value: null },
     up: () => {
     },
@@ -14,90 +14,90 @@ const Ce = (e) => {
     wdCB: []
     // WDom creation callback queue
   });
-}, d = () => v.value, J = (e, t) => {
-  const n = p.get(e);
+}, d = () => v.value, $ = (e, t) => {
+  const n = f.get(e);
   return n ? n[t] : null;
 }, ve = (e) => {
   v.value = e;
 }, ke = (e) => {
   v.value = e, Ce(e);
 }, Ct = (e) => {
-  K = e;
-}, Re = () => K, m = (e) => {
-  const t = p.get(e);
+  D = e;
+}, Re = () => D, ee = (e) => {
+  const t = f.get(e);
   t && (t.umts.forEach((n) => n()), t.umts = []);
 }, vt = (e) => {
-  m(e), p.delete(e);
-}, i = (e) => e.getParent && e.getParent(), x = Object.entries, w = Object.keys, k = (e) => typeof e == "object" && e !== null, M = Object.assign, kt = (e) => k(e) && !Array.isArray(e) && !Object.getOwnPropertySymbols(e).includes(h), R = (e) => k(e) && !("resolve" in e), E = (e, t) => R(e) && e.type === t, Pe = (e, t) => "ctor" in e ? e.ctor === (t && t.ctor) : e === (t && t.ctor), xe = (e, t) => !!(R(e) && t && t.type === "f" && t.children && t.children.length === (e.children && e.children.length)), Ee = (e, t) => !!(R(e) && t && t.type === "e" && t.tag === e.tag && t.children && t.children.length === (e.children && e.children.length)), X = (e, t) => !!(R(e) && t && t.type === e.type), Se = (e, t) => !!(R(e) && t && t.type === e.type && (C((e.children || [])[0]) && C((t.children || [])[0]) || t.children && e.children && t.children.length === e.children.length)), f = (e) => (e && e.compProps && e.compProps.key) ?? (e && e.props && e.props.key), y = (e) => e && ["f", "l"].includes(e), T = (e) => typeof e == "function" && !W(e) || k(e) && "resolve" in e, W = (e) => typeof e == "function" && e === S, Me = (e) => R(e) && !e.type, C = (e) => D(f(e)), D = (e) => e != null, Y = (e, t) => e === "style" && k(t), Te = (e, t) => e === "ref" && k(t), Ne = (e, t) => {
+  ee(e), f.delete(e);
+}, i = (e) => e.getParent && e.getParent(), x = Object.entries, te = Object.keys, k = (e) => typeof e == "object" && e !== null, b = Object.assign, kt = (e) => k(e) && !Array.isArray(e) && !Object.getOwnPropertySymbols(e).includes(h), R = (e) => k(e) && !("resolve" in e), S = (e, t) => R(e) && e.type === t, Pe = (e, t) => "ctor" in e ? e.ctor === (t && t.ctor) : e === (t && t.ctor), xe = (e, t) => !!(R(e) && t && t.type === "f" && t.children && t.children.length === (e.children && e.children.length)), Se = (e, t) => !!(R(e) && t && t.type === "e" && t.tag === e.tag && t.children && t.children.length === (e.children && e.children.length)), V = (e, t) => !!(R(e) && t && t.type === e.type), Ee = (e, t) => !!(R(e) && t && t.type === e.type && (C((e.children || [])[0]) && C((t.children || [])[0]) || t.children && e.children && t.children.length === e.children.length)), p = (e) => (e && e.compProps && e.compProps.key) ?? (e && e.props && e.props.key), y = (e) => e && ["f", "l"].includes(e), L = (e) => typeof e == "function" && !ne(e) || k(e) && "resolve" in e, ne = (e) => typeof e == "function" && e === N, Me = (e) => R(e) && !e.type, C = (e) => ce(p(e)), ce = (e) => e != null, K = (e, t) => e === "style" && k(t), Te = (e, t) => e === "ref" && k(t), Ne = (e, t) => {
   const n = Object.getOwnPropertyDescriptor(
     e.constructor.prototype,
     t
   );
   return n && n.get && n.set;
-}, be = (e) => T(e) ? "c" : E(e, "f") ? "f" : E(e, "e") ? "e" : E(e, "l") ? "l" : E(e, "t") ? "t" : "et", Le = {
+}, be = (e) => L(e) ? "c" : S(e, "f") ? "f" : S(e, "e") ? "e" : S(e, "l") ? "l" : S(e, "t") ? "t" : "et", Le = {
   c: Pe,
-  l: Se,
-  t: X,
-  e: Ee,
+  l: Ee,
+  t: V,
+  e: Se,
   f: xe,
-  et: X
-}, ee = (e) => {
+  et: V
+}, se = (e) => {
   const t = d();
   if (t) {
-    const n = p.get(t);
+    const n = f.get(t);
     n && n.umts.push(e);
   }
-}, N = (e) => {
+}, F = (e) => {
   const { compKey: t } = e;
-  t && Fe(t), te(e);
-}, te = (e) => {
+  t && Fe(t), re(e);
+}, re = (e) => {
   (e.children || []).forEach((t) => {
-    t.compKey ? N(t) : te(t);
+    t.compKey ? F(t) : re(t);
   });
 }, Fe = (e) => {
-  m(e), Re() || p.delete(e);
+  ee(e), Re() || f.delete(e);
 };
-let A = [];
+let j = [];
 const Ue = (e) => {
-  e.compKey && A.push(e);
-}, q = () => {
-  A.forEach((e) => Oe(e)), A = [];
+  e.compKey && j.push(e);
+}, E = () => {
+  j.forEach((e) => Oe(e)), j = [];
 }, Rt = (e) => {
   const t = d();
   if (t) {
-    const n = p.get(t);
+    const n = f.get(t);
     n && n.mts.push(e);
   }
 }, Oe = (e) => {
   const { compKey: t } = e;
   if (t) {
-    const n = p.get(t);
+    const n = f.get(t);
     if (!n) return;
     const { mts: c, upS: r } = n;
     v.value = t, r && (r.value = 0), c && (n.mts = [], c.forEach((s) => {
       const o = s();
-      o && ee(o);
+      o && se(o);
     }));
   }
 }, Pt = (e) => {
   const t = d();
   if (t) {
-    const n = p.get(t);
+    const n = f.get(t);
     n && n.wdCB.push(e);
   }
-}, Ae = (e) => {
+}, ge = (e) => {
   const { compKey: t } = e;
   if (t) {
-    const n = p.get(t), c = n && n.wdCB;
+    const n = f.get(t), c = n && n.wdCB;
     v.value = t, c && c.length > 0 && (n.wdCB = [], c.forEach((r) => {
       const s = r();
-      s && typeof s == "function" && ee(s);
+      s && typeof s == "function" && se(s);
     }));
   }
-}, Z = (e, t = () => []) => {
+}, m = (e, t = () => []) => {
   const n = d();
   if (!n) return;
-  const c = p.get(n);
+  const c = f.get(n);
   if (!c) return;
   const { upD: r, upS: s } = c, o = r[s.value], l = t();
   if (o && Be(o, l)) {
@@ -105,33 +105,32 @@ const Ue = (e) => {
     u && c.upCB.push(u);
   }
   r[s.value] = l, s.value += 1;
-}, ge = (e) => {
+}, Ae = (e) => {
   const { compKey: t } = e;
   if (t) {
-    const n = p.get(t);
+    const n = f.get(t);
     if (!n) return;
     const { upCB: c, upS: r } = n;
     v.value = t, r && (r.value = 0), e.ctor && c && (n.upCB = [], c.forEach((s) => s()));
   }
-}, Be = (e, t) => e.length ? e.some((n, c) => n !== t[c]) : !0, _ = () => new DocumentFragment(), Qe = (e) => document.createElement(e), xt = (e, t, n, c) => {
+}, Be = (e, t) => e.length ? e.some((n, c) => n !== t[c]) : !0, M = () => new DocumentFragment(), Qe = (e) => document.createElement(e), xt = (e, t, n, c) => {
   e.isRoot = !0, t = t || document.body, e.we = t;
-  const r = L(e, c);
-  return n ? (e.ae = n, t.insertBefore(r, n)) : c || (t.tagName === "HTML" ? t.replaceWith(r) : t.appendChild(r)), q(), () => {
-    const s = p.get(e.compProps || {}), o = s && s.vd.value || e;
-    o !== e && N(o), b(o), je(o);
+  const r = O(e, c);
+  return n ? (e.ae = n, t.insertBefore(r, n)) : c || (t.tagName === "HTML" ? t.replaceWith(r) : t.appendChild(r)), E(), () => {
+    const s = f.get(e.compProps || {}), o = s && s.vd.value || e;
+    o !== e && F(o), U(o), je(o);
   };
-}, b = (e) => {
-  e.props && e.el && le(e.props, e.el), (e.children || []).forEach((t) => {
-    b(t);
+}, U = (e) => {
+  e.props && e.el && fe(e.props, e.el), (e.children || []).forEach((t) => {
+    U(t);
   });
-}, je = (e) => ne(e, e.we), I = (e) => {
-  e.op && e.el && le(e.op, e.el), ne(
-    e,
-    F(i(e))
-  );
-}, ne = (e, t) => {
-  t && e.el && (e.el.nodeType === 11 || (e == null ? void 0 : e.tag) === "portal" ? ce(e) : [1, 3].includes(e.el.nodeType) && t.removeChild(e.el), delete e.el);
-}, ce = (e, t) => {
+}, je = (e) => oe(e, e.we), J = (e) => {
+  e.op && e.el && fe(e.op, e.el);
+  const t = i(e), n = e.isRoot ? e.we : t ? g(t) : void 0;
+  n && oe(e, n);
+}, oe = (e, t) => {
+  t && e.el && (e.el.nodeType === 11 || (e == null ? void 0 : e.tag) === "portal" ? le(e) : [1, 3].includes(e.el.nodeType) && t.removeChild(e.el), delete e.el);
+}, le = (e, t) => {
   (e && e.oc || e && e.children || []).forEach(
     (n) => {
       const c = n.el && n.el.nodeType;
@@ -139,40 +138,51 @@ const Ue = (e) => {
         if ([1, 3].includes(c)) {
           const r = n.el;
           r.tagName === "HTML" ? r.innerHTML = "" : r.remove();
-        } else c === 11 && ce(n);
+        } else c === 11 && le(n);
     }
   );
-}, se = (e) => {
-  I(e), z(e);
+}, q = (e) => {
+  J(e), T(e);
 }, qe = (e) => {
-  if (B(e), i(e).nr !== "L") {
-    const n = re(e);
-    z(e, n);
+  z(e);
+  const t = i(e);
+  if (!t) {
+    if (e.isRoot) {
+      const n = _(e);
+      T(e, n);
+    }
+    return;
+  }
+  if (t.nr !== "L") {
+    const n = _(e);
+    T(e, n);
   }
-}, z = (e, t) => {
-  t || (t = L(e));
+}, T = (e, t) => {
+  t || (t = O(e));
   const n = i(e);
-  if (n.type) {
-    const c = F(n), s = n.type === "l" && n.nr && n.nr !== "L" ? g(n, i(n)) : g(e, n);
-    t && c && (e.tag !== "portal" && (s ? c.insertBefore(t, s) : c.appendChild(t)), q());
+  if (!n || !n.type) {
+    e.isRoot && e.we && t && e.tag !== "portal" && (e.ae ? e.we.insertBefore(t, e.ae) : e.we.tagName === "HTML" ? e.we.replaceWith(t) : e.we.appendChild(t), E());
+    return;
   }
-}, re = (e) => y(e.type) ? (e && e.children || []).reduce((t, n) => {
-  const c = re(n);
+  const c = g(n), s = n.type === "l" && n.nr && n.nr !== "L" ? I(n, i(n)) : I(e, n);
+  t && c && (e.tag !== "portal" && (s ? c.insertBefore(t, s) : c.appendChild(t)), E());
+}, _ = (e) => y(e.type) ? (e && e.children || []).reduce((t, n) => {
+  const c = _(n);
   return c && t.appendChild(c), t;
-}, _()) : e.el, g = (e, t) => {
-  const n = t.children || [], r = n.indexOf(e) + 1, s = n.slice(r), o = oe(s), l = t.type || "";
+}, M()) : e.el, I = (e, t) => {
+  const n = t.children || [], r = n.indexOf(e) + 1, s = n.slice(r), o = ue(s), l = t.type || "";
   if (o)
     return o;
   if (!t.isRoot && y(l))
-    return g(t, i(t));
+    return I(t, i(t));
   if (t.isRoot && y(l) && t.ae)
     return t.ae;
-}, oe = (e) => e.reduce(
+}, ue = (e) => e.reduce(
   (t, n) => {
     if (t) return t;
     const { type: c, el: r } = n;
     if (c && y(c)) {
-      const s = oe(n.children || []);
+      const s = ue(n.children || []);
       if (s) return s;
     }
     return r && r.nodeType !== 11 ? r : t;
@@ -180,101 +190,107 @@ const Ue = (e) => {
   void 0
 ), _e = (e) => {
   const t = i(e), n = e.el;
-  if (t.type && n)
+  if (e.isRoot && !t && n) {
+    q(e);
+    return;
+  }
+  if (t && t.type && n)
     if (n.nodeType === 11)
-      se(e);
+      q(e);
     else {
-      const c = F(t), r = L(e);
-      c && e.tag !== "portal" && c.replaceChild(r, n), q();
+      const c = g(t), r = O(e);
+      c && e.tag !== "portal" && c.replaceChild(r, n), E();
     }
-}, le = (e, t) => {
+}, fe = (e, t) => {
   x(e || {}).forEach(([n, c]) => {
     n.match(/^on/) && t.removeEventListener(
       n.slice(2).toLowerCase(),
       c
     );
   });
-}, B = (e) => {
+}, z = (e) => {
   if (e.type === "t") {
     ze(e);
     return;
   }
   if (e.el) {
     const { op: t, props: n } = e;
-    pe(n, e.el, t), delete e.op, e.tag === "input" && (e.el.value = String(
+    ie(n, e.el, t), delete e.op, e.tag === "input" && (e.el.value = String(
       n && n.value || ""
     ));
   }
-  (e.children || []).forEach((t) => ue(t)), ge(e);
-}, ue = (e) => {
+  (e.children || []).forEach((t) => pe(t)), Ae(e);
+}, pe = (e) => {
   const { nr: t } = e;
   t !== void 0 && t !== "N" && (Ie[t](e), delete e.nr, delete e.oc, delete e.op);
 }, Ie = {
-  A: z,
-  D: I,
+  A: T,
+  D: J,
   R: _e,
-  U: B,
-  S: se,
+  U: z,
+  S: q,
   T: qe,
-  L: B
+  L: z
 }, ze = (e) => {
   e.el && (e.el.nodeValue = String(e.text));
-}, pe = (e, t, n, c) => {
+}, ie = (e, t, n, c) => {
   const r = n || {};
   x(e || {}).forEach(([s, o]) => {
     if (o === r[s]) {
       delete r[s];
       return;
     }
-    c && s.match(/^on/) ? $(
+    c && s.match(/^on/) ? w(
       t,
       s,
       o,
       r[s]
-    ) : (s === "key" || o === r[s] || s === "portal" && k(o) || (s === "innerHTML" && typeof o == "string" ? t.innerHTML = o : Y(s, o) ? Je(
+    ) : (s === "key" || o === r[s] || s === "portal" && k(o) || (s === "innerHTML" && typeof o == "string" ? t.innerHTML = o : K(s, o) ? Je(
       o,
-      Y(s, r.style) ? r.style : {},
+      K(s, r.style) ? r.style : {},
       t
-    ) : Te(s, o) ? o.value = t : s.match(/^on/) ? $(
+    ) : Te(s, o) ? o.value = t : s.match(/^on/) ? w(
       t,
       s,
       o,
       r[s]
-    ) : s && (s !== "type" && Ne(t, s) ? t[s] = o : Ge(
+    ) : s && (s !== "type" && Ne(t, s) ? t[s] = o : He(
       s === "className" ? "class" : s,
       t,
       o
     ))), delete r[s]);
-  }), w(r).forEach(
+  }), te(r).forEach(
     (s) => t.removeAttribute(s)
   );
-}, Ge = (e, t, n) => P.value && e !== "xmlns" ? t.setAttributeNS(null, e, n) : t.setAttribute(e, n), L = (e, t) => {
+}, He = (e, t, n) => P.value && e !== "xmlns" ? t.setAttributeNS(null, e, n) : t.setAttribute(e, n), O = (e, t) => {
   let n;
   const { type: c, tag: r, text: s, props: o, children: l = [] } = e, u = y(c);
-  if (Ae(e), r === "svg" && (P.value = String(o && o.xmlns)), t)
+  if (ge(e), r === "svg" && (P.value = String(o && o.xmlns)), t)
     n = e.el;
   else {
-    if (u)
-      n = _();
+    if (!c)
+      n = M();
+    else if (u)
+      n = M();
     else if (c === "e" && r)
       r === "portal" && o && o.portal ? n = o.portal : n = P.value ? document.createElementNS(P.value, r) : Qe(r);
-    else if (c === "t" && D(s))
+    else if (c === "t" && ce(s))
       n = document.createTextNode(String(s));
     else
       throw Error("Invalid wDom");
     e.el = n;
   }
-  return He(l, n, t), pe(o, n, null, t), Ue(e), r === "svg" && (P.value = ""), n;
-}, He = (e, t, n) => {
+  return Ge(l, n, t), ie(o, n, null, t), Ue(e), r === "svg" && (P.value = ""), n;
+}, Ge = (e, t, n) => {
   const c = e.reduce((r, s) => {
     if (s.type) {
-      const o = L(s, n);
+      const o = O(s, n);
       s.tag !== "portal" && !n && r.appendChild(o);
     }
     return r;
-  }, _());
+  }, M());
   !n && t && c.hasChildNodes() && t.appendChild(c);
-}, $ = (e, t, n, c) => {
+}, w = (e, t, n, c) => {
   const r = t.slice(2).toLowerCase();
   c !== n && (c && e.removeEventListener(r, c), n && e.addEventListener(r, n));
 }, Je = (e, t, n) => {
@@ -286,10 +302,10 @@ const Ue = (e) => {
   }), x(c).forEach(([l]) => {
     o[l] = "";
   });
-}, F = (e) => {
+}, g = (e) => {
   const t = y(e.type);
-  return e.isRoot && t ? e.we : t ? F(i(e)) : e.el;
-}, U = (e, t) => Xe(
+  return e.isRoot && t ? e.we : t ? g(i(e)) : e.el;
+}, A = (e, t) => Xe(
   e,
   Le[be(e)](e, t),
   t
@@ -305,7 +321,7 @@ const Ue = (e) => {
     n
   )), c.nr = r, Ye(c, n, r), !s && n && (n.il = !0, delete n.children), (n == null ? void 0 : n.tag) === "portal" && (c.tag = "portal"), c;
 }, Ye = (e, t, n) => {
-  n !== "A" && t && (e.el = t.el), (n === "D" || n === "R" || n === "S") && (t && (N(t), b(t)), e.oc = t && t.children), e.op = t && t.props;
+  n !== "A" && t && (e.el = t.el), (n === "D" || n === "R" || n === "S") && (t && (F(t), U(t)), e.oc = t && t.children), e.op = t && t.props;
 }, Ze = (e, t, n) => {
   if (Me(e)) return "D";
   if (e.type === "t" && t && e.text === (n && n.text) || e === n) return "N";
@@ -317,25 +333,25 @@ const Ue = (e) => {
   if (!C((e.children || [])[0]) || !C((t.children || [])[0]))
     return !1;
   const n = [...t && t.children || []], c = [...e && e.children || []].filter(
-    (o) => n.find((l) => f(o) === f(l))
+    (o) => n.find((l) => p(o) === p(l))
   ), r = n.filter(
-    (o) => c.find((l) => f(o) === f(l))
+    (o) => c.find((l) => p(o) === p(l))
   );
   let s = r.length === c.length;
   return s && (s = r.every(
-    (o, l) => f(o) === f(c[l])
+    (o, l) => p(o) === p(c[l])
   )), s;
 }, Ve = (e, t) => {
-  e && t !== e && (w(e).forEach((n) => delete e[n]), x(t || {}).forEach(([n, c]) => e[n] = c));
+  e && t !== e && (te(e).forEach((n) => delete e[n]), x(t || {}).forEach(([n, c]) => e[n] = c));
 }, Ke = (e, t) => {
   e && (e.splice(0, e.length), t && t.forEach((n) => e.push(n)));
 }, me = (e, t) => {
   const { compProps: n, compChild: c } = e, { props: r, children: s } = t;
   return n && Ve(n, r), c && s && c !== s && Ke(c, s), e.reRender && e.reRender();
-}, we = (e, t, n) => T(e) ? t && n ? me(n, e) : e.resolve() : e, We = (e, t, n) => t && n ? et(e, n) : De(e), De = (e) => (e.children || []).map(
-  (t) => M(U(t), { getParent: () => e })
+}, we = (e, t, n) => L(e) ? t && n ? me(n, e) : e.resolve() : e, We = (e, t, n) => t && n ? et(e, n) : De(e), De = (e) => (e.children || []).map(
+  (t) => b(A(t), { getParent: () => e })
 ), et = (e, t) => e.type === "l" && C((e.children || [])[0]) ? tt(e, t) : (e.children || []).map(
-  (n, c) => M(U(n, (t.children || [])[c]), {
+  (n, c) => b(A(n, (t.children || [])[c]), {
     getParent: () => e
   })
 ), tt = (e, t) => {
@@ -344,49 +360,49 @@ const Ue = (e) => {
     t
   );
   return c.forEach((r) => {
-    N(r), b(r), I(r);
+    F(r), U(r), J(r);
   }), n;
 }, nt = (e, t) => {
   const n = [...t.children || []];
   return [(e.children || []).map((r) => {
-    const s = ct(r, n), o = U(r, s);
+    const s = ct(r, n), o = A(r, s);
     return s && n.splice(n.indexOf(s), 1), o.getParent = () => e, o;
   }), n];
 }, ct = (e, t) => t.find(
-  (n) => f(n) === f(e)
-), Q = /* @__PURE__ */ new Map();
-let j = !1;
+  (n) => p(n) === p(e)
+), H = /* @__PURE__ */ new Map();
+let G = !1;
 const st = (e, t) => {
-  const n = p.get(e);
+  const n = f.get(e);
   n && (n.up = () => {
-    Q.set(e, t), j || (j = !0, queueMicrotask(rt));
+    H.set(e, t), G || (G = !0, queueMicrotask(rt));
   });
-}, fe = (e) => () => {
-  const t = p.get(e), n = t && t.up;
+}, de = (e) => () => {
+  const t = f.get(e), n = t && t.up;
   return n ? (n(), !0) : !1;
 }, rt = () => {
-  Q.forEach((e) => {
+  H.forEach((e) => {
     e();
-  }), Q.clear(), j = !1;
-}, Et = (e, t = () => []) => {
+  }), H.clear(), G = !1;
+}, St = (e, t = () => []) => {
   const n = d();
   if (!n) return;
-  const c = p.get(n);
-  c && (c.upR.push(() => Z(e, t)), Z(e, t));
+  const c = f.get(n);
+  c && (c.upR.push(() => m(e, t)), m(e, t));
 }, ot = () => {
   const e = d();
   if (!e) return;
-  const t = p.get(e), n = t && t.upR;
+  const t = f.get(e), n = t && t.upR;
   n && n.length && n.forEach((c) => c());
-}, S = (e, ...t) => ({
+}, N = (e, ...t) => ({
   type: "f",
   // fragment
   [h]: !0,
   children: t
 }), lt = (e, t, ...n) => {
-  const c = { value: void 0 }, r = ie(c, n), s = ft(e, t || {}, r);
-  return T(s) || (c.value = s), s;
-}, St = (e, t) => lt("portal", { portal: t }, e), Mt = (e) => (t, n) => e, Tt = (e) => (t, n) => (V.add(e), e), ut = (e, t, n) => {
+  const c = { value: void 0 }, r = he(c, n), s = pt(e, t || {}, r);
+  return L(s) || (c.value = s), s;
+}, Et = (e, t) => lt("portal", { portal: t }, e), Mt = (e) => (t, n) => e, Tt = (e) => (t, n) => (W.add(e), e), ut = (e, t, n) => {
   const c = (r, s) => {
     if (!(!r || s.has(r))) {
       if (s.add(r), r.compChild) {
@@ -397,22 +413,22 @@ const st = (e, t) => {
     }
   };
   c(e, /* @__PURE__ */ new Set());
-}, pt = (e, t, n, c) => {
+}, ft = (e, t, n, c) => {
   if (c.il)
     return;
   a.value = !0;
-  const r = he(e, t, n), s = U(r, c), { isRoot: o, getParent: l, we: u, ae: ye } = c;
+  const r = ae(e, t, n), s = A(r, c), { isRoot: o, getParent: l, we: u, ae: B } = c;
   if (s.getParent = l, !o && l) {
-    const O = l(), G = O && O.children || [], H = G.indexOf(c);
-    H !== -1 && G.splice(H, 1, s), ut(O, c, s);
+    const Q = l(), Y = Q && Q.children || [], Z = Y.indexOf(c);
+    Z !== -1 && Y.splice(Z, 1, s), ut(Q, c, s);
   } else
-    s.isRoot = !0, s.we = u, s.ae = ye;
-  a.value = !1, ue(s);
-}, ft = (e, t, n) => {
-  if (W(e))
-    return S(t, ...n);
-  if (T(e)) {
-    const c = he(e, t, n);
+    s.isRoot = !0, s.we = u, s.ae = B;
+  a.value = !1, pe(s);
+}, pt = (e, t, n) => {
+  if (ne(e))
+    return N(t, ...n);
+  if (L(e)) {
+    const c = ae(e, t, n);
     return a.value ? c : c.resolve();
   }
   return {
@@ -423,13 +439,13 @@ const st = (e, t) => {
     props: t,
     children: n
   };
-}, ie = (e, t) => t.map(
-  (n) => M(de(n), { getParent: () => e.value })
-), de = (e) => {
+}, he = (e, t) => t.map(
+  (n) => b(X(n), { getParent: () => e.value })
+), X = (e) => {
   if (e == null || e === !1)
     return { type: null, [h]: !0 };
   if (Array.isArray(e)) {
-    const t = { value: void 0 }, n = ie(t, e), c = {
+    const t = { value: void 0 }, n = he(t, e), c = {
       type: "l",
       // loop (array mapping)
       [h]: !0,
@@ -446,7 +462,7 @@ const st = (e, t) => {
   let o;
   if (typeof s == "function") {
     const u = s;
-    o = V.has(u) ? u(t, n) : u(fe(c), t, n);
+    o = W.has(u) ? u(t, n) : u(de(c), t, n);
   } else
     o = (u) => e(u, n);
   const l = dt(
@@ -457,28 +473,28 @@ const st = (e, t) => {
     n
   );
   return a.value = r, l;
-}, he = (e, t, n) => {
+}, ae = (e, t, n) => {
   const c = e, r = n, s = it(e, t, r);
   return { ctor: c, props: t, children: r, resolve: s };
 }, dt = (e, t, n, c, r) => {
-  const { wrappedComponentMaker: s, customNode: o } = yt(
-    e,
-    c
-  ), l = ht(
+  const s = (B) => X(e(B)), { wrappedComponentMaker: o, customNode: l } = yt(
     s,
+    c
+  ), u = ht(
+    o,
     t,
     n,
     c,
     r
   );
-  return ae(o, t, n, c, r, l), o;
+  return ye(l, t, n, c, r, u), l;
 }, ht = (e, t, n, c, r) => {
   const s = () => at(e, t, n, c, r, s);
   return s;
 }, at = (e, t, n, c, r, s) => {
   ve(t), ot();
   const o = e(c);
-  return ae(o, t, n, c, r, s), o;
+  return ye(o, t, n, c, r, s), o;
 }, yt = (e, t) => {
   let n = e(t);
   if (!n.reRender)
@@ -486,15 +502,15 @@ const st = (e, t) => {
   const c = (r) => {
     const s = e(r);
     if (!s || !s.reRender) {
-      const l = de(s), u = S({}, l);
+      const l = X(s), u = N({}, l);
       return l.getParent = () => u, u;
     }
-    const o = S({}, s);
+    const o = N({}, s);
     return s.getParent = () => o, o;
   };
   return n = c(t), { wrappedComponentMaker: c, customNode: n };
-}, ae = (e, t, n, c, r, s) => {
-  M(e, {
+}, ye = (e, t, n, c, r, s) => {
+  b(e, {
     compProps: c,
     compChild: r,
     ctor: n,
@@ -502,38 +518,38 @@ const st = (e, t) => {
     reRender: s
   }), st(
     t,
-    () => pt(
+    () => ft(
       n,
       e.compProps || c,
       e.compChild || r,
       e
     )
-  ), J(t, "vd") && (J(t, "vd").value = e);
+  ), $(t, "vd") && ($(t, "vd").value = e);
 }, Nt = (e) => ({ value: e }), bt = () => Promise.resolve(), Lt = () => {
   const e = d();
-  return e ? fe(e) : () => !1;
+  return e ? de(e) : () => !1;
 };
 export {
-  S as Fragment,
-  p as componentMap,
-  fe as componentUpdate,
+  N as Fragment,
+  f as componentMap,
+  de as componentUpdate,
   vt as disposeComponentEntry,
   d as getComponentKey,
-  J as getComponentSubInfo,
+  $ as getComponentSubInfo,
   lt as h,
   kt as isPropType,
   Tt as lmount,
-  V as lmountComponentSet,
+  W as lmountComponentSet,
   Mt as mount,
   Rt as mountCallback,
   Pt as mountReadyCallback,
   bt as nextTick,
-  St as portal,
+  Et as portal,
   Nt as ref,
   xt as render,
-  pt as replaceWDom,
+  ft as replaceWDom,
   Ct as setComponentMapManualMode,
-  Et as updateCallback,
+  St as updateCallback,
   Lt as useRenew
 };
 //# sourceMappingURL=lithent.mjs.map