@evolu/common 8.0.0-next.5 → 8.0.0

package/dist/src/Random.d.ts

@@ -1,10 +1,10 @@
 /**
- * Seeded random number generation.
+ * Random number generation.
  *
  * @module
  */
 import { Random as RandomLib } from "random";
-import type { Brand } from "./Brand.js";
+import type { Brand } from "./Brand.ts";
 /**
  * A random floating point number in [0, 1).
  *
@@ -19,41 +19,56 @@ export type RandomNumber = number & Brand<"RandomNumber">;
  * ### Example
  *
  * ```ts
- * // For apps
+ * import {
+ *   createRandom,
+ *   testCreateRandom,
+ *   type RandomNumber,
+ * } from "@evolu/common";
+ *
+ * // For apps, use the Math.random-backed implementation.
  * const random = createRandom();
- * random.next();
+ * const value = random.next();
+ * expectTypeOf(value).toEqualTypeOf<RandomNumber>();
+ * expect(value).toBeGreaterThanOrEqual(0);
+ * expect(value).toBeLessThan(1);
  *
- * // For tests
- * const random = createRandomWithSeed("test");
- * random.next();
+ * // For tests, use a seed.
+ * const firstTestRandom = testCreateRandom("test");
+ * const secondTestRandom = testCreateRandom("test");
+ * expect(firstTestRandom.next()).toBe(secondTestRandom.next());
  * ```
  */
 export interface Random {
     /** Returns a floating point number in [0, 1). Just like Math.random(). */
-    next: () => RandomNumber;
+    readonly next: () => RandomNumber;
 }
 export interface RandomDep {
-    random: Random;
+    readonly random: Random;
 }
 /** Creates a {@link Random} using Math.random(). */
 export declare const createRandom: () => Random;
-/** Creates a seeded {@link Random} for deterministic tests. Default seed "evolu". */
-export declare const testCreateRandom: (seed?: string) => Random;
 /**
- * Creates {@link Random} using {@link RandomLibDep} with a seed which is useful
- * for tests.
+ * Creates a seeded {@link Random} for deterministic tests.
+ *
+ * Default seed "evolu".
  */
-export declare const createRandomWithSeed: (seed: string) => Random;
+export declare const testCreateRandom: (seed?: string) => Random;
 /**
- * A random number generator using the NPM `random` package dependency.
+ * Seedable random number generator supporting many common distributions,
+ * provided by the NPM `random` package.
  *
  * https://github.com/transitive-bullshit/random
  */
 export interface RandomLibDep {
     readonly randomLib: RandomLib;
 }
-/** Creates a `RandomLib` using the NPM `random` package. */
+/** Creates a random number generator from the NPM `random` package. */
 export declare const createRandomLib: () => RandomLib;
-/** Creates a seeded `RandomLib` for deterministic tests. Default seed "evolu". */
+/**
+ * Creates a seeded random number generator from the NPM `random` package for
+ * deterministic tests.
+ *
+ * Default seed "evolu".
+ */
 export declare const testCreateRandomLib: (seed?: string) => RandomLib;
 //# sourceMappingURL=Random.d.ts.map

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;AAC7C,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAExC;;;;GAIG;AACH,MAAM,MAAM,YAAY,GAAG,MAAM,GAAG,KAAK,CAAC,cAAc,CAAC,CAAC;AAE1D;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,WAAW,MAAM;IACrB,0EAA0E;IAC1E,IAAI,EAAE,MAAM,YAAY,CAAC;CAC1B;AAED,MAAM,WAAW,SAAS;IACxB,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,oDAAoD;AACpD,eAAO,MAAM,YAAY,QAAO,MAE9B,CAAC;AAEH,qFAAqF;AACrF,eAAO,MAAM,gBAAgB,GAAI,aAAc,KAAG,MACtB,CAAC;AAE7B;;;GAGG;AACH,eAAO,MAAM,oBAAoB,GAAI,MAAM,MAAM,KAAG,MAKnD,CAAC;AAEF;;;;GAIG;AACH,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC;CAC/B;AAED,4DAA4D;AAC5D,eAAO,MAAM,eAAe,QAAO,SAA4B,CAAC;AAEhE,kFAAkF;AAClF,eAAO,MAAM,mBAAmB,GAAI,aAAc,KAAG,SAChC,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;AAC7C,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAExC;;;;GAIG;AACH,MAAM,MAAM,YAAY,GAAG,MAAM,GAAG,KAAK,CAAC,cAAc,CAAC,CAAC;AAE1D;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,MAAM,WAAW,MAAM;IACrB,0EAA0E;IAC1E,QAAQ,CAAC,IAAI,EAAE,MAAM,YAAY,CAAC;CACnC;AAED,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,oDAAoD;AACpD,eAAO,MAAM,YAAY,QAAO,MAE9B,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,gBAAgB,qBAAqB,MAKjD,CAAC;AAEF;;;;;GAKG;AACH,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC;CAC/B;AAED,uEAAuE;AACvE,eAAO,MAAM,eAAe,QAAO,SAA4B,CAAC;AAEhE;;;;;GAKG;AACH,eAAO,MAAM,mBAAmB,qBAAqB,SAChC,CAAC"}

package/dist/src/Random.js

