was-teaching-server 0.9.1 → 0.11.0

package/dist/lib/equalityIndex.js

@@ -0,0 +1,552 @@
+import { decodeCursor, encodeCursor } from './cursor.js';
+import { clampPageSize, DEFAULT_PAGE_SIZE } from './pagination.js';
+import { InvalidRequestBodyError, UniqueAttributeConflictError } from '../errors.js';
+/**
+ * True for a plain (non-null, non-array) object -- the only shape a `content`
+ * or `custom` source can be extracted from.
+ * @param value {unknown}
+ * @returns {boolean}
+ */
+function isPlainObject(value) {
+    return typeof value === 'object' && value !== null && !Array.isArray(value);
+}
+/**
+ * True when a JSON value is directly indexable -- a string, number, or boolean
+ * (an array of these is handled element-by-element by the caller).
+ * @param value {unknown}
+ * @returns {boolean}
+ */
+function isIndexableValue(value) {
+    return (typeof value === 'string' ||
+        typeof value === 'number' ||
+        typeof value === 'boolean');
+}
+/**
+ * Normalizes a Collection Description's declared `indexes` into the uniform
+ * {@link NormalizedIndexDeclaration} shape: a bare string entry becomes
+ * `{ name, source: 'content', unique: false }`, and an object entry has its
+ * optional `source` / `unique` defaulted. An absent declaration normalizes to
+ * an empty array. Assumes the declaration has already passed
+ * {@link assertSupportedIndexes} (or was read back from storage), so it does no
+ * shape validation of its own.
+ *
+ * @param options {object}
+ * @param [options.indexes] {Array<string | CollectionIndexDeclaration>}   the
+ *   Collection Description's declared `indexes`
+ * @returns {NormalizedIndexDeclaration[]}
+ */
+export function normalizeIndexes({ indexes }) {
+    if (indexes === undefined) {
+        return [];
+    }
+    return indexes.map(entry => {
+        if (typeof entry === 'string') {
+            return { name: entry, source: 'content', unique: false };
+        }
+        return {
+            name: entry.name,
+            source: entry.source ?? 'content',
+            unique: entry.unique === true
+        };
+    });
+}
+/**
+ * Validates a client-supplied Collection `indexes` declaration (shape only) and
+ * returns the value to persist verbatim, or `undefined` when absent (an update
+ * then leaves the stored declaration untouched, like `name` / `backend` /
+ * `encryption`). Mirrors the validation style of `assertSupportedEncryption` /
+ * `assertValidEncryptionEpochs` in `lib/encryption.ts`, rejecting a malformed
+ * declaration with `invalid-request-body` (400) and a precise `pointer`. Rules:
+ * - `indexes` MUST be an array (an EMPTY array is allowed -- it clears the
+ *   declaration).
+ * - each entry is either a non-empty string (the `content`-sourced shorthand)
+ *   or an object with a non-empty string `name`, an optional `source` of
+ *   exactly `'content'` or `'custom'`, and an optional boolean `unique`.
+ * - declared names MUST be unique across the array regardless of source
+ *   (queries refer to attributes by name alone).
+ *
+ * @param options {object}
+ * @param [options.indexes] {unknown}   the request body's `indexes` value
+ * @param [options.requestName] {string}   request name for the 400 error title
+ * @returns {Array<string | CollectionIndexDeclaration> | undefined}   the
+ *   declaration to store, or undefined when absent
+ */
+export function assertSupportedIndexes({ indexes, requestName }) {
+    if (indexes === undefined) {
+        return undefined;
+    }
+    if (!Array.isArray(indexes)) {
+        throw new InvalidRequestBodyError({
+            requestName,
+            detail: 'Collection "indexes" must be an array.',
+            pointer: '#/indexes'
+        });
+    }
+    const names = new Set();
+    indexes.forEach((entry, entryIndex) => {
+        const pointer = `#/indexes/${entryIndex}`;
+        let name;
+        if (typeof entry === 'string') {
+            if (entry.length === 0) {
+                throw new InvalidRequestBodyError({
+                    requestName,
+                    detail: 'Each "indexes" string entry must be a non-empty attribute name.',
+                    pointer
+                });
+            }
+            name = entry;
+        }
+        else if (isPlainObject(entry)) {
+            const { name: entryName, source, unique } = entry;
+            if (typeof entryName !== 'string' || entryName.length === 0) {
+                throw new InvalidRequestBodyError({
+                    requestName,
+                    detail: 'Each "indexes" entry must have a non-empty string "name".',
+                    pointer: `${pointer}/name`
+                });
+            }
+            if (source !== undefined && source !== 'content' && source !== 'custom') {
+                throw new InvalidRequestBodyError({
+                    requestName,
+                    detail: 'An "indexes" entry "source" must be exactly "content" or "custom".',
+                    pointer: `${pointer}/source`
+                });
+            }
+            if (unique !== undefined && typeof unique !== 'boolean') {
+                throw new InvalidRequestBodyError({
+                    requestName,
+                    detail: 'An "indexes" entry "unique" must be a boolean.',
+                    pointer: `${pointer}/unique`
+                });
+            }
+            name = entryName;
+        }
+        else {
+            throw new InvalidRequestBodyError({
+                requestName,
+                detail: 'Each "indexes" entry must be a non-empty string or an object with a "name".',
+                pointer
+            });
+        }
+        if (names.has(name)) {
+            throw new InvalidRequestBodyError({
+                requestName,
+                detail: `Duplicate "indexes" attribute name "${name}".`,
+                pointer: `${pointer}/name`
+            });
+        }
+        names.add(name);
+    });
+    // Persist verbatim (bare strings and objects alike survive the round-trip);
+    // normalization for extraction/matching happens at query/write time.
+    return indexes;
+}
+/**
+ * Validates and normalizes the `equality` profile's query body fields
+ * (everything besides `profile`), throwing `invalid-request-body` (400) on a
+ * malformed query. Exactly one of `equals` / `has` is required. Every attribute
+ * name appearing in `equals` or `has` MUST be among the declared index names
+ * (`indexes`, already normalized) -- a query naming an undeclared attribute is
+ * rejected fail-closed (a typo or missing declaration surfaces loudly rather
+ * than as a silently-empty page). `limit` is coerced leniently as in
+ * `parseBlindedIndexQueryBody` (a non-numeric or `< 1` value falls back to the
+ * default; the backend clamps an oversized one), and the opaque `cursor` is
+ * validated by the backend's cursor decode (`invalid-cursor` 400).
+ *
+ * @param options {object}
+ * @param options.body {object}   the parsed query POST body
+ * @param options.indexes {NormalizedIndexDeclaration[]}   the Collection's
+ *   normalized declared indexes (the allowed attribute names)
+ * @param [options.requestName] {string}
+ * @returns {{ query: EqualityQuery, count: boolean, limit?: number, cursor?: string }}
+ */
+export function parseEqualityQueryBody({ body, indexes, requestName }) {
+    const { equals, has, count, limit, cursor } = body;
+    const declared = new Set(indexes.map(entry => entry.name));
+    // Exactly one of `equals` / `has`: supplying neither, or both, is a 400.
+    if ((equals === undefined) === (has === undefined)) {
+        throw new InvalidRequestBodyError({
+            requestName,
+            detail: 'An equality query requires exactly one of "equals" or "has".'
+        });
+    }
+    const query = {};
+    if (equals !== undefined) {
+        if (!Array.isArray(equals) || equals.length === 0) {
+            throw new InvalidRequestBodyError({
+                requestName,
+                detail: '"equals" must be a non-empty array of objects.',
+                pointer: '#/equals'
+            });
+        }
+        equals.forEach((element, elementIndex) => {
+            const pointer = `#/equals/${elementIndex}`;
+            if (!isPlainObject(element)) {
+                throw new InvalidRequestBodyError({
+                    requestName,
+                    detail: '"equals" elements must be objects mapping declared attribute names to string, number, or boolean values.',
+                    pointer
+                });
+            }
+            for (const [name, value] of Object.entries(element)) {
+                if (!isIndexableValue(value)) {
+                    throw new InvalidRequestBodyError({
+                        requestName,
+                        detail: 'An "equals" attribute value must be a string, number, or boolean.',
+                        pointer: `${pointer}/${name}`
+                    });
+                }
+                if (!declared.has(name)) {
+                    throw new InvalidRequestBodyError({
+                        requestName,
+                        detail: `Attribute "${name}" is not declared in the Collection's indexes.`,
+                        pointer: `${pointer}/${name}`
+                    });
+                }
+            }
+        });
+        query.equals = equals;
+    }
+    if (has !== undefined) {
+        if (!Array.isArray(has) ||
+            has.length === 0 ||
+            has.some(name => typeof name !== 'string')) {
+            throw new InvalidRequestBodyError({
+                requestName,
+                detail: '"has" must be a non-empty array of declared attribute names.',
+                pointer: '#/has'
+            });
+        }
+        for (const name of has) {
+            if (!declared.has(name)) {
+                throw new InvalidRequestBodyError({
+                    requestName,
+                    detail: `Attribute "${name}" is not declared in the Collection's indexes.`,
+                    pointer: '#/has'
+                });
+            }
+        }
+        query.has = has;
+    }
+    if (count !== undefined && typeof count !== 'boolean') {
+        throw new InvalidRequestBodyError({
+            requestName,
+            detail: '"count" must be a boolean.',
+            pointer: '#/count'
+        });
+    }
+    if (cursor !== undefined && typeof cursor !== 'string') {
+        throw new InvalidRequestBodyError({
+            requestName,
+            detail: '"cursor" must be a string.',
+            pointer: '#/cursor'
+        });
+    }
+    // Lenient `limit` coercion, same as the `changes` / `blinded-index` profiles:
+    // a non-numeric or `< 1` value is ignored so the backend applies its own
+    // default/clamp.
+    const parsedLimit = Number(limit);
+    const resolvedLimit = Number.isFinite(parsedLimit) && parsedLimit >= 1 ? parsedLimit : undefined;
+    return {
+        query,
+        count: count === true,
+        ...(resolvedLimit !== undefined && { limit: resolvedLimit }),
+        ...(cursor !== undefined && { cursor })
+    };
+}
+/**
+ * Extracts a Resource's indexable attribute values per its Collection's
+ * declared indexes, keyed by declared name. For each declared entry the
+ * top-level member is read from its `source` -- `content` from the stored JSON
+ * content, `custom` from the custom metadata object -- each only when that
+ * source is a plain object. A member is indexable when it is a string, number,
+ * or boolean, or an array of those (an array indexes the Resource under EACH
+ * element; a `null`, object, or nested-array element contributes nothing);
+ * anything else, an absent member, or a non-object source contributes no entry
+ * for that attribute. Strict typing, no coercion: `1`, `"1"`, and `true` stay
+ * distinct.
+ *
+ * @param options {object}
+ * @param options.indexes {NormalizedIndexDeclaration[]}   the normalized indexes
+ * @param [options.content] {unknown}   the stored JSON content (a JSON Resource)
+ * @param [options.custom] {unknown}   the custom metadata object
+ * @returns {Map<string, EqualityValue[]>}   declared name to its indexable values
+ */
+export function extractEqualityAttributes({ indexes, content, custom }) {
+    const extracted = new Map();
+    for (const declaration of indexes) {
+        const source = declaration.source === 'custom' ? custom : content;
+        if (!isPlainObject(source)) {
+            continue;
+        }
+        const member = source[declaration.name];
+        const values = [];
+        if (Array.isArray(member)) {
+            for (const element of member) {
+                if (isIndexableValue(element)) {
+                    values.push(element);
+                }
+            }
+        }
+        else if (isIndexableValue(member)) {
+            values.push(member);
+        }
+        if (values.length > 0) {
+            // A name may be declared once (unique across the array), so no merge is
+            // needed; the last declaration for a name wins if that ever changes.
+            extracted.set(declaration.name, values);
+        }
+    }
+    return extracted;
+}
+/**
+ * True when a candidate Resource matches an equality query. `equals` matches
+ * when SOME element has ALL its `{name: value}` pairs present among the
+ * candidate's extracted attributes (an empty element matches nothing); `has`
+ * matches when EVERY named attribute is present with an indexable value. Strict
+ * value equality (`===`), so `1`, `"1"`, and `true` never cross-match; a
+ * multi-valued attribute matches when any of its values equals the queried one.
+ *
+ * @param options {object}
+ * @param options.candidate {EqualityCandidate}
+ * @param options.query {EqualityQuery}
+ * @param options.indexes {NormalizedIndexDeclaration[]}
+ * @returns {boolean}
+ */
+export function matchesEqualityQuery({ candidate, query, indexes }) {
+    const attributes = extractEqualityAttributes({
+        indexes,
+        content: candidate.content,
+        custom: candidate.custom
+    });
+    if (query.equals !== undefined) {
+        return query.equals.some(element => {
+            const pairs = Object.entries(element);
+            return (pairs.length > 0 &&
+                pairs.every(([name, value]) => (attributes.get(name) ?? []).some(held => held === value)));
+        });
+    }
+    return (query.has ?? []).every(name => attributes.has(name));
+}
+/**
+ * Evaluates an equality query over a Collection's candidate Resources and
+ * shapes the result: a bare `{count}` for a count query, else a page of
+ * matching documents in ascending `resourceId` (code-unit) order with the
+ * standard opaque-cursor pagination (`limit` clamped to `[1, MAX_PAGE_SIZE]`,
+ * default `DEFAULT_PAGE_SIZE`; `cursor` resumes strictly after its anchor id,
+ * so paging stays correct if the anchor was deleted between pages). A malformed
+ * `cursor` rejects with `invalid-cursor` (400).
+ *
+ * Backends call this with every live Resource of the Collection (JSON Resources
+ * carrying `content`, blobs carrying only `custom`) -- an O(n) full scan,
+ * deliberate for these teaching backends (a materialized backend would answer
+ * from a JSONB expression index or attribute side-table).
+ *
+ * @param options {object}
+ * @param options.candidates {EqualityCandidate[]}
+ * @param options.query {EqualityQuery}
+ * @param options.indexes {NormalizedIndexDeclaration[]}
+ * @param [options.count] {boolean}   return only the match count
+ * @param [options.limit] {number}   requested page size
+ * @param [options.cursor] {string}   opaque cursor from a prior page
+ * @returns {{ count: number } | EqualityQueryPage}
+ */
+export function runEqualityQuery({ candidates, query, indexes, count, limit, cursor }) {
+    const matches = candidates
+        .filter(candidate => matchesEqualityQuery({ candidate, query, indexes }))
+        // Ascending `resourceId` in code-unit order -- the SAME ordering the cursor
+        // seek (`resourceId > after`) uses, so the keyset is stable.
+        .sort((left, right) => left.resourceId < right.resourceId
+        ? -1
+        : left.resourceId > right.resourceId
+            ? 1
+            : 0);
+    if (count === true) {
+        return { count: matches.length };
+    }
+    // Seek strictly past the cursor's anchor id.
+    let startIndex = 0;
+    if (cursor !== undefined) {
+        const { after } = decodeCursor(cursor);
+        const found = matches.findIndex(({ resourceId }) => resourceId > after);
+        startIndex = found === -1 ? matches.length : found;
+    }
+    const pageSize = limit === undefined ? DEFAULT_PAGE_SIZE : clampPageSize(limit);
+    // Take `pageSize + 1` to detect a further page without a second pass.
+    const window = matches.slice(startIndex, startIndex + pageSize + 1);
+    const hasMore = window.length > pageSize;
+    const page = hasMore ? window.slice(0, pageSize) : window;
+    return {
+        documents: page.map(candidate => ({
+            id: candidate.resourceId,
+            // `data` present iff the Resource has JSON content (absent for a blob);
+            // `custom` present when the Resource carries a custom metadata object.
+            ...(candidate.content !== undefined && { data: candidate.content }),
+            ...(isPlainObject(candidate.custom) && { custom: candidate.custom })
+        })),
+        hasMore,
+        ...(hasMore && {
+            cursor: encodeCursor(page[page.length - 1].resourceId)
+        })
+    };
+}
+/**
+ * Collects a Resource's `unique: true` attribute claims as `(name, value)`
+ * pairs -- the claims the per-Collection uniqueness invariant protects. Only
+ * declared entries carrying `unique: true` are considered; each indexable value
+ * (an array value claims EACH element) becomes one claim. A Resource whose
+ * unique attribute is absent or non-indexable makes no claim.
+ *
+ * @param options {object}
+ * @param options.indexes {NormalizedIndexDeclaration[]}
+ * @param [options.content] {unknown}   the stored JSON content
+ * @param [options.custom] {unknown}   the custom metadata object
+ * @returns {Array<{ name: string, value: EqualityValue }>}
+ */
+export function collectUniqueEqualityTerms({ indexes, content, custom }) {
+    const uniqueDeclarations = indexes.filter(declaration => declaration.unique);
+    if (uniqueDeclarations.length === 0) {
+        return [];
+    }
+    const extracted = extractEqualityAttributes({
+        indexes: uniqueDeclarations,
+        content,
+        custom
+    });
+    const terms = [];
+    for (const [name, values] of extracted) {
+        for (const value of values) {
+            terms.push({ name, value });
+        }
+    }
+    return terms;
+}
+/**
+ * Enforces the per-Collection unique-attribute invariant on a write: a
+ * `unique: true` declared attribute's `(name, value)` claim may be held by at
+ * most one live Resource in the Collection. Because the declaration is
+ * Collection-level, a conflict does NOT require the other side to opt in -- ANY
+ * other live Resource whose extracted value for that attribute equals the claim
+ * conflicts. `candidates` MUST already exclude the Resource being written, so a
+ * Resource re-asserting its own existing value never self-conflicts. Throws
+ * `UniqueAttributeConflictError` (409) on a conflict; a Resource with no unique
+ * claim never throws.
+ *
+ * The caller is responsible for making the check-and-write atomic (the
+ * filesystem backend serializes claim-carrying writes per Collection; the
+ * Postgres backend takes a per-Collection advisory lock in the write
+ * transaction), the same pattern as `assertNoUniqueBlindedConflict`.
+ *
+ * @param options {object}
+ * @param options.indexes {NormalizedIndexDeclaration[]}
+ * @param [options.content] {unknown}   the incoming Resource's content
+ * @param [options.custom] {unknown}   the incoming Resource's custom metadata
+ * @param options.candidates {EqualityCandidate[]}   the Collection's OTHER live
+ *   Resources (the one being written already excluded)
+ * @returns {void}
+ */
+export function assertNoUniqueEqualityConflict({ indexes, content, custom, candidates }) {
+    const incoming = collectUniqueEqualityTerms({ indexes, content, custom });
+    if (incoming.length === 0) {
+        return;
+    }
+    // Key the claims unambiguously (a name or a string value may itself contain
+    // any delimiter, and the value's JSON type must stay distinct -- `1` vs `"1"`
+    // -- so a joined string could collide).
+    const claimed = new Set(incoming.map(term => JSON.stringify([term.name, term.value])));
+    for (const candidate of candidates) {
+        const held = collectUniqueEqualityTerms({
+            indexes,
+            content: candidate.content,
+            custom: candidate.custom
+        });
+        for (const term of held) {
+            if (claimed.has(JSON.stringify([term.name, term.value]))) {
+                throw new UniqueAttributeConflictError({ variant: 'equality' });
+            }
+        }
+    }
+}
+/**
+ * Scans a Collection's candidates for an existing violation of a unique claim:
+ * two DIFFERENT Resources holding the same `(name, value)` under the
+ * `unique`-declared entries. Returns the first such `{ name, value }`, or
+ * `undefined` when none exists. Used when a Collection update ADDS a unique
+ * claim over already-stored Resources (the declare-time conflict scan); the
+ * request layer rejects a found violation with `id-conflict` (409).
+ *
+ * @param options {object}
+ * @param options.indexes {NormalizedIndexDeclaration[]}
+ * @param options.candidates {EqualityCandidate[]}   the Collection's live
+ *   Resources
+ * @returns {{ name: string, value: EqualityValue } | undefined}
+ */
+export function findEqualityUniqueViolation({ indexes, candidates }) {
+    const uniqueDeclarations = indexes.filter(declaration => declaration.unique);
+    if (uniqueDeclarations.length === 0) {
+        return undefined;
+    }
+    // Map each seen claim key to the resourceId holding it; a second, different
+    // holder is the violation.
+    const holders = new Map();
+    for (const candidate of candidates) {
+        const held = collectUniqueEqualityTerms({
+            indexes: uniqueDeclarations,
+            content: candidate.content,
+            custom: candidate.custom
+        });
+        for (const term of held) {
+            const key = JSON.stringify([term.name, term.value]);
+            const existing = holders.get(key);
+            if (existing !== undefined && existing !== candidate.resourceId) {
+                return { name: term.name, value: term.value };
+            }
+            holders.set(key, candidate.resourceId);
+        }
+    }
+    return undefined;
+}
+/**
+ * Collects the GET List Collection `filter[<name>]=<value>` equality filters
+ * from a Fastify parsed querystring object -- the anonymous-cacheable entry
+ * point over the same equality machinery as the POST profile. Fastify's default
+ * querystring parser leaves bracket keys literal and percent-decodes them, so a
+ * `filter[parentId]=first-post` query arrives as the key `filter[parentId]`.
+ * Returns a `{ <name>: <value> }` map, or `undefined` when no `filter[...]` key
+ * is present (the ordinary listing path). A repeated same attribute (the parser
+ * yields an array value) is rejected with `invalid-request-body` (400) -- v1
+ * admits only a single value per attribute. Attribute names are NOT validated
+ * against the Collection's declarations here; the handler does that once it has
+ * fetched the description.
+ *
+ * @param options {object}
+ * @param options.query {Record<string, string | string[] | undefined>}   the
+ *   Fastify-parsed querystring object
+ * @param [options.requestName] {string}
+ * @returns {Record<string, string> | undefined}
+ */
+export function parseListFilter({ query, requestName }) {
+    const filters = {};
+    let found = false;
+    for (const [key, value] of Object.entries(query)) {
+        const match = /^filter\[(.+)\]$/.exec(key);
+        if (!match) {
+            continue;
+        }
+        const name = match[1];
+        found = true;
+        if (Array.isArray(value)) {
+            throw new InvalidRequestBodyError({
+                requestName,
+                detail: `Filter attribute "${name}" may not be repeated.`,
+                pointer: `#/filter/${name}`
+            });
+        }
+        if (value === undefined) {
+            continue;
+        }
+        filters[name] = value;
+    }
+    return found ? filters : undefined;
+}
+//# sourceMappingURL=equalityIndex.js.map

