bruh 1.13.0 → 1.13.1

package/dist/bruh.es.js

@@ -0,0 +1,226 @@
+var q = Object.defineProperty;
+var D = (t, e, r) => e in t ? q(t, e, { enumerable: !0, configurable: !0, writable: !0, value: r }) : t[e] = r;
+var w = (t, e, r) => (D(t, typeof e != "symbol" ? e + "" : e, r), r), C = (t, e, r) => {
+  if (!e.has(t))
+    throw TypeError("Cannot " + r);
+};
+var n = (t, e, r) => (C(t, e, "read from private field"), r ? r.call(t) : e.get(t)), c = (t, e, r) => {
+  if (e.has(t))
+    throw TypeError("Cannot add the same private member more than once");
+  e instanceof WeakSet ? e.add(t) : e.set(t, r);
+}, f = (t, e, r, o) => (C(t, e, "write to private field"), o ? o.call(t, r) : e.set(t, r), r);
+var M = (t, e, r) => (C(t, e, "access private method"), r);
+const d = Symbol.for("bruh reactive");
+var _, h, b;
+class L {
+  constructor(e) {
+    w(this, _, !0);
+    c(this, h, void 0);
+    c(this, b, /* @__PURE__ */ new Set());
+    f(this, h, e);
+  }
+  get value() {
+    return n(this, h);
+  }
+  set value(e) {
+    if (e !== n(this, h)) {
+      f(this, h, e);
+      for (const r of n(this, b))
+        r();
+    }
+  }
+  addReaction(e) {
+    return n(this, b).add(e), () => n(this, b).delete(e);
+  }
+}
+_ = d, h = new WeakMap(), b = new WeakMap();
+var F, p, v, A, y, T, u, g, N, E, P;
+const a = class {
+  constructor(e, r) {
+    c(this, E);
+    w(this, F, !0);
+    c(this, p, void 0);
+    c(this, v, /* @__PURE__ */ new Set());
+    c(this, A, void 0);
+    c(this, y, 0);
+    c(this, T, /* @__PURE__ */ new Set());
+    if (!r) {
+      f(this, p, e);
+      return;
+    }
+    f(this, p, r()), f(this, A, r), f(this, y, Math.max(...e.map((o) => n(o, y))) + 1), e.forEach((o) => n(o, T).add(this));
+  }
+  get value() {
+    if (n(a, u).size) {
+      if (n(this, y) !== 0)
+        a.applyUpdates();
+      else if (n(a, u).has(this))
+        return n(a, u).get(this);
+    }
+    return n(this, p);
+  }
+  set value(e) {
+    n(this, y) === 0 && (n(a, u).size || queueMicrotask(a.applyUpdates), n(a, u).set(this, e));
+  }
+  addReaction(e) {
+    return n(this, v).add(e), () => n(this, v).delete(e);
+  }
+  static applyUpdates() {
+    var e, r, o;
+    if (!!n(a, u).size) {
+      for (const [s, i] of n(a, u).entries())
+        M(e = s, E, P).call(e, i);
+      n(a, u).clear();
+      for (const s of n(a, g))
+        if (s)
+          for (const i of s)
+            M(o = i, E, P).call(o, n(r = i, A).call(r));
+      n(a, g).length = 0;
+      for (const s of n(a, N))
+        s();
+      n(a, N).length = 0;
+    }
+  }
+};
+let m = a;
+F = d, p = new WeakMap(), v = new WeakMap(), A = new WeakMap(), y = new WeakMap(), T = new WeakMap(), u = new WeakMap(), g = new WeakMap(), N = new WeakMap(), E = new WeakSet(), P = function(e) {
+  if (e === n(this, p))
+    return;
+  f(this, p, e), n(a, N).push(...n(this, v));
+  const r = n(a, g);
+  for (const o of n(this, T)) {
+    const s = n(o, y);
+    r[s] || (r[s] = /* @__PURE__ */ new Set()), r[s].add(o);
+  }
+}, c(m, u, /* @__PURE__ */ new Map()), c(m, g, []), c(m, N, []);
+const I = (t, e) => new m(t, e), j = (t, e) => {
+  if (t != null && t[d])
+    return e(t.value), t.addReaction(() => e(t.value));
+  e(t);
+}, ee = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+  __proto__: null,
+  isReactive: d,
+  SimpleReactive: L,
+  FunctionalReactive: m,
+  r: I,
+  reactiveDo: j
+}, Symbol.toStringTag, { value: "Module" })), J = (t) => (t == null ? void 0 : t[d]) || t instanceof Node || Array.isArray(t) || t == null || !(typeof t == "function" || typeof t == "object"), R = (t) => t instanceof Node ? t : typeof t == "boolean" || t === void 0 || t === null ? document.createComment(t) : document.createTextNode(t), O = (t) => {
+  let e = R(t.value);
+  const r = t.addReaction(() => {
+    if (!e.parentNode) {
+      r();
+      return;
+    }
+    if (Array.isArray(t.value))
+      r(), e.replaceWith(...W(t));
+    else {
+      const o = e;
+      e = R(t.value), o.replaceWith(e);
+    }
+  });
+  return e;
+}, W = (t) => {
+  const e = document.createComment("["), r = document.createComment("]"), o = t.addReaction(() => {
+    if (!e.parentNode) {
+      o();
+      return;
+    }
+    const s = document.createRange();
+    s.setStartAfter(e), Array.isArray(t.value) ? (s.setEndBefore(r), s.deleteContents(), e.after(...S(t.value))) : (o(), s.setEndAfter(r), s.deleteContents(), e.replaceWith(O(t)));
+  });
+  return [
+    e,
+    ...S(t.value),
+    r
+  ];
+}, S = (t) => t.flat(1 / 0).flatMap((e) => e != null && e[d] ? Array.isArray(e.value) ? W(e) : [O(e)] : [R(e)]), U = (t, e) => {
+  for (const r in e)
+    j(e[r], (o) => {
+      o !== void 0 ? t.style.setProperty(r, o) : t.style.removeProperty(r);
+    });
+}, B = (t, e) => {
+  for (const r in e)
+    j(e[r], (o) => {
+      t.classList.toggle(r, o);
+    });
+}, Q = (t, e) => {
+  for (const r in e)
+    j(e[r], (o) => {
+      o !== void 0 ? t.setAttribute(r, o) : t.removeAttribute(r);
+    });
+}, X = (t) => {
+  if (!t[d])
+    return document.createTextNode(t);
+  const e = document.createTextNode(t.value);
+  return t.addReaction(() => {
+    e.textContent = t.value;
+  }), e;
+}, k = (t) => (...e) => {
+  var z;
+  if (e.length === 0)
+    return document.createElement(t);
+  if (J(e[0])) {
+    const l = document.createElement(t);
+    return l.append(...S(e)), l;
+  }
+  const [r, ...o] = e, { namespace: s } = (z = r.bruh) != null ? z : {};
+  delete r.bruh;
+  const i = s ? document.createElementNS(s, t) : document.createElement(t);
+  typeof r.style == "object" && !r.style[d] && (U(i, r.style), delete r.style), typeof r.class == "object" && !r.class[d] && (B(i, r.class), delete r.class);
+  for (const l in r)
+    l.startsWith("on") && typeof r[l] == "function" && (i.addEventListener(l.slice(2), r[l]), delete r[l]);
+  return Q(i, r), i.append(...S(o)), i;
+}, $ = (t, e, ...r) => {
+  if (typeof t == "string") {
+    const o = k(t);
+    return e ? o(e, ...r) : o(...r);
+  }
+  return t({ ...e, children: r });
+}, G = ({ children: t }) => t, H = () => {
+  const t = {}, e = document.getElementsByTagName("bruh-textnode");
+  for (const r of e) {
+    const o = document.createTextNode(r.textContent), s = r.getAttribute("tag");
+    s && (t[s] = o), r.replaceWith(o);
+  }
+  return t;
+}, te = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+  __proto__: null,
+  bruhChildrenToNodes: S,
+  applyStyles: U,
+  applyClasses: B,
+  applyAttributes: Q,
+  t: X,
+  e: k,
+  h: $,
+  JSXFragment: G,
+  hydrateTextNodes: H
+}, Symbol.toStringTag, { value: "Module" })), K = (t, ...e) => e.reduce((r, o) => o(r), t), Y = (t, e, r) => t.dispatchEvent(
+  new CustomEvent(e, {
+    bubbles: !0,
+    cancelable: !0,
+    composed: !0,
+    ...r
+  })
+), Z = (t, e) => {
+  const r = {
+    ...t,
+    [Symbol.iterator]: () => e[Symbol.iterator]()
+  };
+  return Object.defineProperty(r, Symbol.iterator, {
+    enumerable: !1
+  }), r;
+}, V = (t) => new Proxy({}, {
+  get: (e, r) => t(r)
+}), re = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+  __proto__: null,
+  pipe: K,
+  dispatch: Y,
+  createDestructable: Z,
+  functionAsObject: V
+}, Symbol.toStringTag, { value: "Module" }));
+export {
+  te as dom,
+  ee as reactive,
+  re as util
+};
+//# sourceMappingURL=bruh.es.js.map

