@aglyn/aglyn 1.0.0-beta.220 → 1.0.0-beta.222

package/src/lib/data-transfer/package-plan.js

@@ -0,0 +1,475 @@
+import { _ as _extends } from "@swc/helpers/_/_extends";
+/**
+ * @license
+ * Copyright 2026 Aglyn LLC
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */ /*==========================================
+ * A WORKSPACE PACKAGE'S PLAN (AGL-3535) — what importing one would do,
+ * decided before anything is written.
+ *
+ * A workspace package is an `aglyn-package` v2 file whose items belong to
+ * the workspace rather than a site: sequences, campaigns, automations,
+ * email templates. Each item's `kind` is the key of the transfer resource
+ * that owns it (`outreach.sequences`), so the job engine knows which
+ * plugin reads, writes and undoes it, and an item of a kind no enabled
+ * plugin owns is set aside rather than guessed at.
+ *
+ * ## Matching and deciding
+ *
+ * Every item is matched against what the workspace holds — by id, then
+ * slug, then name, within its kind (`matchPackageItems`) — and proposed a
+ * decision (`proposePackageDecision`): a new item is created, an identical
+ * one skipped, and one that differs waits for the person — replace, keep
+ * both, or skip. Replacing is never assumed.
+ *
+ * ## The ids every item ends up with
+ *
+ * Before anything is written, each item that will be written is given the
+ * id it will have: its own for a new item, the matched item's for a
+ * replace, a fresh one (and a `-copy` slug and a "(copy)" name) for keep
+ * both. A skipped item that matched points at the workspace's item. So
+ * every reference between items can be rewritten up front (`idMap`), in
+ * any order, and a pair of items that name each other is no harder than
+ * one that names the other.
+ *
+ * ## References the package cannot satisfy
+ *
+ * An item may name something the package does not carry and the
+ * workspace does not hold: a template from another workspace, a mailbox
+ * that was never connected here, a site. Each such reference is listed
+ * once, with what may be done about it — import the package's own copy
+ * (when the package holds it and it was skipped), map it to something the
+ * workspace has, drop the reference, or skip every item that needs it —
+ * and nothing is applied until each has an answer.
+ *
+ * Pure: the engine reads the workspace, the plugins say what each item
+ * names, and this decides.
+ *=========================================*/ import { keepBothSlug, matchPackageItems, packageDecisionsFor, packageDependencyOrder, packageItemKey, proposePackageDecision, contentHash } from "./package.js";
+/** The kind a reference to one of the workspace's sites carries. Answered by the engine, not a plugin. */ export const TRANSFER_SITE_KIND = 'site';
+/** The resource a workspace package's job is filed under: one package import runs at a time. */ export const TRANSFER_PACKAGE_RESOURCE = 'package';
+/** The most items one workspace package may carry. */ export const TRANSFER_PACKAGE_MAX_ITEMS = 1000;
+/** The most bytes one workspace package file may carry. */ export const TRANSFER_PACKAGE_MAX_BYTES = 3000000;
+export const TRANSFER_PACKAGE_VERDICTS = [
+    'create',
+    'replace',
+    'keepBoth',
+    'skip',
+    'fail'
+];
+export const TRANSFER_PACKAGE_WARNING_CLASSES = [
+    'replace',
+    'dropReference',
+    'failed'
+];
+function caseless(value) {
+    return String(value != null ? value : '').trim().toLowerCase();
+}
+/**
+ * The name a kept-both copy takes: `<name> (copy)`, then `(copy 2)`,
+ * `(copy 3)`… until none of `taken` (compared caselessly).
+ */ export function keepBothName(name, taken) {
+    const used = new Set([
+        ...taken
+    ].map(caseless));
+    const base = `${name.replace(/\s*\(copy(?: \d+)?\)$/, '').trim()} (copy)`;
+    if (!used.has(caseless(base))) return base;
+    for(let n = 2;; n += 1){
+        const candidate = base.replace(/\(copy\)$/, `(copy ${n})`);
+        if (!used.has(caseless(candidate))) return candidate;
+    }
+}
+/**
+ * What a resource holds now, as matching reads it: each item's content
+ * hashed with `contentHash`. A resource's `items` hook answers with this
+ * over the same content `readItems` exports, so an item exported and
+ * imported unchanged compares `identical`.
+ */ export async function existingPackageItemsOf(kind, contents) {
+    const items = [];
+    for (const entry of contents){
+        items.push(_extends({
+            kind,
+            id: entry.id
+        }, entry.name ? {
+            name: entry.name
+        } : {}, entry.slug ? {
+            slug: entry.slug
+        } : {}, {
+            contentHash: await contentHash(entry.content)
+        }));
+    }
+    return items;
+}
+function emptySummary() {
+    return {
+        create: 0,
+        replace: 0,
+        keepBoth: 0,
+        skip: 0,
+        fail: 0,
+        total: 0
+    };
+}
+const WRITES = new Set([
+    'create',
+    'replace',
+    'keepBoth',
+    'merge'
+]);
+function choicesFor(inPackage) {
+    return inPackage ? [
+        'import',
+        'mapTo',
+        'dropReference',
+        'skipItem'
+    ] : [
+        'mapTo',
+        'dropReference',
+        'skipItem'
+    ];
+}
+/**
+ * The plan (see the block header). Deterministic for the same input,
+ * `newId` aside: decisions the person did not make are proposed, a
+ * decision an item may not take falls back to the proposal, and a
+ * reference choice that names nothing the workspace holds is no choice.
+ */ export function planTransferPackage(input) {
+    var _existingByKind_get, _input_references, _input_dependencyChoices;
+    const manifestItems = input.manifest.items;
+    const byKey = new Map(manifestItems.map((item)=>[
+            packageItemKey(item),
+            item
+        ]));
+    const known = manifestItems.filter((item)=>input.ownedKinds.has(item.kind));
+    const unknownKinds = [
+        ...new Set(manifestItems.filter((item)=>!input.ownedKinds.has(item.kind)).map((item)=>item.kind))
+    ];
+    const matches = new Map(matchPackageItems({
+        items: known
+    }, input.existing).map((match)=>[
+            packageItemKey(match.item),
+            match
+        ]));
+    const existingByKind = new Map();
+    for (const entry of input.existing)existingByKind.set(entry.kind, [
+        ...(_existingByKind_get = existingByKind.get(entry.kind)) != null ? _existingByKind_get : [],
+        entry
+    ]);
+    const referenceKinds = new Map(((_input_references = input.references) != null ? _input_references : []).map((kind)=>[
+            kind.kind,
+            kind
+        ]));
+    const labelOf = (kind)=>{
+        var _ref, _ref1;
+        var _referenceKinds_get, _input_kindLabels;
+        return (_ref = (_ref1 = (_referenceKinds_get = referenceKinds.get(kind)) == null ? void 0 : _referenceKinds_get.label) != null ? _ref1 : (_input_kindLabels = input.kindLabels) == null ? void 0 : _input_kindLabels[kind]) != null ? _ref : kind;
+    };
+    // The decision each item starts from: the person's, when it is one the item may take.
+    const decided = new Map();
+    const forcedImport = new Set();
+    for (const item of known){
+        var _input_decisions;
+        const key = packageItemKey(item);
+        const match = matches.get(key);
+        if (!match) continue;
+        const allowed = packageDecisionsFor(match);
+        const chosen = (_input_decisions = input.decisions) == null ? void 0 : _input_decisions[key];
+        decided.set(key, chosen && allowed.includes(chosen) ? chosen : proposePackageDecision(match).decision);
+    }
+    for (const [depKey, choice] of Object.entries((_input_dependencyChoices = input.dependencyChoices) != null ? _input_dependencyChoices : {})){
+        if ((choice == null ? void 0 : choice.action) !== 'import') continue;
+        const match = matches.get(depKey);
+        if ((match == null ? void 0 : match.comparison) === 'new' && decided.get(depKey) === 'skip') {
+            decided.set(depKey, 'create');
+            forcedImport.add(depKey);
+        }
+    }
+    // Skipped for want of a reference the person chose to skip them over; grows until it settles.
+    const skippedForDependency = new Set();
+    let references = [];
+    let idMap = {};
+    for(let pass = 0; pass <= known.length + 1; pass += 1){
+        const writes = (key)=>{
+            var _decided_get;
+            return WRITES.has((_decided_get = decided.get(key)) != null ? _decided_get : 'skip') && !skippedForDependency.has(key);
+        };
+        // Ids first: every reference below is resolved against them.
+        idMap = {};
+        for (const item of known){
+            const key = packageItemKey(item);
+            const match = matches.get(key);
+            const decision = decided.get(key);
+            if (!match) continue;
+            if (writes(key)) {
+                var _ref;
+                var _match_existing;
+                if (decision === 'replace' || decision === 'merge') idMap[key] = (_ref = (_match_existing = match.existing) == null ? void 0 : _match_existing.id) != null ? _ref : item.$id;
+                else if (decision === 'create') idMap[key] = item.$id;
+            } else if (match.existing) {
+                idMap[key] = match.existing.id;
+            }
+        }
+        // Kept-both ids are placeholders here; the real ones are minted once, below.
+        for (const item of known){
+            const key = packageItemKey(item);
+            if (writes(key) && decided.get(key) === 'keepBoth') idMap[key] = `\u0000${key}`;
+        }
+        const open = new Map();
+        for (const item of known){
+            const key = packageItemKey(item);
+            if (!writes(key)) continue;
+            for (const dep of item.deps){
+                var _existingByKind_get1, _ref1, _open_get, _existingByKind_get2, _ref2;
+                var _referenceKinds_get, _byKey_get, _byKey_get1, _referenceKinds_get1;
+                const depKey = packageItemKey(dep);
+                if (depKey in idMap) continue;
+                const held = input.ownedKinds.has(dep.kind) ? ((_existingByKind_get1 = existingByKind.get(dep.kind)) != null ? _existingByKind_get1 : []).some((entry)=>entry.id === dep.id) : ((_ref1 = (_referenceKinds_get = referenceKinds.get(dep.kind)) == null ? void 0 : _referenceKinds_get.targets) != null ? _ref1 : []).some((target)=>target.id === dep.id);
+                if (held) continue;
+                const inPackage = byKey.has(depKey) && input.ownedKinds.has(dep.kind);
+                const reference = (_open_get = open.get(depKey)) != null ? _open_get : _extends({
+                    key: depKey,
+                    kind: dep.kind,
+                    id: dep.id,
+                    label: labelOf(dep.kind)
+                }, ((_byKey_get = byKey.get(depKey)) == null ? void 0 : _byKey_get.name) ? {
+                    name: (_byKey_get1 = byKey.get(depKey)) == null ? void 0 : _byKey_get1.name
+                } : {}, {
+                    neededBy: [],
+                    inPackage,
+                    choice: null,
+                    choices: choicesFor(inPackage),
+                    targets: input.ownedKinds.has(dep.kind) ? ((_existingByKind_get2 = existingByKind.get(dep.kind)) != null ? _existingByKind_get2 : []).map((entry)=>_extends({
+                            id: entry.id
+                        }, entry.name ? {
+                            name: entry.name
+                        } : {})) : [
+                        ...(_ref2 = (_referenceKinds_get1 = referenceKinds.get(dep.kind)) == null ? void 0 : _referenceKinds_get1.targets) != null ? _ref2 : []
+                    ]
+                });
+                if (!reference.neededBy.includes(key)) reference.neededBy.push(key);
+                open.set(depKey, reference);
+            }
+        }
+        // A reference the person forced the import of resolves once its item writes; it is listed so the choice shows.
+        for (const depKey of forcedImport){
+            var _existingByKind_get3;
+            const item = byKey.get(depKey);
+            if (!item || open.has(depKey)) continue;
+            const neededBy = known.filter((other)=>writes(packageItemKey(other)) && other.deps.some((dep)=>packageItemKey(dep) === depKey)).map(packageItemKey);
+            open.set(depKey, _extends({
+                key: depKey,
+                kind: item.kind,
+                id: item.$id,
+                label: labelOf(item.kind)
+            }, item.name ? {
+                name: item.name
+            } : {}, {
+                neededBy,
+                inPackage: true,
+                choice: {
+                    action: 'import'
+                },
+                choices: choicesFor(true),
+                targets: ((_existingByKind_get3 = existingByKind.get(item.kind)) != null ? _existingByKind_get3 : []).map((entry)=>_extends({
+                        id: entry.id
+                    }, entry.name ? {
+                        name: entry.name
+                    } : {}))
+            }));
+        }
+        let grew = false;
+        for (const reference of open.values()){
+            var _input_dependencyChoices1;
+            if (reference.choice) continue;
+            const choice = (_input_dependencyChoices1 = input.dependencyChoices) == null ? void 0 : _input_dependencyChoices1[reference.key];
+            if (!choice || !reference.choices.includes(choice.action)) continue;
+            if (choice.action === 'mapTo') {
+                if (!reference.targets.some((target)=>target.id === choice.id)) continue;
+                reference.choice = choice;
+                idMap[reference.key] = choice.id;
+            } else if (choice.action === 'dropReference') {
+                reference.choice = choice;
+                idMap[reference.key] = '';
+            } else if (choice.action === 'skipItem') {
+                reference.choice = choice;
+                for (const key of reference.neededBy){
+                    if (!skippedForDependency.has(key)) {
+                        skippedForDependency.add(key);
+                        grew = true;
+                    }
+                }
+            }
+        }
+        references = [
+            ...open.values()
+        ];
+        if (!grew) break;
+    }
+    // Kept-both copies: a fresh id, a free slug and a free name, in manifest order.
+    const renames = new Map();
+    const takenSlugs = new Map();
+    const takenNames = new Map();
+    for (const [kind, entries] of existingByKind){
+        takenSlugs.set(kind, entries.flatMap((entry)=>entry.slug ? [
+                entry.slug
+            ] : []));
+        takenNames.set(kind, entries.flatMap((entry)=>entry.name ? [
+                entry.name
+            ] : []));
+    }
+    for (const item of known){
+        const key = packageItemKey(item);
+        if (idMap[key] !== `\u0000${key}`) continue;
+        idMap[key] = input.newId();
+        const rename = {};
+        if (item.slug) {
+            var _takenSlugs_get, _takenSlugs_get1;
+            rename.slug = keepBothSlug(item.slug, (_takenSlugs_get = takenSlugs.get(item.kind)) != null ? _takenSlugs_get : []);
+            takenSlugs.set(item.kind, [
+                ...(_takenSlugs_get1 = takenSlugs.get(item.kind)) != null ? _takenSlugs_get1 : [],
+                rename.slug
+            ]);
+        }
+        if (item.name) {
+            var _takenNames_get, _takenNames_get1;
+            rename.name = keepBothName(item.name, (_takenNames_get = takenNames.get(item.kind)) != null ? _takenNames_get : []);
+            takenNames.set(item.kind, [
+                ...(_takenNames_get1 = takenNames.get(item.kind)) != null ? _takenNames_get1 : [],
+                rename.name
+            ]);
+        }
+        renames.set(key, rename);
+    }
+    const items = manifestItems.map((item, row)=>{
+        var _decided_get, _ref;
+        var _input_decisions, _input_problems;
+        const key = packageItemKey(item);
+        const base = _extends({
+            row,
+            key,
+            kind: item.kind,
+            id: item.$id
+        }, item.name ? {
+            name: item.name
+        } : {}, item.slug ? {
+            slug: item.slug
+        } : {});
+        const match = matches.get(key);
+        if (!match) {
+            return _extends({}, base, {
+                status: 'new',
+                comparison: 'new',
+                decision: 'skip',
+                decisions: [
+                    'skip'
+                ],
+                needsChoice: false,
+                verdict: 'skip',
+                reason: 'unknownKind',
+                problems: []
+            });
+        }
+        const decision = (_decided_get = decided.get(key)) != null ? _decided_get : 'skip';
+        const chosen = ((_input_decisions = input.decisions) == null ? void 0 : _input_decisions[key]) !== undefined || forcedImport.has(key);
+        const problems = [
+            ...(_ref = (_input_problems = input.problems) == null ? void 0 : _input_problems[key]) != null ? _ref : []
+        ];
+        const writing = WRITES.has(decision) && !skippedForDependency.has(key);
+        const verdict = !writing ? 'skip' : problems.length ? 'fail' : decision === 'merge' ? 'replace' : decision;
+        const reason = skippedForDependency.has(key) ? 'missingDependency' : verdict === 'fail' ? 'problems' : verdict === 'skip' ? match.comparison === 'identical' && !chosen ? 'identical' : 'chosen' : undefined;
+        return _extends({}, base, {
+            status: match.status,
+            comparison: match.comparison
+        }, match.matchedBy ? {
+            matchedBy: match.matchedBy
+        } : {}, match.existing ? {
+            existing: _extends({
+                id: match.existing.id
+            }, match.existing.name ? {
+                name: match.existing.name
+            } : {}, match.existing.slug ? {
+                slug: match.existing.slug
+            } : {})
+        } : {}, {
+            decision,
+            decisions: packageDecisionsFor(match),
+            needsChoice: match.comparison === 'differs' && !chosen,
+            verdict
+        }, writing ? {
+            targetId: idMap[key]
+        } : {}, renames.has(key) && writing ? {
+            rename: renames.get(key)
+        } : {}, reason ? {
+            reason
+        } : {}, {
+            problems
+        });
+    });
+    const summary = emptySummary();
+    for (const item of items){
+        summary[item.verdict] += 1;
+        summary.total += 1;
+    }
+    const blocking = [];
+    for (const item of items){
+        var _item_name;
+        if (item.needsChoice) blocking.push(`Choose what happens to ${(_item_name = item.name) != null ? _item_name : item.key}: it differs from the one you have.`);
+    }
+    for (const reference of references){
+        if (!reference.choice) {
+            var _reference_name;
+            blocking.push(`Choose what happens to the ${reference.label.toLowerCase()} ${(_reference_name = reference.name) != null ? _reference_name : reference.id}: ${reference.neededBy.length === 1 ? 'an item needs' : `${reference.neededBy.length} items need`} it, and this workspace has none by that id.`);
+        }
+    }
+    const writing = items.filter((item)=>item.verdict !== 'skip' && item.verdict !== 'fail');
+    const order = packageDependencyOrder(writing.map((item)=>byKey.get(item.key))).order.map(packageItemKey);
+    const acknowledgementsRequired = [];
+    if (summary.replace) acknowledgementsRequired.push('replace');
+    if (references.some((reference)=>{
+        var _reference_choice;
+        return ((_reference_choice = reference.choice) == null ? void 0 : _reference_choice.action) === 'dropReference';
+    })) acknowledgementsRequired.push('dropReference');
+    if (summary.fail) acknowledgementsRequired.push('failed');
+    return {
+        items,
+        references,
+        unknownKinds,
+        order,
+        idMap,
+        summary,
+        blocking,
+        acknowledgementsRequired
+    };
+}
+/** The warning classes a plan still needs acknowledged. */ export function missingPackageAcknowledgements(plan, acknowledged) {
+    return plan.acknowledgementsRequired.filter((warning)=>!acknowledged.includes(warning));
+}
+/** Whether a plan may be applied: nothing blocks, every warning is acknowledged, and something writes. */ export function canApplyTransferPackage(plan, acknowledged) {
+    const writes = plan.summary.create + plan.summary.replace + plan.summary.keepBoth;
+    return !plan.blocking.length && writes > 0 && !missingPackageAcknowledgements(plan, acknowledged).length;
+}
+/** The id map as `remapIds` takes it. */ export function packageIdMap(idMap) {
+    return new Map(Object.entries(idMap));
+}
+/**
+ * A reference rewritten through an id map: the id it now has, `null` when
+ * the person dropped it, or itself when nothing maps it (a reference the
+ * workspace already satisfies). The helper every `remapIds` uses.
+ */ export function remapPackageReference(idMap, kind, id) {
+    if (!id) return id != null ? id : null;
+    const mapped = idMap.get(`${kind}/${id}`);
+    if (mapped === undefined) return id;
+    return mapped === '' ? null : mapped;
+}
+
+//# sourceMappingURL=package-plan.js.map

