@boxcustodia/library 1.7.0 → 1.7.1-canary.0

package/dist/index.es389.js

@@ -1,4 +1,133 @@
-var e = { exports: {} };
+class a {
+  get childNodes() {
+    throw new Error("childNodes is not supported");
+  }
+  clone() {
+    let t = new a(this.type, this.key);
+    return t.value = this.value, t.level = this.level, t.hasChildNodes = this.hasChildNodes, t.rendered = this.rendered, t.textValue = this.textValue, t["aria-label"] = this["aria-label"], t.index = this.index, t.parentKey = this.parentKey, t.prevKey = this.prevKey, t.nextKey = this.nextKey, t.firstChildKey = this.firstChildKey, t.lastChildKey = this.lastChildKey, t.props = this.props, t.render = this.render, t.colSpan = this.colSpan, t.colIndex = this.colIndex, t;
+  }
+  constructor(t, e) {
+    this.value = null, this.level = 0, this.hasChildNodes = !1, this.rendered = null, this.textValue = "", this["aria-label"] = void 0, this.index = 0, this.parentKey = null, this.prevKey = null, this.nextKey = null, this.firstChildKey = null, this.lastChildKey = null, this.props = {}, this.colSpan = null, this.colIndex = null, this.type = t, this.key = e;
+  }
+}
+class d {
+  get size() {
+    return this.keyMap.size;
+  }
+  getKeys() {
+    return this.keyMap.keys();
+  }
+  *[Symbol.iterator]() {
+    let t = this.firstKey != null ? this.keyMap.get(this.firstKey) : void 0;
+    for (; t; )
+      yield t, t = t.nextKey != null ? this.keyMap.get(t.nextKey) : void 0;
+  }
+  getChildren(t) {
+    let e = this.keyMap;
+    return {
+      *[Symbol.iterator]() {
+        let l = e.get(t), n = (l == null ? void 0 : l.firstChildKey) != null ? e.get(l.firstChildKey) : null;
+        for (; n; )
+          yield n, n = n.nextKey != null ? e.get(n.nextKey) : void 0;
+      }
+    };
+  }
+  getKeyBefore(t) {
+    let e = this.keyMap.get(t);
+    if (!e) return null;
+    if (e.prevKey != null) {
+      for (e = this.keyMap.get(e.prevKey); e && e.type !== "item" && e.lastChildKey != null; ) e = this.keyMap.get(e.lastChildKey);
+      var l;
+      return (l = e == null ? void 0 : e.key) !== null && l !== void 0 ? l : null;
+    }
+    return e.parentKey;
+  }
+  getKeyAfter(t) {
+    let e = this.keyMap.get(t);
+    if (!e) return null;
+    if (e.type !== "item" && e.firstChildKey != null) return e.firstChildKey;
+    for (; e; ) {
+      if (e.nextKey != null) return e.nextKey;
+      if (e.parentKey != null) e = this.keyMap.get(e.parentKey);
+      else return null;
+    }
+    return null;
+  }
+  getFirstKey() {
+    return this.firstKey;
+  }
+  getLastKey() {
+    let t = this.lastKey != null ? this.keyMap.get(this.lastKey) : null;
+    for (; (t == null ? void 0 : t.lastChildKey) != null; ) t = this.keyMap.get(t.lastChildKey);
+    var e;
+    return (e = t == null ? void 0 : t.key) !== null && e !== void 0 ? e : null;
+  }
+  getItem(t) {
+    var e;
+    return (e = this.keyMap.get(t)) !== null && e !== void 0 ? e : null;
+  }
+  at() {
+    throw new Error("Not implemented");
+  }
+  clone() {
+    let t = this.constructor, e = new t();
+    return e.keyMap = new Map(this.keyMap), e.firstKey = this.firstKey, e.lastKey = this.lastKey, e;
+  }
+  addNode(t) {
+    if (this.frozen) throw new Error("Cannot add a node to a frozen collection");
+    this.keyMap.set(t.key, t);
+  }
+  removeNode(t) {
+    if (this.frozen) throw new Error("Cannot remove a node to a frozen collection");
+    this.keyMap.delete(t);
+  }
+  commit(t, e, l = !1) {
+    if (this.frozen) throw new Error("Cannot commit a frozen collection");
+    this.firstKey = t, this.lastKey = e, this.frozen = !l;
+  }
+  // TODO: this is pretty specific to menu, will need to check if it is generic enough
+  // Will need to handle varying levels I assume but will revisit after I get searchable menu working for base menu
+  // TODO: an alternative is to simply walk the collection and add all item nodes that match the filter and any sections/separators we encounter
+  // to an array, then walk that new array and fix all the next/Prev keys while adding them to the new collection
+  UNSTABLE_filter(t) {
+    let e = new d(), l = null;
+    for (let n of this)
+      if (n.type === "section" && n.hasChildNodes) {
+        let i = n.clone(), r = null;
+        for (let o of this.getChildren(n.key)) if (h(o, t, this, e)) {
+          let s = o.clone();
+          r == null && (i.firstChildKey = s.key), e.firstKey == null && (e.firstKey = i.key), r && r.parentKey === s.parentKey ? (r.nextKey = s.key, s.prevKey = r.key) : s.prevKey = null, s.nextKey = null, e.addNode(s), r = s;
+        }
+        r && (r.type !== "header" ? (i.lastChildKey = r.key, l == null ? i.prevKey = null : (l.type === "section" || l.type === "separator") && (l.nextKey = i.key, i.prevKey = l.key), i.nextKey = null, l = i, e.addNode(i)) : (e.firstKey === i.key && (e.firstKey = null), e.removeNode(r.key)));
+      } else if (n.type === "separator") {
+        let i = n.clone();
+        i.nextKey = null, (l == null ? void 0 : l.type) === "section" && (l.nextKey = i.key, i.prevKey = l.key, l = i, e.addNode(i));
+      } else {
+        let i = n.clone();
+        h(i, t, this, e) && (e.firstKey == null && (e.firstKey = i.key), l != null && l.type !== "section" && l.type !== "separator" && l.parentKey === i.parentKey ? (l.nextKey = i.key, i.prevKey = l.key) : i.prevKey = null, i.nextKey = null, e.addNode(i), l = i);
+      }
+    if ((l == null ? void 0 : l.type) === "separator" && l.nextKey === null) {
+      let n;
+      l.prevKey != null && (n = e.getItem(l.prevKey), n.nextKey = null), e.removeNode(l.key), l = n;
+    }
+    return e.lastKey = (l == null ? void 0 : l.key) || null, e;
+  }
+  constructor() {
+    this.keyMap = /* @__PURE__ */ new Map(), this.firstKey = null, this.lastKey = null, this.frozen = !1;
+  }
+}
+function h(y, t, e, l) {
+  if (y.type === "subdialogtrigger" || y.type === "submenutrigger") {
+    let n = [
+      ...e.getChildren(y.key)
+    ][0];
+    if (n && t(n.textValue)) {
+      let i = n.clone();
+      return l.addNode(i), !0;
+    } else return !1;
+  } else return y.type === "header" ? !0 : t(y.textValue);
+}
 export {
-  e as __module
+  d as BaseCollection,
+  a as CollectionNode
 };

