@elaraai/east 1.0.79 → 1.0.80

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

@@ -0,0 +1,233 @@
+/**
+ * Copyright (c) 2025 Elara AI Pty Ltd
+ * Dual-licensed under AGPL-3.0 and commercial license. See LICENSE for details.
+ */
+/**
+ * The segment manifest: a collection held as N standalone segment blobs plus
+ * a small object naming them in order.
+ *
+ * A v5 collection blob is already `header · tag · segment frames · terminator ·
+ * index · footer`, and each segment frame is a self-contained piece of the
+ * canonical value. A manifest takes the last step and lets each segment be its
+ * own blob, so a store can address them individually: equal values then name
+ * equal segments, a one-row edit re-cuts one of them, and two values diff by
+ * comparing hashes rather than by decoding anything.
+ *
+ * This type lives here, beside the container it describes, because **every
+ * runtime must read it**. A task input staged as a manifest is one file naming
+ * sibling segment files, and a body that iterates it, or reads one key from it,
+ * pays for the segments it touches rather than for a splice of the whole value
+ * — which is the difference between a 2 GB input costing 2 GB and costing the
+ * rows it reads. {@link Beast2ManifestSource} is what a reader hands
+ * {@link Beast2Pages} to get that.
+ *
+ * Nothing about the manifest changes what a segment is, so any reader in any
+ * runtime still opens a segment blob on its own, and splicing the segments
+ * back under their shared header reproduces the single-blob form exactly.
+ */
+import { ArrayType, BlobType, IntegerType, StringType, StructType, } from "../../../types.js";
+import { EastTypeType, canonicalTypeValue, toEastTypeValue } from "../../../type_of_type.js";
+import { readTypeSection } from "./type-section.js";
+import { BufferReader } from "../../binary-utils.js";
+import { MAGIC_BYTES_V5, encodeBeast2V5For, decodeBeast2V5For } from "./codec.js";
+import { isBeast2SyncRangeReader, readExact } from "./range.js";
+/** The `kind` tag every segment manifest carries — what tells a reader that an
+ *  object naming other objects describes a collection, and the handle a
+ *  garbage collector recognizes it by. */
+export const COLLECTION_MANIFEST_KIND = "$segments";
+/** One entry of a {@link CollectionManifestType}: a segment blob at level 0, a
+ *  child manifest above it. */
+export const CollectionManifestEntryType = StructType({
+    /** The segment (or child manifest) object's content hash. */
+    hash: StringType,
+    /** The entry's first key, in the canonical bare encoding
+     *  `encodeBeast2FenceFor` produces; empty for an Array root, which has no
+     *  key order to bisect. */
+    fence: BlobType,
+    /** Elements (pairs, for a Dict root) in the segment or subtree. */
+    count: IntegerType,
+    /** The object's size in bytes, so a reader budgets without a stat. */
+    bytes: IntegerType,
+});
+/**
+ * A collection's manifest: the value an object holds in place of the blob when
+ * the collection is stored as segment objects.
+ *
+ * @remarks
+ * `level` and the nesting it allows are carried from the first version on
+ * purpose. Struct encoding is positional, so a field appended later is another
+ * dual-decode tier on every reader in three runtimes — and a second index
+ * level is exactly what a manifest too large to hold whole would need. The
+ * byte is paid now.
+ */
+export const CollectionManifestType = StructType({
+    /** Always {@link COLLECTION_MANIFEST_KIND}. */
+    kind: StringType,
+    /** `0` when entries name segment blobs; `n` when they name level `n - 1`
+     *  manifests. */
+    level: IntegerType,
+    /** The root collection type — the manifest is self-describing about what it
+     *  holds, exactly as a blob's type section is. */
+    type: EastTypeType,
+    /** The boundary-rule id the segments were cut under (`segmentRuleFor`), so a
+     *  reader knows whether they are cut the way this build cuts. */
+    rule: StringType,
+    /** Hash of the canonical header bytes every segment is written under — what
+     *  makes the segments spliceable into one blob. */
+    header: StringType,
+    /** The segments, in canonical order. */
+    entries: ArrayType(CollectionManifestEntryType),
+});
+/** The manifest type's field names, in wire order — read from the type itself
+ *  so the recognizer and the type cannot drift. */
+const MANIFEST_FIELDS = toEastTypeValue(CollectionManifestType).value.map((f) => f.name);
+/**
+ * Whether a decoded object's root type is a {@link CollectionManifestType}.
+ *
+ * @remarks
+ * Matched on the **exact** field set. Arbitrary user values flow through the
+ * same dispatch — a record's state is any struct the author chose — and a
+ * name-subset match would classify one as a manifest and read its fields as
+ * object hashes. The `kind` field is checked separately, after a decode, by
+ * {@link isCollectionManifest}.
+ *
+ * @param typeValue - the object's decoded root type
+ * @returns whether the type is exactly the manifest struct
+ */
+export function isCollectionManifestType(typeValue) {
+    if (typeValue.type !== "Struct")
+        return false;
+    const fields = typeValue.value;
+    return fields.length === MANIFEST_FIELDS.length
+        && fields.every((f, i) => f.name === MANIFEST_FIELDS[i]);
+}
+/**
+ * Whether a decoded value is a segment manifest — its type is the manifest
+ * struct and its `kind` is {@link COLLECTION_MANIFEST_KIND}.
+ *
+ * @param typeValue - the object's decoded root type
+ * @param value - the decoded value
+ * @returns whether the object is a manifest
+ */
+export function isCollectionManifest(typeValue, value) {
+    return isCollectionManifestType(typeValue)
+        && value?.kind === COLLECTION_MANIFEST_KIND;
+}
+/** The manifest's codec, built on first use.
+ *
+ *  Built lazily rather than at module scope because building an encoder writes
+ *  a type section, and this module sits inside the beast2 import cycle — an
+ *  eager build runs while a module it reaches through that cycle is still
+ *  initializing, and dies on a binding that does not exist yet. Nothing else
+ *  about it is lazy: the codec is built once and kept. */
+let manifestCodec = null;
+function codec() {
+    manifestCodec ??= {
+        encode: encodeBeast2V5For(CollectionManifestType),
+        decode: decodeBeast2V5For(CollectionManifestType),
+    };
+    return manifestCodec;
+}
+/**
+ * Encodes a segment manifest.
+ *
+ * @param manifest - the manifest
+ * @returns the beast2 bytes
+ *
+ * @remarks
+ * The collection type is written with its recursive types renamed
+ * canonically ({@link canonicalTypeValue}): the ids a runtime gives them are
+ * its own, and a manifest's hash names the collection in a store, so one
+ * collection must have one manifest whichever runtime writes it.
+ */
+export function encodeCollectionManifest(manifest) {
+    return codec().encode({ ...manifest, type: canonicalTypeValue(manifest.type) });
+}
+/**
+ * Decodes a segment manifest.
+ *
+ * @param data - the stored bytes
+ * @returns the manifest
+ * @throws {Error} When the bytes are not a manifest, or its `kind` is not
+ *   {@link COLLECTION_MANIFEST_KIND} — a struct of the right shape carrying
+ *   another tag is a different object that must not be read as segments.
+ */
+export function decodeCollectionManifest(data) {
+    const manifest = codec().decode(data);
+    if (manifest.kind !== COLLECTION_MANIFEST_KIND) {
+        throw new Error(`beast2 v5: unknown manifest kind '${manifest.kind}' (expected '${COLLECTION_MANIFEST_KIND}')`);
+    }
+    return manifest;
+}
+/**
+ * The total element (pair) count a manifest describes.
+ *
+ * @param manifest - the manifest
+ * @returns the sum of its entries' counts
+ */
+export function manifestElementCount(manifest) {
+    let total = 0;
+    for (const entry of manifest.entries)
+        total += Number(entry.count);
+    return total;
+}
+/**
+ * The total byte size of the segment objects a manifest names.
+ *
+ * @param manifest - the manifest
+ * @returns the sum of its entries' byte sizes
+ */
+export function manifestByteSize(manifest) {
+    let total = 0;
+    for (const entry of manifest.entries)
+        total += Number(entry.bytes);
+    return total;
+}
+/** The head read {@link readBeast2Manifest} probes with — a manifest's own
+ *  type section is a few hundred bytes, and so is every plausible blob's. */
+const MANIFEST_PROBE_BYTES = 64 * 1024;
+/**
+ * The manifest a blob holds, or `null` when it holds something else.
+ *
+ * @remarks
+ * Costs one head read through a ranged source: a blob declares its root type up
+ * front, and a manifest is recognized by that type's exact field set, so
+ * nothing more is read for a blob that turns out to be a value.
+ *
+ * @param source - the blob, or ranged access to it
+ * @returns the decoded manifest, or `null`
+ */
+export function readBeast2Manifest(source) {
+    const reader = isBeast2SyncRangeReader(source) ? source : null;
+    const size = reader === null ? source.length : reader.size;
+    const head = reader === null
+        ? source
+        : readExact(reader, 0, Math.min(size, MANIFEST_PROBE_BYTES));
+    if (head.length < MAGIC_BYTES_V5.length)
+        return null;
+    for (let i = 0; i < MAGIC_BYTES_V5.length; i++) {
+        if (head[i] !== MAGIC_BYTES_V5[i])
+            return null;
+    }
+    let typeValue;
+    try {
+        typeValue = readTypeSection(new BufferReader(head, MAGIC_BYTES_V5.length)).rootType;
+    }
+    catch {
+        return null;
+    }
+    if (!isCollectionManifestType(typeValue))
+        return null;
+    const data = reader === null ? head : readExact(reader, 0, size);
+    const manifest = codec().decode(data);
+    return manifest.kind === COLLECTION_MANIFEST_KIND ? manifest : null;
+}
+/** Whether `source` is a {@link Beast2ManifestSource} rather than a blob or a
+ *  range reader — judged by shape, since a value from another realm fails
+ *  `instanceof`. */
+export function isBeast2ManifestSource(source) {
+    const s = source;
+    return s !== null && typeof s === "object" && typeof s.segment === "function"
+        && typeof s.manifest?.kind === "string";
+}
+//# sourceMappingURL=manifest.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"manifest.js","sourceRoot":"","sources":["../../../../../src/serialization/beast2/v5/manifest.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAEH,OAAO,EACL,SAAS,EACT,QAAQ,EACR,WAAW,EACX,UAAU,EACV,UAAU,GAEX,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,YAAY,EAAE,kBAAkB,EAAE,eAAe,EAAsB,MAAM,0BAA0B,CAAC;AACjH,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACpD,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,EAAE,cAAc,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AAClF,OAAO,EAAE,uBAAuB,EAAE,SAAS,EAA8B,MAAM,YAAY,CAAC;AAE5F;;0CAE0C;AAC1C,MAAM,CAAC,MAAM,wBAAwB,GAAG,WAAW,CAAC;AAEpD;+BAC+B;AAC/B,MAAM,CAAC,MAAM,2BAA2B,GAAG,UAAU,CAAC;IACpD,6DAA6D;IAC7D,IAAI,EAAE,UAAU;IAChB;;+BAE2B;IAC3B,KAAK,EAAE,QAAQ;IACf,mEAAmE;IACnE,KAAK,EAAE,WAAW;IAClB,sEAAsE;IACtE,KAAK,EAAE,WAAW;CACnB,CAAC,CAAC;AAIH;;;;;;;;;;GAUG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,UAAU,CAAC;IAC/C,+CAA+C;IAC/C,IAAI,EAAE,UAAU;IAChB;qBACiB;IACjB,KAAK,EAAE,WAAW;IAClB;sDACkD;IAClD,IAAI,EAAE,YAAY;IAClB;qEACiE;IACjE,IAAI,EAAE,UAAU;IAChB;uDACmD;IACnD,MAAM,EAAE,UAAU;IAClB,wCAAwC;IACxC,OAAO,EAAE,SAAS,CAAC,2BAA2B,CAAC;CAChD,CAAC,CAAC;AAIH;mDACmD;AACnD,MAAM,eAAe,GAClB,eAAe,CAAC,sBAAsB,CAAC,CAAC,KAA4B,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AAE3F;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,wBAAwB,CAAC,SAAwB;IAC/D,IAAI,SAAS,CAAC,IAAI,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IAC9C,MAAM,MAAM,GAAG,SAAS,CAAC,KAA2B,CAAC;IACrD,OAAO,MAAM,CAAC,MAAM,KAAK,eAAe,CAAC,MAAM;WAC1C,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;AAC7D,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,oBAAoB,CAAC,SAAwB,EAAE,KAAc;IAC3E,OAAO,wBAAwB,CAAC,SAAS,CAAC;WACpC,KAAmC,EAAE,IAAI,KAAK,wBAAwB,CAAC;AAC/E,CAAC;AAED;;;;;;0DAM0D;AAC1D,IAAI,aAAa,GAGN,IAAI,CAAC;AAEhB,SAAS,KAAK;IACZ,aAAa,KAAK;QAChB,MAAM,EAAE,iBAAiB,CAAC,sBAAsB,CAAiD;QACjG,MAAM,EAAE,iBAAiB,CAAC,sBAAsB,CAA6C;KAC9F,CAAC;IACF,OAAO,aAAa,CAAC;AACvB,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,wBAAwB,CAAC,QAA4B;IACnE,OAAO,KAAK,EAAE,CAAC,MAAM,CAAC,EAAE,GAAG,QAAQ,EAAE,IAAI,EAAE,kBAAkB,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AAClF,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,wBAAwB,CAAC,IAAgB;IACvD,MAAM,QAAQ,GAAG,KAAK,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACtC,IAAI,QAAQ,CAAC,IAAI,KAAK,wBAAwB,EAAE,CAAC;QAC/C,MAAM,IAAI,KAAK,CAAC,qCAAqC,QAAQ,CAAC,IAAI,gBAAgB,wBAAwB,IAAI,CAAC,CAAC;IAClH,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,oBAAoB,CAAC,QAA4B;IAC/D,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,OAAO;QAAE,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACnE,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAAC,QAA4B;IAC3D,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,OAAO;QAAE,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACnE,OAAO,KAAK,CAAC;AACf,CAAC;AAED;6EAC6E;AAC7E,MAAM,oBAAoB,GAAG,EAAE,GAAG,IAAI,CAAC;AAEvC;;;;;;;;;;GAUG;AACH,MAAM,UAAU,kBAAkB,CAAC,MAA0C;IAC3E,MAAM,MAAM,GAAG,uBAAuB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC;IAC/D,MAAM,IAAI,GAAG,MAAM,KAAK,IAAI,CAAC,CAAC,CAAE,MAAqB,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC;IAC3E,MAAM,IAAI,GAAG,MAAM,KAAK,IAAI;QAC1B,CAAC,CAAE,MAAqB;QACxB,CAAC,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,oBAAoB,CAAC,CAAC,CAAC;IAC/D,IAAI,IAAI,CAAC,MAAM,GAAG,cAAc,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/C,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,cAAc,CAAC,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC;IACjD,CAAC;IACD,IAAI,SAAwB,CAAC;IAC7B,IAAI,CAAC;QACH,SAAS,GAAG,eAAe,CAAC,IAAI,YAAY,CAAC,IAAI,EAAE,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC;IACtF,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,CAAC,wBAAwB,CAAC,SAAS,CAAC;QAAE,OAAO,IAAI,CAAC;IACtD,MAAM,IAAI,GAAG,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;IACjE,MAAM,QAAQ,GAAG,KAAK,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACtC,OAAO,QAAQ,CAAC,IAAI,KAAK,wBAAwB,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC;AACtE,CAAC;AAkCD;;oBAEoB;AACpB,MAAM,UAAU,sBAAsB,CAAC,MAAe;IACpD,MAAM,CAAC,GAAG,MAA0D,CAAC;IACrE,OAAO,CAAC,KAAK,IAAI,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,OAAO,CAAC,CAAC,OAAO,KAAK,UAAU;WACxE,OAAQ,CAAC,CAAC,QAA2C,EAAE,IAAI,KAAK,QAAQ,CAAC;AAChF,CAAC"}

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