package/dist/bruh.es.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bruh.es.js","sources":["../src/reactive/index.mjs","../src/dom/index.browser.mjs","../src/util/index.mjs"],"sourcesContent":["export const isReactive = Symbol.for(\"bruh reactive\")\n\n// A super simple and performant reactive value implementation\nexport class SimpleReactive {\n  [isReactive] = true\n\n  #value\n  #reactions = new Set()\n\n  constructor(value) {\n    this.#value = value\n  }\n\n  get value() {\n    return this.#value\n  }\n\n  set value(newValue) {\n    if (newValue === this.#value)\n      return\n\n    this.#value = newValue\n    for (const reaction of this.#reactions)\n      reaction()\n  }\n\n  addReaction(reaction) {\n    this.#reactions.add(reaction)\n\n    return () =>\n      this.#reactions.delete(reaction)\n  }\n}\n\n// A reactive implementation for building functional reactive graphs\n// Ensures state consistency, minimal node updates, and transparent update batching\nexport class FunctionalReactive {\n  [isReactive] = true\n\n  #value\n  #reactions = new Set()\n\n  // For derived nodes, f is the derivation function\n  #f\n  // Source nodes are 0 deep in the derivation graph\n  // This is for topological sort\n  #depth = 0\n  // All nodes have a set of derivatives that update when the node changes\n  #derivatives = new Set()\n\n  // Keep track of all the pending changes from the value setter\n  static #settersQueue = new Map()\n  // A queue of derivatives to potentially update, sorted into sets by depth\n  // This starts with depth 1 and can potentially have holes\n  static #derivativesQueue = []\n  // A queue of reactions to run after the graph is fully updated\n  static #reactionsQueue = []\n\n  constructor(x, f) {\n    if (!f) {\n      this.#value = x\n      return\n    }\n\n    this.#value = f()\n    this.#f = f\n    this.#depth = Math.max(...x.map(d => d.#depth)) + 1\n\n    x.forEach(d => d.#derivatives.add(this))\n  }\n\n  get value() {\n    // If there are any pending updates\n    if (FunctionalReactive.#settersQueue.size) {\n      // Heuristic quick invalidation for derived nodes\n      // Apply updates now, it's ok that there's already a microtask queued for this\n      if (this.#depth !== 0)\n        FunctionalReactive.applyUpdates()\n      // If this is a source node that was updated, just return that\n      // new value without actually updating any derived nodes yet\n      else if (FunctionalReactive.#settersQueue.has(this))\n        return FunctionalReactive.#settersQueue.get(this)\n    }\n\n    return this.#value\n  }\n\n  set value(newValue) {\n    // Only allow source nodes to be directly updated\n    if (this.#depth !== 0)\n      return\n\n    // Unless asked for earlier, these updates are just queued up until the microtasks run\n    if (!FunctionalReactive.#settersQueue.size)\n      queueMicrotask(FunctionalReactive.applyUpdates)\n\n    FunctionalReactive.#settersQueue.set(this, newValue)\n  }\n\n  addReaction(reaction) {\n    this.#reactions.add(reaction)\n\n    return () =>\n      this.#reactions.delete(reaction)\n  }\n\n  // Apply an update for a node and queue its derivatives if it actually changed\n  #applyUpdate(newValue) {\n    if (newValue === this.#value)\n      return\n\n    this.#value = newValue\n    FunctionalReactive.#reactionsQueue.push(...this.#reactions)\n\n    const queue = FunctionalReactive.#derivativesQueue\n    for (const derivative of this.#derivatives) {\n      const depth = derivative.#depth\n      if (!queue[depth])\n        queue[depth] = new Set()\n\n      queue[depth].add(derivative)\n    }\n  }\n\n  // Apply pending updates from actually changed source nodes\n  static applyUpdates() {\n    if (!FunctionalReactive.#settersQueue.size)\n      return\n\n    // Bootstrap by applying the updates from the pending setters\n    for (const [sourceNode, newValue] of FunctionalReactive.#settersQueue.entries())\n      sourceNode.#applyUpdate(newValue)\n    FunctionalReactive.#settersQueue.clear()\n\n    // Iterate down the depths, ignoring holes\n    // Note that both the queue (Array) and each depth Set iterators update as items are added\n    for (const depthSet of FunctionalReactive.#derivativesQueue) if (depthSet)\n      for (const derivative of depthSet)\n        derivative.#applyUpdate(derivative.#f())\n    FunctionalReactive.#derivativesQueue.length = 0\n\n    // Call all reactions now that the graph has a fully consistent state\n    for (const reaction of FunctionalReactive.#reactionsQueue)\n      reaction()\n    FunctionalReactive.#reactionsQueue.length = 0\n  }\n}\n\n// A little convenience function\nexport const r = (x, f) => new FunctionalReactive(x, f)\n\n// Do something with a value, updating if it is reactive\nexport const reactiveDo = (x, f) => {\n  if (x?.[isReactive]) {\n    f(x.value)\n    return x.addReaction(() => f(x.value))\n  }\n\n  f(x)\n}\n","import { isReactive, reactiveDo } from \"../reactive/index.mjs\"\n\n//#region Bruh child functions e.g. bruhChildrenToNodes()\n\n// A basic check for if a value is allowed as a child in bruh\n// It's responsible for quickly checking the type, not deep validation\nconst isBruhChild = x =>\n  // Reactives and DOM nodes\n  x?.[isReactive] ||\n  x instanceof Node ||\n  // Any array, just assume it contains valid children\n  Array.isArray(x) ||\n  // Allow nullish\n  x == null ||\n  // Disallow functions and objects\n  !(typeof x === \"function\" || typeof x === \"object\")\n  // Everything else can be a child when stringified\n\n// Coerces input into a DOM node, if it isn't already one\nconst unreactiveChildToNode = x => {\n  // Existing DOM nodes are untouched\n  if (x instanceof Node)\n    return x\n  // booleans and nullish are ignored\n  else if (typeof x === \"boolean\" || x === undefined || x === null)\n    return document.createComment(x)\n  // Anything else is treated as text\n  else\n    return document.createTextNode(x)\n}\n\n// Auto-swapping single reactive node\nconst reactiveChildToNode = child => {\n  let node = unreactiveChildToNode(child.value)\n\n  const stopReacting = child.addReaction(() => {\n    // Stop swapping if no longer possible\n    if (!node.parentNode) {\n      stopReacting()\n      return\n    }\n\n    // Normal swap\n    if (!Array.isArray(child.value)) {\n      const oldNode = node\n      node = unreactiveChildToNode(child.value)\n      oldNode.replaceWith(node)\n    }\n    // If an array now, stop swapping, then switch to reactive array swapping\n    else {\n      stopReacting()\n      node.replaceWith(...reactiveArrayChildToNodes(child))\n    }\n  })\n\n  return node\n}\n\n// Auto-swapping reactive array of nodes\nconst reactiveArrayChildToNodes = child => {\n  // Markers owned by the swapper here itself, so that\n  // the values in the array can be swapped separately\n  const first = document.createComment(\"[\")\n  const last  = document.createComment(\"]\")\n\n  const stopReacting = child.addReaction(() => {\n    // Stop swapping if there is no parent to swap within\n    if (!first.parentNode) {\n      stopReacting()\n      return\n    }\n\n    // Make a range starting after the first marker\n    const range = document.createRange()\n    range.setStartAfter(first)\n\n    // Normal swap, replacing content between the first and last markers\n    if (Array.isArray(child.value)) {\n      range.setEndBefore(last)\n      range.deleteContents()\n      first.after(...bruhChildrenToNodes(child.value))\n    }\n    // Switch to single swapping node by replacing everything\n    else {\n      stopReacting()\n      range.setEndAfter(last)\n      range.deleteContents()\n      first.replaceWith(reactiveChildToNode(child))\n    }\n  })\n\n  return [\n    first,\n    ...bruhChildrenToNodes(child.value),\n    last\n  ]\n}\n\n// Processes bruh children into an array of DOM nodes\n// Reactive values are automatically replaced, so the output must be placed into a parent node\n// before any top level (after flattening arrays) reactions run\nexport const bruhChildrenToNodes = children =>\n  children\n    .flat(Infinity)\n    .flatMap(child => {\n      // Non-reactive child\n      if (!child?.[isReactive])\n        return [unreactiveChildToNode(child)]\n\n      // Single reactive value\n      if (!Array.isArray(child.value))\n        return [reactiveChildToNode(child)]\n\n      // Reactive array\n      return reactiveArrayChildToNodes(child)\n    })\n\n//#endregion\n\n//#region Reactive-aware element helper functions e.g. applyAttributes()\n\n// Style attribute rules from an object with\n// potentially reactive and/or undefined values\nexport const applyStyles = (element, styles) => {\n  for (const property in styles)\n    reactiveDo(styles[property], value => {\n      if (value !== undefined)\n        element.style.setProperty   (property, value)\n      else\n        element.style.removeProperty(property)\n    })\n}\n\n// Class list from an object mapping from\n// class names to potentially reactive booleans\nexport const applyClasses = (element, classes) => {\n  for (const name in classes)\n    reactiveDo(classes[name], value => {\n      element.classList.toggle(name, value)\n    })\n}\n\n// Attributes from an object with\n// potentially reactive and/or undefined values\nexport const applyAttributes = (element, attributes) => {\n  for (const name in attributes)\n    reactiveDo(attributes[name], value => {\n      if (value !== undefined)\n        element.setAttribute   (name, value)\n      else\n        element.removeAttribute(name)\n    })\n}\n\n//#endregion\n\n//#region t() for text nodes and e() for element nodes\n\n// Text nodes\nexport const t = textContent => {\n  // Non-reactive values are just text nodes\n  if (!textContent[isReactive])\n    return document.createTextNode(textContent)\n\n  // Reactive values auto-update the node's text content\n  const node = document.createTextNode(textContent.value)\n  textContent.addReaction(() => {\n    node.textContent = textContent.value\n  })\n  return node\n}\n\n// Elements\nexport const e = name => (...variadic) => {\n  if (variadic.length === 0)\n    return document.createElement(name)\n\n  // If there are no props\n  if (isBruhChild(variadic[0])) {\n    const element = document.createElement(name)\n    element.append(...bruhChildrenToNodes(variadic))\n    return element\n  }\n\n  // If props exist as the first variadic argument\n  const [props, ...children] = variadic\n\n  // Extract explicit options from the bruh prop\n  const { namespace } = props.bruh ?? {}\n  delete props.bruh\n\n  // Make an element with optional namespace\n  const element =\n    namespace\n      ? document.createElementNS(namespace, name)\n      : document.createElement  (           name)\n\n  // Apply overloaded props, if possible\n\n  // Inline style object\n  if (typeof props.style === \"object\" && !props.style[isReactive]) {\n    applyStyles(element, props.style)\n    delete props.style\n  }\n  // Classes object\n  if (typeof props.class === \"object\" && !props.class[isReactive]) {\n    applyClasses(element, props.class)\n    delete props.class\n  }\n  for (const name in props) {\n    // Event listener functions\n    if (name.startsWith(\"on\") && typeof props[name] === \"function\") {\n      element.addEventListener(name.slice(2), props[name])\n      delete props[name]\n    }\n  }\n\n  // The rest of the props are attributes\n  applyAttributes(element, props)\n\n  // Add the children to the element\n  element.append(...bruhChildrenToNodes(children))\n  return element\n}\n\n//#endregion\n\n//#region JSX integration\n\n// The function that jsx tags (except fragments) compile to\nexport const h = (nameOrComponent, props, ...children) => {\n  // If we are making an element, this is just a wrapper of e()\n  // This is likely when the JSX tag name begins with a lowercase character\n  if (typeof nameOrComponent === \"string\") {\n    const makeElement = e(nameOrComponent)\n    return props\n      ? makeElement(props, ...children)\n      : makeElement(...children)\n  }\n\n  // It must be a component, then, as bruh components are just functions\n  // Due to JSX, this would mean a function with only one parameter - props\n  // This object includes the all of the normal props and a \"children\" key\n  return nameOrComponent({ ...props, children })\n}\n\n// The JSX fragment is made into a bruh fragment (just an array)\nexport const JSXFragment = ({ children }) => children\n\n//#endregion\n\n\n\n// Hydration of all bruh-textnode's from prerendered html\nexport const hydrateTextNodes = () => {\n  const tagged = {}\n  const bruhTextNodes = document.getElementsByTagName(\"bruh-textnode\")\n\n  for (const bruhTextNode of bruhTextNodes) {\n    const textNode = document.createTextNode(bruhTextNode.textContent)\n\n    const tag = bruhTextNode.getAttribute(\"tag\")\n    if (tag)\n      tagged[tag] = textNode\n\n    bruhTextNode.replaceWith(textNode)\n  }\n\n  return tagged\n}\n","// Create a pipeline with an initial value and a series of functions\nexport const pipe = (x, ...fs) =>\n  fs.reduce((y, f) => f(y), x)\n\n// Dispatch a custom event to (capturing) and from (bubbling) a target (usually a DOM node)\n// Returns false if the event was cancelled (preventDefault()) and true otherwise\n// Note that this is synchronous\nexport const dispatch = (target, type, options) =>\n  target.dispatchEvent(\n    // Default to behave like most DOM events\n    new CustomEvent(type, {\n      bubbles: true,\n      cancelable: true,\n      composed: true,\n      ...options\n    })\n  )\n\n// Inspired by https://antfu.me/posts/destructuring-with-object-or-array#take-away\n// Creates an object that is both destructable with {...} and [...]\n// Useful for writing library functions à la react-use & vueuse\nexport const createDestructable = (object, iterable) => {\n  const destructable = {\n    ...object,\n    [Symbol.iterator]: () => iterable[Symbol.iterator]()\n  }\n\n  Object.defineProperty(destructable, Symbol.iterator, {\n    enumerable: false\n  })\n\n  return destructable\n}\n\n// Creates an object (as a Proxy) that acts as a function\n// So functionAsObject(f).property is equivalent to f(\"property\")\n// This is can be useful when combined with destructuring syntax, e.g.:\n// const { html, head, title, body, main, h1, p } = functionAsObject(e)\nexport const functionAsObject = f =>\n  new Proxy({}, {\n    get: (_, property) => f(property)\n  })\n"],"names":["isReactive","_a","_value","_reactions","SimpleReactive","value","__publicField","__privateAdd","__privateSet","__privateGet","newValue","reaction","_f","_depth","_derivatives","_settersQueue","_derivativesQueue","_reactionsQueue","_applyUpdate","applyUpdate_fn","_FunctionalReactive","x","f","d","_b","_c","sourceNode","__privateMethod","depthSet","derivative","FunctionalReactive","queue","depth","r","reactiveDo","isBruhChild","unreactiveChildToNode","reactiveChildToNode","child","node","stopReacting","reactiveArrayChildToNodes","oldNode","first","last","range","bruhChildrenToNodes","children","applyStyles","element","styles","property","applyClasses","classes","name","applyAttributes","attributes","t","textContent","e","variadic","props","namespace","h","nameOrComponent","makeElement","JSXFragment","hydrateTextNodes","tagged","bruhTextNodes","bruhTextNode","textNode","tag","pipe","fs","y","dispatch","target","type","options","createDestructable","object","iterable","destructable","functionAsObject","_"],"mappings":";;;;;;;;;;;;AAAO,MAAMA,IAAa,OAAO,IAAI,eAAe;AAA7C,IAAAC,GAAAC,GAAAC;AAGA,MAAMC,EAAe;AAAA,EAM1B,YAAYC,GAAO;AALnB,IAAAC,EAAA,MAACL,GAAc;AAEf,IAAAM,EAAA,MAAAL,GAAA;AACA,IAAAK,EAAA,MAAAJ,GAAa,oBAAI,IAAK;AAGpB,IAAAK,EAAA,MAAKN,GAASG;AAAA,EACf;AAAA,EAED,IAAI,QAAQ;AACV,WAAOI,EAAA,MAAKP;AAAA,EACb;AAAA,EAED,IAAI,MAAMQ,GAAU;AAClB,QAAIA,MAAaD,EAAA,MAAKP,IAGtB;AAAA,MAAAM,EAAA,MAAKN,GAASQ;AACd,iBAAWC,KAAYF,EAAA,MAAKN;AAC1B,QAAAQ,EAAU;AAAA;AAAA,EACb;AAAA,EAED,YAAYA,GAAU;AACpB,WAAAF,EAAA,MAAKN,GAAW,IAAIQ,CAAQ,GAErB,MACLF,EAAA,MAAKN,GAAW,OAAOQ,CAAQ;AAAA,EAClC;AACH;AA5BGV,IAAAD,GAEDE,IAAA,eACAC,IAAA;AAPK,IAAAF,GAAAC,GAAAC,GAAAS,GAAAC,GAAAC,GAAAC,GAAAC,GAAAC,GAAAC,GAAAC;AAoCA,MAAMC,IAAN,MAAyB;AAAA,EAsB9B,YAAYC,GAAGC,GAAG;AAiDlB,IAAAf,EAAA,MAAAW;AAtEA,IAAAZ,EAAA,MAACL,GAAc;AAEf,IAAAM,EAAA,MAAAL,GAAA;AACA,IAAAK,EAAA,MAAAJ,GAAa,oBAAI,IAAK;AAGtB,IAAAI,EAAA,MAAAK,GAAA;AAGA,IAAAL,EAAA,MAAAM,GAAS;AAET,IAAAN,EAAA,MAAAO,GAAe,oBAAI,IAAK;AAWtB,QAAI,CAACQ,GAAG;AACN,MAAAd,EAAA,MAAKN,GAASmB;AACd;AAAA,IACD;AAED,IAAAb,EAAA,MAAKN,GAASoB,EAAG,IACjBd,EAAA,MAAKI,GAAKU,IACVd,EAAA,MAAKK,GAAS,KAAK,IAAI,GAAGQ,EAAE,IAAI,CAAAE,MAAKd,EAAAc,GAAEV,EAAM,CAAC,IAAI,IAElDQ,EAAE,QAAQ,CAAAE,MAAKd,EAAAc,GAAET,GAAa,IAAI,IAAI,CAAC;AAAA,EACxC;AAAA,EAED,IAAI,QAAQ;AAEV,QAAIL,EAAAW,GAAmBL,GAAc;AAGnC,UAAIN,EAAA,MAAKI,OAAW;AAClB,QAAAO,EAAmB,aAAc;AAAA,eAG1BX,EAAAW,GAAmBL,GAAc,IAAI,IAAI;AAChD,eAAON,EAAAW,GAAmBL,GAAc,IAAI,IAAI;AAAA;AAGpD,WAAON,EAAA,MAAKP;AAAA,EACb;AAAA,EAED,IAAI,MAAMQ,GAAU;AAElB,IAAID,EAAA,MAAKI,OAAW,MAIfJ,EAAAW,GAAmBL,GAAc,QACpC,eAAeK,EAAmB,YAAY,GAEhDX,EAAAW,GAAmBL,GAAc,IAAI,MAAML,CAAQ;AAAA,EACpD;AAAA,EAED,YAAYC,GAAU;AACpB,WAAAF,EAAA,MAAKN,GAAW,IAAIQ,CAAQ,GAErB,MACLF,EAAA,MAAKN,GAAW,OAAOQ,CAAQ;AAAA,EAClC;AAAA,EAqBD,OAAO,eAAe;AA7HjB,QAAAV,GAAAuB,GAAAC;AA8HH,QAAI,EAAChB,EAAAW,GAAmBL,GAAc,MAItC;AAAA,iBAAW,CAACW,GAAYhB,CAAQ,KAAKD,EAAAW,GAAmBL,GAAc,QAAS;AAC7E,QAAAY,EAAA1B,IAAAyB,GAAWR,GAAAC,GAAX,KAAAlB,GAAwBS;AAC1B,MAAAD,EAAAW,GAAmBL,GAAc,MAAO;AAIxC,iBAAWa,KAAYnB,EAAAW,GAAmBJ;AAAmB,YAAIY;AAC/D,qBAAWC,KAAcD;AACvB,YAAAD,EAAAF,IAAAI,GAAWX,GAAAC,GAAX,KAAAM,GAAwBhB,EAAAe,IAAAK,GAAWjB,GAAX,KAAAY;AAC5B,MAAAf,EAAAW,GAAmBJ,GAAkB,SAAS;AAG9C,iBAAWL,KAAYF,EAAAW,GAAmBH;AACxC,QAAAN,EAAU;AACZ,MAAAF,EAAAW,GAAmBH,GAAgB,SAAS;AAAA;AAAA,EAC7C;AACH;AA9GO,IAAMa,IAANV;AACJnB,IAAAD,GAEDE,IAAA,eACAC,IAAA,eAGAS,IAAA,eAGAC,IAAA,eAEAC,IAAA,eAGOC,IAAA,eAGAC,IAAA,eAEAC,IAAA,eAmDPC,IAAA,eAAAC,IAAY,SAACT,GAAU;AACrB,MAAIA,MAAaD,EAAA,MAAKP;AACpB;AAEF,EAAAM,EAAA,MAAKN,GAASQ,IACdD,EAAAW,GAAmBH,GAAgB,KAAK,GAAGR,EAAA,MAAKN,EAAU;AAE1D,QAAM4B,IAAQtB,EAAAW,GAAmBJ;AACjC,aAAWa,KAAcpB,EAAA,MAAKK,IAAc;AAC1C,UAAMkB,IAAQvB,EAAAoB,GAAWhB;AACzB,IAAKkB,EAAMC,OACTD,EAAMC,KAAS,oBAAI,IAAK,IAE1BD,EAAMC,GAAO,IAAIH,CAAU;AAAA,EAC5B;AACF,GAvEDtB,EAfWuB,GAeJf,GAAgB,oBAAI,IAAK,IAGhCR,EAlBWuB,GAkBJd,GAAoB,CAAE,IAE7BT,EApBWuB,GAoBJb,GAAkB,CAAE;AA6FtB,MAAMgB,IAAI,CAACZ,GAAGC,MAAM,IAAIQ,EAAmBT,GAAGC,CAAC,GAGzCY,IAAa,CAACb,GAAGC,MAAM;AAClC,MAAID,KAAA,QAAAA,EAAIrB;AACN,WAAAsB,EAAED,EAAE,KAAK,GACFA,EAAE,YAAY,MAAMC,EAAED,EAAE,KAAK,CAAC;AAGvC,EAAAC,EAAED,CAAC;AACL;;;;;;;8CCzJMc,IAAc,CAAAd,OAElBA,KAAA,gBAAAA,EAAIrB,OACJqB,aAAa,QAEb,MAAM,QAAQA,CAAC,KAEfA,KAAK,QAEL,EAAE,OAAOA,KAAM,cAAc,OAAOA,KAAM,WAItCe,IAAwB,CAAAf,MAExBA,aAAa,OACRA,IAEA,OAAOA,KAAM,aAAaA,MAAM,UAAaA,MAAM,OACnD,SAAS,cAAcA,CAAC,IAGxB,SAAS,eAAeA,CAAC,GAI9BgB,IAAsB,CAAAC,MAAS;AACnC,MAAIC,IAAOH,EAAsBE,EAAM,KAAK;AAE5C,QAAME,IAAeF,EAAM,YAAY,MAAM;AAE3C,QAAI,CAACC,EAAK,YAAY;AACpB,MAAAC,EAAc;AACd;AAAA,IACD;AAGD,QAAK,MAAM,QAAQF,EAAM,KAAK;AAO5B,MAAAE,EAAc,GACdD,EAAK,YAAY,GAAGE,EAA0BH,CAAK,CAAC;AAAA,SARrB;AAC/B,YAAMI,IAAUH;AAChB,MAAAA,IAAOH,EAAsBE,EAAM,KAAK,GACxCI,EAAQ,YAAYH,CAAI;AAAA,IACzB;AAAA,EAML,CAAG;AAED,SAAOA;AACT,GAGME,IAA4B,CAAAH,MAAS;AAGzC,QAAMK,IAAQ,SAAS,cAAc,GAAG,GAClCC,IAAQ,SAAS,cAAc,GAAG,GAElCJ,IAAeF,EAAM,YAAY,MAAM;AAE3C,QAAI,CAACK,EAAM,YAAY;AACrB,MAAAH,EAAc;AACd;AAAA,IACD;AAGD,UAAMK,IAAQ,SAAS,YAAa;AACpC,IAAAA,EAAM,cAAcF,CAAK,GAGrB,MAAM,QAAQL,EAAM,KAAK,KAC3BO,EAAM,aAAaD,CAAI,GACvBC,EAAM,eAAgB,GACtBF,EAAM,MAAM,GAAGG,EAAoBR,EAAM,KAAK,CAAC,MAI/CE,EAAc,GACdK,EAAM,YAAYD,CAAI,GACtBC,EAAM,eAAgB,GACtBF,EAAM,YAAYN,EAAoBC,CAAK,CAAC;AAAA,EAElD,CAAG;AAED,SAAO;AAAA,IACLK;AAAA,IACA,GAAGG,EAAoBR,EAAM,KAAK;AAAA,IAClCM;AAAA,EACD;AACH,GAKaE,IAAsB,CAAAC,MACjCA,EACG,KAAK,KAAQ,EACb,QAAQ,CAAAT,MAEFA,KAAA,QAAAA,EAAQtC,KAIR,MAAM,QAAQsC,EAAM,KAAK,IAIvBG,EAA0BH,CAAK,IAH7B,CAACD,EAAoBC,CAAK,CAAC,IAJ3B,CAACF,EAAsBE,CAAK,CAAC,CAQvC,GAQQU,IAAc,CAACC,GAASC,MAAW;AAC9C,aAAWC,KAAYD;AACrB,IAAAhB,EAAWgB,EAAOC,IAAW,CAAA9C,MAAS;AACpC,MAAIA,MAAU,SACZ4C,EAAQ,MAAM,YAAeE,GAAU9C,CAAK,IAE5C4C,EAAQ,MAAM,eAAeE,CAAQ;AAAA,IAC7C,CAAK;AACL,GAIaC,IAAe,CAACH,GAASI,MAAY;AAChD,aAAWC,KAAQD;AACjB,IAAAnB,EAAWmB,EAAQC,IAAO,CAAAjD,MAAS;AACjC,MAAA4C,EAAQ,UAAU,OAAOK,GAAMjD,CAAK;AAAA,IAC1C,CAAK;AACL,GAIakD,IAAkB,CAACN,GAASO,MAAe;AACtD,aAAWF,KAAQE;AACjB,IAAAtB,EAAWsB,EAAWF,IAAO,CAAAjD,MAAS;AACpC,MAAIA,MAAU,SACZ4C,EAAQ,aAAgBK,GAAMjD,CAAK,IAEnC4C,EAAQ,gBAAgBK,CAAI;AAAA,IACpC,CAAK;AACL,GAOaG,IAAI,CAAAC,MAAe;AAE9B,MAAI,CAACA,EAAY1D;AACf,WAAO,SAAS,eAAe0D,CAAW;AAG5C,QAAMnB,IAAO,SAAS,eAAemB,EAAY,KAAK;AACtD,SAAAA,EAAY,YAAY,MAAM;AAC5B,IAAAnB,EAAK,cAAcmB,EAAY;AAAA,EACnC,CAAG,GACMnB;AACT,GAGaoB,IAAI,CAAAL,MAAQ,IAAIM,MAAa;AD7KnC,MAAA3D;AC8KL,MAAI2D,EAAS,WAAW;AACtB,WAAO,SAAS,cAAcN,CAAI;AAGpC,MAAInB,EAAYyB,EAAS,EAAE,GAAG;AAC5B,UAAMX,IAAU,SAAS,cAAcK,CAAI;AAC3C,WAAAL,EAAQ,OAAO,GAAGH,EAAoBc,CAAQ,CAAC,GACxCX;AAAA,EACR;AAGD,QAAM,CAACY,MAAUd,CAAQ,IAAIa,GAGvB,EAAE,WAAAE,EAAS,KAAK7D,IAAA4D,EAAM,SAAN,OAAA5D,IAAc,CAAE;AACtC,SAAO4D,EAAM;AAGb,QAAMZ,IACJa,IACI,SAAS,gBAAgBA,GAAWR,CAAI,IACxC,SAAS,cAA2BA,CAAI;AAK9C,EAAI,OAAOO,EAAM,SAAU,YAAY,CAACA,EAAM,MAAM7D,OAClDgD,EAAYC,GAASY,EAAM,KAAK,GAChC,OAAOA,EAAM,QAGX,OAAOA,EAAM,SAAU,YAAY,CAACA,EAAM,MAAM7D,OAClDoD,EAAaH,GAASY,EAAM,KAAK,GACjC,OAAOA,EAAM;AAEf,aAAWP,KAAQO;AAEjB,IAAIP,EAAK,WAAW,IAAI,KAAK,OAAOO,EAAMP,MAAU,eAClDL,EAAQ,iBAAiBK,EAAK,MAAM,CAAC,GAAGO,EAAMP,EAAK,GACnD,OAAOO,EAAMP;AAKjB,SAAAC,EAAgBN,GAASY,CAAK,GAG9BZ,EAAQ,OAAO,GAAGH,EAAoBC,CAAQ,CAAC,GACxCE;AACT,GAOac,IAAI,CAACC,GAAiBH,MAAUd,MAAa;AAGxD,MAAI,OAAOiB,KAAoB,UAAU;AACvC,UAAMC,IAAcN,EAAEK,CAAe;AACrC,WAAOH,IACHI,EAAYJ,GAAO,GAAGd,CAAQ,IAC9BkB,EAAY,GAAGlB,CAAQ;AAAA,EAC5B;AAKD,SAAOiB,EAAgB,EAAE,GAAGH,GAAO,UAAAd,EAAQ,CAAE;AAC/C,GAGamB,IAAc,CAAC,EAAE,UAAAnB,EAAQ,MAAOA,GAOhCoB,IAAmB,MAAM;AACpC,QAAMC,IAAS,CAAE,GACXC,IAAgB,SAAS,qBAAqB,eAAe;AAEnE,aAAWC,KAAgBD,GAAe;AACxC,UAAME,IAAW,SAAS,eAAeD,EAAa,WAAW,GAE3DE,IAAMF,EAAa,aAAa,KAAK;AAC3C,IAAIE,MACFJ,EAAOI,KAAOD,IAEhBD,EAAa,YAAYC,CAAQ;AAAA,EAClC;AAED,SAAOH;AACT;;;;;;;;;;;8CC5QaK,IAAO,CAACpD,MAAMqD,MACzBA,EAAG,OAAO,CAACC,GAAGrD,MAAMA,EAAEqD,CAAC,GAAGtD,CAAC,GAKhBuD,IAAW,CAACC,GAAQC,GAAMC,MACrCF,EAAO;AAAA,EAEL,IAAI,YAAYC,GAAM;AAAA,IACpB,SAAS;AAAA,IACT,YAAY;AAAA,IACZ,UAAU;AAAA,IACV,GAAGC;AAAA,EACT,CAAK;AACF,GAKUC,IAAqB,CAACC,GAAQC,MAAa;AACtD,QAAMC,IAAe;AAAA,IACnB,GAAGF;AAAA,IACH,CAAC,OAAO,WAAW,MAAMC,EAAS,OAAO,UAAW;AAAA,EACrD;AAED,gBAAO,eAAeC,GAAc,OAAO,UAAU;AAAA,IACnD,YAAY;AAAA,EAChB,CAAG,GAEMA;AACT,GAMaC,IAAmB,CAAA9D,MAC9B,IAAI,MAAM,CAAA,GAAI;AAAA,EACZ,KAAK,CAAC+D,GAAGlC,MAAa7B,EAAE6B,CAAQ;AACjC,CAAA;;;;;;;"}

