@boxcustodia/library 1.1.0 → 1.2.0

package/dist/index.es394.js

@@ -1,4 +1,153 @@
-var a = {};
-export {
-  a as __exports
-};
+import { __exports as _ } from "./index.es399.js";
+import "./index.es450.js";
+import "./index.es440.js";
+import "./index.es393.js";
+import { __exports as T } from "./index.es451.js";
+import { __exports as x } from "./index.es398.js";
+import { __exports as E } from "./index.es441.js";
+Object.defineProperty(_, "__esModule", {
+  value: !0
+});
+_.default = void 0;
+var w = T, C = M(E), I = M(x);
+function M(r) {
+  return r && r.__esModule ? r : { default: r };
+}
+function c(r, e) {
+  return D(r) || k(r, e) || S(r, e) || O();
+}
+function O() {
+  throw new TypeError(`Invalid attempt to destructure non-iterable instance.
+In order to be iterable, non-array objects must have a [Symbol.iterator]() method.`);
+}
+function k(r, e) {
+  var t = r == null ? null : typeof Symbol < "u" && r[Symbol.iterator] || r["@@iterator"];
+  if (t != null) {
+    var n = [], a = !0, u = !1, f, l;
+    try {
+      for (t = t.call(r); !(a = (f = t.next()).done) && (n.push(f.value), !(e && n.length === e)); a = !0)
+        ;
+    } catch (o) {
+      u = !0, l = o;
+    } finally {
+      try {
+        !a && t.return != null && t.return();
+      } finally {
+        if (u) throw l;
+      }
+    }
+    return n;
+  }
+}
+function D(r) {
+  if (Array.isArray(r)) return r;
+}
+function H(r, e) {
+  var t = typeof Symbol < "u" && r[Symbol.iterator] || r["@@iterator"];
+  if (!t) {
+    if (Array.isArray(r) || (t = S(r)) || e) {
+      t && (r = t);
+      var n = 0, a = function() {
+      };
+      return { s: a, n: function() {
+        return n >= r.length ? { done: !0 } : { done: !1, value: r[n++] };
+      }, e: function(s) {
+        throw s;
+      }, f: a };
+    }
+    throw new TypeError(`Invalid attempt to iterate non-iterable instance.
+In order to be iterable, non-array objects must have a [Symbol.iterator]() method.`);
+  }
+  var u = !0, f = !1, l;
+  return { s: function() {
+    t = t.call(r);
+  }, n: function() {
+    var s = t.next();
+    return u = s.done, s;
+  }, e: function(s) {
+    f = !0, l = s;
+  }, f: function() {
+    try {
+      !u && t.return != null && t.return();
+    } finally {
+      if (f) throw l;
+    }
+  } };
+}
+function S(r, e) {
+  if (r) {
+    if (typeof r == "string") return h(r, e);
+    var t = Object.prototype.toString.call(r).slice(8, -1);
+    if (t === "Object" && r.constructor && (t = r.constructor.name), t === "Map" || t === "Set") return Array.from(r);
+    if (t === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t)) return h(r, e);
+  }
+}
+function h(r, e) {
+  (e == null || e > r.length) && (e = r.length);
+  for (var t = 0, n = new Array(e); t < e; t++)
+    n[t] = r[t];
+  return n;
+}
+var i = [], b = I.default.keys();
+for (var v = 0; v < b.length; v++) {
+  var d = b[v], m = I.default.get(d);
+  if (m)
+    for (var g = [].concat(m.baseConcepts, m.relatedConcepts), p = 0; p < g.length; p++) {
+      var A = g[p];
+      A.module === "HTML" && function() {
+        var r = A.concept;
+        if (r) {
+          var e = i.find(function(u) {
+            return (0, w.dequal)(u, r);
+          }), t;
+          e ? t = e[1] : t = [];
+          for (var n = !0, a = 0; a < t.length; a++)
+            if (t[a] === d) {
+              n = !1;
+              break;
+            }
+          n && t.push(d), i.push([r, t]);
+        }
+      }();
+    }
+}
+var y = {
+  entries: function() {
+    return i;
+  },
+  forEach: function(e) {
+    var t = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : null, n = H(i), a;
+    try {
+      for (n.s(); !(a = n.n()).done; ) {
+        var u = c(a.value, 2), f = u[0], l = u[1];
+        e.call(t, l, f, i);
+      }
+    } catch (o) {
+      n.e(o);
+    } finally {
+      n.f();
+    }
+  },
+  get: function(e) {
+    var t = i.find(function(n) {
+      return e.name === n[0].name && (0, w.dequal)(e.attributes, n[0].attributes);
+    });
+    return t && t[1];
+  },
+  has: function(e) {
+    return !!y.get(e);
+  },
+  keys: function() {
+    return i.map(function(e) {
+      var t = c(e, 1), n = t[0];
+      return n;
+    });
+  },
+  values: function() {
+    return i.map(function(e) {
+      var t = c(e, 2), n = t[1];
+      return n;
+    });
+  }
+}, R = (0, C.default)(y, y.entries());
+_.default = R;