@@ -0,0 +1,93 @@
+/**
+ * Copyright (c) 2025 Elara AI Pty Ltd
+ * Dual-licensed under AGPL-3.0 and commercial license. See LICENSE for details.
+ */
+/**
+ * The merge of sorted collections — k canonical Set or Dict collections in, one
+ * canonical blob, or one manifest directory, out.
+ *
+ * The inputs are read segment by segment and their current keys held in a heap
+ * ordered by key and then by input, so a key that several inputs hold leaves
+ * the heap once per input, in input order, and folds there. The merged entries
+ * go out through the element writer, so the output is the canonical blob of
+ * the merged value — the bytes any writer of that value writes, whoever wrote
+ * the inputs and however their segments fell. Memory is one decoded segment per
+ * input plus one open output segment.
+ *
+ * With a key range only the keys in `[from, to)` merge: each input starts at
+ * the segment owning `from`, found through its fences, and stops at the first
+ * key at or past `to`, so merging one range of a large output reads that
+ * range's share of each input, plus at most one segment.
+ */
+import { type EastTypeValue } from "../../../type_of_type.js";
+import type { EastType } from "../../../types.js";
+import { type Beast2ElementWriterOptions } from "./stream.js";
+import { type Beast2SyncRangeReader } from "./range.js";
+import { type Beast2ManifestSource } from "./manifest.js";
+import { type Beast2ManifestSink } from "./manifest-writer.js";
+/** One input to a merge: a canonical collection blob, synchronous ranged access
+ *  to one, or a manifest naming its segments. */
+export type Beast2MergeSource = Uint8Array | Beast2SyncRangeReader | Beast2ManifestSource;
+/** Options accepted by {@link mergeBeast2For}. */
+export type Beast2MergeOptions = Omit<Beast2ElementWriterOptions, "headerPrefix"> & {
+    /**
+     * Dict inputs: how a key several inputs hold folds, `acc = merge(key, acc,
+     * value)`, in input order. Without it such a key is refused. Must be
+     * associative when the inputs are runs or partials of one value: their
+     * values folded in groups before they reach the merge.
+     */
+    merge?: (key: any, acc: any, value: any) => any;
+    /** Set inputs: an element several inputs hold is kept once. Without it such
+     *  an element is refused. */
+    union?: boolean;
+    /** Merge only the keys at or above this one. East values are never
+     *  `undefined`, which leaves the range open below. */
+    from?: unknown;
+    /** Merge only the keys below this one; `undefined` leaves it open above. */
+    to?: unknown;
+    /** Names each input in error messages, beside its position — a path, say. */
+    labels?: readonly string[];
+};
+/** What a merge came to. */
+export type Beast2MergeStats = {
+    /** Inputs merged. */
+    inputs: number;
+    /** Entries written. */
+    entries: number;
+    /** Entries that folded into, or collapsed into, an equal key's entry. */
+    folds: number;
+};
+/**
+ * Builds a merge of sorted Set or Dict collections of one type into one
+ * canonical collection: `merge(sources, sink)`.
+ *
+ * @param type - the collection type every input holds (Set or Dict)
+ * @param options - the fold, the key range, input labels, and the output's
+ *   codec, source map and parallel framing
+ * @returns a function merging its sources, in the order equal keys fold, into
+ *   `sink` — the blob's bytes as they are produced, or, given a
+ *   {@link Beast2ManifestSink}, a manifest directory — and returning what it
+ *   came to
+ * @throws {TypeError} When `type` is not a Set or Dict type, or the fold does
+ *   not fit it: a merge function folds a Dict, union a Set.
+ *
+ * @remarks
+ * The returned function throws, before writing anything, when no source is
+ * given or a source is not a canonical collection of `type`; while merging,
+ * when an input's keys do not ascend, a key repeats without a fold, or the
+ * merge function throws. A failed merge leaves its output without the
+ * terminator and index, or a manifest directory without its manifest, so
+ * nothing reads it as complete. Messages name the input:
+ * `merge: input 2 (<label>): …`.
+ *
+ * @example
+ * ```ts
+ * const type = SetType(IntegerType);
+ * const blob = (xs: bigint[]) => encodeBeast2PagedFor(type)(new Set(xs));
+ * const chunks: Uint8Array[] = [];
+ * mergeBeast2For(type, { union: true })([blob([1n, 3n]), blob([2n, 3n])], (b) => chunks.push(b));
+ * decodeBeast2For(type)(Buffer.concat(chunks));  // Set { 1n, 2n, 3n }
+ * ```
+ */
+export declare function mergeBeast2For<T extends EastType>(type: T | EastTypeValue, options?: Beast2MergeOptions): (sources: readonly Beast2MergeSource[], sink: ((bytes: Uint8Array) => void) | Beast2ManifestSink) => Beast2MergeStats;
+//# sourceMappingURL=merge.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"merge.d.ts","sourceRoot":"","sources":["../../../../../src/serialization/beast2/v5/merge.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EAAE,KAAK,aAAa,EAAuC,MAAM,0BAA0B,CAAC;AACnG,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAMlD,OAAO,EAAuB,KAAK,0BAA0B,EAAE,MAAM,aAAa,CAAC;AAGnF,OAAO,EAAE,KAAK,qBAAqB,EAA2B,MAAM,YAAY,CAAC;AACjF,OAAO,EAA0B,KAAK,oBAAoB,EAAE,MAAM,eAAe,CAAC;AAClF,OAAO,EAAwB,KAAK,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAErF;iDACiD;AACjD,MAAM,MAAM,iBAAiB,GAAG,UAAU,GAAG,qBAAqB,GAAG,oBAAoB,CAAC;AAE1F,kDAAkD;AAClD,MAAM,MAAM,kBAAkB,GAAG,IAAI,CAAC,0BAA0B,EAAE,cAAc,CAAC,GAAG;IAClF;;;;;OAKG;IACH,KAAK,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,KAAK,GAAG,CAAC;IAChD;iCAC6B;IAC7B,KAAK,CAAC,EAAE,OAAO,CAAC;IAChB;0DACsD;IACtD,IAAI,CAAC,EAAE,OAAO,CAAC;IACf,4EAA4E;IAC5E,EAAE,CAAC,EAAE,OAAO,CAAC;IACb,6EAA6E;IAC7E,MAAM,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CAC5B,CAAC;AAEF,4BAA4B;AAC5B,MAAM,MAAM,gBAAgB,GAAG;IAC7B,qBAAqB;IACrB,MAAM,EAAE,MAAM,CAAC;IACf,uBAAuB;IACvB,OAAO,EAAE,MAAM,CAAC;IAChB,yEAAyE;IACzE,KAAK,EAAE,MAAM,CAAC;CACf,CAAC;AAEF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AACH,wBAAgB,cAAc,CAAC,CAAC,SAAS,QAAQ,EAAE,IAAI,EAAE,CAAC,GAAG,aAAa,EAAE,OAAO,CAAC,EAAE,kBAAkB,GAAG,CAAC,OAAO,EAAE,SAAS,iBAAiB,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,KAAK,EAAE,UAAU,KAAK,IAAI,CAAC,GAAG,kBAAkB,KAAK,gBAAgB,CAgI/N"}

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