package/dist/bruh.umd.js

@@ -0,0 +1,2 @@
+var Y=Object.defineProperty;var Z=(a,o,c)=>o in a?Y(a,o,{enumerable:!0,configurable:!0,writable:!0,value:c}):a[o]=c;var O=(a,o,c)=>(Z(a,typeof o!="symbol"?o+"":o,c),c),P=(a,o,c)=>{if(!o.has(a))throw TypeError("Cannot "+c)};var s=(a,o,c)=>(P(a,o,"read from private field"),c?c.call(a):o.get(a)),d=(a,o,c)=>{if(o.has(a))throw TypeError("Cannot add the same private member more than once");o instanceof WeakSet?o.add(a):o.set(a,c)},b=(a,o,c,p)=>(P(a,o,"write to private field"),p?p.call(a,c):o.set(a,c),c);var R=(a,o,c)=>(P(a,o,"access private method"),c);(function(a,o){typeof exports=="object"&&typeof module<"u"?o(exports):typeof define=="function"&&define.amd?define(["exports"],o):(a=typeof globalThis<"u"?globalThis:a||self,o(a.bruh={}))})(this,function(a){var H,v,g,K,y,S,j,h,E,l,N,T,M,z;"use strict";const o=Symbol.for("bruh reactive");class c{constructor(e){O(this,H,!0);d(this,v,void 0);d(this,g,new Set);b(this,v,e)}get value(){return s(this,v)}set value(e){if(e!==s(this,v)){b(this,v,e);for(const r of s(this,g))r()}}addReaction(e){return s(this,g).add(e),()=>s(this,g).delete(e)}}H=o,v=new WeakMap,g=new WeakMap;const u=class{constructor(e,r){d(this,M);O(this,K,!0);d(this,y,void 0);d(this,S,new Set);d(this,j,void 0);d(this,h,0);d(this,E,new Set);if(!r){b(this,y,e);return}b(this,y,r()),b(this,j,r),b(this,h,Math.max(...e.map(n=>s(n,h)))+1),e.forEach(n=>s(n,E).add(this))}get value(){if(s(u,l).size){if(s(this,h)!==0)u.applyUpdates();else if(s(u,l).has(this))return s(u,l).get(this)}return s(this,y)}set value(e){s(this,h)===0&&(s(u,l).size||queueMicrotask(u.applyUpdates),s(u,l).set(this,e))}addReaction(e){return s(this,S).add(e),()=>s(this,S).delete(e)}static applyUpdates(){var e,r,n;if(!!s(u,l).size){for(const[i,f]of s(u,l).entries())R(e=i,M,z).call(e,f);s(u,l).clear();for(const i of s(u,N))if(i)for(const f of i)R(n=f,M,z).call(n,s(r=f,j).call(r));s(u,N).length=0;for(const i of s(u,T))i();s(u,T).length=0}}};let p=u;K=o,y=new WeakMap,S=new WeakMap,j=new WeakMap,h=new WeakMap,E=new WeakMap,l=new WeakMap,N=new WeakMap,T=new WeakMap,M=new WeakSet,z=function(e){if(e===s(this,y))return;b(this,y,e),s(u,T).push(...s(this,S));const r=s(u,N);for(const n of s(this,E)){const i=s(n,h);r[i]||(r[i]=new Set),r[i].add(n)}},d(p,l,new Map),d(p,N,[]),d(p,T,[]);const J=(t,e)=>new p(t,e),w=(t,e)=>{if(t!=null&&t[o])return e(t.value),t.addReaction(()=>e(t.value));e(t)},L=Object.freeze(Object.defineProperty({__proto__:null,isReactive:o,SimpleReactive:c,FunctionalReactive:p,r:J,reactiveDo:w},Symbol.toStringTag,{value:"Module"})),X=t=>(t==null?void 0:t[o])||t instanceof Node||Array.isArray(t)||t==null||!(typeof t=="function"||typeof t=="object"),C=t=>t instanceof Node?t:typeof t=="boolean"||t===void 0||t===null?document.createComment(t):document.createTextNode(t),W=t=>{let e=C(t.value);const r=t.addReaction(()=>{if(!e.parentNode){r();return}if(Array.isArray(t.value))r(),e.replaceWith(...U(t));else{const n=e;e=C(t.value),n.replaceWith(e)}});return e},U=t=>{const e=document.createComment("["),r=document.createComment("]"),n=t.addReaction(()=>{if(!e.parentNode){n();return}const i=document.createRange();i.setStartAfter(e),Array.isArray(t.value)?(i.setEndBefore(r),i.deleteContents(),e.after(...A(t.value))):(n(),i.setEndAfter(r),i.deleteContents(),e.replaceWith(W(t)))});return[e,...A(t.value),r]},A=t=>t.flat(1/0).flatMap(e=>e!=null&&e[o]?Array.isArray(e.value)?U(e):[W(e)]:[C(e)]),B=(t,e)=>{for(const r in e)w(e[r],n=>{n!==void 0?t.style.setProperty(r,n):t.style.removeProperty(r)})},D=(t,e)=>{for(const r in e)w(e[r],n=>{t.classList.toggle(r,n)})},Q=(t,e)=>{for(const r in e)w(e[r],n=>{n!==void 0?t.setAttribute(r,n):t.removeAttribute(r)})},I=t=>{if(!t[o])return document.createTextNode(t);const e=document.createTextNode(t.value);return t.addReaction(()=>{e.textContent=t.value}),e},k=t=>(...e)=>{var q;if(e.length===0)return document.createElement(t);if(X(e[0])){const m=document.createElement(t);return m.append(...A(e)),m}const[r,...n]=e,{namespace:i}=(q=r.bruh)!=null?q:{};delete r.bruh;const f=i?document.createElementNS(i,t):document.createElement(t);typeof r.style=="object"&&!r.style[o]&&(B(f,r.style),delete r.style),typeof r.class=="object"&&!r.class[o]&&(D(f,r.class),delete r.class);for(const m in r)m.startsWith("on")&&typeof r[m]=="function"&&(f.addEventListener(m.slice(2),r[m]),delete r[m]);return Q(f,r),f.append(...A(n)),f},$=Object.freeze(Object.defineProperty({__proto__:null,bruhChildrenToNodes:A,applyStyles:B,applyClasses:D,applyAttributes:Q,t:I,e:k,h:(t,e,...r)=>{if(typeof t=="string"){const n=k(t);return e?n(e,...r):n(...r)}return t({...e,children:r})},JSXFragment:({children:t})=>t,hydrateTextNodes:()=>{const t={},e=document.getElementsByTagName("bruh-textnode");for(const r of e){const n=document.createTextNode(r.textContent),i=r.getAttribute("tag");i&&(t[i]=n),r.replaceWith(n)}return t}},Symbol.toStringTag,{value:"Module"})),G=Object.freeze(Object.defineProperty({__proto__:null,pipe:(t,...e)=>e.reduce((r,n)=>n(r),t),dispatch:(t,e,r)=>t.dispatchEvent(new CustomEvent(e,{bubbles:!0,cancelable:!0,composed:!0,...r})),createDestructable:(t,e)=>{const r={...t,[Symbol.iterator]:()=>e[Symbol.iterator]()};return Object.defineProperty(r,Symbol.iterator,{enumerable:!1}),r},functionAsObject:t=>new Proxy({},{get:(e,r)=>t(r)})},Symbol.toStringTag,{value:"Module"}));a.dom=$,a.reactive=L,a.util=G,Object.defineProperties(a,{__esModule:{value:!0},[Symbol.toStringTag]:{value:"Module"}})});
+//# sourceMappingURL=bruh.umd.js.map

