@evolu/common 6.0.1-preview.3 → 6.0.1-preview.30

package/dist/src/ManyToManyMap.d.ts

@@ -1,17 +1,72 @@
-/** Represents a many-to-many mapping between keys and values. */
+/**
+ * Bidirectional many-to-many map between keys and values.
+ *
+ * Why useful:
+ *
+ * - Provides O(1) (amortized) forward lookup (key -> values) and reverse lookup
+ *   (value -> keys) without maintaining two maps manually and risking them
+ *   diverging.
+ * - Natural fit for pub/sub style relations such as ownerId ↔ WebSocket, tag ↔
+ *   item, user ↔ role, entity ↔ subscription where both directions are
+ *   frequently queried.
+ * - Supports fast membership tests via `hasPair`, `hasKey`, and `hasValue`.
+ * - Iteration helpers (`forEach`, iterator) allow treating the structure as an
+ *   edge list when needed.
+ *
+ * Complexity:
+ *
+ * - `add` / `remove` / `has*` / `get*` each perform a constant number of Map/Set
+ *   operations (O(1) expected).
+ * - `deleteKey` and `deleteValue` are O(d) where d is the number of associated
+ *   values / keys (the degree). This is optimal because every associated pair
+ *   must be touched once.
+ *
+ * Object identity:
+ *
+ * - Keys and values are compared by reference (standard Map / Set semantics).
+ *   Structural hashing of objects in JavaScript is non-trivial, can be
+ *   expensive, and collision-prone if done naively. Prefer using stable
+ *   primitive identifiers (ids, strings) instead of attempting to hash full
+ *   object structures.
+ * - If structural equivalence is truly required, wrap objects in an adapter that
+ *   supplies a canonical hash/id and stores/retrieves the original objects
+ *   separately. This is a rare need; avoid unless you have clear requirements.
+ */
 export interface ManyToManyMap<K, V> {
-    /** Adds a key-value association to the map. */
-    add: (key: K, value: V) => ManyToManyMap<K, V>;
-    /** Removes a specific key-value association. */
+    /**
+     * Adds a key-value association to the map. Returns true if the pair was newly
+     * added, false if it already existed.
+     */
+    add: (key: K, value: V) => boolean;
+    /**
+     * Removes a specific key-value association. Returns true if the pair existed
+     * and was removed, false if it was not present.
+     */
     remove: (key: K, value: V) => boolean;
-    /** Gets all values associated with a key. */
-    getValues: (key: K) => Set<V> | undefined;
-    /** Gets all keys associated with a value. */
-    getKeys: (value: V) => Set<K> | undefined;
+    /**
+     * Gets all values associated with a key. Returned set is the internal Set
+     * instance typed as ReadonlySet. Do not mutate.
+     */
+    getValues: (key: K) => ReadonlySet<V> | undefined;
+    /**
+     * Gets all keys associated with a value. Returned set is the internal Set
+     * instance typed as ReadonlySet. Do not mutate.
+     */
+    getKeys: (value: V) => ReadonlySet<K> | undefined;
+    /**
+     * Iterates over each key-value pair (in insertion order of keys, then values
+     * per key).
+     */
+    forEach: (callback: (key: K, value: V) => void) => void;
+    /**
+     * Iterator over all key-value pairs enabling for..of and spread. Yields
+     * readonly [key, value] tuples.
+     */
+    readonly [Symbol.iterator]: () => IterableIterator<readonly [K, V]>;
     /** Checks if a specific key-value pair exists. */
     hasPair: (key: K, value: V) => boolean;
     /** Checks if a key exists in the map. */
-    hasKey(key: K): boolean;
+    hasKey: (key: K) => boolean;
     /** Checks if a value exists in the map. */
     hasValue: (value: V) => boolean;
     /** Deletes all associations for a key. */
@@ -19,7 +74,13 @@ export interface ManyToManyMap<K, V> {
     /** Deletes all associations for a value. */
     deleteValue: (value: V) => boolean;
     /** Clears all associations in the map. */
-    clear(): void;
+    clear: () => void;
+    /** Number of distinct keys currently present. */
+    keyCount: () => number;
+    /** Number of distinct values currently present. */
+    valueCount: () => number;
+    /** Number of key-value pairs (associations) currently stored. */
+    pairCount: () => number;
 }
 /** Creates a {@link ManyToManyMap}. */
 export declare const createManyToManyMap: <K, V>() => ManyToManyMap<K, V>;

package/dist/src/ManyToManyMap.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ManyToManyMap.d.ts","sourceRoot":"","sources":["../../src/ManyToManyMap.ts"],"names":[],"mappings":"AAAA,iEAAiE;AACjE,MAAM,WAAW,aAAa,CAAC,CAAC,EAAE,CAAC;IACjC,+CAA+C;IAC/C,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAE/C,gDAAgD;IAChD,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,OAAO,CAAC;IAEtC,6CAA6C;IAC7C,SAAS,EAAE,CAAC,GAAG,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;IAE1C,6CAA6C;IAC7C,OAAO,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;IAE1C,kDAAkD;IAClD,OAAO,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,OAAO,CAAC;IAEvC,yCAAyC;IACzC,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO,CAAC;IAExB,2CAA2C;IAC3C,QAAQ,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,CAAC;IAEhC,0CAA0C;IAC1C,SAAS,EAAE,CAAC,GAAG,EAAE,CAAC,KAAK,OAAO,CAAC;IAE/B,4CAA4C;IAC5C,WAAW,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,CAAC;IAEnC,0CAA0C;IAC1C,KAAK,IAAI,IAAI,CAAC;CACf;AAED,uCAAuC;AACvC,eAAO,MAAM,mBAAmB,GAAI,CAAC,EAAE,CAAC,OAAK,aAAa,CAAC,CAAC,EAAE,CAAC,CAyG9D,CAAC"}
+{"version":3,"file":"ManyToManyMap.d.ts","sourceRoot":"","sources":["../../src/ManyToManyMap.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AACH,MAAM,WAAW,aAAa,CAAC,CAAC,EAAE,CAAC;IACjC;;;OAGG;IACH,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,OAAO,CAAC;IAEnC;;;OAGG;IACH,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,OAAO,CAAC;IAEtC;;;OAGG;IACH,SAAS,EAAE,CAAC,GAAG,EAAE,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;IAElD;;;OAGG;IACH,OAAO,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;IAElD;;;OAGG;IACH,OAAO,EAAE,CAAC,QAAQ,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,IAAI,KAAK,IAAI,CAAC;IAExD;;;OAGG;IACH,QAAQ,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,MAAM,gBAAgB,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAEpE,kDAAkD;IAClD,OAAO,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,OAAO,CAAC;IAEvC,yCAAyC;IACzC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,KAAK,OAAO,CAAC;IAE5B,2CAA2C;IAC3C,QAAQ,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,CAAC;IAEhC,0CAA0C;IAC1C,SAAS,EAAE,CAAC,GAAG,EAAE,CAAC,KAAK,OAAO,CAAC;IAE/B,4CAA4C;IAC5C,WAAW,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,CAAC;IAEnC,0CAA0C;IAC1C,KAAK,EAAE,MAAM,IAAI,CAAC;IAElB,iDAAiD;IACjD,QAAQ,EAAE,MAAM,MAAM,CAAC;IACvB,mDAAmD;IACnD,UAAU,EAAE,MAAM,MAAM,CAAC;IACzB,iEAAiE;IACjE,SAAS,EAAE,MAAM,MAAM,CAAC;CACzB;AAED,uCAAuC;AACvC,eAAO,MAAM,mBAAmB,GAAI,CAAC,EAAE,CAAC,OAAK,aAAa,CAAC,CAAC,EAAE,CAAC,CA2I9D,CAAC"}

package/dist/src/ManyToManyMap.js

@@ -1,10 +1,14 @@
+import { assert } from "./Assert.js";
 /** Creates a {@link ManyToManyMap}. */
 export const createManyToManyMap = () => {
     const forwardMap = new Map();
     const reverseMap = new Map();
+    let pairCountInternal = 0;
     const map = {
         add(key, value) {
             let values = forwardMap.get(key);
+            if (values?.has(value))
+                return false;
             if (!values) {
                 values = new Set();
                 forwardMap.set(key, values);
@@ -16,7 +20,8 @@ export const createManyToManyMap = () => {
                 reverseMap.set(value, keys);
             }
             keys.add(key);
-            return map;
+            pairCountInternal++;
+            return true;
         },
         remove(key, value) {
             const values = forwardMap.get(key);
@@ -27,12 +32,12 @@ export const createManyToManyMap = () => {
                 forwardMap.delete(key);
             }
             const keys = reverseMap.get(value);
-            if (keys?.size) {
-                keys.delete(key);
-                if (keys.size === 0) {
-                    reverseMap.delete(value);
-                }
+            assert(keys, "Key-value mapping inconsistency");
+            keys.delete(key);
+            if (keys.size === 0) {
+                reverseMap.delete(value);
             }
+            pairCountInternal--;
             return true;
         },
         getValues(key) {
@@ -41,6 +46,22 @@ export const createManyToManyMap = () => {
         getKeys(value) {
             return reverseMap.get(value);
         },
+        forEach(callback) {
+            for (const [key, values] of forwardMap) {
+                for (const value of values)
+                    callback(key, value);
+            }
+        },
+        [Symbol.iterator]() {
+            const iterator = function* () {
+                for (const [key, values] of forwardMap) {
+                    for (const value of values) {
+                        yield [key, value];
+                    }
+                }
+            };
+            return iterator();
+        },
         hasPair(key, value) {
             const values = forwardMap.get(key);
             return values?.has(value) ?? false;
@@ -55,6 +76,7 @@ export const createManyToManyMap = () => {
             const values = forwardMap.get(key);
             if (!values)
                 return false;
+            const removed = values.size;
             for (const value of values) {
                 const keys = reverseMap.get(value);
                 if (keys) {
@@ -65,12 +87,14 @@ export const createManyToManyMap = () => {
                 }
             }
             forwardMap.delete(key);
+            pairCountInternal -= removed;
             return true;
         },
         deleteValue(value) {
             const keys = reverseMap.get(value);
             if (!keys)
                 return false;
+            const removed = keys.size;
             for (const key of keys) {
                 const values = forwardMap.get(key);
                 if (values) {
@@ -81,11 +105,22 @@ export const createManyToManyMap = () => {
                 }
             }
             reverseMap.delete(value);
+            pairCountInternal -= removed;
             return true;
         },
         clear() {
             forwardMap.clear();
             reverseMap.clear();
+            pairCountInternal = 0;
+        },
+        keyCount() {
+            return forwardMap.size;
+        },
+        valueCount() {
+            return reverseMap.size;
+        },
+        pairCount() {
+            return pairCountInternal;
         },
     };
     return map;

package/dist/src/Number.d.ts

@@ -1,7 +1,8 @@
 import { NonEmptyReadonlyArray } from "./Array.js";
 import { Result } from "./Result.js";
 import { NonNegativeInt, PositiveInt } from "./Type.js";
-import { IsBranded, Predicate, WidenLiteral } from "./Types.js";
+import { Predicate, WidenLiteral } from "./Types.js";
+import { IsBranded } from "./Brand.js";
 export declare const increment: (n: number) => number;
 export declare const decrement: (n: number) => number;
 /** Clamps a number within a given range. */
@@ -36,7 +37,7 @@ export declare const max: <T extends number>(...values: [T, ...ReadonlyArray<T>]
  */
 export declare const computeBalancedBuckets: (numberOfItems: NonNegativeInt, 
 /** Default: 16 */
-numberOfBuckets?: PositiveInt, 
+numberOfBuckets?: number & import("./Brand.js").Brand<"Int"> & import("./Brand.js").Brand<"NonNegative"> & import("./Brand.js").Brand<"Positive">, 
 /** Default: 2 */
-minNumberOfItemsPerBucket?: PositiveInt) => Result<NonEmptyReadonlyArray<PositiveInt>, PositiveInt>;
+minNumberOfItemsPerBucket?: number & import("./Brand.js").Brand<"Int"> & import("./Brand.js").Brand<"NonNegative"> & import("./Brand.js").Brand<"Positive">) => Result<NonEmptyReadonlyArray<PositiveInt>, PositiveInt>;
 //# sourceMappingURL=Number.d.ts.map

package/dist/src/Number.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Number.d.ts","sourceRoot":"","sources":["../../src/Number.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,qBAAqB,EAAE,MAAM,YAAY,CAAC;AAEnD,OAAO,EAAW,MAAM,EAAE,MAAM,aAAa,CAAC;AAC9C,OAAO,EAAE,cAAc,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AACxD,OAAO,EAEL,SAAS,EACT,SAAS,EACT,YAAY,EACb,MAAM,YAAY,CAAC;AAEpB,eAAO,MAAM,SAAS,GAAI,GAAG,MAAM,KAAG,MAAe,CAAC;AAEtD,eAAO,MAAM,SAAS,GAAI,GAAG,MAAM,KAAG,MAAe,CAAC;AAEtD,4CAA4C;AAC5C,eAAO,MAAM,KAAK,GACf,KAAK,MAAM,EAAE,KAAK,MAAM,MACxB,GAAG,MAAM,KAAG,MACoB,CAAC;AAEpC;;;;;;;;;;GAUG;AACH,eAAO,MAAM,SAAS,GACnB,KAAK,MAAM,EAAE,KAAK,MAAM,KAAG,SAAS,CAAC,MAAM,CAEd,CAAC;AAEjC,wEAAwE;AACxE,eAAO,MAAM,GAAG,GAAI,CAAC,SAAS,MAAM,EAClC,GAAG,QAAQ,CAAC,CAAC,EAAE,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,KAClC,SAAS,CAAC,CAAC,CAAC,SAAS,IAAI,GAAG,CAAC,GAAG,YAAY,CAAC,CAAC,CACa,CAAC;AAE/D,wEAAwE;AACxE,eAAO,MAAM,GAAG,GAAI,CAAC,SAAS,MAAM,EAClC,GAAG,QAAQ,CAAC,CAAC,EAAE,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,KAClC,SAAS,CAAC,CAAC,CAAC,SAAS,IAAI,GAAG,CAAC,GAAG,YAAY,CAAC,CAAC,CACa,CAAC;AAE/D;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,sBAAsB,GACjC,eAAe,cAAc;AAE7B,kBAAkB;AAClB,kBAAwB,WAAW;AAEnC,iBAAiB;AACjB,4BAAiC,WAAW,KAC3C,MAAM,CAAC,qBAAqB,CAAC,WAAW,CAAC,EAAE,WAAW,CAoBxD,CAAC"}
+{"version":3,"file":"Number.d.ts","sourceRoot":"","sources":["../../src/Number.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,qBAAqB,EAAE,MAAM,YAAY,CAAC;AAEnD,OAAO,EAAW,MAAM,EAAE,MAAM,aAAa,CAAC;AAC9C,OAAO,EAAE,cAAc,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AACxD,OAAO,EAAoB,SAAS,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AACvE,OAAO,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAEvC,eAAO,MAAM,SAAS,GAAI,GAAG,MAAM,KAAG,MAAe,CAAC;AAEtD,eAAO,MAAM,SAAS,GAAI,GAAG,MAAM,KAAG,MAAe,CAAC;AAEtD,4CAA4C;AAC5C,eAAO,MAAM,KAAK,GACf,KAAK,MAAM,EAAE,KAAK,MAAM,MACxB,GAAG,MAAM,KAAG,MACoB,CAAC;AAEpC;;;;;;;;;;GAUG;AACH,eAAO,MAAM,SAAS,GACnB,KAAK,MAAM,EAAE,KAAK,MAAM,KAAG,SAAS,CAAC,MAAM,CAEd,CAAC;AAEjC,wEAAwE;AACxE,eAAO,MAAM,GAAG,GAAI,CAAC,SAAS,MAAM,EAClC,GAAG,QAAQ,CAAC,CAAC,EAAE,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,KAClC,SAAS,CAAC,CAAC,CAAC,SAAS,IAAI,GAAG,CAAC,GAAG,YAAY,CAAC,CAAC,CACa,CAAC;AAE/D,wEAAwE;AACxE,eAAO,MAAM,GAAG,GAAI,CAAC,SAAS,MAAM,EAClC,GAAG,QAAQ,CAAC,CAAC,EAAE,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,KAClC,SAAS,CAAC,CAAC,CAAC,SAAS,IAAI,GAAG,CAAC,GAAG,YAAY,CAAC,CAAC,CACa,CAAC;AAE/D;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,sBAAsB,GACjC,eAAe,cAAc;AAE7B,kBAAkB;AAClB,iJAAyC;AAEzC,iBAAiB;AACjB,2JAAkD,KACjD,MAAM,CAAC,qBAAqB,CAAC,WAAW,CAAC,EAAE,WAAW,CAoBxD,CAAC"}

package/dist/src/Number.js

@@ -1,5 +1,6 @@
 import { assertNonEmptyReadonlyArray } from "./Assert.js";
 import { err, ok } from "./Result.js";
+import { PositiveInt } from "./Type.js";
 export const increment = (n) => n + 1;
 export const decrement = (n) => n - 1;
 /** Clamps a number within a given range. */
@@ -34,12 +35,12 @@ export const max = (...values) => values.reduce((a, b) => (a > b ? a : b));
  */
 export const computeBalancedBuckets = (numberOfItems, 
 /** Default: 16 */
-numberOfBuckets = 16, 
+numberOfBuckets = PositiveInt.orThrow(16), 
 /** Default: 2 */
-minNumberOfItemsPerBucket = 2) => {
+minNumberOfItemsPerBucket = PositiveInt.orThrow(2)) => {
     const minRequiredItems = numberOfBuckets * minNumberOfItemsPerBucket;
     if (numberOfItems < minRequiredItems)
-        return err(minRequiredItems);
+        return err(PositiveInt.orThrow(minRequiredItems));
     const indexes = [];
     const itemsPerBucket = Math.floor(numberOfItems / numberOfBuckets);
     const extraItems = numberOfItems % numberOfBuckets;
@@ -48,7 +49,7 @@ minNumberOfItemsPerBucket = 2) => {
         const hasExtraItem = i < extraItems;
         const itemsInThisBucket = itemsPerBucket + (hasExtraItem ? 1 : 0);
         bucketBoundary += itemsInThisBucket;
-        indexes.push(bucketBoundary);
+        indexes.push(PositiveInt.orThrow(bucketBoundary));
     }
     assertNonEmptyReadonlyArray(indexes);
     return ok(indexes);

package/dist/src/Platform.d.ts

@@ -0,0 +1,20 @@
+/**
+ * Platform detection utilities for Evolu.
+ *
+ * @module
+ */
+/** Detects if the code is running in React Native environment. */
+export declare const isReactNative: boolean;
+/**
+ * Detects if Node.js Buffer is available and should be used.
+ *
+ * React Native apps often polyfill Node.js APIs like Buffer, but we want to use
+ * native methods when available for better performance.
+ *
+ * Returns false in React Native even if Buffer is polyfilled, as we prefer
+ * native methods in that environment.
+ *
+ * @see https://github.com/craftzdog/react-native-quick-base64#installation
+ */
+export declare const hasNodeBuffer: boolean;
+//# sourceMappingURL=Platform.d.ts.map

package/dist/src/Platform.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Platform.d.ts","sourceRoot":"","sources":["../../src/Platform.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,kEAAkE;AAClE,eAAO,MAAM,aAAa,SAIoB,CAAC;AAE/C;;;;;;;;;;GAUG;AACH,eAAO,MAAM,aAAa,SACkC,CAAC"}

package/dist/src/Platform.js

@@ -0,0 +1,22 @@
+/**
+ * Platform detection utilities for Evolu.
+ *
+ * @module
+ */
+/** Detects if the code is running in React Native environment. */
+export const isReactNative = typeof navigator !== "undefined" &&
+    "product" in navigator &&
+    // eslint-disable-next-line @typescript-eslint/no-unsafe-member-access
+    navigator.product === "ReactNative";
+/**
+ * Detects if Node.js Buffer is available and should be used.
+ *
+ * React Native apps often polyfill Node.js APIs like Buffer, but we want to use
+ * native methods when available for better performance.
+ *
+ * Returns false in React Native even if Buffer is polyfilled, as we prefer
+ * native methods in that environment.
+ *
+ * @see https://github.com/craftzdog/react-native-quick-base64#installation
+ */
+export const hasNodeBuffer = !isReactNative && typeof globalThis.Buffer !== "undefined";

package/dist/src/Random.d.ts

@@ -5,8 +5,9 @@
  */
 import { Random as RandomLib } from "random";
 /**
- * A simple wrapper around Math.random(). Most apps need only this. For more
- * complex needs check {@link RandomLibDep}.
+ * A simple wrapper around Math.random().
+ *
+ * For more complex needs check {@link RandomLibDep}.
  *
  * ### Example
  *

package/dist/src/Random.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Random.d.ts","sourceRoot":"","sources":["../../src/Random.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,MAAM,IAAI,SAAS,EAAE,MAAM,QAAQ,CAAC;AAE7C;;;;;;;;;;;;;;;GAeG;AACH,MAAM,WAAW,MAAM;IACrB,0EAA0E;IAC1E,IAAI,EAAE,MAAM,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,SAAS;IACxB,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,oDAAoD;AACpD,eAAO,MAAM,YAAY,QAAO,MAE9B,CAAC;AAEH;;;GAGG;AACH,eAAO,MAAM,oBAAoB,GAAI,MAAM,MAAM,KAAG,MAKnD,CAAC;AAEF;;;;GAIG;AACH,MAAM,WAAW,YAAY;IAC3B,MAAM,EAAE,SAAS,CAAC;CACnB;AAED,4DAA4D;AAC5D,eAAO,MAAM,eAAe,QAAO,SAA4B,CAAC;AAEhE;;;GAGG;AACH,eAAO,MAAM,uBAAuB,GAAI,MAAM,MAAM,KAAG,YAErD,CAAC"}
+{"version":3,"file":"Random.d.ts","sourceRoot":"","sources":["../../src/Random.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,MAAM,IAAI,SAAS,EAAE,MAAM,QAAQ,CAAC;AAE7C;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,WAAW,MAAM;IACrB,0EAA0E;IAC1E,IAAI,EAAE,MAAM,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,SAAS;IACxB,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,oDAAoD;AACpD,eAAO,MAAM,YAAY,QAAO,MAE9B,CAAC;AAEH;;;GAGG;AACH,eAAO,MAAM,oBAAoB,GAAI,MAAM,MAAM,KAAG,MAKnD,CAAC;AAEF;;;;GAIG;AACH,MAAM,WAAW,YAAY;IAC3B,MAAM,EAAE,SAAS,CAAC;CACnB;AAED,4DAA4D;AAC5D,eAAO,MAAM,eAAe,QAAO,SAA4B,CAAC;AAEhE;;;GAGG;AACH,eAAO,MAAM,uBAAuB,GAAI,MAAM,MAAM,KAAG,YAErD,CAAC"}

package/dist/src/Resources.d.ts

@@ -0,0 +1,118 @@
+import { Result } from "./Result.js";
+/**
+ * A generic resource manager that handles reference counting and delayed
+ * disposal of shared resources. Useful for managing expensive resources like
+ * WebSocket connections that need to be shared among multiple consumers.
+ */
+export interface Resources<TResource extends Disposable, TResourceKey extends string, TResourceConfig, TConsumer, TConsumerId extends string> extends Disposable {
+    /**
+     * Adds a consumer to resources, creating them if necessary. Increments
+     * reference counts for existing consumer-resource pairs.
+     */
+    readonly addConsumer: (consumer: TConsumer, resourceConfigs: ReadonlyArray<TResourceConfig>) => void;
+    /**
+     * Removes a consumer from resources. Decrements reference counts and
+     * schedules disposal when no consumers remain.
+     *
+     * Returns an error if the resource doesn't exist or if the consumer wasn't
+     * added to the resource.
+     */
+    readonly removeConsumer: (consumer: TConsumer, resourceConfigs: ReadonlyArray<TResourceConfig>) => Result<void, ResourceNotFoundError<TResourceKey> | ConsumerNotFoundError<TConsumerId, TResourceKey>>;
+    /** Gets the resource for the specified key, or null if it doesn't exist. */
+    readonly getResource: (key: TResourceKey) => TResource | null;
+    /** Gets all consumer IDs currently using the specified resource key. */
+    readonly getConsumersForResource: (key: TResourceKey) => ReadonlyArray<TConsumerId>;
+    /** Checks if a consumer is currently using any resources. */
+    readonly hasConsumerAnyResource: (consumer: TConsumer) => boolean;
+    /**
+     * Gets the consumer for the specified consumer ID, or null if not found or
+     * not using any resources.
+     */
+    readonly getConsumer: (consumerId: TConsumerId) => TConsumer | null;
+}
+/** Error when trying to remove a consumer from a resource that doesn't exist. */
+export interface ResourceNotFoundError<TResourceKey extends string = string> {
+    readonly type: "ResourceNotFoundError";
+    readonly resourceKey: TResourceKey;
+}
+/** Error when trying to remove a consumer that wasn't added to a resource. */
+export interface ConsumerNotFoundError<TConsumerId extends string = string, TResourceKey extends string = string> {
+    readonly type: "ConsumerNotFoundError";
+    readonly consumerId: TConsumerId;
+    readonly resourceKey: TResourceKey;
+}
+export interface ResourcesConfig<TResource extends Disposable, TResourceKey extends string, TResourceConfig, TConsumer, TConsumerId extends string> {
+    /** Creates a new resource for the given config. */
+    readonly createResource: (config: TResourceConfig) => TResource;
+    /** Extracts a unique key from a resource config for deduplication. */
+    readonly getResourceKey: (config: TResourceConfig) => TResourceKey;
+    /** Extracts a unique identifier from a consumer for reference counting. */
+    readonly getConsumerId: (consumer: TConsumer) => TConsumerId;
+    /**
+     * Delay in milliseconds before disposing unused resources. Helps avoid
+     * resource churn during rapid add/remove cycles. Defaults to 100ms.
+     */
+    readonly disposalDelay?: number;
+    /**
+     * Called when a consumer is added to a resource for the first time. This
+     * happens when the consumer's reference count goes from 0 to 1 for this
+     * resource.
+     */
+    readonly onConsumerAdded?: (consumer: TConsumer, resource: TResource, resourceKey: TResourceKey) => void;
+    /**
+     * Called when a consumer is completely removed from a resource. This happens
+     * when the consumer's reference count goes from 1 to 0 for this resource.
+     */
+    readonly onConsumerRemoved?: (consumer: TConsumer, resource: TResource, resourceKey: TResourceKey) => void;
+}
+/**
+ * Creates {@link Resources}.
+ *
+ * This tracks which consumers are using which resources and maintains reference
+ * counts to know when it's safe to dispose resources. Resources are created
+ * on-demand and disposed with a configurable delay to avoid churn.
+ *
+ * ### Example Usage
+ *
+ * ```ts
+ * // WebSocket connections
+ * interface WebSocketConfig {
+ *   readonly url: WebSocketUrl;
+ * }
+ *
+ * type WebSocketUrl = string & Brand<"WebSocketUrl">;
+ * type UserId = string & Brand<"UserId">;
+ *
+ * const webSockets = createResources<
+ *   WebSocket,
+ *   WebSocketUrl,
+ *   WebSocketConfig,
+ *   User,
+ *   UserId
+ * >({
+ *   createResource: (config) => new WebSocket(config.url),
+ *   getResourceKey: (config) => config.url,
+ *   getConsumerId: (user) => user.id,
+ *   disposalDelay: 1000,
+ * });
+ *
+ * // Add users to WebSocket connections
+ * webSockets.addConsumer(user1, [
+ *   { url: "ws://server1.com" as WebSocketUrl },
+ *   { url: "ws://server2.com" as WebSocketUrl },
+ * ]);
+ * webSockets.addConsumer(user2, [
+ *   { url: "ws://server1.com" as WebSocketUrl },
+ * ]);
+ *
+ * // Remove users - server1 stays alive (user2 still using it)
+ * webSockets.removeConsumer(user1, [
+ *   { url: "ws://server1.com" as WebSocketUrl },
+ *   { url: "ws://server2.com" as WebSocketUrl },
+ * ]);
+ *
+ * // server2 gets disposed after delay, server1 stays alive
+ * ```
+ */
+export declare const createResources: <TResource extends Disposable, TResourceKey extends string, TResourceConfig, TConsumer, TConsumerId extends string>(config: ResourcesConfig<TResource, TResourceKey, TResourceConfig, TConsumer, TConsumerId>) => Resources<TResource, TResourceKey, TResourceConfig, TConsumer, TConsumerId>;
+//# sourceMappingURL=Resources.d.ts.map

package/dist/src/Resources.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Resources.d.ts","sourceRoot":"","sources":["../../src/Resources.ts"],"names":[],"mappings":"AAAA,OAAO,EAAW,MAAM,EAAE,MAAM,aAAa,CAAC;AAG9C;;;;GAIG;AACH,MAAM,WAAW,SAAS,CACxB,SAAS,SAAS,UAAU,EAC5B,YAAY,SAAS,MAAM,EAC3B,eAAe,EACf,SAAS,EACT,WAAW,SAAS,MAAM,CAC1B,SAAQ,UAAU;IAClB;;;OAGG;IACH,QAAQ,CAAC,WAAW,EAAE,CACpB,QAAQ,EAAE,SAAS,EACnB,eAAe,EAAE,aAAa,CAAC,eAAe,CAAC,KAC5C,IAAI,CAAC;IAEV;;;;;;OAMG;IACH,QAAQ,CAAC,cAAc,EAAE,CACvB,QAAQ,EAAE,SAAS,EACnB,eAAe,EAAE,aAAa,CAAC,eAAe,CAAC,KAC5C,MAAM,CACT,IAAI,EACF,qBAAqB,CAAC,YAAY,CAAC,GACnC,qBAAqB,CAAC,WAAW,EAAE,YAAY,CAAC,CACnD,CAAC;IAEF,4EAA4E;IAC5E,QAAQ,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,YAAY,KAAK,SAAS,GAAG,IAAI,CAAC;IAE9D,wEAAwE;IACxE,QAAQ,CAAC,uBAAuB,EAAE,CAChC,GAAG,EAAE,YAAY,KACd,aAAa,CAAC,WAAW,CAAC,CAAC;IAEhC,6DAA6D;IAC7D,QAAQ,CAAC,sBAAsB,EAAE,CAAC,QAAQ,EAAE,SAAS,KAAK,OAAO,CAAC;IAElE;;;OAGG;IACH,QAAQ,CAAC,WAAW,EAAE,CAAC,UAAU,EAAE,WAAW,KAAK,SAAS,GAAG,IAAI,CAAC;CACrE;AAED,iFAAiF;AACjF,MAAM,WAAW,qBAAqB,CAAC,YAAY,SAAS,MAAM,GAAG,MAAM;IACzE,QAAQ,CAAC,IAAI,EAAE,uBAAuB,CAAC;IACvC,QAAQ,CAAC,WAAW,EAAE,YAAY,CAAC;CACpC;AAED,8EAA8E;AAC9E,MAAM,WAAW,qBAAqB,CACpC,WAAW,SAAS,MAAM,GAAG,MAAM,EACnC,YAAY,SAAS,MAAM,GAAG,MAAM;IAEpC,QAAQ,CAAC,IAAI,EAAE,uBAAuB,CAAC;IACvC,QAAQ,CAAC,UAAU,EAAE,WAAW,CAAC;IACjC,QAAQ,CAAC,WAAW,EAAE,YAAY,CAAC;CACpC;AAED,MAAM,WAAW,eAAe,CAC9B,SAAS,SAAS,UAAU,EAC5B,YAAY,SAAS,MAAM,EAC3B,eAAe,EACf,SAAS,EACT,WAAW,SAAS,MAAM;IAE1B,mDAAmD;IACnD,QAAQ,CAAC,cAAc,EAAE,CAAC,MAAM,EAAE,eAAe,KAAK,SAAS,CAAC;IAEhE,sEAAsE;IACtE,QAAQ,CAAC,cAAc,EAAE,CAAC,MAAM,EAAE,eAAe,KAAK,YAAY,CAAC;IAEnE,2EAA2E;IAC3E,QAAQ,CAAC,aAAa,EAAE,CAAC,QAAQ,EAAE,SAAS,KAAK,WAAW,CAAC;IAE7D;;;OAGG;IACH,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,CAAC;IAEhC;;;;OAIG;IACH,QAAQ,CAAC,eAAe,CAAC,EAAE,CACzB,QAAQ,EAAE,SAAS,EACnB,QAAQ,EAAE,SAAS,EACnB,WAAW,EAAE,YAAY,KACtB,IAAI,CAAC;IAEV;;;OAGG;IACH,QAAQ,CAAC,iBAAiB,CAAC,EAAE,CAC3B,QAAQ,EAAE,SAAS,EACnB,QAAQ,EAAE,SAAS,EACnB,WAAW,EAAE,YAAY,KACtB,IAAI,CAAC;CACX;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgDG;AACH,eAAO,MAAM,eAAe,GAC1B,SAAS,SAAS,UAAU,EAC5B,YAAY,SAAS,MAAM,EAC3B,eAAe,EACf,SAAS,EACT,WAAW,SAAS,MAAM,EAE1B,QAAQ,eAAe,CACrB,SAAS,EACT,YAAY,EACZ,eAAe,EACf,SAAS,EACT,WAAW,CACZ,KACA,SAAS,CACV,SAAS,EACT,YAAY,EACZ,eAAe,EACf,SAAS,EACT,WAAW,CAoLZ,CAAC"}

package/dist/src/Resources.js

@@ -0,0 +1,197 @@
+import { err, ok } from "./Result.js";
+import { PositiveInt } from "./Type.js";
+/**
+ * Creates {@link Resources}.
+ *
+ * This tracks which consumers are using which resources and maintains reference
+ * counts to know when it's safe to dispose resources. Resources are created
+ * on-demand and disposed with a configurable delay to avoid churn.
+ *
+ * ### Example Usage
+ *
+ * ```ts
+ * // WebSocket connections
+ * interface WebSocketConfig {
+ *   readonly url: WebSocketUrl;
+ * }
+ *
+ * type WebSocketUrl = string & Brand<"WebSocketUrl">;
+ * type UserId = string & Brand<"UserId">;
+ *
+ * const webSockets = createResources<
+ *   WebSocket,
+ *   WebSocketUrl,
+ *   WebSocketConfig,
+ *   User,
+ *   UserId
+ * >({
+ *   createResource: (config) => new WebSocket(config.url),
+ *   getResourceKey: (config) => config.url,
+ *   getConsumerId: (user) => user.id,
+ *   disposalDelay: 1000,
+ * });
+ *
+ * // Add users to WebSocket connections
+ * webSockets.addConsumer(user1, [
+ *   { url: "ws://server1.com" as WebSocketUrl },
+ *   { url: "ws://server2.com" as WebSocketUrl },
+ * ]);
+ * webSockets.addConsumer(user2, [
+ *   { url: "ws://server1.com" as WebSocketUrl },
+ * ]);
+ *
+ * // Remove users - server1 stays alive (user2 still using it)
+ * webSockets.removeConsumer(user1, [
+ *   { url: "ws://server1.com" as WebSocketUrl },
+ *   { url: "ws://server2.com" as WebSocketUrl },
+ * ]);
+ *
+ * // server2 gets disposed after delay, server1 stays alive
+ * ```
+ */
+export const createResources = (config) => {
+    let isDisposed = false;
+    const resourcesMap = new Map();
+    const consumerCounts = new Map();
+    const consumers = new Map();
+    const disposalTimeouts = new Map();
+    const disposalDelay = config.disposalDelay ?? 100;
+    const ensureResource = (resourceConfig) => {
+        const key = config.getResourceKey(resourceConfig);
+        const timeout = disposalTimeouts.get(key);
+        if (timeout) {
+            clearTimeout(timeout);
+            disposalTimeouts.delete(key);
+        }
+        if (!resourcesMap.has(key)) {
+            const resource = config.createResource(resourceConfig);
+            resourcesMap.set(key, resource);
+        }
+    };
+    const scheduleDisposal = (key) => {
+        const timeout = setTimeout(() => {
+            const resource = resourcesMap.get(key);
+            if (resource) {
+                resource[Symbol.dispose]();
+                resourcesMap.delete(key);
+            }
+            disposalTimeouts.delete(key);
+        }, disposalDelay);
+        disposalTimeouts.set(key, timeout);
+    };
+    const resources = {
+        addConsumer: (consumer, resourceConfigs) => {
+            if (isDisposed)
+                return;
+            const consumerId = config.getConsumerId(consumer);
+            // Store consumer (last added consumer for this ID)
+            consumers.set(consumerId, consumer);
+            for (const resourceConfig of resourceConfigs) {
+                ensureResource(resourceConfig);
+                const resourceKey = config.getResourceKey(resourceConfig);
+                let counts = consumerCounts.get(resourceKey);
+                if (!counts) {
+                    counts = new Map();
+                    consumerCounts.set(resourceKey, counts);
+                }
+                const currentCount = counts.get(consumerId) ?? 0;
+                const newCount = currentCount + 1;
+                counts.set(consumerId, PositiveInt.orThrow(newCount));
+                // Call onConsumerAdded callback only when consumer is added for the first time (0 -> 1)
+                if (currentCount === 0 && config.onConsumerAdded) {
+                    const resource = resourcesMap.get(resourceKey);
+                    if (resource) {
+                        config.onConsumerAdded(consumer, resource, resourceKey);
+                    }
+                }
+            }
+        },
+        removeConsumer: (consumer, resourceConfigs) => {
+            if (isDisposed)
+                return ok();
+            const consumerId = config.getConsumerId(consumer);
+            for (const resourceConfig of resourceConfigs) {
+                const key = config.getResourceKey(resourceConfig);
+                const counts = consumerCounts.get(key);
+                if (!counts) {
+                    return err({ type: "ResourceNotFoundError", resourceKey: key });
+                }
+                const currentCount = counts.get(consumerId);
+                if (currentCount == null) {
+                    return err({
+                        type: "ConsumerNotFoundError",
+                        consumerId: consumerId,
+                        resourceKey: key,
+                    });
+                }
+                if (currentCount === 1) {
+                    counts.delete(consumerId);
+                    // Call onConsumerRemoved callback only when consumer is completely removed (1 -> 0)
+                    if (config.onConsumerRemoved) {
+                        const resource = resourcesMap.get(key);
+                        if (resource) {
+                            config.onConsumerRemoved(consumer, resource, key);
+                        }
+                    }
+                    if (counts.size === 0) {
+                        consumerCounts.delete(key);
+                        scheduleDisposal(key);
+                    }
+                }
+                else {
+                    counts.set(consumerId, PositiveInt.orThrow(currentCount - 1));
+                }
+            }
+            if (!resources.hasConsumerAnyResource(consumer)) {
+                consumers.delete(consumerId);
+            }
+            return ok();
+        },
+        getResource: (key) => {
+            if (isDisposed)
+                return null;
+            return resourcesMap.get(key) ?? null;
+        },
+        getConsumersForResource: (key) => {
+            if (isDisposed)
+                return [];
+            const counts = consumerCounts.get(key);
+            return counts ? Array.from(counts.keys()) : [];
+        },
+        hasConsumerAnyResource: (consumer) => {
+            if (isDisposed)
+                return false;
+            const consumerId = config.getConsumerId(consumer);
+            // If slow, can be optimized with reverse index
+            return Array.from(consumerCounts.values()).some((counts) => counts.has(consumerId));
+        },
+        getConsumer: (consumerId) => {
+            if (isDisposed)
+                return null;
+            const consumer = consumers.get(consumerId);
+            if (!consumer)
+                return null;
+            // Only return consumer if it's currently using any resources
+            if (!resources.hasConsumerAnyResource(consumer)) {
+                return null;
+            }
+            return consumer;
+        },
+        [Symbol.dispose]: () => {
+            if (isDisposed)
+                return;
+            isDisposed = true;
+            for (const timeout of disposalTimeouts.values()) {
+                clearTimeout(timeout);
+            }
+            disposalTimeouts.clear();
+            for (const resource of resourcesMap.values()) {
+                resource[Symbol.dispose]();
+            }
+            resourcesMap.clear();
+            consumerCounts.clear();
+            consumers.clear();
+        },
+    };
+    return resources;
+};