actor-ts 0.9.0

package/dist/util/Option.d.ts

@@ -0,0 +1,105 @@
+/**
+ * Option<T> — an explicit "might not have a value" type, classes-based so
+ * it plays nicely with `ts-pattern`'s `P.instanceOf(Some)` matcher.
+ *
+ * Prefer this over `T | null` in every domain-API return and long-lived
+ * field.  Nullable is still allowed at three places on purpose:
+ *   1. Hot-path internal fields (Mailbox queues, per-tick timers) where
+ *      allocating a `Some`/`None` wrapper would show up in profiles.
+ *   2. Serialization boundaries (wire-JSON, HOCON parser, CBOR decoder)
+ *      where we must round-trip through `null`.
+ *   3. Optional parameters with ergonomic defaults (`fn(sender?: ActorRef)`).
+ *      The call-site stays short; the stored form can be `fromNullable()`ed.
+ *
+ * Usage:
+ *   const maybeLeader: Option<Member> = cluster.leader();
+ *   maybeLeader.map(m => m.address).getOrElse('<no leader>');
+ *
+ *   match(maybeLeader)
+ *     .with(P.instanceOf(Some), (s) => s.value)
+ *     .with(P.instanceOf(None), () => defaultMember)
+ *     .exhaustive();
+ *
+ * The API mirrors Scala's `Option` where practical — `exists`, `forall`,
+ * `contains`, `fold`, `orElse`, `filter`, `filterNot`, `forEach`,
+ * `toArray`, `isEmpty`, `nonEmpty`.
+ */
+/** A value is present. */
+export declare class Some<T> {
+    readonly value: T;
+    readonly _tag: "Some";
+    constructor(value: T);
+    /** Map the inner value; stays `Some`. */
+    map<U>(f: (value: T) => U): Option<U>;
+    /** Map to another Option; stays `Some` if result is Some, else becomes None. */
+    flatMap<U>(f: (value: T) => Option<U>): Option<U>;
+    /** Present → the value; fallback ignored. */
+    getOrElse<U>(_fallback: U | (() => U)): T;
+    /** Present → this; alternative ignored. */
+    orElse<U>(_alternative: Option<U> | (() => Option<U>)): Option<T>;
+    /** Run side-effect if present. */
+    forEach(f: (value: T) => void): void;
+    /** Keep if predicate holds, else None. */
+    filter(pred: (value: T) => boolean): Option<T>;
+    /** Drop if predicate holds, else keep.  Mirror of `filter`. */
+    filterNot(pred: (value: T) => boolean): Option<T>;
+    /** `true` iff present and `pred(value)` is truthy. */
+    exists(pred: (value: T) => boolean): boolean;
+    /** `true` iff absent OR `pred(value)` is truthy. */
+    forall(pred: (value: T) => boolean): boolean;
+    /** `true` iff present and the value equals `other` (SameValue comparison). */
+    contains(other: T): boolean;
+    /** Collapse to a single value: `onSome` is called with the present value. */
+    fold<U>(_onNone: () => U, onSome: (value: T) => U): U;
+    /** Type-narrowing check. */
+    isSome(): this is Some<T>;
+    isNone(): this is None;
+    get isEmpty(): boolean;
+    get nonEmpty(): boolean;
+    get size(): 0 | 1;
+    /** Materialise into a zero-or-one-element array. */
+    toArray(): T[];
+    /** Bridge back to nullable — useful at serialization/API boundaries. */
+    toNullable(): T;
+}
+/** No value. */
+export declare class None {
+    readonly _tag: "None";
+    map<U>(_f: (value: never) => U): Option<U>;
+    flatMap<U>(_f: (value: never) => Option<U>): Option<U>;
+    forEach(_f: (value: never) => void): void;
+    filter(_pred: (value: never) => boolean): Option<never>;
+    filterNot(_pred: (value: never) => boolean): Option<never>;
+    exists(_pred: (value: never) => boolean): boolean;
+    /** Vacuously true — "all" elements of an empty collection satisfy any predicate. */
+    forall(_pred: (value: never) => boolean): boolean;
+    contains<U>(_other: U): boolean;
+    fold<U>(onNone: () => U, _onSome: (value: never) => U): U;
+    /** Absent → fallback value (or lazy fallback from a thunk). */
+    getOrElse<U>(fallback: U | (() => U)): U;
+    /** Absent → use the alternative Option (lazy or eager). */
+    orElse<U>(alternative: Option<U> | (() => Option<U>)): Option<U>;
+    isSome(): this is Some<never>;
+    isNone(): this is None;
+    get isEmpty(): boolean;
+    get nonEmpty(): boolean;
+    get size(): 0 | 1;
+    toArray(): [];
+    toNullable(): null;
+}
+/** Discriminated union form. */
+export type Option<T> = Some<T> | None;
+/**
+ * Canonical absence singleton.  Shared because `None` is stateless —
+ * allocating a fresh one per call would be wasteful.
+ */
+export declare const none: None;
+/** Factory for the `Some` case. */
+export declare function some<T>(value: T): Some<T>;
+/** Convert `T | null | undefined` to an `Option<T>`. */
+export declare function fromNullable<T>(value: T | null | undefined): Option<T>;
+/** Convenience: build an Option from a predicate. */
+export declare function fromPredicate<T>(value: T, pred: (v: T) => boolean): Option<T>;
+/** First `Some` in the list, else `None`. */
+export declare function firstSome<T>(...options: ReadonlyArray<Option<T>>): Option<T>;
+//# sourceMappingURL=Option.d.ts.map