package/dist/bruh.umd.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bruh.umd.js","sources":["../src/reactive/index.mjs","../src/dom/index.browser.mjs","../src/util/index.mjs"],"sourcesContent":["export const isReactive = Symbol.for(\"bruh reactive\")\n\n// A super simple and performant reactive value implementation\nexport class SimpleReactive {\n  [isReactive] = true\n\n  #value\n  #reactions = new Set()\n\n  constructor(value) {\n    this.#value = value\n  }\n\n  get value() {\n    return this.#value\n  }\n\n  set value(newValue) {\n    if (newValue === this.#value)\n      return\n\n    this.#value = newValue\n    for (const reaction of this.#reactions)\n      reaction()\n  }\n\n  addReaction(reaction) {\n    this.#reactions.add(reaction)\n\n    return () =>\n      this.#reactions.delete(reaction)\n  }\n}\n\n// A reactive implementation for building functional reactive graphs\n// Ensures state consistency, minimal node updates, and transparent update batching\nexport class FunctionalReactive {\n  [isReactive] = true\n\n  #value\n  #reactions = new Set()\n\n  // For derived nodes, f is the derivation function\n  #f\n  // Source nodes are 0 deep in the derivation graph\n  // This is for topological sort\n  #depth = 0\n  // All nodes have a set of derivatives that update when the node changes\n  #derivatives = new Set()\n\n  // Keep track of all the pending changes from the value setter\n  static #settersQueue = new Map()\n  // A queue of derivatives to potentially update, sorted into sets by depth\n  // This starts with depth 1 and can potentially have holes\n  static #derivativesQueue = []\n  // A queue of reactions to run after the graph is fully updated\n  static #reactionsQueue = []\n\n  constructor(x, f) {\n    if (!f) {\n      this.#value = x\n      return\n    }\n\n    this.#value = f()\n    this.#f = f\n    this.#depth = Math.max(...x.map(d => d.#depth)) + 1\n\n    x.forEach(d => d.#derivatives.add(this))\n  }\n\n  get value() {\n    // If there are any pending updates\n    if (FunctionalReactive.#settersQueue.size) {\n      // Heuristic quick invalidation for derived nodes\n      // Apply updates now, it's ok that there's already a microtask queued for this\n      if (this.#depth !== 0)\n        FunctionalReactive.applyUpdates()\n      // If this is a source node that was updated, just return that\n      // new value without actually updating any derived nodes yet\n      else if (FunctionalReactive.#settersQueue.has(this))\n        return FunctionalReactive.#settersQueue.get(this)\n    }\n\n    return this.#value\n  }\n\n  set value(newValue) {\n    // Only allow source nodes to be directly updated\n    if (this.#depth !== 0)\n      return\n\n    // Unless asked for earlier, these updates are just queued up until the microtasks run\n    if (!FunctionalReactive.#settersQueue.size)\n      queueMicrotask(FunctionalReactive.applyUpdates)\n\n    FunctionalReactive.#settersQueue.set(this, newValue)\n  }\n\n  addReaction(reaction) {\n    this.#reactions.add(reaction)\n\n    return () =>\n      this.#reactions.delete(reaction)\n  }\n\n  // Apply an update for a node and queue its derivatives if it actually changed\n  #applyUpdate(newValue) {\n    if (newValue === this.#value)\n      return\n\n    this.#value = newValue\n    FunctionalReactive.#reactionsQueue.push(...this.#reactions)\n\n    const queue = FunctionalReactive.#derivativesQueue\n    for (const derivative of this.#derivatives) {\n      const depth = derivative.#depth\n      if (!queue[depth])\n        queue[depth] = new Set()\n\n      queue[depth].add(derivative)\n    }\n  }\n\n  // Apply pending updates from actually changed source nodes\n  static applyUpdates() {\n    if (!FunctionalReactive.#settersQueue.size)\n      return\n\n    // Bootstrap by applying the updates from the pending setters\n    for (const [sourceNode, newValue] of FunctionalReactive.#settersQueue.entries())\n      sourceNode.#applyUpdate(newValue)\n    FunctionalReactive.#settersQueue.clear()\n\n    // Iterate down the depths, ignoring holes\n    // Note that both the queue (Array) and each depth Set iterators update as items are added\n    for (const depthSet of FunctionalReactive.#derivativesQueue) if (depthSet)\n      for (const derivative of depthSet)\n        derivative.#applyUpdate(derivative.#f())\n    FunctionalReactive.#derivativesQueue.length = 0\n\n    // Call all reactions now that the graph has a fully consistent state\n    for (const reaction of FunctionalReactive.#reactionsQueue)\n      reaction()\n    FunctionalReactive.#reactionsQueue.length = 0\n  }\n}\n\n// A little convenience function\nexport const r = (x, f) => new FunctionalReactive(x, f)\n\n// Do something with a value, updating if it is reactive\nexport const reactiveDo = (x, f) => {\n  if (x?.[isReactive]) {\n    f(x.value)\n    return x.addReaction(() => f(x.value))\n  }\n\n  f(x)\n}\n","import { isReactive, reactiveDo } from \"../reactive/index.mjs\"\n\n//#region Bruh child functions e.g. bruhChildrenToNodes()\n\n// A basic check for if a value is allowed as a child in bruh\n// It's responsible for quickly checking the type, not deep validation\nconst isBruhChild = x =>\n  // Reactives and DOM nodes\n  x?.[isReactive] ||\n  x instanceof Node ||\n  // Any array, just assume it contains valid children\n  Array.isArray(x) ||\n  // Allow nullish\n  x == null ||\n  // Disallow functions and objects\n  !(typeof x === \"function\" || typeof x === \"object\")\n  // Everything else can be a child when stringified\n\n// Coerces input into a DOM node, if it isn't already one\nconst unreactiveChildToNode = x => {\n  // Existing DOM nodes are untouched\n  if (x instanceof Node)\n    return x\n  // booleans and nullish are ignored\n  else if (typeof x === \"boolean\" || x === undefined || x === null)\n    return document.createComment(x)\n  // Anything else is treated as text\n  else\n    return document.createTextNode(x)\n}\n\n// Auto-swapping single reactive node\nconst reactiveChildToNode = child => {\n  let node = unreactiveChildToNode(child.value)\n\n  const stopReacting = child.addReaction(() => {\n    // Stop swapping if no longer possible\n    if (!node.parentNode) {\n      stopReacting()\n      return\n    }\n\n    // Normal swap\n    if (!Array.isArray(child.value)) {\n      const oldNode = node\n      node = unreactiveChildToNode(child.value)\n      oldNode.replaceWith(node)\n    }\n    // If an array now, stop swapping, then switch to reactive array swapping\n    else {\n      stopReacting()\n      node.replaceWith(...reactiveArrayChildToNodes(child))\n    }\n  })\n\n  return node\n}\n\n// Auto-swapping reactive array of nodes\nconst reactiveArrayChildToNodes = child => {\n  // Markers owned by the swapper here itself, so that\n  // the values in the array can be swapped separately\n  const first = document.createComment(\"[\")\n  const last  = document.createComment(\"]\")\n\n  const stopReacting = child.addReaction(() => {\n    // Stop swapping if there is no parent to swap within\n    if (!first.parentNode) {\n      stopReacting()\n      return\n    }\n\n    // Make a range starting after the first marker\n    const range = document.createRange()\n    range.setStartAfter(first)\n\n    // Normal swap, replacing content between the first and last markers\n    if (Array.isArray(child.value)) {\n      range.setEndBefore(last)\n      range.deleteContents()\n      first.after(...bruhChildrenToNodes(child.value))\n    }\n    // Switch to single swapping node by replacing everything\n    else {\n      stopReacting()\n      range.setEndAfter(last)\n      range.deleteContents()\n      first.replaceWith(reactiveChildToNode(child))\n    }\n  })\n\n  return [\n    first,\n    ...bruhChildrenToNodes(child.value),\n    last\n  ]\n}\n\n// Processes bruh children into an array of DOM nodes\n// Reactive values are automatically replaced, so the output must be placed into a parent node\n// before any top level (after flattening arrays) reactions run\nexport const bruhChildrenToNodes = children =>\n  children\n    .flat(Infinity)\n    .flatMap(child => {\n      // Non-reactive child\n      if (!child?.[isReactive])\n        return [unreactiveChildToNode(child)]\n\n      // Single reactive value\n      if (!Array.isArray(child.value))\n        return [reactiveChildToNode(child)]\n\n      // Reactive array\n      return reactiveArrayChildToNodes(child)\n    })\n\n//#endregion\n\n//#region Reactive-aware element helper functions e.g. applyAttributes()\n\n// Style attribute rules from an object with\n// potentially reactive and/or undefined values\nexport const applyStyles = (element, styles) => {\n  for (const property in styles)\n    reactiveDo(styles[property], value => {\n      if (value !== undefined)\n        element.style.setProperty   (property, value)\n      else\n        element.style.removeProperty(property)\n    })\n}\n\n// Class list from an object mapping from\n// class names to potentially reactive booleans\nexport const applyClasses = (element, classes) => {\n  for (const name in classes)\n    reactiveDo(classes[name], value => {\n      element.classList.toggle(name, value)\n    })\n}\n\n// Attributes from an object with\n// potentially reactive and/or undefined values\nexport const applyAttributes = (element, attributes) => {\n  for (const name in attributes)\n    reactiveDo(attributes[name], value => {\n      if (value !== undefined)\n        element.setAttribute   (name, value)\n      else\n        element.removeAttribute(name)\n    })\n}\n\n//#endregion\n\n//#region t() for text nodes and e() for element nodes\n\n// Text nodes\nexport const t = textContent => {\n  // Non-reactive values are just text nodes\n  if (!textContent[isReactive])\n    return document.createTextNode(textContent)\n\n  // Reactive values auto-update the node's text content\n  const node = document.createTextNode(textContent.value)\n  textContent.addReaction(() => {\n    node.textContent = textContent.value\n  })\n  return node\n}\n\n// Elements\nexport const e = name => (...variadic) => {\n  if (variadic.length === 0)\n    return document.createElement(name)\n\n  // If there are no props\n  if (isBruhChild(variadic[0])) {\n    const element = document.createElement(name)\n    element.append(...bruhChildrenToNodes(variadic))\n    return element\n  }\n\n  // If props exist as the first variadic argument\n  const [props, ...children] = variadic\n\n  // Extract explicit options from the bruh prop\n  const { namespace } = props.bruh ?? {}\n  delete props.bruh\n\n  // Make an element with optional namespace\n  const element =\n    namespace\n      ? document.createElementNS(namespace, name)\n      : document.createElement  (           name)\n\n  // Apply overloaded props, if possible\n\n  // Inline style object\n  if (typeof props.style === \"object\" && !props.style[isReactive]) {\n    applyStyles(element, props.style)\n    delete props.style\n  }\n  // Classes object\n  if (typeof props.class === \"object\" && !props.class[isReactive]) {\n    applyClasses(element, props.class)\n    delete props.class\n  }\n  for (const name in props) {\n    // Event listener functions\n    if (name.startsWith(\"on\") && typeof props[name] === \"function\") {\n      element.addEventListener(name.slice(2), props[name])\n      delete props[name]\n    }\n  }\n\n  // The rest of the props are attributes\n  applyAttributes(element, props)\n\n  // Add the children to the element\n  element.append(...bruhChildrenToNodes(children))\n  return element\n}\n\n//#endregion\n\n//#region JSX integration\n\n// The function that jsx tags (except fragments) compile to\nexport const h = (nameOrComponent, props, ...children) => {\n  // If we are making an element, this is just a wrapper of e()\n  // This is likely when the JSX tag name begins with a lowercase character\n  if (typeof nameOrComponent === \"string\") {\n    const makeElement = e(nameOrComponent)\n    return props\n      ? makeElement(props, ...children)\n      : makeElement(...children)\n  }\n\n  // It must be a component, then, as bruh components are just functions\n  // Due to JSX, this would mean a function with only one parameter - props\n  // This object includes the all of the normal props and a \"children\" key\n  return nameOrComponent({ ...props, children })\n}\n\n// The JSX fragment is made into a bruh fragment (just an array)\nexport const JSXFragment = ({ children }) => children\n\n//#endregion\n\n\n\n// Hydration of all bruh-textnode's from prerendered html\nexport const hydrateTextNodes = () => {\n  const tagged = {}\n  const bruhTextNodes = document.getElementsByTagName(\"bruh-textnode\")\n\n  for (const bruhTextNode of bruhTextNodes) {\n    const textNode = document.createTextNode(bruhTextNode.textContent)\n\n    const tag = bruhTextNode.getAttribute(\"tag\")\n    if (tag)\n      tagged[tag] = textNode\n\n    bruhTextNode.replaceWith(textNode)\n  }\n\n  return tagged\n}\n","// Create a pipeline with an initial value and a series of functions\nexport const pipe = (x, ...fs) =>\n  fs.reduce((y, f) => f(y), x)\n\n// Dispatch a custom event to (capturing) and from (bubbling) a target (usually a DOM node)\n// Returns false if the event was cancelled (preventDefault()) and true otherwise\n// Note that this is synchronous\nexport const dispatch = (target, type, options) =>\n  target.dispatchEvent(\n    // Default to behave like most DOM events\n    new CustomEvent(type, {\n      bubbles: true,\n      cancelable: true,\n      composed: true,\n      ...options\n    })\n  )\n\n// Inspired by https://antfu.me/posts/destructuring-with-object-or-array#take-away\n// Creates an object that is both destructable with {...} and [...]\n// Useful for writing library functions à la react-use & vueuse\nexport const createDestructable = (object, iterable) => {\n  const destructable = {\n    ...object,\n    [Symbol.iterator]: () => iterable[Symbol.iterator]()\n  }\n\n  Object.defineProperty(destructable, Symbol.iterator, {\n    enumerable: false\n  })\n\n  return destructable\n}\n\n// Creates an object (as a Proxy) that acts as a function\n// So functionAsObject(f).property is equivalent to f(\"property\")\n// This is can be useful when combined with destructuring syntax, e.g.:\n// const { html, head, title, body, main, h1, p } = functionAsObject(e)\nexport const functionAsObject = f =>\n  new Proxy({}, {\n    get: (_, property) => f(property)\n  })\n"],"names":["isReactive","SimpleReactive","value","__publicField","_a","__privateAdd","_value","_reactions","__privateSet","__privateGet","newValue","reaction","_FunctionalReactive","x","f","_applyUpdate","_b","_f","_depth","_derivatives","d","_settersQueue","sourceNode","__privateMethod","applyUpdate_fn","depthSet","_derivativesQueue","derivative","_c","_reactionsQueue","FunctionalReactive","queue","depth","r","reactiveDo","isBruhChild","unreactiveChildToNode","reactiveChildToNode","child","node","stopReacting","reactiveArrayChildToNodes","oldNode","first","last","range","bruhChildrenToNodes","children","applyStyles","element","styles","property","applyClasses","classes","name","applyAttributes","attributes","t","textContent","e","variadic","props","namespace","nameOrComponent","makeElement","tagged","bruhTextNodes","bruhTextNode","textNode","tag","fs","y","target","type","options","object","iterable","destructable","_"],"mappings":"qyBAAO,MAAMA,EAAa,OAAO,IAAI,eAAe,EAG7C,MAAMC,CAAe,CAM1B,YAAYC,EAAO,CALnBC,EAAA,KAACC,EAAc,IAEfC,EAAA,KAAAC,EAAA,QACAD,EAAA,KAAAE,EAAa,IAAI,KAGfC,EAAA,KAAKF,EAASJ,EACf,CAED,IAAI,OAAQ,CACV,OAAOO,EAAA,KAAKH,EACb,CAED,IAAI,MAAMI,EAAU,CAClB,GAAIA,IAAaD,EAAA,KAAKH,GAGtB,CAAAE,EAAA,KAAKF,EAASI,GACd,UAAWC,KAAYF,EAAA,KAAKF,GAC1BI,EAAU,EACb,CAED,YAAYA,EAAU,CACpB,OAAAF,EAAA,KAAKF,GAAW,IAAII,CAAQ,EAErB,IACLF,EAAA,KAAKF,GAAW,OAAOI,CAAQ,CAClC,CACH,CA5BGP,EAAAJ,EAEDM,EAAA,YACAC,EAAA,YA6BK,MAAMK,EAAN,KAAyB,CAsB9B,YAAYC,EAAGC,EAAG,CAiDlBT,EAAA,KAAAU,GAtEAZ,EAAA,KAACa,EAAc,IAEfX,EAAA,KAAAC,EAAA,QACAD,EAAA,KAAAE,EAAa,IAAI,KAGjBF,EAAA,KAAAY,EAAA,QAGAZ,EAAA,KAAAa,EAAS,GAETb,EAAA,KAAAc,EAAe,IAAI,KAWjB,GAAI,CAACL,EAAG,CACNN,EAAA,KAAKF,EAASO,GACd,MACD,CAEDL,EAAA,KAAKF,EAASQ,EAAG,GACjBN,EAAA,KAAKS,EAAKH,GACVN,EAAA,KAAKU,EAAS,KAAK,IAAI,GAAGL,EAAE,IAAIO,GAAKX,EAAAW,EAAEF,EAAM,CAAC,EAAI,GAElDL,EAAE,QAAQO,GAAKX,EAAAW,EAAED,GAAa,IAAI,IAAI,CAAC,CACxC,CAED,IAAI,OAAQ,CAEV,GAAIV,EAAAG,EAAmBS,GAAc,MAGnC,GAAIZ,EAAA,KAAKS,KAAW,EAClBN,EAAmB,aAAc,UAG1BH,EAAAG,EAAmBS,GAAc,IAAI,IAAI,EAChD,OAAOZ,EAAAG,EAAmBS,GAAc,IAAI,IAAI,EAGpD,OAAOZ,EAAA,KAAKH,EACb,CAED,IAAI,MAAMI,EAAU,CAEdD,EAAA,KAAKS,KAAW,IAIfT,EAAAG,EAAmBS,GAAc,MACpC,eAAeT,EAAmB,YAAY,EAEhDH,EAAAG,EAAmBS,GAAc,IAAI,KAAMX,CAAQ,EACpD,CAED,YAAYC,EAAU,CACpB,OAAAF,EAAA,KAAKF,GAAW,IAAII,CAAQ,EAErB,IACLF,EAAA,KAAKF,GAAW,OAAOI,CAAQ,CAClC,CAqBD,OAAO,cAAe,WACpB,GAAI,EAACF,EAAAG,EAAmBS,GAAc,KAItC,UAAW,CAACC,EAAYZ,CAAQ,IAAKD,EAAAG,EAAmBS,GAAc,QAAS,EAC7EE,EAAAnB,EAAAkB,EAAWP,EAAAS,GAAX,KAAApB,EAAwBM,GAC1BD,EAAAG,EAAmBS,GAAc,MAAO,EAIxC,UAAWI,KAAYhB,EAAAG,EAAmBc,GAAmB,GAAID,EAC/D,UAAWE,KAAcF,EACvBF,EAAAK,EAAAD,EAAWZ,EAAAS,GAAX,KAAAI,EAAwBnB,EAAAO,EAAAW,EAAWV,GAAX,KAAAD,IAC5BP,EAAAG,EAAmBc,GAAkB,OAAS,EAG9C,UAAWf,KAAYF,EAAAG,EAAmBiB,GACxClB,EAAU,EACZF,EAAAG,EAAmBiB,GAAgB,OAAS,EAC7C,CACH,EA9GO,IAAMC,EAANlB,EACJI,EAAAhB,EAEDM,EAAA,YACAC,EAAA,YAGAU,EAAA,YAGAC,EAAA,YAEAC,EAAA,YAGOE,EAAA,YAGAK,EAAA,YAEAG,EAAA,YAmDPd,EAAA,YAAAS,EAAY,SAACd,EAAU,CACrB,GAAIA,IAAaD,EAAA,KAAKH,GACpB,OAEFE,EAAA,KAAKF,EAASI,GACdD,EAAAG,EAAmBiB,GAAgB,KAAK,GAAGpB,EAAA,KAAKF,EAAU,EAE1D,MAAMwB,EAAQtB,EAAAG,EAAmBc,GACjC,UAAWC,KAAclB,EAAA,KAAKU,GAAc,CAC1C,MAAMa,EAAQvB,EAAAkB,EAAWT,GACpBa,EAAMC,KACTD,EAAMC,GAAS,IAAI,KAErBD,EAAMC,GAAO,IAAIL,CAAU,CAC5B,CACF,EAvEDtB,EAfWyB,EAeJT,EAAgB,IAAI,KAG3BhB,EAlBWyB,EAkBJJ,EAAoB,CAAE,GAE7BrB,EApBWyB,EAoBJD,EAAkB,CAAE,GA6FtB,MAAMI,EAAI,CAACpB,EAAGC,IAAM,IAAIgB,EAAmBjB,EAAGC,CAAC,EAGzCoB,EAAa,CAACrB,EAAGC,IAAM,CAClC,GAAID,GAAA,MAAAA,EAAIb,GACN,OAAAc,EAAED,EAAE,KAAK,EACFA,EAAE,YAAY,IAAMC,EAAED,EAAE,KAAK,CAAC,EAGvCC,EAAED,CAAC,CACL,mKCzJMsB,EAActB,IAElBA,GAAA,YAAAA,EAAIb,KACJa,aAAa,MAEb,MAAM,QAAQA,CAAC,GAEfA,GAAK,MAEL,EAAE,OAAOA,GAAM,YAAc,OAAOA,GAAM,UAItCuB,EAAwBvB,GAExBA,aAAa,KACRA,EAEA,OAAOA,GAAM,WAAaA,IAAM,QAAaA,IAAM,KACnD,SAAS,cAAcA,CAAC,EAGxB,SAAS,eAAeA,CAAC,EAI9BwB,EAAsBC,GAAS,CACnC,IAAIC,EAAOH,EAAsBE,EAAM,KAAK,EAE5C,MAAME,EAAeF,EAAM,YAAY,IAAM,CAE3C,GAAI,CAACC,EAAK,WAAY,CACpBC,EAAc,EACd,MACD,CAGD,GAAK,MAAM,QAAQF,EAAM,KAAK,EAO5BE,EAAc,EACdD,EAAK,YAAY,GAAGE,EAA0BH,CAAK,CAAC,MARrB,CAC/B,MAAMI,EAAUH,EAChBA,EAAOH,EAAsBE,EAAM,KAAK,EACxCI,EAAQ,YAAYH,CAAI,CACzB,CAML,CAAG,EAED,OAAOA,CACT,EAGME,EAA4BH,GAAS,CAGzC,MAAMK,EAAQ,SAAS,cAAc,GAAG,EAClCC,EAAQ,SAAS,cAAc,GAAG,EAElCJ,EAAeF,EAAM,YAAY,IAAM,CAE3C,GAAI,CAACK,EAAM,WAAY,CACrBH,EAAc,EACd,MACD,CAGD,MAAMK,EAAQ,SAAS,YAAa,EACpCA,EAAM,cAAcF,CAAK,EAGrB,MAAM,QAAQL,EAAM,KAAK,GAC3BO,EAAM,aAAaD,CAAI,EACvBC,EAAM,eAAgB,EACtBF,EAAM,MAAM,GAAGG,EAAoBR,EAAM,KAAK,CAAC,IAI/CE,EAAc,EACdK,EAAM,YAAYD,CAAI,EACtBC,EAAM,eAAgB,EACtBF,EAAM,YAAYN,EAAoBC,CAAK,CAAC,EAElD,CAAG,EAED,MAAO,CACLK,EACA,GAAGG,EAAoBR,EAAM,KAAK,EAClCM,CACD,CACH,EAKaE,EAAsBC,GACjCA,EACG,KAAK,GAAQ,EACb,QAAQT,GAEFA,GAAA,MAAAA,EAAQtC,GAIR,MAAM,QAAQsC,EAAM,KAAK,EAIvBG,EAA0BH,CAAK,EAH7B,CAACD,EAAoBC,CAAK,CAAC,EAJ3B,CAACF,EAAsBE,CAAK,CAAC,CAQvC,EAQQU,EAAc,CAACC,EAASC,IAAW,CAC9C,UAAWC,KAAYD,EACrBhB,EAAWgB,EAAOC,GAAWjD,GAAS,CAChCA,IAAU,OACZ+C,EAAQ,MAAM,YAAeE,EAAUjD,CAAK,EAE5C+C,EAAQ,MAAM,eAAeE,CAAQ,CAC7C,CAAK,CACL,EAIaC,EAAe,CAACH,EAASI,IAAY,CAChD,UAAWC,KAAQD,EACjBnB,EAAWmB,EAAQC,GAAOpD,GAAS,CACjC+C,EAAQ,UAAU,OAAOK,EAAMpD,CAAK,CAC1C,CAAK,CACL,EAIaqD,EAAkB,CAACN,EAASO,IAAe,CACtD,UAAWF,KAAQE,EACjBtB,EAAWsB,EAAWF,GAAOpD,GAAS,CAChCA,IAAU,OACZ+C,EAAQ,aAAgBK,EAAMpD,CAAK,EAEnC+C,EAAQ,gBAAgBK,CAAI,CACpC,CAAK,CACL,EAOaG,EAAIC,GAAe,CAE9B,GAAI,CAACA,EAAY1D,GACf,OAAO,SAAS,eAAe0D,CAAW,EAG5C,MAAMnB,EAAO,SAAS,eAAemB,EAAY,KAAK,EACtD,OAAAA,EAAY,YAAY,IAAM,CAC5BnB,EAAK,YAAcmB,EAAY,KACnC,CAAG,EACMnB,CACT,EAGaoB,EAAIL,GAAQ,IAAIM,IAAa,OACxC,GAAIA,EAAS,SAAW,EACtB,OAAO,SAAS,cAAcN,CAAI,EAGpC,GAAInB,EAAYyB,EAAS,EAAE,EAAG,CAC5B,MAAMX,EAAU,SAAS,cAAcK,CAAI,EAC3C,OAAAL,EAAQ,OAAO,GAAGH,EAAoBc,CAAQ,CAAC,EACxCX,CACR,CAGD,KAAM,CAACY,KAAUd,CAAQ,EAAIa,EAGvB,CAAE,UAAAE,CAAS,GAAK1D,EAAAyD,EAAM,OAAN,KAAAzD,EAAc,CAAE,EACtC,OAAOyD,EAAM,KAGb,MAAMZ,EACJa,EACI,SAAS,gBAAgBA,EAAWR,CAAI,EACxC,SAAS,cAA2BA,CAAI,EAK1C,OAAOO,EAAM,OAAU,UAAY,CAACA,EAAM,MAAM7D,KAClDgD,EAAYC,EAASY,EAAM,KAAK,EAChC,OAAOA,EAAM,OAGX,OAAOA,EAAM,OAAU,UAAY,CAACA,EAAM,MAAM7D,KAClDoD,EAAaH,EAASY,EAAM,KAAK,EACjC,OAAOA,EAAM,OAEf,UAAWP,KAAQO,EAEbP,EAAK,WAAW,IAAI,GAAK,OAAOO,EAAMP,IAAU,aAClDL,EAAQ,iBAAiBK,EAAK,MAAM,CAAC,EAAGO,EAAMP,EAAK,EACnD,OAAOO,EAAMP,IAKjB,OAAAC,EAAgBN,EAASY,CAAK,EAG9BZ,EAAQ,OAAO,GAAGH,EAAoBC,CAAQ,CAAC,EACxCE,CACT,uIAOiB,CAACc,EAAiBF,KAAUd,IAAa,CAGxD,GAAI,OAAOgB,GAAoB,SAAU,CACvC,MAAMC,EAAcL,EAAEI,CAAe,EACrC,OAAOF,EACHG,EAAYH,EAAO,GAAGd,CAAQ,EAC9BiB,EAAY,GAAGjB,CAAQ,CAC5B,CAKD,OAAOgB,EAAgB,CAAE,GAAGF,EAAO,SAAAd,CAAQ,CAAE,CAC/C,cAG2B,CAAC,CAAE,SAAAA,CAAQ,IAAOA,mBAOb,IAAM,CACpC,MAAMkB,EAAS,CAAE,EACXC,EAAgB,SAAS,qBAAqB,eAAe,EAEnE,UAAWC,KAAgBD,EAAe,CACxC,MAAME,EAAW,SAAS,eAAeD,EAAa,WAAW,EAE3DE,EAAMF,EAAa,aAAa,KAAK,EACvCE,IACFJ,EAAOI,GAAOD,GAEhBD,EAAa,YAAYC,CAAQ,CAClC,CAED,OAAOH,CACT,oGC5QoB,CAACpD,KAAMyD,IACzBA,EAAG,OAAO,CAACC,EAAGzD,IAAMA,EAAEyD,CAAC,EAAG1D,CAAC,WAKL,CAAC2D,EAAQC,EAAMC,IACrCF,EAAO,cAEL,IAAI,YAAYC,EAAM,CACpB,QAAS,GACT,WAAY,GACZ,SAAU,GACV,GAAGC,CACT,CAAK,CACF,qBAK+B,CAACC,EAAQC,IAAa,CACtD,MAAMC,EAAe,CACnB,GAAGF,EACH,CAAC,OAAO,UAAW,IAAMC,EAAS,OAAO,UAAW,CACrD,EAED,cAAO,eAAeC,EAAc,OAAO,SAAU,CACnD,WAAY,EAChB,CAAG,EAEMA,CACT,mBAMgC/D,GAC9B,IAAI,MAAM,CAAA,EAAI,CACZ,IAAK,CAACgE,EAAG3B,IAAarC,EAAEqC,CAAQ,CACjC,CAAA"}

package/package.json

@@ -10,7 +10,7 @@
     "library",
     "modern"
   ],
-  "version": "1.13.0",
+  "version": "1.13.1",
   "license": "MIT",
   "author": {
     "name": "Daniel Ethridge",
@@ -45,6 +45,10 @@
   "bin": {
     "bruh": "./src/cli/index.mjs"
   },
+  "files": [
+    "./src/",
+    "./dist/"
+  ],
   "scripts": {
     "build": "vite build",
     "prepare": "npm run build"

package/mod.mjs

@@ -1,3 +0,0 @@
-export * as dom      from "./src/dom/index.server.mjs"
-export * as reactive from "./src/reactive/index.mjs"
-export * as util     from "./src/util/index.mjs"

package/vite.config.mjs

@@ -1,12 +0,0 @@
-import { defineConfig } from "vite"
-
-export default defineConfig({
-  build: {
-    lib: {
-      name: "bruh",
-      entry: new URL("./src/index.browser.mjs", import.meta.url).pathname,
-      fileName: format => `bruh.${format}.js`
-    },
-    sourcemap: true
-  }
-})