package/dist/index.es39.js

@@ -1,9 +1,9 @@
-import { j as t } from "./index.es106.js";
+import { j as t } from "./index.es104.js";
 import * as d from "react";
 import { createElement as D } from "react";
 import { useControllableState as b } from "./index.es90.js";
 import { PopoverRoot as I, PopoverTrigger as T, PopoverContent as F } from "./index.es63.js";
-import L from "./index.es124.js";
+import L from "./index.es123.js";
 import { Button as M } from "./index.es32.js";
 import { cn as x } from "./index.es91.js";
 import { AutoCompleteRoot as O, AutoCompleteInput as U, AutoCompleteEmpty as W, AutoCompleteList as q, AutoCompleteItem as z } from "./index.es28.js";

package/dist/index.es390.js

@@ -1,233 +1,219 @@
-import { __exports as U } from "./index.es447.js";
-/**
- * @license React
- * scheduler.production.js
- *
- * Copyright (c) Meta Platforms, Inc. and affiliates.
- *
- * This source code is licensed under the MIT license found in the
- * LICENSE file in the root directory of this source tree.
- */
-var A;
-function V() {
-  return A ? U : (A = 1, function(l) {
-    function g(e, a) {
-      var n = e.length;
-      e.push(a);
-      e: for (; 0 < n; ) {
-        var u = n - 1 >>> 1, r = e[u];
-        if (0 < m(r, a))
-          e[u] = a, e[n] = r, n = u;
-        else break e;
-      }
-    }
-    function i(e) {
-      return e.length === 0 ? null : e[0];
-    }
-    function k(e) {
-      if (e.length === 0) return null;
-      var a = e[0], n = e.pop();
-      if (n !== a) {
-        e[0] = n;
-        e: for (var u = 0, r = e.length, P = r >>> 1; u < P; ) {
-          var T = 2 * (u + 1) - 1, I = e[T], o = T + 1, C = e[o];
-          if (0 > m(I, n))
-            o < r && 0 > m(C, I) ? (e[u] = C, e[o] = n, u = o) : (e[u] = I, e[T] = n, u = T);
-          else if (o < r && 0 > m(C, n))
-            e[u] = C, e[o] = n, u = o;
-          else break e;
-        }
-      }
-      return a;
-    }
-    function m(e, a) {
-      var n = e.sortIndex - a.sortIndex;
-      return n !== 0 ? n : e.id - a.id;
-    }
-    if (l.unstable_now = void 0, typeof performance == "object" && typeof performance.now == "function") {
-      var E = performance;
-      l.unstable_now = function() {
-        return E.now();
-      };
-    } else {
-      var j = Date, G = j.now();
-      l.unstable_now = function() {
-        return j.now() - G;
-      };
-    }
-    var s = [], c = [], J = 1, f = null, t = 3, S = !1, d = !1, _ = !1, q = !1, F = typeof setTimeout == "function" ? setTimeout : null, Q = typeof clearTimeout == "function" ? clearTimeout : null, Y = typeof setImmediate < "u" ? setImmediate : null;
-    function w(e) {
-      for (var a = i(c); a !== null; ) {
-        if (a.callback === null) k(c);
-        else if (a.startTime <= e)
-          k(c), a.sortIndex = a.expirationTime, g(s, a);
-        else break;
-        a = i(c);
+import { CollectionNode as S } from "./index.es389.js";
+class b {
+  *[Symbol.iterator]() {
+    let i = this.firstChild;
+    for (; i; )
+      yield i, i = i.nextSibling;
+  }
+  get firstChild() {
+    return this._firstChild;
+  }
+  set firstChild(i) {
+    this._firstChild = i, this.ownerDocument.markDirty(this);
+  }
+  get lastChild() {
+    return this._lastChild;
+  }
+  set lastChild(i) {
+    this._lastChild = i, this.ownerDocument.markDirty(this);
+  }
+  get previousSibling() {
+    return this._previousSibling;
+  }
+  set previousSibling(i) {
+    this._previousSibling = i, this.ownerDocument.markDirty(this);
+  }
+  get nextSibling() {
+    return this._nextSibling;
+  }
+  set nextSibling(i) {
+    this._nextSibling = i, this.ownerDocument.markDirty(this);
+  }
+  get parentNode() {
+    return this._parentNode;
+  }
+  set parentNode(i) {
+    this._parentNode = i, this.ownerDocument.markDirty(this);
+  }
+  get isConnected() {
+    var i;
+    return ((i = this.parentNode) === null || i === void 0 ? void 0 : i.isConnected) || !1;
+  }
+  invalidateChildIndices(i) {
+    (this._minInvalidChildIndex == null || i.index < this._minInvalidChildIndex.index) && (this._minInvalidChildIndex = i);
+  }
+  updateChildIndices() {
+    let i = this._minInvalidChildIndex;
+    for (; i; )
+      i.index = i.previousSibling ? i.previousSibling.index + 1 : 0, i = i.nextSibling;
+    this._minInvalidChildIndex = null;
+  }
+  appendChild(i) {
+    i.parentNode && i.parentNode.removeChild(i), this.firstChild == null && (this.firstChild = i), this.lastChild ? (this.lastChild.nextSibling = i, i.index = this.lastChild.index + 1, i.previousSibling = this.lastChild) : (i.previousSibling = null, i.index = 0), i.parentNode = this, i.nextSibling = null, this.lastChild = i, this.ownerDocument.markDirty(this), this.ownerDocument.queueUpdate();
+  }
+  insertBefore(i, t) {
+    if (t == null) return this.appendChild(i);
+    i.parentNode && i.parentNode.removeChild(i), i.nextSibling = t, i.previousSibling = t.previousSibling, i.index = t.index, this.firstChild === t ? this.firstChild = i : t.previousSibling && (t.previousSibling.nextSibling = i), t.previousSibling = i, i.parentNode = t.parentNode, this.invalidateChildIndices(t), this.ownerDocument.queueUpdate();
+  }
+  removeChild(i) {
+    i.parentNode !== this || !this.ownerDocument.isMounted || (i.nextSibling && (this.invalidateChildIndices(i.nextSibling), i.nextSibling.previousSibling = i.previousSibling), i.previousSibling && (i.previousSibling.nextSibling = i.nextSibling), this.firstChild === i && (this.firstChild = i.nextSibling), this.lastChild === i && (this.lastChild = i.previousSibling), i.parentNode = null, i.nextSibling = null, i.previousSibling = null, i.index = 0, this.ownerDocument.markDirty(i), this.ownerDocument.queueUpdate());
+  }
+  addEventListener() {
+  }
+  removeEventListener() {
+  }
+  get previousVisibleSibling() {
+    let i = this.previousSibling;
+    for (; i && i.isHidden; ) i = i.previousSibling;
+    return i;
+  }
+  get nextVisibleSibling() {
+    let i = this.nextSibling;
+    for (; i && i.isHidden; ) i = i.nextSibling;
+    return i;
+  }
+  get firstVisibleChild() {
+    let i = this.firstChild;
+    for (; i && i.isHidden; ) i = i.nextSibling;
+    return i;
+  }
+  get lastVisibleChild() {
+    let i = this.lastChild;
+    for (; i && i.isHidden; ) i = i.previousSibling;
+    return i;
+  }
+  constructor(i) {
+    this._firstChild = null, this._lastChild = null, this._previousSibling = null, this._nextSibling = null, this._parentNode = null, this._minInvalidChildIndex = null, this.ownerDocument = i;
+  }
+}
+class h extends b {
+  get index() {
+    return this._index;
+  }
+  set index(i) {
+    this._index = i, this.ownerDocument.markDirty(this);
+  }
+  get level() {
+    return this.parentNode instanceof h ? this.parentNode.level + (this.node.type === "item" ? 1 : 0) : 0;
+  }
+  /**
+  * Lazily gets a mutable instance of a Node. If the node has already
+  * been cloned during this update cycle, it just returns the existing one.
+  */
+  getMutableNode() {
+    return this.isMutated || (this.node = this.node.clone(), this.isMutated = !0), this.ownerDocument.markDirty(this), this.node;
+  }
+  updateNode() {
+    var i, t, n;
+    let s = this.nextVisibleSibling, e = this.getMutableNode();
+    e.index = this.index, e.level = this.level, e.parentKey = this.parentNode instanceof h ? this.parentNode.node.key : null;
+    var o;
+    e.prevKey = (o = (i = this.previousVisibleSibling) === null || i === void 0 ? void 0 : i.node.key) !== null && o !== void 0 ? o : null;
+    var r;
+    e.nextKey = (r = s == null ? void 0 : s.node.key) !== null && r !== void 0 ? r : null, e.hasChildNodes = !!this.firstChild;
+    var d;
+    e.firstChildKey = (d = (t = this.firstVisibleChild) === null || t === void 0 ? void 0 : t.node.key) !== null && d !== void 0 ? d : null;
+    var l;
+    if (e.lastChildKey = (l = (n = this.lastVisibleChild) === null || n === void 0 ? void 0 : n.node.key) !== null && l !== void 0 ? l : null, (e.colSpan != null || e.colIndex != null) && s) {
+      var u, a;
+      let p = ((u = e.colIndex) !== null && u !== void 0 ? u : e.index) + ((a = e.colSpan) !== null && a !== void 0 ? a : 1);
+      if (p !== s.node.colIndex) {
+        let g = s.getMutableNode();
+        g.colIndex = p;
       }
     }
-    function H(e) {
-      if (_ = !1, w(e), !d)
-        if (i(s) !== null)
-          d = !0, b || (b = !0, v());
-        else {
-          var a = i(c);
-          a !== null && D(H, a.startTime - e);
-        }
-    }
-    var b = !1, y = -1, B = 5, M = -1;
-    function N() {
-      return q ? !0 : !(l.unstable_now() - M < B);
+  }
+  setProps(i, t, n, s) {
+    let e = this.getMutableNode(), { value: o, textValue: r, id: d, ...l } = i;
+    if (l.ref = t, e.props = l, e.rendered = n, e.render = s, e.value = o, e.textValue = r || (typeof l.children == "string" ? l.children : "") || i["aria-label"] || "", d != null && d !== e.key) {
+      if (this.hasSetProps) throw new Error("Cannot change the id of an item");
+      e.key = d;
     }
-    function R() {
-      if (q = !1, b) {
-        var e = l.unstable_now();
-        M = e;
-        var a = !0;
-        try {
-          e: {
-            d = !1, _ && (_ = !1, Q(y), y = -1), S = !0;
-            var n = t;
-            try {
-              n: {
-                for (w(e), f = i(s); f !== null && !(f.expirationTime > e && N()); ) {
-                  var u = f.callback;
-                  if (typeof u == "function") {
-                    f.callback = null, t = f.priorityLevel;
-                    var r = u(
-                      f.expirationTime <= e
-                    );
-                    if (e = l.unstable_now(), typeof r == "function") {
-                      f.callback = r, w(e), a = !0;
-                      break n;
-                    }
-                    f === i(s) && k(s), w(e);
-                  } else k(s);
-                  f = i(s);
-                }
-                if (f !== null) a = !0;
-                else {
-                  var P = i(c);
-                  P !== null && D(
-                    H,
-                    P.startTime - e
-                  ), a = !1;
-                }
-              }
-              break e;
-            } finally {
-              f = null, t = n, S = !1;
-            }
-            a = void 0;
-          }
-        } finally {
-          a ? v() : b = !1;
+    l.colSpan != null && (e.colSpan = l.colSpan), this.hasSetProps = !0, this.ownerDocument.queueUpdate();
+  }
+  get style() {
+    let i = this;
+    return {
+      get display() {
+        return i.isHidden ? "none" : "";
+      },
+      set display(t) {
+        let n = t === "none";
+        if (i.isHidden !== n) {
+          var s, e;
+          (((s = i.parentNode) === null || s === void 0 ? void 0 : s.firstVisibleChild) === i || ((e = i.parentNode) === null || e === void 0 ? void 0 : e.lastVisibleChild) === i) && i.ownerDocument.markDirty(i.parentNode);
+          let o = i.previousVisibleSibling, r = i.nextVisibleSibling;
+          o && i.ownerDocument.markDirty(o), r && i.ownerDocument.markDirty(r), i.isHidden = n, i.ownerDocument.markDirty(i);
         }
       }
+    };
+  }
+  hasAttribute() {
+  }
+  setAttribute() {
+  }
+  setAttributeNS() {
+  }
+  removeAttribute() {
+  }
+  constructor(i, t) {
+    super(t), this.nodeType = 8, this.isMutated = !0, this._index = 0, this.hasSetProps = !1, this.isHidden = !1, this.node = new S(i, `react-aria-${++t.nodeId}`);
+  }
+}
+class C extends b {
+  get isConnected() {
+    return this.isMounted;
+  }
+  createElement(i) {
+    return new h(i, this);
+  }
+  getMutableCollection() {
+    return this.nextCollection || (this.nextCollection = this.collection.clone()), this.nextCollection;
+  }
+  markDirty(i) {
+    this.dirtyNodes.add(i);
+  }
+  addNode(i) {
+    if (i.isHidden) return;
+    let t = this.getMutableCollection();
+    if (!t.getItem(i.node.key)) for (let n of i) this.addNode(n);
+    t.addNode(i.node);
+  }
+  removeNode(i) {
+    for (let n of i) this.removeNode(n);
+    this.getMutableCollection().removeNode(i.node.key);
+  }
+  /** Finalizes the collection update, updating all nodes and freezing the collection. */
+  getCollection() {
+    return this.inSubscription ? this.collection.clone() : (this.queuedRender = !1, this.updateCollection(), this.collection);
+  }
+  updateCollection() {
+    for (let e of this.dirtyNodes) e instanceof h && (!e.isConnected || e.isHidden) ? this.removeNode(e) : e.updateChildIndices();
+    for (let e of this.dirtyNodes) e instanceof h && (e.isConnected && !e.isHidden && (e.updateNode(), this.addNode(e)), e.isMutated = !1);
+    if (this.dirtyNodes.clear(), this.nextCollection) {
+      var i, t, n, s;
+      this.nextCollection.commit((n = (i = this.firstVisibleChild) === null || i === void 0 ? void 0 : i.node.key) !== null && n !== void 0 ? n : null, (s = (t = this.lastVisibleChild) === null || t === void 0 ? void 0 : t.node.key) !== null && s !== void 0 ? s : null, this.isSSR), this.isSSR || (this.collection = this.nextCollection, this.nextCollection = null);
     }
-    var v;
-    if (typeof Y == "function")
-      v = function() {
-        Y(R);
-      };
-    else if (typeof MessageChannel < "u") {
-      var z = new MessageChannel(), K = z.port2;
-      z.port1.onmessage = R, v = function() {
-        K.postMessage(null);
-      };
-    } else
-      v = function() {
-        F(R, 0);
-      };
-    function D(e, a) {
-      y = F(function() {
-        e(l.unstable_now());
-      }, a);
+  }
+  queueUpdate() {
+    if (!(this.dirtyNodes.size === 0 || this.queuedRender)) {
+      this.queuedRender = !0, this.inSubscription = !0;
+      for (let i of this.subscriptions) i();
+      this.inSubscription = !1;
     }
-    l.unstable_IdlePriority = 5, l.unstable_ImmediatePriority = 1, l.unstable_LowPriority = 4, l.unstable_NormalPriority = 3, l.unstable_Profiling = null, l.unstable_UserBlockingPriority = 2, l.unstable_cancelCallback = function(e) {
-      e.callback = null;
-    }, l.unstable_forceFrameRate = function(e) {
-      0 > e || 125 < e ? console.error(
-        "forceFrameRate takes a positive int between 0 and 125, forcing frame rates higher than 125 fps is not supported"
-      ) : B = 0 < e ? Math.floor(1e3 / e) : 5;
-    }, l.unstable_getCurrentPriorityLevel = function() {
-      return t;
-    }, l.unstable_next = function(e) {
-      switch (t) {
-        case 1:
-        case 2:
-        case 3:
-          var a = 3;
-          break;
-        default:
-          a = t;
-      }
-      var n = t;
-      t = a;
-      try {
-        return e();
-      } finally {
-        t = n;
-      }
-    }, l.unstable_requestPaint = function() {
-      q = !0;
-    }, l.unstable_runWithPriority = function(e, a) {
-      switch (e) {
-        case 1:
-        case 2:
-        case 3:
-        case 4:
-        case 5:
-          break;
-        default:
-          e = 3;
-      }
-      var n = t;
-      t = e;
-      try {
-        return a();
-      } finally {
-        t = n;
-      }
-    }, l.unstable_scheduleCallback = function(e, a, n) {
-      var u = l.unstable_now();
-      switch (typeof n == "object" && n !== null ? (n = n.delay, n = typeof n == "number" && 0 < n ? u + n : u) : n = u, e) {
-        case 1:
-          var r = -1;
-          break;
-        case 2:
-          r = 250;
-          break;
-        case 5:
-          r = 1073741823;
-          break;
-        case 4:
-          r = 1e4;
-          break;
-        default:
-          r = 5e3;
-      }
-      return r = n + r, e = {
-        id: J++,
-        callback: a,
-        priorityLevel: e,
-        startTime: n,
-        expirationTime: r,
-        sortIndex: -1
-      }, n > u ? (e.sortIndex = n, g(c, e), i(s) === null && e === i(c) && (_ ? (Q(y), y = -1) : _ = !0, D(H, n - u))) : (e.sortIndex = r, g(s, e), d || S || (d = !0, b || (b = !0, v()))), e;
-    }, l.unstable_shouldYield = N, l.unstable_wrapCallback = function(e) {
-      var a = t;
-      return function() {
-        var n = t;
-        t = a;
-        try {
-          return e.apply(this, arguments);
-        } finally {
-          t = n;
-        }
-      };
-    };
-  }(U), U);
+  }
+  subscribe(i) {
+    return this.subscriptions.add(i), () => this.subscriptions.delete(i);
+  }
+  resetAfterSSR() {
+    this.isSSR && (this.isSSR = !1, this.firstChild = null, this.lastChild = null, this.nodeId = 0);
+  }
+  constructor(i) {
+    super(null), this.nodeType = 11, this.ownerDocument = this, this.dirtyNodes = /* @__PURE__ */ new Set(), this.isSSR = !1, this.nodeId = 0, this.nodesByProps = /* @__PURE__ */ new WeakMap(), this.isMounted = !0, this.nextCollection = null, this.subscriptions = /* @__PURE__ */ new Set(), this.queuedRender = !1, this.inSubscription = !1, this.collection = i, this.nextCollection = i;
+  }
 }
 export {
-  V as __require
+  b as BaseNode,
+  C as Document,
+  h as ElementNode
 };