package/dist/lib/equalityIndex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"equalityIndex.js","sourceRoot":"","sources":["../../src/lib/equalityIndex.ts"],"names":[],"mappings":"AA8BA,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,aAAa,CAAA;AACxD,OAAO,EAAE,aAAa,EAAE,iBAAiB,EAAE,MAAM,iBAAiB,CAAA;AAClE,OAAO,EACL,uBAAuB,EACvB,4BAA4B,EAC7B,MAAM,cAAc,CAAA;AA2DrB;;;;;GAKG;AACH,SAAS,aAAa,CAAC,KAAc;IACnC,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;AAC7E,CAAC;AAED;;;;;GAKG;AACH,SAAS,gBAAgB,CAAC,KAAc;IACtC,OAAO,CACL,OAAO,KAAK,KAAK,QAAQ;QACzB,OAAO,KAAK,KAAK,QAAQ;QACzB,OAAO,KAAK,KAAK,SAAS,CAC3B,CAAA;AACH,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,gBAAgB,CAAC,EAC/B,OAAO,EAGR;IACC,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;QAC1B,OAAO,EAAE,CAAA;IACX,CAAC;IACD,OAAO,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;QACzB,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;YAC9B,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,CAAA;QAC1D,CAAC;QACD,OAAO;YACL,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,MAAM,EAAE,KAAK,CAAC,MAAM,IAAI,SAAS;YACjC,MAAM,EAAE,KAAK,CAAC,MAAM,KAAK,IAAI;SAC9B,CAAA;IACH,CAAC,CAAC,CAAA;AACJ,CAAC;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,UAAU,sBAAsB,CAAC,EACrC,OAAO,EACP,WAAW,EAIZ;IACC,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;QAC1B,OAAO,SAAS,CAAA;IAClB,CAAC;IACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;QAC5B,MAAM,IAAI,uBAAuB,CAAC;YAChC,WAAW;YACX,MAAM,EAAE,wCAAwC;YAChD,OAAO,EAAE,WAAW;SACrB,CAAC,CAAA;IACJ,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAA;IAC/B,OAAO,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,UAAU,EAAE,EAAE;QACpC,MAAM,OAAO,GAAG,aAAa,UAAU,EAAE,CAAA;QACzC,IAAI,IAAY,CAAA;QAChB,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;YAC9B,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACvB,MAAM,IAAI,uBAAuB,CAAC;oBAChC,WAAW;oBACX,MAAM,EACJ,iEAAiE;oBACnE,OAAO;iBACR,CAAC,CAAA;YACJ,CAAC;YACD,IAAI,GAAG,KAAK,CAAA;QACd,CAAC;aAAM,IAAI,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;YAChC,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,KAAK,CAAA;YACjD,IAAI,OAAO,SAAS,KAAK,QAAQ,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC5D,MAAM,IAAI,uBAAuB,CAAC;oBAChC,WAAW;oBACX,MAAM,EAAE,2DAA2D;oBACnE,OAAO,EAAE,GAAG,OAAO,OAAO;iBAC3B,CAAC,CAAA;YACJ,CAAC;YACD,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,QAAQ,EAAE,CAAC;gBACxE,MAAM,IAAI,uBAAuB,CAAC;oBAChC,WAAW;oBACX,MAAM,EACJ,oEAAoE;oBACtE,OAAO,EAAE,GAAG,OAAO,SAAS;iBAC7B,CAAC,CAAA;YACJ,CAAC;YACD,IAAI,MAAM,KAAK,SAAS,IAAI,OAAO,MAAM,KAAK,SAAS,EAAE,CAAC;gBACxD,MAAM,IAAI,uBAAuB,CAAC;oBAChC,WAAW;oBACX,MAAM,EAAE,gDAAgD;oBACxD,OAAO,EAAE,GAAG,OAAO,SAAS;iBAC7B,CAAC,CAAA;YACJ,CAAC;YACD,IAAI,GAAG,SAAS,CAAA;QAClB,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,uBAAuB,CAAC;gBAChC,WAAW;gBACX,MAAM,EACJ,6EAA6E;gBAC/E,OAAO;aACR,CAAC,CAAA;QACJ,CAAC;QACD,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACpB,MAAM,IAAI,uBAAuB,CAAC;gBAChC,WAAW;gBACX,MAAM,EAAE,uCAAuC,IAAI,IAAI;gBACvD,OAAO,EAAE,GAAG,OAAO,OAAO;aAC3B,CAAC,CAAA;QACJ,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IACjB,CAAC,CAAC,CAAA;IACF,4EAA4E;IAC5E,qEAAqE;IACrE,OAAO,OAAqD,CAAA;AAC9D,CAAC;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,UAAU,sBAAsB,CAAC,EACrC,IAAI,EACJ,OAAO,EACP,WAAW,EAWZ;IAMC,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,IAAI,CAAA;IAClD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAA;IAE1D,yEAAyE;IACzE,IAAI,CAAC,MAAM,KAAK,SAAS,CAAC,KAAK,CAAC,GAAG,KAAK,SAAS,CAAC,EAAE,CAAC;QACnD,MAAM,IAAI,uBAAuB,CAAC;YAChC,WAAW;YACX,MAAM,EAAE,8DAA8D;SACvE,CAAC,CAAA;IACJ,CAAC;IAED,MAAM,KAAK,GAAkB,EAAE,CAAA;IAC/B,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACzB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAClD,MAAM,IAAI,uBAAuB,CAAC;gBAChC,WAAW;gBACX,MAAM,EAAE,gDAAgD;gBACxD,OAAO,EAAE,UAAU;aACpB,CAAC,CAAA;QACJ,CAAC;QACD,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,YAAY,EAAE,EAAE;YACvC,MAAM,OAAO,GAAG,YAAY,YAAY,EAAE,CAAA;YAC1C,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC5B,MAAM,IAAI,uBAAuB,CAAC;oBAChC,WAAW;oBACX,MAAM,EACJ,0GAA0G;oBAC5G,OAAO;iBACR,CAAC,CAAA;YACJ,CAAC;YACD,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;gBACpD,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC7B,MAAM,IAAI,uBAAuB,CAAC;wBAChC,WAAW;wBACX,MAAM,EACJ,mEAAmE;wBACrE,OAAO,EAAE,GAAG,OAAO,IAAI,IAAI,EAAE;qBAC9B,CAAC,CAAA;gBACJ,CAAC;gBACD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBACxB,MAAM,IAAI,uBAAuB,CAAC;wBAChC,WAAW;wBACX,MAAM,EAAE,cAAc,IAAI,gDAAgD;wBAC1E,OAAO,EAAE,GAAG,OAAO,IAAI,IAAI,EAAE;qBAC9B,CAAC,CAAA;gBACJ,CAAC;YACH,CAAC;QACH,CAAC,CAAC,CAAA;QACF,KAAK,CAAC,MAAM,GAAG,MAA8C,CAAA;IAC/D,CAAC;IACD,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;QACtB,IACE,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC;YACnB,GAAG,CAAC,MAAM,KAAK,CAAC;YAChB,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,IAAI,KAAK,QAAQ,CAAC,EAC1C,CAAC;YACD,MAAM,IAAI,uBAAuB,CAAC;gBAChC,WAAW;gBACX,MAAM,EAAE,8DAA8D;gBACtE,OAAO,EAAE,OAAO;aACjB,CAAC,CAAA;QACJ,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,GAAe,EAAE,CAAC;YACnC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxB,MAAM,IAAI,uBAAuB,CAAC;oBAChC,WAAW;oBACX,MAAM,EAAE,cAAc,IAAI,gDAAgD;oBAC1E,OAAO,EAAE,OAAO;iBACjB,CAAC,CAAA;YACJ,CAAC;QACH,CAAC;QACD,KAAK,CAAC,GAAG,GAAG,GAAe,CAAA;IAC7B,CAAC;IAED,IAAI,KAAK,KAAK,SAAS,IAAI,OAAO,KAAK,KAAK,SAAS,EAAE,CAAC;QACtD,MAAM,IAAI,uBAAuB,CAAC;YAChC,WAAW;YACX,MAAM,EAAE,4BAA4B;YACpC,OAAO,EAAE,SAAS;SACnB,CAAC,CAAA;IACJ,CAAC;IAED,IAAI,MAAM,KAAK,SAAS,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE,CAAC;QACvD,MAAM,IAAI,uBAAuB,CAAC;YAChC,WAAW;YACX,MAAM,EAAE,4BAA4B;YACpC,OAAO,EAAE,UAAU;SACpB,CAAC,CAAA;IACJ,CAAC;IAED,8EAA8E;IAC9E,yEAAyE;IACzE,iBAAiB;IACjB,MAAM,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC,CAAA;IACjC,MAAM,aAAa,GACjB,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,IAAI,WAAW,IAAI,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS,CAAA;IAE5E,OAAO;QACL,KAAK;QACL,KAAK,EAAE,KAAK,KAAK,IAAI;QACrB,GAAG,CAAC,aAAa,KAAK,SAAS,IAAI,EAAE,KAAK,EAAE,aAAa,EAAE,CAAC;QAC5D,GAAG,CAAC,MAAM,KAAK,SAAS,IAAI,EAAE,MAAM,EAAE,CAAC;KACxC,CAAA;AACH,CAAC;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,UAAU,yBAAyB,CAAC,EACxC,OAAO,EACP,OAAO,EACP,MAAM,EAKP;IACC,MAAM,SAAS,GAAG,IAAI,GAAG,EAA2B,CAAA;IACpD,KAAK,MAAM,WAAW,IAAI,OAAO,EAAE,CAAC;QAClC,MAAM,MAAM,GAAG,WAAW,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAA;QACjE,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE,CAAC;YAC3B,SAAQ;QACV,CAAC;QACD,MAAM,MAAM,GAAG,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;QACvC,MAAM,MAAM,GAAoB,EAAE,CAAA;QAClC,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YAC1B,KAAK,MAAM,OAAO,IAAI,MAAM,EAAE,CAAC;gBAC7B,IAAI,gBAAgB,CAAC,OAAO,CAAC,EAAE,CAAC;oBAC9B,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;gBACtB,CAAC;YACH,CAAC;QACH,CAAC;aAAM,IAAI,gBAAgB,CAAC,MAAM,CAAC,EAAE,CAAC;YACpC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QACrB,CAAC;QACD,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,wEAAwE;YACxE,qEAAqE;YACrE,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;QACzC,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAA;AAClB,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,oBAAoB,CAAC,EACnC,SAAS,EACT,KAAK,EACL,OAAO,EAKR;IACC,MAAM,UAAU,GAAG,yBAAyB,CAAC;QAC3C,OAAO;QACP,OAAO,EAAE,SAAS,CAAC,OAAO;QAC1B,MAAM,EAAE,SAAS,CAAC,MAAM;KACzB,CAAC,CAAA;IACF,IAAI,KAAK,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;QAC/B,OAAO,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE;YACjC,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAA;YACrC,OAAO,CACL,KAAK,CAAC,MAAM,GAAG,CAAC;gBAChB,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,EAAE,CAC5B,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,KAAK,KAAK,CAAC,CAC1D,CACF,CAAA;QACH,CAAC,CAAC,CAAA;IACJ,CAAC;IACD,OAAO,CAAC,KAAK,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAA;AAC9D,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAM,UAAU,gBAAgB,CAAC,EAC/B,UAAU,EACV,KAAK,EACL,OAAO,EACP,KAAK,EACL,KAAK,EACL,MAAM,EAQP;IACC,MAAM,OAAO,GAAG,UAAU;SACvB,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,oBAAoB,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;QACzE,4EAA4E;QAC5E,6DAA6D;SAC5D,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CACpB,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC,UAAU;QAChC,CAAC,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC,UAAU;YAClC,CAAC,CAAC,CAAC;YACH,CAAC,CAAC,CAAC,CACR,CAAA;IAEH,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;QACnB,OAAO,EAAE,KAAK,EAAE,OAAO,CAAC,MAAM,EAAE,CAAA;IAClC,CAAC;IAED,6CAA6C;IAC7C,IAAI,UAAU,GAAG,CAAC,CAAA;IAClB,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACzB,MAAM,EAAE,KAAK,EAAE,GAAG,YAAY,CAAC,MAAM,CAAC,CAAA;QACtC,MAAM,KAAK,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC,UAAU,GAAG,KAAK,CAAC,CAAA;QACvE,UAAU,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAA;IACpD,CAAC;IAED,MAAM,QAAQ,GACZ,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,CAAA;IAEhE,sEAAsE;IACtE,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,UAAU,EAAE,UAAU,GAAG,QAAQ,GAAG,CAAC,CAAC,CAAA;IACnE,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,GAAG,QAAQ,CAAA;IACxC,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAA;IAEzD,OAAO;QACL,SAAS,EAAE,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;YAChC,EAAE,EAAE,SAAS,CAAC,UAAU;YACxB,wEAAwE;YACxE,uEAAuE;YACvE,GAAG,CAAC,SAAS,CAAC,OAAO,KAAK,SAAS,IAAI,EAAE,IAAI,EAAE,SAAS,CAAC,OAAO,EAAE,CAAC;YACnE,GAAG,CAAC,aAAa,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,SAAS,CAAC,MAAM,EAAE,CAAC;SACrE,CAAC,CAAC;QACH,OAAO;QACP,GAAG,CAAC,OAAO,IAAI;YACb,MAAM,EAAE,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC,UAAU,CAAC;SACxD,CAAC;KACH,CAAA;AACH,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,0BAA0B,CAAC,EACzC,OAAO,EACP,OAAO,EACP,MAAM,EAKP;IACC,MAAM,kBAAkB,GAAG,OAAO,CAAC,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,CAAA;IAC5E,IAAI,kBAAkB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACpC,OAAO,EAAE,CAAA;IACX,CAAC;IACD,MAAM,SAAS,GAAG,yBAAyB,CAAC;QAC1C,OAAO,EAAE,kBAAkB;QAC3B,OAAO;QACP,MAAM;KACP,CAAC,CAAA;IACF,MAAM,KAAK,GAAkD,EAAE,CAAA;IAC/D,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QACvC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAA;QAC7B,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,MAAM,UAAU,8BAA8B,CAAC,EAC7C,OAAO,EACP,OAAO,EACP,MAAM,EACN,UAAU,EAMX;IACC,MAAM,QAAQ,GAAG,0BAA0B,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAA;IACzE,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAM;IACR,CAAC;IACD,4EAA4E;IAC5E,8EAA8E;IAC9E,wCAAwC;IACxC,MAAM,OAAO,GAAG,IAAI,GAAG,CACrB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAC9D,CAAA;IACD,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,IAAI,GAAG,0BAA0B,CAAC;YACtC,OAAO;YACP,OAAO,EAAE,SAAS,CAAC,OAAO;YAC1B,MAAM,EAAE,SAAS,CAAC,MAAM;SACzB,CAAC,CAAA;QACF,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;gBACzD,MAAM,IAAI,4BAA4B,CAAC,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC,CAAA;YACjE,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,2BAA2B,CAAC,EAC1C,OAAO,EACP,UAAU,EAIX;IACC,MAAM,kBAAkB,GAAG,OAAO,CAAC,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,CAAA;IAC5E,IAAI,kBAAkB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACpC,OAAO,SAAS,CAAA;IAClB,CAAC;IACD,4EAA4E;IAC5E,2BAA2B;IAC3B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAA;IACzC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,IAAI,GAAG,0BAA0B,CAAC;YACtC,OAAO,EAAE,kBAAkB;YAC3B,OAAO,EAAE,SAAS,CAAC,OAAO;YAC1B,MAAM,EAAE,SAAS,CAAC,MAAM;SACzB,CAAC,CAAA;QACF,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAA;YACnD,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YACjC,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,KAAK,SAAS,CAAC,UAAU,EAAE,CAAC;gBAChE,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAA;YAC/C,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,SAAS,CAAC,UAAU,CAAC,CAAA;QACxC,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAA;AAClB,CAAC;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,UAAU,eAAe,CAAC,EAC9B,KAAK,EACL,WAAW,EAIZ;IACC,MAAM,OAAO,GAA2B,EAAE,CAAA;IAC1C,IAAI,KAAK,GAAG,KAAK,CAAA;IACjB,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACjD,MAAM,KAAK,GAAG,kBAAkB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QAC1C,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,SAAQ;QACV,CAAC;QACD,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAE,CAAA;QACtB,KAAK,GAAG,IAAI,CAAA;QACZ,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YACzB,MAAM,IAAI,uBAAuB,CAAC;gBAChC,WAAW;gBACX,MAAM,EAAE,qBAAqB,IAAI,wBAAwB;gBACzD,OAAO,EAAE,YAAY,IAAI,EAAE;aAC5B,CAAC,CAAA;QACJ,CAAC;QACD,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,SAAQ;QACV,CAAC;QACD,OAAO,CAAC,IAAI,CAAC,GAAG,KAAK,CAAA;IACvB,CAAC;IACD,OAAO,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAA;AACpC,CAAC"}