package/dist/util/Option.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Option.d.ts","sourceRoot":"","sources":["../../src/util/Option.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAEH,0BAA0B;AAC1B,qBAAa,IAAI,CAAC,CAAC;IAEL,QAAQ,CAAC,KAAK,EAAE,CAAC;IAD7B,QAAQ,CAAC,IAAI,EAAG,MAAM,CAAU;gBACX,KAAK,EAAE,CAAC;IAE7B,yCAAyC;IACzC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;IAErC,gFAAgF;IAChF,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;IAEjD,6CAA6C;IAC7C,SAAS,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC;IAEzC,2CAA2C;IAC3C,MAAM,CAAC,CAAC,EAAE,YAAY,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;IAEjE,kCAAkC;IAClC,OAAO,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,IAAI,GAAG,IAAI;IAEpC,0CAA0C;IAC1C,MAAM,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC;IAI9C,+DAA+D;IAC/D,SAAS,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC;IAIjD,sDAAsD;IACtD,MAAM,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAAG,OAAO;IAE5C,oDAAoD;IACpD,MAAM,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAAG,OAAO;IAE5C,8EAA8E;IAC9E,QAAQ,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO;IAE3B,6EAA6E;IAC7E,IAAI,CAAC,CAAC,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC;IAErD,4BAA4B;IAC5B,MAAM,IAAI,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC;IACzB,MAAM,IAAI,IAAI,IAAI,IAAI;IACtB,IAAI,OAAO,IAAI,OAAO,CAAkB;IACxC,IAAI,QAAQ,IAAI,OAAO,CAAiB;IACxC,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,CAAc;IAE/B,oDAAoD;IACpD,OAAO,IAAI,CAAC,EAAE;IAEd,wEAAwE;IACxE,UAAU,IAAI,CAAC;CAChB;AAED,gBAAgB;AAChB,qBAAa,IAAI;IACf,QAAQ,CAAC,IAAI,EAAG,MAAM,CAAU;IAEhC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;IAC1C,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;IACtD,OAAO,CAAC,EAAE,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,IAAI,GAAG,IAAI;IACzC,MAAM,CAAC,KAAK,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC;IACvD,SAAS,CAAC,KAAK,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC;IAC1D,MAAM,CAAC,KAAK,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,OAAO,GAAG,OAAO;IACjD,oFAAoF;IACpF,MAAM,CAAC,KAAK,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,OAAO,GAAG,OAAO;IACjD,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,OAAO;IAC/B,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,CAAC,GAAG,CAAC;IAEzD,+DAA+D;IAC/D,SAAS,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC;IAIxC,2DAA2D;IAC3D,MAAM,CAAC,CAAC,EAAE,WAAW,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;IAIhE,MAAM,IAAI,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC;IAC7B,MAAM,IAAI,IAAI,IAAI,IAAI;IACtB,IAAI,OAAO,IAAI,OAAO,CAAiB;IACvC,IAAI,QAAQ,IAAI,OAAO,CAAkB;IACzC,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,CAAc;IAE/B,OAAO,IAAI,EAAE;IACb,UAAU,IAAI,IAAI;CACnB;AAED,gCAAgC;AAChC,MAAM,MAAM,MAAM,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;AAEvC;;;GAGG;AACH,eAAO,MAAM,IAAI,EAAE,IAAiB,CAAC;AAErC,mCAAmC;AACnC,wBAAgB,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAA4B;AAEtE,wDAAwD;AACxD,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI,GAAG,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,CAEtE;AAED,qDAAqD;AACrD,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,CAE7E;AAED,6CAA6C;AAC7C,wBAAgB,SAAS,CAAC,CAAC,EAAE,GAAG,OAAO,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAK5E"}

package/dist/util/Option.js

