@elaraai/east 1.0.57 → 1.0.59

package/dist/src/serialization/beast2/v5/lazy.d.ts

@@ -0,0 +1,79 @@
+/**
+ * Copyright (c) 2025 Elara AI Pty Ltd
+ * Dual-licensed under AGPL-3.0 and commercial license. See LICENSE for details.
+ */
+/**
+ * Lazy pager-backed collection values.
+ *
+ * {@link openBeast2LazyFor} opens an indexed v5 collection blob as an
+ * ordinary East runtime value — a `SortedMap`, `SortedSet`, or array — whose
+ * cheap operations are served from the blob's segment index without decoding
+ * the whole collection:
+ *
+ * - `size` / `length` come from the index (O(1)),
+ * - iteration streams one decoded segment at a time (O(segment) memory),
+ * - keyed lookups (`get` / `has`, Array index reads) decode one segment via
+ *   the fence index,
+ *
+ * and every other operation — mutation, set algebra, range iteration —
+ * transparently hydrates the container (the whole-decode that would have
+ * happened anyway) and then behaves exactly like the eager value. Object
+ * identity is stable across hydration, so host-side iteration locks and
+ * freezes keyed on the value keep working.
+ *
+ * This is what lets a task runner open a huge collection input lazily: a
+ * body that only iterates it once, or reads a few keys, never pays the whole
+ * decode — while a body that does anything else gets the eager value's exact
+ * semantics.
+ */
+import { type EastTypeValue } from "../../../type_of_type.js";
+import type { EastType, ValueTypeOf } from "../../../types.js";
+import { type Beast2DecodeOptions } from "../shared.js";
+/**
+ * Builds a curried lazy opener: `open(data)` returns an ordinary collection
+ * value — a `SortedMap`, `SortedSet`, or array — backed by the blob's
+ * segment index instead of a whole decode.
+ *
+ * Size, single-pass iteration, and keyed reads are served lazily with
+ * O(segment) decoded memory; every other operation transparently hydrates
+ * the value (equivalent to the whole decode) and proceeds with eager
+ * semantics, so the lazy value is observationally identical to
+ * `decodeBeast2For(type)(data)`.
+ *
+ * @param type - the collection type (Array/Set/Dict)
+ * @param options - decode options (platform functions for decoded functions)
+ * @returns a function opening a blob as a lazy collection value
+ * @throws {TypeError} When `type` is not an Array, Set or Dict type.
+ */
+export declare function openBeast2LazyFor<T extends EastType>(type: T | EastTypeValue, options?: Beast2DecodeOptions): (data: Uint8Array) => ValueTypeOf<T>;
+/**
+ * Decides whether a collection type may be opened lazily
+ * ({@link openBeast2LazyFor}) with eager-equivalent semantics.
+ *
+ * A lazy value serves element reads as fresh decodes from the blob, and
+ * East's runtime is reference-semantic for nested containers — so an element
+ * shape that East can mutate in place (transitively containing an Array, Set,
+ * Dict or Ref) must be decoded eagerly, or writes through a read-out element
+ * would be silently dropped. Vector/Matrix and function elements are also
+ * excluded: `is()` compares them by object identity, which fresh decodes
+ * (and hydration) would change, and a decoded closure re-creates any mutable
+ * state it captured. Scalar, struct and variant element shapes are safe —
+ * they compare by value and have no in-place mutation builtins.
+ *
+ * Runners consult this before opening a large input lazily; an unsafe shape
+ * falls back to the eager whole decode (always correct, just not O(segment)).
+ *
+ * @param type - the candidate input type
+ * @returns `true` when the type is an Array, Set or Dict whose element (and
+ *   key) shapes make lazy opening observationally equivalent to the eager
+ *   decode; `false` otherwise, including for non-collection roots
+ *
+ * @example
+ * ```ts
+ * isBeast2LazySafe(DictType(IntegerType, StructType({ id: IntegerType })));  // true
+ * isBeast2LazySafe(DictType(IntegerType, StructType({ xs: ArrayType(IntegerType) })));  // false — nested mutation
+ * isBeast2LazySafe(StringType);  // false — not a collection root
+ * ```
+ */
+export declare function isBeast2LazySafe(type: EastType | EastTypeValue): boolean;
+//# sourceMappingURL=lazy.d.ts.map

package/dist/src/serialization/beast2/v5/lazy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lazy.d.ts","sourceRoot":"","sources":["../../../../../src/serialization/beast2/v5/lazy.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAEH,OAAO,EAAE,KAAK,aAAa,EAAE,MAAM,0BAA0B,CAAC;AAC9D,OAAO,KAAK,EAAE,QAAQ,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAI/D,OAAO,EAAE,KAAK,mBAAmB,EAAE,MAAM,cAAc,CAAC;AAuYxD;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,SAAS,QAAQ,EAAE,IAAI,EAAE,CAAC,GAAG,aAAa,EAAE,OAAO,CAAC,EAAE,mBAAmB,GAAG,CAAC,IAAI,EAAE,UAAU,KAAK,WAAW,CAAC,CAAC,CAAC,CAiBlJ;AAkCD;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,QAAQ,GAAG,aAAa,GAAG,OAAO,CAQxE"}