package/dist/lib/exportManifest.d.ts

@@ -1,3 +1,12 @@
+/**
+ * Fixed `mtime` for every entry in an export archive. `tar-stream` defaults a
+ * header's `mtime` to the wall-clock time it was packed, which makes two
+ * exports of an unchanged Space differ whenever they straddle a one-second
+ * boundary. Pinning it to the Unix epoch makes an export a pure function of
+ * the Space's contents (byte-reproducible and diff-stable); the timestamp
+ * carries no meaning a consumer relies on.
+ */
+export declare const EXPORT_ENTRY_MTIME: Date;
 /**
  * One top-level entry of the Space being exported, in archive order: a
  * Space-level file (`files` absent) or a Collection directory with its ordered

package/dist/lib/exportManifest.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"exportManifest.d.ts","sourceRoot":"","sources":["../../src/lib/exportManifest.ts"],"names":[],"mappings":"AAgBA;;;;GAIG;AACH,MAAM,WAAW,gBAAgB;IAC/B,IAAI,EAAE,MAAM,CAAA;IACZ,2EAA2E;IAC3E,KAAK,CAAC,EAAE,MAAM,EAAE,CAAA;CACjB;AAyBD;;;;;;;;;;;;GAYG;AACH,wBAAgB,mBAAmB,CAAC,EAClC,OAAO,EACP,OAAO,EACP,eAAoB,EACrB,EAAE;IACD,OAAO,EAAE,MAAM,CAAA;IACf,OAAO,EAAE,gBAAgB,EAAE,CAAA;IAC3B,eAAe,CAAC,EAAE,MAAM,EAAE,CAAA;CAC3B,GAAG,MAAM,CAiCT"}
+{"version":3,"file":"exportManifest.d.ts","sourceRoot":"","sources":["../../src/lib/exportManifest.ts"],"names":[],"mappings":"AAgBA;;;;;;;GAOG;AACH,eAAO,MAAM,kBAAkB,MAAc,CAAA;AAE7C;;;;GAIG;AACH,MAAM,WAAW,gBAAgB;IAC/B,IAAI,EAAE,MAAM,CAAA;IACZ,2EAA2E;IAC3E,KAAK,CAAC,EAAE,MAAM,EAAE,CAAA;CACjB;AAyBD;;;;;;;;;;;;GAYG;AACH,wBAAgB,mBAAmB,CAAC,EAClC,OAAO,EACP,OAAO,EACP,eAAoB,EACrB,EAAE;IACD,OAAO,EAAE,MAAM,CAAA;IACf,OAAO,EAAE,gBAAgB,EAAE,CAAA;IAC3B,eAAe,CAAC,EAAE,MAAM,EAAE,CAAA;CAC3B,GAAG,MAAM,CAiCT"}

package/dist/lib/exportManifest.js

@@ -6,6 +6,15 @@
  * this module is the single home for the manifest that describes it.
  */
 import { UBC_MANIFEST_URL, SPACE_URL, COLLECTION_URL, RESOURCE_URL, POLICY_URL, META_URL } from '../config.default.js';