@@ -0,0 +1,123 @@
+/**
+ * Option<T> — an explicit "might not have a value" type, classes-based so
+ * it plays nicely with `ts-pattern`'s `P.instanceOf(Some)` matcher.
+ *
+ * Prefer this over `T | null` in every domain-API return and long-lived
+ * field.  Nullable is still allowed at three places on purpose:
+ *   1. Hot-path internal fields (Mailbox queues, per-tick timers) where
+ *      allocating a `Some`/`None` wrapper would show up in profiles.
+ *   2. Serialization boundaries (wire-JSON, HOCON parser, CBOR decoder)
+ *      where we must round-trip through `null`.
+ *   3. Optional parameters with ergonomic defaults (`fn(sender?: ActorRef)`).
+ *      The call-site stays short; the stored form can be `fromNullable()`ed.
+ *
+ * Usage:
+ *   const maybeLeader: Option<Member> = cluster.leader();
+ *   maybeLeader.map(m => m.address).getOrElse('<no leader>');
+ *
+ *   match(maybeLeader)
+ *     .with(P.instanceOf(Some), (s) => s.value)
+ *     .with(P.instanceOf(None), () => defaultMember)
+ *     .exhaustive();
+ *
+ * The API mirrors Scala's `Option` where practical — `exists`, `forall`,
+ * `contains`, `fold`, `orElse`, `filter`, `filterNot`, `forEach`,
+ * `toArray`, `isEmpty`, `nonEmpty`.
+ */
+/** A value is present. */
+export class Some {
+    value;
+    _tag = 'Some';
+    constructor(value) {
+        this.value = value;
+    }
+    /** Map the inner value; stays `Some`. */
+    map(f) { return new Some(f(this.value)); }
+    /** Map to another Option; stays `Some` if result is Some, else becomes None. */
+    flatMap(f) { return f(this.value); }
+    /** Present → the value; fallback ignored. */
+    getOrElse(_fallback) { return this.value; }
+    /** Present → this; alternative ignored. */
+    orElse(_alternative) { return this; }
+    /** Run side-effect if present. */
+    forEach(f) { f(this.value); }
+    /** Keep if predicate holds, else None. */
+    filter(pred) {
+        return pred(this.value) ? this : none;
+    }
+    /** Drop if predicate holds, else keep.  Mirror of `filter`. */
+    filterNot(pred) {
+        return pred(this.value) ? none : this;
+    }
+    /** `true` iff present and `pred(value)` is truthy. */
+    exists(pred) { return pred(this.value); }
+    /** `true` iff absent OR `pred(value)` is truthy. */
+    forall(pred) { return pred(this.value); }
+    /** `true` iff present and the value equals `other` (SameValue comparison). */
+    contains(other) { return Object.is(this.value, other); }
+    /** Collapse to a single value: `onSome` is called with the present value. */
+    fold(_onNone, onSome) { return onSome(this.value); }
+    /** Type-narrowing check. */
+    isSome() { return true; }
+    isNone() { return false; }
+    get isEmpty() { return false; }
+    get nonEmpty() { return true; }
+    get size() { return 1; }
+    /** Materialise into a zero-or-one-element array. */
+    toArray() { return [this.value]; }
+    /** Bridge back to nullable — useful at serialization/API boundaries. */
+    toNullable() { return this.value; }
+}
+/** No value. */
+export class None {
+    _tag = 'None';
+    map(_f) { return this; }
+    flatMap(_f) { return this; }
+    forEach(_f) { }
+    filter(_pred) { return this; }
+    filterNot(_pred) { return this; }
+    exists(_pred) { return false; }
+    /** Vacuously true — "all" elements of an empty collection satisfy any predicate. */
+    forall(_pred) { return true; }
+    contains(_other) { return false; }
+    fold(onNone, _onSome) { return onNone(); }
+    /** Absent → fallback value (or lazy fallback from a thunk). */
+    getOrElse(fallback) {
+        return typeof fallback === 'function' ? fallback() : fallback;
+    }
+    /** Absent → use the alternative Option (lazy or eager). */
+    orElse(alternative) {
+        return typeof alternative === 'function' ? alternative() : alternative;
+    }
+    isSome() { return false; }
+    isNone() { return true; }
+    get isEmpty() { return true; }
+    get nonEmpty() { return false; }
+    get size() { return 0; }
+    toArray() { return []; }
+    toNullable() { return null; }
+}
+/**
+ * Canonical absence singleton.  Shared because `None` is stateless —
+ * allocating a fresh one per call would be wasteful.
+ */
+export const none = new None();
+/** Factory for the `Some` case. */
+export function some(value) { return new Some(value); }
+/** Convert `T | null | undefined` to an `Option<T>`. */
+export function fromNullable(value) {
+    return value === null || value === undefined ? none : new Some(value);
+}
+/** Convenience: build an Option from a predicate. */
+export function fromPredicate(value, pred) {
+    return pred(value) ? new Some(value) : none;
+}
+/** First `Some` in the list, else `None`. */
+export function firstSome(...options) {
+    for (const opt of options) {
+        if (opt.isSome())
+            return opt;
+    }
+    return none;
+}
+//# sourceMappingURL=Option.js.map

