@hexclave/shared 1.0.40 → 1.0.42

package/dist/utils/maps.js

@@ -1,7 +1,5 @@
-Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
-const require_chunk = require('../chunk-BE-pF4vm.js');
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
 let __results_js = require("./results.js");
-
 //#region src/utils/maps.tsx
 let _Symbol$toStringTag, _Symbol$toStringTag2, _Symbol$toStringTag3;
 var WeakRefIfAvailable = class {
@@ -13,20 +11,6 @@ var WeakRefIfAvailable = class {
 		return this._ref.deref();
 	}
 };
-(void 0)?.test("WeakRefIfAvailable", ({ expect }) => {
-	const obj = {
-		id: 1,
-		name: "test"
-	};
-	expect(new WeakRefIfAvailable(obj).deref()).toBe(obj);
-	const obj2 = {
-		id: 2,
-		name: "test2"
-	};
-	const weakRef2 = new WeakRefIfAvailable(obj2);
-	expect(weakRef2.deref()).toBe(obj2);
-	expect(weakRef2.deref()).not.toBe(obj);
-});
 /**
 * A WeakMap-like object that can be iterated over.
 *
@@ -78,39 +62,6 @@ var IterableWeakMap = class {
 		}
 	}
 };
-(void 0)?.test("IterableWeakMap", ({ expect }) => {
-	const map = new IterableWeakMap();
-	const obj1 = { id: 1 };
-	const obj2 = { id: 2 };
-	map.set(obj1, "value1");
-	expect(map.get(obj1)).toBe("value1");
-	expect(map.has(obj1)).toBe(true);
-	expect(map.has(obj2)).toBe(false);
-	expect(map.has({ id: 1 })).toBe(false);
-	map.set(obj2, "value2");
-	expect(map.get(obj2)).toBe("value2");
-	expect(map.get(obj1)).toBe("value1");
-	expect(map.delete(obj1)).toBe(true);
-	expect(map.has(obj1)).toBe(false);
-	expect(map.get(obj1)).toBeUndefined();
-	expect(map.has(obj2)).toBe(true);
-	expect(map.delete({ id: 3 })).toBe(false);
-	const iterMap = new IterableWeakMap();
-	const iterObj1 = { id: 1 };
-	const iterObj2 = { id: 2 };
-	const iterObj3 = { id: 3 };
-	iterMap.set(iterObj1, 1);
-	iterMap.set(iterObj2, 2);
-	iterMap.set(iterObj3, 3);
-	const entries = Array.from(iterMap);
-	expect(entries.length).toBe(3);
-	const values = entries.map((entry) => entry[1]);
-	expect(values).toContain(1);
-	expect(values).toContain(2);
-	expect(values).toContain(3);
-	const mapWithEntries = new IterableWeakMap([[{ id: 4 }, "initial1"], [{ id: 5 }, "initial2"]]);
-	expect(Array.from(mapWithEntries).length).toBe(2);
-});
 /**
 * A map that is a IterableWeakMap for object keys and a regular Map for primitive keys. Also provides iteration over both
 * object and primitive keys.
@@ -152,35 +103,6 @@ var MaybeWeakMap = class {
 		yield* this._weakMap;
 	}
 };
-(void 0)?.test("MaybeWeakMap", ({ expect }) => {
-	const map = new MaybeWeakMap();
-	map.set("key1", 1);
-	map.set("key2", 2);
-	expect(map.get("key1")).toBe(1);
-	expect(map.get("key2")).toBe(2);
-	expect(map.has("key1")).toBe(true);
-	expect(map.has("nonexistent")).toBe(false);
-	const obj1 = { id: 1 };
-	const obj2 = { id: 2 };
-	map.set(obj1, 3);
-	map.set(obj2, 4);
-	expect(map.get(obj1)).toBe(3);
-	expect(map.get(obj2)).toBe(4);
-	expect(map.has(obj1)).toBe(true);
-	expect(map.delete("key1")).toBe(true);
-	expect(map.has("key1")).toBe(false);
-	expect(map.delete("nonexistent")).toBe(false);
-	expect(map.delete(obj1)).toBe(true);
-	expect(map.has(obj1)).toBe(false);
-	const entries = Array.from(map);
-	expect(entries.length).toBe(2);
-	expect(entries).toContainEqual(["key2", 2]);
-	expect(entries).toContainEqual([obj2, 4]);
-	const initialEntries = [["initial1", 10], [{ id: 3 }, 20]];
-	const mapWithEntries = new MaybeWeakMap(initialEntries);
-	expect(mapWithEntries.get("initial1")).toBe(10);
-	expect(mapWithEntries.get(initialEntries[1][0])).toBe(20);
-});
 /**
 * A map that stores values indexed by an array of keys. If the keys are objects and the environment supports WeakRefs,
 * they are stored in a WeakMap.
@@ -260,43 +182,10 @@ var DependenciesMap = class {
 		yield* this._iterateInner([], this._inner);
 	}
 };
-(void 0)?.test("DependenciesMap", ({ expect }) => {
-	const map = new DependenciesMap();
-	map.set(["key", 1], "value1");
-	expect(map.get(["key", 1])).toBe("value1");
-	expect(map.has(["key", 1])).toBe(true);
-	expect(map.has(["key", 2])).toBe(false);
-	map.set(["key", 2], "value2");
-	expect(map.get(["key", 2])).toBe("value2");
-	expect(map.get(["key", 1])).toBe("value1");
-	expect(map.delete(["key", 1])).toBe(true);
-	expect(map.has(["key", 1])).toBe(false);
-	expect(map.get(["key", 1])).toBeUndefined();
-	expect(map.has(["key", 2])).toBe(true);
-	expect(map.delete(["nonexistent", 1])).toBe(false);
-	map.clear();
-	expect(map.has(["key", 2])).toBe(false);
-	const objMap = new DependenciesMap();
-	const obj1 = { id: 1 };
-	const obj2 = { id: 2 };
-	objMap.set([obj1, 1], "object1");
-	objMap.set([obj2, 2], "object2");
-	expect(objMap.get([obj1, 1])).toBe("object1");
-	expect(objMap.get([obj2, 2])).toBe("object2");
-	const iterMap = new DependenciesMap();
-	iterMap.set(["a"], 1);
-	iterMap.set(["b"], 2);
-	iterMap.set(["c"], 3);
-	const entries = Array.from(iterMap);
-	expect(entries.length).toBe(3);
-	expect(entries).toContainEqual([["a"], 1]);
-	expect(entries).toContainEqual([["b"], 2]);
-	expect(entries).toContainEqual([["c"], 3]);
-});
-
 //#endregion
 exports.DependenciesMap = DependenciesMap;
 exports.IterableWeakMap = IterableWeakMap;
 exports.MaybeWeakMap = MaybeWeakMap;
 exports.WeakRefIfAvailable = WeakRefIfAvailable;
+
 //# sourceMappingURL=maps.js.map

package/dist/utils/maps.js.map

@@ -1 +1 @@
-{"version":3,"file":"maps.js","names":[],"sources":["../../src/utils/maps.tsx"],"sourcesContent":["import { Result } from \"./results\";\n\nexport class WeakRefIfAvailable<T extends object> {\n  private readonly _ref: { deref: () => T | undefined };\n\n  constructor(value: T) {\n    if (typeof WeakRef === \"undefined\") {\n      this._ref = { deref: () => value };\n    } else {\n      this._ref = new WeakRef<T>(value);\n    }\n  }\n\n  deref(): T | undefined {\n    return this._ref.deref();\n  }\n}\nimport.meta.vitest?.test(\"WeakRefIfAvailable\", ({ expect }) => {\n  // Test with an object\n  const obj = { id: 1, name: \"test\" };\n  const weakRef = new WeakRefIfAvailable(obj);\n\n  // Test deref returns the original object\n  expect(weakRef.deref()).toBe(obj);\n\n  // Test with a different object\n  const obj2 = { id: 2, name: \"test2\" };\n  const weakRef2 = new WeakRefIfAvailable(obj2);\n  expect(weakRef2.deref()).toBe(obj2);\n  expect(weakRef2.deref()).not.toBe(obj);\n\n  // We can't easily test garbage collection in this environment,\n  // but we can verify the basic functionality works\n});\n\n\n/**\n * A WeakMap-like object that can be iterated over.\n *\n * Note that it relies on WeakRef, and always falls back to the regular Map behavior (ie. no GC) in browsers that don't support it.\n */\nexport class IterableWeakMap<K extends object, V> {\n  private readonly _weakMap: WeakMap<K & WeakKey, { value: V, keyRef: WeakRefIfAvailable<K & WeakKey> }>;\n  private readonly _keyRefs: Set<WeakRefIfAvailable<K & WeakKey>>;\n\n  constructor(entries?: readonly (readonly [K, V])[] | null) {\n    const mappedEntries = entries?.map((e) => [e[0], { value: e[1], keyRef: new WeakRefIfAvailable(e[0]) }] as const);\n    this._weakMap = new WeakMap(mappedEntries ?? []);\n    this._keyRefs = new Set(mappedEntries?.map((e) => e[1].keyRef) ?? []);\n  }\n\n  get(key: K): V | undefined {\n    return this._weakMap.get(key)?.value;\n  }\n\n  set(key: K, value: V): this {\n    const existing = this._weakMap.get(key);\n    const updated = { value, keyRef: existing?.keyRef ?? new WeakRefIfAvailable(key) };\n    this._weakMap.set(key, updated);\n    this._keyRefs.add(updated.keyRef);\n    return this;\n  }\n\n  delete(key: K): boolean {\n    const res = this._weakMap.get(key);\n    if (res) {\n      this._weakMap.delete(key);\n      this._keyRefs.delete(res.keyRef);\n      return true;\n    }\n    return false;\n  }\n\n  has(key: K): boolean {\n    return this._weakMap.has(key) && this._keyRefs.has(this._weakMap.get(key)!.keyRef);\n  }\n\n  *[Symbol.iterator](): IterableIterator<[K, V]> {\n    for (const keyRef of this._keyRefs) {\n      const key = keyRef.deref();\n      const existing = key ? this._weakMap.get(key) : undefined;\n      if (!key) {\n        // This can happen if the key was GCed. Remove it so the next iteration is faster.\n        this._keyRefs.delete(keyRef);\n      } else if (existing) {\n        yield [key, existing.value];\n      }\n    }\n  }\n\n  [Symbol.toStringTag] = \"IterableWeakMap\";\n}\nimport.meta.vitest?.test(\"IterableWeakMap\", ({ expect }) => {\n  // Test basic functionality\n  const map = new IterableWeakMap<{ id: number }, string>();\n\n  // Create object keys\n  const obj1 = { id: 1 };\n  const obj2 = { id: 2 };\n\n  // Test set and get\n  map.set(obj1, \"value1\");\n  expect(map.get(obj1)).toBe(\"value1\");\n\n  // Test has\n  expect(map.has(obj1)).toBe(true);\n  expect(map.has(obj2)).toBe(false);\n  expect(map.has({ id: 1 })).toBe(false); // Different object with same content\n\n  // Test with multiple keys\n  map.set(obj2, \"value2\");\n  expect(map.get(obj2)).toBe(\"value2\");\n  expect(map.get(obj1)).toBe(\"value1\"); // Original still exists\n\n  // Test delete\n  expect(map.delete(obj1)).toBe(true);\n  expect(map.has(obj1)).toBe(false);\n  expect(map.get(obj1)).toBeUndefined();\n  expect(map.has(obj2)).toBe(true); // Other key still exists\n\n  // Test delete non-existent key\n  expect(map.delete({ id: 3 })).toBe(false);\n\n  // Test iteration\n  const iterMap = new IterableWeakMap<{ id: number }, number>();\n  const iterObj1 = { id: 1 };\n  const iterObj2 = { id: 2 };\n  const iterObj3 = { id: 3 };\n\n  iterMap.set(iterObj1, 1);\n  iterMap.set(iterObj2, 2);\n  iterMap.set(iterObj3, 3);\n\n  const entries = Array.from(iterMap);\n  expect(entries.length).toBe(3);\n\n  // Find entries by their values since we can't directly compare objects in the array\n  const values = entries.map(entry => entry[1]);\n  expect(values).toContain(1);\n  expect(values).toContain(2);\n  expect(values).toContain(3);\n\n  // Test constructor with entries\n  const initialEntries: [{ id: number }, string][] = [\n    [{ id: 4 }, \"initial1\"],\n    [{ id: 5 }, \"initial2\"]\n  ];\n  const mapWithEntries = new IterableWeakMap(initialEntries);\n\n  // We can't directly access the initial entries since they're different object references\n  // But we can verify the map has the correct number of entries\n  const entriesFromConstructor = Array.from(mapWithEntries);\n  expect(entriesFromConstructor.length).toBe(2);\n});\n\n/**\n * A map that is a IterableWeakMap for object keys and a regular Map for primitive keys. Also provides iteration over both\n * object and primitive keys.\n *\n * Note that, just like IterableWeakMap, older browsers without support for WeakRef will use a regular Map for object keys.\n */\nexport class MaybeWeakMap<K, V> {\n  private readonly _primitiveMap: Map<K, V>;\n  private readonly _weakMap: IterableWeakMap<K & WeakKey, V>;\n\n  constructor(entries?: readonly (readonly [K, V])[] | null) {\n    const entriesArray = [...entries ?? []];\n    this._primitiveMap = new Map(entriesArray.filter((e) => !this._isAllowedInWeakMap(e[0])));\n    this._weakMap = new IterableWeakMap(entriesArray.filter((e): e is [K & WeakKey, V] => this._isAllowedInWeakMap(e[0])));\n  }\n\n  private _isAllowedInWeakMap(key: K): key is K & WeakKey {\n    return (typeof key === \"object\" && key !== null) || (typeof key === \"symbol\" && Symbol.keyFor(key) === undefined);\n  }\n\n  get(key: K): V | undefined {\n    if (this._isAllowedInWeakMap(key)) {\n      return this._weakMap.get(key);\n    } else {\n      return this._primitiveMap.get(key);\n    }\n  }\n\n  set(key: K, value: V): this {\n    if (this._isAllowedInWeakMap(key)) {\n      this._weakMap.set(key, value);\n    } else {\n      this._primitiveMap.set(key, value);\n    }\n    return this;\n  }\n\n  delete(key: K): boolean {\n    if (this._isAllowedInWeakMap(key)) {\n      return this._weakMap.delete(key);\n    } else {\n      return this._primitiveMap.delete(key);\n    }\n  }\n\n  has(key: K): boolean {\n    if (this._isAllowedInWeakMap(key)) {\n      return this._weakMap.has(key);\n    } else {\n      return this._primitiveMap.has(key);\n    }\n  }\n\n  *[Symbol.iterator](): IterableIterator<[K, V]> {\n    yield* this._primitiveMap;\n    yield* this._weakMap;\n  }\n\n  [Symbol.toStringTag] = \"MaybeWeakMap\";\n}\nimport.meta.vitest?.test(\"MaybeWeakMap\", ({ expect }) => {\n  // Test with primitive keys\n  const map = new MaybeWeakMap<string | object, number>();\n\n  // Test with string keys\n  map.set(\"key1\", 1);\n  map.set(\"key2\", 2);\n  expect(map.get(\"key1\")).toBe(1);\n  expect(map.get(\"key2\")).toBe(2);\n  expect(map.has(\"key1\")).toBe(true);\n  expect(map.has(\"nonexistent\")).toBe(false);\n\n  // Test with object keys\n  const obj1 = { id: 1 };\n  const obj2 = { id: 2 };\n  map.set(obj1, 3);\n  map.set(obj2, 4);\n  expect(map.get(obj1)).toBe(3);\n  expect(map.get(obj2)).toBe(4);\n  expect(map.has(obj1)).toBe(true);\n\n  // Test delete with primitive key\n  expect(map.delete(\"key1\")).toBe(true);\n  expect(map.has(\"key1\")).toBe(false);\n  expect(map.delete(\"nonexistent\")).toBe(false);\n\n  // Test delete with object key\n  expect(map.delete(obj1)).toBe(true);\n  expect(map.has(obj1)).toBe(false);\n\n  // Test iteration\n  const entries = Array.from(map);\n  expect(entries.length).toBe(2);\n  expect(entries).toContainEqual([\"key2\", 2]);\n  expect(entries).toContainEqual([obj2, 4]);\n\n  // Test constructor with entries\n  const initialEntries: [string | object, number][] = [\n    [\"initial1\", 10],\n    [{ id: 3 }, 20]\n  ];\n  const mapWithEntries = new MaybeWeakMap(initialEntries);\n  expect(mapWithEntries.get(\"initial1\")).toBe(10);\n  expect(mapWithEntries.get(initialEntries[1][0])).toBe(20);\n});\n\n\ntype DependenciesMapInner<V> = (\n  & { map: MaybeWeakMap<unknown, DependenciesMapInner<V>> }\n  & (\n    | { hasValue: true, value: V }\n    | { hasValue: false, value: undefined }\n  )\n);\n\n/**\n * A map that stores values indexed by an array of keys. If the keys are objects and the environment supports WeakRefs,\n * they are stored in a WeakMap.\n */\nexport class DependenciesMap<K extends any[], V> {\n  private _inner: DependenciesMapInner<V> = { map: new MaybeWeakMap(), hasValue: false, value: undefined };\n\n  private _valueToResult(inner: DependenciesMapInner<V>): Result<V, void> {\n    if (inner.hasValue) {\n      return Result.ok(inner.value);\n    } else {\n      return Result.error(undefined);\n    }\n  }\n\n\n  private _unwrapFromInner(dependencies: any[], inner: DependenciesMapInner<V>): Result<V, void> {\n    if ((dependencies.length === 0)) {\n      return this._valueToResult(inner);\n    } else {\n      const [key, ...rest] = dependencies;\n      const newInner = inner.map.get(key);\n      if (!newInner) {\n        return Result.error(undefined);\n      }\n      return this._unwrapFromInner(rest, newInner);\n    }\n  }\n\n  private _setInInner(dependencies: any[], value: Result<V, void>, inner: DependenciesMapInner<V>): Result<V, void> {\n    if (dependencies.length === 0) {\n      const res = this._valueToResult(inner);\n      if (value.status === \"ok\") {\n        inner.hasValue = true;\n        inner.value = value.data;\n      } else {\n        inner.hasValue = false;\n        inner.value = undefined;\n      }\n      return res;\n    } else {\n      const [key, ...rest] = dependencies;\n      let newInner = inner.map.get(key);\n      if (!newInner) {\n        inner.map.set(key, newInner = { map: new MaybeWeakMap(), hasValue: false, value: undefined });\n      }\n      return this._setInInner(rest, value, newInner);\n    }\n  }\n\n  private *_iterateInner(dependencies: any[], inner: DependenciesMapInner<V>): IterableIterator<[K, V]> {\n    if (inner.hasValue) {\n      yield [dependencies as K, inner.value];\n    }\n    for (const [key, value] of inner.map) {\n      yield* this._iterateInner([...dependencies, key], value);\n    }\n  }\n\n  get(dependencies: K): V | undefined {\n    return Result.or(this._unwrapFromInner(dependencies, this._inner), undefined);\n  }\n\n  set(dependencies: K, value: V): this {\n    this._setInInner(dependencies, Result.ok(value), this._inner);\n    return this;\n  }\n\n  delete(dependencies: K): boolean {\n    return this._setInInner(dependencies, Result.error(undefined), this._inner).status === \"ok\";\n  }\n\n  has(dependencies: K): boolean {\n    return this._unwrapFromInner(dependencies, this._inner).status === \"ok\";\n  }\n\n  clear(): void {\n    this._inner = { map: new MaybeWeakMap(), hasValue: false, value: undefined };\n  }\n\n  *[Symbol.iterator](): IterableIterator<[K, V]> {\n    yield* this._iterateInner([], this._inner);\n  }\n\n  [Symbol.toStringTag] = \"DependenciesMap\";\n}\nimport.meta.vitest?.test(\"DependenciesMap\", ({ expect }) => {\n  // Test basic functionality\n  const map = new DependenciesMap<[string, number], string>();\n\n  // Test set and get\n  map.set([\"key\", 1], \"value1\");\n  expect(map.get([\"key\", 1])).toBe(\"value1\");\n\n  // Test has\n  expect(map.has([\"key\", 1])).toBe(true);\n  expect(map.has([\"key\", 2])).toBe(false);\n\n  // Test with different dependencies\n  map.set([\"key\", 2], \"value2\");\n  expect(map.get([\"key\", 2])).toBe(\"value2\");\n  expect(map.get([\"key\", 1])).toBe(\"value1\"); // Original still exists\n\n  // Test delete\n  expect(map.delete([\"key\", 1])).toBe(true);\n  expect(map.has([\"key\", 1])).toBe(false);\n  expect(map.get([\"key\", 1])).toBeUndefined();\n  expect(map.has([\"key\", 2])).toBe(true); // Other key still exists\n\n  // Test delete non-existent key\n  expect(map.delete([\"nonexistent\", 1])).toBe(false);\n\n  // Test clear\n  map.clear();\n  expect(map.has([\"key\", 2])).toBe(false);\n\n  // Test with object keys\n  const objMap = new DependenciesMap<[object, number], string>();\n  const obj1 = { id: 1 };\n  const obj2 = { id: 2 };\n  objMap.set([obj1, 1], \"object1\");\n  objMap.set([obj2, 2], \"object2\");\n  expect(objMap.get([obj1, 1])).toBe(\"object1\");\n  expect(objMap.get([obj2, 2])).toBe(\"object2\");\n\n  // Test iteration\n  const iterMap = new DependenciesMap<[string], number>();\n  iterMap.set([\"a\"], 1);\n  iterMap.set([\"b\"], 2);\n  iterMap.set([\"c\"], 3);\n\n  const entries = Array.from(iterMap);\n  expect(entries.length).toBe(3);\n  expect(entries).toContainEqual([[\"a\"], 1]);\n  expect(entries).toContainEqual([[\"b\"], 2]);\n  expect(entries).toContainEqual([[\"c\"], 3]);\n});\n"],"mappings":";;;;;;AAEA,IAAa,qBAAb,MAAkD;CAGhD,YAAY,OAAU;AACpB,MAAI,OAAO,YAAY,YACrB,MAAK,OAAO,EAAE,aAAa,OAAO;MAElC,MAAK,OAAO,IAAI,QAAW,MAAM;;CAIrC,QAAuB;AACrB,SAAO,KAAK,KAAK,OAAO;;;CAG5B,SAAW,KAAC,uBAAc,EAAA,aAAwB;CAEhD,MAAM,MAAM;EAAE,IAAI;EAAG,MAAM;EAAQ;AAInC,QAHgB,IAAI,mBAAmB,IAAI,CAG5B,OAAO,CAAC,CAAC,KAAK,IAAI;CAGjC,MAAM,OAAO;EAAE,IAAI;EAAG,MAAM;EAAS;CACrC,MAAM,WAAW,IAAI,mBAAmB,KAAK;AAC7C,QAAO,SAAS,OAAO,CAAC,CAAC,KAAK,KAAK;AACnC,QAAO,SAAS,OAAO,CAAC,CAAC,IAAI,KAAK,IAAI;EAItC;;;;;;AAQF,IAAa,kBAAb,MAAkD;;wBAiD/C,OAAO;;CA7CR,YAAY,SAA+C;8BA6CpC;EA5CrB,MAAM,gBAAgB,SAAS,KAAK,MAAM,CAAC,EAAE,IAAI;GAAE,OAAO,EAAE;GAAI,QAAQ,IAAI,mBAAmB,EAAE,GAAG;GAAE,CAAC,CAAU;AACjH,OAAK,WAAW,IAAI,QAAQ,iBAAiB,EAAE,CAAC;AAChD,OAAK,WAAW,IAAI,IAAI,eAAe,KAAK,MAAM,EAAE,GAAG,OAAO,IAAI,EAAE,CAAC;;CAGvE,IAAI,KAAuB;AACzB,SAAO,KAAK,SAAS,IAAI,IAAI,EAAE;;CAGjC,IAAI,KAAQ,OAAgB;EAE1B,MAAM,UAAU;GAAE;GAAO,QADR,KAAK,SAAS,IAAI,IAAI,EACI,UAAU,IAAI,mBAAmB,IAAI;GAAE;AAClF,OAAK,SAAS,IAAI,KAAK,QAAQ;AAC/B,OAAK,SAAS,IAAI,QAAQ,OAAO;AACjC,SAAO;;CAGT,OAAO,KAAiB;EACtB,MAAM,MAAM,KAAK,SAAS,IAAI,IAAI;AAClC,MAAI,KAAK;AACP,QAAK,SAAS,OAAO,IAAI;AACzB,QAAK,SAAS,OAAO,IAAI,OAAO;AAChC,UAAO;;AAET,SAAO;;CAGT,IAAI,KAAiB;AACnB,SAAO,KAAK,SAAS,IAAI,IAAI,IAAI,KAAK,SAAS,IAAI,KAAK,SAAS,IAAI,IAAI,CAAE,OAAO;;CAGpF,EAAE,OAAO,YAAsC;AAC7C,OAAK,MAAM,UAAU,KAAK,UAAU;GAClC,MAAM,MAAM,OAAO,OAAO;GAC1B,MAAM,WAAW,MAAM,KAAK,SAAS,IAAI,IAAI,GAAG;AAChD,OAAI,CAAC,IAEH,MAAK,SAAS,OAAO,OAAO;YACnB,SACT,OAAM,CAAC,KAAK,SAAS,MAAM;;;;CAOnC,SAAW,KAAC,oBAAc,EAAA,aAAqB;CAE7C,MAAM,MAAM,IAAI,iBAAyC;CAGzD,MAAM,OAAO,EAAE,IAAI,GAAG;CACtB,MAAM,OAAO,EAAE,IAAI,GAAG;AAGtB,KAAI,IAAI,MAAM,SAAS;AACvB,QAAO,IAAI,IAAI,KAAK,CAAC,CAAC,KAAK,SAAS;AAGpC,QAAO,IAAI,IAAI,KAAK,CAAC,CAAC,KAAK,KAAK;AAChC,QAAO,IAAI,IAAI,KAAK,CAAC,CAAC,KAAK,MAAM;AACjC,QAAO,IAAI,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,MAAM;AAGtC,KAAI,IAAI,MAAM,SAAS;AACvB,QAAO,IAAI,IAAI,KAAK,CAAC,CAAC,KAAK,SAAS;AACpC,QAAO,IAAI,IAAI,KAAK,CAAC,CAAC,KAAK,SAAS;AAGpC,QAAO,IAAI,OAAO,KAAK,CAAC,CAAC,KAAK,KAAK;AACnC,QAAO,IAAI,IAAI,KAAK,CAAC,CAAC,KAAK,MAAM;AACjC,QAAO,IAAI,IAAI,KAAK,CAAC,CAAC,eAAe;AACrC,QAAO,IAAI,IAAI,KAAK,CAAC,CAAC,KAAK,KAAK;AAGhC,QAAO,IAAI,OAAO,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,MAAM;CAGzC,MAAM,UAAU,IAAI,iBAAyC;CAC7D,MAAM,WAAW,EAAE,IAAI,GAAG;CAC1B,MAAM,WAAW,EAAE,IAAI,GAAG;CAC1B,MAAM,WAAW,EAAE,IAAI,GAAG;AAE1B,SAAQ,IAAI,UAAU,EAAE;AACxB,SAAQ,IAAI,UAAU,EAAE;AACxB,SAAQ,IAAI,UAAU,EAAE;CAExB,MAAM,UAAU,MAAM,KAAK,QAAQ;AACnC,QAAO,QAAQ,OAAO,CAAC,KAAK,EAAE;CAG9B,MAAM,SAAS,QAAQ,KAAI,UAAS,MAAM,GAAG;AAC7C,QAAO,OAAO,CAAC,UAAU,EAAE;AAC3B,QAAO,OAAO,CAAC,UAAU,EAAE;AAC3B,QAAO,OAAO,CAAC,UAAU,EAAE;CAO3B,MAAM,iBAAiB,IAAI,gBAJwB,CACjD,CAAC,EAAE,IAAI,GAAG,EAAE,WAAW,EACvB,CAAC,EAAE,IAAI,GAAG,EAAE,WAAU,CACvB,CACyD;AAK1D,QAD+B,MAAM,KAAK,eAAe,CAC3B,OAAO,CAAC,KAAK,EAAE;EAC7C;;;;;;;AAQF,IAAa,eAAb,MAAgC;;yBAoD7B,OAAO;;CAhDR,YAAY,SAA+C;+BAgDpC;EA/CrB,MAAM,eAAe,CAAC,GAAG,WAAW,EAAE,CAAC;AACvC,OAAK,gBAAgB,IAAI,IAAI,aAAa,QAAQ,MAAM,CAAC,KAAK,oBAAoB,EAAE,GAAG,CAAC,CAAC;AACzF,OAAK,WAAW,IAAI,gBAAgB,aAAa,QAAQ,MAA6B,KAAK,oBAAoB,EAAE,GAAG,CAAC,CAAC;;CAGxH,AAAQ,oBAAoB,KAA4B;AACtD,SAAQ,OAAO,QAAQ,YAAY,QAAQ,QAAU,OAAO,QAAQ,YAAY,OAAO,OAAO,IAAI,KAAK;;CAGzG,IAAI,KAAuB;AACzB,MAAI,KAAK,oBAAoB,IAAI,CAC/B,QAAO,KAAK,SAAS,IAAI,IAAI;MAE7B,QAAO,KAAK,cAAc,IAAI,IAAI;;CAItC,IAAI,KAAQ,OAAgB;AAC1B,MAAI,KAAK,oBAAoB,IAAI,CAC/B,MAAK,SAAS,IAAI,KAAK,MAAM;MAE7B,MAAK,cAAc,IAAI,KAAK,MAAM;AAEpC,SAAO;;CAGT,OAAO,KAAiB;AACtB,MAAI,KAAK,oBAAoB,IAAI,CAC/B,QAAO,KAAK,SAAS,OAAO,IAAI;MAEhC,QAAO,KAAK,cAAc,OAAO,IAAI;;CAIzC,IAAI,KAAiB;AACnB,MAAI,KAAK,oBAAoB,IAAI,CAC/B,QAAO,KAAK,SAAS,IAAI,IAAI;MAE7B,QAAO,KAAK,cAAc,IAAI,IAAI;;CAItC,EAAE,OAAO,YAAsC;AAC7C,SAAO,KAAK;AACZ,SAAO,KAAK;;;CAKhB,SAAW,KAAC,iBAAc,EAAA,aAAkB;CAE1C,MAAM,MAAM,IAAI,cAAuC;AAGvD,KAAI,IAAI,QAAQ,EAAE;AAClB,KAAI,IAAI,QAAQ,EAAE;AAClB,QAAO,IAAI,IAAI,OAAO,CAAC,CAAC,KAAK,EAAE;AAC/B,QAAO,IAAI,IAAI,OAAO,CAAC,CAAC,KAAK,EAAE;AAC/B,QAAO,IAAI,IAAI,OAAO,CAAC,CAAC,KAAK,KAAK;AAClC,QAAO,IAAI,IAAI,cAAc,CAAC,CAAC,KAAK,MAAM;CAG1C,MAAM,OAAO,EAAE,IAAI,GAAG;CACtB,MAAM,OAAO,EAAE,IAAI,GAAG;AACtB,KAAI,IAAI,MAAM,EAAE;AAChB,KAAI,IAAI,MAAM,EAAE;AAChB,QAAO,IAAI,IAAI,KAAK,CAAC,CAAC,KAAK,EAAE;AAC7B,QAAO,IAAI,IAAI,KAAK,CAAC,CAAC,KAAK,EAAE;AAC7B,QAAO,IAAI,IAAI,KAAK,CAAC,CAAC,KAAK,KAAK;AAGhC,QAAO,IAAI,OAAO,OAAO,CAAC,CAAC,KAAK,KAAK;AACrC,QAAO,IAAI,IAAI,OAAO,CAAC,CAAC,KAAK,MAAM;AACnC,QAAO,IAAI,OAAO,cAAc,CAAC,CAAC,KAAK,MAAM;AAG7C,QAAO,IAAI,OAAO,KAAK,CAAC,CAAC,KAAK,KAAK;AACnC,QAAO,IAAI,IAAI,KAAK,CAAC,CAAC,KAAK,MAAM;CAGjC,MAAM,UAAU,MAAM,KAAK,IAAI;AAC/B,QAAO,QAAQ,OAAO,CAAC,KAAK,EAAE;AAC9B,QAAO,QAAQ,CAAC,eAAe,CAAC,QAAQ,EAAE,CAAC;AAC3C,QAAO,QAAQ,CAAC,eAAe,CAAC,MAAM,EAAE,CAAC;CAGzC,MAAM,iBAA8C,CAClD,CAAC,YAAY,GAAG,EAChB,CAAC,EAAE,IAAI,GAAG,EAAE,GAAE,CACf;CACD,MAAM,iBAAiB,IAAI,aAAa,eAAe;AACvD,QAAO,eAAe,IAAI,WAAW,CAAC,CAAC,KAAK,GAAG;AAC/C,QAAO,eAAe,IAAI,eAAe,GAAG,GAAG,CAAC,CAAC,KAAK,GAAG;EACzD;;;;;AAeF,IAAa,kBAAb,MAAiD;;gBACL;GAAE,KAAK,IAAI,cAAc;GAAE,UAAU;GAAO,OAAO;GAAW;+BA+EjF;;;yBAAtB,OAAO;;CA7ER,AAAQ,eAAe,OAAiD;AACtE,MAAI,MAAM,SACR,QAAO,oBAAO,GAAG,MAAM,MAAM;MAE7B,QAAO,oBAAO,MAAM,OAAU;;CAKlC,AAAQ,iBAAiB,cAAqB,OAAiD;AAC7F,MAAK,aAAa,WAAW,EAC3B,QAAO,KAAK,eAAe,MAAM;OAC5B;GACL,MAAM,CAAC,KAAK,GAAG,QAAQ;GACvB,MAAM,WAAW,MAAM,IAAI,IAAI,IAAI;AACnC,OAAI,CAAC,SACH,QAAO,oBAAO,MAAM,OAAU;AAEhC,UAAO,KAAK,iBAAiB,MAAM,SAAS;;;CAIhD,AAAQ,YAAY,cAAqB,OAAwB,OAAiD;AAChH,MAAI,aAAa,WAAW,GAAG;GAC7B,MAAM,MAAM,KAAK,eAAe,MAAM;AACtC,OAAI,MAAM,WAAW,MAAM;AACzB,UAAM,WAAW;AACjB,UAAM,QAAQ,MAAM;UACf;AACL,UAAM,WAAW;AACjB,UAAM,QAAQ;;AAEhB,UAAO;SACF;GACL,MAAM,CAAC,KAAK,GAAG,QAAQ;GACvB,IAAI,WAAW,MAAM,IAAI,IAAI,IAAI;AACjC,OAAI,CAAC,SACH,OAAM,IAAI,IAAI,KAAK,WAAW;IAAE,KAAK,IAAI,cAAc;IAAE,UAAU;IAAO,OAAO;IAAW,CAAC;AAE/F,UAAO,KAAK,YAAY,MAAM,OAAO,SAAS;;;CAIlD,CAAS,cAAc,cAAqB,OAA0D;AACpG,MAAI,MAAM,SACR,OAAM,CAAC,cAAmB,MAAM,MAAM;AAExC,OAAK,MAAM,CAAC,KAAK,UAAU,MAAM,IAC/B,QAAO,KAAK,cAAc,CAAC,GAAG,cAAc,IAAI,EAAE,MAAM;;CAI5D,IAAI,cAAgC;AAClC,SAAO,oBAAO,GAAG,KAAK,iBAAiB,cAAc,KAAK,OAAO,EAAE,OAAU;;CAG/E,IAAI,cAAiB,OAAgB;AACnC,OAAK,YAAY,cAAc,oBAAO,GAAG,MAAM,EAAE,KAAK,OAAO;AAC7D,SAAO;;CAGT,OAAO,cAA0B;AAC/B,SAAO,KAAK,YAAY,cAAc,oBAAO,MAAM,OAAU,EAAE,KAAK,OAAO,CAAC,WAAW;;CAGzF,IAAI,cAA0B;AAC5B,SAAO,KAAK,iBAAiB,cAAc,KAAK,OAAO,CAAC,WAAW;;CAGrE,QAAc;AACZ,OAAK,SAAS;GAAE,KAAK,IAAI,cAAc;GAAE,UAAU;GAAO,OAAO;GAAW;;CAG9E,EAAE,OAAO,YAAsC;AAC7C,SAAO,KAAK,cAAc,EAAE,EAAE,KAAK,OAAO;;;CAK9C,SAAW,KAAC,oBAAc,EAAA,aAAqB;CAE7C,MAAM,MAAM,IAAI,iBAA2C;AAG3D,KAAI,IAAI,CAAC,OAAO,EAAE,EAAE,SAAS;AAC7B,QAAO,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,SAAS;AAG1C,QAAO,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK;AACtC,QAAO,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,MAAM;AAGvC,KAAI,IAAI,CAAC,OAAO,EAAE,EAAE,SAAS;AAC7B,QAAO,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,SAAS;AAC1C,QAAO,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,SAAS;AAG1C,QAAO,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK;AACzC,QAAO,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,MAAM;AACvC,QAAO,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,eAAe;AAC3C,QAAO,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK;AAGtC,QAAO,IAAI,OAAO,CAAC,eAAe,EAAE,CAAC,CAAC,CAAC,KAAK,MAAM;AAGlD,KAAI,OAAO;AACX,QAAO,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,MAAM;CAGvC,MAAM,SAAS,IAAI,iBAA2C;CAC9D,MAAM,OAAO,EAAE,IAAI,GAAG;CACtB,MAAM,OAAO,EAAE,IAAI,GAAG;AACtB,QAAO,IAAI,CAAC,MAAM,EAAE,EAAE,UAAU;AAChC,QAAO,IAAI,CAAC,MAAM,EAAE,EAAE,UAAU;AAChC,QAAO,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,KAAK,UAAU;AAC7C,QAAO,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,KAAK,UAAU;CAG7C,MAAM,UAAU,IAAI,iBAAmC;AACvD,SAAQ,IAAI,CAAC,IAAI,EAAE,EAAE;AACrB,SAAQ,IAAI,CAAC,IAAI,EAAE,EAAE;AACrB,SAAQ,IAAI,CAAC,IAAI,EAAE,EAAE;CAErB,MAAM,UAAU,MAAM,KAAK,QAAQ;AACnC,QAAO,QAAQ,OAAO,CAAC,KAAK,EAAE;AAC9B,QAAO,QAAQ,CAAC,eAAe,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;AAC1C,QAAO,QAAQ,CAAC,eAAe,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;AAC1C,QAAO,QAAQ,CAAC,eAAe,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;EAC1C"}
+{"version":3,"file":"maps.js","names":["Result"],"sources":["../../src/utils/maps.tsx"],"sourcesContent":["import { Result } from \"./results\";\n\nexport class WeakRefIfAvailable<T extends object> {\n  private readonly _ref: { deref: () => T | undefined };\n\n  constructor(value: T) {\n    if (typeof WeakRef === \"undefined\") {\n      this._ref = { deref: () => value };\n    } else {\n      this._ref = new WeakRef<T>(value);\n    }\n  }\n\n  deref(): T | undefined {\n    return this._ref.deref();\n  }\n}\nimport.meta.vitest?.test(\"WeakRefIfAvailable\", ({ expect }) => {\n  // Test with an object\n  const obj = { id: 1, name: \"test\" };\n  const weakRef = new WeakRefIfAvailable(obj);\n\n  // Test deref returns the original object\n  expect(weakRef.deref()).toBe(obj);\n\n  // Test with a different object\n  const obj2 = { id: 2, name: \"test2\" };\n  const weakRef2 = new WeakRefIfAvailable(obj2);\n  expect(weakRef2.deref()).toBe(obj2);\n  expect(weakRef2.deref()).not.toBe(obj);\n\n  // We can't easily test garbage collection in this environment,\n  // but we can verify the basic functionality works\n});\n\n\n/**\n * A WeakMap-like object that can be iterated over.\n *\n * Note that it relies on WeakRef, and always falls back to the regular Map behavior (ie. no GC) in browsers that don't support it.\n */\nexport class IterableWeakMap<K extends object, V> {\n  private readonly _weakMap: WeakMap<K & WeakKey, { value: V, keyRef: WeakRefIfAvailable<K & WeakKey> }>;\n  private readonly _keyRefs: Set<WeakRefIfAvailable<K & WeakKey>>;\n\n  constructor(entries?: readonly (readonly [K, V])[] | null) {\n    const mappedEntries = entries?.map((e) => [e[0], { value: e[1], keyRef: new WeakRefIfAvailable(e[0]) }] as const);\n    this._weakMap = new WeakMap(mappedEntries ?? []);\n    this._keyRefs = new Set(mappedEntries?.map((e) => e[1].keyRef) ?? []);\n  }\n\n  get(key: K): V | undefined {\n    return this._weakMap.get(key)?.value;\n  }\n\n  set(key: K, value: V): this {\n    const existing = this._weakMap.get(key);\n    const updated = { value, keyRef: existing?.keyRef ?? new WeakRefIfAvailable(key) };\n    this._weakMap.set(key, updated);\n    this._keyRefs.add(updated.keyRef);\n    return this;\n  }\n\n  delete(key: K): boolean {\n    const res = this._weakMap.get(key);\n    if (res) {\n      this._weakMap.delete(key);\n      this._keyRefs.delete(res.keyRef);\n      return true;\n    }\n    return false;\n  }\n\n  has(key: K): boolean {\n    return this._weakMap.has(key) && this._keyRefs.has(this._weakMap.get(key)!.keyRef);\n  }\n\n  *[Symbol.iterator](): IterableIterator<[K, V]> {\n    for (const keyRef of this._keyRefs) {\n      const key = keyRef.deref();\n      const existing = key ? this._weakMap.get(key) : undefined;\n      if (!key) {\n        // This can happen if the key was GCed. Remove it so the next iteration is faster.\n        this._keyRefs.delete(keyRef);\n      } else if (existing) {\n        yield [key, existing.value];\n      }\n    }\n  }\n\n  [Symbol.toStringTag] = \"IterableWeakMap\";\n}\nimport.meta.vitest?.test(\"IterableWeakMap\", ({ expect }) => {\n  // Test basic functionality\n  const map = new IterableWeakMap<{ id: number }, string>();\n\n  // Create object keys\n  const obj1 = { id: 1 };\n  const obj2 = { id: 2 };\n\n  // Test set and get\n  map.set(obj1, \"value1\");\n  expect(map.get(obj1)).toBe(\"value1\");\n\n  // Test has\n  expect(map.has(obj1)).toBe(true);\n  expect(map.has(obj2)).toBe(false);\n  expect(map.has({ id: 1 })).toBe(false); // Different object with same content\n\n  // Test with multiple keys\n  map.set(obj2, \"value2\");\n  expect(map.get(obj2)).toBe(\"value2\");\n  expect(map.get(obj1)).toBe(\"value1\"); // Original still exists\n\n  // Test delete\n  expect(map.delete(obj1)).toBe(true);\n  expect(map.has(obj1)).toBe(false);\n  expect(map.get(obj1)).toBeUndefined();\n  expect(map.has(obj2)).toBe(true); // Other key still exists\n\n  // Test delete non-existent key\n  expect(map.delete({ id: 3 })).toBe(false);\n\n  // Test iteration\n  const iterMap = new IterableWeakMap<{ id: number }, number>();\n  const iterObj1 = { id: 1 };\n  const iterObj2 = { id: 2 };\n  const iterObj3 = { id: 3 };\n\n  iterMap.set(iterObj1, 1);\n  iterMap.set(iterObj2, 2);\n  iterMap.set(iterObj3, 3);\n\n  const entries = Array.from(iterMap);\n  expect(entries.length).toBe(3);\n\n  // Find entries by their values since we can't directly compare objects in the array\n  const values = entries.map(entry => entry[1]);\n  expect(values).toContain(1);\n  expect(values).toContain(2);\n  expect(values).toContain(3);\n\n  // Test constructor with entries\n  const initialEntries: [{ id: number }, string][] = [\n    [{ id: 4 }, \"initial1\"],\n    [{ id: 5 }, \"initial2\"]\n  ];\n  const mapWithEntries = new IterableWeakMap(initialEntries);\n\n  // We can't directly access the initial entries since they're different object references\n  // But we can verify the map has the correct number of entries\n  const entriesFromConstructor = Array.from(mapWithEntries);\n  expect(entriesFromConstructor.length).toBe(2);\n});\n\n/**\n * A map that is a IterableWeakMap for object keys and a regular Map for primitive keys. Also provides iteration over both\n * object and primitive keys.\n *\n * Note that, just like IterableWeakMap, older browsers without support for WeakRef will use a regular Map for object keys.\n */\nexport class MaybeWeakMap<K, V> {\n  private readonly _primitiveMap: Map<K, V>;\n  private readonly _weakMap: IterableWeakMap<K & WeakKey, V>;\n\n  constructor(entries?: readonly (readonly [K, V])[] | null) {\n    const entriesArray = [...entries ?? []];\n    this._primitiveMap = new Map(entriesArray.filter((e) => !this._isAllowedInWeakMap(e[0])));\n    this._weakMap = new IterableWeakMap(entriesArray.filter((e): e is [K & WeakKey, V] => this._isAllowedInWeakMap(e[0])));\n  }\n\n  private _isAllowedInWeakMap(key: K): key is K & WeakKey {\n    return (typeof key === \"object\" && key !== null) || (typeof key === \"symbol\" && Symbol.keyFor(key) === undefined);\n  }\n\n  get(key: K): V | undefined {\n    if (this._isAllowedInWeakMap(key)) {\n      return this._weakMap.get(key);\n    } else {\n      return this._primitiveMap.get(key);\n    }\n  }\n\n  set(key: K, value: V): this {\n    if (this._isAllowedInWeakMap(key)) {\n      this._weakMap.set(key, value);\n    } else {\n      this._primitiveMap.set(key, value);\n    }\n    return this;\n  }\n\n  delete(key: K): boolean {\n    if (this._isAllowedInWeakMap(key)) {\n      return this._weakMap.delete(key);\n    } else {\n      return this._primitiveMap.delete(key);\n    }\n  }\n\n  has(key: K): boolean {\n    if (this._isAllowedInWeakMap(key)) {\n      return this._weakMap.has(key);\n    } else {\n      return this._primitiveMap.has(key);\n    }\n  }\n\n  *[Symbol.iterator](): IterableIterator<[K, V]> {\n    yield* this._primitiveMap;\n    yield* this._weakMap;\n  }\n\n  [Symbol.toStringTag] = \"MaybeWeakMap\";\n}\nimport.meta.vitest?.test(\"MaybeWeakMap\", ({ expect }) => {\n  // Test with primitive keys\n  const map = new MaybeWeakMap<string | object, number>();\n\n  // Test with string keys\n  map.set(\"key1\", 1);\n  map.set(\"key2\", 2);\n  expect(map.get(\"key1\")).toBe(1);\n  expect(map.get(\"key2\")).toBe(2);\n  expect(map.has(\"key1\")).toBe(true);\n  expect(map.has(\"nonexistent\")).toBe(false);\n\n  // Test with object keys\n  const obj1 = { id: 1 };\n  const obj2 = { id: 2 };\n  map.set(obj1, 3);\n  map.set(obj2, 4);\n  expect(map.get(obj1)).toBe(3);\n  expect(map.get(obj2)).toBe(4);\n  expect(map.has(obj1)).toBe(true);\n\n  // Test delete with primitive key\n  expect(map.delete(\"key1\")).toBe(true);\n  expect(map.has(\"key1\")).toBe(false);\n  expect(map.delete(\"nonexistent\")).toBe(false);\n\n  // Test delete with object key\n  expect(map.delete(obj1)).toBe(true);\n  expect(map.has(obj1)).toBe(false);\n\n  // Test iteration\n  const entries = Array.from(map);\n  expect(entries.length).toBe(2);\n  expect(entries).toContainEqual([\"key2\", 2]);\n  expect(entries).toContainEqual([obj2, 4]);\n\n  // Test constructor with entries\n  const initialEntries: [string | object, number][] = [\n    [\"initial1\", 10],\n    [{ id: 3 }, 20]\n  ];\n  const mapWithEntries = new MaybeWeakMap(initialEntries);\n  expect(mapWithEntries.get(\"initial1\")).toBe(10);\n  expect(mapWithEntries.get(initialEntries[1][0])).toBe(20);\n});\n\n\ntype DependenciesMapInner<V> = (\n  & { map: MaybeWeakMap<unknown, DependenciesMapInner<V>> }\n  & (\n    | { hasValue: true, value: V }\n    | { hasValue: false, value: undefined }\n  )\n);\n\n/**\n * A map that stores values indexed by an array of keys. If the keys are objects and the environment supports WeakRefs,\n * they are stored in a WeakMap.\n */\nexport class DependenciesMap<K extends any[], V> {\n  private _inner: DependenciesMapInner<V> = { map: new MaybeWeakMap(), hasValue: false, value: undefined };\n\n  private _valueToResult(inner: DependenciesMapInner<V>): Result<V, void> {\n    if (inner.hasValue) {\n      return Result.ok(inner.value);\n    } else {\n      return Result.error(undefined);\n    }\n  }\n\n\n  private _unwrapFromInner(dependencies: any[], inner: DependenciesMapInner<V>): Result<V, void> {\n    if ((dependencies.length === 0)) {\n      return this._valueToResult(inner);\n    } else {\n      const [key, ...rest] = dependencies;\n      const newInner = inner.map.get(key);\n      if (!newInner) {\n        return Result.error(undefined);\n      }\n      return this._unwrapFromInner(rest, newInner);\n    }\n  }\n\n  private _setInInner(dependencies: any[], value: Result<V, void>, inner: DependenciesMapInner<V>): Result<V, void> {\n    if (dependencies.length === 0) {\n      const res = this._valueToResult(inner);\n      if (value.status === \"ok\") {\n        inner.hasValue = true;\n        inner.value = value.data;\n      } else {\n        inner.hasValue = false;\n        inner.value = undefined;\n      }\n      return res;\n    } else {\n      const [key, ...rest] = dependencies;\n      let newInner = inner.map.get(key);\n      if (!newInner) {\n        inner.map.set(key, newInner = { map: new MaybeWeakMap(), hasValue: false, value: undefined });\n      }\n      return this._setInInner(rest, value, newInner);\n    }\n  }\n\n  private *_iterateInner(dependencies: any[], inner: DependenciesMapInner<V>): IterableIterator<[K, V]> {\n    if (inner.hasValue) {\n      yield [dependencies as K, inner.value];\n    }\n    for (const [key, value] of inner.map) {\n      yield* this._iterateInner([...dependencies, key], value);\n    }\n  }\n\n  get(dependencies: K): V | undefined {\n    return Result.or(this._unwrapFromInner(dependencies, this._inner), undefined);\n  }\n\n  set(dependencies: K, value: V): this {\n    this._setInInner(dependencies, Result.ok(value), this._inner);\n    return this;\n  }\n\n  delete(dependencies: K): boolean {\n    return this._setInInner(dependencies, Result.error(undefined), this._inner).status === \"ok\";\n  }\n\n  has(dependencies: K): boolean {\n    return this._unwrapFromInner(dependencies, this._inner).status === \"ok\";\n  }\n\n  clear(): void {\n    this._inner = { map: new MaybeWeakMap(), hasValue: false, value: undefined };\n  }\n\n  *[Symbol.iterator](): IterableIterator<[K, V]> {\n    yield* this._iterateInner([], this._inner);\n  }\n\n  [Symbol.toStringTag] = \"DependenciesMap\";\n}\nimport.meta.vitest?.test(\"DependenciesMap\", ({ expect }) => {\n  // Test basic functionality\n  const map = new DependenciesMap<[string, number], string>();\n\n  // Test set and get\n  map.set([\"key\", 1], \"value1\");\n  expect(map.get([\"key\", 1])).toBe(\"value1\");\n\n  // Test has\n  expect(map.has([\"key\", 1])).toBe(true);\n  expect(map.has([\"key\", 2])).toBe(false);\n\n  // Test with different dependencies\n  map.set([\"key\", 2], \"value2\");\n  expect(map.get([\"key\", 2])).toBe(\"value2\");\n  expect(map.get([\"key\", 1])).toBe(\"value1\"); // Original still exists\n\n  // Test delete\n  expect(map.delete([\"key\", 1])).toBe(true);\n  expect(map.has([\"key\", 1])).toBe(false);\n  expect(map.get([\"key\", 1])).toBeUndefined();\n  expect(map.has([\"key\", 2])).toBe(true); // Other key still exists\n\n  // Test delete non-existent key\n  expect(map.delete([\"nonexistent\", 1])).toBe(false);\n\n  // Test clear\n  map.clear();\n  expect(map.has([\"key\", 2])).toBe(false);\n\n  // Test with object keys\n  const objMap = new DependenciesMap<[object, number], string>();\n  const obj1 = { id: 1 };\n  const obj2 = { id: 2 };\n  objMap.set([obj1, 1], \"object1\");\n  objMap.set([obj2, 2], \"object2\");\n  expect(objMap.get([obj1, 1])).toBe(\"object1\");\n  expect(objMap.get([obj2, 2])).toBe(\"object2\");\n\n  // Test iteration\n  const iterMap = new DependenciesMap<[string], number>();\n  iterMap.set([\"a\"], 1);\n  iterMap.set([\"b\"], 2);\n  iterMap.set([\"c\"], 3);\n\n  const entries = Array.from(iterMap);\n  expect(entries.length).toBe(3);\n  expect(entries).toContainEqual([[\"a\"], 1]);\n  expect(entries).toContainEqual([[\"b\"], 2]);\n  expect(entries).toContainEqual([[\"c\"], 3]);\n});\n"],"mappings":";;;;AAEA,IAAa,qBAAb,MAAkD;CAGhD,YAAY,OAAU;EACpB,IAAI,OAAO,YAAY,aACrB,KAAK,OAAO,EAAE,aAAa,MAAM;OAEjC,KAAK,OAAO,IAAI,QAAW,KAAK;CAEpC;CAEA,QAAuB;EACrB,OAAO,KAAK,KAAK,MAAM;CACzB;AACF;;;;;;AAyBA,IAAa,kBAAb,MAAkD;;wBAiD/C,OAAO;;CA7CR,YAAY,SAA+C;8BA6CpC;EA5CrB,MAAM,gBAAgB,SAAS,KAAK,MAAM,CAAC,EAAE,IAAI;GAAE,OAAO,EAAE;GAAI,QAAQ,IAAI,mBAAmB,EAAE,EAAE;EAAE,CAAC,CAAU;EAChH,KAAK,WAAW,IAAI,QAAQ,iBAAiB,CAAC,CAAC;EAC/C,KAAK,WAAW,IAAI,IAAI,eAAe,KAAK,MAAM,EAAE,EAAE,CAAC,MAAM,KAAK,CAAC,CAAC;CACtE;CAEA,IAAI,KAAuB;EACzB,OAAO,KAAK,SAAS,IAAI,GAAG,CAAC,EAAE;CACjC;CAEA,IAAI,KAAQ,OAAgB;EAE1B,MAAM,UAAU;GAAE;GAAO,QADR,KAAK,SAAS,IAAI,GACK,CAAC,EAAE,UAAU,IAAI,mBAAmB,GAAG;EAAE;EACjF,KAAK,SAAS,IAAI,KAAK,OAAO;EAC9B,KAAK,SAAS,IAAI,QAAQ,MAAM;EAChC,OAAO;CACT;CAEA,OAAO,KAAiB;EACtB,MAAM,MAAM,KAAK,SAAS,IAAI,GAAG;EACjC,IAAI,KAAK;GACP,KAAK,SAAS,OAAO,GAAG;GACxB,KAAK,SAAS,OAAO,IAAI,MAAM;GAC/B,OAAO;EACT;EACA,OAAO;CACT;CAEA,IAAI,KAAiB;EACnB,OAAO,KAAK,SAAS,IAAI,GAAG,KAAK,KAAK,SAAS,IAAI,KAAK,SAAS,IAAI,GAAG,CAAC,CAAE,MAAM;CACnF;CAEA,EAAE,OAAO,YAAsC;EAC7C,KAAK,MAAM,UAAU,KAAK,UAAU;GAClC,MAAM,MAAM,OAAO,MAAM;GACzB,MAAM,WAAW,MAAM,KAAK,SAAS,IAAI,GAAG,IAAI,KAAA;GAChD,IAAI,CAAC,KAEH,KAAK,SAAS,OAAO,MAAM;QACtB,IAAI,UACT,MAAM,CAAC,KAAK,SAAS,KAAK;EAE9B;CACF;AAGF;;;;;;;AAsEA,IAAa,eAAb,MAAgC;;yBAoD7B,OAAO;;CAhDR,YAAY,SAA+C;+BAgDpC;EA/CrB,MAAM,eAAe,CAAC,GAAG,WAAW,CAAC,CAAC;EACtC,KAAK,gBAAgB,IAAI,IAAI,aAAa,QAAQ,MAAM,CAAC,KAAK,oBAAoB,EAAE,EAAE,CAAC,CAAC;EACxF,KAAK,WAAW,IAAI,gBAAgB,aAAa,QAAQ,MAA6B,KAAK,oBAAoB,EAAE,EAAE,CAAC,CAAC;CACvH;CAEA,oBAA4B,KAA4B;EACtD,OAAQ,OAAO,QAAQ,YAAY,QAAQ,QAAU,OAAO,QAAQ,YAAY,OAAO,OAAO,GAAG,MAAM,KAAA;CACzG;CAEA,IAAI,KAAuB;EACzB,IAAI,KAAK,oBAAoB,GAAG,GAC9B,OAAO,KAAK,SAAS,IAAI,GAAG;OAE5B,OAAO,KAAK,cAAc,IAAI,GAAG;CAErC;CAEA,IAAI,KAAQ,OAAgB;EAC1B,IAAI,KAAK,oBAAoB,GAAG,GAC9B,KAAK,SAAS,IAAI,KAAK,KAAK;OAE5B,KAAK,cAAc,IAAI,KAAK,KAAK;EAEnC,OAAO;CACT;CAEA,OAAO,KAAiB;EACtB,IAAI,KAAK,oBAAoB,GAAG,GAC9B,OAAO,KAAK,SAAS,OAAO,GAAG;OAE/B,OAAO,KAAK,cAAc,OAAO,GAAG;CAExC;CAEA,IAAI,KAAiB;EACnB,IAAI,KAAK,oBAAoB,GAAG,GAC9B,OAAO,KAAK,SAAS,IAAI,GAAG;OAE5B,OAAO,KAAK,cAAc,IAAI,GAAG;CAErC;CAEA,EAAE,OAAO,YAAsC;EAC7C,OAAO,KAAK;EACZ,OAAO,KAAK;CACd;AAGF;;;;;AA4DA,IAAa,kBAAb,MAAiD;;gBACL;GAAE,KAAK,IAAI,aAAa;GAAG,UAAU;GAAO,OAAO,KAAA;EAAU;+BA+EhF;;;yBAAtB,OAAO;;CA7ER,eAAuB,OAAiD;EACtE,IAAI,MAAM,UACR,OAAOA,aAAAA,OAAO,GAAG,MAAM,KAAK;OAE5B,OAAOA,aAAAA,OAAO,MAAM,KAAA,CAAS;CAEjC;CAGA,iBAAyB,cAAqB,OAAiD;EAC7F,IAAK,aAAa,WAAW,GAC3B,OAAO,KAAK,eAAe,KAAK;OAC3B;GACL,MAAM,CAAC,KAAK,GAAG,QAAQ;GACvB,MAAM,WAAW,MAAM,IAAI,IAAI,GAAG;GAClC,IAAI,CAAC,UACH,OAAOA,aAAAA,OAAO,MAAM,KAAA,CAAS;GAE/B,OAAO,KAAK,iBAAiB,MAAM,QAAQ;EAC7C;CACF;CAEA,YAAoB,cAAqB,OAAwB,OAAiD;EAChH,IAAI,aAAa,WAAW,GAAG;GAC7B,MAAM,MAAM,KAAK,eAAe,KAAK;GACrC,IAAI,MAAM,WAAW,MAAM;IACzB,MAAM,WAAW;IACjB,MAAM,QAAQ,MAAM;GACtB,OAAO;IACL,MAAM,WAAW;IACjB,MAAM,QAAQ,KAAA;GAChB;GACA,OAAO;EACT,OAAO;GACL,MAAM,CAAC,KAAK,GAAG,QAAQ;GACvB,IAAI,WAAW,MAAM,IAAI,IAAI,GAAG;GAChC,IAAI,CAAC,UACH,MAAM,IAAI,IAAI,KAAK,WAAW;IAAE,KAAK,IAAI,aAAa;IAAG,UAAU;IAAO,OAAO,KAAA;GAAU,CAAC;GAE9F,OAAO,KAAK,YAAY,MAAM,OAAO,QAAQ;EAC/C;CACF;CAEA,CAAS,cAAc,cAAqB,OAA0D;EACpG,IAAI,MAAM,UACR,MAAM,CAAC,cAAmB,MAAM,KAAK;EAEvC,KAAK,MAAM,CAAC,KAAK,UAAU,MAAM,KAC/B,OAAO,KAAK,cAAc,CAAC,GAAG,cAAc,GAAG,GAAG,KAAK;CAE3D;CAEA,IAAI,cAAgC;EAClC,OAAOA,aAAAA,OAAO,GAAG,KAAK,iBAAiB,cAAc,KAAK,MAAM,GAAG,KAAA,CAAS;CAC9E;CAEA,IAAI,cAAiB,OAAgB;EACnC,KAAK,YAAY,cAAcA,aAAAA,OAAO,GAAG,KAAK,GAAG,KAAK,MAAM;EAC5D,OAAO;CACT;CAEA,OAAO,cAA0B;EAC/B,OAAO,KAAK,YAAY,cAAcA,aAAAA,OAAO,MAAM,KAAA,CAAS,GAAG,KAAK,MAAM,CAAC,CAAC,WAAW;CACzF;CAEA,IAAI,cAA0B;EAC5B,OAAO,KAAK,iBAAiB,cAAc,KAAK,MAAM,CAAC,CAAC,WAAW;CACrE;CAEA,QAAc;EACZ,KAAK,SAAS;GAAE,KAAK,IAAI,aAAa;GAAG,UAAU;GAAO,OAAO,KAAA;EAAU;CAC7E;CAEA,EAAE,OAAO,YAAsC;EAC7C,OAAO,KAAK,cAAc,CAAC,GAAG,KAAK,MAAM;CAC3C;AAGF"}

package/dist/utils/math.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"math.d.ts","names":[],"sources":["../../src/utils/math.tsx"],"mappings":";;AAGA;;iBAAgB,SAAA,CAAU,CAAA,UAAW,CAAA"}
+{"version":3,"file":"math.d.ts","names":[],"sources":["../../src/utils/math.tsx"],"mappings":";;AAGA;;iBAAgB,SAAA,CAAU,CAAA,UAAW,CAAS"}

package/dist/utils/math.js

@@ -1,5 +1,4 @@
-Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
-
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
 //#region src/utils/math.tsx
 /**
 * Similar to the modulo operator, but always returns a positive number (even when the input is negative).
@@ -7,17 +6,7 @@ Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
 function remainder(n, d) {
 	return (n % d + Math.abs(d)) % d;
 }
-(void 0)?.test("remainder", ({ expect }) => {
-	expect(remainder(10, 3)).toBe(1);
-	expect(remainder(10, 5)).toBe(0);
-	expect(remainder(10, 7)).toBe(3);
-	expect(remainder(-10, 3)).toBe(2);
-	expect(remainder(-5, 2)).toBe(1);
-	expect(remainder(-7, 4)).toBe(1);
-	expect(remainder(10.5, 3)).toBeCloseTo(1.5);
-	expect(remainder(-10.5, 3)).toBeCloseTo(1.5);
-});
-
 //#endregion
 exports.remainder = remainder;
+
 //# sourceMappingURL=math.js.map

package/dist/utils/math.js.map

@@ -1 +1 @@
-{"version":3,"file":"math.js","names":[],"sources":["../../src/utils/math.tsx"],"sourcesContent":["/**\n * Similar to the modulo operator, but always returns a positive number (even when the input is negative).\n */\nexport function remainder(n: number, d: number): number {\n  return ((n % d) + Math.abs(d)) % d;\n}\nimport.meta.vitest?.test(\"remainder\", ({ expect }) => {\n  expect(remainder(10, 3)).toBe(1);\n  expect(remainder(10, 5)).toBe(0);\n  expect(remainder(10, 7)).toBe(3);\n  // Test with negative numbers\n  expect(remainder(-10, 3)).toBe(2);\n  expect(remainder(-5, 2)).toBe(1);\n  expect(remainder(-7, 4)).toBe(1);\n  // Test with decimal numbers\n  expect(remainder(10.5, 3)).toBeCloseTo(1.5);\n  expect(remainder(-10.5, 3)).toBeCloseTo(1.5);\n});\n"],"mappings":";;;;;;AAGA,SAAgB,UAAU,GAAW,GAAmB;AACtD,SAAS,IAAI,IAAK,KAAK,IAAI,EAAE,IAAI;;CAEnC,SAAW,KAAC,cAAc,EAAA,aAAe;AACvC,QAAO,UAAU,IAAI,EAAE,CAAC,CAAC,KAAK,EAAE;AAChC,QAAO,UAAU,IAAI,EAAE,CAAC,CAAC,KAAK,EAAE;AAChC,QAAO,UAAU,IAAI,EAAE,CAAC,CAAC,KAAK,EAAE;AAEhC,QAAO,UAAU,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE;AACjC,QAAO,UAAU,IAAI,EAAE,CAAC,CAAC,KAAK,EAAE;AAChC,QAAO,UAAU,IAAI,EAAE,CAAC,CAAC,KAAK,EAAE;AAEhC,QAAO,UAAU,MAAM,EAAE,CAAC,CAAC,YAAY,IAAI;AAC3C,QAAO,UAAU,OAAO,EAAE,CAAC,CAAC,YAAY,IAAI;EAC5C"}
+{"version":3,"file":"math.js","names":[],"sources":["../../src/utils/math.tsx"],"sourcesContent":["/**\n * Similar to the modulo operator, but always returns a positive number (even when the input is negative).\n */\nexport function remainder(n: number, d: number): number {\n  return ((n % d) + Math.abs(d)) % d;\n}\nimport.meta.vitest?.test(\"remainder\", ({ expect }) => {\n  expect(remainder(10, 3)).toBe(1);\n  expect(remainder(10, 5)).toBe(0);\n  expect(remainder(10, 7)).toBe(3);\n  // Test with negative numbers\n  expect(remainder(-10, 3)).toBe(2);\n  expect(remainder(-5, 2)).toBe(1);\n  expect(remainder(-7, 4)).toBe(1);\n  // Test with decimal numbers\n  expect(remainder(10.5, 3)).toBeCloseTo(1.5);\n  expect(remainder(-10.5, 3)).toBeCloseTo(1.5);\n});\n"],"mappings":";;;;;AAGA,SAAgB,UAAU,GAAW,GAAmB;CACtD,QAAS,IAAI,IAAK,KAAK,IAAI,CAAC,KAAK;AACnC"}

package/dist/utils/monkey-patch.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"monkey-patch.d.ts","names":[],"sources":["../../src/utils/monkey-patch.tsx"],"mappings":";cAEa,mCAAA;AAAA,iBAEG,yBAAA,CAA0B,KAAA;AAAA,iBAQ1B,iBAAA,CAAA"}
+{"version":3,"file":"monkey-patch.d.ts","names":[],"sources":["../../src/utils/monkey-patch.tsx"],"mappings":";cAEa,mCAAA;AAAA,iBAEG,yBAAA,CAA0B,KAAc;AAAA,iBAQxC,iBAAA"}

package/dist/utils/monkey-patch.js

@@ -1,11 +1,9 @@
-Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
-const require_chunk = require('../chunk-BE-pF4vm.js');
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
 let __globals_js = require("./globals.js");
-
 //#region src/utils/monkey-patch.tsx
 const NO_SUSPENSE_BOUNDARY_ERROR_SENTINEL = "__stack-no-suspense-boundary-error__";
 function isNoSuspenseBoundaryError(value) {
-	return typeof value === "object" && value !== null && value.__noSuspenseBoundarySentinel === NO_SUSPENSE_BOUNDARY_ERROR_SENTINEL;
+	return typeof value === "object" && value !== null && value.__noSuspenseBoundarySentinel === "__stack-no-suspense-boundary-error__";
 }
 function ensureMonkeyPatch() {
 	(0, __globals_js.createGlobal)("__console-error-monkey-patch__", () => {
@@ -17,9 +15,9 @@ function ensureMonkeyPatch() {
 		return true;
 	});
 }
-
 //#endregion
 exports.NO_SUSPENSE_BOUNDARY_ERROR_SENTINEL = NO_SUSPENSE_BOUNDARY_ERROR_SENTINEL;
 exports.ensureMonkeyPatch = ensureMonkeyPatch;
 exports.isNoSuspenseBoundaryError = isNoSuspenseBoundaryError;
+
 //# sourceMappingURL=monkey-patch.js.map

package/dist/utils/monkey-patch.js.map

@@ -1 +1 @@
-{"version":3,"file":"monkey-patch.js","names":[],"sources":["../../src/utils/monkey-patch.tsx"],"sourcesContent":["import { createGlobal } from \"./globals\";\n\nexport const NO_SUSPENSE_BOUNDARY_ERROR_SENTINEL = \"__stack-no-suspense-boundary-error__\";\n\nexport function isNoSuspenseBoundaryError(value: unknown): boolean {\n  return (\n    typeof value === \"object\"\n    && value !== null\n    && (value as Record<string, unknown>).__noSuspenseBoundarySentinel === NO_SUSPENSE_BOUNDARY_ERROR_SENTINEL\n  );\n}\n\nexport function ensureMonkeyPatch() {\n  createGlobal(\"__console-error-monkey-patch__\", () => {\n    const originalConsoleError = console.error;\n    console.error = function (...args: unknown[]) {\n      // React's default error handlers will log all errors to the console, even those that we intentionally use to suppress SSR.\n      // Next.js among others override the default error handler and will not log SSR errors to the console.\n      // However, vanilla React and other frameworks like TanStack Start use the default error handler.\n      // Hence, we suppress the error here if it is a NoSuspenseBoundaryError.\n      // It's very cursed, but it's really our best option. Talk to @konsti if you want to know more.\n      if (args.length === 1 && isNoSuspenseBoundaryError(args[0])) {\n        return;\n      }\n      return originalConsoleError.apply(this, args);\n    };\n    return true;\n  });\n}\n"],"mappings":";;;;;AAEA,MAAa,sCAAsC;AAEnD,SAAgB,0BAA0B,OAAyB;AACjE,QACE,OAAO,UAAU,YACd,UAAU,QACT,MAAkC,iCAAiC;;AAI3E,SAAgB,oBAAoB;AAClC,gCAAa,wCAAwC;EACnD,MAAM,uBAAuB,QAAQ;AACrC,UAAQ,QAAQ,SAAU,GAAG,MAAiB;AAM5C,OAAI,KAAK,WAAW,KAAK,0BAA0B,KAAK,GAAG,CACzD;AAEF,UAAO,qBAAqB,MAAM,MAAM,KAAK;;AAE/C,SAAO;GACP"}
+{"version":3,"file":"monkey-patch.js","names":[],"sources":["../../src/utils/monkey-patch.tsx"],"sourcesContent":["import { createGlobal } from \"./globals\";\n\nexport const NO_SUSPENSE_BOUNDARY_ERROR_SENTINEL = \"__stack-no-suspense-boundary-error__\";\n\nexport function isNoSuspenseBoundaryError(value: unknown): boolean {\n  return (\n    typeof value === \"object\"\n    && value !== null\n    && (value as Record<string, unknown>).__noSuspenseBoundarySentinel === NO_SUSPENSE_BOUNDARY_ERROR_SENTINEL\n  );\n}\n\nexport function ensureMonkeyPatch() {\n  createGlobal(\"__console-error-monkey-patch__\", () => {\n    const originalConsoleError = console.error;\n    console.error = function (...args: unknown[]) {\n      // React's default error handlers will log all errors to the console, even those that we intentionally use to suppress SSR.\n      // Next.js among others override the default error handler and will not log SSR errors to the console.\n      // However, vanilla React and other frameworks like TanStack Start use the default error handler.\n      // Hence, we suppress the error here if it is a NoSuspenseBoundaryError.\n      // It's very cursed, but it's really our best option. Talk to @konsti if you want to know more.\n      if (args.length === 1 && isNoSuspenseBoundaryError(args[0])) {\n        return;\n      }\n      return originalConsoleError.apply(this, args);\n    };\n    return true;\n  });\n}\n"],"mappings":";;;AAEA,MAAa,sCAAsC;AAEnD,SAAgB,0BAA0B,OAAyB;CACjE,OACE,OAAO,UAAU,YACd,UAAU,QACT,MAAkC,iCAAA;AAE1C;AAEA,SAAgB,oBAAoB;CAClC,CAAA,GAAA,aAAA,aAAA,CAAa,wCAAwC;EACnD,MAAM,uBAAuB,QAAQ;EACrC,QAAQ,QAAQ,SAAU,GAAG,MAAiB;GAM5C,IAAI,KAAK,WAAW,KAAK,0BAA0B,KAAK,EAAE,GACxD;GAEF,OAAO,qBAAqB,MAAM,MAAM,IAAI;EAC9C;EACA,OAAO;CACT,CAAC;AACH"}

package/dist/utils/node-http.js

@@ -1,8 +1,6 @@
-Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
-const require_chunk = require('../chunk-BE-pF4vm.js');
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
 let http = require("http");
 let __urls_js = require("./urls.js");
-
 //#region src/utils/node-http.tsx
 var ServerResponseWithBodyChunks = class extends http.ServerResponse {
 	constructor(..._args) {
@@ -34,7 +32,7 @@ async function createNodeHttpServerDuplex(options) {
 	incomingMessage.push(null);
 	return [incomingMessage, new ServerResponseWithBodyChunks(incomingMessage)];
 }
-
 //#endregion
 exports.createNodeHttpServerDuplex = createNodeHttpServerDuplex;
+
 //# sourceMappingURL=node-http.js.map

package/dist/utils/node-http.js.map

@@ -1 +1 @@
-{"version":3,"file":"node-http.js","names":["ServerResponse","IncomingMessage"],"sources":["../../src/utils/node-http.tsx"],"sourcesContent":["import { IncomingMessage, ServerResponse } from \"http\";\nimport { getRelativePart } from \"./urls\";\n\nclass ServerResponseWithBodyChunks extends ServerResponse {\n  bodyChunks: Uint8Array[] = [];\n\n  // note: we actually override this, even though it's private in the parent\n  _send(data: string, encoding: BufferEncoding, callback?: (() => void) | null, byteLength?: number) {\n    if (typeof encoding === \"function\") {\n      callback = encoding;\n      encoding = \"utf-8\";\n    }\n    const encodedBuffer = new Uint8Array(Buffer.from(data, encoding));\n    this.bodyChunks.push(encodedBuffer);\n    callback?.();\n  }\n}\n\nexport async function createNodeHttpServerDuplex(options: {\n  method: string,\n  originalUrl?: URL,\n  url: URL,\n  headers: Headers,\n  body: Uint8Array,\n}): Promise<[IncomingMessage, ServerResponseWithBodyChunks]> {\n  // See https://github.com/nodejs/node/blob/main/lib/_http_incoming.js\n  // and https://github.com/nodejs/node/blob/main/lib/_http_common.js (particularly the `parserXyz` functions)\n\n  const incomingMessage = new IncomingMessage({\n    encrypted: options.originalUrl?.protocol === \"https:\",  // trick frameworks into believing this is an HTTPS request\n  } as any);\n  incomingMessage.httpVersionMajor = 1;\n  incomingMessage.httpVersionMinor = 1;\n  incomingMessage.httpVersion = '1.1';\n  incomingMessage.method = options.method;\n  incomingMessage.url = getRelativePart(options.url);\n  (incomingMessage as any).originalUrl = options.originalUrl && getRelativePart(options.originalUrl);  // originalUrl is an extension used by some servers; for example, oidc-provider reads it to construct the paths for the .well-known/openid-configuration\n  const rawHeaders = [...options.headers.entries()].flat();\n  (incomingMessage as any)._addHeaderLines(rawHeaders, rawHeaders.length);\n  incomingMessage.push(Buffer.from(options.body));\n  incomingMessage.complete = true;\n  incomingMessage.push(null);  // to emit end event, see: https://github.com/nodejs/node/blob/4cf6fabce20eb3050c5b543d249e931ea3d3cad5/lib/_http_common.js#L150\n\n  const serverResponse = new ServerResponseWithBodyChunks(incomingMessage);\n\n  return [incomingMessage, serverResponse];\n}\n"],"mappings":";;;;;;AAGA,IAAM,+BAAN,cAA2CA,oBAAe;;;oBAC7B,EAAE;;CAG7B,MAAM,MAAc,UAA0B,UAAgC,YAAqB;AACjG,MAAI,OAAO,aAAa,YAAY;AAClC,cAAW;AACX,cAAW;;EAEb,MAAM,gBAAgB,IAAI,WAAW,OAAO,KAAK,MAAM,SAAS,CAAC;AACjE,OAAK,WAAW,KAAK,cAAc;AACnC,cAAY;;;AAIhB,eAAsB,2BAA2B,SAMY;CAI3D,MAAM,kBAAkB,IAAIC,qBAAgB,EAC1C,WAAW,QAAQ,aAAa,aAAa,UAC9C,CAAQ;AACT,iBAAgB,mBAAmB;AACnC,iBAAgB,mBAAmB;AACnC,iBAAgB,cAAc;AAC9B,iBAAgB,SAAS,QAAQ;AACjC,iBAAgB,qCAAsB,QAAQ,IAAI;AAClD,CAAC,gBAAwB,cAAc,QAAQ,8CAA+B,QAAQ,YAAY;CAClG,MAAM,aAAa,CAAC,GAAG,QAAQ,QAAQ,SAAS,CAAC,CAAC,MAAM;AACxD,CAAC,gBAAwB,gBAAgB,YAAY,WAAW,OAAO;AACvE,iBAAgB,KAAK,OAAO,KAAK,QAAQ,KAAK,CAAC;AAC/C,iBAAgB,WAAW;AAC3B,iBAAgB,KAAK,KAAK;AAI1B,QAAO,CAAC,iBAFe,IAAI,6BAA6B,gBAAgB,CAEhC"}
+{"version":3,"file":"node-http.js","names":["ServerResponse","IncomingMessage"],"sources":["../../src/utils/node-http.tsx"],"sourcesContent":["import { IncomingMessage, ServerResponse } from \"http\";\nimport { getRelativePart } from \"./urls\";\n\nclass ServerResponseWithBodyChunks extends ServerResponse {\n  bodyChunks: Uint8Array[] = [];\n\n  // note: we actually override this, even though it's private in the parent\n  _send(data: string, encoding: BufferEncoding, callback?: (() => void) | null, byteLength?: number) {\n    if (typeof encoding === \"function\") {\n      callback = encoding;\n      encoding = \"utf-8\";\n    }\n    const encodedBuffer = new Uint8Array(Buffer.from(data, encoding));\n    this.bodyChunks.push(encodedBuffer);\n    callback?.();\n  }\n}\n\nexport async function createNodeHttpServerDuplex(options: {\n  method: string,\n  originalUrl?: URL,\n  url: URL,\n  headers: Headers,\n  body: Uint8Array,\n}): Promise<[IncomingMessage, ServerResponseWithBodyChunks]> {\n  // See https://github.com/nodejs/node/blob/main/lib/_http_incoming.js\n  // and https://github.com/nodejs/node/blob/main/lib/_http_common.js (particularly the `parserXyz` functions)\n\n  const incomingMessage = new IncomingMessage({\n    encrypted: options.originalUrl?.protocol === \"https:\",  // trick frameworks into believing this is an HTTPS request\n  } as any);\n  incomingMessage.httpVersionMajor = 1;\n  incomingMessage.httpVersionMinor = 1;\n  incomingMessage.httpVersion = '1.1';\n  incomingMessage.method = options.method;\n  incomingMessage.url = getRelativePart(options.url);\n  (incomingMessage as any).originalUrl = options.originalUrl && getRelativePart(options.originalUrl);  // originalUrl is an extension used by some servers; for example, oidc-provider reads it to construct the paths for the .well-known/openid-configuration\n  const rawHeaders = [...options.headers.entries()].flat();\n  (incomingMessage as any)._addHeaderLines(rawHeaders, rawHeaders.length);\n  incomingMessage.push(Buffer.from(options.body));\n  incomingMessage.complete = true;\n  incomingMessage.push(null);  // to emit end event, see: https://github.com/nodejs/node/blob/4cf6fabce20eb3050c5b543d249e931ea3d3cad5/lib/_http_common.js#L150\n\n  const serverResponse = new ServerResponseWithBodyChunks(incomingMessage);\n\n  return [incomingMessage, serverResponse];\n}\n"],"mappings":";;;;AAGA,IAAM,+BAAN,cAA2CA,KAAAA,eAAe;;;oBAC7B,CAAC;;CAG5B,MAAM,MAAc,UAA0B,UAAgC,YAAqB;EACjG,IAAI,OAAO,aAAa,YAAY;GAClC,WAAW;GACX,WAAW;EACb;EACA,MAAM,gBAAgB,IAAI,WAAW,OAAO,KAAK,MAAM,QAAQ,CAAC;EAChE,KAAK,WAAW,KAAK,aAAa;EAClC,WAAW;CACb;AACF;AAEA,eAAsB,2BAA2B,SAMY;CAI3D,MAAM,kBAAkB,IAAIC,KAAAA,gBAAgB,EAC1C,WAAW,QAAQ,aAAa,aAAa,SAC/C,CAAQ;CACR,gBAAgB,mBAAmB;CACnC,gBAAgB,mBAAmB;CACnC,gBAAgB,cAAc;CAC9B,gBAAgB,SAAS,QAAQ;CACjC,gBAAgB,OAAA,GAAA,UAAA,gBAAA,CAAsB,QAAQ,GAAG;CACjD,gBAAyB,cAAc,QAAQ,gBAAA,GAAA,UAAA,gBAAA,CAA+B,QAAQ,WAAW;CACjG,MAAM,aAAa,CAAC,GAAG,QAAQ,QAAQ,QAAQ,CAAC,CAAC,CAAC,KAAK;CACvD,gBAAyB,gBAAgB,YAAY,WAAW,MAAM;CACtE,gBAAgB,KAAK,OAAO,KAAK,QAAQ,IAAI,CAAC;CAC9C,gBAAgB,WAAW;CAC3B,gBAAgB,KAAK,IAAI;CAIzB,OAAO,CAAC,iBAAiB,IAFE,6BAA6B,eAElB,CAAC;AACzC"}

package/dist/utils/numbers.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"numbers.d.ts","names":[],"sources":["../../src/utils/numbers.tsx"],"mappings":";iBAQgB,yBAAA,CAA0B,GAAA;AAAA,iBAgD1B,UAAA,CAAW,GAAA,UAAa,WAAA;AAAA,iBAaxB,aAAA,CAAc,CAAA,UAAW,CAAA"}
+{"version":3,"file":"numbers.d.ts","names":[],"sources":["../../src/utils/numbers.tsx"],"mappings":";iBAQgB,yBAAA,CAA0B,GAAW;AAAA,iBAgDrC,UAAA,CAAW,GAAA,UAAa,WAAmB;AAAA,iBAa3C,aAAA,CAAc,CAAA,UAAW,CAAS"}

package/dist/utils/numbers.js

@@ -1,5 +1,4 @@
-Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
-
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
 //#region src/utils/numbers.tsx
 const magnitudes = [
 	[1e3, "k"],
@@ -21,59 +20,15 @@ function prettyPrintWithMagnitudes(num) {
 	} else break;
 	return current + lastSuffix;
 }
-(void 0)?.test("prettyPrintWithMagnitudes", ({ expect }) => {
-	expect(prettyPrintWithMagnitudes(999)).toBe("999");
-	expect(prettyPrintWithMagnitudes(1e3)).toBe("1k");
-	expect(prettyPrintWithMagnitudes(1500)).toBe("1.5k");
-	expect(prettyPrintWithMagnitudes(999499)).toBe("999.5k");
-	expect(prettyPrintWithMagnitudes(999500)).toBe("999.5k");
-	expect(prettyPrintWithMagnitudes(999949)).toBe("999.9k");
-	expect(prettyPrintWithMagnitudes(999950)).toBe("1M");
-	expect(prettyPrintWithMagnitudes(1e6)).toBe("1M");
-	expect(prettyPrintWithMagnitudes(15e5)).toBe("1.5M");
-	expect(prettyPrintWithMagnitudes(1e9)).toBe("1bn");
-	expect(prettyPrintWithMagnitudes(15e8)).toBe("1.5bn");
-	expect(prettyPrintWithMagnitudes(0xe8d4a51000)).toBe("1bln");
-	expect(prettyPrintWithMagnitudes(15e11)).toBe("1.5bln");
-	expect(prettyPrintWithMagnitudes(0x38d7ea4c68000)).toBe("1trln");
-	expect(prettyPrintWithMagnitudes(0x5543df729c000)).toBe("1.5trln");
-	expect(prettyPrintWithMagnitudes(100)).toBe("100");
-	expect(prettyPrintWithMagnitudes(0)).toBe("0");
-	expect(prettyPrintWithMagnitudes(.5)).toBe("0.5");
-	expect(prettyPrintWithMagnitudes(-1e3)).toBe("-1k");
-	expect(prettyPrintWithMagnitudes(-15e5)).toBe("-1.5M");
-	expect(prettyPrintWithMagnitudes(NaN)).toBe("NaN");
-	expect(prettyPrintWithMagnitudes(Infinity)).toBe("∞");
-	expect(prettyPrintWithMagnitudes(-Infinity)).toBe("-∞");
-});
 function toFixedMax(num, maxDecimals) {
 	return num.toFixed(maxDecimals).replace(/\.?0+$/, "");
 }
-(void 0)?.test("toFixedMax", ({ expect }) => {
-	expect(toFixedMax(1, 2)).toBe("1");
-	expect(toFixedMax(1.2, 2)).toBe("1.2");
-	expect(toFixedMax(1.23, 2)).toBe("1.23");
-	expect(toFixedMax(1.234, 2)).toBe("1.23");
-	expect(toFixedMax(1, 2)).toBe("1");
-	expect(toFixedMax(1.2, 2)).toBe("1.2");
-	expect(toFixedMax(0, 2)).toBe("0");
-});
 function numberCompare(a, b) {
 	return Math.sign(a - b);
 }
-(void 0)?.test("numberCompare", ({ expect }) => {
-	expect(numberCompare(1, 2)).toBe(-1);
-	expect(numberCompare(2, 1)).toBe(1);
-	expect(numberCompare(1, 1)).toBe(0);
-	expect(numberCompare(0, 0)).toBe(0);
-	expect(numberCompare(-1, -2)).toBe(1);
-	expect(numberCompare(-2, -1)).toBe(-1);
-	expect(numberCompare(-1, 1)).toBe(-1);
-	expect(numberCompare(1, -1)).toBe(1);
-});
-
 //#endregion
 exports.numberCompare = numberCompare;
 exports.prettyPrintWithMagnitudes = prettyPrintWithMagnitudes;
 exports.toFixedMax = toFixedMax;
+
 //# sourceMappingURL=numbers.js.map

package/dist/utils/numbers.js.map

@@ -1 +1 @@
-{"version":3,"file":"numbers.js","names":[],"sources":["../../src/utils/numbers.tsx"],"sourcesContent":["const magnitudes = [\n  [1_000, \"k\"],\n  [1_000, \"M\"],\n  [1_000, \"bn\"],\n  [1_000, \"bln\"],\n  [1_000, \"trln\"],\n] as const;\n\nexport function prettyPrintWithMagnitudes(num: number): string {\n  if (typeof num !== \"number\") throw new Error(\"Expected a number\");\n  if (Number.isNaN(num)) return \"NaN\";\n  if (num < 0) return \"-\" + prettyPrintWithMagnitudes(-num);\n  if (!Number.isFinite(num)) return \"∞\";\n\n  let current = toFixedMax(num, 1);\n  let lastSuffix = \"\";\n  for (const [difference, suffix] of magnitudes) {\n    if (+current >= difference) {\n      current = toFixedMax(+current / difference, 1);\n      lastSuffix = suffix;\n    } else {\n      break;\n    }\n  }\n  return current + lastSuffix;\n}\nimport.meta.vitest?.test(\"prettyPrintWithMagnitudes\", ({ expect }) => {\n  // Test different magnitudes\n  expect(prettyPrintWithMagnitudes(999)).toBe(\"999\");\n  expect(prettyPrintWithMagnitudes(1000)).toBe(\"1k\");\n  expect(prettyPrintWithMagnitudes(1500)).toBe(\"1.5k\");\n  expect(prettyPrintWithMagnitudes(999499)).toBe(\"999.5k\");\n  expect(prettyPrintWithMagnitudes(999500)).toBe(\"999.5k\");\n  expect(prettyPrintWithMagnitudes(999949)).toBe(\"999.9k\");\n  expect(prettyPrintWithMagnitudes(999950)).toBe(\"1M\");\n  expect(prettyPrintWithMagnitudes(1000000)).toBe(\"1M\");\n  expect(prettyPrintWithMagnitudes(1500000)).toBe(\"1.5M\");\n  expect(prettyPrintWithMagnitudes(1000000000)).toBe(\"1bn\");\n  expect(prettyPrintWithMagnitudes(1500000000)).toBe(\"1.5bn\");\n  expect(prettyPrintWithMagnitudes(1000000000000)).toBe(\"1bln\");\n  expect(prettyPrintWithMagnitudes(1500000000000)).toBe(\"1.5bln\");\n  expect(prettyPrintWithMagnitudes(1000000000000000)).toBe(\"1trln\");\n  expect(prettyPrintWithMagnitudes(1500000000000000)).toBe(\"1.5trln\");\n  // Test small numbers\n  expect(prettyPrintWithMagnitudes(100)).toBe(\"100\");\n  expect(prettyPrintWithMagnitudes(0)).toBe(\"0\");\n  expect(prettyPrintWithMagnitudes(0.5)).toBe(\"0.5\");\n  // Test negative numbers\n  expect(prettyPrintWithMagnitudes(-1000)).toBe(\"-1k\");\n  expect(prettyPrintWithMagnitudes(-1500000)).toBe(\"-1.5M\");\n  // Test special cases\n  expect(prettyPrintWithMagnitudes(NaN)).toBe(\"NaN\");\n  expect(prettyPrintWithMagnitudes(Infinity)).toBe(\"∞\");\n  expect(prettyPrintWithMagnitudes(-Infinity)).toBe(\"-∞\");\n});\n\nexport function toFixedMax(num: number, maxDecimals: number): string {\n  return num.toFixed(maxDecimals).replace(/\\.?0+$/, \"\");\n}\nimport.meta.vitest?.test(\"toFixedMax\", ({ expect }) => {\n  expect(toFixedMax(1, 2)).toBe(\"1\");\n  expect(toFixedMax(1.2, 2)).toBe(\"1.2\");\n  expect(toFixedMax(1.23, 2)).toBe(\"1.23\");\n  expect(toFixedMax(1.234, 2)).toBe(\"1.23\");\n  expect(toFixedMax(1.0, 2)).toBe(\"1\");\n  expect(toFixedMax(1.20, 2)).toBe(\"1.2\");\n  expect(toFixedMax(0, 2)).toBe(\"0\");\n});\n\nexport function numberCompare(a: number, b: number): number {\n  return Math.sign(a - b);\n}\nimport.meta.vitest?.test(\"numberCompare\", ({ expect }) => {\n  expect(numberCompare(1, 2)).toBe(-1);\n  expect(numberCompare(2, 1)).toBe(1);\n  expect(numberCompare(1, 1)).toBe(0);\n  expect(numberCompare(0, 0)).toBe(0);\n  expect(numberCompare(-1, -2)).toBe(1);\n  expect(numberCompare(-2, -1)).toBe(-1);\n  expect(numberCompare(-1, 1)).toBe(-1);\n  expect(numberCompare(1, -1)).toBe(1);\n});\n"],"mappings":";;;AAAA,MAAM,aAAa;CACjB,CAAC,KAAO,IAAI;CACZ,CAAC,KAAO,IAAI;CACZ,CAAC,KAAO,KAAK;CACb,CAAC,KAAO,MAAM;CACd,CAAC,KAAO,OAAO;CAChB;AAED,SAAgB,0BAA0B,KAAqB;AAC7D,KAAI,OAAO,QAAQ,SAAU,OAAM,IAAI,MAAM,oBAAoB;AACjE,KAAI,OAAO,MAAM,IAAI,CAAE,QAAO;AAC9B,KAAI,MAAM,EAAG,QAAO,MAAM,0BAA0B,CAAC,IAAI;AACzD,KAAI,CAAC,OAAO,SAAS,IAAI,CAAE,QAAO;CAElC,IAAI,UAAU,WAAW,KAAK,EAAE;CAChC,IAAI,aAAa;AACjB,MAAK,MAAM,CAAC,YAAY,WAAW,WACjC,KAAI,CAAC,WAAW,YAAY;AAC1B,YAAU,WAAW,CAAC,UAAU,YAAY,EAAE;AAC9C,eAAa;OAEb;AAGJ,QAAO,UAAU;;CAEnB,SAAW,KAAC,8BAAc,EAAA,aAA+B;AAEvD,QAAO,0BAA0B,IAAI,CAAC,CAAC,KAAK,MAAM;AAClD,QAAO,0BAA0B,IAAK,CAAC,CAAC,KAAK,KAAK;AAClD,QAAO,0BAA0B,KAAK,CAAC,CAAC,KAAK,OAAO;AACpD,QAAO,0BAA0B,OAAO,CAAC,CAAC,KAAK,SAAS;AACxD,QAAO,0BAA0B,OAAO,CAAC,CAAC,KAAK,SAAS;AACxD,QAAO,0BAA0B,OAAO,CAAC,CAAC,KAAK,SAAS;AACxD,QAAO,0BAA0B,OAAO,CAAC,CAAC,KAAK,KAAK;AACpD,QAAO,0BAA0B,IAAQ,CAAC,CAAC,KAAK,KAAK;AACrD,QAAO,0BAA0B,KAAQ,CAAC,CAAC,KAAK,OAAO;AACvD,QAAO,0BAA0B,IAAW,CAAC,CAAC,KAAK,MAAM;AACzD,QAAO,0BAA0B,KAAW,CAAC,CAAC,KAAK,QAAQ;AAC3D,QAAO,0BAA0B,aAAc,CAAC,CAAC,KAAK,OAAO;AAC7D,QAAO,0BAA0B,MAAc,CAAC,CAAC,KAAK,SAAS;AAC/D,QAAO,0BAA0B,gBAAiB,CAAC,CAAC,KAAK,QAAQ;AACjE,QAAO,0BAA0B,gBAAiB,CAAC,CAAC,KAAK,UAAU;AAEnE,QAAO,0BAA0B,IAAI,CAAC,CAAC,KAAK,MAAM;AAClD,QAAO,0BAA0B,EAAE,CAAC,CAAC,KAAK,IAAI;AAC9C,QAAO,0BAA0B,GAAI,CAAC,CAAC,KAAK,MAAM;AAElD,QAAO,0BAA0B,KAAM,CAAC,CAAC,KAAK,MAAM;AACpD,QAAO,0BAA0B,MAAS,CAAC,CAAC,KAAK,QAAQ;AAEzD,QAAO,0BAA0B,IAAI,CAAC,CAAC,KAAK,MAAM;AAClD,QAAO,0BAA0B,SAAS,CAAC,CAAC,KAAK,IAAI;AACrD,QAAO,0BAA0B,UAAU,CAAC,CAAC,KAAK,KAAK;EACvD;AAEF,SAAgB,WAAW,KAAa,aAA6B;AACnE,QAAO,IAAI,QAAQ,YAAY,CAAC,QAAQ,UAAU,GAAG;;CAEvD,SAAW,KAAC,eAAc,EAAA,aAAgB;AACxC,QAAO,WAAW,GAAG,EAAE,CAAC,CAAC,KAAK,IAAI;AAClC,QAAO,WAAW,KAAK,EAAE,CAAC,CAAC,KAAK,MAAM;AACtC,QAAO,WAAW,MAAM,EAAE,CAAC,CAAC,KAAK,OAAO;AACxC,QAAO,WAAW,OAAO,EAAE,CAAC,CAAC,KAAK,OAAO;AACzC,QAAO,WAAW,GAAK,EAAE,CAAC,CAAC,KAAK,IAAI;AACpC,QAAO,WAAW,KAAM,EAAE,CAAC,CAAC,KAAK,MAAM;AACvC,QAAO,WAAW,GAAG,EAAE,CAAC,CAAC,KAAK,IAAI;EAClC;AAEF,SAAgB,cAAc,GAAW,GAAmB;AAC1D,QAAO,KAAK,KAAK,IAAI,EAAE;;CAEzB,SAAW,KAAC,kBAAc,EAAA,aAAmB;AAC3C,QAAO,cAAc,GAAG,EAAE,CAAC,CAAC,KAAK,GAAG;AACpC,QAAO,cAAc,GAAG,EAAE,CAAC,CAAC,KAAK,EAAE;AACnC,QAAO,cAAc,GAAG,EAAE,CAAC,CAAC,KAAK,EAAE;AACnC,QAAO,cAAc,GAAG,EAAE,CAAC,CAAC,KAAK,EAAE;AACnC,QAAO,cAAc,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE;AACrC,QAAO,cAAc,IAAI,GAAG,CAAC,CAAC,KAAK,GAAG;AACtC,QAAO,cAAc,IAAI,EAAE,CAAC,CAAC,KAAK,GAAG;AACrC,QAAO,cAAc,GAAG,GAAG,CAAC,CAAC,KAAK,EAAE;EACpC"}
+{"version":3,"file":"numbers.js","names":[],"sources":["../../src/utils/numbers.tsx"],"sourcesContent":["const magnitudes = [\n  [1_000, \"k\"],\n  [1_000, \"M\"],\n  [1_000, \"bn\"],\n  [1_000, \"bln\"],\n  [1_000, \"trln\"],\n] as const;\n\nexport function prettyPrintWithMagnitudes(num: number): string {\n  if (typeof num !== \"number\") throw new Error(\"Expected a number\");\n  if (Number.isNaN(num)) return \"NaN\";\n  if (num < 0) return \"-\" + prettyPrintWithMagnitudes(-num);\n  if (!Number.isFinite(num)) return \"∞\";\n\n  let current = toFixedMax(num, 1);\n  let lastSuffix = \"\";\n  for (const [difference, suffix] of magnitudes) {\n    if (+current >= difference) {\n      current = toFixedMax(+current / difference, 1);\n      lastSuffix = suffix;\n    } else {\n      break;\n    }\n  }\n  return current + lastSuffix;\n}\nimport.meta.vitest?.test(\"prettyPrintWithMagnitudes\", ({ expect }) => {\n  // Test different magnitudes\n  expect(prettyPrintWithMagnitudes(999)).toBe(\"999\");\n  expect(prettyPrintWithMagnitudes(1000)).toBe(\"1k\");\n  expect(prettyPrintWithMagnitudes(1500)).toBe(\"1.5k\");\n  expect(prettyPrintWithMagnitudes(999499)).toBe(\"999.5k\");\n  expect(prettyPrintWithMagnitudes(999500)).toBe(\"999.5k\");\n  expect(prettyPrintWithMagnitudes(999949)).toBe(\"999.9k\");\n  expect(prettyPrintWithMagnitudes(999950)).toBe(\"1M\");\n  expect(prettyPrintWithMagnitudes(1000000)).toBe(\"1M\");\n  expect(prettyPrintWithMagnitudes(1500000)).toBe(\"1.5M\");\n  expect(prettyPrintWithMagnitudes(1000000000)).toBe(\"1bn\");\n  expect(prettyPrintWithMagnitudes(1500000000)).toBe(\"1.5bn\");\n  expect(prettyPrintWithMagnitudes(1000000000000)).toBe(\"1bln\");\n  expect(prettyPrintWithMagnitudes(1500000000000)).toBe(\"1.5bln\");\n  expect(prettyPrintWithMagnitudes(1000000000000000)).toBe(\"1trln\");\n  expect(prettyPrintWithMagnitudes(1500000000000000)).toBe(\"1.5trln\");\n  // Test small numbers\n  expect(prettyPrintWithMagnitudes(100)).toBe(\"100\");\n  expect(prettyPrintWithMagnitudes(0)).toBe(\"0\");\n  expect(prettyPrintWithMagnitudes(0.5)).toBe(\"0.5\");\n  // Test negative numbers\n  expect(prettyPrintWithMagnitudes(-1000)).toBe(\"-1k\");\n  expect(prettyPrintWithMagnitudes(-1500000)).toBe(\"-1.5M\");\n  // Test special cases\n  expect(prettyPrintWithMagnitudes(NaN)).toBe(\"NaN\");\n  expect(prettyPrintWithMagnitudes(Infinity)).toBe(\"∞\");\n  expect(prettyPrintWithMagnitudes(-Infinity)).toBe(\"-∞\");\n});\n\nexport function toFixedMax(num: number, maxDecimals: number): string {\n  return num.toFixed(maxDecimals).replace(/\\.?0+$/, \"\");\n}\nimport.meta.vitest?.test(\"toFixedMax\", ({ expect }) => {\n  expect(toFixedMax(1, 2)).toBe(\"1\");\n  expect(toFixedMax(1.2, 2)).toBe(\"1.2\");\n  expect(toFixedMax(1.23, 2)).toBe(\"1.23\");\n  expect(toFixedMax(1.234, 2)).toBe(\"1.23\");\n  expect(toFixedMax(1.0, 2)).toBe(\"1\");\n  expect(toFixedMax(1.20, 2)).toBe(\"1.2\");\n  expect(toFixedMax(0, 2)).toBe(\"0\");\n});\n\nexport function numberCompare(a: number, b: number): number {\n  return Math.sign(a - b);\n}\nimport.meta.vitest?.test(\"numberCompare\", ({ expect }) => {\n  expect(numberCompare(1, 2)).toBe(-1);\n  expect(numberCompare(2, 1)).toBe(1);\n  expect(numberCompare(1, 1)).toBe(0);\n  expect(numberCompare(0, 0)).toBe(0);\n  expect(numberCompare(-1, -2)).toBe(1);\n  expect(numberCompare(-2, -1)).toBe(-1);\n  expect(numberCompare(-1, 1)).toBe(-1);\n  expect(numberCompare(1, -1)).toBe(1);\n});\n"],"mappings":";;AAAA,MAAM,aAAa;CACjB,CAAC,KAAO,GAAG;CACX,CAAC,KAAO,GAAG;CACX,CAAC,KAAO,IAAI;CACZ,CAAC,KAAO,KAAK;CACb,CAAC,KAAO,MAAM;AAChB;AAEA,SAAgB,0BAA0B,KAAqB;CAC7D,IAAI,OAAO,QAAQ,UAAU,MAAM,IAAI,MAAM,mBAAmB;CAChE,IAAI,OAAO,MAAM,GAAG,GAAG,OAAO;CAC9B,IAAI,MAAM,GAAG,OAAO,MAAM,0BAA0B,CAAC,GAAG;CACxD,IAAI,CAAC,OAAO,SAAS,GAAG,GAAG,OAAO;CAElC,IAAI,UAAU,WAAW,KAAK,CAAC;CAC/B,IAAI,aAAa;CACjB,KAAK,MAAM,CAAC,YAAY,WAAW,YACjC,IAAI,CAAC,WAAW,YAAY;EAC1B,UAAU,WAAW,CAAC,UAAU,YAAY,CAAC;EAC7C,aAAa;CACf,OACE;CAGJ,OAAO,UAAU;AACnB;AA+BA,SAAgB,WAAW,KAAa,aAA6B;CACnE,OAAO,IAAI,QAAQ,WAAW,CAAC,CAAC,QAAQ,UAAU,EAAE;AACtD;AAWA,SAAgB,cAAc,GAAW,GAAmB;CAC1D,OAAO,KAAK,KAAK,IAAI,CAAC;AACxB"}

package/dist/utils/oauth.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"oauth.d.ts","names":[],"sources":["../../src/utils/oauth.tsx"],"mappings":";cAAa,iBAAA;AAAA,cAEA,eAAA;AAAA,cACA,YAAA;AAAA,cACA,wCAAA;;;AAFb;;;cASa,gBAAA;AAAA,KACD,eAAA,UAAyB,gBAAA;AAAA,KAEzB,YAAA,UAAsB,YAAA;AAAA,KACtB,oBAAA,UAA8B,iBAAA;AAAA,KAC9B,kBAAA,UAA4B,eAAA"}
+{"version":3,"file":"oauth.d.ts","names":[],"sources":["../../src/utils/oauth.tsx"],"mappings":";cAAa,iBAAA;AAAA,cAEA,eAAA;AAAA,cACA,YAAA;AAAA,cACA,wCAAA;;AAJ2J;AAExK;;;cASa,gBAAA;AAAA,KACD,eAAA,UAAyB,gBAAgB;AAAA,KAEzC,YAAA,UAAsB,YAAY;AAAA,KAClC,oBAAA,UAA8B,iBAAiB;AAAA,KAC/C,kBAAA,UAA4B,eAAe"}

package/dist/utils/oauth.js

@@ -1,5 +1,4 @@
-Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
-
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
 //#region src/utils/oauth.tsx
 const standardProviders = [
 	"google",
@@ -29,11 +28,11 @@ const publishableClientKeyNotNecessarySentinel = "__stack_public_client__";
 * any OIDC-compliant identity provider (team plan+ only).
 */
 const allProviderTypes = [...standardProviders, "custom_oidc"];
-
 //#endregion
 exports.allProviderTypes = allProviderTypes;
 exports.allProviders = allProviders;
 exports.publishableClientKeyNotNecessarySentinel = publishableClientKeyNotNecessarySentinel;
 exports.sharedProviders = sharedProviders;
 exports.standardProviders = standardProviders;
+
 //# sourceMappingURL=oauth.js.map

package/dist/utils/oauth.js.map

@@ -1 +1 @@
-{"version":3,"file":"oauth.js","names":[],"sources":["../../src/utils/oauth.tsx"],"sourcesContent":["export const standardProviders = [\"google\", \"github\", \"microsoft\", \"spotify\", \"facebook\", \"discord\", \"gitlab\", \"bitbucket\", \"linkedin\", \"apple\", \"x\", \"twitch\"] as const;\n// No more shared providers should be added except for special cases\nexport const sharedProviders = [\"google\", \"github\", \"microsoft\", \"spotify\"] as const;\nexport const allProviders = standardProviders;\nexport const publishableClientKeyNotNecessarySentinel = \"__stack_public_client__\";\n\n/**\n * All provider types including custom OIDC. Standard providers are the\n * predefined set with first-class support; \"custom_oidc\" lets users bring\n * any OIDC-compliant identity provider (team plan+ only).\n */\nexport const allProviderTypes = [...standardProviders, \"custom_oidc\"] as const;\nexport type AllProviderType = typeof allProviderTypes[number];\n\nexport type ProviderType = typeof allProviders[number];\nexport type StandardProviderType = typeof standardProviders[number];\nexport type SharedProviderType = typeof sharedProviders[number];\n"],"mappings":";;;AAAA,MAAa,oBAAoB;CAAC;CAAU;CAAU;CAAa;CAAW;CAAY;CAAW;CAAU;CAAa;CAAY;CAAS;CAAK;CAAS;AAE/J,MAAa,kBAAkB;CAAC;CAAU;CAAU;CAAa;CAAU;AAC3E,MAAa,eAAe;AAC5B,MAAa,2CAA2C;;;;;;AAOxD,MAAa,mBAAmB,CAAC,GAAG,mBAAmB,cAAc"}
+{"version":3,"file":"oauth.js","names":[],"sources":["../../src/utils/oauth.tsx"],"sourcesContent":["export const standardProviders = [\"google\", \"github\", \"microsoft\", \"spotify\", \"facebook\", \"discord\", \"gitlab\", \"bitbucket\", \"linkedin\", \"apple\", \"x\", \"twitch\"] as const;\n// No more shared providers should be added except for special cases\nexport const sharedProviders = [\"google\", \"github\", \"microsoft\", \"spotify\"] as const;\nexport const allProviders = standardProviders;\nexport const publishableClientKeyNotNecessarySentinel = \"__stack_public_client__\";\n\n/**\n * All provider types including custom OIDC. Standard providers are the\n * predefined set with first-class support; \"custom_oidc\" lets users bring\n * any OIDC-compliant identity provider (team plan+ only).\n */\nexport const allProviderTypes = [...standardProviders, \"custom_oidc\"] as const;\nexport type AllProviderType = typeof allProviderTypes[number];\n\nexport type ProviderType = typeof allProviders[number];\nexport type StandardProviderType = typeof standardProviders[number];\nexport type SharedProviderType = typeof sharedProviders[number];\n"],"mappings":";;AAAA,MAAa,oBAAoB;CAAC;CAAU;CAAU;CAAa;CAAW;CAAY;CAAW;CAAU;CAAa;CAAY;CAAS;CAAK;AAAQ;AAE9J,MAAa,kBAAkB;CAAC;CAAU;CAAU;CAAa;AAAS;AAC1E,MAAa,eAAe;AAC5B,MAAa,2CAA2C;;;;;;AAOxD,MAAa,mBAAmB,CAAC,GAAG,mBAAmB,aAAa"}

package/dist/utils/objects.d.ts

@@ -1,59 +1,2 @@
-//#region src/utils/objects.d.ts
-declare function isNotNull<T>(value: T): value is NonNullable<T>;
-type DeepPartial<T> = T extends object ? (T extends any[] ? { [P in keyof T]: DeepPartial<T[P]> } : { [P in keyof T]?: DeepPartial<T[P]> }) : T;
-type DeepRequired<T> = T extends object ? { [P in keyof T]-?: DeepRequired<T[P]> } : T;
-type DeepRequiredOrUndefined<T> = T extends object ? { [P in keyof { [K in keyof T]-?: K }]: DeepRequiredOrUndefined<T[P]> } : T;
-/**
- * Assumes both objects are primitives, arrays, or non-function plain objects, and compares them deeply.
- *
- * Note that since they are assumed to be plain objects, this function does not compare prototypes.
- */
-declare function deepPlainEquals<T>(obj1: T, obj2: unknown, options?: {
-  ignoreUndefinedValues?: boolean;
-}): obj2 is T;
-declare function isCloneable<T>(obj: T): obj is Exclude<T, symbol | Function>;
-declare function shallowClone<T extends object>(obj: T): T;
-declare function deepPlainClone<T>(obj: T): T;
-type DeepMerge<T, U> = U extends any ? DeepMergeNonDistributive<T, U> : never;
-type DeepMergeNonDistributive<T, U> = Omit<T, keyof U> & Omit<U, keyof T> & DeepMergeInner<Pick<T, keyof U & keyof T>, Pick<U, keyof U & keyof T>>;
-type DeepMergeInner<T, U> = { [K in { [Ki in keyof U]-?: Ki }[keyof U]]: undefined extends U[K] ? K extends keyof T ? T[K] extends object ? Exclude<U[K], undefined> extends object ? DeepMerge<T[K], Exclude<U[K], undefined>> : T[K] | Exclude<U[K], undefined> : T[K] | Exclude<U[K], undefined> : Exclude<U[K], undefined> : K extends keyof T ? T[K] extends object ? U[K] extends object ? DeepMerge<T[K], U[K]> : U[K] : U[K] : U[K] };
-declare function deepMerge<T extends {}, U extends {}>(baseObj: T, mergeObj: U): DeepMerge<T, U>;
-type DeepOmit<T, U> = T extends object ? { [K in keyof T]: K extends keyof U ? (T[K] extends U[K] ? undefined : T[K]) : T[K] } : (T extends U ? undefined : T);
-declare function typedEntries<T extends {}>(obj: T): [Exclude<keyof T, number>, T[keyof T]][];
-declare function typedFromEntries<K extends PropertyKey, V>(entries: (readonly [K, V])[]): Record<K, V>;
-declare function typedKeys<T extends {}>(obj: T): (Exclude<keyof T, number>)[];
-declare function typedValues<T extends {}>(obj: T): T[keyof T][];
-declare function typedAssign<T extends {}, U extends {}>(target: T, source: U): T & U;
-type FilterUndefined<T> = { [k in keyof T as (undefined extends T[k] ? (T[k] extends undefined | void ? never : k) : never)]+?: T[k] & ({} | null) } & { [k in keyof T as (undefined extends T[k] ? never : k)]: T[k] & ({} | null) };
-/**
- * Returns a new object with all undefined values removed. Useful when spreading optional parameters on an object, as
- * TypeScript's `Partial<XYZ>` type allows `undefined` values.
- */
-declare function filterUndefined<T extends object>(obj: T): FilterUndefined<T>;
-type FilterUndefinedOrNull<T> = FilterUndefined<{ [k in keyof T]: null extends T[k] ? NonNullable<T[k]> | undefined : T[k] }>;
-/**
- * Returns a new object with all undefined and null values removed. Useful when spreading optional parameters on an object, as
- * TypeScript's `Partial<XYZ>` type allows `undefined` values.
- */
-declare function filterUndefinedOrNull<T extends object>(obj: T): FilterUndefinedOrNull<T>;
-type DeepFilterUndefined<T> = T extends object ? FilterUndefined<{ [K in keyof T]: DeepFilterUndefined<T[K]> }> : T;
-declare function deepFilterUndefined<T extends object>(obj: T): DeepFilterUndefined<T>;
-declare function pick<T extends {}, K extends keyof T>(obj: T, keys: K[]): Pick<T, K>;
-declare function omit<T extends {}, K extends keyof T>(obj: T, keys: K[]): Omit<T, K>;
-declare function split<T extends {}, K extends keyof T>(obj: T, keys: K[]): [Pick<T, K>, Omit<T, K>];
-declare function mapValues<T extends object, U>(obj: T, fn: (value: T extends (infer E)[] ? E : T[keyof T], key: keyof T) => U): Record<keyof T, U>;
-declare function sortKeys<T extends object>(obj: T): T;
-declare function deepSortKeys<T extends object>(obj: T): T;
-declare function set<T extends object, K extends PropertyKey = keyof T>(obj: T, key: K, value: T[K & keyof T]): void;
-declare function get<T extends object, K extends PropertyKey = keyof T>(obj: T, key: K): T[K & keyof T];
-declare function getOrUndefined<T extends object, K extends PropertyKey = keyof T>(obj: T, key: K): T[K & keyof T] | undefined;
-declare function has<T extends object, K extends PropertyKey = keyof T>(obj: T, key: K): obj is T & { [k in K & keyof T]: unknown };
-declare function hasAndNotUndefined<T extends object, K extends keyof T>(obj: T, key: K): obj is T & { [k in K]: Exclude<T[K], undefined> };
-declare function deleteKey<T extends object, K extends keyof T>(obj: T, key: K): void;
-/**
- * Returns true iff the value is an object or a function, but not null.
- */
-declare function isObjectLike(value: unknown): value is object | Function;
-//#endregion
-export { DeepFilterUndefined, DeepMerge, DeepOmit, DeepPartial, DeepRequired, DeepRequiredOrUndefined, FilterUndefined, FilterUndefinedOrNull, deepFilterUndefined, deepMerge, deepPlainClone, deepPlainEquals, deepSortKeys, deleteKey, filterUndefined, filterUndefinedOrNull, get, getOrUndefined, has, hasAndNotUndefined, isCloneable, isNotNull, isObjectLike, mapValues, omit, pick, set, shallowClone, sortKeys, split, typedAssign, typedEntries, typedFromEntries, typedKeys, typedValues };
-//# sourceMappingURL=objects.d.ts.map
+import { A as split, C as isObjectLike, D as set, E as pick, F as typedValues, M as typedEntries, N as typedFromEntries, O as shallowClone, P as typedKeys, S as isNotNull, T as omit, _ as get, a as DeepRequired, b as hasAndNotUndefined, c as FilterUndefinedOrNull, d as deepPlainClone, f as deepPlainEquals, g as filterUndefinedOrNull, h as filterUndefined, i as DeepPartial, j as typedAssign, k as sortKeys, l as deepFilterUndefined, m as deleteKey, n as DeepMerge, o as DeepRequiredOrUndefined, p as deepSortKeys, r as DeepOmit, s as FilterUndefined, t as DeepFilterUndefined, u as deepMerge, v as getOrUndefined, w as mapValues, x as isCloneable, y as has } from "../objects-DkCkeBWE.js";
+export { DeepFilterUndefined, DeepMerge, DeepOmit, DeepPartial, DeepRequired, DeepRequiredOrUndefined, FilterUndefined, FilterUndefinedOrNull, deepFilterUndefined, deepMerge, deepPlainClone, deepPlainEquals, deepSortKeys, deleteKey, filterUndefined, filterUndefinedOrNull, get, getOrUndefined, has, hasAndNotUndefined, isCloneable, isNotNull, isObjectLike, mapValues, omit, pick, set, shallowClone, sortKeys, split, typedAssign, typedEntries, typedFromEntries, typedKeys, typedValues };