package/dist/src/serialization/beast2/v5/lazy.js

@@ -0,0 +1,520 @@
+/**
+ * Copyright (c) 2025 Elara AI Pty Ltd
+ * Dual-licensed under AGPL-3.0 and commercial license. See LICENSE for details.
+ */
+/**
+ * Lazy pager-backed collection values.
+ *
+ * {@link openBeast2LazyFor} opens an indexed v5 collection blob as an
+ * ordinary East runtime value — a `SortedMap`, `SortedSet`, or array — whose
+ * cheap operations are served from the blob's segment index without decoding
+ * the whole collection:
+ *
+ * - `size` / `length` come from the index (O(1)),
+ * - iteration streams one decoded segment at a time (O(segment) memory),
+ * - keyed lookups (`get` / `has`, Array index reads) decode one segment via
+ *   the fence index,
+ *
+ * and every other operation — mutation, set algebra, range iteration —
+ * transparently hydrates the container (the whole-decode that would have
+ * happened anyway) and then behaves exactly like the eager value. Object
+ * identity is stable across hydration, so host-side iteration locks and
+ * freezes keyed on the value keep working.
+ *
+ * This is what lets a task runner open a huge collection input lazily: a
+ * body that only iterates it once, or reads a few keys, never pays the whole
+ * decode — while a body that does anything else gets the eager value's exact
+ * semantics.
+ */
+import {} from "../../../type_of_type.js";
+import { compareFor } from "../../../comparison.js";
+import { SortedMap } from "../../../containers/sortedmap.js";
+import { SortedSet } from "../../../containers/sortedset.js";
+import {} from "../shared.js";
+import { asTypeValue } from "./type-section.js";
+import { isSegmentedRoot } from "./codec.js";
+import { Beast2Pages } from "./stream.js";
+/** The canonical-order violation error, matching the eager decoders. */
+function disjointError(kind, i) {
+    return new Error(`beast2 v5: segments ${i - 1} and ${i} are not disjoint ascending ${kind === "Dict" ? "key" : "element"} ranges — the wire must hold the canonical value (corrupt or pre-contract blob)`);
+}
+/** Streams a Dict blob's entries segment by segment in canonical order,
+ *  validating the cross-segment ascent the eager decoder enforces. */
+function* lazyDictEntries(pages, cmp) {
+    let prev;
+    let has = false;
+    for (let i = 0; i < pages.segmentCount; i++) {
+        const segment = pages.segment(i);
+        for (const [k, v] of segment) {
+            if (has && cmp(prev, k) >= 0)
+                throw disjointError("Dict", i);
+            prev = k;
+            has = true;
+            yield [k, v];
+        }
+    }
+}
+/** Streams a Set blob's elements segment by segment in canonical order,
+ *  validating the cross-segment ascent the eager decoder enforces. */
+function* lazySetKeys(pages, cmp) {
+    let prev;
+    let has = false;
+    for (let i = 0; i < pages.segmentCount; i++) {
+        const segment = pages.segment(i);
+        for (const k of segment) {
+            if (has && cmp(prev, k) >= 0)
+                throw disjointError("Set", i);
+            prev = k;
+            has = true;
+            yield k;
+        }
+    }
+}
+/**
+ * A {@link SortedMap} served lazily from an indexed blob.
+ *
+ * Reads (`size`, `get`, `has`, whole-collection iteration, `minKey`,
+ * `maxKey`) are answered from the pager; anything else hydrates first. Not
+ * constructed directly — see {@link openBeast2LazyFor}.
+ */
+class LazySortedMap extends SortedMap {
+    pages;
+    cmp;
+    hydrated = false;
+    constructor(pages, cmp) {
+        super(undefined, cmp);
+        this.pages = pages;
+        this.cmp = cmp;
+    }
+    /** Decodes every segment into the underlying B-tree once. */
+    hydrate() {
+        if (this.hydrated)
+            return;
+        this.hydrated = true;
+        for (const [k, v] of lazyDictEntries(this.pages, this.cmp)) {
+            super.set(k, v);
+        }
+    }
+    get size() {
+        return this.hydrated ? super.size : this.pages.elementCount;
+    }
+    get(key) {
+        if (this.hydrated)
+            return super.get(key);
+        if (this.pages.elementCount === 0)
+            return undefined;
+        return this.pages.get(key);
+    }
+    has(key) {
+        return this.hydrated ? super.has(key) : this.get(key) !== undefined;
+    }
+    set(key, value) {
+        this.hydrate();
+        return super.set(key, value);
+    }
+    delete(key) {
+        this.hydrate();
+        return super.delete(key);
+    }
+    clear() {
+        // Skip decoding just to discard it — an empty tree plus the hydrated
+        // flag IS the cleared state.
+        if (Object.isFrozen(this)) {
+            throw new TypeError("Cannot modify frozen SortedMap");
+        }
+        this.hydrated = true;
+        super.clear();
+    }
+    forEach(callbackfn, thisArg) {
+        if (this.hydrated) {
+            super.forEach(callbackfn, thisArg);
+            return;
+        }
+        for (const [k, v] of lazyDictEntries(this.pages, this.cmp)) {
+            callbackfn.call(thisArg, v, k, this);
+        }
+    }
+    minKey() {
+        if (this.hydrated)
+            return super.minKey();
+        if (this.pages.elementCount === 0)
+            return undefined;
+        return this.pages.fence(0);
+    }
+    maxKey() {
+        if (this.hydrated)
+            return super.maxKey();
+        const n = this.pages.segmentCount;
+        if (n === 0)
+            return undefined;
+        let last;
+        for (const k of this.pages.segment(n - 1).keys())
+            last = k;
+        return last;
+    }
+    keys(firstKey) {
+        if (!this.hydrated && firstKey === undefined) {
+            const pages = this.pages;
+            const cmp = this.cmp;
+            return Iterator.from((function* () {
+                for (const [k] of lazyDictEntries(pages, cmp))
+                    yield k;
+            })());
+        }
+        this.hydrate();
+        return super.keys(firstKey);
+    }
+    values(firstKey) {
+        if (!this.hydrated && firstKey === undefined) {
+            const pages = this.pages;
+            const cmp = this.cmp;
+            return Iterator.from((function* () {
+                for (const [, v] of lazyDictEntries(pages, cmp))
+                    yield v;
+            })());
+        }
+        this.hydrate();
+        return super.values(firstKey);
+    }
+    entries(firstKey) {
+        if (!this.hydrated && firstKey === undefined) {
+            return Iterator.from(lazyDictEntries(this.pages, this.cmp));
+        }
+        this.hydrate();
+        return super.entries(firstKey);
+    }
+    [Symbol.iterator]() {
+        return this.entries();
+    }
+}
+/**
+ * A {@link SortedSet} served lazily from an indexed blob.
+ *
+ * Reads (`size`, `has`, whole-collection iteration, `minKey`, `maxKey`) are
+ * answered from the pager; anything else — including the set-algebra methods,
+ * which walk the underlying B-tree directly — hydrates first. Not
+ * constructed directly — see {@link openBeast2LazyFor}.
+ */
+class LazySortedSet extends SortedSet {
+    pages;
+    cmp;
+    hydrated = false;
+    constructor(pages, cmp) {
+        super(undefined, cmp);
+        this.pages = pages;
+        this.cmp = cmp;
+    }
+    /** Decodes every segment into the underlying B-tree once. */
+    hydrate() {
+        if (this.hydrated)
+            return;
+        this.hydrated = true;
+        for (const k of lazySetKeys(this.pages, this.cmp)) {
+            super.add(k);
+        }
+    }
+    get size() {
+        return this.hydrated ? super.size : this.pages.elementCount;
+    }
+    has(key) {
+        if (this.hydrated)
+            return super.has(key);
+        if (this.pages.elementCount === 0)
+            return false;
+        return this.pages.get(key) !== undefined;
+    }
+    add(key) {
+        this.hydrate();
+        return super.add(key);
+    }
+    delete(key) {
+        this.hydrate();
+        return super.delete(key);
+    }
+    clear() {
+        // Skip decoding just to discard it — an empty tree plus the hydrated
+        // flag IS the cleared state.
+        if (Object.isFrozen(this)) {
+            throw new TypeError("Cannot modify frozen SortedSet");
+        }
+        this.hydrated = true;
+        super.clear();
+    }
+    forEach(callbackfn, thisArg) {
+        if (this.hydrated) {
+            super.forEach(callbackfn, thisArg);
+            return;
+        }
+        for (const k of lazySetKeys(this.pages, this.cmp)) {
+            callbackfn.call(thisArg, k, k, this);
+        }
+    }
+    union(other) {
+        this.hydrate();
+        return super.union(other);
+    }
+    intersection(other) {
+        this.hydrate();
+        return super.intersection(other);
+    }
+    difference(other) {
+        this.hydrate();
+        return super.difference(other);
+    }
+    symmetricDifference(other) {
+        this.hydrate();
+        return super.symmetricDifference(other);
+    }
+    isSubsetOf(other) {
+        this.hydrate();
+        return super.isSubsetOf(other);
+    }
+    isSupersetOf(other) {
+        this.hydrate();
+        return super.isSupersetOf(other);
+    }
+    isDisjointFrom(other) {
+        this.hydrate();
+        return super.isDisjointFrom(other);
+    }
+    minKey() {
+        if (this.hydrated)
+            return super.minKey();
+        if (this.pages.elementCount === 0)
+            return undefined;
+        return this.pages.fence(0);
+    }
+    maxKey() {
+        if (this.hydrated)
+            return super.maxKey();
+        const n = this.pages.segmentCount;
+        if (n === 0)
+            return undefined;
+        let last;
+        for (const k of this.pages.segment(n - 1))
+            last = k;
+        return last;
+    }
+    keys(firstKey) {
+        if (!this.hydrated && firstKey === undefined) {
+            return Iterator.from(lazySetKeys(this.pages, this.cmp));
+        }
+        this.hydrate();
+        return super.keys(firstKey);
+    }
+    values(firstKey) {
+        return this.keys(firstKey);
+    }
+    entries(firstKey) {
+        if (!this.hydrated && firstKey === undefined) {
+            const pages = this.pages;
+            const cmp = this.cmp;
+            return Iterator.from((function* () {
+                for (const k of lazySetKeys(pages, cmp))
+                    yield [k, k];
+            })());
+        }
+        this.hydrate();
+        return super.entries(firstKey);
+    }
+    [Symbol.iterator]() {
+        return this.keys();
+    }
+}
+/** Array method names that stream from the pager without hydrating. */
+const LAZY_ARRAY_READS = new Set(["entries", "keys", "values", "forEach", Symbol.iterator]);
+/** Builds a lazy Array value as a proxy over a real (initially empty)
+ *  array: `length`, index reads and single-pass iteration are served from
+ *  the pager; any other access hydrates the target array in place. The
+ *  proxy IS the value, so identity-keyed host state (iteration locks,
+ *  freezes) survives hydration. */
+function lazyArray(pages) {
+    const target = [];
+    let hydrated = false;
+    const hydrate = () => {
+        if (hydrated)
+            return;
+        hydrated = true;
+        for (let i = 0; i < pages.segmentCount; i++) {
+            // Element-by-element append — a spread (`push(...segment)`) passes the
+            // segment as arguments and overflows the engine's argument limit on
+            // ~100k+-element segments.
+            for (const item of pages.segment(i))
+                target.push(item);
+        }
+    };
+    function* elements() {
+        for (let i = 0; i < pages.segmentCount; i++) {
+            yield* pages.segment(i);
+        }
+    }
+    const lazyReads = {
+        [Symbol.iterator]: function* () { yield* elements(); },
+        entries: function* () {
+            let i = 0;
+            for (const v of elements())
+                yield [i++, v];
+        },
+        keys: function* () {
+            for (let i = 0; i < pages.elementCount; i++)
+                yield i;
+        },
+        values: function* () { yield* elements(); },
+        forEach: (callbackfn, thisArg) => {
+            let i = 0;
+            for (const v of elements())
+                callbackfn.call(thisArg, v, i++, proxy);
+        },
+    };
+    const proxy = new Proxy(target, {
+        get(t, prop, receiver) {
+            if (!hydrated) {
+                if (prop === "length")
+                    return pages.elementCount;
+                if (LAZY_ARRAY_READS.has(prop))
+                    return lazyReads[prop];
+                if (typeof prop === "string") {
+                    // Only canonical index strings are element reads — `""`, `"01"`,
+                    // `" 2"` or `"1e2"` are ordinary (absent) properties on an eager
+                    // array, and must stay so here.
+                    const row = Number(prop);
+                    if (Number.isInteger(row) && row >= 0 && String(row) === prop) {
+                        return row < pages.elementCount ? pages.element(row) : undefined;
+                    }
+                }
+                hydrate();
+            }
+            return Reflect.get(t, prop, receiver);
+        },
+        set(t, prop, value, receiver) {
+            hydrate();
+            return Reflect.set(t, prop, value, receiver);
+        },
+        has(t, prop) {
+            hydrate();
+            return Reflect.has(t, prop);
+        },
+        ownKeys(t) {
+            hydrate();
+            return Reflect.ownKeys(t);
+        },
+        getOwnPropertyDescriptor(t, prop) {
+            hydrate();
+            return Reflect.getOwnPropertyDescriptor(t, prop);
+        },
+        defineProperty(t, prop, attributes) {
+            hydrate();
+            return Reflect.defineProperty(t, prop, attributes);
+        },
+        deleteProperty(t, prop) {
+            hydrate();
+            return Reflect.deleteProperty(t, prop);
+        },
+    });
+    return proxy;
+}
+/**
+ * Builds a curried lazy opener: `open(data)` returns an ordinary collection
+ * value — a `SortedMap`, `SortedSet`, or array — backed by the blob's
+ * segment index instead of a whole decode.
+ *
+ * Size, single-pass iteration, and keyed reads are served lazily with
+ * O(segment) decoded memory; every other operation transparently hydrates
+ * the value (equivalent to the whole decode) and proceeds with eager
+ * semantics, so the lazy value is observationally identical to
+ * `decodeBeast2For(type)(data)`.
+ *
+ * @param type - the collection type (Array/Set/Dict)
+ * @param options - decode options (platform functions for decoded functions)
+ * @returns a function opening a blob as a lazy collection value
+ * @throws {TypeError} When `type` is not an Array, Set or Dict type.
+ */
+export function openBeast2LazyFor(type, options) {
+    const typeValue = asTypeValue(type);
+    if (!isSegmentedRoot(typeValue)) {
+        throw new TypeError(`beast2 v5 lazy values hold Array, Set or Dict roots, not ${typeValue.type}`);
+    }
+    return (data) => {
+        const pages = new Beast2Pages(data, typeValue, options);
+        if (typeValue.type === "Array") {
+            return lazyArray(pages);
+        }
+        if (typeValue.type === "Set") {
+            const cmp = compareFor(typeValue.value);
+            return new LazySortedSet(pages, cmp);
+        }
+        const cmp = compareFor(typeValue.value.key);
+        return new LazySortedMap(pages, cmp);
+    };
+}
+/** Whether every value of `type` is value-semantic under the lazy contract:
+ *  no East-mutable container (Array/Set/Dict/Ref) and no identity-compared
+ *  or state-carrying kind (Vector/Matrix, whose `is()` is object identity;
+ *  functions, whose captured environment can hold mutable state).
+ *  Structs/variants/scalars compare by value and have no in-place mutation
+ *  builtins, so a fresh pager-served decode of them is unobservable. */
+function isLazySafeElement(type) {
+    switch (type.type) {
+        case "Never":
+        case "Null":
+        case "Boolean":
+        case "Integer":
+        case "Float":
+        case "String":
+        case "DateTime":
+        case "Blob":
+            return true;
+        case "Struct":
+        case "Variant":
+            return type.value.every((f) => isLazySafeElement(f.type));
+        case "Recursive":
+            // A wrapper's content is checked once; a back-reference re-enters a
+            // level already on the checked path, so it adds nothing new.
+            return type.value.type === "wrapper" ? isLazySafeElement(type.value.value.inner) : true;
+        default:
+            // Array/Set/Dict/Ref (mutation through a read-out element would be
+            // dropped), Vector/Matrix (`is()` observes decode identity),
+            // Function/AsyncFunction (captured mutable state) — eager only.
+            return false;
+    }
+}
+/**
+ * Decides whether a collection type may be opened lazily
+ * ({@link openBeast2LazyFor}) with eager-equivalent semantics.
+ *
+ * A lazy value serves element reads as fresh decodes from the blob, and
+ * East's runtime is reference-semantic for nested containers — so an element
+ * shape that East can mutate in place (transitively containing an Array, Set,
+ * Dict or Ref) must be decoded eagerly, or writes through a read-out element
+ * would be silently dropped. Vector/Matrix and function elements are also
+ * excluded: `is()` compares them by object identity, which fresh decodes
+ * (and hydration) would change, and a decoded closure re-creates any mutable
+ * state it captured. Scalar, struct and variant element shapes are safe —
+ * they compare by value and have no in-place mutation builtins.
+ *
+ * Runners consult this before opening a large input lazily; an unsafe shape
+ * falls back to the eager whole decode (always correct, just not O(segment)).
+ *
+ * @param type - the candidate input type
+ * @returns `true` when the type is an Array, Set or Dict whose element (and
+ *   key) shapes make lazy opening observationally equivalent to the eager
+ *   decode; `false` otherwise, including for non-collection roots
+ *
+ * @example
+ * ```ts
+ * isBeast2LazySafe(DictType(IntegerType, StructType({ id: IntegerType })));  // true
+ * isBeast2LazySafe(DictType(IntegerType, StructType({ xs: ArrayType(IntegerType) })));  // false — nested mutation
+ * isBeast2LazySafe(StringType);  // false — not a collection root
+ * ```
+ */
+export function isBeast2LazySafe(type) {
+    const typeValue = asTypeValue(type);
+    if (!isSegmentedRoot(typeValue))
+        return false;
+    if (typeValue.type === "Dict") {
+        const dict = typeValue.value;
+        return isLazySafeElement(dict.key) && isLazySafeElement(dict.value);
+    }
+    return isLazySafeElement(typeValue.value);
+}
+//# sourceMappingURL=lazy.js.map