package/dist/util/Option.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Option.js","sourceRoot":"","sources":["../../src/util/Option.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAEH,0BAA0B;AAC1B,MAAM,OAAO,IAAI;IAEM;IADZ,IAAI,GAAG,MAAe,CAAC;IAChC,YAAqB,KAAQ;QAAR,UAAK,GAAL,KAAK,CAAG;IAAG,CAAC;IAEjC,yCAAyC;IACzC,GAAG,CAAI,CAAkB,IAAe,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAEzE,gFAAgF;IAChF,OAAO,CAAI,CAA0B,IAAe,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAE3E,6CAA6C;IAC7C,SAAS,CAAI,SAAwB,IAAO,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAEhE,2CAA2C;IAC3C,MAAM,CAAI,YAA2C,IAAe,OAAO,IAAI,CAAC,CAAC,CAAC;IAElF,kCAAkC;IAClC,OAAO,CAAC,CAAqB,IAAU,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAEvD,0CAA0C;IAC1C,MAAM,CAAC,IAA2B;QAChC,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;IACxC,CAAC;IAED,+DAA+D;IAC/D,SAAS,CAAC,IAA2B;QACnC,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;IACxC,CAAC;IAED,sDAAsD;IACtD,MAAM,CAAC,IAA2B,IAAa,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAEzE,oDAAoD;IACpD,MAAM,CAAC,IAA2B,IAAa,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAEzE,8EAA8E;IAC9E,QAAQ,CAAC,KAAQ,IAAa,OAAO,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IAEpE,6EAA6E;IAC7E,IAAI,CAAI,OAAgB,EAAE,MAAuB,IAAO,OAAO,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAEpF,4BAA4B;IAC5B,MAAM,KAAsB,OAAO,IAAI,CAAC,CAAC,CAAC;IAC1C,MAAM,KAAmB,OAAO,KAAK,CAAC,CAAC,CAAC;IACxC,IAAI,OAAO,KAAc,OAAO,KAAK,CAAC,CAAC,CAAC;IACxC,IAAI,QAAQ,KAAc,OAAO,IAAI,CAAC,CAAC,CAAC;IACxC,IAAI,IAAI,KAAY,OAAO,CAAC,CAAC,CAAC,CAAC;IAE/B,oDAAoD;IACpD,OAAO,KAAU,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAEvC,wEAAwE;IACxE,UAAU,KAAQ,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;CACvC;AAED,gBAAgB;AAChB,MAAM,OAAO,IAAI;IACN,IAAI,GAAG,MAAe,CAAC;IAEhC,GAAG,CAAI,EAAuB,IAAe,OAAO,IAA4B,CAAC,CAAC,CAAC;IACnF,OAAO,CAAI,EAA+B,IAAe,OAAO,IAA4B,CAAC,CAAC,CAAC;IAC/F,OAAO,CAAC,EAA0B,IAAsB,CAAC;IACzD,MAAM,CAAC,KAAgC,IAAmB,OAAO,IAAI,CAAC,CAAC,CAAC;IACxE,SAAS,CAAC,KAAgC,IAAmB,OAAO,IAAI,CAAC,CAAC,CAAC;IAC3E,MAAM,CAAC,KAAgC,IAAa,OAAO,KAAK,CAAC,CAAC,CAAC;IACnE,oFAAoF;IACpF,MAAM,CAAC,KAAgC,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;IAClE,QAAQ,CAAI,MAAS,IAAa,OAAO,KAAK,CAAC,CAAC,CAAC;IACjD,IAAI,CAAI,MAAe,EAAE,OAA4B,IAAO,OAAO,MAAM,EAAE,CAAC,CAAC,CAAC;IAE9E,+DAA+D;IAC/D,SAAS,CAAI,QAAuB;QAClC,OAAO,OAAO,QAAQ,KAAK,UAAU,CAAC,CAAC,CAAE,QAAoB,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC;IAC7E,CAAC;IAED,2DAA2D;IAC3D,MAAM,CAAI,WAA0C;QAClD,OAAO,OAAO,WAAW,KAAK,UAAU,CAAC,CAAC,CAAE,WAA+B,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC;IAC9F,CAAC;IAED,MAAM,KAA0B,OAAO,KAAK,CAAC,CAAC,CAAC;IAC/C,MAAM,KAAmB,OAAO,IAAI,CAAC,CAAC,CAAC;IACvC,IAAI,OAAO,KAAc,OAAO,IAAI,CAAC,CAAC,CAAC;IACvC,IAAI,QAAQ,KAAc,OAAO,KAAK,CAAC,CAAC,CAAC;IACzC,IAAI,IAAI,KAAY,OAAO,CAAC,CAAC,CAAC,CAAC;IAE/B,OAAO,KAAS,OAAO,EAAE,CAAC,CAAC,CAAC;IAC5B,UAAU,KAAW,OAAO,IAAI,CAAC,CAAC,CAAC;CACpC;AAKD;;;GAGG;AACH,MAAM,CAAC,MAAM,IAAI,GAAS,IAAI,IAAI,EAAE,CAAC;AAErC,mCAAmC;AACnC,MAAM,UAAU,IAAI,CAAI,KAAQ,IAAa,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AAEtE,wDAAwD;AACxD,MAAM,UAAU,YAAY,CAAI,KAA2B;IACzD,OAAO,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC;AACxE,CAAC;AAED,qDAAqD;AACrD,MAAM,UAAU,aAAa,CAAI,KAAQ,EAAE,IAAuB;IAChE,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AAC9C,CAAC;AAED,6CAA6C;AAC7C,MAAM,UAAU,SAAS,CAAI,GAAG,OAAiC;IAC/D,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,IAAI,GAAG,CAAC,MAAM,EAAE;YAAE,OAAO,GAAG,CAAC;IAC/B,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/util/TokenBucket.d.ts