@@ -0,0 +1,202 @@
+/**
+ * Copyright (c) 2025 Elara AI Pty Ltd
+ * Dual-licensed under AGPL-3.0 and commercial license. See LICENSE for details.
+ */
+/**
+ * The merge of sorted collections — k canonical Set or Dict collections in, one
+ * canonical blob, or one manifest directory, out.
+ *
+ * The inputs are read segment by segment and their current keys held in a heap
+ * ordered by key and then by input, so a key that several inputs hold leaves
+ * the heap once per input, in input order, and folds there. The merged entries
+ * go out through the element writer, so the output is the canonical blob of
+ * the merged value — the bytes any writer of that value writes, whoever wrote
+ * the inputs and however their segments fell. Memory is one decoded segment per
+ * input plus one open output segment.
+ *
+ * With a key range only the keys in `[from, to)` merge: each input starts at
+ * the segment owning `from`, found through its fences, and stops at the first
+ * key at or past `to`, so merging one range of a large output reads that
+ * range's share of each input, plus at most one segment.
+ */
+import { EastTypeValueType, isTypeValueEqual } from "../../../type_of_type.js";
+import { printFor } from "../../east.js";
+import { compareFor } from "../../../comparison.js";
+import { asTypeValue } from "./type-section.js";
+import { Beast2ElementWriter } from "./stream.js";
+import { openBeast2LazyFor } from "./lazy.js";
+import { readBeast2Extents } from "./geometry.js";
+import { isBeast2SyncRangeReader } from "./range.js";
+import { isBeast2ManifestSource } from "./manifest.js";
+import { Beast2ManifestWriter } from "./manifest-writer.js";
+/**
+ * Builds a merge of sorted Set or Dict collections of one type into one
+ * canonical collection: `merge(sources, sink)`.
+ *
+ * @param type - the collection type every input holds (Set or Dict)
+ * @param options - the fold, the key range, input labels, and the output's
+ *   codec, source map and parallel framing
+ * @returns a function merging its sources, in the order equal keys fold, into
+ *   `sink` — the blob's bytes as they are produced, or, given a
+ *   {@link Beast2ManifestSink}, a manifest directory — and returning what it
+ *   came to
+ * @throws {TypeError} When `type` is not a Set or Dict type, or the fold does
+ *   not fit it: a merge function folds a Dict, union a Set.
+ *
+ * @remarks
+ * The returned function throws, before writing anything, when no source is
+ * given or a source is not a canonical collection of `type`; while merging,
+ * when an input's keys do not ascend, a key repeats without a fold, or the
+ * merge function throws. A failed merge leaves its output without the
+ * terminator and index, or a manifest directory without its manifest, so
+ * nothing reads it as complete. Messages name the input:
+ * `merge: input 2 (<label>): …`.
+ *
+ * @example
+ * ```ts
+ * const type = SetType(IntegerType);
+ * const blob = (xs: bigint[]) => encodeBeast2PagedFor(type)(new Set(xs));
+ * const chunks: Uint8Array[] = [];
+ * mergeBeast2For(type, { union: true })([blob([1n, 3n]), blob([2n, 3n])], (b) => chunks.push(b));
+ * decodeBeast2For(type)(Buffer.concat(chunks));  // Set { 1n, 2n, 3n }
+ * ```
+ */
+export function mergeBeast2For(type, options) {
+    const typeValue = asTypeValue(type);
+    if (typeValue.type !== "Set" && typeValue.type !== "Dict") {
+        throw new TypeError(`merge: inputs must be Set or Dict blobs, got ${typeValue.type}`);
+    }
+    const { merge, union, from, to, labels, ...writerOptions } = options ?? {};
+    if (merge !== undefined && typeValue.type !== "Dict") {
+        throw new TypeError(`beast2 v5: a merge function folds a Dict's values; a Set's equal elements collapse under union`);
+    }
+    if (union && typeValue.type !== "Set") {
+        throw new TypeError(`beast2 v5: union collapses a Set's equal elements; a Dict's values fold with a merge function`);
+    }
+    const dict = typeValue.type === "Dict";
+    const keyType = dict
+        ? typeValue.value.key
+        : typeValue.value;
+    const cmp = compareFor(keyType);
+    const printKey = printFor(keyType);
+    const printType = printFor(EastTypeValueType);
+    const open = openBeast2LazyFor(typeValue, { frozen: true });
+    return (sources, sink) => {
+        if (sources.length === 0)
+            throw new Error("merge: at least one input is needed");
+        const named = (i) => (labels?.[i] !== undefined ? `merge: input ${i} (${labels[i]})` : `merge: input ${i}`);
+        const failed = (i, err) => new Error(`${named(i)}: ${err.message ?? String(err)}`);
+        // Every input is opened before anything is written, so an input that is
+        // not a collection of the type refuses the merge rather than truncating it.
+        const iterators = sources.map((source, i) => {
+            let wire;
+            try {
+                wire = isBeast2ManifestSource(source)
+                    ? source.manifest.type
+                    : (isBeast2SyncRangeReader(source) ? readBeast2Extents(source) : readBeast2Extents(source)).typeValue;
+            }
+            catch (err) {
+                throw failed(i, err);
+            }
+            if (!isTypeValueEqual(wire, typeValue)) {
+                throw new Error(`${named(i)} has type ${printType(wire)}, expected ${printType(typeValue)}`);
+            }
+            try {
+                const lazy = open(source);
+                return dict ? lazy.entries(from) : lazy.keys(from);
+            }
+            catch (err) {
+                throw failed(i, err);
+            }
+        });
+        const heads = new Array(iterators.length).fill(null);
+        const advance = (i) => {
+            let next;
+            try {
+                next = iterators[i].next();
+            }
+            catch (err) {
+                throw failed(i, err);
+            }
+            if (next.done) {
+                heads[i] = null;
+                return;
+            }
+            const [key, value] = dict ? next.value : [next.value, undefined];
+            heads[i] = to !== undefined && cmp(key, to) >= 0 ? null : { key, value };
+        };
+        for (let i = 0; i < iterators.length; i++)
+            advance(i);
+        // A binary min-heap over the inputs' current keys, ordered by (key,
+        // input), so equal keys leave in input order.
+        const heap = [];
+        for (let i = 0; i < heads.length; i++)
+            if (heads[i] !== null)
+                heap.push(i);
+        const before = (a, b) => {
+            const order = cmp(heads[a].key, heads[b].key);
+            return order < 0 || (order === 0 && a < b);
+        };
+        const siftDown = (at) => {
+            for (;;) {
+                const l = 2 * at + 1;
+                const r = l + 1;
+                let least = at;
+                if (l < heap.length && before(heap[l], heap[least]))
+                    least = l;
+                if (r < heap.length && before(heap[r], heap[least]))
+                    least = r;
+                if (least === at)
+                    return;
+                [heap[at], heap[least]] = [heap[least], heap[at]];
+                at = least;
+            }
+        };
+        for (let i = (heap.length >> 1) - 1; i >= 0; i--)
+            siftDown(i);
+        const writer = typeof sink === "function"
+            ? new Beast2ElementWriter(typeValue, sink, writerOptions)
+            : new Beast2ManifestWriter(typeValue, sink, writerOptions);
+        let entries = 0;
+        let folds = 0;
+        // The current key's entry is held until a greater key arrives, so every
+        // equal key folds into it before it is written.
+        let held = null;
+        while (heap.length > 0) {
+            const i = heap[0];
+            const { key, value } = heads[i];
+            if (held !== null && cmp(held.key, key) === 0) {
+                if (merge !== undefined) {
+                    held.value = merge(key, held.value, value);
+                }
+                else if (!union) {
+                    const noun = dict ? "Dict" : "Set";
+                    const part = dict ? "key" : "element";
+                    throw new Error(`beast2 v5: duplicate ${noun} ${part} emitted: ${printKey(key)} — ${noun} ${part}s must be unique`);
+                }
+                folds++;
+            }
+            else {
+                if (held !== null) {
+                    writer.add(dict ? [held.key, held.value] : held.key);
+                    entries++;
+                }
+                held = { key, value };
+            }
+            advance(i);
+            if (heads[i] === null) {
+                heap[0] = heap[heap.length - 1];
+                heap.pop();
+            }
+            if (heap.length > 0)
+                siftDown(0);
+        }
+        if (held !== null) {
+            writer.add(dict ? [held.key, held.value] : held.key);
+            entries++;
+        }
+        writer.finish();
+        return { inputs: iterators.length, entries, folds };
+    };
+}
+//# sourceMappingURL=merge.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"merge.js","sourceRoot":"","sources":["../../../../../src/serialization/beast2/v5/merge.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EAAsB,iBAAiB,EAAE,gBAAgB,EAAE,MAAM,0BAA0B,CAAC;AAEnG,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AACzC,OAAO,EAAE,UAAU,EAAE,MAAM,wBAAwB,CAAC;AAGpD,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,mBAAmB,EAAmC,MAAM,aAAa,CAAC;AACnF,OAAO,EAAE,iBAAiB,EAAE,MAAM,WAAW,CAAC;AAC9C,OAAO,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAC;AAClD,OAAO,EAA8B,uBAAuB,EAAE,MAAM,YAAY,CAAC;AACjF,OAAO,EAAE,sBAAsB,EAA6B,MAAM,eAAe,CAAC;AAClF,OAAO,EAAE,oBAAoB,EAA2B,MAAM,sBAAsB,CAAC;AAqCrF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AACH,MAAM,UAAU,cAAc,CAAqB,IAAuB,EAAE,OAA4B;IACtG,MAAM,SAAS,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;IACpC,IAAI,SAAS,CAAC,IAAI,KAAK,KAAK,IAAI,SAAS,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QAC1D,MAAM,IAAI,SAAS,CAAC,gDAAgD,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC;IACxF,CAAC;IACD,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,aAAa,EAAE,GAAG,OAAO,IAAI,EAAE,CAAC;IAC3E,IAAI,KAAK,KAAK,SAAS,IAAI,SAAS,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QACrD,MAAM,IAAI,SAAS,CAAC,gGAAgG,CAAC,CAAC;IACxH,CAAC;IACD,IAAI,KAAK,IAAI,SAAS,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;QACtC,MAAM,IAAI,SAAS,CAAC,+FAA+F,CAAC,CAAC;IACvH,CAAC;IACD,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,KAAK,MAAM,CAAC;IACvC,MAAM,OAAO,GAAkB,IAAI;QACjC,CAAC,CAAE,SAA+C,CAAC,KAAK,CAAC,GAAG;QAC5D,CAAC,CAAE,SAAsC,CAAC,KAAK,CAAC;IAClD,MAAM,GAAG,GAAG,UAAU,CAAC,OAAO,CAAuC,CAAC;IACtE,MAAM,QAAQ,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC;IACnC,MAAM,SAAS,GAAG,QAAQ,CAAC,iBAAiB,CAAC,CAAC;IAC9C,MAAM,IAAI,GAAG,iBAAiB,CAAC,SAAS,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;IAE5D,OAAO,CAAC,OAAO,EAAE,IAAI,EAAE,EAAE;QACvB,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC;QACjF,MAAM,KAAK,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,gBAAgB,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC;QAC5H,MAAM,MAAM,GAAG,CAAC,CAAS,EAAE,GAAY,EAAS,EAAE,CAAC,IAAI,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,KAAM,GAAa,CAAC,OAAO,IAAI,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAEtH,wEAAwE;QACxE,4EAA4E;QAC5E,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAqB,EAAE;YAC7D,IAAI,IAAmB,CAAC;YACxB,IAAI,CAAC;gBACH,IAAI,GAAG,sBAAsB,CAAC,MAAM,CAAC;oBACnC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI;oBACtB,CAAC,CAAC,CAAC,uBAAuB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;YAC1G,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,MAAM,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YACvB,CAAC;YACD,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,SAAS,CAAC,EAAE,CAAC;gBACvC,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,aAAa,SAAS,CAAC,IAAI,CAAC,cAAc,SAAS,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;YAC/F,CAAC;YACD,IAAI,CAAC;gBACH,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC1B,OAAO,IAAI,CAAC,CAAC,CAAE,IAAoC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAE,IAA2B,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC9G,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,MAAM,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YACvB,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,MAAM,KAAK,GAAgD,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClG,MAAM,OAAO,GAAG,CAAC,CAAS,EAAQ,EAAE;YAClC,IAAI,IAA6B,CAAC;YAClC,IAAI,CAAC;gBACH,IAAI,GAAG,SAAS,CAAC,CAAC,CAAE,CAAC,IAAI,EAAE,CAAC;YAC9B,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,MAAM,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YACvB,CAAC;YACD,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;gBACd,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;gBAChB,OAAO;YACT,CAAC;YACD,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC,CAAC,CAAE,IAAI,CAAC,KAA4B,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;YACzF,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,SAAS,IAAI,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC;QAC3E,CAAC,CAAC;QACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,OAAO,CAAC,CAAC,CAAC,CAAC;QAEtD,oEAAoE;QACpE,8CAA8C;QAC9C,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI;gBAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3E,MAAM,MAAM,GAAG,CAAC,CAAS,EAAE,CAAS,EAAW,EAAE;YAC/C,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,CAAC;YAChD,OAAO,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7C,CAAC,CAAC;QACF,MAAM,QAAQ,GAAG,CAAC,EAAU,EAAQ,EAAE;YACpC,SAAS,CAAC;gBACR,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;gBACrB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAChB,IAAI,KAAK,GAAG,EAAE,CAAC;gBACf,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAE,EAAE,IAAI,CAAC,KAAK,CAAE,CAAC;oBAAE,KAAK,GAAG,CAAC,CAAC;gBACjE,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAE,EAAE,IAAI,CAAC,KAAK,CAAE,CAAC;oBAAE,KAAK,GAAG,CAAC,CAAC;gBACjE,IAAI,KAAK,KAAK,EAAE;oBAAE,OAAO;gBACzB,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAE,EAAE,IAAI,CAAC,EAAE,CAAE,CAAC,CAAC;gBACpD,EAAE,GAAG,KAAK,CAAC;YACb,CAAC;QACH,CAAC,CAAC;QACF,KAAK,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;YAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;QAE9D,MAAM,MAAM,GAAG,OAAO,IAAI,KAAK,UAAU;YACvC,CAAC,CAAC,IAAI,mBAAmB,CAAC,SAAS,EAAE,IAAI,EAAE,aAAa,CAAC;YACzD,CAAC,CAAC,IAAI,oBAAoB,CAAC,SAAS,EAAE,IAAI,EAAE,aAAa,CAAC,CAAC;QAC7D,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,wEAAwE;QACxE,gDAAgD;QAChD,IAAI,IAAI,GAA4C,IAAI,CAAC;QACzD,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC;YACnB,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;YACjC,IAAI,IAAI,KAAK,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC9C,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;oBACxB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;gBAC7C,CAAC;qBAAM,IAAI,CAAC,KAAK,EAAE,CAAC;oBAClB,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;oBACnC,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;oBACtC,MAAM,IAAI,KAAK,CAAC,wBAAwB,IAAI,IAAI,IAAI,aAAa,QAAQ,CAAC,GAAG,CAAC,MAAM,IAAI,IAAI,IAAI,kBAAkB,CAAC,CAAC;gBACtH,CAAC;gBACD,KAAK,EAAE,CAAC;YACV,CAAC;iBAAM,CAAC;gBACN,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;oBAClB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBACrD,OAAO,EAAE,CAAC;gBACZ,CAAC;gBACD,IAAI,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC;YACxB,CAAC;YACD,OAAO,CAAC,CAAC,CAAC,CAAC;YACX,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;gBACtB,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC;gBACjC,IAAI,CAAC,GAAG,EAAE,CAAC;YACb,CAAC;YACD,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;gBAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC;QACD,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAClB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACrD,OAAO,EAAE,CAAC;QACZ,CAAC;QACD,MAAM,CAAC,MAAM,EAAE,CAAC;QAChB,OAAO,EAAE,MAAM,EAAE,SAAS,CAAC,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;IACtD,CAAC,CAAC;AACJ,CAAC"}

package/dist/src/serialization/beast2/v5/merge.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=merge.spec.d.ts.map

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

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