package/dist/src/serialization/beast2/v5/lazy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lazy.js","sourceRoot":"","sources":["../../../../../src/serialization/beast2/v5/lazy.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAEH,OAAO,EAAsB,MAAM,0BAA0B,CAAC;AAE9D,OAAO,EAAE,UAAU,EAAE,MAAM,wBAAwB,CAAC;AACpD,OAAO,EAAE,SAAS,EAAE,MAAM,kCAAkC,CAAC;AAC7D,OAAO,EAAE,SAAS,EAAE,MAAM,kCAAkC,CAAC;AAC7D,OAAO,EAA4B,MAAM,cAAc,CAAC;AACxD,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAC7C,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAE1C,wEAAwE;AACxE,SAAS,aAAa,CAAC,IAAoB,EAAE,CAAS;IACpD,OAAO,IAAI,KAAK,CAAC,uBAAuB,CAAC,GAAG,CAAC,QAAQ,CAAC,+BAA+B,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,iFAAiF,CAAC,CAAC;AAC7M,CAAC;AAED;sEACsE;AACtE,QAAQ,CAAC,CAAC,eAAe,CAAO,KAAkB,EAAE,GAA2B;IAC7E,IAAI,IAAmB,CAAC;IACxB,IAAI,GAAG,GAAG,KAAK,CAAC;IAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5C,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAc,CAAC;QAC9C,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,OAAO,EAAE,CAAC;YAC7B,IAAI,GAAG,IAAI,GAAG,CAAC,IAAS,EAAE,CAAC,CAAC,IAAI,CAAC;gBAAE,MAAM,aAAa,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAClE,IAAI,GAAG,CAAC,CAAC;YACT,GAAG,GAAG,IAAI,CAAC;YACX,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACf,CAAC;IACH,CAAC;AACH,CAAC;AAED;sEACsE;AACtE,QAAQ,CAAC,CAAC,WAAW,CAAI,KAAkB,EAAE,GAA2B;IACtE,IAAI,IAAmB,CAAC;IACxB,IAAI,GAAG,GAAG,KAAK,CAAC;IAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5C,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAW,CAAC;QAC3C,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,IAAI,GAAG,IAAI,GAAG,CAAC,IAAS,EAAE,CAAC,CAAC,IAAI,CAAC;gBAAE,MAAM,aAAa,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACjE,IAAI,GAAG,CAAC,CAAC;YACT,GAAG,GAAG,IAAI,CAAC;YACX,MAAM,CAAC,CAAC;QACV,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,MAAM,aAAoB,SAAQ,SAAe;IAGlB;IAAqC;IAF1D,QAAQ,GAAG,KAAK,CAAC;IAEzB,YAA6B,KAAkB,EAAmB,GAA2B;QAC3F,KAAK,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QADK,UAAK,GAAL,KAAK,CAAa;QAAmB,QAAG,GAAH,GAAG,CAAwB;IAE7F,CAAC;IAED,6DAA6D;IACrD,OAAO;QACb,IAAI,IAAI,CAAC,QAAQ;YAAE,OAAO;QAC1B,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,eAAe,CAAO,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACjE,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAClB,CAAC;IACH,CAAC;IAED,IAAa,IAAI;QACf,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC;IAC9D,CAAC;IAEQ,GAAG,CAAC,GAAM;QACjB,IAAI,IAAI,CAAC,QAAQ;YAAE,OAAO,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACzC,IAAI,IAAI,CAAC,KAAK,CAAC,YAAY,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QACpD,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAY,CAAkB,CAAC;IACvD,CAAC;IAEQ,GAAG,CAAC,GAAM;QACjB,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC;IACtE,CAAC;IAEQ,GAAG,CAAC,GAAM,EAAE,KAAQ;QAC3B,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,OAAO,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAC/B,CAAC;IAEQ,MAAM,CAAC,GAAM;QACpB,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,OAAO,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC3B,CAAC;IAEQ,KAAK;QACZ,qEAAqE;QACrE,6BAA6B;QAC7B,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1B,MAAM,IAAI,SAAS,CAAC,gCAAgC,CAAC,CAAC;QACxD,CAAC;QACD,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,KAAK,CAAC,KAAK,EAAE,CAAC;IAChB,CAAC;IAEQ,OAAO,CAAC,UAAsD,EAAE,OAAiB;QACxF,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,KAAK,CAAC,OAAO,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;YACnC,OAAO;QACT,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,eAAe,CAAO,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACjE,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IAEQ,MAAM;QACb,IAAI,IAAI,CAAC,QAAQ;YAAE,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;QACzC,IAAI,IAAI,CAAC,KAAK,CAAC,YAAY,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QACpD,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAM,CAAC;IAClC,CAAC;IAEQ,MAAM;QACb,IAAI,IAAI,CAAC,QAAQ;YAAE,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;QACzC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC;QAClC,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC9B,IAAI,IAAmB,CAAC;QACxB,KAAK,MAAM,CAAC,IAAK,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAe,CAAC,IAAI,EAAE;YAAE,IAAI,GAAG,CAAC,CAAC;QAC1E,OAAO,IAAI,CAAC;IACd,CAAC;IAEQ,IAAI,CAAC,QAAY;QACxB,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC7C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;YACzB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC;YACrB,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC;gBAC7B,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,eAAe,CAAO,KAAK,EAAE,GAAG,CAAC;oBAAE,MAAM,CAAC,CAAC;YAC/D,CAAC,CAAC,EAAE,CAAmB,CAAC;QAC1B,CAAC;QACD,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,OAAO,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC9B,CAAC;IAEQ,MAAM,CAAC,QAAY;QAC1B,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC7C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;YACzB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC;YACrB,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC;gBAC7B,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,eAAe,CAAO,KAAK,EAAE,GAAG,CAAC;oBAAE,MAAM,CAAC,CAAC;YACjE,CAAC,CAAC,EAAE,CAAmB,CAAC;QAC1B,CAAC;QACD,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,OAAO,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;IAChC,CAAC;IAEQ,OAAO,CAAC,QAAY;QAC3B,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC7C,OAAO,QAAQ,CAAC,IAAI,CAAC,eAAe,CAAO,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAwB,CAAC;QAC3F,CAAC;QACD,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,OAAO,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IACjC,CAAC;IAEQ,CAAC,MAAM,CAAC,QAAQ,CAAC;QACxB,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;IACxB,CAAC;CACF;AAED;;;;;;;GAOG;AACH,MAAM,aAAiB,SAAQ,SAAY;IAGZ;IAAqC;IAF1D,QAAQ,GAAG,KAAK,CAAC;IAEzB,YAA6B,KAAkB,EAAmB,GAA2B;QAC3F,KAAK,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QADK,UAAK,GAAL,KAAK,CAAa;QAAmB,QAAG,GAAH,GAAG,CAAwB;IAE7F,CAAC;IAED,6DAA6D;IACrD,OAAO;QACb,IAAI,IAAI,CAAC,QAAQ;YAAE,OAAO;QAC1B,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,KAAK,MAAM,CAAC,IAAI,WAAW,CAAI,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACrD,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACf,CAAC;IACH,CAAC;IAED,IAAa,IAAI;QACf,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC;IAC9D,CAAC;IAEQ,GAAG,CAAC,GAAM;QACjB,IAAI,IAAI,CAAC,QAAQ;YAAE,OAAO,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACzC,IAAI,IAAI,CAAC,KAAK,CAAC,YAAY,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QAChD,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAY,CAAC,KAAK,SAAS,CAAC;IACpD,CAAC;IAEQ,GAAG,CAAC,GAAM;QACjB,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,OAAO,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACxB,CAAC;IAEQ,MAAM,CAAC,GAAM;QACpB,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,OAAO,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC3B,CAAC;IAEQ,KAAK;QACZ,qEAAqE;QACrE,6BAA6B;QAC7B,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1B,MAAM,IAAI,SAAS,CAAC,gCAAgC,CAAC,CAAC;QACxD,CAAC;QACD,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,KAAK,CAAC,KAAK,EAAE,CAAC;IAChB,CAAC;IAEQ,OAAO,CAAC,UAAsD,EAAE,OAAiB;QACxF,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,KAAK,CAAC,OAAO,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;YACnC,OAAO;QACT,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,WAAW,CAAI,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACrD,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IAEQ,KAAK,CAAI,KAAyB;QACzC,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,OAAO,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;IAEQ,YAAY,CAAI,KAAyB;QAChD,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,OAAO,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC;IAEQ,UAAU,CAAI,KAAyB;QAC9C,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,OAAO,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;IACjC,CAAC;IAEQ,mBAAmB,CAAI,KAAyB;QACvD,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,OAAO,KAAK,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;IAC1C,CAAC;IAEQ,UAAU,CAAC,KAA+B;QACjD,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,OAAO,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;IACjC,CAAC;IAEQ,YAAY,CAAC,KAA+B;QACnD,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,OAAO,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC;IAEQ,cAAc,CAAC,KAA+B;QACrD,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,OAAO,KAAK,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC;IAEQ,MAAM;QACb,IAAI,IAAI,CAAC,QAAQ;YAAE,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;QACzC,IAAI,IAAI,CAAC,KAAK,CAAC,YAAY,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QACpD,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAM,CAAC;IAClC,CAAC;IAEQ,MAAM;QACb,IAAI,IAAI,CAAC,QAAQ;YAAE,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;QACzC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC;QAClC,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC9B,IAAI,IAAmB,CAAC;QACxB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAW;YAAE,IAAI,GAAG,CAAC,CAAC;QAC9D,OAAO,IAAI,CAAC;IACd,CAAC;IAEQ,IAAI,CAAC,QAAY;QACxB,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC7C,OAAO,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAI,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAmB,CAAC;QAC/E,CAAC;QACD,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,OAAO,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC9B,CAAC;IAEQ,MAAM,CAAC,QAAY;QAC1B,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC7B,CAAC;IAEQ,OAAO,CAAC,QAAY;QAC3B,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC7C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;YACzB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC;YACrB,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC;gBAC7B,KAAK,MAAM,CAAC,IAAI,WAAW,CAAI,KAAK,EAAE,GAAG,CAAC;oBAAE,MAAM,CAAC,CAAC,EAAE,CAAC,CAAW,CAAC;YACrE,CAAC,CAAC,EAAE,CAAwB,CAAC;QAC/B,CAAC;QACD,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,OAAO,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IACjC,CAAC;IAEQ,CAAC,MAAM,CAAC,QAAQ,CAAC;QACxB,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC;IACrB,CAAC;CACF;AAED,uEAAuE;AACvE,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAc,CAAC,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;AAEzG;;;;mCAImC;AACnC,SAAS,SAAS,CAAC,KAAkB;IACnC,MAAM,MAAM,GAAc,EAAE,CAAC;IAC7B,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,MAAM,OAAO,GAAG,GAAS,EAAE;QACzB,IAAI,QAAQ;YAAE,OAAO;QACrB,QAAQ,GAAG,IAAI,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,uEAAuE;YACvE,oEAAoE;YACpE,2BAA2B;YAC3B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAc;gBAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtE,CAAC;IACH,CAAC,CAAC;IACF,QAAQ,CAAC,CAAC,QAAQ;QAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,KAAK,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAc,CAAC;QACvC,CAAC;IACH,CAAC;IACD,MAAM,SAAS,GAAiC;QAC9C,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QACtD,OAAO,EAAE,QAAQ,CAAC;YAChB,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE;gBAAE,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,CAAsB,CAAC;QAClE,CAAC;QACD,IAAI,EAAE,QAAQ,CAAC;YACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,YAAY,EAAE,CAAC,EAAE;gBAAE,MAAM,CAAC,CAAC;QACvD,CAAC;QACD,MAAM,EAAE,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC3C,OAAO,EAAE,CAAC,UAAqE,EAAE,OAAiB,EAAE,EAAE;YACpG,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE;gBAAE,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACtE,CAAC;KACF,CAAC;IACF,MAAM,KAAK,GAAc,IAAI,KAAK,CAAC,MAAM,EAAE;QACzC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ;YACnB,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACd,IAAI,IAAI,KAAK,QAAQ;oBAAE,OAAO,KAAK,CAAC,YAAY,CAAC;gBACjD,IAAI,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC;oBAAE,OAAO,SAAS,CAAC,IAAI,CAAC,CAAC;gBACvD,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;oBAC7B,iEAAiE;oBACjE,iEAAiE;oBACjE,gCAAgC;oBAChC,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;oBACzB,IAAI,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,KAAK,IAAI,EAAE,CAAC;wBAC9D,OAAO,GAAG,GAAG,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;oBACnE,CAAC;gBACH,CAAC;gBACD,OAAO,EAAE,CAAC;YACZ,CAAC;YACD,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;QACxC,CAAC;QACD,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ;YAC1B,OAAO,EAAE,CAAC;YACV,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;QAC/C,CAAC;QACD,GAAG,CAAC,CAAC,EAAE,IAAI;YACT,OAAO,EAAE,CAAC;YACV,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAC9B,CAAC;QACD,OAAO,CAAC,CAAC;YACP,OAAO,EAAE,CAAC;YACV,OAAO,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;QACD,wBAAwB,CAAC,CAAC,EAAE,IAAI;YAC9B,OAAO,EAAE,CAAC;YACV,OAAO,OAAO,CAAC,wBAAwB,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QACnD,CAAC;QACD,cAAc,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU;YAChC,OAAO,EAAE,CAAC;YACV,OAAO,OAAO,CAAC,cAAc,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;QACrD,CAAC;QACD,cAAc,CAAC,CAAC,EAAE,IAAI;YACpB,OAAO,EAAE,CAAC;YACV,OAAO,OAAO,CAAC,cAAc,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QACzC,CAAC;KACF,CAAC,CAAC;IACH,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,iBAAiB,CAAqB,IAAuB,EAAE,OAA6B;IAC1G,MAAM,SAAS,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;IACpC,IAAI,CAAC,eAAe,CAAC,SAAS,CAAC,EAAE,CAAC;QAChC,MAAM,IAAI,SAAS,CAAC,4DAA4D,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC;IACpG,CAAC;IACD,OAAO,CAAC,IAAgB,EAAE,EAAE;QAC1B,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,IAAI,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;QACxD,IAAI,SAAS,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YAC/B,OAAO,SAAS,CAAC,KAAK,CAAmB,CAAC;QAC5C,CAAC;QACD,IAAI,SAAS,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YAC7B,MAAM,GAAG,GAAG,UAAU,CAAE,SAAiB,CAAC,KAAK,CAAuC,CAAC;YACvF,OAAO,IAAI,aAAa,CAAC,KAAK,EAAE,GAAG,CAAmB,CAAC;QACzD,CAAC;QACD,MAAM,GAAG,GAAG,UAAU,CAAE,SAAiB,CAAC,KAAK,CAAC,GAAG,CAAuC,CAAC;QAC3F,OAAO,IAAI,aAAa,CAAC,KAAK,EAAE,GAAG,CAAmB,CAAC;IACzD,CAAC,CAAC;AACJ,CAAC;AAED;;;;;wEAKwE;AACxE,SAAS,iBAAiB,CAAC,IAAmB;IAC5C,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,OAAO,CAAC;QACb,KAAK,MAAM,CAAC;QACZ,KAAK,SAAS,CAAC;QACf,KAAK,SAAS,CAAC;QACf,KAAK,OAAO,CAAC;QACb,KAAK,QAAQ,CAAC;QACd,KAAK,UAAU,CAAC;QAChB,KAAK,MAAM;YACT,OAAO,IAAI,CAAC;QACd,KAAK,QAAQ,CAAC;QACd,KAAK,SAAS;YACZ,OAAQ,IAAI,CAAC,KAAiD,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACzG,KAAK,WAAW;YACd,oEAAoE;YACpE,6DAA6D;YAC7D,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,iBAAiB,CAAE,IAAI,CAAC,KAAK,CAAC,KAAkC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACxH;YACE,mEAAmE;YACnE,6DAA6D;YAC7D,gEAAgE;YAChE,OAAO,KAAK,CAAC;IACjB,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,MAAM,UAAU,gBAAgB,CAAC,IAA8B;IAC7D,MAAM,SAAS,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;IACpC,IAAI,CAAC,eAAe,CAAC,SAAS,CAAC;QAAE,OAAO,KAAK,CAAC;IAC9C,IAAI,SAAS,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAI,SAAiB,CAAC,KAAqD,CAAC;QACtF,OAAO,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,iBAAiB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACtE,CAAC;IACD,OAAO,iBAAiB,CAAE,SAAiB,CAAC,KAAsB,CAAC,CAAC;AACtE,CAAC"}

package/dist/src/serialization/beast2/v5/lazy.spec.d.ts

@@ -0,0 +1,6 @@
+/**
+ * Copyright (c) 2025 Elara AI Pty Ltd
+ * Dual-licensed under AGPL-3.0 and commercial license. See LICENSE for details.
+ */
+export {};
+//# sourceMappingURL=lazy.spec.d.ts.map

package/dist/src/serialization/beast2/v5/lazy.spec.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lazy.spec.d.ts","sourceRoot":"","sources":["../../../../../src/serialization/beast2/v5/lazy.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG"}