@@ -0,0 +1,59 @@
+/**
+ * Token bucket for rate-limiting (#83).  Deterministic, clock-injected,
+ * single-threaded — fits the actor model.
+ *
+ * **Algorithm.**  The bucket holds at most `burst` tokens and refills at
+ * `qps` tokens per second.  Every `tryConsume(n)` deducts `n` tokens
+ * if available (returning true) or refuses (returning false) without
+ * partial consumption.  Refill is computed lazily from elapsed
+ * wall-clock time — no background timer, no per-message overhead beyond
+ * a cheap subtraction.
+ *
+ * **Time injection.**  The constructor takes an optional `now: () =>
+ * number` callback (defaults to `Date.now`).  Tests pass a mocked
+ * function so they can advance time without `setTimeout`-based waits.
+ *
+ * **Burst semantics.**  Tokens accumulate up to `burst` while the
+ * bucket is idle, so a brief idle period lets a workload "borrow"
+ * future capacity for a quick spike.  `burst` defaults to `qps` (one
+ * second's worth of capacity), the typical "smooth out small
+ * variations" setting.
+ */
+export interface TokenBucketOptions {
+    /** Token-refill rate, tokens per second.  Required; must be > 0. */
+    readonly qps: number;
+    /** Bucket capacity.  Default: `qps` (one second of refill). */
+    readonly burst?: number;
+    /** Time source.  Default: `Date.now`. */
+    readonly now?: () => number;
+}
+export declare class TokenBucket {
+    private readonly qps;
+    private readonly capacity;
+    private readonly now;
+    /** Current token balance — fractional during refill, never negative. */
+    private tokens;
+    /** Wall-clock instant of the last refill calculation. */
+    private lastRefillAt;
+    constructor(opts: TokenBucketOptions);
+    /**
+     * Attempt to consume `n` tokens (default 1).  Returns true if the
+     * bucket had enough capacity (tokens deducted), false otherwise (no
+     * partial consumption).
+     */
+    tryConsume(n?: number): boolean;
+    /**
+     * Milliseconds until the bucket has at least `n` tokens (default 1).
+     * Returns 0 when capacity is already there; useful for "schedule a
+     * retry" decisions in the pause-on-empty mode of the per-actor
+     * throttle (#83).
+     */
+    timeUntilNext(n?: number): number;
+    /** Current token balance (refilled to "now").  Diagnostic only. */
+    currentTokens(): number;
+    /** Reset the bucket to full immediately.  Test hook. */
+    resetToFull(): void;
+    /** Lazy refill — compute tokens earned since the last call, cap at capacity. */
+    private refill;
+}
+//# sourceMappingURL=TokenBucket.d.ts.map

package/dist/util/TokenBucket.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"TokenBucket.d.ts","sourceRoot":"","sources":["../../src/util/TokenBucket.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,WAAW,kBAAkB;IACjC,oEAAoE;IACpE,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,+DAA+D;IAC/D,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IACxB,yCAAyC;IACzC,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,MAAM,CAAC;CAC7B;AAED,qBAAa,WAAW;IACtB,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAS;IAC7B,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAS;IAClC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAe;IACnC,wEAAwE;IACxE,OAAO,CAAC,MAAM,CAAS;IACvB,yDAAyD;IACzD,OAAO,CAAC,YAAY,CAAS;gBAEjB,IAAI,EAAE,kBAAkB;IAgBpC;;;;OAIG;IACH,UAAU,CAAC,CAAC,GAAE,MAAU,GAAG,OAAO;IAQlC;;;;;OAKG;IACH,aAAa,CAAC,CAAC,GAAE,MAAU,GAAG,MAAM;IAWpC,mEAAmE;IACnE,aAAa,IAAI,MAAM;IAKvB,wDAAwD;IACxD,WAAW,IAAI,IAAI;IAKnB,gFAAgF;IAChF,OAAO,CAAC,MAAM;CAQf"}

