@prisma/orm-toolchain 0.16.0

package/dist/aggregate-B4mhR4Sk.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"aggregate-B4mhR4Sk.mjs","names":["APP_SPACE_ID"],"sources":["../../../../1-framework/3-tooling/migration/dist/exports/aggregate.mjs"],"sourcesContent":["import { M as errorRefNotResolvable, N as errorSpaceHeadRefMissing, i as errorContractDeserializationFailed, p as errorHashNotInGraph, r as errorBundleNotFoundForGraphNode, t as MigrationToolsError } from \"../errors-IpZm1Skp.mjs\";\nimport { n as readContractSnapshotDts, r as readContractSnapshotJson, t as contractSnapshotDir } from \"../contract-snapshot-store-sf5nP4mb.mjs\";\nimport { s as readMigrationsDir } from \"../io-C8TdyBKt.mjs\";\nimport { t as EMPTY_CONTRACT_HASH } from \"../constants-CM-w38DQ.mjs\";\nimport { n as isGraphNode } from \"../graph-membership-DW6nnbyQ.mjs\";\nimport { l as reconstructGraph, o as findPathWithDecision } from \"../migration-graph-CBf9ORe7.mjs\";\nimport { a as readRefsTolerant, r as readRef, t as HEAD_REF_NAME } from \"../refs-BDbB9BRB.mjs\";\nimport { c as isValidSpaceId, i as APP_SPACE_ID, l as spaceMigrationDirectory, r as readContractSpaceHeadRef, t as listContractSpaceDirectories, u as spaceRefsDirectory } from \"../verify-contract-spaces-BZDcJsuA.mjs\";\nimport { join } from \"pathe\";\nimport { issueOutcome } from \"@internal/framework-components/control\";\nimport { blindCast } from \"@internal/utils/casts\";\nimport { InternalError } from \"@internal/utils/internal-error\";\nimport { notOk, ok } from \"@internal/utils/result\";\nimport { UNBOUND_NAMESPACE_ID, coordinateKey, elementCoordinates, entityAt } from \"@internal/framework-components/ir\";\nimport { effectiveControlPolicy } from \"@internal/contract/types\";\n//#region src/aggregate/aggregate.ts\nfunction contractAtMemoKey(hash, refName) {\n\treturn `${hash}\\0${refName ?? \"\"}`;\n}\nfunction deserializeContractAtPath(filePath, contractJson, deserializeContract) {\n\ttry {\n\t\treturn deserializeContract(contractJson);\n\t} catch (error) {\n\t\tif (MigrationToolsError.is(error)) throw error;\n\t\tthrow errorContractDeserializationFailed(filePath, error instanceof Error ? error.message : String(error));\n\t}\n}\nasync function readContractSnapshotEntry(migrationsDir, hash, deserializeContract) {\n\tconst contractJson = await readContractSnapshotJson(migrationsDir, hash);\n\treturn {\n\t\tcontractJson,\n\t\tcontractDts: await readContractSnapshotDts(migrationsDir, hash),\n\t\tcontract: deserializeContractAtPath(join(contractSnapshotDir(migrationsDir, hash), \"contract.json\"), contractJson, deserializeContract)\n\t};\n}\nasync function resolveContractAt(args) {\n\tconst { hash, opts, refsDir, migrationsDir, packages, graph, deserializeContract } = args;\n\tconst refName = opts?.refName;\n\tif (refName !== void 0) {\n\t\tlet refEntry;\n\t\ttry {\n\t\t\trefEntry = await readRef(refsDir, refName);\n\t\t} catch (error) {\n\t\t\tif (MigrationToolsError.is(error) && error.code === \"MIGRATION.UNKNOWN_REF\") refEntry = void 0;\n\t\t\telse throw error;\n\t\t}\n\t\tif (refEntry) {\n\t\t\tconst { contractJson, contractDts, contract } = await readContractSnapshotEntry(migrationsDir, refEntry.hash, deserializeContract);\n\t\t\treturn {\n\t\t\t\thash: refEntry.hash,\n\t\t\t\tcontractJson,\n\t\t\t\tcontractDts,\n\t\t\t\tcontract,\n\t\t\t\tprovenance: \"ref\"\n\t\t\t};\n\t\t}\n\t\tif (isGraphNode(hash, graph)) return resolveGraphNodeContractAt({\n\t\t\thash,\n\t\t\tmigrationsDir,\n\t\t\tpackages,\n\t\t\tdeserializeContract,\n\t\t\texplicitLabel: refName\n\t\t});\n\t\tthrow errorRefNotResolvable(refName);\n\t}\n\tif (isGraphNode(hash, graph)) return resolveGraphNodeContractAt({\n\t\thash,\n\t\tmigrationsDir,\n\t\tpackages,\n\t\tdeserializeContract\n\t});\n\tthrow errorHashNotInGraph(hash, graph);\n}\nasync function resolveGraphNodeContractAt(args) {\n\tconst { hash, migrationsDir, packages, deserializeContract, explicitLabel } = args;\n\tif (!packages.find((pkg) => pkg.metadata.to === hash)) throw errorBundleNotFoundForGraphNode(hash, explicitLabel);\n\tconst { contractJson, contractDts, contract } = await readContractSnapshotEntry(migrationsDir, hash, deserializeContract);\n\treturn {\n\t\thash,\n\t\tcontractJson,\n\t\tcontractDts,\n\t\tcontract,\n\t\tprovenance: \"graph-node\"\n\t};\n}\n/**\n* Resolve a contract space's head ref, asserting it is present. The apply/verify\n* engine only runs after `checkIntegrity` has refused on `headRefMissing`,\n* so a space reaching the planner / verifier without a head ref is a\n* programming error (the integrity gate was skipped), not a user-facing\n* state. The app space's head ref is always synthesised, so this only\n* ever guards an ungated extension space.\n*/\nfunction requireHeadRef(space) {\n\tif (space.headRef === null) throw new InternalError(`Contract space \"${space.spaceId}\" has no head ref; the integrity gate must refuse a missing head ref before planning or verifying.`);\n\treturn space.headRef;\n}\n/**\n* Build a {@link AggregateContractSpace} with lazily-memoised `graph()`,\n* `contract()`, and `contractAt()` facets.\n*\n* `graph()` reconstructs the migration graph from `packages` on first\n* call and caches it. `contract()` calls `resolveContract` on first call\n* and caches the result; a throwing `resolveContract` (e.g. a missing or\n* undeserializable on-disk contract) re-throws on each call rather than\n* caching a value — `checkIntegrity` surfaces that as `contractUnreadable`.\n* `contractAt()` materializes the contract at an arbitrary graph node with\n* the same resolution order as plan-time ref resolution: the ref's pointer\n* plus the store entry keyed by the pointer's hash first (when\n* `opts.refName` is set), else the contract snapshot store entry keyed by\n* the matching package's `to` hash.\n*/\nfunction createAggregateContractSpace(args) {\n\tconst { spaceId, packages, refs, headRef, refsDir, migrationsDir, resolveContract, deserializeContract } = args;\n\tlet graphMemo;\n\tlet contractMemo;\n\tconst contractAtMemo = /* @__PURE__ */ new Map();\n\tfunction spaceGraph() {\n\t\tgraphMemo ??= reconstructGraph(packages);\n\t\treturn graphMemo;\n\t}\n\treturn {\n\t\tspaceId,\n\t\tpackages,\n\t\trefs,\n\t\theadRef,\n\t\tgraph: spaceGraph,\n\t\tcontract() {\n\t\t\tcontractMemo ??= resolveContract();\n\t\t\treturn contractMemo;\n\t\t},\n\t\tasync contractAt(hash, opts) {\n\t\t\tconst key = contractAtMemoKey(hash, opts?.refName);\n\t\t\tconst cached = contractAtMemo.get(key);\n\t\t\tif (cached) return cached;\n\t\t\tconst result = await resolveContractAt({\n\t\t\t\thash,\n\t\t\t\topts,\n\t\t\t\trefsDir,\n\t\t\t\tmigrationsDir,\n\t\t\t\tpackages,\n\t\t\t\tgraph: spaceGraph(),\n\t\t\t\tdeserializeContract\n\t\t\t});\n\t\t\tcontractAtMemo.set(key, result);\n\t\t\treturn result;\n\t\t}\n\t};\n}\n/**\n* Collect the union of every namespace declared across all contract spaces of an\n* aggregate (app + extensions) and return a minimal object with the shape\n* `{ storage: { namespaces } }` suitable for passing to\n* `familyInstance.introspect`.\n*\n* Callers invoke this after the integrity gate (`buildContractSpaceAggregate`\n* with `checkContracts: true`), so every `space.contract()` call is safe —\n* no try/catch is needed here.\n*/\nfunction collectAggregateNamespaces(aggregate) {\n\tconst merged = {};\n\tfor (const space of aggregate.spaces()) for (const [key, ns] of Object.entries(space.contract().storage.namespaces)) {\n\t\tconst existing = merged[key];\n\t\tmerged[key] = existing === void 0 ? ns : mergeNamespaceEntries(existing, ns);\n\t}\n\treturn { storage: { namespaces: merged } };\n}\n/**\n* Union two contract spaces' declarations for the same namespace id, per\n* entity kind. Two spaces may legitimately share a namespace (e.g. both\n* declaring tables in `public`); element-level disjointness is enforced by\n* `checkIntegrity`, so the kind maps never collide on a name — replacing the\n* whole namespace would silently drop the earlier space's entities.\n*/\nfunction mergeNamespaceEntries(a, b) {\n\tconst entries = { ...a.entries };\n\tfor (const [entityKind, kindMap] of Object.entries(b.entries)) entries[entityKind] = {\n\t\t...entries[entityKind],\n\t\t...kindMap\n\t};\n\treturn {\n\t\t...a,\n\t\tentries\n\t};\n}\n/**\n* Assemble a {@link ContractSpaceAggregate} value from its contract spaces and a\n* `checkIntegrity` implementation. The query methods (`listSpaces` /\n* `hasSpace` / `space` / `spaces`) are derived here so every aggregate —\n* loader-built or test-built — shares one query surface: `app` first,\n* then `extensions` in the order supplied (the loader sorts them\n* lex-ascending by `spaceId`).\n*/\nfunction createContractSpaceAggregate(args) {\n\tconst { targetId, app, extensions, checkIntegrity } = args;\n\tconst ordered = [app, ...extensions];\n\tconst byId = new Map(ordered.map((m) => [m.spaceId, m]));\n\tconst spaceDeclares = (space, coordinate) => {\n\t\tconst key = coordinateKey(coordinate);\n\t\tfor (const coord of elementCoordinates(space.contract().storage)) if (coordinateKey(coord) === key) return true;\n\t\treturn false;\n\t};\n\treturn {\n\t\ttargetId,\n\t\tapp,\n\t\textensions,\n\t\tlistSpaces: () => ordered.map((m) => m.spaceId),\n\t\thasSpace: (id) => byId.has(id),\n\t\tspace: (id) => byId.get(id),\n\t\tspaces: () => ordered,\n\t\tdeclaresEntity: (coordinate) => ordered.some((space) => spaceDeclares(space, coordinate)),\n\t\tdeclaringSpaces: (coordinate) => ordered.filter((space) => spaceDeclares(space, coordinate)).map((s) => s.spaceId),\n\t\tcheckIntegrity\n\t};\n}\n//#endregion\n//#region src/aggregate/all-external.ts\nfunction isControlPolicy(value) {\n\treturn value === \"managed\" || value === \"tolerated\" || value === \"external\" || value === \"observed\";\n}\n/**\n* True when every storage element the contract declares resolves to the\n* `external` control policy (ADR 224) — element-level `control` first, the\n* contract's `defaultControlPolicy` otherwise. A contract with no storage\n* elements is vacuously all-external.\n*\n* This is the precondition for advancing a contract space's marker without\n* any migrations (the declared-state resolution the db-init aggregate\n* planner and `migrate` share): only when nothing in the space is\n* Prisma-Next-managed can the storage structure be correct without a\n* migration having produced it. Any space that declares a managed element\n* but ships no migration graph is an authoring bug and must fail loudly.\n*/\nfunction allStorageElementsExternal(contract) {\n\tfor (const coordinate of elementCoordinates(contract.storage)) {\n\t\tconst entity = entityAt(contract.storage, coordinate);\n\t\tconst declared = entity !== null && typeof entity === \"object\" ? blindCast(entity).control : void 0;\n\t\tif (effectiveControlPolicy(isControlPolicy(declared) ? declared : void 0, contract.defaultControlPolicy) !== \"external\") return false;\n\t}\n\treturn true;\n}\n//#endregion\n//#region src/aggregate/check-integrity.ts\n/**\n* Walk the loaded model and return **every** integrity violation — never\n* bailing at the first. Structurally-derivable violations (load-time\n* problems, self-edges, missing / unreachable head refs) are always\n* produced; layout-drift checks require `declaredExtensions`, and\n* contract / target / disjointness checks require `checkContracts`.\n*/\nfunction computeIntegrityViolations(input, opts) {\n\tconst violations = [];\n\tfor (const { space, problems, refProblems, headRefProblem, isApp } of input.spaces) {\n\t\tconst { spaceId } = space;\n\t\tfor (const problem of problems) violations.push(loadProblemToViolation(spaceId, problem));\n\t\tfor (const refProblem of refProblems) violations.push({\n\t\t\tkind: \"refUnreadable\",\n\t\t\tspaceId,\n\t\t\trefName: refProblem.refName,\n\t\t\tdetail: refProblem.detail\n\t\t});\n\t\tif (headRefProblem !== null) violations.push({\n\t\t\tkind: \"refUnreadable\",\n\t\t\tspaceId,\n\t\t\trefName: headRefProblem.refName,\n\t\t\tdetail: headRefProblem.detail\n\t\t});\n\t\tfor (const pkg of space.packages) {\n\t\t\tconst from = pkg.metadata.from ?? \"empty\";\n\t\t\tconst isSelfEdge = from === pkg.metadata.to;\n\t\t\tconst hasDataOp = pkg.ops.some((op) => op.operationClass === \"data\");\n\t\t\tif (isSelfEdge && !hasDataOp) violations.push({\n\t\t\t\tkind: \"sameSourceAndTarget\",\n\t\t\t\tspaceId,\n\t\t\t\tdirName: pkg.dirName,\n\t\t\t\thash: from\n\t\t\t});\n\t\t}\n\t\tviolations.push(...duplicateMigrationHashViolations(spaceId, space.packages));\n\t\tif (!isApp && headRefProblem === null) {\n\t\t\tif (space.headRef === null) violations.push({\n\t\t\t\tkind: \"headRefMissing\",\n\t\t\t\tspaceId\n\t\t\t});\n\t\t\telse if (space.packages.length > 0 && !headRefPresentInGraph(space, space.headRef.hash)) violations.push({\n\t\t\t\tkind: \"headRefNotInGraph\",\n\t\t\t\tspaceId,\n\t\t\t\thash: space.headRef.hash\n\t\t\t});\n\t\t}\n\t}\n\tif (opts?.declaredExtensions !== void 0) violations.push(...layoutViolations(input.spaces, opts.declaredExtensions));\n\tif (opts?.checkContracts === true) violations.push(...contractViolations(input));\n\treturn violations;\n}\nfunction loadProblemToViolation(spaceId, problem) {\n\tswitch (problem.kind) {\n\t\tcase \"hashMismatch\": return {\n\t\t\tkind: \"hashMismatch\",\n\t\t\tspaceId,\n\t\t\tdirName: problem.dirName,\n\t\t\tstored: problem.stored,\n\t\t\tcomputed: problem.computed\n\t\t};\n\t\tcase \"providedInvariantsMismatch\": return {\n\t\t\tkind: \"providedInvariantsMismatch\",\n\t\t\tspaceId,\n\t\t\tdirName: problem.dirName\n\t\t};\n\t\tcase \"packageUnloadable\": return {\n\t\t\tkind: \"packageUnloadable\",\n\t\t\tspaceId,\n\t\t\tdirName: problem.dirName,\n\t\t\tdetail: problem.detail\n\t\t};\n\t}\n}\nfunction duplicateMigrationHashViolations(spaceId, packages) {\n\tconst dirNamesByHash = /* @__PURE__ */ new Map();\n\tfor (const pkg of packages) {\n\t\tconst hash = pkg.metadata.migrationHash;\n\t\tconst dirNames = dirNamesByHash.get(hash);\n\t\tif (dirNames) dirNames.push(pkg.dirName);\n\t\telse dirNamesByHash.set(hash, [pkg.dirName]);\n\t}\n\tconst out = [];\n\tfor (const [migrationHash, dirNames] of dirNamesByHash) if (dirNames.length > 1) out.push({\n\t\tkind: \"duplicateMigrationHash\",\n\t\tspaceId,\n\t\tmigrationHash,\n\t\tdirNames: [...dirNames].sort()\n\t});\n\treturn out;\n}\n/**\n* Whether a space's head-ref hash is present in its reconstructed graph.\n* An empty graph is reachable only by the empty-contract sentinel.\n*/\nfunction headRefPresentInGraph(space, headHash) {\n\tconst graph = space.graph();\n\tif (graph.nodes.size === 0) return headHash === EMPTY_CONTRACT_HASH;\n\treturn graph.nodes.has(headHash);\n}\nfunction layoutViolations(spaces, declaredExtensions) {\n\tconst out = [];\n\tconst extensionSpaceIds = new Set(spaces.filter((s) => !s.isApp).map((s) => s.space.spaceId));\n\tconst declaredIds = new Set(declaredExtensions.map((d) => d.id));\n\tfor (const id of [...extensionSpaceIds].sort()) if (!declaredIds.has(id)) out.push({\n\t\tkind: \"orphanSpaceDir\",\n\t\tspaceId: id\n\t});\n\tfor (const id of [...declaredIds].sort()) if (!extensionSpaceIds.has(id)) out.push({\n\t\tkind: \"declaredButUnmigrated\",\n\t\tspaceId: id\n\t});\n\treturn out;\n}\nfunction contractViolations(input) {\n\tconst out = [];\n\tconst elementClaimedBy = /* @__PURE__ */ new Map();\n\tconst elementLabel = /* @__PURE__ */ new Map();\n\tfor (const { space } of input.spaces) {\n\t\tlet contract;\n\t\ttry {\n\t\t\tcontract = space.contract();\n\t\t} catch (error) {\n\t\t\tout.push({\n\t\t\t\tkind: \"contractUnreadable\",\n\t\t\t\tspaceId: space.spaceId,\n\t\t\t\tdetail: detailOf$1(error)\n\t\t\t});\n\t\t\tcontinue;\n\t\t}\n\t\tif (contract.target !== input.targetId) out.push({\n\t\t\tkind: \"targetMismatch\",\n\t\t\tspaceId: space.spaceId,\n\t\t\texpected: input.targetId,\n\t\t\tactual: contract.target\n\t\t});\n\t\tfor (const coordinate of elementCoordinates(contract.storage)) {\n\t\t\tconst key = coordinateKey(coordinate);\n\t\t\tconst claimers = elementClaimedBy.get(key);\n\t\t\tif (claimers) claimers.push(space.spaceId);\n\t\t\telse {\n\t\t\t\telementClaimedBy.set(key, [space.spaceId]);\n\t\t\t\telementLabel.set(key, `${coordinate.namespaceId}.${coordinate.entityName}`);\n\t\t\t}\n\t\t}\n\t}\n\tconst disjointness = [];\n\tfor (const [key, claimedBy] of elementClaimedBy) if (claimedBy.length > 1) {\n\t\tconst element = elementLabel.get(key) ?? key;\n\t\tdisjointness.push({\n\t\t\tkind: \"disjointness\",\n\t\t\telement,\n\t\t\tclaimedBy: [...claimedBy].sort()\n\t\t});\n\t}\n\tdisjointness.sort((a, b) => a.kind === \"disjointness\" && b.kind === \"disjointness\" ? a.element.localeCompare(b.element) : 0);\n\tout.push(...disjointness);\n\treturn out;\n}\nfunction detailOf$1(error) {\n\tif (MigrationToolsError.is(error)) return error.why;\n\tif (error instanceof Error) return error.message;\n\treturn String(error);\n}\n//#endregion\n//#region src/aggregate/fabricated-migration-edge.ts\nfunction buildFabricatedMigrationEdge(args) {\n\treturn {\n\t\tdirName: \"\",\n\t\tmigrationHash: args.destinationStorageHash,\n\t\tfrom: args.currentMarkerStorageHash ?? \"\",\n\t\tto: args.destinationStorageHash,\n\t\toperationCount: args.operationCount,\n\t\t...args.destinationContractJson !== void 0 ? { destinationContractJson: args.destinationContractJson } : {}\n\t};\n}\n//#endregion\n//#region src/aggregate/loader.ts\n/**\n* Build a tolerant, queryable {@link ContractSpaceAggregate} from on-disk\n* migration state plus the caller's live app contract.\n*\n* Building **never throws on disk content**: a hash- or\n* invariants-mismatched package is retained, an unparseable package is\n* omitted, a missing extension head ref leaves `headRef: null`, and an\n* unreadable on-disk contract defers its failure to `space.contract()`.\n* Every such problem is judged by {@link ContractSpaceAggregate.checkIntegrity}\n* rather than aborting the load. The only rejections are catastrophic I/O\n* (a `migrations/` that exists but is unreadable for reasons other than\n* absence).\n*\n* The app space's head ref is synthesised from the live contract's\n* storage hash (the app contract is authored independently of the\n* migration graph), and `app.contract()` returns the supplied contract.\n* Extension spaces read their contract, refs, and head ref from disk.\n*/\nasync function loadContractSpaceAggregate(input) {\n\tconst { migrationsDir, deserializeContract, appContract } = input;\n\tconst targetId = appContract.target;\n\tconst appState = await loadAppSpace(migrationsDir, appContract, deserializeContract);\n\tconst extensionStates = await loadExtensionSpaces(migrationsDir, deserializeContract);\n\tconst spaces = [appState, ...extensionStates];\n\treturn createContractSpaceAggregate({\n\t\ttargetId,\n\t\tapp: appState.space,\n\t\textensions: extensionStates.map((state) => state.space),\n\t\tcheckIntegrity: (opts) => computeIntegrityViolations({\n\t\t\ttargetId,\n\t\t\tspaces\n\t\t}, opts)\n\t});\n}\nasync function loadAppSpace(migrationsDir, appContract, deserializeContract) {\n\tconst spaceDir = spaceMigrationDirectory(migrationsDir, APP_SPACE_ID);\n\tconst { packages, problems } = await readMigrationsDir(spaceDir, { migrationsDir });\n\tconst { refs, problems: refProblems } = await readRefsTolerant(spaceRefsDirectory(spaceDir));\n\treturn {\n\t\tspace: createAggregateContractSpace({\n\t\t\tspaceId: APP_SPACE_ID,\n\t\t\tpackages,\n\t\t\trefs,\n\t\t\theadRef: {\n\t\t\t\thash: appContract.storage.storageHash,\n\t\t\t\tinvariants: []\n\t\t\t},\n\t\t\trefsDir: spaceRefsDirectory(spaceDir),\n\t\t\tmigrationsDir,\n\t\t\tresolveContract: () => appContract,\n\t\t\tdeserializeContract\n\t\t}),\n\t\tproblems,\n\t\trefProblems,\n\t\theadRefProblem: null,\n\t\tisApp: true\n\t};\n}\nasync function loadExtensionSpaces(migrationsDir, deserializeContract) {\n\tconst extensionIds = (await listContractSpaceDirectories(migrationsDir)).filter((name) => name !== APP_SPACE_ID).filter(isValidSpaceId).sort();\n\tconst states = [];\n\tfor (const spaceId of extensionIds) states.push(await loadExtensionSpace(migrationsDir, spaceId, deserializeContract));\n\treturn states;\n}\nasync function loadExtensionSpace(migrationsDir, spaceId, deserializeContract) {\n\tconst spaceDir = spaceMigrationDirectory(migrationsDir, spaceId);\n\tconst { packages, problems } = await readMigrationsDir(spaceDir, { migrationsDir });\n\tconst { refs, problems: refProblems } = await readRefsTolerant(spaceRefsDirectory(spaceDir));\n\tconst { headRef, problem: headRefProblem } = await readHeadRefTolerant(migrationsDir, spaceId);\n\tconst rawContract = await readRawContractDeferred(migrationsDir, spaceId, headRef);\n\treturn {\n\t\tspace: createAggregateContractSpace({\n\t\t\tspaceId,\n\t\t\tpackages,\n\t\t\trefs,\n\t\t\theadRef,\n\t\t\trefsDir: spaceRefsDirectory(spaceDir),\n\t\t\tmigrationsDir,\n\t\t\tresolveContract: () => deserializeContract(rawContract()),\n\t\t\tdeserializeContract\n\t\t}),\n\t\tproblems,\n\t\trefProblems,\n\t\theadRefProblem,\n\t\tisApp: false\n\t};\n}\n/**\n* Read an extension's head ref, distinguishing a *genuinely absent*\n* `head.json` (`headRef: null`, no problem — judged `headRefMissing`)\n* from one that *exists but cannot be parsed* (`headRef: null` plus a\n* problem — judged `refUnreadable`, not `headRefMissing`).\n* `readContractSpaceHeadRef` already returns `null` only for ENOENT and\n* throws for unparseable / schema-invalid content, so the throw is the\n* corruption signal. Construction never throws on disk content.\n*/\nfunction isToleratedRefHeadReadError(error) {\n\tif (MigrationToolsError.is(error)) return true;\n\tif (!(error instanceof Error)) return false;\n\tconst code = error.code;\n\treturn code === \"ENOENT\" || code === \"EISDIR\";\n}\nasync function readHeadRefTolerant(migrationsDir, spaceId) {\n\ttry {\n\t\treturn {\n\t\t\theadRef: await readContractSpaceHeadRef(migrationsDir, spaceId),\n\t\t\tproblem: null\n\t\t};\n\t} catch (error) {\n\t\tif (!isToleratedRefHeadReadError(error)) throw error;\n\t\treturn {\n\t\t\theadRef: null,\n\t\t\tproblem: {\n\t\t\t\trefName: HEAD_REF_NAME,\n\t\t\t\tdetail: detailOf(error)\n\t\t\t}\n\t\t};\n\t}\n}\nfunction detailOf(error) {\n\treturn error instanceof Error ? error.message : String(error);\n}\n/**\n* Read the raw contract snapshot-store entry eagerly (cheap I/O) but defer\n* its (throwing) failure to call time, so a missing or unparseable store\n* entry becomes a `contract()` throw — surfaced as `contractUnreadable` —\n* rather than a construction failure. When `headRef` is absent there is no\n* hash to resolve against the store, so the deferred call always throws;\n* `checkIntegrity` already reports that case as `headRefMissing`, and a\n* `checkContracts` pass surfaces the same space as `contractUnreadable`.\n*/\nasync function readRawContractDeferred(migrationsDir, spaceId, headRef) {\n\tif (headRef === null) return () => {\n\t\tthrow errorSpaceHeadRefMissing(spaceId);\n\t};\n\ttry {\n\t\tconst raw = await readContractSnapshotJson(migrationsDir, headRef.hash);\n\t\treturn () => raw;\n\t} catch (error) {\n\t\treturn () => {\n\t\t\tthrow error;\n\t\t};\n\t}\n}\n//#endregion\n//#region src/aggregate/strategies/plan-from-diff.ts\n/**\n* Plan a migration for a single contract space from a diff against the full\n* live schema, delegating to the family's `createPlanner(...).plan(...)`.\n*\n* The planner diffs the whole introspected schema, so it sees other contract\n* spaces' tables as \"extras\"; the orchestration hands the planner the\n* aggregate as an ownership oracle so it can ask, per extra, whether any\n* space owns it — a sibling-owned table is left untouched, so the planner\n* never emits a destructive drop for it, and this strategy holds no ownership\n* logic of its own. The schema is never pruned before planning: cross-space\n* foreign keys need every sibling table visible to the diff.\n*\n* The produced plan's `targetId` is set from `aggregateTargetId`\n* (the aggregate's ambient target). The family's planner does not\n* stamp `targetId` on the produced plan; the aggregate planner is\n* the single point that knows the target.\n*\n* Used by:\n*\n* - The app space by default (CLI policy\n*   `ignoreGraphFor: { app.spaceId }`).\n* - Any extension space whose `headRef.invariants` is empty and whose\n*   graph is non-empty (the all-external, zero-migration-package case is\n*   handled directly by the aggregate planner without calling this).\n*/\nasync function planFromDiff(input) {\n\tconst plannerResult = await input.migrations.createPlanner(input.adapter).plan({\n\t\tcontract: input.space.contract(),\n\t\tschema: input.schemaIntrospection,\n\t\tpolicy: input.operationPolicy,\n\t\tfromContract: null,\n\t\tframeworkComponents: input.frameworkComponents,\n\t\tspaceId: input.space.spaceId,\n\t\townership: input.ownership,\n\t\tsnapshotsImportPath: \"\"\n\t});\n\tif (plannerResult.kind === \"failure\") return {\n\t\tkind: \"failure\",\n\t\tconflicts: plannerResult.conflicts\n\t};\n\tconst producedPlan = plannerResult.plan;\n\tconst plan = new Proxy(producedPlan, {\n\t\tget(target, prop) {\n\t\t\tif (prop === \"targetId\") return input.aggregateTargetId;\n\t\t\treturn Reflect.get(target, prop, target);\n\t\t},\n\t\thas(target, prop) {\n\t\t\tif (prop === \"targetId\") return true;\n\t\t\treturn Reflect.has(target, prop);\n\t\t}\n\t});\n\tconst destinationStorageHash = producedPlan.destination.storageHash;\n\tconst producedOps = await Promise.all(producedPlan.operations);\n\tconst destinationContract = input.space.contract();\n\treturn {\n\t\tkind: \"ok\",\n\t\tresult: {\n\t\t\tplan,\n\t\t\tdisplayOps: producedOps,\n\t\t\tdestinationContract,\n\t\t\tstrategy: \"plan-from-diff\",\n\t\t\t...plannerResult.warnings && plannerResult.warnings.length > 0 ? { warnings: plannerResult.warnings } : {},\n\t\t\tmigrationEdges: [buildFabricatedMigrationEdge({\n\t\t\t\tcurrentMarkerStorageHash: input.currentMarker?.storageHash,\n\t\t\t\tdestinationStorageHash,\n\t\t\t\toperationCount: producedOps.length,\n\t\t\t\tdestinationContractJson: destinationContract\n\t\t\t})]\n\t\t}\n\t};\n}\n//#endregion\n//#region src/aggregate/strategies/resolve-recorded-path.ts\n/**\n* Resolve a contract space's hydrated migration graph to the path from the\n* live marker to `space.headRef.hash`, covering every required invariant.\n*\n* Pure synchronous function — no I/O. The aggregate's loader has\n* already integrity-checked every package and reconstructed the graph;\n* this resolves the path by looking up ops by `migrationHash` and\n* assembles a `MigrationPlan` with `targetId` set from the aggregate (no\n* placeholder cast).\n*\n* Required invariants are computed as `headRef.invariants \\ marker.invariants`\n* — the marker already declares some invariants satisfied; the path\n* only needs to provide the remainder. Mirrors today's\n* `computeExtensionSpaceApplyPath` semantics.\n*/\nfunction resolveRecordedPath(input) {\n\tconst { aggregateTargetId, space, currentMarker, refName } = input;\n\tconst headRef = requireHeadRef(space);\n\tconst graph = space.graph();\n\tconst packagesByMigrationHash = new Map(space.packages.map((pkg) => [pkg.metadata.migrationHash, pkg]));\n\tconst fromHash = currentMarker?.storageHash ?? \"empty\";\n\tconst markerInvariants = new Set(currentMarker?.invariants ?? []);\n\tconst required = new Set(headRef.invariants.filter((id) => !markerInvariants.has(id)));\n\tconst outcome = findPathWithDecision(graph, fromHash, headRef.hash, {\n\t\trequired,\n\t\t...refName !== void 0 ? { refName } : {}\n\t});\n\tif (outcome.kind === \"unreachable\") return { kind: \"unreachable\" };\n\tif (outcome.kind === \"unsatisfiable\") return {\n\t\tkind: \"unsatisfiable\",\n\t\tmissing: outcome.missing\n\t};\n\tconst pathOps = [];\n\tconst providedInvariantsSet = /* @__PURE__ */ new Set();\n\tconst edgeRefs = [];\n\tfor (const edge of outcome.decision.selectedPath) {\n\t\tconst pkg = packagesByMigrationHash.get(edge.migrationHash);\n\t\tif (!pkg) throw new InternalError(`Migration package missing for edge ${edge.migrationHash} in space \"${space.spaceId}\". The hydrated migration graph and packagesByMigrationHash map are out of sync — this should be unreachable; report.`);\n\t\tfor (const op of pkg.ops) pathOps.push(op);\n\t\tfor (const invariant of pkg.metadata.providedInvariants) providedInvariantsSet.add(invariant);\n\t\tedgeRefs.push({\n\t\t\tmigrationHash: edge.migrationHash,\n\t\t\tdirName: edge.dirName,\n\t\t\tfrom: edge.from,\n\t\t\tto: edge.to,\n\t\t\toperationCount: pkg.ops.length,\n\t\t\t...pkg.endContractJson !== void 0 ? { destinationContractJson: pkg.endContractJson } : {}\n\t\t});\n\t}\n\treturn {\n\t\tkind: \"ok\",\n\t\tresult: {\n\t\t\tplan: {\n\t\t\t\ttargetId: aggregateTargetId,\n\t\t\t\tspaceId: space.spaceId,\n\t\t\t\torigin: currentMarker === null ? null : { storageHash: currentMarker.storageHash },\n\t\t\t\tdestination: { storageHash: headRef.hash },\n\t\t\t\toperations: pathOps,\n\t\t\t\tprovidedInvariants: [...providedInvariantsSet].sort()\n\t\t\t},\n\t\t\tdisplayOps: pathOps,\n\t\t\tdestinationContract: space.contract(),\n\t\t\tstrategy: \"resolve-recorded-path\",\n\t\t\tmigrationEdges: edgeRefs,\n\t\t\tpathDecision: outcome.decision\n\t\t}\n\t};\n}\n//#endregion\n//#region src/aggregate/planner.ts\n/**\n* Plan a migration across every contract space of a {@link ContractSpaceAggregate}.\n*\n* Per-space operation selection, in order; first match wins:\n*\n* 1. If `callerPolicy.ignoreGraphFor.has(space.spaceId)`:\n*    - If `space.headRef.invariants` is empty → `planFromDiff`.\n*    - Else → `policyConflict` (a diff-fabricated plan cannot satisfy\n*      authored invariants).\n* 2. Else if `space.graph()` is non-empty AND `resolveRecordedPath`\n*    succeeds → its result.\n* 3. Else if `space.graph()` is non-empty but unresolvable →\n*    `extensionPathUnreachable` / `extensionPathUnsatisfiable`.\n* 4. Else (empty graph — the space ships no migration packages at all,\n*    e.g. an all-external extension space like Supabase's `auth`/`storage`)\n*    if `space.headRef.invariants` is empty → declare the no-op state\n*    directly (zero ops, destination = head ref) without invoking the\n*    family planner.\n* 5. Else → `extensionPathUnsatisfiable` (an empty graph cannot satisfy\n*    non-empty invariants).\n*\n* Output `applyOrder` is `[...aggregate.extensions.map(spaceId), aggregate.app.spaceId]`\n* — extensions alphabetical, then app — matching today's\n* `concatenateSpaceApplyInputs` ordering. This preserves\n* `MigrationRunnerFailure.failingSpace` attribution byte-for-byte.\n*\n* Every emitted `MigrationPlan` has `targetId = aggregate.targetId`.\n* No placeholder cast; no patch step.\n*/\nasync function planMigration(input) {\n\tconst { aggregate, currentDBState, callerPolicy } = input;\n\tconst perSpace = /* @__PURE__ */ new Map();\n\tconst orderedSpaces = [...aggregate.extensions, aggregate.app];\n\tfor (const space of orderedSpaces) {\n\t\tconst currentMarker = currentDBState.markersBySpaceId.get(space.spaceId) ?? null;\n\t\tconst headRef = requireHeadRef(space);\n\t\tconst ignoreGraph = callerPolicy.ignoreGraphFor.has(space.spaceId);\n\t\tconst invariantsRequired = headRef.invariants.length > 0;\n\t\tif (ignoreGraph && invariantsRequired) return notOk({\n\t\t\tkind: \"policyConflict\",\n\t\t\tspaceId: space.spaceId,\n\t\t\tdetail: `\\`callerPolicy.ignoreGraphFor\\` requested for space \"${space.spaceId}\", but the contract space declares non-empty head-ref invariants (${headRef.invariants.join(\", \")}). A plan built directly from the contract IR cannot satisfy authored invariants — the graph must be walked. Either remove \"${space.spaceId}\" from \\`ignoreGraphFor\\` or amend the on-disk head ref to declare zero invariants.`\n\t\t});\n\t\tif (ignoreGraph) {\n\t\t\tconst diffOutcome = await planFromDiff({\n\t\t\t\taggregateTargetId: aggregate.targetId,\n\t\t\t\tcurrentMarker,\n\t\t\t\tspace,\n\t\t\t\townership: aggregate,\n\t\t\t\tschemaIntrospection: currentDBState.schemaIntrospection,\n\t\t\t\tadapter: input.adapter,\n\t\t\t\tmigrations: input.migrations,\n\t\t\t\tframeworkComponents: input.frameworkComponents,\n\t\t\t\toperationPolicy: input.operationPolicy\n\t\t\t});\n\t\t\tif (diffOutcome.kind === \"failure\") return notOk({\n\t\t\t\tkind: \"planFromDiffFailed\",\n\t\t\t\tspaceId: space.spaceId,\n\t\t\t\tconflicts: diffOutcome.conflicts\n\t\t\t});\n\t\t\tperSpace.set(space.spaceId, diffOutcome.result);\n\t\t\tcontinue;\n\t\t}\n\t\tif (space.graph().nodes.size > 0) {\n\t\t\tconst resolved = resolveRecordedPath({\n\t\t\t\taggregateTargetId: aggregate.targetId,\n\t\t\t\tspace,\n\t\t\t\tcurrentMarker\n\t\t\t});\n\t\t\tif (resolved.kind === \"ok\") {\n\t\t\t\tperSpace.set(space.spaceId, resolved.result);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (resolved.kind === \"unreachable\") return notOk({\n\t\t\t\tkind: \"extensionPathUnreachable\",\n\t\t\t\tspaceId: space.spaceId,\n\t\t\t\ttarget: headRef.hash\n\t\t\t});\n\t\t\treturn notOk({\n\t\t\t\tkind: \"extensionPathUnsatisfiable\",\n\t\t\t\tspaceId: space.spaceId,\n\t\t\t\tmissingInvariants: resolved.missing\n\t\t\t});\n\t\t}\n\t\tif (invariantsRequired) return notOk({\n\t\t\tkind: \"extensionPathUnsatisfiable\",\n\t\t\tspaceId: space.spaceId,\n\t\t\tmissingInvariants: [...headRef.invariants].sort()\n\t\t});\n\t\tif (!allStorageElementsExternal(space.contract())) return notOk({\n\t\t\tkind: \"extensionPathUnreachable\",\n\t\t\tspaceId: space.spaceId,\n\t\t\ttarget: headRef.hash\n\t\t});\n\t\tperSpace.set(space.spaceId, {\n\t\t\tplan: {\n\t\t\t\ttargetId: aggregate.targetId,\n\t\t\t\tspaceId: space.spaceId,\n\t\t\t\torigin: currentMarker === null ? null : { storageHash: currentMarker.storageHash },\n\t\t\t\tdestination: { storageHash: headRef.hash },\n\t\t\t\toperations: []\n\t\t\t},\n\t\t\tdisplayOps: [],\n\t\t\tdestinationContract: space.contract(),\n\t\t\tstrategy: \"declared-state\",\n\t\t\tmigrationEdges: [buildFabricatedMigrationEdge({\n\t\t\t\tcurrentMarkerStorageHash: currentMarker?.storageHash,\n\t\t\t\tdestinationStorageHash: headRef.hash,\n\t\t\t\toperationCount: 0\n\t\t\t})]\n\t\t});\n\t}\n\treturn ok({\n\t\tperSpace,\n\t\tapplyOrder: [...aggregate.extensions.map((m) => m.spaceId), aggregate.app.spaceId]\n\t});\n}\nfunction pathIsUnder(path, prefix) {\n\tif (path.length < prefix.length) return false;\n\treturn prefix.every((segment, i) => path[i] === segment);\n}\n/**\n* Whether an issue's subject is a WHOLE top-level entity — as opposed to\n* something nested under one (e.g. a field, an index, or a policy). Calls\n* the injected `classify` capability, which resolves this from the issue's\n* node `nodeKind` (this aggregate never reaches into the node itself).\n* Absent `classify` (or a `classify` that returns nothing for this issue —\n* a family that doesn't classify) falls back to path shape: a\n* top-level entity's path is exactly its own name (one segment), so\n* anything deeper is nested.\n*/\nfunction isWholeEntityIssue(issue, classify) {\n\tconst granularity = classify?.(issue);\n\tif (granularity !== void 0) return granularity === \"entity\";\n\treturn issue.path.length === 1;\n}\n/**\n* A contract space's contract-satisfaction view. Strips the top-level entity\n* extras — the `not-expected` findings on whole-entity nodes (plus the\n* findings the differ's total descent reported under those entities). Those\n* belong to the standalone unclaimed-elements list\n* ({@link collectExtraElementCoordinates}), never a space's own verdict.\n*\n* Nested `not-expected` findings (an extra field on the space's own\n* declared entity…) and structural findings (an undeclared policy) are\n* the space's **own drift** and stay.\n*\n* The verdict recomputes from the surviving list: the per-space result is\n* issue-based (`ok` ⇔ the list is empty), so a space whose only failures\n* were top-level extras passes after the strip.\n*/\nfunction stripExtraFindings(result, classify) {\n\tconst droppedTablePaths = result.schema.issues.filter((issue) => issueOutcome(issue) === \"not-expected\" && isWholeEntityIssue(issue, classify)).map((issue) => issue.path);\n\tconst issues = result.schema.issues.filter((issue) => {\n\t\tif (issueOutcome(issue) !== \"not-expected\") return true;\n\t\tif (classify?.(issue) === \"structural\") return true;\n\t\treturn !droppedTablePaths.some((prefix) => pathIsUnder(issue.path, prefix));\n\t});\n\tif (issues.length === result.schema.issues.length) return result;\n\tconst ok = issues.length === 0;\n\tconst { code: staleCode, ...envelope } = result;\n\treturn {\n\t\t...envelope,\n\t\tok,\n\t\t...ok ? {} : { code: result.code ?? \"CONTRACT.MARKER_REQUIRED\" },\n\t\tsummary: ok ? \"Database schema satisfies contract\" : result.summary,\n\t\tschema: {\n\t\t\tissues,\n\t\t\t...result.schema.warnings !== void 0 ? { warnings: result.schema.warnings } : {}\n\t\t}\n\t};\n}\n/**\n* The schema-IR entity coordinate a `not-expected` `SchemaDiffIssue`\n* addresses, when its subject is a whole top-level entity. A nested leaf\n* (a field, an index, a policy on an undeclared entity) has no entity of\n* its own to report here.\n*\n* The whole-entity's name is the last path segment: the differ builds each\n* path from its nodes' ids, so at a whole-entity finding the last segment is\n* exactly the entity name — for every family, whether or not it stamps a\n* granularity. The namespace segment only exists for namespace-qualified\n* paths (`['database', namespaceId, entityName]`); single-namespace families\n* (a flat `['database', entityName]`, or a bare `[entityName]`) have no\n* separate segment, so every entity they declare implicitly shares one\n* namespace — the same sentinel the aggregate's own coordinate walk uses\n* for those families.\n*\n* `entityKind` is asked from the injected `classifyEntityKind` capability —\n* this module never names a family entity kind itself. Absent a classifier\n* (the classifier-absent path-shape fallback, e.g. a document family) the\n* coordinate carries {@link UNCLASSIFIED_ENTITY_KIND}: no ownership\n* consumer queries `declaresEntity` for a family in that state today, so\n* nothing reads the value as true.\n*/\nfunction schemaDiffIssueCoordinate(issue, classify, classifyEntityKind) {\n\tif (!isWholeEntityIssue(issue, classify)) return void 0;\n\tconst entityName = issue.path[issue.path.length - 1];\n\tif (entityName === void 0) return void 0;\n\treturn {\n\t\tnamespaceId: issue.path.length === 3 ? issue.path[1] ?? UNBOUND_NAMESPACE_ID : UNBOUND_NAMESPACE_ID,\n\t\tentityKind: classifyEntityKind?.(issue) ?? \"unclassified-entity\",\n\t\tentityName\n\t};\n}\n/**\n* The schema-IR entity coordinates of every live element this contract\n* space's diff reports as `not-expected`, deduplicated. The verifier gathers\n* these across all spaces and keeps only the coordinates no contract space\n* declares — the standalone unclaimed-elements list, reported once for the\n* whole database.\n*/\nfunction collectExtraElementCoordinates(result, classify, classifyEntityKind) {\n\tconst seen = /* @__PURE__ */ new Map();\n\tfor (const issue of result.schema.issues) {\n\t\tif (issueOutcome(issue) !== \"not-expected\") continue;\n\t\tconst coordinate = schemaDiffIssueCoordinate(issue, classify, classifyEntityKind);\n\t\tif (coordinate === void 0) continue;\n\t\tseen.set(coordinateKey(coordinate), coordinate);\n\t}\n\treturn [...seen.values()];\n}\n//#endregion\n//#region src/aggregate/verifier.ts\n/**\n* Verify a {@link ContractSpaceAggregate} against the live database\n* state. Bundles two checks:\n*\n* - `markerCheck` per contract space: compare the live marker row against the\n*   space's `headRef.hash` + `headRef.invariants`. Absence is a\n*   distinct kind, not an error (callers — `db verify` strict vs\n*   `db init` precondition — choose how to interpret it).\n* - `schemaCheck`: two distinct outputs from the per-space diffs.\n*   `perSpace` — each space verified against the **full**\n*   introspected schema, then its extras stripped, leaving the space's\n*   declared nodes (its contract-satisfaction view; verdict is\n*   missing/mismatch only). `unclaimed` — the extras gathered\n*   across every space, deduplicated, and filtered to the names no contract\n*   space declares (via the passive aggregate's ownership query); reported\n*   once for the database. No schema is pruned before verifying.\n*\n* `markerCheck.orphanMarkers` lists every marker row whose `space` is\n* not a contract space of the aggregate. `db verify` callers reject orphans;\n* future tooling may not.\n*\n* Pure synchronous function; no I/O. The caller (CLI) gathers\n* `markersBySpaceId` and `schemaIntrospection` ahead of the call.\n*/\nfunction verifyMigration(input) {\n\ttry {\n\t\treturn runVerifyMigration(input);\n\t} catch (error) {\n\t\treturn notOk({\n\t\t\tkind: \"introspectionFailure\",\n\t\t\tdetail: error instanceof Error ? error.message : String(error)\n\t\t});\n\t}\n}\nfunction runVerifyMigration(input) {\n\tconst { aggregate, markersBySpaceId, schemaIntrospection, mode, verifySchemaForSpace, classifySubjectGranularity, classifyEntityKind } = input;\n\tconst allSpaces = [aggregate.app, ...aggregate.extensions];\n\tconst aggregateSpaceIds = new Set(allSpaces.map((m) => m.spaceId));\n\tconst markerPerSpace = /* @__PURE__ */ new Map();\n\tfor (const space of allSpaces) {\n\t\tconst marker = markersBySpaceId.get(space.spaceId) ?? null;\n\t\tif (marker === null) {\n\t\t\tmarkerPerSpace.set(space.spaceId, { kind: \"absent\" });\n\t\t\tcontinue;\n\t\t}\n\t\tconst headRef = requireHeadRef(space);\n\t\tif (marker.storageHash !== headRef.hash) {\n\t\t\tmarkerPerSpace.set(space.spaceId, {\n\t\t\t\tkind: \"hashMismatch\",\n\t\t\t\tmarkerHash: marker.storageHash,\n\t\t\t\texpected: headRef.hash\n\t\t\t});\n\t\t\tcontinue;\n\t\t}\n\t\tconst markerInvariants = new Set(marker.invariants);\n\t\tconst missing = headRef.invariants.filter((id) => !markerInvariants.has(id));\n\t\tif (missing.length > 0) {\n\t\t\tmarkerPerSpace.set(space.spaceId, {\n\t\t\t\tkind: \"missingInvariants\",\n\t\t\t\tmissing: [...missing].sort()\n\t\t\t});\n\t\t\tcontinue;\n\t\t}\n\t\tmarkerPerSpace.set(space.spaceId, { kind: \"ok\" });\n\t}\n\tconst orphanMarkers = [];\n\tfor (const [spaceId, row] of markersBySpaceId) if (row !== null && !aggregateSpaceIds.has(spaceId)) orphanMarkers.push({\n\t\tspaceId,\n\t\trow\n\t});\n\torphanMarkers.sort((a, b) => a.spaceId.localeCompare(b.spaceId));\n\tconst schemaPerSpace = /* @__PURE__ */ new Map();\n\tconst extraCoordinates = /* @__PURE__ */ new Map();\n\tfor (const space of allSpaces) {\n\t\tconst result = verifySchemaForSpace(schemaIntrospection, space, mode);\n\t\tschemaPerSpace.set(space.spaceId, stripExtraFindings(result, classifySubjectGranularity));\n\t\tfor (const coordinate of collectExtraElementCoordinates(result, classifySubjectGranularity, classifyEntityKind)) extraCoordinates.set(coordinateKey(coordinate), coordinate);\n\t}\n\tconst unclaimed = [...new Set([...extraCoordinates.values()].filter((coordinate) => !aggregate.declaresEntity(coordinate)).map((coordinate) => coordinate.entityName))].sort((a, b) => a.localeCompare(b));\n\treturn ok({\n\t\tmarkerCheck: {\n\t\t\tperSpace: markerPerSpace,\n\t\t\torphanMarkers\n\t\t},\n\t\tschemaCheck: {\n\t\t\tperSpace: schemaPerSpace,\n\t\t\tunclaimed\n\t\t}\n\t});\n}\n//#endregion\nexport { allStorageElementsExternal, buildFabricatedMigrationEdge, collectAggregateNamespaces, computeIntegrityViolations, createAggregateContractSpace, createContractSpaceAggregate, loadContractSpaceAggregate, loadProblemToViolation, planMigration, requireHeadRef, resolveRecordedPath, verifyMigration };\n\n//# sourceMappingURL=aggregate.mjs.map"],"mappings":";;;;;;;;;;;;;;;;AAgBA,SAAS,kBAAkB,MAAM,SAAS;CACzC,OAAO,GAAG,KAAK,IAAI,WAAW;AAC/B;AACA,SAAS,0BAA0B,UAAU,cAAc,qBAAqB;CAC/E,IAAI;EACH,OAAO,oBAAoB,YAAY;CACxC,SAAS,OAAO;EACf,IAAI,oBAAoB,GAAG,KAAK,GAAG,MAAM;EACzC,MAAM,mCAAmC,UAAU,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC;CAC1G;AACD;AACA,eAAe,0BAA0B,eAAe,MAAM,qBAAqB;CAClF,MAAM,eAAe,MAAM,yBAAyB,eAAe,IAAI;CACvE,OAAO;EACN;EACA,aAAa,MAAM,wBAAwB,eAAe,IAAI;EAC9D,UAAU,0BAA0B,KAAK,oBAAoB,eAAe,IAAI,GAAG,eAAe,GAAG,cAAc,mBAAmB;CACvI;AACD;AACA,eAAe,kBAAkB,MAAM;CACtC,MAAM,EAAE,MAAM,MAAM,SAAS,eAAe,UAAU,OAAO,wBAAwB;CACrF,MAAM,UAAU,MAAM;CACtB,IAAI,YAAY,KAAK,GAAG;EACvB,IAAI;EACJ,IAAI;GACH,WAAW,MAAM,QAAQ,SAAS,OAAO;EAC1C,SAAS,OAAO;GACf,IAAI,oBAAoB,GAAG,KAAK,KAAK,MAAM,SAAS,yBAAyB,WAAW,KAAK;QACxF,MAAM;EACZ;EACA,IAAI,UAAU;GACb,MAAM,EAAE,cAAc,aAAa,aAAa,MAAM,0BAA0B,eAAe,SAAS,MAAM,mBAAmB;GACjI,OAAO;IACN,MAAM,SAAS;IACf;IACA;IACA;IACA,YAAY;GACb;EACD;EACA,IAAI,YAAY,MAAM,KAAK,GAAG,OAAO,2BAA2B;GAC/D;GACA;GACA;GACA;GACA,eAAe;EAChB,CAAC;EACD,MAAM,sBAAsB,OAAO;CACpC;CACA,IAAI,YAAY,MAAM,KAAK,GAAG,OAAO,2BAA2B;EAC/D;EACA;EACA;EACA;CACD,CAAC;CACD,MAAM,oBAAoB,MAAM,KAAK;AACtC;AACA,eAAe,2BAA2B,MAAM;CAC/C,MAAM,EAAE,MAAM,eAAe,UAAU,qBAAqB,kBAAkB;CAC9E,IAAI,CAAC,SAAS,MAAM,QAAQ,IAAI,SAAS,OAAO,IAAI,GAAG,MAAM,gCAAgC,MAAM,aAAa;CAChH,MAAM,EAAE,cAAc,aAAa,aAAa,MAAM,0BAA0B,eAAe,MAAM,mBAAmB;CACxH,OAAO;EACN;EACA;EACA;EACA;EACA,YAAY;CACb;AACD;;;;;;;;;AASA,SAAS,eAAe,OAAO;CAC9B,IAAI,MAAM,YAAY,MAAM,MAAM,IAAI,cAAc,mBAAmB,MAAM,QAAQ,mGAAmG;CACxL,OAAO,MAAM;AACd;;;;;;;;;;;;;;;;AAgBA,SAAS,6BAA6B,MAAM;CAC3C,MAAM,EAAE,SAAS,UAAU,MAAM,SAAS,SAAS,eAAe,iBAAiB,wBAAwB;CAC3G,IAAI;CACJ,IAAI;CACJ,MAAM,iCAAiC,IAAI,IAAI;CAC/C,SAAS,aAAa;EACrB,cAAc,iBAAiB,QAAQ;EACvC,OAAO;CACR;CACA,OAAO;EACN;EACA;EACA;EACA;EACA,OAAO;EACP,WAAW;GACV,iBAAiB,gBAAgB;GACjC,OAAO;EACR;EACA,MAAM,WAAW,MAAM,MAAM;GAC5B,MAAM,MAAM,kBAAkB,MAAM,MAAM,OAAO;GACjD,MAAM,SAAS,eAAe,IAAI,GAAG;GACrC,IAAI,QAAQ,OAAO;GACnB,MAAM,SAAS,MAAM,kBAAkB;IACtC;IACA;IACA;IACA;IACA;IACA,OAAO,WAAW;IAClB;GACD,CAAC;GACD,eAAe,IAAI,KAAK,MAAM;GAC9B,OAAO;EACR;CACD;AACD;;;;;;;;;;;AAWA,SAAS,2BAA2B,WAAW;CAC9C,MAAM,SAAS,CAAC;CAChB,KAAK,MAAM,SAAS,UAAU,OAAO,GAAG,KAAK,MAAM,CAAC,KAAK,OAAO,OAAO,QAAQ,MAAM,SAAS,CAAC,CAAC,QAAQ,UAAU,GAAG;EACpH,MAAM,WAAW,OAAO;EACxB,OAAO,OAAO,aAAa,KAAK,IAAI,KAAK,sBAAsB,UAAU,EAAE;CAC5E;CACA,OAAO,EAAE,SAAS,EAAE,YAAY,OAAO,EAAE;AAC1C;;;;;;;;AAQA,SAAS,sBAAsB,GAAG,GAAG;CACpC,MAAM,UAAU,EAAE,GAAG,EAAE,QAAQ;CAC/B,KAAK,MAAM,CAAC,YAAY,YAAY,OAAO,QAAQ,EAAE,OAAO,GAAG,QAAQ,cAAc;EACpF,GAAG,QAAQ;EACX,GAAG;CACJ;CACA,OAAO;EACN,GAAG;EACH;CACD;AACD;;;;;;;;;AASA,SAAS,6BAA6B,MAAM;CAC3C,MAAM,EAAE,UAAU,KAAK,YAAY,mBAAmB;CACtD,MAAM,UAAU,CAAC,KAAK,GAAG,UAAU;CACnC,MAAM,OAAO,IAAI,IAAI,QAAQ,KAAK,MAAM,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;CACvD,MAAM,iBAAiB,OAAO,eAAe;EAC5C,MAAM,MAAM,cAAc,UAAU;EACpC,KAAK,MAAM,SAAS,mBAAmB,MAAM,SAAS,CAAC,CAAC,OAAO,GAAG,IAAI,cAAc,KAAK,MAAM,KAAK,OAAO;EAC3G,OAAO;CACR;CACA,OAAO;EACN;EACA;EACA;EACA,kBAAkB,QAAQ,KAAK,MAAM,EAAE,OAAO;EAC9C,WAAW,OAAO,KAAK,IAAI,EAAE;EAC7B,QAAQ,OAAO,KAAK,IAAI,EAAE;EAC1B,cAAc;EACd,iBAAiB,eAAe,QAAQ,MAAM,UAAU,cAAc,OAAO,UAAU,CAAC;EACxF,kBAAkB,eAAe,QAAQ,QAAQ,UAAU,cAAc,OAAO,UAAU,CAAC,CAAC,CAAC,KAAK,MAAM,EAAE,OAAO;EACjH;CACD;AACD;AAGA,SAAS,gBAAgB,OAAO;CAC/B,OAAO,UAAU,aAAa,UAAU,eAAe,UAAU,cAAc,UAAU;AAC1F;;;;;;;;;;;;;;AAcA,SAAS,2BAA2B,UAAU;CAC7C,KAAK,MAAM,cAAc,mBAAmB,SAAS,OAAO,GAAG;EAC9D,MAAM,SAAS,SAAS,SAAS,SAAS,UAAU;EACpD,MAAM,WAAW,WAAW,QAAQ,OAAO,WAAW,WAAW,UAAU,MAAM,CAAC,CAAC,UAAU,KAAK;EAClG,IAAI,uBAAuB,gBAAgB,QAAQ,IAAI,WAAW,KAAK,GAAG,SAAS,oBAAoB,MAAM,YAAY,OAAO;CACjI;CACA,OAAO;AACR;;;;;;;;AAUA,SAAS,2BAA2B,OAAO,MAAM;CAChD,MAAM,aAAa,CAAC;CACpB,KAAK,MAAM,EAAE,OAAO,UAAU,aAAa,gBAAgB,WAAW,MAAM,QAAQ;EACnF,MAAM,EAAE,YAAY;EACpB,KAAK,MAAM,WAAW,UAAU,WAAW,KAAK,uBAAuB,SAAS,OAAO,CAAC;EACxF,KAAK,MAAM,cAAc,aAAa,WAAW,KAAK;GACrD,MAAM;GACN;GACA,SAAS,WAAW;GACpB,QAAQ,WAAW;EACpB,CAAC;EACD,IAAI,mBAAmB,MAAM,WAAW,KAAK;GAC5C,MAAM;GACN;GACA,SAAS,eAAe;GACxB,QAAQ,eAAe;EACxB,CAAC;EACD,KAAK,MAAM,OAAO,MAAM,UAAU;GACjC,MAAM,OAAO,IAAI,SAAS,QAAQ;GAClC,MAAM,aAAa,SAAS,IAAI,SAAS;GACzC,MAAM,YAAY,IAAI,IAAI,MAAM,OAAO,GAAG,mBAAmB,MAAM;GACnE,IAAI,cAAc,CAAC,WAAW,WAAW,KAAK;IAC7C,MAAM;IACN;IACA,SAAS,IAAI;IACb,MAAM;GACP,CAAC;EACF;EACA,WAAW,KAAK,GAAG,iCAAiC,SAAS,MAAM,QAAQ,CAAC;EAC5E,IAAI,CAAC,SAAS,mBAAmB,MAC5B;OAAA,MAAM,YAAY,MAAM,WAAW,KAAK;IAC3C,MAAM;IACN;GACD,CAAC;QACI,IAAI,MAAM,SAAS,SAAS,KAAK,CAAC,sBAAsB,OAAO,MAAM,QAAQ,IAAI,GAAG,WAAW,KAAK;IACxG,MAAM;IACN;IACA,MAAM,MAAM,QAAQ;GACrB,CAAC;EAAA;CAEH;CACA,IAAI,MAAM,uBAAuB,KAAK,GAAG,WAAW,KAAK,GAAG,iBAAiB,MAAM,QAAQ,KAAK,kBAAkB,CAAC;CACnH,IAAI,MAAM,mBAAmB,MAAM,WAAW,KAAK,GAAG,mBAAmB,KAAK,CAAC;CAC/E,OAAO;AACR;AACA,SAAS,uBAAuB,SAAS,SAAS;CACjD,QAAQ,QAAQ,MAAhB;EACC,KAAK,gBAAgB,OAAO;GAC3B,MAAM;GACN;GACA,SAAS,QAAQ;GACjB,QAAQ,QAAQ;GAChB,UAAU,QAAQ;EACnB;EACA,KAAK,8BAA8B,OAAO;GACzC,MAAM;GACN;GACA,SAAS,QAAQ;EAClB;EACA,KAAK,qBAAqB,OAAO;GAChC,MAAM;GACN;GACA,SAAS,QAAQ;GACjB,QAAQ,QAAQ;EACjB;CACD;AACD;AACA,SAAS,iCAAiC,SAAS,UAAU;CAC5D,MAAM,iCAAiC,IAAI,IAAI;CAC/C,KAAK,MAAM,OAAO,UAAU;EAC3B,MAAM,OAAO,IAAI,SAAS;EAC1B,MAAM,WAAW,eAAe,IAAI,IAAI;EACxC,IAAI,UAAU,SAAS,KAAK,IAAI,OAAO;OAClC,eAAe,IAAI,MAAM,CAAC,IAAI,OAAO,CAAC;CAC5C;CACA,MAAM,MAAM,CAAC;CACb,KAAK,MAAM,CAAC,eAAe,aAAa,gBAAgB,IAAI,SAAS,SAAS,GAAG,IAAI,KAAK;EACzF,MAAM;EACN;EACA;EACA,UAAU,CAAC,GAAG,QAAQ,CAAC,CAAC,KAAK;CAC9B,CAAC;CACD,OAAO;AACR;;;;;AAKA,SAAS,sBAAsB,OAAO,UAAU;CAC/C,MAAM,QAAQ,MAAM,MAAM;CAC1B,IAAI,MAAM,MAAM,SAAS,GAAG,OAAO,aAAa;CAChD,OAAO,MAAM,MAAM,IAAI,QAAQ;AAChC;AACA,SAAS,iBAAiB,QAAQ,oBAAoB;CACrD,MAAM,MAAM,CAAC;CACb,MAAM,oBAAoB,IAAI,IAAI,OAAO,QAAQ,MAAM,CAAC,EAAE,KAAK,CAAC,CAAC,KAAK,MAAM,EAAE,MAAM,OAAO,CAAC;CAC5F,MAAM,cAAc,IAAI,IAAI,mBAAmB,KAAK,MAAM,EAAE,EAAE,CAAC;CAC/D,KAAK,MAAM,MAAM,CAAC,GAAG,iBAAiB,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,YAAY,IAAI,EAAE,GAAG,IAAI,KAAK;EAClF,MAAM;EACN,SAAS;CACV,CAAC;CACD,KAAK,MAAM,MAAM,CAAC,GAAG,WAAW,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,kBAAkB,IAAI,EAAE,GAAG,IAAI,KAAK;EAClF,MAAM;EACN,SAAS;CACV,CAAC;CACD,OAAO;AACR;AACA,SAAS,mBAAmB,OAAO;CAClC,MAAM,MAAM,CAAC;CACb,MAAM,mCAAmC,IAAI,IAAI;CACjD,MAAM,+BAA+B,IAAI,IAAI;CAC7C,KAAK,MAAM,EAAE,WAAW,MAAM,QAAQ;EACrC,IAAI;EACJ,IAAI;GACH,WAAW,MAAM,SAAS;EAC3B,SAAS,OAAO;GACf,IAAI,KAAK;IACR,MAAM;IACN,SAAS,MAAM;IACf,QAAQ,WAAW,KAAK;GACzB,CAAC;GACD;EACD;EACA,IAAI,SAAS,WAAW,MAAM,UAAU,IAAI,KAAK;GAChD,MAAM;GACN,SAAS,MAAM;GACf,UAAU,MAAM;GAChB,QAAQ,SAAS;EAClB,CAAC;EACD,KAAK,MAAM,cAAc,mBAAmB,SAAS,OAAO,GAAG;GAC9D,MAAM,MAAM,cAAc,UAAU;GACpC,MAAM,WAAW,iBAAiB,IAAI,GAAG;GACzC,IAAI,UAAU,SAAS,KAAK,MAAM,OAAO;QACpC;IACJ,iBAAiB,IAAI,KAAK,CAAC,MAAM,OAAO,CAAC;IACzC,aAAa,IAAI,KAAK,GAAG,WAAW,YAAY,GAAG,WAAW,YAAY;GAC3E;EACD;CACD;CACA,MAAM,eAAe,CAAC;CACtB,KAAK,MAAM,CAAC,KAAK,cAAc,kBAAkB,IAAI,UAAU,SAAS,GAAG;EAC1E,MAAM,UAAU,aAAa,IAAI,GAAG,KAAK;EACzC,aAAa,KAAK;GACjB,MAAM;GACN;GACA,WAAW,CAAC,GAAG,SAAS,CAAC,CAAC,KAAK;EAChC,CAAC;CACF;CACA,aAAa,MAAM,GAAG,MAAM,EAAE,SAAS,kBAAkB,EAAE,SAAS,iBAAiB,EAAE,QAAQ,cAAc,EAAE,OAAO,IAAI,CAAC;CAC3H,IAAI,KAAK,GAAG,YAAY;CACxB,OAAO;AACR;AACA,SAAS,WAAW,OAAO;CAC1B,IAAI,oBAAoB,GAAG,KAAK,GAAG,OAAO,MAAM;CAChD,IAAI,iBAAiB,OAAO,OAAO,MAAM;CACzC,OAAO,OAAO,KAAK;AACpB;AAGA,SAAS,6BAA6B,MAAM;CAC3C,OAAO;EACN,SAAS;EACT,eAAe,KAAK;EACpB,MAAM,KAAK,4BAA4B;EACvC,IAAI,KAAK;EACT,gBAAgB,KAAK;EACrB,GAAG,KAAK,4BAA4B,KAAK,IAAI,EAAE,yBAAyB,KAAK,wBAAwB,IAAI,CAAC;CAC3G;AACD;;;;;;;;;;;;;;;;;;;AAqBA,eAAe,2BAA2B,OAAO;CAChD,MAAM,EAAE,eAAe,qBAAqB,gBAAgB;CAC5D,MAAM,WAAW,YAAY;CAC7B,MAAM,WAAW,MAAM,aAAa,eAAe,aAAa,mBAAmB;CACnF,MAAM,kBAAkB,MAAM,oBAAoB,eAAe,mBAAmB;CACpF,MAAM,SAAS,CAAC,UAAU,GAAG,eAAe;CAC5C,OAAO,6BAA6B;EACnC;EACA,KAAK,SAAS;EACd,YAAY,gBAAgB,KAAK,UAAU,MAAM,KAAK;EACtD,iBAAiB,SAAS,2BAA2B;GACpD;GACA;EACD,GAAG,IAAI;CACR,CAAC;AACF;AACA,eAAe,aAAa,eAAe,aAAa,qBAAqB;CAC5E,MAAM,WAAW,wBAAwB,eAAeA,cAAY;CACpE,MAAM,EAAE,UAAU,aAAa,MAAM,kBAAkB,UAAU,EAAE,cAAc,CAAC;CAClF,MAAM,EAAE,MAAM,UAAU,gBAAgB,MAAM,iBAAiB,mBAAmB,QAAQ,CAAC;CAC3F,OAAO;EACN,OAAO,6BAA6B;GACnC,SAASA;GACT;GACA;GACA,SAAS;IACR,MAAM,YAAY,QAAQ;IAC1B,YAAY,CAAC;GACd;GACA,SAAS,mBAAmB,QAAQ;GACpC;GACA,uBAAuB;GACvB;EACD,CAAC;EACD;EACA;EACA,gBAAgB;EAChB,OAAO;CACR;AACD;AACA,eAAe,oBAAoB,eAAe,qBAAqB;CACtE,MAAM,gBAAgB,MAAM,6BAA6B,aAAa,EAAA,CAAG,QAAQ,SAAS,SAASA,cAAY,CAAC,CAAC,OAAO,cAAc,CAAC,CAAC,KAAK;CAC7I,MAAM,SAAS,CAAC;CAChB,KAAK,MAAM,WAAW,cAAc,OAAO,KAAK,MAAM,mBAAmB,eAAe,SAAS,mBAAmB,CAAC;CACrH,OAAO;AACR;AACA,eAAe,mBAAmB,eAAe,SAAS,qBAAqB;CAC9E,MAAM,WAAW,wBAAwB,eAAe,OAAO;CAC/D,MAAM,EAAE,UAAU,aAAa,MAAM,kBAAkB,UAAU,EAAE,cAAc,CAAC;CAClF,MAAM,EAAE,MAAM,UAAU,gBAAgB,MAAM,iBAAiB,mBAAmB,QAAQ,CAAC;CAC3F,MAAM,EAAE,SAAS,SAAS,mBAAmB,MAAM,oBAAoB,eAAe,OAAO;CAC7F,MAAM,cAAc,MAAM,wBAAwB,eAAe,SAAS,OAAO;CACjF,OAAO;EACN,OAAO,6BAA6B;GACnC;GACA;GACA;GACA;GACA,SAAS,mBAAmB,QAAQ;GACpC;GACA,uBAAuB,oBAAoB,YAAY,CAAC;GACxD;EACD,CAAC;EACD;EACA;EACA;EACA,OAAO;CACR;AACD;;;;;;;;;;AAUA,SAAS,4BAA4B,OAAO;CAC3C,IAAI,oBAAoB,GAAG,KAAK,GAAG,OAAO;CAC1C,IAAI,EAAE,iBAAiB,QAAQ,OAAO;CACtC,MAAM,OAAO,MAAM;CACnB,OAAO,SAAS,YAAY,SAAS;AACtC;AACA,eAAe,oBAAoB,eAAe,SAAS;CAC1D,IAAI;EACH,OAAO;GACN,SAAS,MAAM,yBAAyB,eAAe,OAAO;GAC9D,SAAS;EACV;CACD,SAAS,OAAO;EACf,IAAI,CAAC,4BAA4B,KAAK,GAAG,MAAM;EAC/C,OAAO;GACN,SAAS;GACT,SAAS;IACR,SAAS;IACT,QAAQ,SAAS,KAAK;GACvB;EACD;CACD;AACD;AACA,SAAS,SAAS,OAAO;CACxB,OAAO,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAC7D;;;;;;;;;;AAUA,eAAe,wBAAwB,eAAe,SAAS,SAAS;CACvE,IAAI,YAAY,MAAM,aAAa;EAClC,MAAM,yBAAyB,OAAO;CACvC;CACA,IAAI;EACH,MAAM,MAAM,MAAM,yBAAyB,eAAe,QAAQ,IAAI;EACtE,aAAa;CACd,SAAS,OAAO;EACf,aAAa;GACZ,MAAM;EACP;CACD;AACD;;;;;;;;;;;;;;;;;;;;;;;;;;AA4BA,eAAe,aAAa,OAAO;CAClC,MAAM,gBAAgB,MAAM,MAAM,WAAW,cAAc,MAAM,OAAO,CAAC,CAAC,KAAK;EAC9E,UAAU,MAAM,MAAM,SAAS;EAC/B,QAAQ,MAAM;EACd,QAAQ,MAAM;EACd,cAAc;EACd,qBAAqB,MAAM;EAC3B,SAAS,MAAM,MAAM;EACrB,WAAW,MAAM;EACjB,qBAAqB;CACtB,CAAC;CACD,IAAI,cAAc,SAAS,WAAW,OAAO;EAC5C,MAAM;EACN,WAAW,cAAc;CAC1B;CACA,MAAM,eAAe,cAAc;CACnC,MAAM,OAAO,IAAI,MAAM,cAAc;EACpC,IAAI,QAAQ,MAAM;GACjB,IAAI,SAAS,YAAY,OAAO,MAAM;GACtC,OAAO,QAAQ,IAAI,QAAQ,MAAM,MAAM;EACxC;EACA,IAAI,QAAQ,MAAM;GACjB,IAAI,SAAS,YAAY,OAAO;GAChC,OAAO,QAAQ,IAAI,QAAQ,IAAI;EAChC;CACD,CAAC;CACD,MAAM,yBAAyB,aAAa,YAAY;CACxD,MAAM,cAAc,MAAM,QAAQ,IAAI,aAAa,UAAU;CAC7D,MAAM,sBAAsB,MAAM,MAAM,SAAS;CACjD,OAAO;EACN,MAAM;EACN,QAAQ;GACP;GACA,YAAY;GACZ;GACA,UAAU;GACV,GAAG,cAAc,YAAY,cAAc,SAAS,SAAS,IAAI,EAAE,UAAU,cAAc,SAAS,IAAI,CAAC;GACzG,gBAAgB,CAAC,6BAA6B;IAC7C,0BAA0B,MAAM,eAAe;IAC/C;IACA,gBAAgB,YAAY;IAC5B,yBAAyB;GAC1B,CAAC,CAAC;EACH;CACD;AACD;;;;;;;;;;;;;;;;AAkBA,SAAS,oBAAoB,OAAO;CACnC,MAAM,EAAE,mBAAmB,OAAO,eAAe,YAAY;CAC7D,MAAM,UAAU,eAAe,KAAK;CACpC,MAAM,QAAQ,MAAM,MAAM;CAC1B,MAAM,0BAA0B,IAAI,IAAI,MAAM,SAAS,KAAK,QAAQ,CAAC,IAAI,SAAS,eAAe,GAAG,CAAC,CAAC;CACtG,MAAM,WAAW,eAAe,eAAe;CAC/C,MAAM,mBAAmB,IAAI,IAAI,eAAe,cAAc,CAAC,CAAC;CAChE,MAAM,WAAW,IAAI,IAAI,QAAQ,WAAW,QAAQ,OAAO,CAAC,iBAAiB,IAAI,EAAE,CAAC,CAAC;CACrF,MAAM,UAAU,qBAAqB,OAAO,UAAU,QAAQ,MAAM;EACnE;EACA,GAAG,YAAY,KAAK,IAAI,EAAE,QAAQ,IAAI,CAAC;CACxC,CAAC;CACD,IAAI,QAAQ,SAAS,eAAe,OAAO,EAAE,MAAM,cAAc;CACjE,IAAI,QAAQ,SAAS,iBAAiB,OAAO;EAC5C,MAAM;EACN,SAAS,QAAQ;CAClB;CACA,MAAM,UAAU,CAAC;CACjB,MAAM,wCAAwC,IAAI,IAAI;CACtD,MAAM,WAAW,CAAC;CAClB,KAAK,MAAM,QAAQ,QAAQ,SAAS,cAAc;EACjD,MAAM,MAAM,wBAAwB,IAAI,KAAK,aAAa;EAC1D,IAAI,CAAC,KAAK,MAAM,IAAI,cAAc,sCAAsC,KAAK,cAAc,aAAa,MAAM,QAAQ,sHAAsH;EAC5O,KAAK,MAAM,MAAM,IAAI,KAAK,QAAQ,KAAK,EAAE;EACzC,KAAK,MAAM,aAAa,IAAI,SAAS,oBAAoB,sBAAsB,IAAI,SAAS;EAC5F,SAAS,KAAK;GACb,eAAe,KAAK;GACpB,SAAS,KAAK;GACd,MAAM,KAAK;GACX,IAAI,KAAK;GACT,gBAAgB,IAAI,IAAI;GACxB,GAAG,IAAI,oBAAoB,KAAK,IAAI,EAAE,yBAAyB,IAAI,gBAAgB,IAAI,CAAC;EACzF,CAAC;CACF;CACA,OAAO;EACN,MAAM;EACN,QAAQ;GACP,MAAM;IACL,UAAU;IACV,SAAS,MAAM;IACf,QAAQ,kBAAkB,OAAO,OAAO,EAAE,aAAa,cAAc,YAAY;IACjF,aAAa,EAAE,aAAa,QAAQ,KAAK;IACzC,YAAY;IACZ,oBAAoB,CAAC,GAAG,qBAAqB,CAAC,CAAC,KAAK;GACrD;GACA,YAAY;GACZ,qBAAqB,MAAM,SAAS;GACpC,UAAU;GACV,gBAAgB;GAChB,cAAc,QAAQ;EACvB;CACD;AACD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgCA,eAAe,cAAc,OAAO;CACnC,MAAM,EAAE,WAAW,gBAAgB,iBAAiB;CACpD,MAAM,2BAA2B,IAAI,IAAI;CACzC,MAAM,gBAAgB,CAAC,GAAG,UAAU,YAAY,UAAU,GAAG;CAC7D,KAAK,MAAM,SAAS,eAAe;EAClC,MAAM,gBAAgB,eAAe,iBAAiB,IAAI,MAAM,OAAO,KAAK;EAC5E,MAAM,UAAU,eAAe,KAAK;EACpC,MAAM,cAAc,aAAa,eAAe,IAAI,MAAM,OAAO;EACjE,MAAM,qBAAqB,QAAQ,WAAW,SAAS;EACvD,IAAI,eAAe,oBAAoB,OAAO,MAAM;GACnD,MAAM;GACN,SAAS,MAAM;GACf,QAAQ,wDAAwD,MAAM,QAAQ,oEAAoE,QAAQ,WAAW,KAAK,IAAI,EAAE,8HAA8H,MAAM,QAAQ;EAC7T,CAAC;EACD,IAAI,aAAa;GAChB,MAAM,cAAc,MAAM,aAAa;IACtC,mBAAmB,UAAU;IAC7B;IACA;IACA,WAAW;IACX,qBAAqB,eAAe;IACpC,SAAS,MAAM;IACf,YAAY,MAAM;IAClB,qBAAqB,MAAM;IAC3B,iBAAiB,MAAM;GACxB,CAAC;GACD,IAAI,YAAY,SAAS,WAAW,OAAO,MAAM;IAChD,MAAM;IACN,SAAS,MAAM;IACf,WAAW,YAAY;GACxB,CAAC;GACD,SAAS,IAAI,MAAM,SAAS,YAAY,MAAM;GAC9C;EACD;EACA,IAAI,MAAM,MAAM,CAAC,CAAC,MAAM,OAAO,GAAG;GACjC,MAAM,WAAW,oBAAoB;IACpC,mBAAmB,UAAU;IAC7B;IACA;GACD,CAAC;GACD,IAAI,SAAS,SAAS,MAAM;IAC3B,SAAS,IAAI,MAAM,SAAS,SAAS,MAAM;IAC3C;GACD;GACA,IAAI,SAAS,SAAS,eAAe,OAAO,MAAM;IACjD,MAAM;IACN,SAAS,MAAM;IACf,QAAQ,QAAQ;GACjB,CAAC;GACD,OAAO,MAAM;IACZ,MAAM;IACN,SAAS,MAAM;IACf,mBAAmB,SAAS;GAC7B,CAAC;EACF;EACA,IAAI,oBAAoB,OAAO,MAAM;GACpC,MAAM;GACN,SAAS,MAAM;GACf,mBAAmB,CAAC,GAAG,QAAQ,UAAU,CAAC,CAAC,KAAK;EACjD,CAAC;EACD,IAAI,CAAC,2BAA2B,MAAM,SAAS,CAAC,GAAG,OAAO,MAAM;GAC/D,MAAM;GACN,SAAS,MAAM;GACf,QAAQ,QAAQ;EACjB,CAAC;EACD,SAAS,IAAI,MAAM,SAAS;GAC3B,MAAM;IACL,UAAU,UAAU;IACpB,SAAS,MAAM;IACf,QAAQ,kBAAkB,OAAO,OAAO,EAAE,aAAa,cAAc,YAAY;IACjF,aAAa,EAAE,aAAa,QAAQ,KAAK;IACzC,YAAY,CAAC;GACd;GACA,YAAY,CAAC;GACb,qBAAqB,MAAM,SAAS;GACpC,UAAU;GACV,gBAAgB,CAAC,6BAA6B;IAC7C,0BAA0B,eAAe;IACzC,wBAAwB,QAAQ;IAChC,gBAAgB;GACjB,CAAC,CAAC;EACH,CAAC;CACF;CACA,OAAO,GAAG;EACT;EACA,YAAY,CAAC,GAAG,UAAU,WAAW,KAAK,MAAM,EAAE,OAAO,GAAG,UAAU,IAAI,OAAO;CAClF,CAAC;AACF;AACA,SAAS,YAAY,MAAM,QAAQ;CAClC,IAAI,KAAK,SAAS,OAAO,QAAQ,OAAO;CACxC,OAAO,OAAO,OAAO,SAAS,MAAM,KAAK,OAAO,OAAO;AACxD;;;;;;;;;;;AAWA,SAAS,mBAAmB,OAAO,UAAU;CAC5C,MAAM,cAAc,WAAW,KAAK;CACpC,IAAI,gBAAgB,KAAK,GAAG,OAAO,gBAAgB;CACnD,OAAO,MAAM,KAAK,WAAW;AAC9B;;;;;;;;;;;;;;;;AAgBA,SAAS,mBAAmB,QAAQ,UAAU;CAC7C,MAAM,oBAAoB,OAAO,OAAO,OAAO,QAAQ,UAAU,aAAa,KAAK,MAAM,kBAAkB,mBAAmB,OAAO,QAAQ,CAAC,CAAC,CAAC,KAAK,UAAU,MAAM,IAAI;CACzK,MAAM,SAAS,OAAO,OAAO,OAAO,QAAQ,UAAU;EACrD,IAAI,aAAa,KAAK,MAAM,gBAAgB,OAAO;EACnD,IAAI,WAAW,KAAK,MAAM,cAAc,OAAO;EAC/C,OAAO,CAAC,kBAAkB,MAAM,WAAW,YAAY,MAAM,MAAM,MAAM,CAAC;CAC3E,CAAC;CACD,IAAI,OAAO,WAAW,OAAO,OAAO,OAAO,QAAQ,OAAO;CAC1D,MAAM,KAAK,OAAO,WAAW;CAC7B,MAAM,EAAE,MAAM,WAAW,GAAG,aAAa;CACzC,OAAO;EACN,GAAG;EACH;EACA,GAAG,KAAK,CAAC,IAAI,EAAE,MAAM,OAAO,QAAQ,2BAA2B;EAC/D,SAAS,KAAK,uCAAuC,OAAO;EAC5D,QAAQ;GACP;GACA,GAAG,OAAO,OAAO,aAAa,KAAK,IAAI,EAAE,UAAU,OAAO,OAAO,SAAS,IAAI,CAAC;EAChF;CACD;AACD;;;;;;;;;;;;;;;;;;;;;;;;AAwBA,SAAS,0BAA0B,OAAO,UAAU,oBAAoB;CACvE,IAAI,CAAC,mBAAmB,OAAO,QAAQ,GAAG,OAAO,KAAK;CACtD,MAAM,aAAa,MAAM,KAAK,MAAM,KAAK,SAAS;CAClD,IAAI,eAAe,KAAK,GAAG,OAAO,KAAK;CACvC,OAAO;EACN,aAAa,MAAM,KAAK,WAAW,IAAI,MAAM,KAAK,MAAM,uBAAuB;EAC/E,YAAY,qBAAqB,KAAK,KAAK;EAC3C;CACD;AACD;;;;;;;;AAQA,SAAS,+BAA+B,QAAQ,UAAU,oBAAoB;CAC7E,MAAM,uBAAuB,IAAI,IAAI;CACrC,KAAK,MAAM,SAAS,OAAO,OAAO,QAAQ;EACzC,IAAI,aAAa,KAAK,MAAM,gBAAgB;EAC5C,MAAM,aAAa,0BAA0B,OAAO,UAAU,kBAAkB;EAChF,IAAI,eAAe,KAAK,GAAG;EAC3B,KAAK,IAAI,cAAc,UAAU,GAAG,UAAU;CAC/C;CACA,OAAO,CAAC,GAAG,KAAK,OAAO,CAAC;AACzB;;;;;;;;;;;;;;;;;;;;;;;;;AA2BA,SAAS,gBAAgB,OAAO;CAC/B,IAAI;EACH,OAAO,mBAAmB,KAAK;CAChC,SAAS,OAAO;EACf,OAAO,MAAM;GACZ,MAAM;GACN,QAAQ,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;EAC9D,CAAC;CACF;AACD;AACA,SAAS,mBAAmB,OAAO;CAClC,MAAM,EAAE,WAAW,kBAAkB,qBAAqB,MAAM,sBAAsB,4BAA4B,uBAAuB;CACzI,MAAM,YAAY,CAAC,UAAU,KAAK,GAAG,UAAU,UAAU;CACzD,MAAM,oBAAoB,IAAI,IAAI,UAAU,KAAK,MAAM,EAAE,OAAO,CAAC;CACjE,MAAM,iCAAiC,IAAI,IAAI;CAC/C,KAAK,MAAM,SAAS,WAAW;EAC9B,MAAM,SAAS,iBAAiB,IAAI,MAAM,OAAO,KAAK;EACtD,IAAI,WAAW,MAAM;GACpB,eAAe,IAAI,MAAM,SAAS,EAAE,MAAM,SAAS,CAAC;GACpD;EACD;EACA,MAAM,UAAU,eAAe,KAAK;EACpC,IAAI,OAAO,gBAAgB,QAAQ,MAAM;GACxC,eAAe,IAAI,MAAM,SAAS;IACjC,MAAM;IACN,YAAY,OAAO;IACnB,UAAU,QAAQ;GACnB,CAAC;GACD;EACD;EACA,MAAM,mBAAmB,IAAI,IAAI,OAAO,UAAU;EAClD,MAAM,UAAU,QAAQ,WAAW,QAAQ,OAAO,CAAC,iBAAiB,IAAI,EAAE,CAAC;EAC3E,IAAI,QAAQ,SAAS,GAAG;GACvB,eAAe,IAAI,MAAM,SAAS;IACjC,MAAM;IACN,SAAS,CAAC,GAAG,OAAO,CAAC,CAAC,KAAK;GAC5B,CAAC;GACD;EACD;EACA,eAAe,IAAI,MAAM,SAAS,EAAE,MAAM,KAAK,CAAC;CACjD;CACA,MAAM,gBAAgB,CAAC;CACvB,KAAK,MAAM,CAAC,SAAS,QAAQ,kBAAkB,IAAI,QAAQ,QAAQ,CAAC,kBAAkB,IAAI,OAAO,GAAG,cAAc,KAAK;EACtH;EACA;CACD,CAAC;CACD,cAAc,MAAM,GAAG,MAAM,EAAE,QAAQ,cAAc,EAAE,OAAO,CAAC;CAC/D,MAAM,iCAAiC,IAAI,IAAI;CAC/C,MAAM,mCAAmC,IAAI,IAAI;CACjD,KAAK,MAAM,SAAS,WAAW;EAC9B,MAAM,SAAS,qBAAqB,qBAAqB,OAAO,IAAI;EACpE,eAAe,IAAI,MAAM,SAAS,mBAAmB,QAAQ,0BAA0B,CAAC;EACxF,KAAK,MAAM,cAAc,+BAA+B,QAAQ,4BAA4B,kBAAkB,GAAG,iBAAiB,IAAI,cAAc,UAAU,GAAG,UAAU;CAC5K;CACA,MAAM,YAAY,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,iBAAiB,OAAO,CAAC,CAAC,CAAC,QAAQ,eAAe,CAAC,UAAU,eAAe,UAAU,CAAC,CAAC,CAAC,KAAK,eAAe,WAAW,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,cAAc,CAAC,CAAC;CACzM,OAAO,GAAG;EACT,aAAa;GACZ,UAAU;GACV;EACD;EACA,aAAa;GACZ,UAAU;GACV;EACD;CACD,CAAC;AACF"}