@@ -1,5 +1,5 @@
 /**
- * Seeded random number generation.
+ * Random number generation.
  *
  * @module
  */
@@ -8,19 +8,23 @@ import { Random as RandomLib } from "random";
 export const createRandom = () => ({
     next: () => Math.random(),
 });
-/** Creates a seeded {@link Random} for deterministic tests. Default seed "evolu". */
-export const testCreateRandom = (seed = "evolu") => createRandomWithSeed(seed);
 /**
- * Creates {@link Random} using {@link RandomLibDep} with a seed which is useful
- * for tests.
+ * Creates a seeded {@link Random} for deterministic tests.
+ *
+ * Default seed "evolu".
  */
-export const createRandomWithSeed = (seed) => {
+export const testCreateRandom = (seed = "evolu") => {
     const random = new RandomLib(seed);
     return {
         next: () => random.next(),
     };
 };
-/** Creates a `RandomLib` using the NPM `random` package. */
+/** Creates a random number generator from the NPM `random` package. */
 export const createRandomLib = () => new RandomLib();
-/** Creates a seeded `RandomLib` for deterministic tests. Default seed "evolu". */
+/**
+ * Creates a seeded random number generator from the NPM `random` package for
+ * deterministic tests.
+ *
+ * Default seed "evolu".
+ */
 export const testCreateRandomLib = (seed = "evolu") => new RandomLib(seed);

package/dist/src/Redacted.d.ts

@@ -3,8 +3,8 @@
  *
  * @module
  */
-import type { Brand } from "./Brand.js";
-import type { Eq } from "./Eq.js";
+import type { Brand } from "./Brand.ts";
+import type { Eq } from "./Eq.ts";
 /**
  * A wrapper type that prevents sensitive values from being accidentally exposed
  * through logging, serialization, or inspection.
@@ -26,35 +26,38 @@ import type { Eq } from "./Eq.js";
  * ### Example
  *
  * ```ts
- * // Define branded types for your secrets
+ * import {
+ *   createRedacted,
+ *   revealRedacted,
+ *   type Brand,
+ *   type Redacted,
+ * } from "@evolu/common";
+ *
  * type ApiKey = string & Brand<"ApiKey">;
  * type DbPassword = string & Brand<"DbPassword">;
- *
- * // Wrap them with Redacted for safe passing
  * type RedactedApiKey = Redacted<ApiKey>;
- * type RedactedDbPassword = Redacted<DbPassword>;
  *
- * // Create a redacted secret
+ * // Apply brands only after validation or at another trusted boundary.
  * const apiKey: ApiKey = "secret-123" as ApiKey;
- * const redactedKey: RedactedApiKey = createRedacted(apiKey);
- *
- * console.log(redactedKey); // <redacted>
- * console.log(revealRedacted(redactedKey)); // secret-123
- *
- * // Type safety: RedactedApiKey ≠ RedactedDbPassword
- * const fetchUser = (key: RedactedApiKey) => {
- *   const value: ApiKey = revealRedacted(key);
- *   // use value...
- * };
- *
- * fetchUser(redactedKey); // ok
- * // fetchUser(createRedacted("x" as DbPassword)); // type error
- *
- * // Automatic cleanup with `using`
- * {
- *   using secret = createRedacted("sensitive" as ApiKey);
- *   // ... use secret ...
- * } // automatically wiped from memory
+ * using redactedKey: RedactedApiKey = createRedacted(apiKey);
+ * const fetchUser = (key: RedactedApiKey): ApiKey => revealRedacted(key);
+ *
+ * expect(redactedKey.toString()).toBe("<redacted>");
+ * expect(JSON.stringify({ apiKey: redactedKey })).toBe(
+ *   '{"apiKey":"<redacted>"}',
+ * );
+ * expect(fetchUser(redactedKey)).toBe(apiKey);
+ *
+ * using password = createRedacted("password" as DbPassword);
+ * // @ts-expect-error Redacted secrets retain their distinct branded types.
+ * fetchUser(password);
+ *
+ * const disposedKey = (() => {
+ *   using key = createRedacted(apiKey);
+ *   return key;
+ * })();
+ * // Leaving the `using` scope removes the value from memory.
+ * expect(() => revealRedacted(disposedKey)).toThrow();
  * ```
  */
 export interface Redacted<A> extends Brand<"Redacted">, Disposable {
@@ -80,12 +83,23 @@ export declare const isRedacted: (value: unknown) => value is Redacted<unknown>;
  * ### Example
  *
  * ```ts
+ * import {
+ *   createEqRedacted,
+ *   createRedacted,
+ *   eqString,
+ *   type Brand,
+ * } from "@evolu/common";
+ *
  * type ApiKey = string & Brand<"ApiKey">;
  * const eqRedactedApiKey = createEqRedacted<ApiKey>(eqString);
  *
- * const a = createRedacted("x" as ApiKey);
- * const b = createRedacted("x" as ApiKey);
- * eqRedactedApiKey(a, b); // true
+ * // Apply brands only after validation or at another trusted boundary.
+ * using a = createRedacted("x" as ApiKey);
+ * using b = createRedacted("x" as ApiKey);
+ * using c = createRedacted("y" as ApiKey);
+ *
+ * expect(eqRedactedApiKey(a, b)).toBe(true);
+ * expect(eqRedactedApiKey(a, c)).toBe(false);
  * ```
  */
 export declare const createEqRedacted: <A>(eq: Eq<A>) => Eq<Redacted<A>>;

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

@@ -1 +1 @@
-{"version":3,"file":"Redacted.d.ts","sourceRoot":"","sources":["../../src/Redacted.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAGH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACxC,OAAO,KAAK,EAAE,EAAE,EAAE,MAAM,SAAS,CAAC;AAElC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmDG;AACH,MAAM,WAAW,QAAQ,CAAC,CAAC,CAAE,SAAQ,KAAK,CAAC,UAAU,CAAC,EAAE,UAAU;IAChE,uEAAuE;IACvE,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;CAClB;AAED,gEAAgE;AAChE,eAAO,MAAM,cAAc,GAAI,CAAC,EAAE,OAAO,CAAC,KAAG,QAAQ,CAAC,CAAC,CAItD,CAAC;AAaF;;;;;;GAMG;AACH,eAAO,MAAM,cAAc,GAAI,CAAC,EAAE,UAAU,QAAQ,CAAC,CAAC,CAAC,KAAG,CAGzD,CAAC;AAEF,uDAAuD;AACvD,eAAO,MAAM,UAAU,GAAI,OAAO,OAAO,KAAG,KAAK,IAAI,QAAQ,CAAC,OAAO,CAG7B,CAAC;AAEzC;;;;;;;;;;;;;;GAcG;AACH,eAAO,MAAM,gBAAgB,GAC1B,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,KAAG,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAEY,CAAC"}
+{"version":3,"file":"Redacted.d.ts","sourceRoot":"","sources":["../../src/Redacted.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAGH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACxC,OAAO,KAAK,EAAE,EAAE,EAAE,MAAM,SAAS,CAAC;AAElC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAsDG;AACH,MAAM,WAAW,QAAQ,CAAC,CAAC,CAAE,SAAQ,KAAK,CAAC,UAAU,CAAC,EAAE,UAAU;IAChE,uEAAuE;IACvE,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;CAClB;AAED,gEAAgE;AAChE,eAAO,MAAM,cAAc,GAAI,CAAC,SAAS,CAAC,KAAG,QAAQ,CAAC,CAAC,CAItD,CAAC;AAaF;;;;;;GAMG;AACH,eAAO,MAAM,cAAc,GAAI,CAAC,YAAY,QAAQ,CAAC,CAAC,CAAC,KAAG,CAGzD,CAAC;AAEF,uDAAuD;AACvD,eAAO,MAAM,UAAU,UAAW,OAAO,KAAG,KAAK,IAAI,QAAQ,CAAC,OAAO,CAG7B,CAAC;AAEzC;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,eAAO,MAAM,gBAAgB,GAC1B,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,KAAG,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAEY,CAAC"}

package/dist/src/Redacted.js

@@ -42,12 +42,23 @@ export const isRedacted = (value) => typeof value === "object" &&
  * ### Example
  *
  * ```ts
+ * import {
+ *   createEqRedacted,
+ *   createRedacted,
+ *   eqString,
+ *   type Brand,
+ * } from "@evolu/common";
+ *
  * type ApiKey = string & Brand<"ApiKey">;
  * const eqRedactedApiKey = createEqRedacted<ApiKey>(eqString);
  *
- * const a = createRedacted("x" as ApiKey);
- * const b = createRedacted("x" as ApiKey);
- * eqRedactedApiKey(a, b); // true
+ * // Apply brands only after validation or at another trusted boundary.
+ * using a = createRedacted("x" as ApiKey);
+ * using b = createRedacted("x" as ApiKey);
+ * using c = createRedacted("y" as ApiKey);
+ *
+ * expect(eqRedactedApiKey(a, b)).toBe(true);
+ * expect(eqRedactedApiKey(a, c)).toBe(false);
  * ```
  */
 export const createEqRedacted = (eq) => (x, y) => eq(revealRedacted(x), revealRedacted(y));

package/dist/src/Ref.d.ts

@@ -18,18 +18,26 @@
  * ### Example
  *
  * ```ts
+ * import { createRef } from "@evolu/common";
+ *
  * const count = createRef(0);
  * count.set(1);
  * count.update((n) => n + 1);
- * console.log(count.get()); // 2
+ * expect(count.get()).toBe(2);
  * ```
  *
- * ### Example of using Ref as a dependency
+ * ### As a dependency
  *
  * ```ts
+ * import { createRef, type Ref } from "@evolu/common";
+ *
  * interface CounterRefDep {
  *   readonly counterRef: Ref<number>;
  * }
+ *
+ * const deps: CounterRefDep = { counterRef: createRef(0) };
+ * deps.counterRef.update((count) => count + 1);
+ * expect(deps.counterRef.get()).toBe(1);
  * ```
  */
 export interface Ref<T> {
@@ -48,7 +56,7 @@ export interface Ref<T> {
     /** Updates the current value and returns it. */
     readonly updateAndGet: (updater: (current: T) => T) => T;
     /** Modifies the current value and returns a computed result. */
-    readonly modify: <R>(updater: (current: T) => readonly [result: R, nextValue: T]) => R;
+    readonly modify: <R>(modifier: (current: T) => readonly [result: R, nextValue: T]) => R;
 }
 /** Creates a {@link Ref} with the given initial immutable value. */
 export declare const createRef: <T>(initialValue: T) => Ref<T>;

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

@@ -1 +1 @@
-{"version":3,"file":"Ref.d.ts","sourceRoot":"","sources":["../../src/Ref.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,MAAM,WAAW,GAAG,CAAC,CAAC;IACpB,iCAAiC;IACjC,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IAEtB,8BAA8B;IAC9B,QAAQ,CAAC,GAAG,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,IAAI,CAAC;IAEjC,6DAA6D;IAC7D,QAAQ,CAAC,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC;IAEpC,6CAA6C;IAC7C,QAAQ,CAAC,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC;IAEpC,iCAAiC;IACjC,QAAQ,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC;IAEtD,gEAAgE;IAChE,QAAQ,CAAC,YAAY,EAAE,CAAC,OAAO,EAAE,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAEzD,gDAAgD;IAChD,QAAQ,CAAC,YAAY,EAAE,CAAC,OAAO,EAAE,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAEzD,gEAAgE;IAChE,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,EACjB,OAAO,EAAE,CAAC,OAAO,EAAE,CAAC,KAAK,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,KACxD,CAAC,CAAC;CACR;AAED,oEAAoE;AACpE,eAAO,MAAM,SAAS,GAAI,CAAC,EAAE,cAAc,CAAC,KAAG,GAAG,CAAC,CAAC,CA0CnD,CAAC"}
+{"version":3,"file":"Ref.d.ts","sourceRoot":"","sources":["../../src/Ref.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAoCG;AACH,MAAM,WAAW,GAAG,CAAC,CAAC;IACpB,iCAAiC;IACjC,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IAEtB,8BAA8B;IAC9B,QAAQ,CAAC,GAAG,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,IAAI,CAAC;IAEjC,6DAA6D;IAC7D,QAAQ,CAAC,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC;IAEpC,6CAA6C;IAC7C,QAAQ,CAAC,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC;IAEpC,iCAAiC;IACjC,QAAQ,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC;IAEtD,gEAAgE;IAChE,QAAQ,CAAC,YAAY,EAAE,CAAC,OAAO,EAAE,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAEzD,gDAAgD;IAChD,QAAQ,CAAC,YAAY,EAAE,CAAC,OAAO,EAAE,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAEzD,gEAAgE;IAChE,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,EACjB,QAAQ,EAAE,CAAC,OAAO,EAAE,CAAC,KAAK,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,KACzD,CAAC,CAAC;CACR;AAED,oEAAoE;AACpE,eAAO,MAAM,SAAS,GAAI,CAAC,gBAAgB,CAAC,KAAG,GAAG,CAAC,CAAC,CA0CnD,CAAC"}

package/dist/src/Ref.js

@@ -32,8 +32,8 @@ export const createRef = (initialValue) => {
             currentValue = updater(currentValue);
             return currentValue;
         },
-        modify: (updater) => {
-            const [result, nextValue] = updater(currentValue);
+        modify: (modifier) => {
+            const [result, nextValue] = modifier(currentValue);
             currentValue = nextValue;
             return result;
         },

package/dist/src/RefCount.d.ts

@@ -3,8 +3,8 @@
  *
  * @module
  */
-import { type LookupOption } from "./Lookup.js";
-import { NonNegativeInt, PositiveInt } from "./Type.js";
+import { type LookupOption } from "./Lookup.ts";
+import { NonNegativeInt, PositiveInt } from "./Type.ts";
 /**
  * Reference count for one retained value.
  *
@@ -21,8 +21,6 @@ export interface RefCount extends Disposable {
     readonly decrement: () => NonNegativeInt;
     /** Returns the current count. */
     readonly getCount: () => NonNegativeInt;
-    /** Disposes and invalidates the helper. Further method calls throw. */
-    readonly [Symbol.dispose]: () => void;
 }
 /** Creates {@link RefCount}. */
 export declare const createRefCount: () => RefCount;
@@ -50,8 +48,6 @@ export interface RefCountByKey<TKey> extends Disposable {
     readonly has: (key: TKey) => boolean;
     /** Returns all currently tracked keys. */
     readonly keys: () => ReadonlySet<TKey>;
-    /** Disposes and invalidates the helper. Further method calls throw. */
-    readonly [Symbol.dispose]: () => void;
 }
 /** Options for {@link createRefCountByKey}. */
 export interface CreateRefCountByKeyOptions<TKey, L = TKey> extends LookupOption<TKey, L> {

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

@@ -1 +1 @@
-{"version":3,"file":"RefCount.d.ts","sourceRoot":"","sources":["../../src/RefCount.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH,OAAO,EAAgC,KAAK,YAAY,EAAE,MAAM,aAAa,CAAC;AAC9E,OAAO,EAAE,cAAc,EAAE,WAAW,EAAsB,MAAM,WAAW,CAAC;AAE5E;;;;GAIG;AACH,MAAM,WAAW,QAAS,SAAQ,UAAU;IAC1C,sDAAsD;IACtD,QAAQ,CAAC,SAAS,EAAE,MAAM,WAAW,CAAC;IAEtC;;;;OAIG;IACH,QAAQ,CAAC,SAAS,EAAE,MAAM,cAAc,CAAC;IAEzC,iCAAiC;IACjC,QAAQ,CAAC,QAAQ,EAAE,MAAM,cAAc,CAAC;IAExC,uEAAuE;IACvE,QAAQ,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,MAAM,IAAI,CAAC;CACvC;AAED,gCAAgC;AAChC,eAAO,MAAM,cAAc,QAAO,QA4BjC,CAAC;AAEF;;;;;;;GAOG;AACH,MAAM,WAAW,aAAa,CAAC,IAAI,CAAE,SAAQ,UAAU;IACrD,sDAAsD;IACtD,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,EAAE,IAAI,KAAK,WAAW,CAAC;IAE/C;;;;;OAKG;IACH,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,EAAE,IAAI,KAAK,cAAc,CAAC;IAElD,2EAA2E;IAC3E,QAAQ,CAAC,QAAQ,EAAE,CAAC,GAAG,EAAE,IAAI,KAAK,cAAc,CAAC;IAEjD,2EAA2E;IAC3E,QAAQ,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,IAAI,KAAK,OAAO,CAAC;IAErC,0CAA0C;IAC1C,QAAQ,CAAC,IAAI,EAAE,MAAM,WAAW,CAAC,IAAI,CAAC,CAAC;IAEvC,uEAAuE;IACvE,QAAQ,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,MAAM,IAAI,CAAC;CACvC;AAED,+CAA+C;AAC/C,MAAM,WAAW,0BAA0B,CACzC,IAAI,EACJ,CAAC,GAAG,IAAI,CACR,SAAQ,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC;CAAG;AAElC,qCAAqC;AACrC,wBAAgB,mBAAmB,CAAC,IAAI,GAAG,OAAO,KAAK,aAAa,CAAC,IAAI,CAAC,CAAC;AAC3E,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,CAAC,EACzC,OAAO,EAAE,0BAA0B,CAAC,IAAI,EAAE,CAAC,CAAC,GAC3C,aAAa,CAAC,IAAI,CAAC,CAAC"}
+{"version":3,"file":"RefCount.d.ts","sourceRoot":"","sources":["../../src/RefCount.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH,OAAO,EAAgC,KAAK,YAAY,EAAE,MAAM,aAAa,CAAC;AAC9E,OAAO,EAAE,cAAc,EAAE,WAAW,EAAsB,MAAM,WAAW,CAAC;AAE5E;;;;GAIG;AACH,MAAM,WAAW,QAAS,SAAQ,UAAU;IAC1C,sDAAsD;IACtD,QAAQ,CAAC,SAAS,EAAE,MAAM,WAAW,CAAC;IAEtC;;;;OAIG;IACH,QAAQ,CAAC,SAAS,EAAE,MAAM,cAAc,CAAC;IAEzC,iCAAiC;IACjC,QAAQ,CAAC,QAAQ,EAAE,MAAM,cAAc,CAAC;CACzC;AAED,gCAAgC;AAChC,eAAO,MAAM,cAAc,QAAO,QAkBjC,CAAC;AAEF;;;;;;;GAOG;AACH,MAAM,WAAW,aAAa,CAAC,IAAI,CAAE,SAAQ,UAAU;IACrD,sDAAsD;IACtD,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,EAAE,IAAI,KAAK,WAAW,CAAC;IAE/C;;;;;OAKG;IACH,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,EAAE,IAAI,KAAK,cAAc,CAAC;IAElD,2EAA2E;IAC3E,QAAQ,CAAC,QAAQ,EAAE,CAAC,GAAG,EAAE,IAAI,KAAK,cAAc,CAAC;IAEjD,2EAA2E;IAC3E,QAAQ,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,IAAI,KAAK,OAAO,CAAC;IAErC,0CAA0C;IAC1C,QAAQ,CAAC,IAAI,EAAE,MAAM,WAAW,CAAC,IAAI,CAAC,CAAC;CACxC;AAED,+CAA+C;AAC/C,MAAM,WAAW,0BAA0B,CACzC,IAAI,EACJ,CAAC,GAAG,IAAI,CACR,SAAQ,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC;CAAG;AAElC,qCAAqC;AACrC,wBAAgB,mBAAmB,CAAC,IAAI,GAAG,OAAO,KAAK,aAAa,CAAC,IAAI,CAAC,CAAC;AAC3E,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,CAAC,EACzC,OAAO,EAAE,0BAA0B,CAAC,IAAI,EAAE,CAAC,CAAC,GAC3C,aAAa,CAAC,IAAI,CAAC,CAAC"}

package/dist/src/RefCount.js

@@ -55,87 +55,40 @@ var __disposeResources = (this && this.__disposeResources) || (function (Suppres
     var e = new Error(message);
     return e.name = "SuppressedError", e.error = error, e.suppressed = suppressed, e;
 });
-import { assert, assertNotDisposed } from "./Assert.js";
-import { identity } from "./Function.js";
+import { assert } from "./Assert.js";
+import { disposable, identity } from "./Function.js";
 import { createLookupMap } from "./Lookup.js";
 import { NonNegativeInt, PositiveInt, zeroNonNegativeInt } from "./Type.js";
 /** Creates {@link RefCount}. */
 export const createRefCount = () => {
-    const env_1 = { stack: [], error: void 0, hasError: false };
-    try {
-        // We use DisposableStack only because of assertNotDisposed.
-        const disposer = __addDisposableResource(env_1, new DisposableStack(), false);
-        let count = zeroNonNegativeInt;
-        const disposables = disposer.move();
-        return {
-            increment: () => {
-                assertNotDisposed(disposables);
-                const nextCount = PositiveInt.orThrow(count + 1);
-                count = nextCount;
-                return nextCount;
-            },
-            decrement: () => {
-                assertNotDisposed(disposables);
-                assert(count > 0, "RefCount must not be decremented below zero.");
-                count = NonNegativeInt.orThrow(count - 1);
-                return count;
-            },
-            getCount: () => {
-                assertNotDisposed(disposables);
-                return count;
-            },
-            [Symbol.dispose]: () => disposables.dispose(),
-        };
-    }
-    catch (e_1) {
-        env_1.error = e_1;
-        env_1.hasError = true;
-    }
-    finally {
-        __disposeResources(env_1);
-    }
+    let count = zeroNonNegativeInt;
+    return disposable({
+        increment: () => {
+            const nextCount = PositiveInt.orThrow(count + 1);
+            count = nextCount;
+            return nextCount;
+        },
+        decrement: () => {
+            assert(count > 0, "RefCount must not be decremented below zero.");
+            count = NonNegativeInt.orThrow(count - 1);
+            return count;
+        },
+        getCount: () => count,
+    });
 };
 export function createRefCountByKey({ lookup = identity, } = {}) {
-    const env_2 = { stack: [], error: void 0, hasError: false };
+    const env_1 = { stack: [], error: void 0, hasError: false };
     try {
-        // We use DisposableStack only because of assertNotDisposed.
-        const disposer = __addDisposableResource(env_2, new DisposableStack(), false);
-        const refCountByKey = disposer.adopt(createLookupMap({ lookup }), (refCountByKey) => {
-            const env_3 = { stack: [], error: void 0, hasError: false };
-            try {
-                const disposer = __addDisposableResource(env_3, new DisposableStack(), false);
-                disposer.defer(() => {
-                    refCountByKey.clear();
-                });
-                for (const refCount of refCountByKey.values()) {
-                    disposer.use(refCount);
-                }
-            }
-            catch (e_3) {
-                env_3.error = e_3;
-                env_3.hasError = true;
-            }
-            finally {
-                __disposeResources(env_3);
-            }
+        const disposer = __addDisposableResource(env_1, new DisposableStack(), false);
+        const refCountByKey = createLookupMap({ lookup });
+        disposer.defer(() => {
+            refCountByKey.clear();
         });
-        const disposables = disposer.move();
-        const getRefCount = (key) => {
-            let refCount = refCountByKey.get(key);
-            if (!refCount) {
-                refCount = createRefCount();
-                refCountByKey.set(key, refCount);
-            }
-            return refCount;
-        };
-        return {
-            increment: (key) => {
-                assertNotDisposed(disposables);
-                return getRefCount(key).increment();
-            },
+        return disposable({
+            increment: (key) => refCountByKey.getOrInsertComputed(key, createRefCount).increment(),
             decrement: (key) => {
-                assertNotDisposed(disposables);
-                const refCount = getRefCount(key);
+                const refCount = refCountByKey.get(key);
+                assert(refCount, "RefCount must not be decremented for an untracked key.");
                 const nextCount = refCount.decrement();
                 if (nextCount === 0) {
                     refCountByKey.delete(key);
@@ -143,26 +96,16 @@ export function createRefCountByKey({ lookup = identity, } = {}) {
                 }
                 return nextCount;
             },
-            getCount: (key) => {
-                assertNotDisposed(disposables);
-                return refCountByKey.get(key)?.getCount() ?? zeroNonNegativeInt;
-            },
-            has: (key) => {
-                assertNotDisposed(disposables);
-                return refCountByKey.has(key);
-            },
-            keys: () => {
-                assertNotDisposed(disposables);
-                return new Set(refCountByKey.keys());
-            },
-            [Symbol.dispose]: () => disposables.dispose(),
-        };
+            getCount: (key) => refCountByKey.get(key)?.getCount() ?? zeroNonNegativeInt,
+            has: (key) => refCountByKey.has(key),
+            keys: () => new Set(refCountByKey.keys()),
+        }, disposer);
     }
-    catch (e_2) {
-        env_2.error = e_2;
-        env_2.hasError = true;
+    catch (e_1) {
+        env_1.error = e_1;
+        env_1.hasError = true;
     }
     finally {
-        __disposeResources(env_2);
+        __disposeResources(env_1);
     }
 }

package/dist/src/Relation.d.ts

@@ -3,7 +3,8 @@
  *
  * @module
  */
-import { type Lookup } from "./Lookup.js";
+import { type Lookup } from "./Lookup.ts";
+import { NonNegativeInt, PositiveInt } from "./Type.ts";
 /**
  * Bidirectional relation between two types.
  *
@@ -34,20 +35,33 @@ import { type Lookup } from "./Lookup.js";
  * The input parameter types of `lookupA` and `lookupB` determine which values
  * the returned relation accepts on each side.
  *
- * ### Example
+ * ### Reference identity
  *
  * Use the default identity semantics.
  *
  * ```ts
- * const relation = createRelation<WebSocket, string>();
+ * import { createRelation } from "@evolu/common";
+ *
+ * interface Socket {
+ *   readonly id: string;
+ * }
+ *
+ * const relation = createRelation<Socket, string>();
+ * const socket = { id: "socket-1" };
+ *
  * relation.add(socket, "owner-1");
+ *
+ * expect(relation.has(socket, "owner-1")).toBe(true);
+ * expect(relation.has({ id: "socket-1" }, "owner-1")).toBe(false);
  * ```
  *
- * ### Example
+ * ### Lookup-derived equality
  *
  * Use lookup-derived equality.
  *
  * ```ts
+ * import { createRelation } from "@evolu/common";
+ *
  * interface Person {
  *   readonly id: string;
  *   readonly name: string;
@@ -59,7 +73,10 @@ import { type Lookup } from "./Lookup.js";
  * });
  *
  * relation.add({ id: "1", name: "Ada" }, { id: "admins" });
- * relation.has({ id: "1", name: "Grace" }, { id: "admins" }); // true
+ *
+ * expect(relation.has({ id: "1", name: "Grace" }, { id: "admins" })).toBe(
+ *   true,
+ * );
  * ```
  *
  * @see {@link createRelation}
@@ -131,4 +148,52 @@ export interface CreateRelationOptions<A, B, LA = A, LB = B> {
 /** Creates a {@link Relation}. */
 export declare function createRelation<A, B>(): Relation<A, B>;
 export declare function createRelation<A, B, LA, LB>(options: CreateRelationOptions<A, B, LA, LB>): Relation<A, B>;
+/**
+ * Bidirectional relation with a positive retain count for every active pair.
+ *
+ * Logical equality and canonical representatives follow the same lookup rules
+ * as {@link Relation}. The first active representative on each side remains
+ * canonical until that value has no active pairs. Increment and decrement
+ * return those representatives so callers can reliably handle pair transitions
+ * without repeating lookup or canonicalization logic.
+ *
+ * Unlike {@link Relation}'s live iterators, directional and entry reads return
+ * snapshots so callers can mutate this relation while iterating. Their order
+ * follows first insertion of the current canonical representatives and pairs.
+ */
+export interface RefCountedRelation<A, B> {
+    /** Increments a pair count and returns its canonical values and new count. */
+    readonly increment: (a: A, b: B) => {
+        readonly a: A;
+        readonly b: B;
+        readonly count: PositiveInt;
+    };
+    /**
+     * Decrements a pair count and returns its canonical values and new count.
+     * Decrementing a missing pair is a programmer error checked with
+     * {@link assert}.
+     */
+    readonly decrement: (a: A, b: B) => {
+        readonly a: A;
+        readonly b: B;
+        readonly count: NonNegativeInt;
+    };
+    /** Returns the pair count, or zero when the pair is absent. */
+    readonly getCount: (a: A, b: B) => NonNegativeInt;
+    /** Returns a snapshot of canonical A values related to `b`. */
+    readonly getAs: (b: B) => ReadonlyArray<A>;
+    /** Returns a snapshot of canonical B values related to `a`. */
+    readonly getBs: (a: A) => ReadonlyArray<B>;
+    /** Returns whether an A value has at least one active pair. */
+    readonly hasA: (a: A) => boolean;
+    /** Returns whether a B value has at least one active pair. */
+    readonly hasB: (b: B) => boolean;
+    /** Returns a snapshot of every canonical pair and its positive count. */
+    readonly getEntries: () => ReadonlyArray<readonly [a: A, b: B, count: PositiveInt]>;
+    /** Removes all pair counts and both directional indexes. */
+    readonly clear: () => void;
+}
+/** Creates a {@link RefCountedRelation}. */
+export declare function createRefCountedRelation<A, B>(): RefCountedRelation<A, B>;
+export declare function createRefCountedRelation<A, B, LA, LB>(options: CreateRelationOptions<A, B, LA, LB>): RefCountedRelation<A, B>;
 //# sourceMappingURL=Relation.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"Relation.d.ts","sourceRoot":"","sources":["../../src/Relation.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAKH,OAAO,EAGL,KAAK,MAAM,EAEZ,MAAM,aAAa,CAAC;AAErB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2DG;AACH,MAAM,WAAW,QAAQ,CAAC,CAAC,EAAE,CAAC;IAC5B;;;OAGG;IACH,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC;IAEtC;;;OAGG;IACH,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC;IAEzC,wDAAwD;IACxD,QAAQ,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC;IAEtC,wDAAwD;IACxD,QAAQ,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC;IAEtC;;;;;;;OAOG;IACH,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,gBAAgB,CAAC,CAAC,CAAC,CAAC;IAEjD;;;;;;;OAOG;IACH,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,gBAAgB,CAAC,CAAC,CAAC,CAAC;IAEjD;;;OAGG;IACH,QAAQ,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,MAAM,gBAAgB,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAEpE,wDAAwD;IACxD,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC;IAEtC,qDAAqD;IACrD,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC;IAEjC,oDAAoD;IACpD,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC;IAEjC,0CAA0C;IAC1C,QAAQ,CAAC,KAAK,EAAE,MAAM,IAAI,CAAC;IAE3B,uDAAuD;IACvD,QAAQ,CAAC,MAAM,EAAE,MAAM,MAAM,CAAC;IAE9B,uDAAuD;IACvD,QAAQ,CAAC,MAAM,EAAE,MAAM,MAAM,CAAC;IAE9B,2DAA2D;IAC3D,QAAQ,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC;IAEtC,2DAA2D;IAC3D,QAAQ,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC;IAEtC,wDAAwD;IACxD,QAAQ,CAAC,IAAI,EAAE,MAAM,MAAM,CAAC;CAC7B;AAED,0CAA0C;AAC1C,MAAM,WAAW,qBAAqB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC;IACzD,2EAA2E;IAC3E,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAEjC,2EAA2E;IAC3E,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;CAClC;AAED,kCAAkC;AAClC,wBAAgB,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACvD,wBAAgB,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EACzC,OAAO,EAAE,qBAAqB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,GAC3C,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC"}
+{"version":3,"file":"Relation.d.ts","sourceRoot":"","sources":["../../src/Relation.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAKH,OAAO,EAGL,KAAK,MAAM,EAGZ,MAAM,aAAa,CAAC;AACrB,OAAO,EACL,cAAc,EAEd,WAAW,EAEZ,MAAM,WAAW,CAAC;AAEnB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2EG;AACH,MAAM,WAAW,QAAQ,CAAC,CAAC,EAAE,CAAC;IAC5B;;;OAGG;IACH,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC;IAEtC;;;OAGG;IACH,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC;IAEzC,wDAAwD;IACxD,QAAQ,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC;IAEtC,wDAAwD;IACxD,QAAQ,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC;IAEtC;;;;;;;OAOG;IACH,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,gBAAgB,CAAC,CAAC,CAAC,CAAC;IAEjD;;;;;;;OAOG;IACH,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,gBAAgB,CAAC,CAAC,CAAC,CAAC;IAEjD;;;OAGG;IACH,QAAQ,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,MAAM,gBAAgB,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAEpE,wDAAwD;IACxD,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC;IAEtC,qDAAqD;IACrD,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC;IAEjC,oDAAoD;IACpD,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC;IAEjC,0CAA0C;IAC1C,QAAQ,CAAC,KAAK,EAAE,MAAM,IAAI,CAAC;IAE3B,uDAAuD;IACvD,QAAQ,CAAC,MAAM,EAAE,MAAM,MAAM,CAAC;IAE9B,uDAAuD;IACvD,QAAQ,CAAC,MAAM,EAAE,MAAM,MAAM,CAAC;IAE9B,2DAA2D;IAC3D,QAAQ,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC;IAEtC,2DAA2D;IAC3D,QAAQ,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC;IAEtC,wDAAwD;IACxD,QAAQ,CAAC,IAAI,EAAE,MAAM,MAAM,CAAC;CAC7B;AAED,0CAA0C;AAC1C,MAAM,WAAW,qBAAqB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC;IACzD,2EAA2E;IAC3E,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAEjC,2EAA2E;IAC3E,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;CAClC;AAED,kCAAkC;AAClC,wBAAgB,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACvD,wBAAgB,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EACzC,OAAO,EAAE,qBAAqB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,GAC3C,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AA4HlB;;;;;;;;;;;;GAYG;AACH,MAAM,WAAW,kBAAkB,CAAC,CAAC,EAAE,CAAC;IACtC,8EAA8E;IAC9E,QAAQ,CAAC,SAAS,EAAE,CAClB,CAAC,EAAE,CAAC,EACJ,CAAC,EAAE,CAAC,KACD;QACH,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC;QACd,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC;QACd,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC;KAC7B,CAAC;IAEF;;;;OAIG;IACH,QAAQ,CAAC,SAAS,EAAE,CAClB,CAAC,EAAE,CAAC,EACJ,CAAC,EAAE,CAAC,KACD;QACH,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC;QACd,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC;QACd,QAAQ,CAAC,KAAK,EAAE,cAAc,CAAC;KAChC,CAAC;IAEF,+DAA+D;IAC/D,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,cAAc,CAAC;IAElD,+DAA+D;IAC/D,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,aAAa,CAAC,CAAC,CAAC,CAAC;IAE3C,+DAA+D;IAC/D,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,aAAa,CAAC,CAAC,CAAC,CAAC;IAE3C,+DAA+D;IAC/D,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC;IAEjC,8DAA8D;IAC9D,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC;IAEjC,yEAAyE;IACzE,QAAQ,CAAC,UAAU,EAAE,MAAM,aAAa,CACtC,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,CAC1C,CAAC;IAEF,4DAA4D;IAC5D,QAAQ,CAAC,KAAK,EAAE,MAAM,IAAI,CAAC;CAC5B;AAED,4CAA4C;AAC5C,wBAAgB,wBAAwB,CAAC,CAAC,EAAE,CAAC,KAAK,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC3E,wBAAgB,wBAAwB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EACnD,OAAO,EAAE,qBAAqB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,GAC3C,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC"}