package/dist/util/TokenBucket.js

@@ -0,0 +1,76 @@
+export class TokenBucket {
+    qps;
+    capacity;
+    now;
+    /** Current token balance — fractional during refill, never negative. */
+    tokens;
+    /** Wall-clock instant of the last refill calculation. */
+    lastRefillAt;
+    constructor(opts) {
+        if (!Number.isFinite(opts.qps) || opts.qps <= 0) {
+            throw new Error(`TokenBucket: qps must be > 0, got ${opts.qps}`);
+        }
+        if (opts.burst !== undefined && (!Number.isFinite(opts.burst) || opts.burst <= 0)) {
+            throw new Error(`TokenBucket: burst must be > 0, got ${opts.burst}`);
+        }
+        this.qps = opts.qps;
+        this.capacity = opts.burst ?? opts.qps;
+        this.now = opts.now ?? Date.now;
+        // Start full so the first burst doesn't have to wait — workloads
+        // typically expect "I can fire `burst` messages immediately".
+        this.tokens = this.capacity;
+        this.lastRefillAt = this.now();
+    }
+    /**
+     * Attempt to consume `n` tokens (default 1).  Returns true if the
+     * bucket had enough capacity (tokens deducted), false otherwise (no
+     * partial consumption).
+     */
+    tryConsume(n = 1) {
+        if (n <= 0)
+            return true;
+        this.refill();
+        if (this.tokens < n)
+            return false;
+        this.tokens -= n;
+        return true;
+    }
+    /**
+     * Milliseconds until the bucket has at least `n` tokens (default 1).
+     * Returns 0 when capacity is already there; useful for "schedule a
+     * retry" decisions in the pause-on-empty mode of the per-actor
+     * throttle (#83).
+     */
+    timeUntilNext(n = 1) {
+        this.refill();
+        if (this.tokens >= n)
+            return 0;
+        const deficit = n - this.tokens;
+        // qps tokens / 1000 ms = qps/1000 tokens per ms → deficit / (qps/1000).
+        const ms = (deficit / this.qps) * 1000;
+        // Round up — the bucket isn't ready until the next-whole-token
+        // boundary at the earliest.
+        return Math.ceil(ms);
+    }
+    /** Current token balance (refilled to "now").  Diagnostic only. */
+    currentTokens() {
+        this.refill();
+        return this.tokens;
+    }
+    /** Reset the bucket to full immediately.  Test hook. */
+    resetToFull() {
+        this.tokens = this.capacity;
+        this.lastRefillAt = this.now();
+    }
+    /** Lazy refill — compute tokens earned since the last call, cap at capacity. */
+    refill() {
+        const now = this.now();
+        const elapsedMs = now - this.lastRefillAt;
+        if (elapsedMs <= 0)
+            return;
+        const earned = (elapsedMs / 1000) * this.qps;
+        this.tokens = Math.min(this.capacity, this.tokens + earned);
+        this.lastRefillAt = now;
+    }
+}
+//# sourceMappingURL=TokenBucket.js.map

package/dist/util/TokenBucket.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"TokenBucket.js","sourceRoot":"","sources":["../../src/util/TokenBucket.ts"],"names":[],"mappings":"AA8BA,MAAM,OAAO,WAAW;IACL,GAAG,CAAS;IACZ,QAAQ,CAAS;IACjB,GAAG,CAAe;IACnC,wEAAwE;IAChE,MAAM,CAAS;IACvB,yDAAyD;IACjD,YAAY,CAAS;IAE7B,YAAY,IAAwB;QAClC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;YAChD,MAAM,IAAI,KAAK,CAAC,qCAAqC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;QACnE,CAAC;QACD,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,EAAE,CAAC;YAClF,MAAM,IAAI,KAAK,CAAC,uCAAuC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QACvE,CAAC;QACD,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC;QACpB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC;QACvC,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC;QAChC,iEAAiE;QACjE,8DAA8D;QAC9D,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC5B,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACjC,CAAC;IAED;;;;OAIG;IACH,UAAU,CAAC,IAAY,CAAC;QACtB,IAAI,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;QACxB,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QAClC,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;QACjB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;OAKG;IACH,aAAa,CAAC,IAAY,CAAC;QACzB,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC;YAAE,OAAO,CAAC,CAAC;QAC/B,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QAChC,wEAAwE;QACxE,MAAM,EAAE,GAAG,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;QACvC,+DAA+D;QAC/D,4BAA4B;QAC5B,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACvB,CAAC;IAED,mEAAmE;IACnE,aAAa;QACX,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,wDAAwD;IACxD,WAAW;QACT,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC5B,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACjC,CAAC;IAED,gFAAgF;IACxE,MAAM;QACZ,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,SAAS,GAAG,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC;QAC1C,IAAI,SAAS,IAAI,CAAC;YAAE,OAAO;QAC3B,MAAM,MAAM,GAAG,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC;QAC7C,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC;QAC5D,IAAI,CAAC,YAAY,GAAG,GAAG,CAAC;IAC1B,CAAC;CACF"}