+/**
+ * Fixed `mtime` for every entry in an export archive. `tar-stream` defaults a
+ * header's `mtime` to the wall-clock time it was packed, which makes two
+ * exports of an unchanged Space differ whenever they straddle a one-second
+ * boundary. Pinning it to the Unix epoch makes an export a pure function of
+ * the Space's contents (byte-reproducible and diff-stable); the timestamp
+ * carries no meaning a consumer relies on.
+ */
+export const EXPORT_ENTRY_MTIME = new Date(0);
 /**
  * Classifies one Collection-dir file name into its manifest entry: the known
  * dot-file kinds and resource representations get a documenting `url`, anything

package/dist/lib/exportManifest.js.map

@@ -1 +1 @@
-{"version":3,"file":"exportManifest.js","sourceRoot":"","sources":["../../src/lib/exportManifest.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,OAAO,EACL,gBAAgB,EAChB,SAAS,EACT,cAAc,EACd,YAAY,EACZ,UAAU,EACV,QAAQ,EACT,MAAM,sBAAsB,CAAA;AAa7B;;;;;;GAMG;AACH,SAAS,uBAAuB,CAAC,QAAgB;IAC/C,IAAI,QAAQ,CAAC,UAAU,CAAC,cAAc,CAAC,EAAE,CAAC;QACxC,OAAO,EAAE,CAAC,QAAQ,CAAC,EAAE,EAAE,GAAG,EAAE,cAAc,EAAE,EAAE,CAAA;IAChD,CAAC;IACD,IAAI,QAAQ,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE,CAAC;QACpC,OAAO,EAAE,CAAC,QAAQ,CAAC,EAAE,EAAE,GAAG,EAAE,UAAU,EAAE,EAAE,CAAA;IAC5C,CAAC;IACD,IAAI,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;QAClC,OAAO,EAAE,CAAC,QAAQ,CAAC,EAAE,EAAE,GAAG,EAAE,QAAQ,EAAE,EAAE,CAAA;IAC1C,CAAC;IACD,IAAI,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9B,OAAO,EAAE,CAAC,QAAQ,CAAC,EAAE,EAAE,GAAG,EAAE,YAAY,EAAE,EAAE,CAAA;IAC9C,CAAC;IACD,OAAO,QAAQ,CAAA;AACjB,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,mBAAmB,CAAC,EAClC,OAAO,EACP,OAAO,EACP,eAAe,GAAG,EAAE,EAKrB;IACC,MAAM,aAAa,GAAc,EAAE,CAAA;IACnC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;YAC9B,wDAAwD;YACxD,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;YAC9B,SAAQ;QACV,CAAC;QACD,aAAa,CAAC,IAAI,CAAC;YACjB,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE;gBACZ,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,uBAAuB,CAAC;aACnD;SACF,CAAC,CAAA;IACJ,CAAC;IAED,OAAO;QACL,aAAa,EAAE,KAAK;QACpB,QAAQ,EAAE;YACR,cAAc,EAAE,EAAE,GAAG,EAAE,gBAAgB,EAAE;YACzC,GAAG,CAAC,eAAe,CAAC,MAAM,GAAG,CAAC,IAAI;gBAChC,WAAW,EAAE,EAAE,QAAQ,EAAE,CAAC,GAAG,eAAe,CAAC,EAAE;aAChD,CAAC;YACF,KAAK,EAAE;gBACL,GAAG,EAAE,SAAS;gBACd,QAAQ,EAAE;oBACR,CAAC,OAAO,CAAC,EAAE;wBACT,GAAG,EAAE,SAAS;wBACd,QAAQ,EAAE,aAAa;qBACxB;iBACF;aACF;SACF;KACF,CAAA;AACH,CAAC"}
+{"version":3,"file":"exportManifest.js","sourceRoot":"","sources":["../../src/lib/exportManifest.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,OAAO,EACL,gBAAgB,EAChB,SAAS,EACT,cAAc,EACd,YAAY,EACZ,UAAU,EACV,QAAQ,EACT,MAAM,sBAAsB,CAAA;AAE7B;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,CAAA;AAa7C;;;;;;GAMG;AACH,SAAS,uBAAuB,CAAC,QAAgB;IAC/C,IAAI,QAAQ,CAAC,UAAU,CAAC,cAAc,CAAC,EAAE,CAAC;QACxC,OAAO,EAAE,CAAC,QAAQ,CAAC,EAAE,EAAE,GAAG,EAAE,cAAc,EAAE,EAAE,CAAA;IAChD,CAAC;IACD,IAAI,QAAQ,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE,CAAC;QACpC,OAAO,EAAE,CAAC,QAAQ,CAAC,EAAE,EAAE,GAAG,EAAE,UAAU,EAAE,EAAE,CAAA;IAC5C,CAAC;IACD,IAAI,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;QAClC,OAAO,EAAE,CAAC,QAAQ,CAAC,EAAE,EAAE,GAAG,EAAE,QAAQ,EAAE,EAAE,CAAA;IAC1C,CAAC;IACD,IAAI,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9B,OAAO,EAAE,CAAC,QAAQ,CAAC,EAAE,EAAE,GAAG,EAAE,YAAY,EAAE,EAAE,CAAA;IAC9C,CAAC;IACD,OAAO,QAAQ,CAAA;AACjB,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,mBAAmB,CAAC,EAClC,OAAO,EACP,OAAO,EACP,eAAe,GAAG,EAAE,EAKrB;IACC,MAAM,aAAa,GAAc,EAAE,CAAA;IACnC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;YAC9B,wDAAwD;YACxD,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;YAC9B,SAAQ;QACV,CAAC;QACD,aAAa,CAAC,IAAI,CAAC;YACjB,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE;gBACZ,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,uBAAuB,CAAC;aACnD;SACF,CAAC,CAAA;IACJ,CAAC;IAED,OAAO;QACL,aAAa,EAAE,KAAK;QACpB,QAAQ,EAAE;YACR,cAAc,EAAE,EAAE,GAAG,EAAE,gBAAgB,EAAE;YACzC,GAAG,CAAC,eAAe,CAAC,MAAM,GAAG,CAAC,IAAI;gBAChC,WAAW,EAAE,EAAE,QAAQ,EAAE,CAAC,GAAG,eAAe,CAAC,EAAE;aAChD,CAAC;YACF,KAAK,EAAE;gBACL,GAAG,EAAE,SAAS;gBACd,QAAQ,EAAE;oBACR,CAAC,OAAO,CAAC,EAAE;wBACT,GAAG,EAAE,SAAS;wBACd,QAAQ,EAAE,aAAa;qBACxB;iBACF;aACF;SACF;KACF,CAAA;AACH,CAAC"}

package/dist/lib/importTar.d.ts

@@ -18,6 +18,18 @@ export interface ImportPlanResource {
     resourceId: string;
     body: Buffer;
 }
+/**
+ * One chunk file of a chunked Resource staged for import (the `chunked-streams`
+ * feature): the raw bytes carried verbatim, keyed by the parent `resourceId`
+ * (decoded from the `.chunks.<encId>/` directory name) and the chunk file's
+ * basename inside that directory (`r.<index>...` bytes or its `.meta.<index>.json`
+ * version sidecar).
+ */
+export interface ImportPlanChunkFile {
+    resourceId: string;
+    fileName: string;
+    body: Buffer;
+}
 /** One collection (plus its resources and policies) staged for import. */
 export interface ImportPlanCollection {
     collectionId: string;
@@ -29,6 +41,8 @@ export interface ImportPlanCollection {
     resourcePolicies: Map<string, PolicyDocument>;
     /** Resource metadata sidecars (raw `.meta.<id>.json` bytes), keyed by resourceId. */
     resourceMetadata: Map<string, Buffer>;
+    /** Chunk files of chunked Resources in this Collection, carried verbatim. */
+    chunkFiles: ImportPlanChunkFile[];
 }
 /** The merge plan produced by {@link buildImportPlan}. */
 export interface ImportPlan {
@@ -69,10 +83,12 @@ export declare function validateManifest(entries: Map<string, TarEntry>): void;
  * - space/<sourceSpaceId>/<collectionId>/.policy.<collectionId>.json (collection policy)
  * - space/<sourceSpaceId>/<collectionId>/.policy.<resourceId>.json (resource policy)
  * - space/<sourceSpaceId>/<collectionId>/r.<resourceId>.<encodedContentType>.<ext>
+ * - space/<sourceSpaceId>/<collectionId>/.chunks.<encodedResourceId>/<chunkFile>
+ *   (a chunked Resource's chunk files; the `chunked-streams` feature)
  *
  * The source space id in the path may differ from the import target; collection
- * metadata, r.* resource files, and `.policy.*` policy files are merged into the
- * destination.
+ * metadata, r.* resource files, `.chunks.*` chunk files, and `.policy.*` policy
+ * files are merged into the destination.
  *
  * @param entries {Map<string, TarEntry>}
  * @returns {ImportPlan}