@tapedb/tapedb 0.0.0-stage → 0.1.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/API.md +301 -0
- package/LICENSE +21 -0
- package/LIMITATIONS.md +34 -0
- package/PRIVACY.md +119 -0
- package/README.md +720 -2
- package/RELEASING.md +117 -0
- package/SECURITY.md +121 -0
- package/dist/chunk-3AL32Q4K.js +241 -0
- package/dist/chunk-3AL32Q4K.js.map +1 -0
- package/dist/chunk-CYDXFAEB.js +33 -0
- package/dist/chunk-CYDXFAEB.js.map +1 -0
- package/dist/chunk-UYZJAMBR.js +27 -0
- package/dist/chunk-UYZJAMBR.js.map +1 -0
- package/dist/chunk-VWW5OS5B.js +841 -0
- package/dist/chunk-VWW5OS5B.js.map +1 -0
- package/dist/cli.d.ts +44 -0
- package/dist/cli.js +1501 -0
- package/dist/cli.js.map +1 -0
- package/dist/client-DgSnn9BE.d.ts +646 -0
- package/dist/index.d.ts +24 -0
- package/dist/index.js +3007 -0
- package/dist/index.js.map +1 -0
- package/dist/react.d.ts +41 -0
- package/dist/react.js +59 -0
- package/dist/react.js.map +1 -0
- package/dist/schema-CVcGZJfR.d.ts +691 -0
- package/dist/schema-entry-CpO_IGFv.d.ts +522 -0
- package/dist/schema.d.ts +2 -0
- package/dist/schema.js +22 -0
- package/dist/schema.js.map +1 -0
- package/dist/worker.d.ts +437 -0
- package/dist/worker.js +9270 -0
- package/dist/worker.js.map +1 -0
- package/package.json +93 -4
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"sources":["../src/model/fields.ts","../src/client/schema.ts","../src/schema.ts","../src/model/where.ts","../src/model/schema.ts"],"sourcesContent":["/**\n * Field and relation builders: the `t` in `model({ title: t.string() })`.\n *\n * Every builder is immutable: a modifier returns a new builder, so a shared\n * base field cannot be changed by one model's `.optional()`. The type\n * parameters carry what the client needs to infer rows and inputs.\n */\n\nexport type ScalarKind = \"string\" | \"number\" | \"boolean\" | \"date\" | \"json\";\n\n/** The TypeScript type a stored value comes back as. */\nexport interface KindOutput {\n string: string;\n number: number;\n boolean: boolean;\n /** Epoch milliseconds. */\n date: number;\n json: unknown;\n}\n\n/** What a write accepts for each kind. */\nexport interface KindInput {\n string: string;\n number: number;\n boolean: boolean;\n date: number | Date | string;\n json: unknown;\n}\n\nexport type DeleteBehaviour = \"setNull\" | \"cascade\" | \"restrict\";\n\nexport class Field<\n K extends ScalarKind = ScalarKind,\n O extends boolean = boolean,\n D extends boolean = boolean,\n> {\n readonly tag = \"field\" as const;\n\n constructor(\n readonly kind: K,\n readonly isOptional: O,\n readonly hasDefault: D,\n readonly defaultValue: unknown = undefined,\n readonly isIndexed = false,\n readonly isUnique = false\n ) {}\n\n /** Encrypt this value under the named subject's erasable key. */\n personal(this: Field<K, O, D> & (K extends \"string\" | \"json\" ? unknown : never), options: { subject: string }): PersonalField<Extract<K, \"string\" | \"json\">, O, D> {\n if (this.isIndexed || this.isUnique) throw new Error(\"Personal fields cannot be indexed or unique.\");\n if (!options.subject) throw new Error(\"A personal field needs its subject field, or self.\");\n return new PersonalField(this.kind as Extract<K, \"string\" | \"json\">, this.isOptional, this.hasDefault, options.subject, this.defaultValue);\n }\n\n /** The field may be null, and may be left out of `create`. */\n optional(): Field<K, true, D> {\n return new Field(this.kind, true, this.hasDefault, this.defaultValue, this.isIndexed, this.isUnique);\n }\n\n /** Filled in by `create` when the field is left out. */\n default(value: KindInput[K]): Field<K, O, true> {\n return new Field(this.kind, this.isOptional, true, value, this.isIndexed, this.isUnique);\n }\n\n /** Adds an index, for filters and sorts on this field. */\n index(): Field<K, O, D> {\n return new Field(this.kind, this.isOptional, this.hasDefault, this.defaultValue, true, this.isUnique);\n }\n\n /** Adds a unique index. */\n unique(): Field<K, O, D> {\n return new Field(this.kind, this.isOptional, this.hasDefault, this.defaultValue, this.isIndexed, true);\n }\n}\n\nexport class PersonalField<K extends \"string\" | \"json\" = \"string\" | \"json\", O extends boolean = boolean, D extends boolean = boolean> extends Field<K, O, D> {\n constructor(kind: K, optional: O, hasDefault: D, readonly personalSubject: string, defaultValue?: unknown) {\n super(kind, optional, hasDefault, defaultValue);\n }\n override optional(): PersonalField<K, true, D> { return new PersonalField(this.kind, true, this.hasDefault, this.personalSubject, this.defaultValue); }\n override default(value: KindInput[K]): PersonalField<K, O, true> { return new PersonalField(this.kind, this.isOptional, true, this.personalSubject, value); }\n override index(this: never): never { throw new Error(\"Personal fields cannot be indexed.\"); }\n override unique(this: never): never { throw new Error(\"Personal fields cannot be unique.\"); }\n}\n\nexport interface BelongsToOptions {\n /** What happens to this row when the row it points at is deleted. Default `setNull`. */\n onDelete?: DeleteBehaviour;\n}\n\n/**\n * This model holds the foreign key. A field `board` stores `boardId`.\n */\nexport class BelongsTo<T extends string = string, O extends boolean = boolean> {\n readonly tag = \"belongsTo\" as const;\n\n constructor(\n readonly target: T,\n readonly isOptional: O,\n readonly onDelete: DeleteBehaviour = \"setNull\"\n ) {}\n\n /** The key may be null: the row can exist without a parent. */\n optional(): BelongsTo<T, true> {\n return new BelongsTo(this.target, true, this.onDelete);\n }\n}\n\nexport interface HasManyOptions {\n /**\n * The `belongsTo` field on the target that points back here. Needed only\n * when the target has more than one `belongsTo` to this model.\n */\n inverse?: string;\n}\n\n/** The inverse of a `belongsTo`. Stores nothing; named in `include`. */\nexport class HasMany<T extends string = string> {\n readonly tag = \"hasMany\" as const;\n\n constructor(\n readonly target: T,\n readonly inverse?: string\n ) {}\n}\n\nexport type AnyField = Field<ScalarKind, boolean, boolean>;\nexport type ModelMember = AnyField | BelongsTo | HasMany;\n\nexport const t = {\n string: () => new Field(\"string\", false, false),\n number: () => new Field(\"number\", false, false),\n boolean: () => new Field(\"boolean\", false, false),\n /** Stored as epoch milliseconds; accepts a `Date`, milliseconds or an ISO string. */\n date: () => new Field(\"date\", false, false),\n /** Any JSON value. Not filterable or sortable. */\n json: () => new Field(\"json\", false, false),\n belongsTo: <T extends string>(target: T, options: BelongsToOptions = {}) =>\n new BelongsTo(target, false, options.onDelete ?? \"setNull\"),\n hasMany: <T extends string>(target: T, options: HasManyOptions = {}) =>\n new HasMany(target, options.inverse),\n};\n","/**\n * The client's copy of the schema: entities and links keyed by label.\n *\n * `schema()` builds it so the runtime can resolve a relation label to its\n * engine link. Internal: the public schema API is `schema()` / `model()` / `t`.\n */\n\nimport type {\n AttributeDefinition,\n AttributeType,\n EntityDefinition,\n LinkDefinition,\n SchemaDefinition,\n} from \"./types\";\n\ninterface AttributeFlags {\n optional?: boolean;\n indexed?: boolean;\n unique?: boolean;\n}\n\nfunction createAttribute<T>(\n type: AttributeType,\n flags: AttributeFlags = {}\n): AttributeDefinition<T> {\n return {\n type,\n isOptional: flags.optional ?? false,\n isIndexed: flags.indexed ?? false,\n isUnique: flags.unique ?? false,\n optional() {\n return createAttribute<T>(type, { ...flags, optional: true });\n },\n indexed() {\n return createAttribute<T>(type, { ...flags, indexed: true });\n },\n unique() {\n return createAttribute<T>(type, { ...flags, unique: true });\n },\n };\n}\n\nexport function entity<\n TAttrs extends Record<string, AttributeDefinition<unknown>>,\n>(attrs: TAttrs): EntityDefinition {\n return { type: \"entity\", attrs };\n}\n\nexport function schema(definition: SchemaDefinition): SchemaDefinition {\n return definition;\n}\n\n/** Internal builders for the client schema. */\nexport const i = {\n schema,\n entity,\n string: (): AttributeDefinition<string> => createAttribute<string>(\"string\"),\n number: (): AttributeDefinition<number> => createAttribute<number>(\"number\"),\n boolean: (): AttributeDefinition<boolean> =>\n createAttribute<boolean>(\"boolean\"),\n date: (): AttributeDefinition<Date> => createAttribute<Date>(\"date\"),\n json: <T = unknown>(): AttributeDefinition<T> => createAttribute<T>(\"json\"),\n any: <T = unknown>(): AttributeDefinition<T> => createAttribute<T>(\"any\"),\n} as const;\n\nexport type I = typeof i;\n\nexport interface ResolvedLink {\n apiName: string;\n direction: \"forward\" | \"reverse\";\n forward: LinkDefinition[\"forward\"];\n reverse: LinkDefinition[\"reverse\"];\n}\n\n/**\n * Resolves the label used in `tx[namespace][id].link({ label: targetId })`\n * to the registered engine link api name.\n *\n * The schema declares both sides of a link; a label is only valid on the\n * namespace named by that side's `on`.\n */\nexport function resolveLink(\n definition: SchemaDefinition | undefined,\n namespace: string,\n label: string\n): ResolvedLink {\n if (!definition) {\n throw new Error(\n \"tapedb-data: link/unlink requires init({ schema }) so the link label can be resolved.\"\n );\n }\n\n for (const [apiName, link] of Object.entries(definition.links)) {\n if (link.forward.on === namespace && link.forward.label === label) {\n return {\n apiName,\n direction: \"forward\",\n forward: link.forward,\n reverse: link.reverse,\n };\n }\n if (link.reverse.on === namespace && link.reverse.label === label) {\n return {\n apiName,\n direction: \"reverse\",\n forward: link.forward,\n reverse: link.reverse,\n };\n }\n }\n\n throw new Error(\n `tapedb-data: unknown link label \"${label}\" on namespace \"${namespace}\".`\n );\n}\n\n/** Looks up a link by the engine api name (used for optimistic cache edits). */\nexport function findLinkByApiName(\n definition: SchemaDefinition | undefined,\n apiName: string\n): LinkDefinition | undefined {\n return definition?.links[apiName];\n}\n","/**\n * One schema, two artifacts.\n *\n * `defineSchema()` is the single source of truth. It produces:\n *\n * - the server registry (namespaces + links) that the engine compiles\n * queries and validates transactions against,\n * - the SQL migrations that create those tables,\n * - the client schema that resolves link labels.\n *\n * A deployment writes the entity map once; the CLI emits the migration bundle\n * from the same object, so the two can never drift.\n */\n\nimport type { FileRules } from \"./engine/file-access\";\nimport { ENGINE_TABLES, toSnakeCase } from \"./engine/registry\";\nimport type {\n AttributeDefinition,\n LinkDefinition,\n NamespaceDefinition,\n RegistryDefinition,\n} from \"./engine/registry\";\nimport {\n BASELINE_MIGRATION_ID,\n ENGINE_MIGRATIONS,\n type BundledWorkspaceMigration,\n} from \"./engine/migrations-bundle\";\nimport { assertDecisionShape } from \"./engine/permission-shape\";\nimport type {\n PermissionConfig,\n PermissionOverrides,\n} from \"./engine/tx-permissions\";\nimport type { WorkspaceRole } from \"./claims\";\nimport { i } from \"./client/schema\";\nimport type {\n LinkDefinition as ClientLinkDefinition,\n SchemaDefinition as ClientSchemaDefinition,\n} from \"./client/types\";\n\nexport interface EntityConfig {\n [attribute: string]: AttributeDefinition;\n}\n\nexport interface SchemaConfig {\n entities: Record<string, EntityConfig>;\n links?: readonly LinkDefinition[];\n /**\n * Per-namespace overrides; defaults are view=MEMBER, write=EDITOR,\n * delete=MODERATOR. Each action takes a role level or a rule function;\n * `view` also takes `{ where: (auth) => filter }`, which runs in SQL.\n */\n permissions?: PermissionOverrides;\n /** Table name per namespace, for mapping onto existing tables. Default: snake_case. */\n tables?: Record<string, string>;\n}\n\nexport interface TapeDBSchema {\n registry: RegistryDefinition;\n permissions: PermissionConfig;\n migrations: BundledWorkspaceMigration[];\n clientSchema: ClientSchemaDefinition;\n /** Who may read, write and delete each file; absent means the role defaults. */\n files?: FileRules;\n}\n\n/**\n * Engine bookkeeping tables. Copied verbatim from the engine's baseline\n * migration: the transaction pipeline, flusher and recovery all depend on\n * these exact names and columns.\n *\n * FROZEN. Deployed workspaces recorded this text's checksum when they applied\n * 0001_baseline and refuse to boot if it changes. Engine schema changes go in\n * ENGINE_MIGRATIONS instead; that is why the file table is created here under\n * its old name and renamed by tapedb_0002_files_table.\n */\nconst ENGINE_TABLE_DDL = `\nCREATE TABLE IF NOT EXISTS \"_migrations\" (\n id TEXT PRIMARY KEY NOT NULL,\n checksum TEXT NOT NULL,\n applied_at INTEGER NOT NULL\n);\n\nCREATE TABLE IF NOT EXISTS \"_tx_log\" (\n seq INTEGER PRIMARY KEY AUTOINCREMENT,\n client_tx_id TEXT UNIQUE,\n ops TEXT NOT NULL,\n ops_hash TEXT NOT NULL,\n user_id TEXT,\n role INTEGER,\n at INTEGER NOT NULL,\n schema_version TEXT NOT NULL\n);\n\nCREATE TABLE IF NOT EXISTS \"_tx_state\" (\n id INTEGER PRIMARY KEY CHECK (id = 1),\n high_water_seq INTEGER NOT NULL DEFAULT 0\n);\n\nCREATE TABLE IF NOT EXISTS \"_flush_state\" (\n id INTEGER PRIMARY KEY CHECK (id = 1),\n last_seq INTEGER NOT NULL DEFAULT 0,\n attempts INTEGER NOT NULL DEFAULT 0,\n next_attempt_at INTEGER,\n last_error TEXT,\n last_flush_at INTEGER,\n last_segment_from INTEGER,\n updated_at INTEGER NOT NULL\n);\n\nCREATE TABLE IF NOT EXISTS \"_snapshot_state\" (\n id INTEGER PRIMARY KEY CHECK (id = 1),\n base_seq INTEGER NOT NULL DEFAULT 0,\n status TEXT NOT NULL DEFAULT 'idle',\n started_at INTEGER,\n completed_at INTEGER,\n manifest_key TEXT\n);\n\nCREATE TABLE IF NOT EXISTS \"_engine_meta\" (\n \"key\" TEXT PRIMARY KEY NOT NULL,\n value TEXT NOT NULL\n);\n\nCREATE TABLE IF NOT EXISTS \"$files\" (\n id TEXT PRIMARY KEY NOT NULL,\n path TEXT NOT NULL UNIQUE,\n r2_key TEXT NOT NULL,\n size INTEGER NOT NULL,\n content_type TEXT,\n created_at INTEGER NOT NULL,\n updated_at INTEGER NOT NULL\n);\n\nINSERT OR IGNORE INTO \"_tx_state\" (id, high_water_seq) VALUES (1, 0);\nINSERT OR IGNORE INTO \"_flush_state\" (id, last_seq, attempts, updated_at)\n VALUES (1, 0, 0, 0);\nINSERT OR IGNORE INTO \"_snapshot_state\" (id, base_seq, status)\n VALUES (1, 0, 'idle');\nINSERT OR IGNORE INTO \"_engine_meta\" (\"key\", value) VALUES\n ('engine_version', '1'),\n ('schema_version', '0001_baseline');\n`;\n\nexport const SQL_TYPE: Record<string, string> = {\n string: \"TEXT\",\n json: \"TEXT\",\n date: \"INTEGER\",\n any: \"TEXT\",\n number: \"REAL\",\n boolean: \"INTEGER\",\n};\n\n/** A SQL literal for a column default. Numbers must be finite; strings are quoted. */\nexport function sqlLiteral(value: string | number | null): string {\n if (value === null) return \"NULL\";\n if (typeof value === \"number\") {\n if (!Number.isFinite(value)) throw new Error(`Default ${value} is not a finite number.`);\n return String(value);\n }\n return `'${value.replace(/'/g, \"''\")}'`;\n}\n\n/** CREATE TABLE plus its indexes, for one namespace. Shared with `tapedb migrate`. */\nexport function entityDdl(\n namespace: NamespaceDefinition,\n attributes: EntityConfig\n): string[] {\n const columns: string[] = [\n `\"id\" TEXT PRIMARY KEY NOT NULL`,\n `\"created_at\" INTEGER NOT NULL`,\n `\"updated_at\" INTEGER NOT NULL`,\n `\"updated_seq\" INTEGER NOT NULL DEFAULT 0`,\n ];\n\n for (const [name, attribute] of Object.entries(attributes)) {\n const column = toSnakeCase(name);\n let sql = `\"${column}\" ${SQL_TYPE[attribute.type] ?? \"TEXT\"}`;\n if (attribute.default !== undefined) sql += ` DEFAULT ${sqlLiteral(attribute.default)}`;\n if (attribute.references) {\n const onDelete = attribute.references.onDelete ?? \"SET NULL\";\n sql += ` REFERENCES \"${attribute.references.table}\"(\"${attribute.references.column}\") ON DELETE ${onDelete}`;\n }\n columns.push(sql);\n }\n\n const statements = [\n `CREATE TABLE IF NOT EXISTS \"${namespace.table}\" (\\n ${columns.join(\",\\n \")}\\n);`,\n ];\n\n for (const [name, attribute] of Object.entries(attributes)) {\n if (!attribute.indexed && !attribute.unique) continue;\n const column = toSnakeCase(name);\n const unique = attribute.unique ? \"UNIQUE \" : \"\";\n statements.push(\n `CREATE ${unique}INDEX IF NOT EXISTS \"${namespace.table}_${column}_idx\" ON \"${namespace.table}\" (\"${column}\");`\n );\n }\n\n return statements;\n}\n\nfunction clientLink(link: LinkDefinition): ClientLinkDefinition {\n return {\n forward: {\n on: link.foreignKey.attribute,\n has: link.forward.has,\n label: link.forward.label,\n },\n reverse: {\n on: link.foreignKey.attribute,\n has: link.reverse.has,\n label: link.reverse.label,\n },\n };\n}\n\nexport function defineSchema(config: SchemaConfig): TapeDBSchema {\n for (const [namespace, actions] of Object.entries(config.permissions ?? {})) {\n if (!config.entities[namespace]) {\n throw new Error(\n `Permissions reference unknown namespace \"${namespace}\".`\n );\n }\n for (const [action, decision] of Object.entries(actions ?? {})) {\n assertDecisionShape(namespace, action, decision);\n }\n }\n\n const namespaces: NamespaceDefinition[] = Object.entries(config.entities).map(\n ([apiName, attributes]) => ({\n apiName,\n table: config.tables?.[apiName] ?? toSnakeCase(apiName),\n attributes,\n })\n );\n\n const links = config.links ?? [];\n\n for (const link of links) {\n // The foreign key lives on `link.foreignKey.namespace`; it points at the\n // other side of the link.\n const owner = namespaces.find(\n (namespace) => namespace.apiName === link.foreignKey.namespace\n );\n if (!owner) {\n throw new Error(\n `Link \"${link.apiName}\" points at unknown namespace \"${link.foreignKey.namespace}\".`\n );\n }\n const attribute = owner.attributes[link.foreignKey.attribute] as\n | AttributeDefinition\n | undefined;\n if (!attribute) {\n throw new Error(\n `Link \"${link.apiName}\" needs \"${link.foreignKey.namespace}.${link.foreignKey.attribute}\", which the schema does not define.`\n );\n }\n\n const target =\n link.forward.namespace === owner.apiName\n ? link.reverse.namespace\n : link.forward.namespace;\n\n attribute.references = {\n table: config.tables?.[target] ?? toSnakeCase(target),\n column: \"id\",\n onDelete: attribute.references?.onDelete ?? \"SET NULL\",\n };\n }\n\n const entityStatements: string[] = [];\n for (const namespace of namespaces) {\n entityStatements.push(\n ...entityDdl(namespace, config.entities[namespace.apiName] ?? {})\n );\n }\n\n const migrations: BundledWorkspaceMigration[] = [\n { id: BASELINE_MIGRATION_ID, sql: ENGINE_TABLE_DDL.trim() },\n ...ENGINE_MIGRATIONS,\n {\n id: \"0002_entities\",\n sql: entityStatements.join(\"\\n\\n\"),\n },\n ];\n\n const clientEntities: Record<string, ReturnType<typeof i.entity>> = {};\n for (const [apiName, attributes] of Object.entries(config.entities)) {\n const mapped: Record<string, unknown> = {};\n for (const [name, attribute] of Object.entries(attributes)) {\n const builder = i[attribute.type] ?? i.any;\n let value = (builder as () => unknown)();\n const flags = value as {\n optional(): unknown;\n indexed(): unknown;\n unique(): unknown;\n };\n if (attribute.optional) value = flags.optional();\n if (attribute.indexed) value = (value as typeof flags).indexed();\n if (attribute.unique) value = (value as typeof flags).unique();\n mapped[name] = value;\n }\n clientEntities[apiName] = i.entity(mapped as never);\n }\n\n const clientLinks: Record<string, ClientLinkDefinition> = {};\n for (const link of links) clientLinks[link.apiName] = clientLink(link);\n\n return {\n registry: { namespaces, links },\n permissions: { overrides: config.permissions ?? {} },\n migrations,\n clientSchema: i.schema({ entities: clientEntities, links: clientLinks }),\n };\n}\n\n// The model API. `defineSchema` above stays as the engine-level compiler that\n// `schema()` builds on.\nexport { t } from \"./model/fields\";\nexport type { DeleteBehaviour, ScalarKind } from \"./model/fields\";\nexport { schema, model, role, filter, check, fileCheck, attachedTo, Model } from \"./model/schema\";\nexport type {\n ModelOptions,\n Access,\n AccessAuth,\n FileAccess,\n FileCheckContext,\n FileInfo,\n CheckContext,\n CreateData,\n Include,\n OrderBy,\n Row,\n Schema,\n UpdateData,\n} from \"./model/schema\";\nexport type { Where, FieldFilter } from \"./model/where\";\n","/**\n * Public filters, ordering and includes, translated into the engine's query\n * document.\n *\n * The public shape is `{ title: \"x\", due: { lt: now }, OR: [...] }`; the engine\n * reads `{ title: \"x\", due: { $lt: now }, $or: [...] }`. The translation is\n * strict: an unknown field, operator or relation is an error here rather than\n * a filter the engine silently drops.\n */\n\nimport type { QueryWhere } from \"../engine/query-types\";\nimport type { HasMany } from \"./fields\";\nimport type {\n BelongsToKeys,\n FilterKeys,\n Fields,\n HasManyKeys,\n ModelInfo,\n Models,\n RelationKeys,\n TargetFieldsOf,\n} from \"./schema\";\n\ntype Scalar = string | number | boolean | null | Date;\n\nexport interface FieldFilter<T = Scalar> {\n equals?: T;\n not?: T | FieldFilter<T>;\n in?: T[];\n notIn?: T[];\n gt?: T;\n gte?: T;\n lt?: T;\n lte?: T;\n}\n\n/** Filters on a to-many relation: at least one, all, or no related row. */\nexport interface ManyFilter<W> {\n some?: W;\n every?: W;\n none?: W;\n}\n\n/**\n * Filters, typed at every depth. Relation keys resolve lazily, as property\n * types of a mapped object, so models that point at each other (boards hold\n * columns hold boards) are unfolded only as far as a filter actually goes.\n */\ntype Scalars<F extends Fields> = {\n [K in FilterKeys<F> | { [P in keyof F]: F[P] extends { personalSubject: string } ? P : never }[keyof F]]?: K extends FilterKeys<F> ? Scalar | FieldFilter : never;\n};\n\nexport type Where<F extends Fields = Fields, M extends Models = Models> = Scalars<F> & {\n [K in RelationKeys<F>]?: F[K] extends HasMany\n ? ManyFilter<Where<TargetFieldsOf<F[K], M>, M>>\n : Where<TargetFieldsOf<F[K], M>, M> | null;\n} & {\n AND?: Where<F, M> | Where<F, M>[];\n OR?: Where<F, M>[];\n NOT?: Where<F, M> | Where<F, M>[];\n};\n\nconst OPERATORS: Record<string, string> = {\n in: \"$in\",\n notIn: \"$nin\",\n gt: \"$gt\",\n gte: \"$gte\",\n lt: \"$lt\",\n lte: \"$lte\",\n};\n\ntype EngineWhere = Record<string, unknown>;\n\nfunction scalar(value: unknown): unknown {\n return value instanceof Date ? value.getTime() : value;\n}\n\nfunction isFilterObject(value: unknown): value is Record<string, unknown> {\n return (\n typeof value === \"object\" &&\n value !== null &&\n !Array.isArray(value) &&\n !(value instanceof Date)\n );\n}\n\nfunction asList<T>(value: T | T[]): T[] {\n return Array.isArray(value) ? value : [value];\n}\n\n/** One field's filter, as engine conditions to AND together. */\nfunction fieldConditions(field: string, value: unknown): EngineWhere[] {\n if (!isFilterObject(value)) return [{ [field]: scalar(value) }];\n\n const comparison: Record<string, unknown> = {};\n const extra: EngineWhere[] = [];\n for (const [operator, operand] of Object.entries(value)) {\n if (operand === undefined) continue;\n if (operator === \"equals\") {\n extra.push({ [field]: scalar(operand) });\n } else if (operator === \"not\") {\n if (isFilterObject(operand)) {\n const inner = fieldConditions(field, operand);\n extra.push({ $not: inner.length === 1 ? inner[0] : { $and: inner } });\n } else {\n comparison.$ne = scalar(operand);\n }\n } else if (operator in OPERATORS) {\n comparison[OPERATORS[operator]] = Array.isArray(operand)\n ? operand.map(scalar)\n : scalar(operand);\n } else {\n throw new Error(`Unknown filter \"${operator}\" on \"${field}\".`);\n }\n }\n if (Object.keys(comparison).length > 0) extra.push({ [field]: comparison });\n return extra;\n}\n\n/** One relation filter, as the engine's `$link` entry. */\nfunction relationCondition(\n graph: Record<string, ModelInfo>,\n model: ModelInfo,\n key: string,\n value: unknown\n): EngineWhere {\n const relation = model.relations[key];\n const target = graph[relation.target];\n\n if (relation.kind === \"belongsTo\") {\n if (value === null) return { [relation.foreignKey!]: null };\n if (!isFilterObject(value)) {\n throw new Error(`\"${model.key}.${key}\" takes a filter object or null.`);\n }\n for (const mode of [\"some\", \"every\", \"none\"]) {\n if (mode in value) {\n throw new Error(\n `\"${model.key}.${key}\" is a to-one link: filter it directly, as { ${key}: { ... } }, not with ${mode}.`\n );\n }\n }\n return { $link: [{ label: key, mode: \"parent\", where: toEngineWhere(target, value as Where, graph) }] };\n }\n\n if (!isFilterObject(value)) {\n throw new Error(`\"${model.key}.${key}\" takes { some }, { every } or { none }.`);\n }\n const entries = Object.entries(value).filter(([, filter]) => filter !== undefined);\n if (entries.length === 0) {\n throw new Error(`\"${model.key}.${key}\" needs one of some, every or none.`);\n }\n return {\n $link: entries.map(([mode, filter]) => {\n if (mode !== \"some\" && mode !== \"every\" && mode !== \"none\") {\n throw new Error(`\"${model.key}.${key}\" takes some, every or none, not \"${mode}\".`);\n }\n if (!isFilterObject(filter)) {\n throw new Error(`\"${model.key}.${key}.${mode}\" takes a filter object.`);\n }\n return { label: key, mode, where: toEngineWhere(target, filter as Where, graph) };\n }),\n };\n}\n\n/** Translates a public filter into the engine's `where`. */\nexport function toEngineWhere(\n model: ModelInfo,\n where: Where,\n graph: Record<string, ModelInfo> = {}\n): QueryWhere {\n const conditions: EngineWhere[] = [];\n\n for (const [key, value] of Object.entries(where as Record<string, unknown>)) {\n if (value === undefined) continue;\n if (key === \"AND\") {\n for (const branch of asList(value as Where | Where[])) {\n conditions.push(toEngineWhere(model, branch, graph) as EngineWhere);\n }\n } else if (key === \"OR\") {\n const branches = value as Where[];\n if (!Array.isArray(branches) || branches.length === 0) {\n throw new Error(`\"OR\" on \"${model.key}\" needs a non-empty array.`);\n }\n conditions.push({ $or: branches.map((branch) => toEngineWhere(model, branch, graph)) });\n } else if (key === \"NOT\") {\n for (const branch of asList(value as Where | Where[])) {\n conditions.push({ $not: toEngineWhere(model, branch, graph) });\n }\n } else if (model.filterable.has(key)) {\n conditions.push(...fieldConditions(key, value));\n } else if (key in model.relations) {\n conditions.push(relationCondition(graph, model, key, value));\n } else {\n throw new Error(`\"${model.key}\" has no filterable field \"${key}\".`);\n }\n }\n\n // Merge conditions on distinct keys into one object; anything that would\n // collide goes under $and.\n const merged: EngineWhere = {};\n const rest: EngineWhere[] = [];\n for (const condition of conditions) {\n const [entry] = Object.entries(condition);\n if (entry[0] === \"$link\" && Object.keys(condition).length === 1) {\n // Several relation filters are just more entries in the one list; they\n // are ANDed by the compiler like any other condition.\n merged.$link = [\n ...((merged.$link as unknown[] | undefined) ?? []),\n ...(entry[1] as unknown[]),\n ];\n } else if (\n Object.keys(condition).length === 1 &&\n !(entry[0] in merged) &&\n entry[0] !== \"$and\"\n ) {\n merged[entry[0]] = entry[1];\n } else {\n rest.push(condition);\n }\n }\n if (rest.length > 0) merged.$and = rest;\n return merged as QueryWhere;\n}\n\nexport function toEngineOrder(\n model: ModelInfo,\n orderBy: unknown\n): Record<string, \"asc\" | \"desc\"> | undefined {\n if (orderBy === undefined) return undefined;\n const order: Record<string, \"asc\" | \"desc\"> = {};\n for (const entry of asList(orderBy as Record<string, string> | Record<string, string>[])) {\n for (const [field, direction] of Object.entries(entry)) {\n if (!model.filterable.has(field)) {\n throw new Error(`\"${model.key}\" cannot be ordered by \"${field}\".`);\n }\n if (direction !== \"asc\" && direction !== \"desc\") {\n throw new Error(`Order for \"${model.key}.${field}\" must be \"asc\" or \"desc\".`);\n }\n order[field] = direction;\n }\n }\n return order;\n}\n\nexport interface NodeArgs {\n where?: unknown;\n orderBy?: unknown;\n take?: number;\n after?: string;\n include?: Record<string, unknown>;\n select?: Record<string, unknown>;\n}\n\n/** Fields a `select` may name besides relations: the keys of a stored row. */\nfunction selectable(model: ModelInfo, name: string): boolean {\n return (\n name === \"id\" ||\n name === \"createdAt\" ||\n name === \"updatedAt\" ||\n name in model.scalars ||\n model.filterable.has(name)\n );\n}\n\n/**\n * Splits `select` into the engine's attribute list and the relations it\n * includes. Relations named in `select` are fetched exactly like `include`.\n */\nexport function splitSelect(\n model: ModelInfo,\n select: Record<string, unknown>\n): { fields: string[]; relations: Record<string, unknown> } {\n const fields: string[] = [];\n const relations: Record<string, unknown> = {};\n for (const [name, value] of Object.entries(select)) {\n if (value === undefined || value === false) continue;\n if (name in model.relations) {\n relations[name] = value;\n continue;\n }\n if (!selectable(model, name)) {\n throw new Error(`\"${model.key}\" has no field \"${name}\" to select.`);\n }\n if (value !== true) {\n throw new Error(`\"${model.key}.${name}\" in select takes true or false.`);\n }\n fields.push(name);\n }\n return { fields, relations };\n}\n\n/**\n * The relations a level returns: those `select` lists and those `include`\n * adds. A relation named in both gets both sets of arguments; the same\n * argument given two different values is a mistake, not a choice to make.\n */\nfunction relationsOf(\n model: ModelInfo,\n args: NodeArgs,\n split: { relations: Record<string, unknown> } | null\n): Record<string, unknown> {\n const merged: Record<string, unknown> = { ...(args.include ?? {}) };\n for (const [name, value] of Object.entries(split?.relations ?? {})) {\n const other = merged[name];\n if (other === undefined || other === false || other === true) {\n merged[name] = value === true && typeof other === \"object\" ? other : value;\n continue;\n }\n if (value === true || value === false || value === undefined) continue;\n const a = other as Record<string, unknown>;\n const b = value as Record<string, unknown>;\n const combined: Record<string, unknown> = { ...a };\n for (const [key, item] of Object.entries(b)) {\n if (item === undefined) continue;\n if (key === \"select\" || key === \"include\") {\n combined[key] = { ...((a[key] as object | undefined) ?? {}), ...(item as object) };\n } else if (a[key] !== undefined && JSON.stringify(a[key]) !== JSON.stringify(item)) {\n throw new Error(`\"${model.key}.${name}\" has a different ${key} in select and in include.`);\n } else {\n combined[key] = item;\n }\n }\n merged[name] = combined;\n }\n return merged;\n}\n\n/** One level of an engine query document: `{ $: options, label: child, ... }`. */\nexport function toEngineNode(\n graph: Record<string, ModelInfo>,\n model: ModelInfo,\n args: NodeArgs,\n extra: Record<string, unknown> = {}\n): Record<string, unknown> {\n const options: Record<string, unknown> = { ...extra };\n if (args.where !== undefined) options.where = toEngineWhere(model, args.where as Where, graph);\n const order = toEngineOrder(model, args.orderBy);\n if (order !== undefined) options.order = order;\n if (args.take !== undefined) options.limit = args.take;\n if (args.after !== undefined) options.after = args.after;\n\n const split = args.select === undefined ? null : splitSelect(model, args.select);\n if (split !== null) {\n // The engine always returns the id, so a select of relations alone\n // still asks for one column.\n options.select = split.fields.length > 0 ? split.fields : [\"id\"];\n }\n const relations = relationsOf(model, args, split);\n\n const node: Record<string, unknown> = { $: options };\n for (const [name, value] of Object.entries(relations)) {\n if (value === undefined || value === false) continue;\n const relation = model.relations[name];\n if (!relation) {\n throw new Error(`\"${model.key}\" has no relation \"${name}\" to include.`);\n }\n node[name] = toEngineNode(\n graph,\n graph[relation.target],\n value === true ? {} : (value as NodeArgs)\n );\n }\n return node;\n}\n\ntype Shape = (row: Record<string, unknown>) => Record<string, unknown>;\n\n/**\n * Narrows result rows to what the arguments asked for, at every level, or\n * returns null when nothing is narrowed. The engine already sends only the\n * selected fields; this keeps optimistic writes, which patch whole values\n * into cached rows, from widening a narrowed row again.\n */\nexport function shapeFor(\n graph: Record<string, ModelInfo>,\n model: ModelInfo,\n args: NodeArgs\n): Shape | null {\n const split =\n args.select === undefined ? null : splitSelect(model, args.select);\n const relations = relationsOf(model, args, split);\n\n const nested: Array<[string, Shape | null]> = [];\n for (const [name, value] of Object.entries(relations)) {\n if (value === undefined || value === false) continue;\n const relation = model.relations[name];\n if (!relation) continue;\n nested.push([\n name,\n value === true ? null : shapeFor(graph, graph[relation.target], value as NodeArgs),\n ]);\n }\n if (split === null && nested.every(([, shape]) => shape === null)) return null;\n\n const fields = split?.fields ?? null;\n return (row) => {\n let output: Record<string, unknown>;\n if (fields === null) {\n output = { ...row };\n } else {\n output = {};\n for (const field of fields) if (field in row) output[field] = row[field];\n }\n for (const [name, shape] of nested) {\n const value = row[name];\n if (value === undefined) continue;\n output[name] =\n shape === null || value === null\n ? value\n : Array.isArray(value)\n ? value.map((child) => shape(child as Record<string, unknown>))\n : shape(value as Record<string, unknown>);\n }\n return output;\n };\n}\n","/**\n * `schema()` and `model()`: the public way to describe a database.\n *\n * A schema compiles to the same registry, permissions and migrations the\n * engine already runs on, so the Worker accepts it unchanged. It also keeps a\n * small relation graph that the client uses to turn `include`, `connect` and\n * friends into engine queries and ops.\n */\n\nimport type { FileRules } from \"../engine/file-access\";\nimport { WORKSPACE_ROLE_LEVELS, type WorkspaceRole } from \"../claims\";\nimport type { AttributeDefinition, DeleteRule, LinkDefinition } from \"../engine/registry\";\nimport type { PermissionDecision, PermissionOverrides } from \"../engine/tx-permissions\";\nimport type { QueryWhere } from \"../engine/query-types\";\nimport { defineSchema, type EntityConfig, type TapeDBSchema } from \"../schema\";\nimport {\n BelongsTo,\n Field,\n HasMany,\n type KindInput,\n type KindOutput,\n type ModelMember,\n type ScalarKind,\n} from \"./fields\";\nimport { toEngineWhere, type Where } from \"./where\";\n\n// ---- Access ----------------------------------------------------------------\n\nexport type RoleName =\n | \"guest\"\n | \"user\"\n | \"member\"\n | \"editor\"\n | \"moderator\"\n | \"admin\"\n | \"owner\";\n\nconst ROLE_LEVELS: Record<RoleName, WorkspaceRole> = {\n guest: WORKSPACE_ROLE_LEVELS.GUEST,\n user: WORKSPACE_ROLE_LEVELS.USER,\n member: WORKSPACE_ROLE_LEVELS.MEMBER,\n editor: WORKSPACE_ROLE_LEVELS.EDITOR,\n moderator: WORKSPACE_ROLE_LEVELS.MODERATOR,\n admin: WORKSPACE_ROLE_LEVELS.ADMIN,\n owner: WORKSPACE_ROLE_LEVELS.OWNER,\n};\n\nexport interface AccessAuth {\n /** The caller's subject, from your identity provider. */\n sub: string;\n role: WorkspaceRole;\n workspaceId: string;\n}\n\nexport interface CheckContext<F extends Fields = Fields> {\n auth: AccessAuth;\n /** The stored row, for update, delete and read. */\n row?: Partial<Row<F>> & { id: string };\n /** The incoming values, for create and update. */\n data?: Record<string, unknown>;\n /** Field names this write sets. */\n changed?: string[];\n}\n\nexport interface RoleDecision {\n readonly decision: \"role\";\n readonly level: WorkspaceRole;\n}\nexport interface FilterDecision<F extends Fields = Fields> {\n readonly decision: \"filter\";\n readonly build: (context: { auth: AccessAuth }) => Where<F> | Where<F>[];\n}\nexport interface CheckDecision<F extends Fields = Fields> {\n readonly decision: \"check\";\n readonly test: (context: CheckContext<F>) => boolean;\n}\n\n/** A minimum role, checked before any SQL. */\nexport function role(name: RoleName): RoleDecision {\n const level = ROLE_LEVELS[name];\n if (level === undefined) throw new Error(`Unknown role \"${name}\".`);\n return { decision: \"role\", level };\n}\n\n/**\n * `read` only: the rows the caller may see, as a filter compiled into SQL. An\n * array is OR of its filters.\n */\nexport function filter<F extends Fields = Fields>(\n build: (context: { auth: AccessAuth }) => Where<F> | Where<F>[]\n): FilterDecision<F> {\n return { decision: \"filter\", build };\n}\n\n/** A predicate over the caller and the row. Throwing denies. */\nexport function check<F extends Fields = Fields>(\n test: (context: CheckContext<F>) => boolean\n): CheckDecision<F> {\n return { decision: \"check\", test };\n}\n\n// ---- File rules ------------------------------------------------------------\n\n/** A file as file rules see it. */\nexport interface FileInfo {\n path: string;\n /** Bytes; null for a write whose size is not known yet (a multipart start). */\n size: number | null;\n contentType: string | null;\n /** The uploader's claim subject. */\n uploadedBy: string;\n}\n\nexport interface FileCheckContext {\n auth: AccessAuth;\n /** For read and delete, the stored file; for write, the incoming one. */\n file: FileInfo;\n /** For write, the stored file it would replace, if any. */\n existing?: FileInfo;\n}\n\nexport interface FileCheckDecision {\n readonly decision: \"check\";\n readonly test: (context: FileCheckContext) => boolean;\n}\n\nexport interface AttachedToDecision<K extends string = string> {\n readonly decision: \"attachedTo\";\n readonly model: K;\n readonly locate: (path: string) => string | null | undefined;\n}\n\n/** A file rule: a predicate over the caller and the file. Throwing denies. */\nexport function fileCheck(test: (context: FileCheckContext) => boolean): FileCheckDecision {\n return { decision: \"check\", test };\n}\n\n/**\n * A file rule: the file belongs to a row and follows its rules. `locate`\n * maps a path to the row's id (null when the path names none, which denies).\n * Reading the file needs the row to be readable by the caller; writing or\n * deleting it needs the caller to be allowed to update the row.\n *\n * files: { read: attachedTo(\"task\", (path) => path.split(\"/\")[1]) }\n */\nexport function attachedTo<K extends string>(\n model: K,\n locate: (path: string) => string | null | undefined\n): AttachedToDecision<K> {\n return { decision: \"attachedTo\", model, locate };\n}\n\nexport type FileRuleDecision<K extends string = string> = RoleDecision | FileCheckDecision | AttachedToDecision<K>;\n\n/** Who may read, write and delete each file. Defaults: read member, write and delete editor. */\nexport interface FileAccess<K extends string = string> {\n read?: FileRuleDecision<K>;\n write?: FileRuleDecision<K>;\n delete?: FileRuleDecision<K>;\n}\n\nexport interface SchemaOptions<K extends string = string> {\n files?: FileAccess<K>;\n}\n\nexport interface Access<F extends Fields = Fields> {\n read?: RoleDecision | FilterDecision<F> | CheckDecision<F>;\n create?: RoleDecision | CheckDecision<F>;\n update?: RoleDecision | CheckDecision<F>;\n delete?: RoleDecision | CheckDecision<F>;\n}\n\n// ---- Models ----------------------------------------------------------------\n\nexport type Fields = Record<string, ModelMember>;\n\nexport interface ModelOptions {\n /** An existing table to map this model onto. Default: the key in snake_case. */\n table?: string;\n}\n\nexport class Model<F extends Fields = Fields> {\n constructor(\n readonly fields: F,\n readonly options: ModelOptions = {},\n readonly rules: Access<F> = {}\n ) {}\n\n /** Who may read, create, update and delete rows of this model. */\n access(rules: Access<F>): Model<F> {\n return new Model(this.fields, this.options, rules);\n }\n}\n\nexport function model<F extends Fields>(fields: F, options: ModelOptions = {}): Model<F> {\n return new Model(fields, options);\n}\n\n// ---- Inferred types --------------------------------------------------------\n\ntype Keys<F, Tag> = { [K in keyof F]: F[K] extends Tag ? K : never }[keyof F] & string;\n\nexport type ScalarKeys<F> = Keys<F, Field>;\nexport type BelongsToKeys<F> = Keys<F, BelongsTo>;\nexport type HasManyKeys<F> = Keys<F, HasMany>;\nexport type RelationKeys<F> = BelongsToKeys<F> | HasManyKeys<F>;\n\ntype OutputOf<S> = S extends Field<infer K, infer O, boolean>\n ? KindOutput[K] | (S extends { personalSubject: string } ? null : O extends true ? null : never)\n : never;\n\ntype ForeignKeyOf<S> = S extends BelongsTo<string, infer O>\n ? string | (O extends true ? null : never)\n : never;\n\n/** A stored row: its fields, the foreign keys of its `belongsTo` relations, and the system fields. */\nexport type Row<F> = { id: string; createdAt: number; updatedAt: number; $erased?: string[] } & {\n [K in ScalarKeys<F>]: OutputOf<F[K]>;\n} & {\n [K in BelongsToKeys<F> as `${K}Id`]: ForeignKeyOf<F[K]>;\n};\n\n/** Fields filterable and sortable: scalars except json, foreign keys and `id`. */\nexport type FilterKeys<F> =\n | \"id\"\n | { [K in ScalarKeys<F>]: F[K] extends { personalSubject: string } ? never : F[K] extends Field<\"json\", boolean, boolean> ? never : K }[ScalarKeys<F>]\n | `${BelongsToKeys<F>}Id`;\n\ntype InputOf<S> = S extends Field<infer K, infer O, boolean>\n ? KindInput[K] | (O extends true ? null : never)\n : never;\n\ntype RequiredScalarKeys<F> = {\n [K in ScalarKeys<F>]: F[K] extends Field<ScalarKind, false, false> ? K : never;\n}[ScalarKeys<F>];\ntype OptionalScalarKeys<F> = Exclude<ScalarKeys<F>, RequiredScalarKeys<F>>;\n\n/**\n * Rows a write may create alongside the row it addresses, typed at every\n * depth. Relation keys resolve lazily (as property types of a mapped object),\n * so models that point at each other do not expand the graph up front. The\n * key that links a nested row to the row creating it is filled in by the\n * write, so every relation is optional here; the engine still validates\n * every op.\n */\ntype NestedCreate<F, M extends Models> = { id?: string } & {\n [K in RequiredScalarKeys<F>]: InputOf<F[K]>;\n} & {\n [K in OptionalScalarKeys<F>]?: InputOf<F[K]>;\n} & {\n [K in BelongsToKeys<F>]?: BelongsToInput<F[K], M>;\n} & {\n [K in HasManyKeys<F>]?: HasManyInput<F[K], M>;\n} & {\n [K in BelongsToKeys<F> as `${K}Id`]?: string | null;\n};\n\ntype BelongsToInput<F, M extends Models> =\n | { connect: string }\n | { create: NestedCreate<TargetFieldsOf<F, M>, M> }\n | { disconnect: true }\n | null;\n\ntype RequiredBelongsToKeys<F> = {\n [K in BelongsToKeys<F>]: F[K] extends BelongsTo<string, false> ? K : never;\n}[BelongsToKeys<F>];\n\ntype UnionToIntersection<U> = (U extends unknown ? (value: U) => void : never) extends (\n value: infer I\n) => void\n ? I\n : never;\n\n/**\n * A required belongsTo must be set on create, as `{ connect }` or as its key.\n * Each key's two forms are boxed before the union of keys becomes an\n * intersection, so \"board or boardId\" stays a choice instead of becoming both.\n */\ntype RequiredParents<F> = [RequiredBelongsToKeys<F>] extends [never]\n ? unknown\n : Unbox<\n UnionToIntersection<\n {\n [K in RequiredBelongsToKeys<F>]: {\n box: { [P in K]: { connect: string } } | { [P in `${K}Id`]: string };\n };\n }[RequiredBelongsToKeys<F>]\n >\n >;\n\ntype Unbox<T> = T extends { box: infer B } ? B : never;\ntype HasManyInput<F, M extends Models> = {\n connect?: string[];\n disconnect?: string[];\n /** Rows created with this one, carrying its key. */\n create?: NestedCreate<TargetFieldsOf<F, M>, M> | NestedCreate<TargetFieldsOf<F, M>, M>[];\n};\n\nexport type CreateData<F, M extends Models = Models> = { id?: string } & RequiredParents<F> & {\n [K in RequiredScalarKeys<F>]: InputOf<F[K]>;\n} & {\n [K in OptionalScalarKeys<F>]?: InputOf<F[K]>;\n} & {\n [K in BelongsToKeys<F>]?: BelongsToInput<F[K], M>;\n} & {\n [K in BelongsToKeys<F> as `${K}Id`]?: string | null;\n} & {\n [K in HasManyKeys<F>]?: HasManyInput<F[K], M>;\n};\n\nexport type UpdateData<F, M extends Models = Models> = {\n [K in ScalarKeys<F>]?: InputOf<F[K]>;\n} & {\n [K in BelongsToKeys<F>]?: BelongsToInput<F[K], M>;\n} & {\n [K in BelongsToKeys<F> as `${K}Id`]?: string | null;\n} & {\n [K in HasManyKeys<F>]?: HasManyInput<F[K], M>;\n};\n\nexport type Models = Record<string, Model>;\nexport type FieldsOf<M> = M extends Model<infer F> ? F : never;\n\ntype TargetOf<S> = S extends BelongsTo<infer T, boolean> ? T : S extends HasMany<infer T> ? T : never;\ntype TargetFields<S, M extends Models> = TargetOf<S> extends keyof M ? FieldsOf<M[TargetOf<S>]> : Fields;\n\n/** The fields of the model a relation points at. */\nexport type TargetFieldsOf<S, M extends Models> = TargetFields<S, M>;\n\nexport type OrderBy<F> =\n | Partial<Record<FilterKeys<F>, \"asc\" | \"desc\">>\n | Partial<Record<FilterKeys<F>, \"asc\" | \"desc\">>[];\n\nexport interface IncludeArgs<M extends Models, F extends Fields> {\n where?: Where<F, M>;\n orderBy?: OrderBy<F>;\n take?: number;\n include?: Include<M, F>;\n select?: Select<M, F>;\n}\n\nexport type Include<M extends Models, F extends Fields> = {\n [K in RelationKeys<F>]?: true | IncludeArgs<M, TargetFields<F[K], M>>;\n};\n\n/**\n * Fields to return instead of the whole row. Relations listed here are\n * included, and may carry their own `select`.\n */\nexport type Select<M extends Models, F extends Fields> = {\n [K in keyof Row<F>]?: boolean;\n} & {\n [K in RelationKeys<F>]?: boolean | IncludeArgs<M, TargetFields<F[K], M>>;\n};\n\ntype Included<M extends Models, S, A> = (A extends { select: infer Sel }\n ? Selected<M, TargetFields<S, M>, Sel>\n : Row<TargetFields<S, M>>) &\n (A extends { include: infer I } ? WithInclude<M, TargetFields<S, M>, I> : unknown);\n\ntype RelationOutput<M extends Models, S, A> = S extends HasMany\n ? Included<M, S, A>[]\n : S extends BelongsTo<string, infer O>\n ? Included<M, S, A> | (O extends true ? null : never)\n : never;\n\n/** A row plus whatever `include` asked for, at every level. */\nexport type WithInclude<M extends Models, F extends Fields, I> = I extends object\n ? {\n [K in keyof I & RelationKeys<F>]: RelationOutput<M, F[K], I[K]>;\n }\n : unknown;\n\n/** Exactly the fields a `select` named, and the relations it included. */\nexport type Selected<M extends Models, F extends Fields, S> = {\n [K in keyof S & keyof Row<F> as S[K] extends false | undefined ? never : K]: Row<F>[K];\n} & {\n [K in keyof S & RelationKeys<F> as S[K] extends false | undefined ? never : K]: RelationOutput<\n M,\n F[K],\n S[K]\n >;\n};\n\n// ---- Aggregates -------------------------------------------------------------\n\ntype NumberKeys<F> = {\n [K in ScalarKeys<F>]: F[K] extends Field<\"number\", boolean, boolean> ? K : never;\n}[ScalarKeys<F>];\n\n/** Fields a group can be keyed by: anything filterable, and the timestamps. */\nexport type GroupKeys<F> = FilterKeys<F> | \"createdAt\" | \"updatedAt\";\n\n/** Fields with an order, so a minimum and maximum: not booleans or json. */\ntype OrderedKeys<F> =\n | Exclude<GroupKeys<F>, { [K in ScalarKeys<F>]: F[K] extends Field<\"boolean\", boolean, boolean> ? K : never }[ScalarKeys<F>]>;\n\ntype Flags<K extends PropertyKey> = { [P in K]?: boolean };\n\nexport interface AggregateMeasures<F> {\n /** `true` counts rows; an object counts rows (`_all`) and non-null values per field. */\n _count?: true | ({ _all?: boolean } & Flags<Exclude<keyof Row<F>, { [K in ScalarKeys<F>]: F[K] extends { personalSubject: string } ? K : never }[ScalarKeys<F>] | \"$erased\">>);\n _sum?: Flags<NumberKeys<F>>;\n _avg?: Flags<NumberKeys<F>>;\n _min?: Flags<OrderedKeys<F>>;\n _max?: Flags<OrderedKeys<F>>;\n}\n\ntype On<S> = { [K in keyof S]: S[K] extends false | undefined ? never : K }[keyof S];\n\n/** What a set of measures returns. */\nexport type AggregateOutput<F, A> = (A extends { _count: infer C }\n ? { _count: C extends true ? number : { [K in On<C>]: number } }\n : unknown) &\n (A extends { _sum: infer S } ? { _sum: { [K in On<S>]: number | null } } : unknown) &\n (A extends { _avg: infer S } ? { _avg: { [K in On<S>]: number | null } } : unknown) &\n (A extends { _min: infer S } ? { _min: { [K in On<S> & keyof Row<F>]: Row<F>[K] | null } } : unknown) &\n (A extends { _max: infer S } ? { _max: { [K in On<S> & keyof Row<F>]: Row<F>[K] | null } } : unknown);\n\n/** One `groupBy` row: the key fields, then the measures. */\nexport type GroupRow<F, A> = (A extends { by: ReadonlyArray<infer K> }\n ? { [P in K & keyof Row<F>]: Row<F>[P] }\n : unknown) &\n AggregateOutput<F, A>;\n\n// ---- The schema ------------------------------------------------------------\n\nexport interface RelationInfo {\n kind: \"belongsTo\" | \"hasMany\";\n target: string;\n /** Engine link api name shared by both sides. */\n link: string;\n /** belongsTo: the foreign-key attribute on this model. */\n foreignKey?: string;\n optional?: boolean;\n}\n\nexport interface ModelInfo {\n key: string;\n scalars: Record<string, { kind: ScalarKind; optional: boolean; hasDefault: boolean; defaultValue: unknown }>;\n relations: Record<string, RelationInfo>;\n /** Attributes a filter may name: id, non-json scalars, foreign keys. */\n filterable: Set<string>;\n}\n\nexport interface Schema<M extends Models = Models> extends TapeDBSchema {\n readonly models: M;\n readonly graph: Record<string, ModelInfo>;\n}\n\nconst DELETE_RULES: Record<string, DeleteRule> = {\n setNull: \"SET NULL\",\n cascade: \"CASCADE\",\n restrict: \"RESTRICT\",\n};\n\n/**\n * Compiles models into the engine schema plus the client's relation graph.\n * Throws on anything the engine would only discover later: a relation to a\n * model that does not exist, an ambiguous inverse, a reserved name.\n */\nexport function schema<M extends Models>(\n models: M,\n options: SchemaOptions<Extract<keyof M, string>> = {}\n): Schema<M> {\n const entities: Record<string, EntityConfig> = {};\n const links: LinkDefinition[] = [];\n const graph: Record<string, ModelInfo> = {};\n const permissions: PermissionOverrides = {};\n\n for (const [key, definition] of Object.entries(models)) {\n if (!/^[A-Za-z][A-Za-z0-9]*$/.test(key)) {\n throw new Error(`Model name \"${key}\" must be letters and digits, starting with a letter.`);\n }\n if (!(definition instanceof Model)) {\n throw new Error(`\"${key}\" is not a model(). Wrap its fields in model({ ... }).`);\n }\n const info: ModelInfo = { key, scalars: {}, relations: {}, filterable: new Set([\"id\"]) };\n const attributes: EntityConfig = {};\n\n for (const [name, member] of Object.entries(definition.fields)) {\n if ([\"id\", \"createdAt\", \"updatedAt\", \"updatedSeq\"].includes(name)) {\n throw new Error(`\"${key}.${name}\" is a system field and cannot be declared.`);\n }\n if (member instanceof Field) {\n const subject = \"personalSubject\" in member ? String(member.personalSubject) : undefined;\n if (subject && subject !== \"self\" && !(subject in definition.fields) &&\n !Object.entries(definition.fields).some(([field, value]) => value instanceof BelongsTo && `${field}Id` === subject))\n throw new Error(`Personal field ${key}.${name} refers to missing subject ${subject}.`);\n if (subject && subject !== \"self\" && subject in definition.fields) {\n const owner = definition.fields[subject];\n if (!(owner instanceof Field) || owner.kind !== \"string\" || \"personalSubject\" in owner)\n throw new Error(`Personal field ${key}.${name} requires a non-personal string subject.`);\n }\n attributes[name] = {\n type: member.kind,\n // A field with a default is filled in by create, so the engine never\n // sees it missing; it stays required for writes that bypass create.\n optional: subject ? true : member.isOptional,\n ...(subject ? { personal: { subject, required: !member.isOptional, ...(member.hasDefault ? { defaultValue: storedDefault(member.kind, member.defaultValue) } : {}) } } : {}),\n indexed: member.isIndexed || undefined,\n unique: member.isUnique || undefined,\n ...(member.hasDefault && !subject ? { default: storedDefault(member.kind, member.defaultValue) } : {}),\n } as AttributeDefinition;\n info.scalars[name] = {\n kind: member.kind,\n optional: member.isOptional,\n hasDefault: member.hasDefault,\n defaultValue: member.defaultValue,\n };\n if (member.kind !== \"json\" && !subject) info.filterable.add(name);\n } else if (member instanceof BelongsTo) {\n if (!(member.target in models)) {\n throw new Error(`\"${key}.${name}\" belongs to \"${member.target}\", which is not a model.`);\n }\n const foreignKey = `${name}Id`;\n if (foreignKey in definition.fields) {\n throw new Error(`\"${key}.${foreignKey}\" clashes with the key \"${key}.${name}\" stores.`);\n }\n attributes[foreignKey] = {\n type: \"string\",\n optional: member.isOptional,\n indexed: true,\n // defineSchema fills in the table; only the delete rule is ours.\n references: { table: \"\", column: \"id\", onDelete: DELETE_RULES[member.onDelete] },\n };\n info.relations[name] = {\n kind: \"belongsTo\",\n target: member.target,\n link: `${key}.${name}`,\n foreignKey,\n optional: member.isOptional,\n };\n info.filterable.add(foreignKey);\n } else if (member instanceof HasMany) {\n if (!(member.target in models)) {\n throw new Error(`\"${key}.${name}\" has many \"${member.target}\", which is not a model.`);\n }\n // Resolved below, once every belongsTo is known.\n info.relations[name] = { kind: \"hasMany\", target: member.target, link: \"\" };\n } else {\n throw new Error(`\"${key}.${name}\" is not a field. Use t.string(), t.belongsTo(), ...`);\n }\n }\n\n entities[key] = attributes;\n graph[key] = info;\n const overrides = accessOverrides(key, definition.rules, graph);\n if (overrides) permissions[key] = overrides;\n }\n\n // Pair every hasMany with its belongsTo, then emit one engine link per pair.\n // A belongsTo with no hasMany still needs a link: its inverse label is\n // private, so include cannot reach it.\n const pairedInverse = new Map<string, string>();\n for (const info of Object.values(graph)) {\n for (const [name, relation] of Object.entries(info.relations)) {\n if (relation.kind !== \"hasMany\") continue;\n const member = (models[info.key] as Model).fields[name] as HasMany;\n const candidates = Object.entries(graph[relation.target].relations).filter(\n ([, other]) => other.kind === \"belongsTo\" && other.target === info.key\n );\n const chosen = member.inverse\n ? candidates.filter(([field]) => field === member.inverse)\n : candidates;\n if (chosen.length !== 1) {\n throw new Error(\n chosen.length === 0\n ? `\"${info.key}.${name}\" has no matching belongsTo(\"${info.key}\") on \"${relation.target}\".`\n : `\"${info.key}.${name}\" matches several belongsTo fields on \"${relation.target}\"; name one with { inverse }.`\n );\n }\n const [inverseField, inverse] = chosen[0];\n if (pairedInverse.has(inverse.link)) {\n throw new Error(`\"${inverse.link}\" is the inverse of two hasMany fields.`);\n }\n pairedInverse.set(inverse.link, name);\n relation.link = inverse.link;\n relation.foreignKey = `${inverseField}Id`;\n }\n }\n\n for (const info of Object.values(graph)) {\n for (const [name, relation] of Object.entries(info.relations)) {\n if (relation.kind !== \"belongsTo\") continue;\n links.push({\n apiName: relation.link,\n kind: \"one-to-many\",\n forward: {\n namespace: relation.target,\n label: pairedInverse.get(relation.link) ?? `__${info.key}_${name}`,\n has: \"many\",\n },\n reverse: { namespace: info.key, label: name, has: \"one\" },\n foreignKey: { namespace: info.key, attribute: relation.foreignKey! },\n });\n }\n }\n\n const tables: Record<string, string> = {};\n for (const [key, definition] of Object.entries(models)) {\n if (definition.options.table !== undefined) tables[key] = definition.options.table;\n }\n\n const files = options.files;\n for (const [action, rule] of Object.entries(files ?? {})) {\n if (![\"read\", \"write\", \"delete\"].includes(action)) {\n throw new Error(`files.${action} is not a file action; use read, write or delete.`);\n }\n if (rule?.decision === \"attachedTo\" && !(rule.model in models)) {\n throw new Error(`files.${action} is attached to \"${rule.model}\", which is not a model.`);\n }\n if ((rule as { decision?: string } | undefined)?.decision === \"filter\") {\n throw new Error(`files.${action}: filter() is for model reads; use fileCheck() or attachedTo().`);\n }\n }\n\n const compiled = defineSchema({ entities, links, permissions, tables });\n return { ...compiled, ...(files && Object.keys(files).length > 0 ? { files: files as unknown as FileRules } : {}), models, graph };\n}\n\n/** A default in the form the column stores it. */\nfunction storedDefault(kind: ScalarKind, value: unknown): string | number | null {\n if (value === null || value === undefined) return null;\n switch (kind) {\n case \"boolean\":\n return value ? 1 : 0;\n case \"date\":\n return value instanceof Date ? value.getTime() : typeof value === \"string\" ? Date.parse(value) : Number(value);\n case \"json\":\n return JSON.stringify(value);\n case \"number\":\n return Number(value);\n default:\n return String(value);\n }\n}\n\nfunction accessOverrides(\n key: string,\n rules: Access,\n graph: Record<string, ModelInfo>\n): Partial<Record<\"view\" | \"create\" | \"update\" | \"delete\", PermissionDecision>> | undefined {\n const out: Partial<Record<\"view\" | \"create\" | \"update\" | \"delete\", PermissionDecision>> = {};\n for (const [action, decision] of Object.entries(rules) as [keyof Access, Access[keyof Access]][]) {\n if (decision === undefined) continue;\n const engineAction = action === \"read\" ? \"view\" : action;\n if (decision.decision === \"role\") {\n out[engineAction] = decision.level;\n } else if (decision.decision === \"filter\") {\n if (action !== \"read\") throw new Error(`\"${key}.${action}\": filter() is only valid for read.`);\n const build = decision.build;\n out.view = {\n where: (auth) => {\n const result = build({ auth });\n const branches = Array.isArray(result) ? result : [result];\n return branches.map((branch) => toEngineWhere(graph[key], branch as Where<Fields>)) as QueryWhere[];\n },\n };\n } else {\n const test = decision.test;\n out[engineAction] = (context) =>\n test({ auth: context.auth, row: context.data as never, data: context.next, changed: context.changed });\n }\n }\n return Object.keys(out).length > 0 ? out : undefined;\n}\n"],"mappings":";;;;;;;;;AA+BO,IAAM,QAAN,MAAM,OAIX;AAAA,EAGA,YACW,MACA,YACA,YACA,eAAwB,QACxB,YAAY,OACZ,WAAW,OACpB;AANS;AACA;AACA;AACA;AACA;AACA;AAAA,EACR;AAAA,EANQ;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EARF,MAAM;AAAA;AAAA,EAYf,SAAiF,SAAkF;AACjK,QAAI,KAAK,aAAa,KAAK,SAAU,OAAM,IAAI,MAAM,8CAA8C;AACnG,QAAI,CAAC,QAAQ,QAAS,OAAM,IAAI,MAAM,oDAAoD;AAC1F,WAAO,IAAI,cAAc,KAAK,MAAuC,KAAK,YAAY,KAAK,YAAY,QAAQ,SAAS,KAAK,YAAY;AAAA,EAC3I;AAAA;AAAA,EAGA,WAA8B;AAC5B,WAAO,IAAI,OAAM,KAAK,MAAM,MAAM,KAAK,YAAY,KAAK,cAAc,KAAK,WAAW,KAAK,QAAQ;AAAA,EACrG;AAAA;AAAA,EAGA,QAAQ,OAAwC;AAC9C,WAAO,IAAI,OAAM,KAAK,MAAM,KAAK,YAAY,MAAM,OAAO,KAAK,WAAW,KAAK,QAAQ;AAAA,EACzF;AAAA;AAAA,EAGA,QAAwB;AACtB,WAAO,IAAI,OAAM,KAAK,MAAM,KAAK,YAAY,KAAK,YAAY,KAAK,cAAc,MAAM,KAAK,QAAQ;AAAA,EACtG;AAAA;AAAA,EAGA,SAAyB;AACvB,WAAO,IAAI,OAAM,KAAK,MAAM,KAAK,YAAY,KAAK,YAAY,KAAK,cAAc,KAAK,WAAW,IAAI;AAAA,EACvG;AACF;AAEO,IAAM,gBAAN,MAAM,uBAAiI,MAAe;AAAA,EAC3J,YAAY,MAAS,UAAa,YAAwB,iBAAyB,cAAwB;AACzG,UAAM,MAAM,UAAU,YAAY,YAAY;AADU;AAAA,EAE1D;AAAA,EAF0D;AAAA,EAGjD,WAAsC;AAAE,WAAO,IAAI,eAAc,KAAK,MAAM,MAAM,KAAK,YAAY,KAAK,iBAAiB,KAAK,YAAY;AAAA,EAAG;AAAA,EAC7I,QAAQ,OAAgD;AAAE,WAAO,IAAI,eAAc,KAAK,MAAM,KAAK,YAAY,MAAM,KAAK,iBAAiB,KAAK;AAAA,EAAG;AAAA,EACnJ,QAA0B;AAAE,UAAM,IAAI,MAAM,oCAAoC;AAAA,EAAG;AAAA,EACnF,SAA2B;AAAE,UAAM,IAAI,MAAM,mCAAmC;AAAA,EAAG;AAC9F;AAUO,IAAM,YAAN,MAAM,WAAkE;AAAA,EAG7E,YACW,QACA,YACA,WAA4B,WACrC;AAHS;AACA;AACA;AAAA,EACR;AAAA,EAHQ;AAAA,EACA;AAAA,EACA;AAAA,EALF,MAAM;AAAA;AAAA,EASf,WAA+B;AAC7B,WAAO,IAAI,WAAU,KAAK,QAAQ,MAAM,KAAK,QAAQ;AAAA,EACvD;AACF;AAWO,IAAM,UAAN,MAAyC;AAAA,EAG9C,YACW,QACA,SACT;AAFS;AACA;AAAA,EACR;AAAA,EAFQ;AAAA,EACA;AAAA,EAJF,MAAM;AAMjB;AAKO,IAAM,IAAI;AAAA,EACf,QAAQ,MAAM,IAAI,MAAM,UAAU,OAAO,KAAK;AAAA,EAC9C,QAAQ,MAAM,IAAI,MAAM,UAAU,OAAO,KAAK;AAAA,EAC9C,SAAS,MAAM,IAAI,MAAM,WAAW,OAAO,KAAK;AAAA;AAAA,EAEhD,MAAM,MAAM,IAAI,MAAM,QAAQ,OAAO,KAAK;AAAA;AAAA,EAE1C,MAAM,MAAM,IAAI,MAAM,QAAQ,OAAO,KAAK;AAAA,EAC1C,WAAW,CAAmB,QAAW,UAA4B,CAAC,MACpE,IAAI,UAAU,QAAQ,OAAO,QAAQ,YAAY,SAAS;AAAA,EAC5D,SAAS,CAAmB,QAAW,UAA0B,CAAC,MAChE,IAAI,QAAQ,QAAQ,QAAQ,OAAO;AACvC;;;ACxHA,SAAS,gBACP,MACA,QAAwB,CAAC,GACD;AACxB,SAAO;AAAA,IACL;AAAA,IACA,YAAY,MAAM,YAAY;AAAA,IAC9B,WAAW,MAAM,WAAW;AAAA,IAC5B,UAAU,MAAM,UAAU;AAAA,IAC1B,WAAW;AACT,aAAO,gBAAmB,MAAM,EAAE,GAAG,OAAO,UAAU,KAAK,CAAC;AAAA,IAC9D;AAAA,IACA,UAAU;AACR,aAAO,gBAAmB,MAAM,EAAE,GAAG,OAAO,SAAS,KAAK,CAAC;AAAA,IAC7D;AAAA,IACA,SAAS;AACP,aAAO,gBAAmB,MAAM,EAAE,GAAG,OAAO,QAAQ,KAAK,CAAC;AAAA,IAC5D;AAAA,EACF;AACF;AAEO,SAAS,OAEd,OAAiC;AACjC,SAAO,EAAE,MAAM,UAAU,MAAM;AACjC;AAEO,SAAS,OAAO,YAAgD;AACrE,SAAO;AACT;AAGO,IAAM,IAAI;AAAA,EACf;AAAA,EACA;AAAA,EACA,QAAQ,MAAmC,gBAAwB,QAAQ;AAAA,EAC3E,QAAQ,MAAmC,gBAAwB,QAAQ;AAAA,EAC3E,SAAS,MACP,gBAAyB,SAAS;AAAA,EACpC,MAAM,MAAiC,gBAAsB,MAAM;AAAA,EACnE,MAAM,MAA2C,gBAAmB,MAAM;AAAA,EAC1E,KAAK,MAA2C,gBAAmB,KAAK;AAC1E;AAsDO,SAAS,kBACd,YACA,SAC4B;AAC5B,SAAO,YAAY,MAAM,OAAO;AAClC;;;AC/CA,IAAM,mBAAmB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAoElB,IAAM,WAAmC;AAAA,EAC9C,QAAQ;AAAA,EACR,MAAM;AAAA,EACN,MAAM;AAAA,EACN,KAAK;AAAA,EACL,QAAQ;AAAA,EACR,SAAS;AACX;AAGO,SAAS,WAAW,OAAuC;AAChE,MAAI,UAAU,KAAM,QAAO;AAC3B,MAAI,OAAO,UAAU,UAAU;AAC7B,QAAI,CAAC,OAAO,SAAS,KAAK,EAAG,OAAM,IAAI,MAAM,WAAW,KAAK,0BAA0B;AACvF,WAAO,OAAO,KAAK;AAAA,EACrB;AACA,SAAO,IAAI,MAAM,QAAQ,MAAM,IAAI,CAAC;AACtC;AAGO,SAAS,UACd,WACA,YACU;AACV,QAAM,UAAoB;AAAA,IACxB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,aAAW,CAAC,MAAM,SAAS,KAAK,OAAO,QAAQ,UAAU,GAAG;AAC1D,UAAM,SAAS,YAAY,IAAI;AAC/B,QAAI,MAAM,IAAI,MAAM,KAAK,SAAS,UAAU,IAAI,KAAK,MAAM;AAC3D,QAAI,UAAU,YAAY,OAAW,QAAO,YAAY,WAAW,UAAU,OAAO,CAAC;AACrF,QAAI,UAAU,YAAY;AACxB,YAAM,WAAW,UAAU,WAAW,YAAY;AAClD,aAAO,gBAAgB,UAAU,WAAW,KAAK,MAAM,UAAU,WAAW,MAAM,gBAAgB,QAAQ;AAAA,IAC5G;AACA,YAAQ,KAAK,GAAG;AAAA,EAClB;AAEA,QAAM,aAAa;AAAA,IACjB,+BAA+B,UAAU,KAAK;AAAA,IAAU,QAAQ,KAAK,OAAO,CAAC;AAAA;AAAA,EAC/E;AAEA,aAAW,CAAC,MAAM,SAAS,KAAK,OAAO,QAAQ,UAAU,GAAG;AAC1D,QAAI,CAAC,UAAU,WAAW,CAAC,UAAU,OAAQ;AAC7C,UAAM,SAAS,YAAY,IAAI;AAC/B,UAAM,SAAS,UAAU,SAAS,YAAY;AAC9C,eAAW;AAAA,MACT,UAAU,MAAM,wBAAwB,UAAU,KAAK,IAAI,MAAM,aAAa,UAAU,KAAK,OAAO,MAAM;AAAA,IAC5G;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,WAAW,MAA4C;AAC9D,SAAO;AAAA,IACL,SAAS;AAAA,MACP,IAAI,KAAK,WAAW;AAAA,MACpB,KAAK,KAAK,QAAQ;AAAA,MAClB,OAAO,KAAK,QAAQ;AAAA,IACtB;AAAA,IACA,SAAS;AAAA,MACP,IAAI,KAAK,WAAW;AAAA,MACpB,KAAK,KAAK,QAAQ;AAAA,MAClB,OAAO,KAAK,QAAQ;AAAA,IACtB;AAAA,EACF;AACF;AAEO,SAAS,aAAa,QAAoC;AAC/D,aAAW,CAAC,WAAW,OAAO,KAAK,OAAO,QAAQ,OAAO,eAAe,CAAC,CAAC,GAAG;AAC3E,QAAI,CAAC,OAAO,SAAS,SAAS,GAAG;AAC/B,YAAM,IAAI;AAAA,QACR,4CAA4C,SAAS;AAAA,MACvD;AAAA,IACF;AACA,eAAW,CAAC,QAAQ,QAAQ,KAAK,OAAO,QAAQ,WAAW,CAAC,CAAC,GAAG;AAC9D,0BAAoB,WAAW,QAAQ,QAAQ;AAAA,IACjD;AAAA,EACF;AAEA,QAAM,aAAoC,OAAO,QAAQ,OAAO,QAAQ,EAAE;AAAA,IACxE,CAAC,CAAC,SAAS,UAAU,OAAO;AAAA,MAC1B;AAAA,MACA,OAAO,OAAO,SAAS,OAAO,KAAK,YAAY,OAAO;AAAA,MACtD;AAAA,IACF;AAAA,EACF;AAEA,QAAM,QAAQ,OAAO,SAAS,CAAC;AAE/B,aAAW,QAAQ,OAAO;AAGxB,UAAM,QAAQ,WAAW;AAAA,MACvB,CAAC,cAAc,UAAU,YAAY,KAAK,WAAW;AAAA,IACvD;AACA,QAAI,CAAC,OAAO;AACV,YAAM,IAAI;AAAA,QACR,SAAS,KAAK,OAAO,kCAAkC,KAAK,WAAW,SAAS;AAAA,MAClF;AAAA,IACF;AACA,UAAM,YAAY,MAAM,WAAW,KAAK,WAAW,SAAS;AAG5D,QAAI,CAAC,WAAW;AACd,YAAM,IAAI;AAAA,QACR,SAAS,KAAK,OAAO,YAAY,KAAK,WAAW,SAAS,IAAI,KAAK,WAAW,SAAS;AAAA,MACzF;AAAA,IACF;AAEA,UAAM,SACJ,KAAK,QAAQ,cAAc,MAAM,UAC7B,KAAK,QAAQ,YACb,KAAK,QAAQ;AAEnB,cAAU,aAAa;AAAA,MACrB,OAAO,OAAO,SAAS,MAAM,KAAK,YAAY,MAAM;AAAA,MACpD,QAAQ;AAAA,MACR,UAAU,UAAU,YAAY,YAAY;AAAA,IAC9C;AAAA,EACF;AAEA,QAAM,mBAA6B,CAAC;AACpC,aAAW,aAAa,YAAY;AAClC,qBAAiB;AAAA,MACf,GAAG,UAAU,WAAW,OAAO,SAAS,UAAU,OAAO,KAAK,CAAC,CAAC;AAAA,IAClE;AAAA,EACF;AAEA,QAAM,aAA0C;AAAA,IAC9C,EAAE,IAAI,uBAAuB,KAAK,iBAAiB,KAAK,EAAE;AAAA,IAC1D,GAAG;AAAA,IACH;AAAA,MACE,IAAI;AAAA,MACJ,KAAK,iBAAiB,KAAK,MAAM;AAAA,IACnC;AAAA,EACF;AAEA,QAAM,iBAA8D,CAAC;AACrE,aAAW,CAAC,SAAS,UAAU,KAAK,OAAO,QAAQ,OAAO,QAAQ,GAAG;AACnE,UAAM,SAAkC,CAAC;AACzC,eAAW,CAAC,MAAM,SAAS,KAAK,OAAO,QAAQ,UAAU,GAAG;AAC1D,YAAM,UAAU,EAAE,UAAU,IAAI,KAAK,EAAE;AACvC,UAAI,QAAS,QAA0B;AACvC,YAAM,QAAQ;AAKd,UAAI,UAAU,SAAU,SAAQ,MAAM,SAAS;AAC/C,UAAI,UAAU,QAAS,SAAS,MAAuB,QAAQ;AAC/D,UAAI,UAAU,OAAQ,SAAS,MAAuB,OAAO;AAC7D,aAAO,IAAI,IAAI;AAAA,IACjB;AACA,mBAAe,OAAO,IAAI,EAAE,OAAO,MAAe;AAAA,EACpD;AAEA,QAAM,cAAoD,CAAC;AAC3D,aAAW,QAAQ,MAAO,aAAY,KAAK,OAAO,IAAI,WAAW,IAAI;AAErE,SAAO;AAAA,IACL,UAAU,EAAE,YAAY,MAAM;AAAA,IAC9B,aAAa,EAAE,WAAW,OAAO,eAAe,CAAC,EAAE;AAAA,IACnD;AAAA,IACA,cAAc,EAAE,OAAO,EAAE,UAAU,gBAAgB,OAAO,YAAY,CAAC;AAAA,EACzE;AACF;;;AC5PA,IAAM,YAAoC;AAAA,EACxC,IAAI;AAAA,EACJ,OAAO;AAAA,EACP,IAAI;AAAA,EACJ,KAAK;AAAA,EACL,IAAI;AAAA,EACJ,KAAK;AACP;AAIA,SAAS,OAAO,OAAyB;AACvC,SAAO,iBAAiB,OAAO,MAAM,QAAQ,IAAI;AACnD;AAEA,SAAS,eAAe,OAAkD;AACxE,SACE,OAAO,UAAU,YACjB,UAAU,QACV,CAAC,MAAM,QAAQ,KAAK,KACpB,EAAE,iBAAiB;AAEvB;AAEA,SAAS,OAAU,OAAqB;AACtC,SAAO,MAAM,QAAQ,KAAK,IAAI,QAAQ,CAAC,KAAK;AAC9C;AAGA,SAAS,gBAAgB,OAAe,OAA+B;AACrE,MAAI,CAAC,eAAe,KAAK,EAAG,QAAO,CAAC,EAAE,CAAC,KAAK,GAAG,OAAO,KAAK,EAAE,CAAC;AAE9D,QAAM,aAAsC,CAAC;AAC7C,QAAM,QAAuB,CAAC;AAC9B,aAAW,CAAC,UAAU,OAAO,KAAK,OAAO,QAAQ,KAAK,GAAG;AACvD,QAAI,YAAY,OAAW;AAC3B,QAAI,aAAa,UAAU;AACzB,YAAM,KAAK,EAAE,CAAC,KAAK,GAAG,OAAO,OAAO,EAAE,CAAC;AAAA,IACzC,WAAW,aAAa,OAAO;AAC7B,UAAI,eAAe,OAAO,GAAG;AAC3B,cAAM,QAAQ,gBAAgB,OAAO,OAAO;AAC5C,cAAM,KAAK,EAAE,MAAM,MAAM,WAAW,IAAI,MAAM,CAAC,IAAI,EAAE,MAAM,MAAM,EAAE,CAAC;AAAA,MACtE,OAAO;AACL,mBAAW,MAAM,OAAO,OAAO;AAAA,MACjC;AAAA,IACF,WAAW,YAAY,WAAW;AAChC,iBAAW,UAAU,QAAQ,CAAC,IAAI,MAAM,QAAQ,OAAO,IACnD,QAAQ,IAAI,MAAM,IAClB,OAAO,OAAO;AAAA,IACpB,OAAO;AACL,YAAM,IAAI,MAAM,mBAAmB,QAAQ,SAAS,KAAK,IAAI;AAAA,IAC/D;AAAA,EACF;AACA,MAAI,OAAO,KAAK,UAAU,EAAE,SAAS,EAAG,OAAM,KAAK,EAAE,CAAC,KAAK,GAAG,WAAW,CAAC;AAC1E,SAAO;AACT;AAGA,SAAS,kBACP,OACAA,QACA,KACA,OACa;AACb,QAAM,WAAWA,OAAM,UAAU,GAAG;AACpC,QAAM,SAAS,MAAM,SAAS,MAAM;AAEpC,MAAI,SAAS,SAAS,aAAa;AACjC,QAAI,UAAU,KAAM,QAAO,EAAE,CAAC,SAAS,UAAW,GAAG,KAAK;AAC1D,QAAI,CAAC,eAAe,KAAK,GAAG;AAC1B,YAAM,IAAI,MAAM,IAAIA,OAAM,GAAG,IAAI,GAAG,kCAAkC;AAAA,IACxE;AACA,eAAW,QAAQ,CAAC,QAAQ,SAAS,MAAM,GAAG;AAC5C,UAAI,QAAQ,OAAO;AACjB,cAAM,IAAI;AAAA,UACR,IAAIA,OAAM,GAAG,IAAI,GAAG,gDAAgD,GAAG,yBAAyB,IAAI;AAAA,QACtG;AAAA,MACF;AAAA,IACF;AACA,WAAO,EAAE,OAAO,CAAC,EAAE,OAAO,KAAK,MAAM,UAAU,OAAO,cAAc,QAAQ,OAAgB,KAAK,EAAE,CAAC,EAAE;AAAA,EACxG;AAEA,MAAI,CAAC,eAAe,KAAK,GAAG;AAC1B,UAAM,IAAI,MAAM,IAAIA,OAAM,GAAG,IAAI,GAAG,0CAA0C;AAAA,EAChF;AACA,QAAM,UAAU,OAAO,QAAQ,KAAK,EAAE,OAAO,CAAC,CAAC,EAAEC,OAAM,MAAMA,YAAW,MAAS;AACjF,MAAI,QAAQ,WAAW,GAAG;AACxB,UAAM,IAAI,MAAM,IAAID,OAAM,GAAG,IAAI,GAAG,qCAAqC;AAAA,EAC3E;AACA,SAAO;AAAA,IACL,OAAO,QAAQ,IAAI,CAAC,CAAC,MAAMC,OAAM,MAAM;AACrC,UAAI,SAAS,UAAU,SAAS,WAAW,SAAS,QAAQ;AAC1D,cAAM,IAAI,MAAM,IAAID,OAAM,GAAG,IAAI,GAAG,qCAAqC,IAAI,IAAI;AAAA,MACnF;AACA,UAAI,CAAC,eAAeC,OAAM,GAAG;AAC3B,cAAM,IAAI,MAAM,IAAID,OAAM,GAAG,IAAI,GAAG,IAAI,IAAI,0BAA0B;AAAA,MACxE;AACA,aAAO,EAAE,OAAO,KAAK,MAAM,OAAO,cAAc,QAAQC,SAAiB,KAAK,EAAE;AAAA,IAClF,CAAC;AAAA,EACH;AACF;AAGO,SAAS,cACdD,QACA,OACA,QAAmC,CAAC,GACxB;AACZ,QAAM,aAA4B,CAAC;AAEnC,aAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,KAAgC,GAAG;AAC3E,QAAI,UAAU,OAAW;AACzB,QAAI,QAAQ,OAAO;AACjB,iBAAW,UAAU,OAAO,KAAwB,GAAG;AACrD,mBAAW,KAAK,cAAcA,QAAO,QAAQ,KAAK,CAAgB;AAAA,MACpE;AAAA,IACF,WAAW,QAAQ,MAAM;AACvB,YAAM,WAAW;AACjB,UAAI,CAAC,MAAM,QAAQ,QAAQ,KAAK,SAAS,WAAW,GAAG;AACrD,cAAM,IAAI,MAAM,YAAYA,OAAM,GAAG,4BAA4B;AAAA,MACnE;AACA,iBAAW,KAAK,EAAE,KAAK,SAAS,IAAI,CAAC,WAAW,cAAcA,QAAO,QAAQ,KAAK,CAAC,EAAE,CAAC;AAAA,IACxF,WAAW,QAAQ,OAAO;AACxB,iBAAW,UAAU,OAAO,KAAwB,GAAG;AACrD,mBAAW,KAAK,EAAE,MAAM,cAAcA,QAAO,QAAQ,KAAK,EAAE,CAAC;AAAA,MAC/D;AAAA,IACF,WAAWA,OAAM,WAAW,IAAI,GAAG,GAAG;AACpC,iBAAW,KAAK,GAAG,gBAAgB,KAAK,KAAK,CAAC;AAAA,IAChD,WAAW,OAAOA,OAAM,WAAW;AACjC,iBAAW,KAAK,kBAAkB,OAAOA,QAAO,KAAK,KAAK,CAAC;AAAA,IAC7D,OAAO;AACL,YAAM,IAAI,MAAM,IAAIA,OAAM,GAAG,8BAA8B,GAAG,IAAI;AAAA,IACpE;AAAA,EACF;AAIA,QAAM,SAAsB,CAAC;AAC7B,QAAM,OAAsB,CAAC;AAC7B,aAAW,aAAa,YAAY;AAClC,UAAM,CAAC,KAAK,IAAI,OAAO,QAAQ,SAAS;AACxC,QAAI,MAAM,CAAC,MAAM,WAAW,OAAO,KAAK,SAAS,EAAE,WAAW,GAAG;AAG/D,aAAO,QAAQ;AAAA,QACb,GAAK,OAAO,SAAmC,CAAC;AAAA,QAChD,GAAI,MAAM,CAAC;AAAA,MACb;AAAA,IACF,WACE,OAAO,KAAK,SAAS,EAAE,WAAW,KAClC,EAAE,MAAM,CAAC,KAAK,WACd,MAAM,CAAC,MAAM,QACb;AACA,aAAO,MAAM,CAAC,CAAC,IAAI,MAAM,CAAC;AAAA,IAC5B,OAAO;AACL,WAAK,KAAK,SAAS;AAAA,IACrB;AAAA,EACF;AACA,MAAI,KAAK,SAAS,EAAG,QAAO,OAAO;AACnC,SAAO;AACT;AAEO,SAAS,cACdA,QACA,SAC4C;AAC5C,MAAI,YAAY,OAAW,QAAO;AAClC,QAAM,QAAwC,CAAC;AAC/C,aAAW,SAAS,OAAO,OAA4D,GAAG;AACxF,eAAW,CAAC,OAAO,SAAS,KAAK,OAAO,QAAQ,KAAK,GAAG;AACtD,UAAI,CAACA,OAAM,WAAW,IAAI,KAAK,GAAG;AAChC,cAAM,IAAI,MAAM,IAAIA,OAAM,GAAG,2BAA2B,KAAK,IAAI;AAAA,MACnE;AACA,UAAI,cAAc,SAAS,cAAc,QAAQ;AAC/C,cAAM,IAAI,MAAM,cAAcA,OAAM,GAAG,IAAI,KAAK,4BAA4B;AAAA,MAC9E;AACA,YAAM,KAAK,IAAI;AAAA,IACjB;AAAA,EACF;AACA,SAAO;AACT;AAYA,SAAS,WAAWA,QAAkB,MAAuB;AAC3D,SACE,SAAS,QACT,SAAS,eACT,SAAS,eACT,QAAQA,OAAM,WACdA,OAAM,WAAW,IAAI,IAAI;AAE7B;AAMO,SAAS,YACdA,QACA,QAC0D;AAC1D,QAAM,SAAmB,CAAC;AAC1B,QAAM,YAAqC,CAAC;AAC5C,aAAW,CAAC,MAAM,KAAK,KAAK,OAAO,QAAQ,MAAM,GAAG;AAClD,QAAI,UAAU,UAAa,UAAU,MAAO;AAC5C,QAAI,QAAQA,OAAM,WAAW;AAC3B,gBAAU,IAAI,IAAI;AAClB;AAAA,IACF;AACA,QAAI,CAAC,WAAWA,QAAO,IAAI,GAAG;AAC5B,YAAM,IAAI,MAAM,IAAIA,OAAM,GAAG,mBAAmB,IAAI,cAAc;AAAA,IACpE;AACA,QAAI,UAAU,MAAM;AAClB,YAAM,IAAI,MAAM,IAAIA,OAAM,GAAG,IAAI,IAAI,kCAAkC;AAAA,IACzE;AACA,WAAO,KAAK,IAAI;AAAA,EAClB;AACA,SAAO,EAAE,QAAQ,UAAU;AAC7B;AAOA,SAAS,YACPA,QACA,MACA,OACyB;AACzB,QAAM,SAAkC,EAAE,GAAI,KAAK,WAAW,CAAC,EAAG;AAClE,aAAW,CAAC,MAAM,KAAK,KAAK,OAAO,QAAQ,OAAO,aAAa,CAAC,CAAC,GAAG;AAClE,UAAM,QAAQ,OAAO,IAAI;AACzB,QAAI,UAAU,UAAa,UAAU,SAAS,UAAU,MAAM;AAC5D,aAAO,IAAI,IAAI,UAAU,QAAQ,OAAO,UAAU,WAAW,QAAQ;AACrE;AAAA,IACF;AACA,QAAI,UAAU,QAAQ,UAAU,SAAS,UAAU,OAAW;AAC9D,UAAM,IAAI;AACV,UAAM,IAAI;AACV,UAAM,WAAoC,EAAE,GAAG,EAAE;AACjD,eAAW,CAAC,KAAK,IAAI,KAAK,OAAO,QAAQ,CAAC,GAAG;AAC3C,UAAI,SAAS,OAAW;AACxB,UAAI,QAAQ,YAAY,QAAQ,WAAW;AACzC,iBAAS,GAAG,IAAI,EAAE,GAAK,EAAE,GAAG,KAA4B,CAAC,GAAI,GAAI,KAAgB;AAAA,MACnF,WAAW,EAAE,GAAG,MAAM,UAAa,KAAK,UAAU,EAAE,GAAG,CAAC,MAAM,KAAK,UAAU,IAAI,GAAG;AAClF,cAAM,IAAI,MAAM,IAAIA,OAAM,GAAG,IAAI,IAAI,qBAAqB,GAAG,4BAA4B;AAAA,MAC3F,OAAO;AACL,iBAAS,GAAG,IAAI;AAAA,MAClB;AAAA,IACF;AACA,WAAO,IAAI,IAAI;AAAA,EACjB;AACA,SAAO;AACT;AAGO,SAAS,aACd,OACAA,QACA,MACA,QAAiC,CAAC,GACT;AACzB,QAAM,UAAmC,EAAE,GAAG,MAAM;AACpD,MAAI,KAAK,UAAU,OAAW,SAAQ,QAAQ,cAAcA,QAAO,KAAK,OAAgB,KAAK;AAC7F,QAAM,QAAQ,cAAcA,QAAO,KAAK,OAAO;AAC/C,MAAI,UAAU,OAAW,SAAQ,QAAQ;AACzC,MAAI,KAAK,SAAS,OAAW,SAAQ,QAAQ,KAAK;AAClD,MAAI,KAAK,UAAU,OAAW,SAAQ,QAAQ,KAAK;AAEnD,QAAM,QAAQ,KAAK,WAAW,SAAY,OAAO,YAAYA,QAAO,KAAK,MAAM;AAC/E,MAAI,UAAU,MAAM;AAGlB,YAAQ,SAAS,MAAM,OAAO,SAAS,IAAI,MAAM,SAAS,CAAC,IAAI;AAAA,EACjE;AACA,QAAM,YAAY,YAAYA,QAAO,MAAM,KAAK;AAEhD,QAAM,OAAgC,EAAE,GAAG,QAAQ;AACnD,aAAW,CAAC,MAAM,KAAK,KAAK,OAAO,QAAQ,SAAS,GAAG;AACrD,QAAI,UAAU,UAAa,UAAU,MAAO;AAC5C,UAAM,WAAWA,OAAM,UAAU,IAAI;AACrC,QAAI,CAAC,UAAU;AACb,YAAM,IAAI,MAAM,IAAIA,OAAM,GAAG,sBAAsB,IAAI,eAAe;AAAA,IACxE;AACA,SAAK,IAAI,IAAI;AAAA,MACX;AAAA,MACA,MAAM,SAAS,MAAM;AAAA,MACrB,UAAU,OAAO,CAAC,IAAK;AAAA,IACzB;AAAA,EACF;AACA,SAAO;AACT;AAUO,SAAS,SACd,OACAA,QACA,MACc;AACd,QAAM,QACJ,KAAK,WAAW,SAAY,OAAO,YAAYA,QAAO,KAAK,MAAM;AACnE,QAAM,YAAY,YAAYA,QAAO,MAAM,KAAK;AAEhD,QAAM,SAAwC,CAAC;AAC/C,aAAW,CAAC,MAAM,KAAK,KAAK,OAAO,QAAQ,SAAS,GAAG;AACrD,QAAI,UAAU,UAAa,UAAU,MAAO;AAC5C,UAAM,WAAWA,OAAM,UAAU,IAAI;AACrC,QAAI,CAAC,SAAU;AACf,WAAO,KAAK;AAAA,MACV;AAAA,MACA,UAAU,OAAO,OAAO,SAAS,OAAO,MAAM,SAAS,MAAM,GAAG,KAAiB;AAAA,IACnF,CAAC;AAAA,EACH;AACA,MAAI,UAAU,QAAQ,OAAO,MAAM,CAAC,CAAC,EAAE,KAAK,MAAM,UAAU,IAAI,EAAG,QAAO;AAE1E,QAAM,SAAS,OAAO,UAAU;AAChC,SAAO,CAAC,QAAQ;AACd,QAAI;AACJ,QAAI,WAAW,MAAM;AACnB,eAAS,EAAE,GAAG,IAAI;AAAA,IACpB,OAAO;AACL,eAAS,CAAC;AACV,iBAAW,SAAS,OAAQ,KAAI,SAAS,IAAK,QAAO,KAAK,IAAI,IAAI,KAAK;AAAA,IACzE;AACA,eAAW,CAAC,MAAM,KAAK,KAAK,QAAQ;AAClC,YAAM,QAAQ,IAAI,IAAI;AACtB,UAAI,UAAU,OAAW;AACzB,aAAO,IAAI,IACT,UAAU,QAAQ,UAAU,OACxB,QACA,MAAM,QAAQ,KAAK,IACjB,MAAM,IAAI,CAAC,UAAU,MAAM,KAAgC,CAAC,IAC5D,MAAM,KAAgC;AAAA,IAChD;AACA,WAAO;AAAA,EACT;AACF;;;AC1XA,IAAM,cAA+C;AAAA,EACnD,OAAO,sBAAsB;AAAA,EAC7B,MAAM,sBAAsB;AAAA,EAC5B,QAAQ,sBAAsB;AAAA,EAC9B,QAAQ,sBAAsB;AAAA,EAC9B,WAAW,sBAAsB;AAAA,EACjC,OAAO,sBAAsB;AAAA,EAC7B,OAAO,sBAAsB;AAC/B;AAiCO,SAAS,KAAK,MAA8B;AACjD,QAAM,QAAQ,YAAY,IAAI;AAC9B,MAAI,UAAU,OAAW,OAAM,IAAI,MAAM,iBAAiB,IAAI,IAAI;AAClE,SAAO,EAAE,UAAU,QAAQ,MAAM;AACnC;AAMO,SAAS,OACd,OACmB;AACnB,SAAO,EAAE,UAAU,UAAU,MAAM;AACrC;AAGO,SAAS,MACd,MACkB;AAClB,SAAO,EAAE,UAAU,SAAS,KAAK;AACnC;AAkCO,SAAS,UAAU,MAAiE;AACzF,SAAO,EAAE,UAAU,SAAS,KAAK;AACnC;AAUO,SAAS,WACdE,QACA,QACuB;AACvB,SAAO,EAAE,UAAU,cAAc,OAAAA,QAAO,OAAO;AACjD;AA+BO,IAAM,QAAN,MAAM,OAAiC;AAAA,EAC5C,YACW,QACA,UAAwB,CAAC,GACzB,QAAmB,CAAC,GAC7B;AAHS;AACA;AACA;AAAA,EACR;AAAA,EAHQ;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EAIX,OAAO,OAA4B;AACjC,WAAO,IAAI,OAAM,KAAK,QAAQ,KAAK,SAAS,KAAK;AAAA,EACnD;AACF;AAEO,SAAS,MAAwB,QAAW,UAAwB,CAAC,GAAa;AACvF,SAAO,IAAI,MAAM,QAAQ,OAAO;AAClC;AA8PA,IAAM,eAA2C;AAAA,EAC/C,SAAS;AAAA,EACT,SAAS;AAAA,EACT,UAAU;AACZ;AAOO,SAASC,QACd,QACA,UAAmD,CAAC,GACzC;AACX,QAAM,WAAyC,CAAC;AAChD,QAAM,QAA0B,CAAC;AACjC,QAAM,QAAmC,CAAC;AAC1C,QAAM,cAAmC,CAAC;AAE1C,aAAW,CAAC,KAAK,UAAU,KAAK,OAAO,QAAQ,MAAM,GAAG;AACtD,QAAI,CAAC,yBAAyB,KAAK,GAAG,GAAG;AACvC,YAAM,IAAI,MAAM,eAAe,GAAG,uDAAuD;AAAA,IAC3F;AACA,QAAI,EAAE,sBAAsB,QAAQ;AAClC,YAAM,IAAI,MAAM,IAAI,GAAG,wDAAwD;AAAA,IACjF;AACA,UAAM,OAAkB,EAAE,KAAK,SAAS,CAAC,GAAG,WAAW,CAAC,GAAG,YAAY,oBAAI,IAAI,CAAC,IAAI,CAAC,EAAE;AACvF,UAAM,aAA2B,CAAC;AAElC,eAAW,CAAC,MAAM,MAAM,KAAK,OAAO,QAAQ,WAAW,MAAM,GAAG;AAC9D,UAAI,CAAC,MAAM,aAAa,aAAa,YAAY,EAAE,SAAS,IAAI,GAAG;AACjE,cAAM,IAAI,MAAM,IAAI,GAAG,IAAI,IAAI,6CAA6C;AAAA,MAC9E;AACA,UAAI,kBAAkB,OAAO;AAC3B,cAAM,UAAU,qBAAqB,SAAS,OAAO,OAAO,eAAe,IAAI;AAC/E,YAAI,WAAW,YAAY,UAAU,EAAE,WAAW,WAAW,WAC3D,CAAC,OAAO,QAAQ,WAAW,MAAM,EAAE,KAAK,CAAC,CAAC,OAAO,KAAK,MAAM,iBAAiB,aAAa,GAAG,KAAK,SAAS,OAAO;AAClH,gBAAM,IAAI,MAAM,kBAAkB,GAAG,IAAI,IAAI,8BAA8B,OAAO,GAAG;AACvF,YAAI,WAAW,YAAY,UAAU,WAAW,WAAW,QAAQ;AACjE,gBAAM,QAAQ,WAAW,OAAO,OAAO;AACvC,cAAI,EAAE,iBAAiB,UAAU,MAAM,SAAS,YAAY,qBAAqB;AAC/E,kBAAM,IAAI,MAAM,kBAAkB,GAAG,IAAI,IAAI,0CAA0C;AAAA,QAC3F;AACA,mBAAW,IAAI,IAAI;AAAA,UACjB,MAAM,OAAO;AAAA;AAAA;AAAA,UAGb,UAAU,UAAU,OAAO,OAAO;AAAA,UAClC,GAAI,UAAU,EAAE,UAAU,EAAE,SAAS,UAAU,CAAC,OAAO,YAAY,GAAI,OAAO,aAAa,EAAE,cAAc,cAAc,OAAO,MAAM,OAAO,YAAY,EAAE,IAAI,CAAC,EAAG,EAAE,IAAI,CAAC;AAAA,UAC1K,SAAS,OAAO,aAAa;AAAA,UAC7B,QAAQ,OAAO,YAAY;AAAA,UAC3B,GAAI,OAAO,cAAc,CAAC,UAAU,EAAE,SAAS,cAAc,OAAO,MAAM,OAAO,YAAY,EAAE,IAAI,CAAC;AAAA,QACtG;AACA,aAAK,QAAQ,IAAI,IAAI;AAAA,UACnB,MAAM,OAAO;AAAA,UACb,UAAU,OAAO;AAAA,UACjB,YAAY,OAAO;AAAA,UACnB,cAAc,OAAO;AAAA,QACvB;AACA,YAAI,OAAO,SAAS,UAAU,CAAC,QAAS,MAAK,WAAW,IAAI,IAAI;AAAA,MAClE,WAAW,kBAAkB,WAAW;AACtC,YAAI,EAAE,OAAO,UAAU,SAAS;AAC9B,gBAAM,IAAI,MAAM,IAAI,GAAG,IAAI,IAAI,iBAAiB,OAAO,MAAM,0BAA0B;AAAA,QACzF;AACA,cAAM,aAAa,GAAG,IAAI;AAC1B,YAAI,cAAc,WAAW,QAAQ;AACnC,gBAAM,IAAI,MAAM,IAAI,GAAG,IAAI,UAAU,2BAA2B,GAAG,IAAI,IAAI,WAAW;AAAA,QACxF;AACA,mBAAW,UAAU,IAAI;AAAA,UACvB,MAAM;AAAA,UACN,UAAU,OAAO;AAAA,UACjB,SAAS;AAAA;AAAA,UAET,YAAY,EAAE,OAAO,IAAI,QAAQ,MAAM,UAAU,aAAa,OAAO,QAAQ,EAAE;AAAA,QACjF;AACA,aAAK,UAAU,IAAI,IAAI;AAAA,UACrB,MAAM;AAAA,UACN,QAAQ,OAAO;AAAA,UACf,MAAM,GAAG,GAAG,IAAI,IAAI;AAAA,UACpB;AAAA,UACA,UAAU,OAAO;AAAA,QACnB;AACA,aAAK,WAAW,IAAI,UAAU;AAAA,MAChC,WAAW,kBAAkB,SAAS;AACpC,YAAI,EAAE,OAAO,UAAU,SAAS;AAC9B,gBAAM,IAAI,MAAM,IAAI,GAAG,IAAI,IAAI,eAAe,OAAO,MAAM,0BAA0B;AAAA,QACvF;AAEA,aAAK,UAAU,IAAI,IAAI,EAAE,MAAM,WAAW,QAAQ,OAAO,QAAQ,MAAM,GAAG;AAAA,MAC5E,OAAO;AACL,cAAM,IAAI,MAAM,IAAI,GAAG,IAAI,IAAI,sDAAsD;AAAA,MACvF;AAAA,IACF;AAEA,aAAS,GAAG,IAAI;AAChB,UAAM,GAAG,IAAI;AACb,UAAM,YAAY,gBAAgB,KAAK,WAAW,OAAO,KAAK;AAC9D,QAAI,UAAW,aAAY,GAAG,IAAI;AAAA,EACpC;AAKA,QAAM,gBAAgB,oBAAI,IAAoB;AAC9C,aAAW,QAAQ,OAAO,OAAO,KAAK,GAAG;AACvC,eAAW,CAAC,MAAM,QAAQ,KAAK,OAAO,QAAQ,KAAK,SAAS,GAAG;AAC7D,UAAI,SAAS,SAAS,UAAW;AACjC,YAAM,SAAU,OAAO,KAAK,GAAG,EAAY,OAAO,IAAI;AACtD,YAAM,aAAa,OAAO,QAAQ,MAAM,SAAS,MAAM,EAAE,SAAS,EAAE;AAAA,QAClE,CAAC,CAAC,EAAE,KAAK,MAAM,MAAM,SAAS,eAAe,MAAM,WAAW,KAAK;AAAA,MACrE;AACA,YAAM,SAAS,OAAO,UAClB,WAAW,OAAO,CAAC,CAAC,KAAK,MAAM,UAAU,OAAO,OAAO,IACvD;AACJ,UAAI,OAAO,WAAW,GAAG;AACvB,cAAM,IAAI;AAAA,UACR,OAAO,WAAW,IACd,IAAI,KAAK,GAAG,IAAI,IAAI,gCAAgC,KAAK,GAAG,UAAU,SAAS,MAAM,OACrF,IAAI,KAAK,GAAG,IAAI,IAAI,0CAA0C,SAAS,MAAM;AAAA,QACnF;AAAA,MACF;AACA,YAAM,CAAC,cAAc,OAAO,IAAI,OAAO,CAAC;AACxC,UAAI,cAAc,IAAI,QAAQ,IAAI,GAAG;AACnC,cAAM,IAAI,MAAM,IAAI,QAAQ,IAAI,yCAAyC;AAAA,MAC3E;AACA,oBAAc,IAAI,QAAQ,MAAM,IAAI;AACpC,eAAS,OAAO,QAAQ;AACxB,eAAS,aAAa,GAAG,YAAY;AAAA,IACvC;AAAA,EACF;AAEA,aAAW,QAAQ,OAAO,OAAO,KAAK,GAAG;AACvC,eAAW,CAAC,MAAM,QAAQ,KAAK,OAAO,QAAQ,KAAK,SAAS,GAAG;AAC7D,UAAI,SAAS,SAAS,YAAa;AACnC,YAAM,KAAK;AAAA,QACT,SAAS,SAAS;AAAA,QAClB,MAAM;AAAA,QACN,SAAS;AAAA,UACP,WAAW,SAAS;AAAA,UACpB,OAAO,cAAc,IAAI,SAAS,IAAI,KAAK,KAAK,KAAK,GAAG,IAAI,IAAI;AAAA,UAChE,KAAK;AAAA,QACP;AAAA,QACA,SAAS,EAAE,WAAW,KAAK,KAAK,OAAO,MAAM,KAAK,MAAM;AAAA,QACxD,YAAY,EAAE,WAAW,KAAK,KAAK,WAAW,SAAS,WAAY;AAAA,MACrE,CAAC;AAAA,IACH;AAAA,EACF;AAEA,QAAM,SAAiC,CAAC;AACxC,aAAW,CAAC,KAAK,UAAU,KAAK,OAAO,QAAQ,MAAM,GAAG;AACtD,QAAI,WAAW,QAAQ,UAAU,OAAW,QAAO,GAAG,IAAI,WAAW,QAAQ;AAAA,EAC/E;AAEA,QAAM,QAAQ,QAAQ;AACtB,aAAW,CAAC,QAAQ,IAAI,KAAK,OAAO,QAAQ,SAAS,CAAC,CAAC,GAAG;AACxD,QAAI,CAAC,CAAC,QAAQ,SAAS,QAAQ,EAAE,SAAS,MAAM,GAAG;AACjD,YAAM,IAAI,MAAM,SAAS,MAAM,mDAAmD;AAAA,IACpF;AACA,QAAI,MAAM,aAAa,gBAAgB,EAAE,KAAK,SAAS,SAAS;AAC9D,YAAM,IAAI,MAAM,SAAS,MAAM,oBAAoB,KAAK,KAAK,0BAA0B;AAAA,IACzF;AACA,QAAK,MAA4C,aAAa,UAAU;AACtE,YAAM,IAAI,MAAM,SAAS,MAAM,iEAAiE;AAAA,IAClG;AAAA,EACF;AAEA,QAAM,WAAW,aAAa,EAAE,UAAU,OAAO,aAAa,OAAO,CAAC;AACtE,SAAO,EAAE,GAAG,UAAU,GAAI,SAAS,OAAO,KAAK,KAAK,EAAE,SAAS,IAAI,EAAE,MAAqC,IAAI,CAAC,GAAI,QAAQ,MAAM;AACnI;AAGA,SAAS,cAAc,MAAkB,OAAwC;AAC/E,MAAI,UAAU,QAAQ,UAAU,OAAW,QAAO;AAClD,UAAQ,MAAM;AAAA,IACZ,KAAK;AACH,aAAO,QAAQ,IAAI;AAAA,IACrB,KAAK;AACH,aAAO,iBAAiB,OAAO,MAAM,QAAQ,IAAI,OAAO,UAAU,WAAW,KAAK,MAAM,KAAK,IAAI,OAAO,KAAK;AAAA,IAC/G,KAAK;AACH,aAAO,KAAK,UAAU,KAAK;AAAA,IAC7B,KAAK;AACH,aAAO,OAAO,KAAK;AAAA,IACrB;AACE,aAAO,OAAO,KAAK;AAAA,EACvB;AACF;AAEA,SAAS,gBACP,KACA,OACA,OAC0F;AAC1F,QAAM,MAAoF,CAAC;AAC3F,aAAW,CAAC,QAAQ,QAAQ,KAAK,OAAO,QAAQ,KAAK,GAA6C;AAChG,QAAI,aAAa,OAAW;AAC5B,UAAM,eAAe,WAAW,SAAS,SAAS;AAClD,QAAI,SAAS,aAAa,QAAQ;AAChC,UAAI,YAAY,IAAI,SAAS;AAAA,IAC/B,WAAW,SAAS,aAAa,UAAU;AACzC,UAAI,WAAW,OAAQ,OAAM,IAAI,MAAM,IAAI,GAAG,IAAI,MAAM,qCAAqC;AAC7F,YAAM,QAAQ,SAAS;AACvB,UAAI,OAAO;AAAA,QACT,OAAO,CAAC,SAAS;AACf,gBAAM,SAAS,MAAM,EAAE,KAAK,CAAC;AAC7B,gBAAM,WAAW,MAAM,QAAQ,MAAM,IAAI,SAAS,CAAC,MAAM;AACzD,iBAAO,SAAS,IAAI,CAAC,WAAW,cAAc,MAAM,GAAG,GAAG,MAAuB,CAAC;AAAA,QACpF;AAAA,MACF;AAAA,IACF,OAAO;AACL,YAAM,OAAO,SAAS;AACtB,UAAI,YAAY,IAAI,CAAC,YACnB,KAAK,EAAE,MAAM,QAAQ,MAAM,KAAK,QAAQ,MAAe,MAAM,QAAQ,MAAM,SAAS,QAAQ,QAAQ,CAAC;AAAA,IACzG;AAAA,EACF;AACA,SAAO,OAAO,KAAK,GAAG,EAAE,SAAS,IAAI,MAAM;AAC7C;","names":["model","filter","model","schema"]}
|
package/dist/cli.d.ts
ADDED
|
@@ -0,0 +1,44 @@
|
|
|
1
|
+
#!/usr/bin/env node
|
|
2
|
+
/**
|
|
3
|
+
* tapedb CLI.
|
|
4
|
+
*
|
|
5
|
+
* `init` writes the files a Worker needs, and nothing else:
|
|
6
|
+
* tapedb.schema.ts the models
|
|
7
|
+
* worker.ts the Worker entry (two exports)
|
|
8
|
+
* wrangler.jsonc one Durable Object class, two R2 buckets
|
|
9
|
+
* .dev.vars the claim secret, so dev works with no configuration
|
|
10
|
+
* tapedb/ the first migration, its snapshot and the bundle
|
|
11
|
+
*
|
|
12
|
+
* Existing files are kept, never overwritten, so `init` is safe to re-run.
|
|
13
|
+
* `migrate` keeps tapedb/ in step with the schema; `deploy` refuses to ship a
|
|
14
|
+
* development configuration or an unmigrated schema.
|
|
15
|
+
*/
|
|
16
|
+
/**
|
|
17
|
+
* Data residency is all or nothing: the Durable Objects (TAPEDB_JURISDICTION)
|
|
18
|
+
* and every R2 bucket in the same jurisdiction, or none restricted.
|
|
19
|
+
*/
|
|
20
|
+
declare function checkJurisdiction(vars: Record<string, string>, buckets: Array<{
|
|
21
|
+
binding?: string;
|
|
22
|
+
bucket_name?: string;
|
|
23
|
+
jurisdiction?: string;
|
|
24
|
+
}>): string | null;
|
|
25
|
+
/**
|
|
26
|
+
* Streams a workspace export to a file or stdout. Uses TAPEDB_TOKEN when set,
|
|
27
|
+
* otherwise mints a dev claim (which only `tapedb dev` serves).
|
|
28
|
+
*/
|
|
29
|
+
declare function exportWorkspace(argv: string[]): Promise<number>;
|
|
30
|
+
/**
|
|
31
|
+
* Erases a workspace: DELETE /engine/workspaces/:id with an owner claim
|
|
32
|
+
* (TAPEDB_TOKEN, or a dev claim). Irreversible, so the id is typed twice.
|
|
33
|
+
*/
|
|
34
|
+
declare function eraseWorkspace(argv: string[]): Promise<number>;
|
|
35
|
+
/** Runs the CLI and returns its exit code. Importable without side effects. */
|
|
36
|
+
declare function run(argv: string[]): Promise<number>;
|
|
37
|
+
/**
|
|
38
|
+
* True when this module is the process entry point. `npx @tapedb/tapedb` runs it
|
|
39
|
+
* through the node_modules/.bin symlink: argv[1] is the link, while
|
|
40
|
+
* import.meta.url is the resolved file, so both are compared after resolving.
|
|
41
|
+
*/
|
|
42
|
+
declare function isEntryPoint(entry: string | undefined, moduleUrl: string): boolean;
|
|
43
|
+
|
|
44
|
+
export { checkJurisdiction, eraseWorkspace, exportWorkspace, isEntryPoint, run };
|