package/dist/util/Try.d.ts

@@ -0,0 +1,103 @@
+/**
+ * Try<T> — a synchronous computation that either yielded a value
+ * (`Success<T>`) or threw (`Failure`).  Mirrors Scala's `scala.util.Try`.
+ *
+ * Why use it over try/catch directly?
+ *   - **Composition:** `parse().map(...).flatMap(...).getOrElse(default)`
+ *     reads top-to-bottom; try/catch blocks don't.
+ *   - **Typed error context:** `Failure` holds the error as data, so you
+ *     can log / rethrow / recover without touching control flow.
+ *   - **Pattern matching:** plays with `ts-pattern` via
+ *     `P.instanceOf(Success)` / `P.instanceOf(Failure)`.
+ *
+ * Usage:
+ *   const parsed: Try<Config> = Try.of(() => JSON.parse(raw) as Config);
+ *   const port = parsed.map(c => c.port).getOrElse(8080);
+ *
+ *   Try.of(() => riskyOp())
+ *      .map(x => x * 2)
+ *      .recover(err => err instanceof TimeoutError ? 0 : null)
+ *      .fold(
+ *        err => log.warn('failed', err),
+ *        val => use(val),
+ *      );
+ *
+ * `Try` is intentionally sync-only.  For the async case, use plain
+ * `Promise` (which already models success/failure) or a library like
+ * `fp-ts`'s `TaskEither`.
+ */
+/** The computation returned a value. */
+export declare class Success<T = unknown> {
+    readonly value: T;
+    readonly _tag: "Success";
+    constructor(value: T);
+    isSuccess(): this is Success<T>;
+    isFailure(): this is Failure;
+    /** Always Success; fallback ignored. */
+    getOrElse<U>(_fallback: U | ((err: unknown) => U)): T;
+    /** Always Success; alternative ignored. */
+    orElse<U>(_alt: Try<U> | (() => Try<U>)): Try<T>;
+    /** Map the inner value.  A thrown mapper turns this into a Failure. */
+    map<U>(f: (value: T) => U): Try<U>;
+    /** Chain to another Try.  A thrown mapper becomes Failure. */
+    flatMap<U>(f: (value: T) => Try<U>): Try<U>;
+    /** Always Success — no recovery runs. */
+    recover<U>(_f: (err: unknown) => U | null): Try<T | U>;
+    /** Always Success — no recovery runs. */
+    recoverWith<U>(_f: (err: unknown) => Try<U>): Try<T | U>;
+    /** Keep if predicate holds; else Failure with a `FilterError`. */
+    filter(pred: (value: T) => boolean, makeError?: (value: T) => Error): Try<T>;
+    /** Collapse both cases into one value. */
+    fold<U>(_onFailure: (err: unknown) => U, onSuccess: (value: T) => U): U;
+    /** Run a side-effect on the value. */
+    forEach(f: (value: T) => void): void;
+    /** Convert to a "classic" value — the inner value. */
+    get(): T;
+    /** Convert to an Option-like shape (null on Failure). */
+    toNullable(): T | null;
+    /** Fresh copy of the error, or null. */
+    toError(): Error | null;
+}
+/** The computation threw. */
+export declare class Failure {
+    readonly error: unknown;
+    readonly _tag: "Failure";
+    /** The raw thrown value.  Usually an `Error` but could be anything JS allowed `throw`ing. */
+    constructor(error: unknown);
+    /**
+     * The error coerced to an `Error`.  Kept as an alias for back-compat
+     * with code that used the previous pipeTo-style `Failure` (which named
+     * the field `cause` and typed it as `Error`).  Prefer `.error` in new
+     * code — `.cause` lies in the sense that we don't control the thrown
+     * value's type, only its coercion.
+     */
+    get cause(): Error;
+    isSuccess(): this is Success<never>;
+    isFailure(): this is Failure;
+    getOrElse<U>(fallback: U | ((err: unknown) => U)): U;
+    orElse<U>(alt: Try<U> | (() => Try<U>)): Try<U>;
+    map<U>(_f: (value: never) => U): Try<U>;
+    flatMap<U>(_f: (value: never) => Try<U>): Try<U>;
+    /** Apply the recovery fn; returned value is wrapped in Success.  `null` keeps the Failure. */
+    recover<U>(f: (err: unknown) => U | null): Try<U>;
+    /** Apply the recovery fn; its Try return value wholesale replaces this Failure. */
+    recoverWith<U>(f: (err: unknown) => Try<U>): Try<U>;
+    /** Failure passes through `filter` unchanged. */
+    filter(_pred: (value: never) => boolean, _makeError?: (value: never) => Error): Try<never>;
+    fold<U>(onFailure: (err: unknown) => U, _onSuccess: (value: never) => U): U;
+    forEach(_f: (value: never) => void): void;
+    /** Throws the stored error (Scala parity). */
+    get(): never;
+    toNullable(): null;
+    toError(): Error;
+}
+export type Try<T> = Success<T> | Failure;
+/** Run `compute` and wrap the outcome.  Any thrown value becomes `Failure`. */
+export declare function tryOf<T>(compute: () => T): Try<T>;
+/** Factory shortcut for `Success`. */
+export declare function success<T>(value: T): Success<T>;
+/** Factory shortcut for `Failure`. */
+export declare function failure(error: unknown): Failure;
+/** Collect successes; short-circuit to the first Failure seen. */
+export declare function trySequence<T>(tries: ReadonlyArray<Try<T>>): Try<T[]>;
+//# sourceMappingURL=Try.d.ts.map