package/src/lib/data-transfer/package-plan.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../../../libs/aglyn/src/lib/data-transfer/package-plan.ts"],"sourcesContent":["/**\n * @license\n * Copyright 2026 Aglyn LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/*==========================================\n * A WORKSPACE PACKAGE'S PLAN (AGL-3535) — what importing one would do,\n * decided before anything is written.\n *\n * A workspace package is an `aglyn-package` v2 file whose items belong to\n * the workspace rather than a site: sequences, campaigns, automations,\n * email templates. Each item's `kind` is the key of the transfer resource\n * that owns it (`outreach.sequences`), so the job engine knows which\n * plugin reads, writes and undoes it, and an item of a kind no enabled\n * plugin owns is set aside rather than guessed at.\n *\n * ## Matching and deciding\n *\n * Every item is matched against what the workspace holds — by id, then\n * slug, then name, within its kind (`matchPackageItems`) — and proposed a\n * decision (`proposePackageDecision`): a new item is created, an identical\n * one skipped, and one that differs waits for the person — replace, keep\n * both, or skip. Replacing is never assumed.\n *\n * ## The ids every item ends up with\n *\n * Before anything is written, each item that will be written is given the\n * id it will have: its own for a new item, the matched item's for a\n * replace, a fresh one (and a `-copy` slug and a \"(copy)\" name) for keep\n * both. A skipped item that matched points at the workspace's item. So\n * every reference between items can be rewritten up front (`idMap`), in\n * any order, and a pair of items that name each other is no harder than\n * one that names the other.\n *\n * ## References the package cannot satisfy\n *\n * An item may name something the package does not carry and the\n * workspace does not hold: a template from another workspace, a mailbox\n * that was never connected here, a site. Each such reference is listed\n * once, with what may be done about it — import the package's own copy\n * (when the package holds it and it was skipped), map it to something the\n * workspace has, drop the reference, or skip every item that needs it —\n * and nothing is applied until each has an answer.\n *\n * Pure: the engine reads the workspace, the plugins say what each item\n * names, and this decides.\n *=========================================*/\n\nimport {\n  keepBothSlug,\n  matchPackageItems,\n  packageDecisionsFor,\n  packageDependencyOrder,\n  packageItemKey,\n  proposePackageDecision,\n  contentHash,\n  type ExistingPackageItem,\n  type PackageItemComparison,\n  type PackageItemDecision,\n  type PackageItemStatus,\n  type PackageManifest,\n  type PackageManifestItem,\n} from './package'\n\n/** The kind a reference to one of the workspace's sites carries. Answered by the engine, not a plugin. */\nexport const TRANSFER_SITE_KIND = 'site'\n\n/** The resource a workspace package's job is filed under: one package import runs at a time. */\nexport const TRANSFER_PACKAGE_RESOURCE = 'package'\n\n/** The most items one workspace package may carry. */\nexport const TRANSFER_PACKAGE_MAX_ITEMS = 1000\n\n/** The most bytes one workspace package file may carry. */\nexport const TRANSFER_PACKAGE_MAX_BYTES = 3_000_000\n\n/** What importing one item comes to. */\nexport type TransferPackageVerdict = 'create' | 'replace' | 'keepBoth' | 'skip' | 'fail'\n\nexport const TRANSFER_PACKAGE_VERDICTS: readonly TransferPackageVerdict[] = [\n  'create',\n  'replace',\n  'keepBoth',\n  'skip',\n  'fail',\n]\n\n/** What to do about a reference the package cannot satisfy. */\nexport type TransferPackageDependencyChoice =\n  /** Import the package's own copy of an item the person had skipped. */\n  | { action: 'import' }\n  /** Point the reference at something the workspace already has. */\n  | { action: 'mapTo'; id: string }\n  /** Leave the reference out of every item that names it. */\n  | { action: 'dropReference' }\n  /** Skip every item that needs it. */\n  | { action: 'skipItem' }\n\nexport type TransferPackageDependencyAction = TransferPackageDependencyChoice['action']\n\n/** One thing a reference may be mapped to. */\nexport interface TransferReferenceTarget {\n  id: string\n  name?: string\n}\n\n/** What the workspace holds of a kind no package resource owns (its sites, its mailboxes, its lists). */\nexport interface TransferReferenceKind {\n  kind: string\n  /** What one of them is called (\"Mailbox\"). */\n  label: string\n  targets: TransferReferenceTarget[]\n}\n\n/** The warnings an import must have acknowledged before it writes. */\nexport type TransferPackageWarningClass = 'replace' | 'dropReference' | 'failed'\n\nexport const TRANSFER_PACKAGE_WARNING_CLASSES: readonly TransferPackageWarningClass[] = [\n  'replace',\n  'dropReference',\n  'failed',\n]\n\n/** Why an item is skipped or fails. */\nexport type TransferPackageItemReason =\n  /** No enabled plugin owns its kind. */\n  | 'unknownKind'\n  /** The person chose to skip it. */\n  | 'chosen'\n  /** It is identical to the workspace's item. */\n  | 'identical'\n  /** A reference it needs was answered with \"skip every item that needs it\". */\n  | 'missingDependency'\n  /** The owning plugin's own checks refuse it (`problems`). */\n  | 'problems'\n\n/** One item's line in the plan. */\nexport interface TransferPackagePlanItem {\n  /** Its index in the manifest — the row the ledger and the results name. */\n  row: number\n  /** `<kind>/<id>`, as the file names it. */\n  key: string\n  kind: string\n  id: string\n  name?: string\n  slug?: string\n  status: PackageItemStatus\n  comparison: PackageItemComparison\n  matchedBy?: 'id' | 'slug' | 'name'\n  existing?: { id: string; name?: string; slug?: string }\n  /** What will be done with it. */\n  decision: PackageItemDecision\n  /** The decisions it may take. */\n  decisions: PackageItemDecision[]\n  /** It differs from the workspace's item and the person has not chosen yet. */\n  needsChoice: boolean\n  verdict: TransferPackageVerdict\n  /** The id it is written under, for a write. */\n  targetId?: string\n  /** A kept-both copy's new name and slug. */\n  rename?: { name?: string; slug?: string }\n  reason?: TransferPackageItemReason\n  /** The owning plugin's objections, each a sentence; any one fails the item. */\n  problems: string[]\n}\n\n/** A reference no item in the package or the workspace satisfies, and what the person chose for it. */\nexport interface TransferPackageReference {\n  /** `<kind>/<id>`. */\n  key: string\n  kind: string\n  id: string\n  /** What one of the kind is called. */\n  label: string\n  /** A name for it, when the package carries it. */\n  name?: string\n  /** The items that name it, by key. */\n  neededBy: string[]\n  /** The package carries it, and the person chose not to import it. */\n  inPackage: boolean\n  choice: TransferPackageDependencyChoice | null\n  /** What may be chosen for it. */\n  choices: TransferPackageDependencyAction[]\n  /** What it may be mapped to. */\n  targets: TransferReferenceTarget[]\n}\n\nexport type TransferPackageSummary = Record<TransferPackageVerdict, number> & { total: number }\n\n/** What importing a package would do. */\nexport interface TransferPackagePlan {\n  items: TransferPackagePlanItem[]\n  /** References needing (or holding) a choice. */\n  references: TransferPackageReference[]\n  /** Kinds in the file no enabled plugin owns; their items are skipped. */\n  unknownKinds: string[]\n  /** The keys of the items that write, dependencies first. */\n  order: string[]\n  /** Item key → the id it has after the import; `''` for a dropped reference. */\n  idMap: Record<string, string>\n  summary: TransferPackageSummary\n  /** What still blocks Apply, each a sentence. */\n  blocking: string[]\n  acknowledgementsRequired: TransferPackageWarningClass[]\n}\n\nexport interface PlanTransferPackageInput {\n  manifest: Pick<PackageManifest, 'items'>\n  /** The kinds a package resource owns here — every other kind is unknown. */\n  ownedKinds: ReadonlySet<string>\n  /** What the workspace holds of every owned kind the package carries or names. */\n  existing: readonly ExistingPackageItem[]\n  /** What the workspace holds of the other kinds the items name. */\n  references?: readonly TransferReferenceKind[]\n  /** What a package kind is called, for a reference to one. */\n  kindLabels?: Readonly<Record<string, string>>\n  /** The person's decision per item key. */\n  decisions?: Readonly<Record<string, PackageItemDecision>>\n  /** The person's choice per reference key. */\n  dependencyChoices?: Readonly<Record<string, TransferPackageDependencyChoice>>\n  /** The objections each item's plugin raised, by item key. */\n  problems?: Readonly<Record<string, readonly string[]>>\n  /** A fresh id for a kept-both copy. Called once per such item, in manifest order. */\n  newId: () => string\n}\n\nfunction caseless(value: string | undefined): string {\n  return String(value ?? '').trim().toLowerCase()\n}\n\n/**\n * The name a kept-both copy takes: `<name> (copy)`, then `(copy 2)`,\n * `(copy 3)`… until none of `taken` (compared caselessly).\n */\nexport function keepBothName(name: string, taken: Iterable<string>): string {\n  const used = new Set([...taken].map(caseless))\n  const base = `${name.replace(/\\s*\\(copy(?: \\d+)?\\)$/, '').trim()} (copy)`\n  if (!used.has(caseless(base))) return base\n  for (let n = 2; ; n += 1) {\n    const candidate = base.replace(/\\(copy\\)$/, `(copy ${n})`)\n    if (!used.has(caseless(candidate))) return candidate\n  }\n}\n\n/**\n * What a resource holds now, as matching reads it: each item's content\n * hashed with `contentHash`. A resource's `items` hook answers with this\n * over the same content `readItems` exports, so an item exported and\n * imported unchanged compares `identical`.\n */\nexport async function existingPackageItemsOf<T>(\n  kind: string,\n  contents: ReadonlyArray<{ id: string; name?: string; slug?: string; content: T }>,\n): Promise<ExistingPackageItem[]> {\n  const items: ExistingPackageItem[] = []\n  for (const entry of contents) {\n    items.push({\n      kind,\n      id: entry.id,\n      ...(entry.name ? { name: entry.name } : {}),\n      ...(entry.slug ? { slug: entry.slug } : {}),\n      contentHash: await contentHash(entry.content),\n    })\n  }\n  return items\n}\n\nfunction emptySummary(): TransferPackageSummary {\n  return { create: 0, replace: 0, keepBoth: 0, skip: 0, fail: 0, total: 0 }\n}\n\nconst WRITES: ReadonlySet<PackageItemDecision> = new Set(['create', 'replace', 'keepBoth', 'merge'])\n\nfunction choicesFor(inPackage: boolean): TransferPackageDependencyAction[] {\n  return inPackage ? ['import', 'mapTo', 'dropReference', 'skipItem'] : ['mapTo', 'dropReference', 'skipItem']\n}\n\n/**\n * The plan (see the block header). Deterministic for the same input,\n * `newId` aside: decisions the person did not make are proposed, a\n * decision an item may not take falls back to the proposal, and a\n * reference choice that names nothing the workspace holds is no choice.\n */\nexport function planTransferPackage(input: PlanTransferPackageInput): TransferPackagePlan {\n  const manifestItems = input.manifest.items\n  const byKey = new Map(manifestItems.map((item) => [packageItemKey(item), item]))\n  const known = manifestItems.filter((item) => input.ownedKinds.has(item.kind))\n  const unknownKinds = [...new Set(manifestItems.filter((item) => !input.ownedKinds.has(item.kind)).map((item) => item.kind))]\n  const matches = new Map(matchPackageItems({ items: known }, input.existing).map((match) => [packageItemKey(match.item), match]))\n  const existingByKind = new Map<string, ExistingPackageItem[]>()\n  for (const entry of input.existing) existingByKind.set(entry.kind, [...(existingByKind.get(entry.kind) ?? []), entry])\n  const referenceKinds = new Map((input.references ?? []).map((kind) => [kind.kind, kind]))\n  const labelOf = (kind: string) => referenceKinds.get(kind)?.label ?? input.kindLabels?.[kind] ?? kind\n\n  // The decision each item starts from: the person's, when it is one the item may take.\n  const decided = new Map<string, PackageItemDecision>()\n  const forcedImport = new Set<string>()\n  for (const item of known) {\n    const key = packageItemKey(item)\n    const match = matches.get(key)\n    if (!match) continue\n    const allowed = packageDecisionsFor(match)\n    const chosen = input.decisions?.[key]\n    decided.set(key, chosen && allowed.includes(chosen) ? chosen : proposePackageDecision(match).decision)\n  }\n  for (const [depKey, choice] of Object.entries(input.dependencyChoices ?? {})) {\n    if (choice?.action !== 'import') continue\n    const match = matches.get(depKey)\n    if (match?.comparison === 'new' && decided.get(depKey) === 'skip') {\n      decided.set(depKey, 'create')\n      forcedImport.add(depKey)\n    }\n  }\n\n  // Skipped for want of a reference the person chose to skip them over; grows until it settles.\n  const skippedForDependency = new Set<string>()\n  let references: TransferPackageReference[] = []\n  let idMap: Record<string, string> = {}\n  for (let pass = 0; pass <= known.length + 1; pass += 1) {\n    const writes = (key: string) => WRITES.has(decided.get(key) ?? 'skip') && !skippedForDependency.has(key)\n    // Ids first: every reference below is resolved against them.\n    idMap = {}\n    for (const item of known) {\n      const key = packageItemKey(item)\n      const match = matches.get(key)\n      const decision = decided.get(key)\n      if (!match) continue\n      if (writes(key)) {\n        if (decision === 'replace' || decision === 'merge') idMap[key] = match.existing?.id ?? item.$id\n        else if (decision === 'create') idMap[key] = item.$id\n      } else if (match.existing) {\n        idMap[key] = match.existing.id\n      }\n    }\n    // Kept-both ids are placeholders here; the real ones are minted once, below.\n    for (const item of known) {\n      const key = packageItemKey(item)\n      if (writes(key) && decided.get(key) === 'keepBoth') idMap[key] = `\\u0000${key}`\n    }\n\n    const open = new Map<string, TransferPackageReference>()\n    for (const item of known) {\n      const key = packageItemKey(item)\n      if (!writes(key)) continue\n      for (const dep of item.deps) {\n        const depKey = packageItemKey(dep)\n        if (depKey in idMap) continue\n        const held = input.ownedKinds.has(dep.kind)\n          ? (existingByKind.get(dep.kind) ?? []).some((entry) => entry.id === dep.id)\n          : (referenceKinds.get(dep.kind)?.targets ?? []).some((target) => target.id === dep.id)\n        if (held) continue\n        const inPackage = byKey.has(depKey) && input.ownedKinds.has(dep.kind)\n        const reference = open.get(depKey) ?? {\n          key: depKey,\n          kind: dep.kind,\n          id: dep.id,\n          label: labelOf(dep.kind),\n          ...(byKey.get(depKey)?.name ? { name: byKey.get(depKey)?.name } : {}),\n          neededBy: [],\n          inPackage,\n          choice: null,\n          choices: choicesFor(inPackage),\n          targets: input.ownedKinds.has(dep.kind)\n            ? (existingByKind.get(dep.kind) ?? []).map((entry) => ({ id: entry.id, ...(entry.name ? { name: entry.name } : {}) }))\n            : [...(referenceKinds.get(dep.kind)?.targets ?? [])],\n        }\n        if (!reference.neededBy.includes(key)) reference.neededBy.push(key)\n        open.set(depKey, reference)\n      }\n    }\n    // A reference the person forced the import of resolves once its item writes; it is listed so the choice shows.\n    for (const depKey of forcedImport) {\n      const item = byKey.get(depKey)\n      if (!item || open.has(depKey)) continue\n      const neededBy = known\n        .filter((other) => writes(packageItemKey(other)) && other.deps.some((dep) => packageItemKey(dep) === depKey))\n        .map(packageItemKey)\n      open.set(depKey, {\n        key: depKey,\n        kind: item.kind,\n        id: item.$id,\n        label: labelOf(item.kind),\n        ...(item.name ? { name: item.name } : {}),\n        neededBy,\n        inPackage: true,\n        choice: { action: 'import' },\n        choices: choicesFor(true),\n        targets: (existingByKind.get(item.kind) ?? []).map((entry) => ({ id: entry.id, ...(entry.name ? { name: entry.name } : {}) })),\n      })\n    }\n\n    let grew = false\n    for (const reference of open.values()) {\n      if (reference.choice) continue\n      const choice = input.dependencyChoices?.[reference.key]\n      if (!choice || !reference.choices.includes(choice.action)) continue\n      if (choice.action === 'mapTo') {\n        if (!reference.targets.some((target) => target.id === choice.id)) continue\n        reference.choice = choice\n        idMap[reference.key] = choice.id\n      } else if (choice.action === 'dropReference') {\n        reference.choice = choice\n        idMap[reference.key] = ''\n      } else if (choice.action === 'skipItem') {\n        reference.choice = choice\n        for (const key of reference.neededBy) {\n          if (!skippedForDependency.has(key)) {\n            skippedForDependency.add(key)\n            grew = true\n          }\n        }\n      }\n    }\n    references = [...open.values()]\n    if (!grew) break\n  }\n\n  // Kept-both copies: a fresh id, a free slug and a free name, in manifest order.\n  const renames = new Map<string, { name?: string; slug?: string }>()\n  const takenSlugs = new Map<string, string[]>()\n  const takenNames = new Map<string, string[]>()\n  for (const [kind, entries] of existingByKind) {\n    takenSlugs.set(kind, entries.flatMap((entry) => (entry.slug ? [entry.slug] : [])))\n    takenNames.set(kind, entries.flatMap((entry) => (entry.name ? [entry.name] : [])))\n  }\n  for (const item of known) {\n    const key = packageItemKey(item)\n    if (idMap[key] !== `\\u0000${key}`) continue\n    idMap[key] = input.newId()\n    const rename: { name?: string; slug?: string } = {}\n    if (item.slug) {\n      rename.slug = keepBothSlug(item.slug, takenSlugs.get(item.kind) ?? [])\n      takenSlugs.set(item.kind, [...(takenSlugs.get(item.kind) ?? []), rename.slug])\n    }\n    if (item.name) {\n      rename.name = keepBothName(item.name, takenNames.get(item.kind) ?? [])\n      takenNames.set(item.kind, [...(takenNames.get(item.kind) ?? []), rename.name])\n    }\n    renames.set(key, rename)\n  }\n\n  const items: TransferPackagePlanItem[] = manifestItems.map((item, row) => {\n    const key = packageItemKey(item)\n    const base = {\n      row,\n      key,\n      kind: item.kind,\n      id: item.$id,\n      ...(item.name ? { name: item.name } : {}),\n      ...(item.slug ? { slug: item.slug } : {}),\n    }\n    const match = matches.get(key)\n    if (!match) {\n      return {\n        ...base,\n        status: 'new' as const,\n        comparison: 'new' as const,\n        decision: 'skip' as const,\n        decisions: ['skip' as const],\n        needsChoice: false,\n        verdict: 'skip' as const,\n        reason: 'unknownKind' as const,\n        problems: [] as string[],\n      }\n    }\n    const decision = decided.get(key) ?? 'skip'\n    const chosen = input.decisions?.[key] !== undefined || forcedImport.has(key)\n    const problems = [...(input.problems?.[key] ?? [])]\n    const writing = WRITES.has(decision) && !skippedForDependency.has(key)\n    const verdict: TransferPackageVerdict = !writing\n      ? 'skip'\n      : problems.length\n        ? 'fail'\n        : decision === 'merge'\n          ? 'replace'\n          : (decision as TransferPackageVerdict)\n    const reason: TransferPackageItemReason | undefined = skippedForDependency.has(key)\n      ? 'missingDependency'\n      : verdict === 'fail'\n        ? 'problems'\n        : verdict === 'skip'\n          ? match.comparison === 'identical' && !chosen\n            ? 'identical'\n            : 'chosen'\n          : undefined\n    return {\n      ...base,\n      status: match.status,\n      comparison: match.comparison,\n      ...(match.matchedBy ? { matchedBy: match.matchedBy } : {}),\n      ...(match.existing\n        ? {\n            existing: {\n              id: match.existing.id,\n              ...(match.existing.name ? { name: match.existing.name } : {}),\n              ...(match.existing.slug ? { slug: match.existing.slug } : {}),\n            },\n          }\n        : {}),\n      decision,\n      decisions: packageDecisionsFor(match),\n      needsChoice: match.comparison === 'differs' && !chosen,\n      verdict,\n      ...(writing ? { targetId: idMap[key] } : {}),\n      ...(renames.has(key) && writing ? { rename: renames.get(key) } : {}),\n      ...(reason ? { reason } : {}),\n      problems,\n    }\n  })\n\n  const summary = emptySummary()\n  for (const item of items) {\n    summary[item.verdict] += 1\n    summary.total += 1\n  }\n  const blocking: string[] = []\n  for (const item of items) {\n    if (item.needsChoice) blocking.push(`Choose what happens to ${item.name ?? item.key}: it differs from the one you have.`)\n  }\n  for (const reference of references) {\n    if (!reference.choice) {\n      blocking.push(`Choose what happens to the ${reference.label.toLowerCase()} ${reference.name ?? reference.id}: ${reference.neededBy.length === 1 ? 'an item needs' : `${reference.neededBy.length} items need`} it, and this workspace has none by that id.`)\n    }\n  }\n  const writing = items.filter((item) => item.verdict !== 'skip' && item.verdict !== 'fail')\n  const order = packageDependencyOrder(\n    writing.map((item) => byKey.get(item.key) as PackageManifestItem),\n  ).order.map(packageItemKey)\n  const acknowledgementsRequired: TransferPackageWarningClass[] = []\n  if (summary.replace) acknowledgementsRequired.push('replace')\n  if (references.some((reference) => reference.choice?.action === 'dropReference')) acknowledgementsRequired.push('dropReference')\n  if (summary.fail) acknowledgementsRequired.push('failed')\n  return { items, references, unknownKinds, order, idMap, summary, blocking, acknowledgementsRequired }\n}\n\n/** The warning classes a plan still needs acknowledged. */\nexport function missingPackageAcknowledgements(\n  plan: Pick<TransferPackagePlan, 'acknowledgementsRequired'>,\n  acknowledged: readonly string[],\n): TransferPackageWarningClass[] {\n  return plan.acknowledgementsRequired.filter((warning) => !acknowledged.includes(warning))\n}\n\n/** Whether a plan may be applied: nothing blocks, every warning is acknowledged, and something writes. */\nexport function canApplyTransferPackage(\n  plan: Pick<TransferPackagePlan, 'acknowledgementsRequired' | 'blocking' | 'summary'>,\n  acknowledged: readonly string[],\n): boolean {\n  const writes = plan.summary.create + plan.summary.replace + plan.summary.keepBoth\n  return !plan.blocking.length && writes > 0 && !missingPackageAcknowledgements(plan, acknowledged).length\n}\n\n/** The id map as `remapIds` takes it. */\nexport function packageIdMap(idMap: Readonly<Record<string, string>>): ReadonlyMap<string, string> {\n  return new Map(Object.entries(idMap))\n}\n\n/**\n * A reference rewritten through an id map: the id it now has, `null` when\n * the person dropped it, or itself when nothing maps it (a reference the\n * workspace already satisfies). The helper every `remapIds` uses.\n */\nexport function remapPackageReference(\n  idMap: ReadonlyMap<string, string>,\n  kind: string,\n  id: string | null | undefined,\n): string | null {\n  if (!id) return id ?? null\n  const mapped = idMap.get(`${kind}/${id}`)\n  if (mapped === undefined) return id\n  return mapped === '' ? null : mapped\n}\n"],"names":["keepBothSlug","matchPackageItems","packageDecisionsFor","packageDependencyOrder","packageItemKey","proposePackageDecision","contentHash","TRANSFER_SITE_KIND","TRANSFER_PACKAGE_RESOURCE","TRANSFER_PACKAGE_MAX_ITEMS","TRANSFER_PACKAGE_MAX_BYTES","TRANSFER_PACKAGE_VERDICTS","TRANSFER_PACKAGE_WARNING_CLASSES","caseless","value","String","trim","toLowerCase","keepBothName","name","taken","used","Set","map","base","replace","has","n","candidate","existingPackageItemsOf","kind","contents","items","entry","push","id","slug","content","emptySummary","create","keepBoth","skip","fail","total","WRITES","choicesFor","inPackage","planTransferPackage","input","existingByKind","manifestItems","manifest","byKey","Map","item","known","filter","ownedKinds","unknownKinds","matches","existing","match","set","get","referenceKinds","references","labelOf","label","kindLabels","decided","forcedImport","key","allowed","chosen","decisions","includes","decision","depKey","choice","Object","entries","dependencyChoices","action","comparison","add","skippedForDependency","idMap","pass","length","writes","$id","open","dep","deps","held","some","targets","target","reference","neededBy","choices","other","grew","values","renames","takenSlugs","takenNames","flatMap","newId","rename","row","status","needsChoice","verdict","reason","problems","undefined","writing","matchedBy","targetId","summary","blocking","order","acknowledgementsRequired","missingPackageAcknowledgements","plan","acknowledged","warning","canApplyTransferPackage","packageIdMap","remapPackageReference","mapped"],"mappings":";AAAA;;;;;;;;;;;;;;;CAeC,GAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;2CAyC2C,GAE3C,SACEA,YAAY,EACZC,iBAAiB,EACjBC,mBAAmB,EACnBC,sBAAsB,EACtBC,cAAc,EACdC,sBAAsB,EACtBC,WAAW,QAON,eAAW;AAElB,wGAAwG,GACxG,OAAO,MAAMC,qBAAqB,OAAM;AAExC,8FAA8F,GAC9F,OAAO,MAAMC,4BAA4B,UAAS;AAElD,oDAAoD,GACpD,OAAO,MAAMC,6BAA6B,KAAI;AAE9C,yDAAyD,GACzD,OAAO,MAAMC,6BAA6B,QAAS;AAKnD,OAAO,MAAMC,4BAA+D;IAC1E;IACA;IACA;IACA;IACA;CACD,CAAA;AAgCD,OAAO,MAAMC,mCAA2E;IACtF;IACA;IACA;CACD,CAAA;AAyGD,SAASC,SAASC,KAAyB;IACzC,OAAOC,OAAOD,gBAAAA,QAAS,IAAIE,IAAI,GAAGC,WAAW;AAC/C;AAEA;;;CAGC,GACD,OAAO,SAASC,aAAaC,IAAY,EAAEC,KAAuB;IAChE,MAAMC,OAAO,IAAIC,IAAI;WAAIF;KAAM,CAACG,GAAG,CAACV;IACpC,MAAMW,OAAO,GAAGL,KAAKM,OAAO,CAAC,yBAAyB,IAAIT,IAAI,GAAG,OAAO,CAAC;IACzE,IAAI,CAACK,KAAKK,GAAG,CAACb,SAASW,QAAQ,OAAOA;IACtC,IAAK,IAAIG,IAAI,IAAKA,KAAK,EAAG;QACxB,MAAMC,YAAYJ,KAAKC,OAAO,CAAC,aAAa,CAAC,MAAM,EAAEE,EAAE,CAAC,CAAC;QACzD,IAAI,CAACN,KAAKK,GAAG,CAACb,SAASe,aAAa,OAAOA;IAC7C;AACF;AAEA;;;;;CAKC,GACD,OAAO,eAAeC,uBACpBC,IAAY,EACZC,QAAiF;IAEjF,MAAMC,QAA+B,EAAE;IACvC,KAAK,MAAMC,SAASF,SAAU;QAC5BC,MAAME,IAAI,CAAC;YACTJ;YACAK,IAAIF,MAAME,EAAE;WACRF,MAAMd,IAAI,GAAG;YAAEA,MAAMc,MAAMd,IAAI;QAAC,IAAI,CAAC,GACrCc,MAAMG,IAAI,GAAG;YAAEA,MAAMH,MAAMG,IAAI;QAAC,IAAI,CAAC;YACzC9B,aAAa,MAAMA,YAAY2B,MAAMI,OAAO;;IAEhD;IACA,OAAOL;AACT;AAEA,SAASM;IACP,OAAO;QAAEC,QAAQ;QAAGd,SAAS;QAAGe,UAAU;QAAGC,MAAM;QAAGC,MAAM;QAAGC,OAAO;IAAE;AAC1E;AAEA,MAAMC,SAA2C,IAAItB,IAAI;IAAC;IAAU;IAAW;IAAY;CAAQ;AAEnG,SAASuB,WAAWC,SAAkB;IACpC,OAAOA,YAAY;QAAC;QAAU;QAAS;QAAiB;KAAW,GAAG;QAAC;QAAS;QAAiB;KAAW;AAC9G;AAEA;;;;;CAKC,GACD,OAAO,SAASC,oBAAoBC,KAA+B;QAOOC,qBACxCD,mBAccA;IArB9C,MAAME,gBAAgBF,MAAMG,QAAQ,CAACnB,KAAK;IAC1C,MAAMoB,QAAQ,IAAIC,IAAIH,cAAc3B,GAAG,CAAC,CAAC+B,OAAS;YAAClD,eAAekD;YAAOA;SAAK;IAC9E,MAAMC,QAAQL,cAAcM,MAAM,CAAC,CAACF,OAASN,MAAMS,UAAU,CAAC/B,GAAG,CAAC4B,KAAKxB,IAAI;IAC3E,MAAM4B,eAAe;WAAI,IAAIpC,IAAI4B,cAAcM,MAAM,CAAC,CAACF,OAAS,CAACN,MAAMS,UAAU,CAAC/B,GAAG,CAAC4B,KAAKxB,IAAI,GAAGP,GAAG,CAAC,CAAC+B,OAASA,KAAKxB,IAAI;KAAG;IAC5H,MAAM6B,UAAU,IAAIN,IAAIpD,kBAAkB;QAAE+B,OAAOuB;IAAM,GAAGP,MAAMY,QAAQ,EAAErC,GAAG,CAAC,CAACsC,QAAU;YAACzD,eAAeyD,MAAMP,IAAI;YAAGO;SAAM;IAC9H,MAAMZ,iBAAiB,IAAII;IAC3B,KAAK,MAAMpB,SAASe,MAAMY,QAAQ,CAAEX,eAAea,GAAG,CAAC7B,MAAMH,IAAI,EAAE;YAAKmB,sBAAAA,eAAec,GAAG,CAAC9B,MAAMH,IAAI,aAA7BmB,sBAAkC,EAAE;QAAGhB;KAAM;IACrH,MAAM+B,iBAAiB,IAAIX,IAAI,EAACL,oBAAAA,MAAMiB,UAAU,YAAhBjB,oBAAoB,EAAE,EAAEzB,GAAG,CAAC,CAACO,OAAS;YAACA,KAAKA,IAAI;YAAEA;SAAK;IACvF,MAAMoC,UAAU,CAACpC;YAAiBkC;YAAAA,qBAAmChB;gBAAnCgB,iBAAAA,sBAAAA,eAAeD,GAAG,CAACjC,0BAAnBkC,oBAA0BG,KAAK,qBAAInB,oBAAAA,MAAMoB,UAAU,qBAAhBpB,iBAAkB,CAAClB,KAAK,YAA3DkC,OAA+DlC;;IAEjG,sFAAsF;IACtF,MAAMuC,UAAU,IAAIhB;IACpB,MAAMiB,eAAe,IAAIhD;IACzB,KAAK,MAAMgC,QAAQC,MAAO;YAKTP;QAJf,MAAMuB,MAAMnE,eAAekD;QAC3B,MAAMO,QAAQF,QAAQI,GAAG,CAACQ;QAC1B,IAAI,CAACV,OAAO;QACZ,MAAMW,UAAUtE,oBAAoB2D;QACpC,MAAMY,UAASzB,mBAAAA,MAAM0B,SAAS,qBAAf1B,gBAAiB,CAACuB,IAAI;QACrCF,QAAQP,GAAG,CAACS,KAAKE,UAAUD,QAAQG,QAAQ,CAACF,UAAUA,SAASpE,uBAAuBwD,OAAOe,QAAQ;IACvG;IACA,KAAK,MAAM,CAACC,QAAQC,OAAO,IAAIC,OAAOC,OAAO,EAAChC,2BAAAA,MAAMiC,iBAAiB,YAAvBjC,2BAA2B,CAAC,GAAI;QAC5E,IAAI8B,CAAAA,0BAAAA,OAAQI,MAAM,MAAK,UAAU;QACjC,MAAMrB,QAAQF,QAAQI,GAAG,CAACc;QAC1B,IAAIhB,CAAAA,yBAAAA,MAAOsB,UAAU,MAAK,SAASd,QAAQN,GAAG,CAACc,YAAY,QAAQ;YACjER,QAAQP,GAAG,CAACe,QAAQ;YACpBP,aAAac,GAAG,CAACP;QACnB;IACF;IAEA,8FAA8F;IAC9F,MAAMQ,uBAAuB,IAAI/D;IACjC,IAAI2C,aAAyC,EAAE;IAC/C,IAAIqB,QAAgC,CAAC;IACrC,IAAK,IAAIC,OAAO,GAAGA,QAAQhC,MAAMiC,MAAM,GAAG,GAAGD,QAAQ,EAAG;QACtD,MAAME,SAAS,CAAClB;gBAA2BF;mBAAXzB,OAAOlB,GAAG,EAAC2C,eAAAA,QAAQN,GAAG,CAACQ,gBAAZF,eAAoB,WAAW,CAACgB,qBAAqB3D,GAAG,CAAC6C;;QACpG,6DAA6D;QAC7De,QAAQ,CAAC;QACT,KAAK,MAAMhC,QAAQC,MAAO;YACxB,MAAMgB,MAAMnE,eAAekD;YAC3B,MAAMO,QAAQF,QAAQI,GAAG,CAACQ;YAC1B,MAAMK,WAAWP,QAAQN,GAAG,CAACQ;YAC7B,IAAI,CAACV,OAAO;YACZ,IAAI4B,OAAOlB,MAAM;;oBACkDV;gBAAjE,IAAIe,aAAa,aAAaA,aAAa,SAASU,KAAK,CAACf,IAAI,YAAGV,kBAAAA,MAAMD,QAAQ,qBAAdC,gBAAgB1B,EAAE,mBAAImB,KAAKoC,GAAG;qBAC1F,IAAId,aAAa,UAAUU,KAAK,CAACf,IAAI,GAAGjB,KAAKoC,GAAG;YACvD,OAAO,IAAI7B,MAAMD,QAAQ,EAAE;gBACzB0B,KAAK,CAACf,IAAI,GAAGV,MAAMD,QAAQ,CAACzB,EAAE;YAChC;QACF;QACA,6EAA6E;QAC7E,KAAK,MAAMmB,QAAQC,MAAO;YACxB,MAAMgB,MAAMnE,eAAekD;YAC3B,IAAImC,OAAOlB,QAAQF,QAAQN,GAAG,CAACQ,SAAS,YAAYe,KAAK,CAACf,IAAI,GAAG,CAAC,MAAM,EAAEA,KAAK;QACjF;QAEA,MAAMoB,OAAO,IAAItC;QACjB,KAAK,MAAMC,QAAQC,MAAO;YACxB,MAAMgB,MAAMnE,eAAekD;YAC3B,IAAI,CAACmC,OAAOlB,MAAM;YAClB,KAAK,MAAMqB,OAAOtC,KAAKuC,IAAI,CAAE;oBAItB5C,6BAIa0C,WAWX1C;oBAdFe,qBAQCZ,YAAkCA,aAO7BY;gBAnBX,MAAMa,SAASzE,eAAewF;gBAC9B,IAAIf,UAAUS,OAAO;gBACrB,MAAMQ,OAAO9C,MAAMS,UAAU,CAAC/B,GAAG,CAACkE,IAAI9D,IAAI,IACtC,EAACmB,uBAAAA,eAAec,GAAG,CAAC6B,IAAI9D,IAAI,aAA3BmB,uBAAgC,EAAE,EAAE8C,IAAI,CAAC,CAAC9D,QAAUA,MAAME,EAAE,KAAKyD,IAAIzD,EAAE,IACxE,WAAC6B,sBAAAA,eAAeD,GAAG,CAAC6B,IAAI9D,IAAI,sBAA3BkC,oBAA8BgC,OAAO,oBAAI,EAAE,EAAED,IAAI,CAAC,CAACE,SAAWA,OAAO9D,EAAE,KAAKyD,IAAIzD,EAAE;gBACvF,IAAI2D,MAAM;gBACV,MAAMhD,YAAYM,MAAM1B,GAAG,CAACmD,WAAW7B,MAAMS,UAAU,CAAC/B,GAAG,CAACkE,IAAI9D,IAAI;gBACpE,MAAMoE,aAAYP,YAAAA,KAAK5B,GAAG,CAACc,mBAATc,YAAoB;oBACpCpB,KAAKM;oBACL/C,MAAM8D,IAAI9D,IAAI;oBACdK,IAAIyD,IAAIzD,EAAE;oBACVgC,OAAOD,QAAQ0B,IAAI9D,IAAI;mBACnBsB,EAAAA,aAAAA,MAAMW,GAAG,CAACc,4BAAVzB,WAAmBjC,IAAI,IAAG;oBAAEA,IAAI,GAAEiC,cAAAA,MAAMW,GAAG,CAACc,4BAAVzB,YAAmBjC,IAAI;gBAAC,IAAI,CAAC;oBACnEgF,UAAU,EAAE;oBACZrD;oBACAgC,QAAQ;oBACRsB,SAASvD,WAAWC;oBACpBkD,SAAShD,MAAMS,UAAU,CAAC/B,GAAG,CAACkE,IAAI9D,IAAI,IAClC,EAACmB,uBAAAA,eAAec,GAAG,CAAC6B,IAAI9D,IAAI,aAA3BmB,uBAAgC,EAAE,EAAE1B,GAAG,CAAC,CAACU,QAAW;4BAAEE,IAAIF,MAAME,EAAE;2BAAMF,MAAMd,IAAI,GAAG;4BAAEA,MAAMc,MAAMd,IAAI;wBAAC,IAAI,CAAC,MAC9G;qCAAK6C,uBAAAA,eAAeD,GAAG,CAAC6B,IAAI9D,IAAI,sBAA3BkC,qBAA8BgC,OAAO,oBAAI,EAAE;qBAAE;;gBAExD,IAAI,CAACE,UAAUC,QAAQ,CAACxB,QAAQ,CAACJ,MAAM2B,UAAUC,QAAQ,CAACjE,IAAI,CAACqC;gBAC/DoB,KAAK7B,GAAG,CAACe,QAAQqB;YACnB;QACF;QACA,+GAA+G;QAC/G,KAAK,MAAMrB,UAAUP,aAAc;gBAgBrBrB;YAfZ,MAAMK,OAAOF,MAAMW,GAAG,CAACc;YACvB,IAAI,CAACvB,QAAQqC,KAAKjE,GAAG,CAACmD,SAAS;YAC/B,MAAMsB,WAAW5C,MACdC,MAAM,CAAC,CAAC6C,QAAUZ,OAAOrF,eAAeiG,WAAWA,MAAMR,IAAI,CAACE,IAAI,CAAC,CAACH,MAAQxF,eAAewF,SAASf,SACpGtD,GAAG,CAACnB;YACPuF,KAAK7B,GAAG,CAACe,QAAQ;gBACfN,KAAKM;gBACL/C,MAAMwB,KAAKxB,IAAI;gBACfK,IAAImB,KAAKoC,GAAG;gBACZvB,OAAOD,QAAQZ,KAAKxB,IAAI;eACpBwB,KAAKnC,IAAI,GAAG;gBAAEA,MAAMmC,KAAKnC,IAAI;YAAC,IAAI,CAAC;gBACvCgF;gBACArD,WAAW;gBACXgC,QAAQ;oBAAEI,QAAQ;gBAAS;gBAC3BkB,SAASvD,WAAW;gBACpBmD,SAAS,EAAC/C,uBAAAA,eAAec,GAAG,CAACT,KAAKxB,IAAI,aAA5BmB,uBAAiC,EAAE,EAAE1B,GAAG,CAAC,CAACU,QAAW;wBAAEE,IAAIF,MAAME,EAAE;uBAAMF,MAAMd,IAAI,GAAG;wBAAEA,MAAMc,MAAMd,IAAI;oBAAC,IAAI,CAAC;;QAE5H;QAEA,IAAImF,OAAO;QACX,KAAK,MAAMJ,aAAaP,KAAKY,MAAM,GAAI;gBAEtBvD;YADf,IAAIkD,UAAUpB,MAAM,EAAE;YACtB,MAAMA,UAAS9B,4BAAAA,MAAMiC,iBAAiB,qBAAvBjC,yBAAyB,CAACkD,UAAU3B,GAAG,CAAC;YACvD,IAAI,CAACO,UAAU,CAACoB,UAAUE,OAAO,CAACzB,QAAQ,CAACG,OAAOI,MAAM,GAAG;YAC3D,IAAIJ,OAAOI,MAAM,KAAK,SAAS;gBAC7B,IAAI,CAACgB,UAAUF,OAAO,CAACD,IAAI,CAAC,CAACE,SAAWA,OAAO9D,EAAE,KAAK2C,OAAO3C,EAAE,GAAG;gBAClE+D,UAAUpB,MAAM,GAAGA;gBACnBQ,KAAK,CAACY,UAAU3B,GAAG,CAAC,GAAGO,OAAO3C,EAAE;YAClC,OAAO,IAAI2C,OAAOI,MAAM,KAAK,iBAAiB;gBAC5CgB,UAAUpB,MAAM,GAAGA;gBACnBQ,KAAK,CAACY,UAAU3B,GAAG,CAAC,GAAG;YACzB,OAAO,IAAIO,OAAOI,MAAM,KAAK,YAAY;gBACvCgB,UAAUpB,MAAM,GAAGA;gBACnB,KAAK,MAAMP,OAAO2B,UAAUC,QAAQ,CAAE;oBACpC,IAAI,CAACd,qBAAqB3D,GAAG,CAAC6C,MAAM;wBAClCc,qBAAqBD,GAAG,CAACb;wBACzB+B,OAAO;oBACT;gBACF;YACF;QACF;QACArC,aAAa;eAAI0B,KAAKY,MAAM;SAAG;QAC/B,IAAI,CAACD,MAAM;IACb;IAEA,gFAAgF;IAChF,MAAME,UAAU,IAAInD;IACpB,MAAMoD,aAAa,IAAIpD;IACvB,MAAMqD,aAAa,IAAIrD;IACvB,KAAK,MAAM,CAACvB,MAAMkD,QAAQ,IAAI/B,eAAgB;QAC5CwD,WAAW3C,GAAG,CAAChC,MAAMkD,QAAQ2B,OAAO,CAAC,CAAC1E,QAAWA,MAAMG,IAAI,GAAG;gBAACH,MAAMG,IAAI;aAAC,GAAG,EAAE;QAC/EsE,WAAW5C,GAAG,CAAChC,MAAMkD,QAAQ2B,OAAO,CAAC,CAAC1E,QAAWA,MAAMd,IAAI,GAAG;gBAACc,MAAMd,IAAI;aAAC,GAAG,EAAE;IACjF;IACA,KAAK,MAAMmC,QAAQC,MAAO;QACxB,MAAMgB,MAAMnE,eAAekD;QAC3B,IAAIgC,KAAK,CAACf,IAAI,KAAK,CAAC,MAAM,EAAEA,KAAK,EAAE;QACnCe,KAAK,CAACf,IAAI,GAAGvB,MAAM4D,KAAK;QACxB,MAAMC,SAA2C,CAAC;QAClD,IAAIvD,KAAKlB,IAAI,EAAE;gBACyBqE,iBACPA;YAD/BI,OAAOzE,IAAI,GAAGpC,aAAasD,KAAKlB,IAAI,GAAEqE,kBAAAA,WAAW1C,GAAG,CAACT,KAAKxB,IAAI,aAAxB2E,kBAA6B,EAAE;YACrEA,WAAW3C,GAAG,CAACR,KAAKxB,IAAI,EAAE;oBAAK2E,mBAAAA,WAAW1C,GAAG,CAACT,KAAKxB,IAAI,aAAxB2E,mBAA6B,EAAE;gBAAGI,OAAOzE,IAAI;aAAC;QAC/E;QACA,IAAIkB,KAAKnC,IAAI,EAAE;gBACyBuF,iBACPA;YAD/BG,OAAO1F,IAAI,GAAGD,aAAaoC,KAAKnC,IAAI,GAAEuF,kBAAAA,WAAW3C,GAAG,CAACT,KAAKxB,IAAI,aAAxB4E,kBAA6B,EAAE;YACrEA,WAAW5C,GAAG,CAACR,KAAKxB,IAAI,EAAE;oBAAK4E,mBAAAA,WAAW3C,GAAG,CAACT,KAAKxB,IAAI,aAAxB4E,mBAA6B,EAAE;gBAAGG,OAAO1F,IAAI;aAAC;QAC/E;QACAqF,QAAQ1C,GAAG,CAACS,KAAKsC;IACnB;IAEA,MAAM7E,QAAmCkB,cAAc3B,GAAG,CAAC,CAAC+B,MAAMwD;YAwB/CzC;YACFrB,kBACOA;QAzBtB,MAAMuB,MAAMnE,eAAekD;QAC3B,MAAM9B,OAAO;YACXsF;YACAvC;YACAzC,MAAMwB,KAAKxB,IAAI;YACfK,IAAImB,KAAKoC,GAAG;WACRpC,KAAKnC,IAAI,GAAG;YAAEA,MAAMmC,KAAKnC,IAAI;QAAC,IAAI,CAAC,GACnCmC,KAAKlB,IAAI,GAAG;YAAEA,MAAMkB,KAAKlB,IAAI;QAAC,IAAI,CAAC;QAEzC,MAAMyB,QAAQF,QAAQI,GAAG,CAACQ;QAC1B,IAAI,CAACV,OAAO;YACV,OAAO,aACFrC;gBACHuF,QAAQ;gBACR5B,YAAY;gBACZP,UAAU;gBACVF,WAAW;oBAAC;iBAAgB;gBAC5BsC,aAAa;gBACbC,SAAS;gBACTC,QAAQ;gBACRC,UAAU,EAAE;;QAEhB;QACA,MAAMvC,YAAWP,eAAAA,QAAQN,GAAG,CAACQ,gBAAZF,eAAoB;QACrC,MAAMI,SAASzB,EAAAA,mBAAAA,MAAM0B,SAAS,qBAAf1B,gBAAiB,CAACuB,IAAI,MAAK6C,aAAa9C,aAAa5C,GAAG,CAAC6C;QACxE,MAAM4C,WAAW;wBAAKnE,kBAAAA,MAAMmE,QAAQ,qBAAdnE,eAAgB,CAACuB,IAAI,mBAAI,EAAE;SAAE;QACnD,MAAM8C,UAAUzE,OAAOlB,GAAG,CAACkD,aAAa,CAACS,qBAAqB3D,GAAG,CAAC6C;QAClE,MAAM0C,UAAkC,CAACI,UACrC,SACAF,SAAS3B,MAAM,GACb,SACAZ,aAAa,UACX,YACCA;QACT,MAAMsC,SAAgD7B,qBAAqB3D,GAAG,CAAC6C,OAC3E,sBACA0C,YAAY,SACV,aACAA,YAAY,SACVpD,MAAMsB,UAAU,KAAK,eAAe,CAACV,SACnC,cACA,WACF2C;QACR,OAAO,aACF5F;YACHuF,QAAQlD,MAAMkD,MAAM;YACpB5B,YAAYtB,MAAMsB,UAAU;WACxBtB,MAAMyD,SAAS,GAAG;YAAEA,WAAWzD,MAAMyD,SAAS;QAAC,IAAI,CAAC,GACpDzD,MAAMD,QAAQ,GACd;YACEA,UAAU;gBACRzB,IAAI0B,MAAMD,QAAQ,CAACzB,EAAE;eACjB0B,MAAMD,QAAQ,CAACzC,IAAI,GAAG;gBAAEA,MAAM0C,MAAMD,QAAQ,CAACzC,IAAI;YAAC,IAAI,CAAC,GACvD0C,MAAMD,QAAQ,CAACxB,IAAI,GAAG;gBAAEA,MAAMyB,MAAMD,QAAQ,CAACxB,IAAI;YAAC,IAAI,CAAC;QAE/D,IACA,CAAC;YACLwC;YACAF,WAAWxE,oBAAoB2D;YAC/BmD,aAAanD,MAAMsB,UAAU,KAAK,aAAa,CAACV;YAChDwC;WACII,UAAU;YAAEE,UAAUjC,KAAK,CAACf,IAAI;QAAC,IAAI,CAAC,GACtCiC,QAAQ9E,GAAG,CAAC6C,QAAQ8C,UAAU;YAAER,QAAQL,QAAQzC,GAAG,CAACQ;QAAK,IAAI,CAAC,GAC9D2C,SAAS;YAAEA;QAAO,IAAI,CAAC;YAC3BC;;IAEJ;IAEA,MAAMK,UAAUlF;IAChB,KAAK,MAAMgB,QAAQtB,MAAO;QACxBwF,OAAO,CAAClE,KAAK2D,OAAO,CAAC,IAAI;QACzBO,QAAQ7E,KAAK,IAAI;IACnB;IACA,MAAM8E,WAAqB,EAAE;IAC7B,KAAK,MAAMnE,QAAQtB,MAAO;YACsCsB;QAA9D,IAAIA,KAAK0D,WAAW,EAAES,SAASvF,IAAI,CAAC,CAAC,uBAAuB,GAAEoB,aAAAA,KAAKnC,IAAI,YAATmC,aAAaA,KAAKiB,GAAG,CAAC,mCAAmC,CAAC;IAC1H;IACA,KAAK,MAAM2B,aAAajC,WAAY;QAClC,IAAI,CAACiC,UAAUpB,MAAM,EAAE;gBACwDoB;YAA7EuB,SAASvF,IAAI,CAAC,CAAC,2BAA2B,EAAEgE,UAAU/B,KAAK,CAAClD,WAAW,GAAG,CAAC,GAAEiF,kBAAAA,UAAU/E,IAAI,YAAd+E,kBAAkBA,UAAU/D,EAAE,CAAC,EAAE,EAAE+D,UAAUC,QAAQ,CAACX,MAAM,KAAK,IAAI,kBAAkB,GAAGU,UAAUC,QAAQ,CAACX,MAAM,CAAC,WAAW,CAAC,CAAC,4CAA4C,CAAC;QAC7P;IACF;IACA,MAAM6B,UAAUrF,MAAMwB,MAAM,CAAC,CAACF,OAASA,KAAK2D,OAAO,KAAK,UAAU3D,KAAK2D,OAAO,KAAK;IACnF,MAAMS,QAAQvH,uBACZkH,QAAQ9F,GAAG,CAAC,CAAC+B,OAASF,MAAMW,GAAG,CAACT,KAAKiB,GAAG,IACxCmD,KAAK,CAACnG,GAAG,CAACnB;IACZ,MAAMuH,2BAA0D,EAAE;IAClE,IAAIH,QAAQ/F,OAAO,EAAEkG,yBAAyBzF,IAAI,CAAC;IACnD,IAAI+B,WAAW8B,IAAI,CAAC,CAACG;YAAcA;eAAAA,EAAAA,oBAAAA,UAAUpB,MAAM,qBAAhBoB,kBAAkBhB,MAAM,MAAK;QAAkByC,yBAAyBzF,IAAI,CAAC;IAChH,IAAIsF,QAAQ9E,IAAI,EAAEiF,yBAAyBzF,IAAI,CAAC;IAChD,OAAO;QAAEF;QAAOiC;QAAYP;QAAcgE;QAAOpC;QAAOkC;QAASC;QAAUE;IAAyB;AACtG;AAEA,yDAAyD,GACzD,OAAO,SAASC,+BACdC,IAA2D,EAC3DC,YAA+B;IAE/B,OAAOD,KAAKF,wBAAwB,CAACnE,MAAM,CAAC,CAACuE,UAAY,CAACD,aAAanD,QAAQ,CAACoD;AAClF;AAEA,wGAAwG,GACxG,OAAO,SAASC,wBACdH,IAAoF,EACpFC,YAA+B;IAE/B,MAAMrC,SAASoC,KAAKL,OAAO,CAACjF,MAAM,GAAGsF,KAAKL,OAAO,CAAC/F,OAAO,GAAGoG,KAAKL,OAAO,CAAChF,QAAQ;IACjF,OAAO,CAACqF,KAAKJ,QAAQ,CAACjC,MAAM,IAAIC,SAAS,KAAK,CAACmC,+BAA+BC,MAAMC,cAActC,MAAM;AAC1G;AAEA,uCAAuC,GACvC,OAAO,SAASyC,aAAa3C,KAAuC;IAClE,OAAO,IAAIjC,IAAI0B,OAAOC,OAAO,CAACM;AAChC;AAEA;;;;CAIC,GACD,OAAO,SAAS4C,sBACd5C,KAAkC,EAClCxD,IAAY,EACZK,EAA6B;IAE7B,IAAI,CAACA,IAAI,OAAOA,aAAAA,KAAM;IACtB,MAAMgG,SAAS7C,MAAMvB,GAAG,CAAC,GAAGjC,KAAK,CAAC,EAAEK,IAAI;IACxC,IAAIgG,WAAWf,WAAW,OAAOjF;IACjC,OAAOgG,WAAW,KAAK,OAAOA;AAChC"}