package/dist/index.es395.js

@@ -1,4 +1,142 @@
-var r = {};
-export {
-  r as __exports
-};
+import { __exports as _ } from "./index.es400.js";
+import "./index.es440.js";
+import "./index.es393.js";
+import { __exports as T } from "./index.es398.js";
+import { __exports as x } from "./index.es441.js";
+Object.defineProperty(_, "__esModule", {
+  value: !0
+});
+_.default = void 0;
+var k = M(x), I = M(T);
+function M(r) {
+  return r && r.__esModule ? r : { default: r };
+}
+function c(r, t) {
+  return H(r) || D(r, t) || S(r, t) || O();
+}
+function O() {
+  throw new TypeError(`Invalid attempt to destructure non-iterable instance.
+In order to be iterable, non-array objects must have a [Symbol.iterator]() method.`);
+}
+function D(r, t) {
+  var e = r == null ? null : typeof Symbol < "u" && r[Symbol.iterator] || r["@@iterator"];
+  if (e != null) {
+    var n = [], u = !0, o = !1, i, f;
+    try {
+      for (e = e.call(r); !(u = (i = e.next()).done) && (n.push(i.value), !(t && n.length === t)); u = !0)
+        ;
+    } catch (a) {
+      o = !0, f = a;
+    } finally {
+      try {
+        !u && e.return != null && e.return();
+      } finally {
+        if (o) throw f;
+      }
+    }
+    return n;
+  }
+}
+function H(r) {
+  if (Array.isArray(r)) return r;
+}
+function j(r, t) {
+  var e = typeof Symbol < "u" && r[Symbol.iterator] || r["@@iterator"];
+  if (!e) {
+    if (Array.isArray(r) || (e = S(r)) || t) {
+      e && (r = e);
+      var n = 0, u = function() {
+      };
+      return { s: u, n: function() {
+        return n >= r.length ? { done: !0 } : { done: !1, value: r[n++] };
+      }, e: function(s) {
+        throw s;
+      }, f: u };
+    }
+    throw new TypeError(`Invalid attempt to iterate non-iterable instance.
+In order to be iterable, non-array objects must have a [Symbol.iterator]() method.`);
+  }
+  var o = !0, i = !1, f;
+  return { s: function() {
+    e = e.call(r);
+  }, n: function() {
+    var s = e.next();
+    return o = s.done, s;
+  }, e: function(s) {
+    i = !0, f = s;
+  }, f: function() {
+    try {
+      !o && e.return != null && e.return();
+    } finally {
+      if (i) throw f;
+    }
+  } };
+}
+function S(r, t) {
+  if (r) {
+    if (typeof r == "string") return h(r, t);
+    var e = Object.prototype.toString.call(r).slice(8, -1);
+    if (e === "Object" && r.constructor && (e = r.constructor.name), e === "Map" || e === "Set") return Array.from(r);
+    if (e === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(e)) return h(r, t);
+  }
+}
+function h(r, t) {
+  (t == null || t > r.length) && (t = r.length);
+  for (var e = 0, n = new Array(t); e < t; e++)
+    n[e] = r[e];
+  return n;
+}
+var l = [], b = I.default.keys();
+for (var v = 0; v < b.length; v++) {
+  var g = b[v], y = I.default.get(g), d = [];
+  if (y) {
+    for (var A = [].concat(y.baseConcepts, y.relatedConcepts), m = 0; m < A.length; m++) {
+      var w = A[m];
+      if (w.module === "HTML") {
+        var E = w.concept;
+        E != null && d.push(E);
+      }
+    }
+    d.length > 0 && l.push([g, d]);
+  }
+}
+var p = {
+  entries: function() {
+    return l;
+  },
+  forEach: function(t) {
+    var e = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : null, n = j(l), u;
+    try {
+      for (n.s(); !(u = n.n()).done; ) {
+        var o = c(u.value, 2), i = o[0], f = o[1];
+        t.call(e, f, i, l);
+      }
+    } catch (a) {
+      n.e(a);
+    } finally {
+      n.f();
+    }
+  },
+  get: function(t) {
+    var e = l.find(function(n) {
+      return n[0] === t;
+    });
+    return e && e[1];
+  },
+  has: function(t) {
+    return !!p.get(t);
+  },
+  keys: function() {
+    return l.map(function(t) {
+      var e = c(t, 1), n = e[0];
+      return n;
+    });
+  },
+  values: function() {
+    return l.map(function(t) {
+      var e = c(t, 2), n = e[1];
+      return n;
+    });
+  }
+}, C = (0, k.default)(p, p.entries());
+_.default = C;