package/dist/util/Try.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Try.d.ts","sourceRoot":"","sources":["../../src/util/Try.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AAEH,wCAAwC;AACxC,qBAAa,OAAO,CAAC,CAAC,GAAG,OAAO;IAElB,QAAQ,CAAC,KAAK,EAAE,CAAC;IAD7B,QAAQ,CAAC,IAAI,EAAG,SAAS,CAAU;gBACd,KAAK,EAAE,CAAC;IAE7B,SAAS,IAAI,IAAI,IAAI,OAAO,CAAC,CAAC,CAAC;IAC/B,SAAS,IAAI,IAAI,IAAI,OAAO;IAE5B,wCAAwC;IACxC,SAAS,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,OAAO,KAAK,CAAC,CAAC,GAAG,CAAC;IAErD,2CAA2C;IAC3C,MAAM,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IAEhD,uEAAuE;IACvE,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IAKlC,8DAA8D;IAC9D,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IAK3C,yCAAyC;IACzC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,OAAO,KAAK,CAAC,GAAG,IAAI,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAEtD,yCAAyC;IACzC,WAAW,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAExD,kEAAkE;IAClE,MAAM,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,EAAE,SAAS,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC;IAQ5E,0CAA0C;IAC1C,IAAI,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,GAAG,EAAE,OAAO,KAAK,CAAC,EAAE,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC;IAIvE,sCAAsC;IACtC,OAAO,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,IAAI,GAAG,IAAI;IAEpC,sDAAsD;IACtD,GAAG,IAAI,CAAC;IAER,yDAAyD;IACzD,UAAU,IAAI,CAAC,GAAG,IAAI;IAEtB,wCAAwC;IACxC,OAAO,IAAI,KAAK,GAAG,IAAI;CACxB;AAED,6BAA6B;AAC7B,qBAAa,OAAO;IAGN,QAAQ,CAAC,KAAK,EAAE,OAAO;IAFnC,QAAQ,CAAC,IAAI,EAAG,SAAS,CAAU;IACnC,6FAA6F;gBACxE,KAAK,EAAE,OAAO;IAEnC;;;;;;OAMG;IACH,IAAI,KAAK,IAAI,KAAK,CAEjB;IAED,SAAS,IAAI,IAAI,IAAI,OAAO,CAAC,KAAK,CAAC;IACnC,SAAS,IAAI,IAAI,IAAI,OAAO;IAE5B,SAAS,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,OAAO,KAAK,CAAC,CAAC,GAAG,CAAC;IAMpD,MAAM,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IAI/C,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IACvC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IAEhD,8FAA8F;IAC9F,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,OAAO,KAAK,CAAC,GAAG,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC;IAOjD,mFAAmF;IACnF,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IAKnD,iDAAiD;IACjD,MAAM,CAAC,KAAK,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,OAAO,EAAE,UAAU,CAAC,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC;IAE1F,IAAI,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,GAAG,EAAE,OAAO,KAAK,CAAC,EAAE,UAAU,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,CAAC,GAAG,CAAC;IAI3E,OAAO,CAAC,EAAE,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,IAAI,GAAG,IAAI;IAEzC,8CAA8C;IAC9C,GAAG,IAAI,KAAK;IAKZ,UAAU,IAAI,IAAI;IAElB,OAAO,IAAI,KAAK;CACjB;AAED,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;AAE1C,+EAA+E;AAC/E,wBAAgB,KAAK,CAAC,CAAC,EAAE,OAAO,EAAE,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAGjD;AAED,sCAAsC;AACtC,wBAAgB,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAA+B;AAE/E,sCAAsC;AACtC,wBAAgB,OAAO,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,CAA+B;AAE/E,kEAAkE;AAClE,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,EAAE,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAOrE"}