package/dist/index.es396.js

@@ -1,4 +1,4 @@
-var e = {};
+var a = {};
 export {
-  e as __exports
+  a as __exports
 };

package/dist/index.es397.js

@@ -1,4 +1,4 @@
-var e = {};
+var a = {};
 export {
-  e as __exports
+  a as __exports
 };

package/dist/index.es398.js

@@ -1,4 +1,4 @@
-var r = { exports: {} };
+var r = {};
 export {
-  r as __module
+  r as __exports
 };

package/dist/index.es399.js

@@ -1,122 +1,4 @@
-class o {
-  get childNodes() {
-    throw new Error("childNodes is not supported");
-  }
-  clone() {
-    let t = new o(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;
-  }
-  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.type = t, this.key = e;
-  }
-}
-class a {
-  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
-  filter(t) {
-    let e = new a(), l = null;
-    for (let n of this)
-      if (n.type === "section" && n.hasChildNodes) {
-        let i = n.clone(), r = null;
-        for (let y of this.getChildren(n.key)) if (t(y.textValue) || y.type === "header") {
-          let s = y.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 if (t(n.textValue)) {
-        let i = n.clone();
-        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;
-  }
-}
+var e = {};
 export {
-  a as BaseCollection,
-  o as CollectionNode
+  e as __exports
 };

package/dist/index.es40.js

@@ -1,14 +1,14 @@
-import { j as r } from "./index.es102.js";
+import { j as r } from "./index.es104.js";
 import { useControllableState as M } from "./index.es90.js";
-import { l as H } from "./index.es112.js";
+import { l as H } from "./index.es119.js";
 import { useMemo as T } from "react";
-import { isDateRange as f } from "./index.es113.js";
-import $ from "./index.es114.js";
+import { isDateRange as f } from "./index.es123.js";
+import $ from "./index.es124.js";
 import { Calendar as B } from "./index.es34.js";
-import { isDate as i } from "./index.es115.js";
+import { isDate as i } from "./index.es125.js";
 import { PopoverRoot as S, PopoverTrigger as A, PopoverContent as O } from "./index.es63.js";
 import { cn as q } from "./index.es91.js";
-import { formatDate as z } from "./index.es116.js";
+import { formatDate as z } from "./index.es126.js";
 import { Button as j } from "./index.es32.js";
 const ee = (m) => {
   const {

package/dist/index.es400.js

@@ -1,187 +1,4 @@
-import { CollectionNode as p } from "./index.es399.js";
-class h {
-  *[Symbol.iterator]() {
-    let t = this.firstChild;
-    for (; t; )
-      yield t, t = t.nextSibling;
-  }
-  get firstChild() {
-    return this._firstChild;
-  }
-  set firstChild(t) {
-    this._firstChild = t, this.ownerDocument.markDirty(this);
-  }
-  get lastChild() {
-    return this._lastChild;
-  }
-  set lastChild(t) {
-    this._lastChild = t, this.ownerDocument.markDirty(this);
-  }
-  get previousSibling() {
-    return this._previousSibling;
-  }
-  set previousSibling(t) {
-    this._previousSibling = t, this.ownerDocument.markDirty(this);
-  }
-  get nextSibling() {
-    return this._nextSibling;
-  }
-  set nextSibling(t) {
-    this._nextSibling = t, this.ownerDocument.markDirty(this);
-  }
-  get parentNode() {
-    return this._parentNode;
-  }
-  set parentNode(t) {
-    this._parentNode = t, this.ownerDocument.markDirty(this);
-  }
-  get isConnected() {
-    var t;
-    return ((t = this.parentNode) === null || t === void 0 ? void 0 : t.isConnected) || !1;
-  }
-  appendChild(t) {
-    this.ownerDocument.startTransaction(), t.parentNode && t.parentNode.removeChild(t), this.firstChild == null && (this.firstChild = t), this.lastChild ? (this.lastChild.nextSibling = t, t.index = this.lastChild.index + 1, t.previousSibling = this.lastChild) : (t.previousSibling = null, t.index = 0), t.parentNode = this, t.nextSibling = null, this.lastChild = t, this.ownerDocument.markDirty(this), t.hasSetProps && this.ownerDocument.addNode(t), this.ownerDocument.endTransaction(), this.ownerDocument.queueUpdate();
-  }
-  insertBefore(t, i) {
-    if (i == null) return this.appendChild(t);
-    this.ownerDocument.startTransaction(), t.parentNode && t.parentNode.removeChild(t), t.nextSibling = i, t.previousSibling = i.previousSibling, t.index = i.index, this.firstChild === i ? this.firstChild = t : i.previousSibling && (i.previousSibling.nextSibling = t), i.previousSibling = t, t.parentNode = i.parentNode;
-    let n = i;
-    for (; n; )
-      n.index++, n = n.nextSibling;
-    t.hasSetProps && this.ownerDocument.addNode(t), this.ownerDocument.endTransaction(), this.ownerDocument.queueUpdate();
-  }
-  removeChild(t) {
-    if (t.parentNode !== this || !this.ownerDocument.isMounted) return;
-    this.ownerDocument.startTransaction();
-    let i = t.nextSibling;
-    for (; i; )
-      i.index--, i = i.nextSibling;
-    t.nextSibling && (t.nextSibling.previousSibling = t.previousSibling), t.previousSibling && (t.previousSibling.nextSibling = t.nextSibling), this.firstChild === t && (this.firstChild = t.nextSibling), this.lastChild === t && (this.lastChild = t.previousSibling), t.parentNode = null, t.nextSibling = null, t.previousSibling = null, t.index = 0, this.ownerDocument.removeNode(t), this.ownerDocument.endTransaction(), this.ownerDocument.queueUpdate();
-  }
-  addEventListener() {
-  }
-  removeEventListener() {
-  }
-  constructor(t) {
-    this._firstChild = null, this._lastChild = null, this._previousSibling = null, this._nextSibling = null, this._parentNode = null, this.ownerDocument = t;
-  }
-}
-class a extends h {
-  get index() {
-    return this._index;
-  }
-  set index(t) {
-    this._index = t, this.ownerDocument.markDirty(this);
-  }
-  get level() {
-    return this.parentNode instanceof a ? this.parentNode.level + (this.node.type === "item" ? 1 : 0) : 0;
-  }
-  updateNode() {
-    var t, i, n, s;
-    let e = this.ownerDocument.getMutableNode(this);
-    e.index = this.index, e.level = this.level, e.parentKey = this.parentNode instanceof a ? this.parentNode.node.key : null;
-    var o;
-    e.prevKey = (o = (t = this.previousSibling) === null || t === void 0 ? void 0 : t.node.key) !== null && o !== void 0 ? o : null;
-    var d;
-    e.nextKey = (d = (i = this.nextSibling) === null || i === void 0 ? void 0 : i.node.key) !== null && d !== void 0 ? d : null, e.hasChildNodes = !!this.firstChild;
-    var r;
-    e.firstChildKey = (r = (n = this.firstChild) === null || n === void 0 ? void 0 : n.node.key) !== null && r !== void 0 ? r : null;
-    var l;
-    e.lastChildKey = (l = (s = this.lastChild) === null || s === void 0 ? void 0 : s.node.key) !== null && l !== void 0 ? l : null;
-  }
-  setProps(t, i, n, s) {
-    let e = this.ownerDocument.getMutableNode(this), { value: o, textValue: d, id: r, ...l } = t;
-    if (l.ref = i, e.props = l, e.rendered = n, e.render = s, e.value = o, e.textValue = d || (typeof l.children == "string" ? l.children : "") || t["aria-label"] || "", r != null && r !== e.key) {
-      if (this.hasSetProps) throw new Error("Cannot change the id of an item");
-      e.key = r;
-    }
-    this.hasSetProps || (this.ownerDocument.addNode(this), this.ownerDocument.endTransaction(), this.hasSetProps = !0), this.ownerDocument.queueUpdate();
-  }
-  get style() {
-    return {};
-  }
-  hasAttribute() {
-  }
-  setAttribute() {
-  }
-  setAttributeNS() {
-  }
-  removeAttribute() {
-  }
-  constructor(t, i) {
-    super(i), this.nodeType = 8, this._index = 0, this.hasSetProps = !1, this.node = new p(t, `react-aria-${++i.nodeId}`), this.ownerDocument.startTransaction();
-  }
-}
-class v extends h {
-  get isConnected() {
-    return this.isMounted;
-  }
-  createElement(t) {
-    return new a(t, this);
-  }
-  /**
-  * 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(t) {
-    let i = t.node;
-    return this.mutatedNodes.has(t) || (i = t.node.clone(), this.mutatedNodes.add(t), t.node = i), this.markDirty(t), i;
-  }
-  getMutableCollection() {
-    return !this.isSSR && !this.collectionMutated && (this.collection = this.collection.clone(), this.collectionMutated = !0), this.collection;
-  }
-  markDirty(t) {
-    this.dirtyNodes.add(t);
-  }
-  startTransaction() {
-    this.transactionCount++;
-  }
-  endTransaction() {
-    this.transactionCount--;
-  }
-  addNode(t) {
-    let i = this.getMutableCollection();
-    if (!i.getItem(t.node.key)) {
-      i.addNode(t.node);
-      for (let n of t) this.addNode(n);
-    }
-    this.markDirty(t);
-  }
-  removeNode(t) {
-    for (let n of t) this.removeNode(n);
-    this.getMutableCollection().removeNode(t.node.key), this.markDirty(t);
-  }
-  /** Finalizes the collection update, updating all nodes and freezing the collection. */
-  getCollection() {
-    return this.transactionCount > 0 ? this.collection : (this.updateCollection(), this.collection);
-  }
-  updateCollection() {
-    for (let e of this.dirtyNodes) e instanceof a && e.isConnected && e.updateNode();
-    if (this.dirtyNodes.clear(), this.mutatedNodes.size || this.collectionMutated) {
-      var t, i;
-      let e = this.getMutableCollection();
-      for (let o of this.mutatedNodes) o.isConnected && e.addNode(o.node);
-      var n, s;
-      e.commit((n = (t = this.firstChild) === null || t === void 0 ? void 0 : t.node.key) !== null && n !== void 0 ? n : null, (s = (i = this.lastChild) === null || i === void 0 ? void 0 : i.node.key) !== null && s !== void 0 ? s : null, this.isSSR), this.mutatedNodes.clear();
-    }
-    this.collectionMutated = !1;
-  }
-  queueUpdate() {
-    if (!(this.dirtyNodes.size === 0 || this.transactionCount > 0))
-      for (let t of this.subscriptions) t();
-  }
-  subscribe(t) {
-    return this.subscriptions.add(t), () => this.subscriptions.delete(t);
-  }
-  resetAfterSSR() {
-    this.isSSR && (this.isSSR = !1, this.firstChild = null, this.lastChild = null, this.nodeId = 0);
-  }
-  constructor(t) {
-    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.mutatedNodes = /* @__PURE__ */ new Set(), this.subscriptions = /* @__PURE__ */ new Set(), this.transactionCount = 0, this.collection = t, this.collectionMutated = !0;
-  }
-}
+var e = {};
 export {
-  h as BaseNode,
-  v as Document,
-  a as ElementNode
+  e as __exports
 };