@supalive/core 1.13.1 → 1.15.0

package/dist/query-Bk2W-ynQ.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"query-Bk2W-ynQ.js","names":["formatComment","z"],"sources":["../src/db/sqlcommenter.ts","../src/db/query.ts"],"sourcesContent":["export function comment(input: string | Record<string, string>): string {\n    if (!input) return \"\";\n    if (typeof input === \"string\") return `/*${input}*/`;\n    const entries = Object.entries(input).filter(([_, v]) => v != null);\n    if (entries.length === 0) return \"\";\n    const pairs = entries\n        .map(([k, v]) => `${encodeURIComponent(k)}='${encodeURIComponent(v)}'`)\n        .sort();\n    return `/*${pairs.join(\",\")}*/`;\n}\n","import { z, ZodRawShape } from \"zod\";\nimport { Predicate, LeafPredicate, CompareOperator, QuerySpec, RangeRead } from \"./types_db\";\nimport {\n    ColumnCodec, ComputedCodec, ComputedDataType, ComputedField, ComputedFieldConfig,\n    InferSchema, Model, OverrideField, Prettify, SchemaDefinition\n} from \"./schema\";\nimport { TxContext } from \"./context\";\nimport { normalizeCodec } from \"./codec\";\nimport { SqlBuilder } from \"./db\";\nimport { bytesEqual } from \"./bytes\";\nimport { comment as formatComment } from \"./sqlcommenter\";\n\n// Decoded value type of a schema field (codec-applied), narrowed to the\n// caller's key. `K` is not constrained to `keyof InferSchema<S>` so callers\n// can pass a key constrained to a subset (e.g. StringFieldKeys) without\n// TypeScript widening the resulting value type.\ntype FieldValue<S extends SchemaDefinition<string, ZodRawShape>, K> =\n    K extends keyof InferSchema<S> ? InferSchema<S>[K] : never;\n\ntype OrderableValue = number | bigint | string | Date;\n\n// Keys whose decoded value is string-like (covers `string`, string literal\n// unions like enums, and `string | null | undefined`).\ntype StringFieldKeys<S extends SchemaDefinition<string, ZodRawShape>> = {\n    [K in keyof InferSchema<S>]: NonNullable<InferSchema<S>[K]> extends string ? K : never;\n}[keyof InferSchema<S>];\n\n// Keys whose decoded value supports SQL ordering (gt/gte/lt/lte/between).\ntype OrderableFieldKeys<S extends SchemaDefinition<string, ZodRawShape>> = {\n    [K in keyof InferSchema<S>]: NonNullable<InferSchema<S>[K]> extends OrderableValue ? K : never;\n}[keyof InferSchema<S>];\n\n// Keys whose decoded value is shaped like a JSON/JSONB column (object/array/unknown).\n// Used to constrain jsonContains / jsonContainedBy / jsonHasKey / jsonArrayContains\n// so they can't be invoked on plain scalar fields.\ntype JsonFieldKeys<S extends SchemaDefinition<string, ZodRawShape>> = {\n    [K in keyof InferSchema<S>]:\n    NonNullable<InferSchema<S>[K]> extends OrderableValue ? never :\n    NonNullable<InferSchema<S>[K]> extends boolean ? never :\n    NonNullable<InferSchema<S>[K]> extends (object | unknown[]) ? K :\n    unknown extends NonNullable<InferSchema<S>[K]> ? K :\n    never;\n}[keyof InferSchema<S>];\n\nexport interface JsonOpOptions {\n    /**\n     * Skip client-side preparation of the value (no JSON-stringify, no key\n     * escaping). The caller is responsible for the exact form the dialect\n     * expects: a JSON path string for jsonHasKey, a JSON-encoded string for\n     * the contains family.\n     */\n    raw?: true;\n}\n\nexport interface JsonContainsOptions extends JsonOpOptions {\n    /**\n     * Sub-path into the target JSON to scope the check to. `string` is a\n     * single literal top-level key; `string[]` is a nested literal-key path\n     * compiled to `$.\"a\".\"b\"`. Mutually exclusive with `pathRaw`.\n     */\n    path?: string | string[];\n    /**\n     * Raw jsonpath expression used verbatim by the dialect (PG `jsonpath`,\n     * MySQL JSON path). Mutually exclusive with `path`.\n     */\n    pathRaw?: string;\n}\n\nexport interface JsonHasKeyMultiOptions extends JsonOpOptions {\n    /** Required for the multi-path overload — chooses any vs every. */\n    mode: \"one\" | \"all\";\n}\n\n// Escape and join a key path into a JSON path expression usable by both\n// PG (`jsonb_path_exists`) and MySQL (`JSON_CONTAINS_PATH`):\n//   [\"a\", \"b.c\"] → `$.\"a\".\"b.c\"`\nfunction jsonKeysToPath(keys: string[]): string {\n    let out = \"$\";\n    for (const k of keys) {\n        out += `.\"${k.replace(/\"/g, '\\\\\"')}\"`;\n    }\n    return out;\n}\n\n// Resolve the `path` / `pathRaw` option pair down to a single jsonpath\n// expression. Returns a string in `$.\"...\"` form for structured `path`,\n// or the caller's `pathRaw` verbatim. Returns `undefined` when neither is\n// set. Throws when both are supplied.\nfunction resolveJsonPath(opts: JsonContainsOptions | undefined): string | undefined {\n    if (opts?.path !== undefined && opts?.pathRaw !== undefined) {\n        throw new Error(\"jsonContains: pass either `path` or `pathRaw`, not both\");\n    }\n    if (opts?.pathRaw !== undefined) return opts.pathRaw;\n    if (opts?.path !== undefined) {\n        const arr = Array.isArray(opts.path) ? opts.path : [opts.path];\n        return jsonKeysToPath(arr);\n    }\n    return undefined;\n}\n\nexport class QueryBuilder<S extends SchemaDefinition<string, ZodRawShape>> {\n    constructor(\n        protected ctx: TxContext,\n        protected model: Model\n    ) { }\n\n    protected getColumnName(key: string): string {\n        return this.model.columns[key] ?? key;\n    }\n\n    select(): SelectQueryBuilder<S, keyof InferSchema<S>>;\n    select<K extends keyof InferSchema<S>>(...columns: K[]): SelectQueryBuilder<S, K>;\n    select<K extends keyof InferSchema<S>>(...columns: K[]): SelectQueryBuilder<S, K> {\n        const selectedProps = (columns.length > 0 ? columns : Object.keys(this.model.columns)) as K[];\n        return new SelectQueryBuilder<S, K>(this.ctx, this.model, [], null, null, null, selectedProps);\n    }\n}\n\nexport type IdAndCommitTs = { id: string; commitTs: bigint };\n\n// Row type returned by `.get()`, `.find()`, `.first()`. Selected schema keys\n// plus the always-included id/commitTs and any computed fields, flattened so\n// the IDE renders a plain object literal instead of an intersection chain.\ntype SelectRow<\n    S extends SchemaDefinition<string, ZodRawShape>,\n    K extends keyof InferSchema<S>,\n    C extends Record<string, unknown>,\n> = Prettify<Pick<InferSchema<S>, Extract<K | \"id\" | \"commitTs\", keyof InferSchema<S>>> & C>;\n\nexport type OrderDirection = \"ASC\" | \"DESC\";\n\nexport interface OrderByOptions {\n    direction?: OrderDirection;\n    nulls?: \"first\" | \"last\";\n    collate?: string;\n}\n\n/**\n * Cursor-based pagination using a timestamp column and a unique ID column.\n *\n * Generates a stable cursor predicate:\n *\n * DESC (default):\n * ```sql\n * WHERE (timeCol < ? OR (timeCol = ? AND idCol < ?))\n * ORDER BY timeCol DESC, idCol DESC\n * ```\n *\n * ASC:\n * ```sql\n * WHERE (timeCol > ? OR (timeCol = ? AND idCol > ?))\n * ORDER BY timeCol ASC, idCol ASC\n * ```\n */\nexport interface PaginationClause<\n    S extends SchemaDefinition<string, ZodRawShape>,\n    Time extends OrderableFieldKeys<S>,\n    Id extends OrderableFieldKeys<S>,\n> {\n    /** Timestamp column used for cursor pagination. */\n    timeCol: Time;\n\n    /**\n     * Unique tie-breaker column.\n     *\n     * @default \"id\"\n     */\n    idCol?: Id;\n\n    /**\n     * Pagination direction.\n     *\n     * - `\"desc\"` (default): Newest → oldest.\n     * - `\"asc\"`: Oldest → newest.\n     *\n     * @default \"desc\"\n     */\n    direction?: OrderDirection;\n\n    /**\n     * Maximum number of rows to return.\n     */\n    limit?: number;\n\n    /**\n     * Cursor returned from the previous page.\n     *\n     * Omit or set to `null` to fetch the first page.\n     */\n    cursor?: {\n        time: FieldValue<S, Time>;\n        id: FieldValue<S, Id>;\n    } | null;\n}\n\nclass SelectQueryBuilder<\n    S extends SchemaDefinition<string, ZodRawShape>,\n    K extends keyof InferSchema<S> = never,\n    C extends Record<string, unknown> = {},\n> {\n    private filters: ((fb: FilterBuilder<S>) => void)[] = [];\n    private paginationClause: PaginationClause<S, OrderableFieldKeys<S>, OrderableFieldKeys<S>> | null = null;\n    private orderByClause: string[] | null = null;\n    private limitVal: number | null = null;\n    private offsetVal: number | null = null;\n    private selectedProps: (keyof InferSchema<S>)[] = [];\n    private computedFields: ComputedField[] = [];\n    private commentStr: string = \"\";\n\n    constructor(\n        private ctx: TxContext,\n        private model: Model,\n        filters: ((fb: FilterBuilder<S>) => void)[] = [],\n        orderByClause: string[] | null = null,\n        limitVal: number | null = null,\n        offsetVal: number | null = null,\n        selectedProps: (keyof InferSchema<S>)[] = [],\n        computedFields: ComputedField[] = [],\n        commentStr: string = \"\",\n    ) {\n        this.filters = filters;\n        this.orderByClause = orderByClause;\n        this.limitVal = limitVal;\n        this.offsetVal = offsetVal;\n        this.selectedProps = selectedProps;\n        this.computedFields = computedFields;\n        this.commentStr = commentStr;\n    }\n\n    private getColumnName(key: string): string {\n        return this.model.columns[key] ?? key;\n    }\n\n    private getPropertyName(column: string): string {\n        return this.model.reverseColumns[column] ?? this.computedFields.find(f => f.alias === column)?.field ?? column;\n    }\n\n    private mapRowToSchema(row: Record<string, any>): Record<string, any> {\n        const result: Record<string, any> = {};\n        for (const [col, value] of Object.entries(row)) {\n            const prop = this.getPropertyName(col)\n            const codec = this.model.codecs[prop] ?? this.computedFields.find((f) => f.alias === col)?.codec;\n            result[prop] = codec?.decode && value !== undefined && value !== null ? codec.decode(value) : value;\n        }\n        return result;\n    }\n\n    where(filterFn: (fb: FilterBuilder<S>) => void): SelectQueryBuilder<S, K, C> {\n        this.filters.push(filterFn);\n        return this;\n    }\n\n    paginate<Time extends OrderableFieldKeys<S>, Id extends OrderableFieldKeys<S>>(\n        clause: PaginationClause<S, Time, Id>\n    ): SelectQueryBuilder<S, K, C> {\n        this.paginationClause = clause;\n        return this;\n    }\n\n    orderBy(column: keyof InferSchema<S> | keyof C, direction?: OrderDirection): SelectQueryBuilder<S, K, C>;\n\n    orderBy(column: keyof InferSchema<S> | keyof C, options?: OrderByOptions): SelectQueryBuilder<S, K, C>\n\n    orderBy(\n        column: keyof InferSchema<S> | keyof C,\n        directionOrOptions: OrderByOptions | OrderDirection = \"ASC\",\n    ): SelectQueryBuilder<S, K, C> {\n        const sql = this.buildOrderBySql(column, directionOrOptions);\n\n        if (!this.orderByClause) {\n            this.orderByClause = [];\n        }\n\n        this.orderByClause.push(sql);\n        return this;\n    }\n\n    private buildOrderBySql(\n        column: keyof InferSchema<S> | keyof C,\n        directionOrOptions: OrderByOptions | OrderDirection = \"ASC\",\n    ) {\n        const options: OrderByOptions =\n            typeof directionOrOptions === \"string\"\n                ? { direction: directionOrOptions }\n                : directionOrOptions;\n\n        let sql = this.getColumnName(column as string);\n        if (options?.collate) {\n            sql += ` COLLATE ${options.collate}`;\n        }\n\n        sql += ` ${(options?.direction ?? \"ASC\").toUpperCase()}`;\n        if (this.ctx.db.dbType === \"postgres\") {\n            if (options?.nulls) {\n                sql += ` NULLS ${options.nulls.toUpperCase()}`;\n            }\n        }\n\n        return sql;\n    }\n\n    orderByRaw(sql: string): SelectQueryBuilder<S, K, C> {\n        if (!this.orderByClause) {\n            this.orderByClause = [];\n        }\n\n        this.orderByClause.push(sql);\n        return this;\n    }\n\n    limit(n: number): SelectQueryBuilder<S, K, C> {\n        this.limitVal = n;\n        return this;\n    }\n\n    offset(n: number): SelectQueryBuilder<S, K, C> {\n        this.offsetVal = n;\n        return this;\n    }\n    computed<\n        TField extends string,\n        TZodType extends z.ZodTypeAny | undefined = undefined,\n        TDecode extends (value: any) => any = (value: unknown) => unknown,\n    >(\n        config: ComputedFieldConfig<TField, ReturnType<TDecode>, Parameters<TDecode>[0], TZodType> & {\n            codec: {\n                decode: TDecode;\n                encode?: (value: ReturnType<TDecode>) => Parameters<TDecode>[0];\n            };\n        }\n    ): SelectQueryBuilder<S, K | TField, OverrideField<C, TField, ComputedDataType<ComputedCodec<ReturnType<TDecode>, Parameters<TDecode>[0]>, TZodType>>>;\n    computed<\n        TField extends string,\n        TZodType extends z.ZodTypeAny | undefined = undefined,\n    >(\n        config: ComputedFieldConfig<TField, unknown, unknown, TZodType> & {\n            codec?: undefined;\n        }\n    ): SelectQueryBuilder<S, K | TField, OverrideField<C, TField, ComputedDataType<undefined, TZodType>>>;\n    computed<\n        TField extends string,\n        TZodType extends z.ZodTypeAny | undefined = undefined,\n        TCodec extends ComputedCodec<any, any> | undefined = undefined,\n    >(\n        config: ComputedFieldConfig<TField, unknown, unknown, TZodType> & {\n            codec?: TCodec;\n        }\n    ): SelectQueryBuilder<S, K | TField, OverrideField<C, TField, ComputedDataType<TCodec, TZodType>>> {\n        const computed: ComputedField = {\n            field: config.field,\n            sql: config.sql,\n            alias: config.alias ?? config.field,\n            codec: normalizeCodec(config.codec, config.type),\n        };\n        this.computedFields.push(computed);\n        return new SelectQueryBuilder<S, K | TField, OverrideField<C, TField, ComputedDataType<TCodec, TZodType>>>(\n            this.ctx, this.model, this.filters, this.orderByClause,\n            this.limitVal, this.offsetVal, [...this.selectedProps, config.field], this.computedFields,\n            this.commentStr,\n        );\n    }\n\n    comment(input: string | Record<string, string>): SelectQueryBuilder<S, K, C> {\n        this.commentStr = formatComment(input);\n        return this;\n    }\n\n    async first(): Promise<SelectRow<S, K, C> | null> {\n        const rows = await this.limit(1).get();\n        return (rows[0] ?? null) as any;\n    }\n\n    async exists(): Promise<boolean> {\n        return await this.count() > 0;\n    }\n\n    private static defaultCountType = z.coerce.number();\n\n    async count(): Promise<number>;\n    async count<T extends z.ZodType>(parser: T): Promise<z.output<T>>;\n    async count<T extends z.ZodType>(parser?: T): Promise<z.output<T>> {\n        const predicate = this.buildPredicate(false) ?? { kind: \"leaf\" as const, column: \"1\", operator: \"=\" as const, value: \"1\" };\n        const table = this.model.table;\n\n        // Build query spec for read tracking (without totalTs)\n        const querySpec: RangeRead = {\n            kind: \"range\",\n            table: table,\n            predicate: predicate,\n            columns: [\"count\"],\n            orderBy: null,\n            limit: null,\n            offset: null,\n        };\n\n        // Execute query\n        const params: unknown[] = [];\n        const whereSql = buildPredicateSql(predicate, params, this.ctx.db.sqlBuilder);\n\n        const sql = `SELECT COUNT(*) as count FROM ${table} WHERE (${whereSql})${this.commentStr ? \" \" + this.commentStr : \"\"}`;\n        const result = await this.ctx.db.query(sql, params);\n        const raw = result.rows[0]?.count ?? \"0\";\n\n        // Record read with totalTs for OCC validation\n        this.ctx.internalGetReadSet().push({ ...querySpec });\n\n        if (parser) {\n            return parser.parse(raw) as z.output<T>;\n        } else {\n            return SelectQueryBuilder.defaultCountType.parse(raw) as z.output<T>;\n        }\n    }\n\n    async find(id: string): Promise<SelectRow<S, K, C> | null> {\n        if (this.filters.length > 0) {\n            throw new Error(`Cannot use find() after where() - find() is meant for primary key lookups without additional filters`);\n        }\n\n        const table = this.model.table;\n        const tableId = this.model.tableId;\n\n        // Check pending writes first\n        const pendingWrite = this.ctx.internalGetWriteSet().find(w => w.id === id && bytesEqual(w.tableId, tableId));\n\n        if (pendingWrite) {\n            if (pendingWrite.op === \"delete\") {\n                // Don't cache pending writes, just return\n                return null;\n            }\n            const row = this.mapRowToSchema({ ...pendingWrite.data, id, commit_ts: this.ctx.beginTs });\n            return row as SelectRow<S, K, C>;\n        }\n\n        const computedCols = this.computedFields.map(f => `${f.sql} as ${f.alias}`);\n        const selectPropsWithComputed = this.selectedProps.slice(0, this.selectedProps.length - this.computedFields.length);\n        const selectCols = selectPropsWithComputed.length > 0\n            ? [\"id\", ...selectPropsWithComputed.map(p => this.getColumnName(p as string)), ...computedCols, \"commit_ts\"].join(\", \")\n            : \"*\";\n        let sql = `SELECT ${selectCols} FROM ${table} WHERE id = ${this.ctx.db.sqlBuilder.placeholder(1)}`;\n        if (this.commentStr) sql += ` ${this.commentStr}`;\n        const result = await this.ctx.db.query(sql, [id]);\n\n        const row = result.rows[0] ?? null;\n\n        // Capture commit_ts as the per-row OCC fingerprint. `null` means\n        // \"no row at read time\" — a later concurrent insert with this id\n        // becomes a conflict at commit time.\n        const expectedCommitTs: bigint | null = row ? BigInt(row.commit_ts) : null;\n        this.ctx.internalGetReadSet().push({\n            kind: \"point\",\n            table,\n            id,\n            expectedCommitTs,\n        });\n\n        const mappedRow = row ? this.mapRowToSchema(row) as SelectRow<S, K, C> : null;\n\n        return mappedRow;\n    }\n\n    async get(): Promise<SelectRow<S, K, C>[]> {\n        const predicate = this.buildPredicate(true) ?? { kind: \"leaf\" as const, column: \"1\", operator: \"=\" as const, value: \"1\" };\n        const table = this.model.table;\n\n        // Build query spec for read tracking (without totalTs)\n        const querySpec: RangeRead = {\n            kind: \"range\",\n            table: table,\n            predicate: predicate,\n            columns: this.selectedProps as string[],\n            orderBy: this.orderByClause,\n            limit: this.limitVal,\n            offset: this.offsetVal,\n        };\n\n        // Execute query\n        const params: unknown[] = [];\n        const whereSql = buildPredicateSql(predicate, params, this.ctx.db.sqlBuilder);\n\n        const computedCols = this.computedFields.map(f => `${f.sql} as ${f.alias}`);\n        const selectPropsWithComputed = this.selectedProps.slice(0, this.selectedProps.length - this.computedFields.length);\n        const selectColsNames = selectPropsWithComputed.length > 0\n            ? [\"id\", ...selectPropsWithComputed.map(p => this.getColumnName(p as string)), ...computedCols, \"commit_ts\"]\n            : \"*\";\n        const selectCols = Array.from(new Set(selectColsNames).values()).join(\", \")\n        let sql = `SELECT ${selectCols} FROM ${table} WHERE (${whereSql})`;\n\n        let orderByClause: string[] | undefined;\n        const paginateClause = this.paginationClause;\n\n        if (paginateClause) {\n            const idField = (paginateClause.idCol ?? \"id\") as OrderableFieldKeys<S>;\n            const orderDir = paginateClause.direction ?? \"DESC\"\n\n            orderByClause = [\n                this.buildOrderBySql(paginateClause.timeCol, orderDir),\n                this.buildOrderBySql(idField, orderDir),\n            ];\n\n            if (this.orderByClause) {\n                orderByClause.push(...this.orderByClause);\n            }\n        } else if (this.orderByClause) {\n            orderByClause = this.orderByClause;\n        }\n\n        if (orderByClause) {\n            sql += ` ORDER BY ${orderByClause.join(\", \")}`;\n        }\n\n        const limit = paginateClause?.limit ?? this.limitVal;\n        if (limit !== null) {\n            sql += ` LIMIT ${limit}`;\n        }\n        if (this.offsetVal !== null && !this.paginationClause) {\n            sql += ` OFFSET ${this.offsetVal}`;\n        }\n        if (this.commentStr) sql += ` ${this.commentStr}`;\n\n        const result = await this.ctx.db.query(sql, params);\n\n        // Record read with totalTs for OCC validation\n        this.ctx.internalGetReadSet().push({ ...querySpec });\n\n        const rows = result.rows.map(row => this.mapRowToSchema(row)) as SelectRow<S, K, C>[];\n\n        return rows;\n    }\n\n    private buildPredicate(includePagination: boolean): Predicate | null {\n        if (this.filters.length === 0) return null;\n\n        const predicates: Predicate[] = [];\n        const fb = new FilterBuilder<S>(this.model.columns, this.model.codecs);\n        let paginateFilter: ((fb: FilterBuilder<S>) => void) | undefined;\n\n        const clause = this.paginationClause;\n        const cursor = clause?.cursor;\n        if (clause && cursor != null) {\n            const orderDir = clause.direction ?? \"DESC\"\n            const descending = orderDir === \"DESC\";\n            const idField = (clause.idCol ?? \"id\") as OrderableFieldKeys<S>;\n\n            paginateFilter = (f) => {\n                f.or([\n                    (f1) => {\n                        return descending ?\n                            f1.lt(clause.timeCol, cursor.time) :\n                            f1.gt(clause.timeCol, cursor.time);\n                    },\n                    (f2) => {\n                        const q = f2.eq(clause.timeCol, cursor.time);\n                        return descending ?\n                            q.lt(idField, cursor.id) :\n                            q.gt(idField, cursor.id);\n                    }\n                ]);\n            };\n\n        }\n\n\n        const count = this.filters.length + (paginateFilter ? 1 : 0);\n        for (let i = 0; i < count; i++) {\n            const filterFn = i == this.filters.length\n                ? paginateFilter!\n                : this.filters[i];\n\n            filterFn(fb);\n            if (fb.predicates.length > 0) {\n                const hasOr = fb.predicates.some(p => p.kind === \"or\");\n                if (hasOr) {\n                    predicates.push(...fb.predicates);\n                } else {\n                    predicates.push({ kind: \"and\", children: fb.predicates });\n                }\n                fb.predicates = [];\n            }\n        }\n\n        if (predicates.length === 0) return null;\n        if (predicates.length === 1) return predicates[0] ?? null;\n        return { kind: \"and\", children: predicates };\n    }\n}\n\n// ─── Filter Builder ──────────────────────────────────────────────────────────────\n\nclass FilterBuilder<S extends SchemaDefinition<string, ZodRawShape>> {\n    predicates: Predicate[] = [];\n\n    constructor(\n        private columns: Record<string, string>,\n        private codecs: Record<string, ColumnCodec<unknown, unknown>>\n    ) { }\n\n    private add(column: string, operator: CompareOperator, value: unknown, value2?: unknown, raw?: boolean): void {\n        const leaf: LeafPredicate = { kind: \"leaf\", column, operator: operator as any, value, value2 };\n        if (raw) leaf.raw = true;\n        this.predicates.push(leaf);\n    }\n\n    private addJsonContains(operator: CompareOperator, key: string, value: unknown, opts: JsonContainsOptions | undefined): void {\n        const col = this.getColumnName(key);\n        const leaf: LeafPredicate = {\n            kind: \"leaf\",\n            column: col,\n            operator: operator as any,\n            value: this.encodeJson(value, opts?.raw),\n        };\n        if (opts?.raw) leaf.raw = true;\n        const path = resolveJsonPath(opts);\n        if (path !== undefined) leaf.path = path;\n        this.predicates.push(leaf);\n    }\n\n    private getColumnName(key: string): string {\n        return this.columns[key] ?? key;\n    }\n\n    private encode(key: string, value: unknown): unknown {\n        const codec = this.codecs[key];\n        if (!codec?.encode || value === undefined || value === null) return value;\n        return codec.encode(value);\n    }\n\n    private encodeJson(value: unknown, raw: boolean | undefined): unknown {\n        if (value === null || value === undefined) return value;\n        // raw=true: caller has already produced the dialect-native form\n        // (typically a JSON-encoded string or a path expression). Pass through.\n        if (raw) return value;\n        // Otherwise serialize the JS value to a JSON literal so the SQL\n        // emitter can hand a single text param to the driver.\n        return JSON.stringify(value);\n    }\n\n    eq<K extends keyof InferSchema<S>>(key: K, value: FieldValue<S, K>): FilterBuilder<S> {\n        this.add(this.getColumnName(key as string), \"=\", this.encode(key as string, value));\n        return this;\n    }\n\n    neq<K extends keyof InferSchema<S>>(key: K, value: FieldValue<S, K>): FilterBuilder<S> {\n        this.add(this.getColumnName(key as string), \"!=\", this.encode(key as string, value));\n        return this;\n    }\n\n    gt<K extends OrderableFieldKeys<S>>(key: K, value: FieldValue<S, K>): FilterBuilder<S> {\n        this.add(this.getColumnName(key as string), \">\", this.encode(key as string, value));\n        return this;\n    }\n\n    gte<K extends OrderableFieldKeys<S>>(key: K, value: FieldValue<S, K>): FilterBuilder<S> {\n        this.add(this.getColumnName(key as string), \">=\", this.encode(key as string, value));\n        return this;\n    }\n\n    lt<K extends OrderableFieldKeys<S>>(key: K, value: FieldValue<S, K>): FilterBuilder<S> {\n        this.add(this.getColumnName(key as string), \"<\", this.encode(key as string, value));\n        return this;\n    }\n\n    lte<K extends OrderableFieldKeys<S>>(key: K, value: FieldValue<S, K>): FilterBuilder<S> {\n        this.add(this.getColumnName(key as string), \"<=\", this.encode(key as string, value));\n        return this;\n    }\n\n    like<K extends StringFieldKeys<S>>(key: K, pattern: string): FilterBuilder<S> {\n        this.add(this.getColumnName(key as string), \"like\", this.encode(key as string, pattern));\n        return this;\n    }\n\n    ilike<K extends StringFieldKeys<S>>(key: K, pattern: string): FilterBuilder<S> {\n        this.add(this.getColumnName(key as string), \"ilike\", this.encode(key as string, pattern));\n        return this;\n    }\n\n    contains<K extends StringFieldKeys<S>>(key: K, value: string): FilterBuilder<S> {\n        this.add(this.getColumnName(key as string), \"contains\", this.encode(key as string, value));\n        return this;\n    }\n\n    icontains<K extends StringFieldKeys<S>>(key: K, value: string): FilterBuilder<S> {\n        this.add(this.getColumnName(key as string), \"icontains\", this.encode(key as string, value));\n        return this;\n    }\n\n    /**\n     * JSON containment. Targets a JSON/JSONB column and asserts the document\n     * contains the given candidate (object-key subset for objects,\n     * element-subset for arrays — see dialect-specific docs for edge cases).\n     * Pass `{ raw: true }` if `value` is already a JSON-encoded string.\n     * Pass `{ path: ... }` to scope the check to a sub-document of the\n     * target (jsonb_path_query_first on PG, JSON_CONTAINS path arg on MySQL).\n     */\n    jsonContains<K extends JsonFieldKeys<S>>(key: K, value: unknown, opts?: JsonContainsOptions): FilterBuilder<S> {\n        this.addJsonContains(\"jsonContains\", key as string, value, opts);\n        return this;\n    }\n\n    /** Inverse of {@link jsonContains}: column is contained in the given value. */\n    jsonContainedBy<K extends JsonFieldKeys<S>>(key: K, value: unknown, opts?: JsonContainsOptions): FilterBuilder<S> {\n        this.addJsonContains(\"jsonContainedBy\", key as string, value, opts);\n        return this;\n    }\n\n    /**\n     * Key/path existence check on a JSON column.\n     *\n     * - String form (top-level key): `jsonHasKey(\"meta\", \"color\")`. On PG\n     *   also matches when the column is a string array and `value` is one of\n     *   its elements (PG `?` semantics); MySQL stays strict to object keys.\n     * - Array form (nested path): `jsonHasKey(\"meta\", [\"a\", \"b\"])` compiles\n     *   to a path expression `$.\"a\".\"b\"` on both dialects.\n     * - Raw form: `jsonHasKey(\"meta\", \"$.foo[*]\", { raw: true })` passes the\n     *   string through as a dialect path expression (PG `jsonb_path_exists`\n     *   jsonpath, MySQL `JSON_CONTAINS_PATH`). Caller owns the syntax.\n     * - Multi-path form: `jsonHasKey(\"meta\", [[\"a\",\"b\"], \"color\"], { mode: \"all\" })`\n     *   compiles each entry to a jsonpath and emits PG OR/AND of\n     *   `jsonb_path_exists` or MySQL `JSON_CONTAINS_PATH('all', ...)`.\n     */\n    jsonHasKey<K extends JsonFieldKeys<S>>(key: K, value: string): FilterBuilder<S>;\n    jsonHasKey<K extends JsonFieldKeys<S>>(key: K, value: string[]): FilterBuilder<S>;\n    jsonHasKey<K extends JsonFieldKeys<S>>(key: K, value: string, opts: { raw: true }): FilterBuilder<S>;\n    jsonHasKey<K extends JsonFieldKeys<S>>(key: K, paths: (string | string[])[], opts: JsonHasKeyMultiOptions): FilterBuilder<S>;\n    jsonHasKey<K extends JsonFieldKeys<S>>(key: K, paths: string[], opts: JsonHasKeyMultiOptions & { raw: true }): FilterBuilder<S>;\n    jsonHasKey<K extends JsonFieldKeys<S>>(\n        key: K,\n        value: string | string[] | (string | string[])[],\n        opts?: JsonOpOptions & { mode?: \"one\" | \"all\" }\n    ): FilterBuilder<S> {\n        const col = this.getColumnName(key as string);\n        // Multi-path mode: array of (string|string[]) entries with explicit mode.\n        if (opts?.mode && Array.isArray(value)) {\n            const paths = (value as (string | string[])[]).map((p) =>\n                opts.raw && typeof p === \"string\" ? p : jsonKeysToPath(Array.isArray(p) ? p : [p])\n            );\n            const leaf: LeafPredicate = {\n                kind: \"leaf\",\n                column: col,\n                operator: \"jsonHasKey\",\n                value: paths,\n                mode: opts.mode,\n            };\n            this.predicates.push(leaf);\n            return this;\n        }\n        // Single-key/path mode.\n        if (Array.isArray(value)) {\n            this.add(col, \"jsonHasKey\", jsonKeysToPath(value as string[]), undefined, true);\n        } else if (opts?.raw) {\n            this.add(col, \"jsonHasKey\", value, undefined, true);\n        } else {\n            this.add(col, \"jsonHasKey\", value, undefined, false);\n        }\n        return this;\n    }\n\n    /**\n     * Array element containment: target column is a JSON array; the given\n     * `value` (any JSON-encodable type) must appear as one of its elements.\n     * Pass `{ raw: true }` if `value` is already a JSON-encoded string.\n     * Pass `{ path: ... }` to scope the check to a sub-array of the column.\n     */\n    jsonArrayContains<K extends JsonFieldKeys<S>>(key: K, value: unknown, opts?: JsonContainsOptions): FilterBuilder<S> {\n        this.addJsonContains(\"jsonArrayContains\", key as string, value, opts);\n        return this;\n    }\n\n    between<K extends OrderableFieldKeys<S>>(key: K, lo: FieldValue<S, K>, hi: FieldValue<S, K>): FilterBuilder<S> {\n        this.add(this.getColumnName(key as string), \"between\", this.encode(key as string, lo), this.encode(key as string, hi));\n        return this;\n    }\n\n    /**\n     * Set membership: `key` equals any of `values` (SQL `IN`). Each value is\n     * codec-encoded like `eq`. An empty `values` matches no rows. Bound as one\n     * parameter per element, so keep the list within the driver's parameter\n     * limit (chunk very large sets at the call site).\n     */\n    in<K extends keyof InferSchema<S>>(key: K, values: readonly FieldValue<S, K>[]): FilterBuilder<S> {\n        const col = this.getColumnName(key as string);\n        this.add(col, \"in\", values.map((v) => this.encode(key as string, v)));\n        return this;\n    }\n\n    isNull<K extends keyof InferSchema<S>>(key: K): FilterBuilder<S> {\n        this.add(this.getColumnName(key as string), \"isNull\", null);\n        return this;\n    }\n\n    notNull<K extends keyof InferSchema<S>>(key: K): FilterBuilder<S> {\n        this.add(this.getColumnName(key as string), \"isNotNull\", null);\n        return this;\n    }\n\n    /**\n     * Compose an OR clause. Each callback fills a fresh sub-FilterBuilder\n     * with predicates that are AND-ed together within that branch; the\n     * branches themselves are OR-ed. Example:\n     *   f.or([\n     *     b => b.eq(\"tag\", \"a\"),\n     *     b => b.eq(\"tag\", \"b\").gt(\"qty\", 3),  // (tag=b AND qty>3)\n     *   ])\n     * produces  (tag=a) OR (tag=b AND qty>3).\n     */\n    or(branches: ((fb: FilterBuilder<S>) => void)[]): FilterBuilder<S> {\n        const children: Predicate[] = [];\n        for (const fn of branches) {\n            const sub = new FilterBuilder<S>(this.columns, this.codecs);\n            fn(sub);\n            if (sub.predicates.length === 1) {\n                children.push(sub.predicates[0]);\n            } else if (sub.predicates.length > 1) {\n                children.push({ kind: \"and\", children: sub.predicates });\n            }\n        }\n        if (children.length > 0) {\n            this.predicates.push({ kind: \"or\", children });\n        }\n        return this;\n    }\n}\n\n\nexport function buildPredicateSql(predicate: Predicate, params: unknown[], sql: SqlBuilder): string {\n    switch (predicate.kind) {\n        case \"and\": {\n            const parts = predicate.children.map((c) => buildPredicateSql(c, params, sql));\n            return `(${parts.join(\" AND \")})`;\n        }\n        case \"or\": {\n            const parts = predicate.children.map((c) => buildPredicateSql(c, params, sql));\n            return `(${parts.join(\" OR \")})`;\n        }\n        case \"leaf\": {\n            return buildLeafSql(predicate, params, sql);\n        }\n    }\n}\n\nfunction buildLeafSql(leaf: LeafPredicate, params: unknown[], sql: SqlBuilder): string {\n    const col = leaf.column;\n    switch (leaf.operator) {\n        case \"=\": case \"!=\": case \">\": case \">=\": case \"<\": case \"<=\": {\n            params.push(leaf.value);\n            return `${col} ${leaf.operator} ${sql.placeholder(params.length)}`;\n        }\n        case \"between\": {\n            params.push(leaf.value);\n            const p1 = sql.placeholder(params.length);\n            params.push(leaf.value2);\n            const p2 = sql.placeholder(params.length);\n            return `${col} BETWEEN ${p1} AND ${p2}`;\n        }\n        case \"in\": {\n            const values = (leaf.value ?? []) as unknown[];\n            // `col IN ()` is invalid SQL; an empty set matches nothing.\n            if (values.length === 0) return \"1 = 0\";\n            const placeholders = values.map((v) => {\n                params.push(v);\n                return sql.placeholder(params.length);\n            });\n            return `${col} IN (${placeholders.join(\", \")})`;\n        }\n        case \"like\": {\n            params.push(leaf.value);\n            return `${col} LIKE ${sql.placeholder(params.length)}`;\n        }\n        case \"ilike\": {\n            params.push(leaf.value);\n            return sql.ilike(col, params.length);\n        }\n        case \"contains\": {\n            params.push(`%${leaf.value}%`);\n            return `${col} LIKE ${sql.placeholder(params.length)}`;\n        }\n        case \"icontains\": {\n            params.push(`%${leaf.value}%`);\n            return sql.icontains(col, params.length);\n        }\n        case \"jsonContains\": {\n            params.push(leaf.value);\n            const valIdx = params.length;\n            let pathIndex: number | undefined;\n            if (leaf.path !== undefined) {\n                params.push(leaf.path);\n                pathIndex = params.length;\n            }\n            return sql.jsonContains(col, valIdx, { raw: leaf.raw, pathIndex });\n        }\n        case \"jsonContainedBy\": {\n            params.push(leaf.value);\n            const valIdx = params.length;\n            let pathIndex: number | undefined;\n            if (leaf.path !== undefined) {\n                params.push(leaf.path);\n                pathIndex = params.length;\n            }\n            return sql.jsonContainedBy(col, valIdx, { raw: leaf.raw, pathIndex });\n        }\n        case \"jsonHasKey\": {\n            if (leaf.mode && Array.isArray(leaf.value)) {\n                const paths = leaf.value as string[];\n                const startIdx = params.length + 1;\n                for (const p of paths) params.push(p);\n                return sql.jsonHasKey(col, startIdx, {\n                    raw: true,\n                    mode: leaf.mode,\n                    pathCount: paths.length,\n                });\n            }\n            params.push(leaf.value);\n            return sql.jsonHasKey(col, params.length, { raw: leaf.raw });\n        }\n        case \"jsonArrayContains\": {\n            params.push(leaf.value);\n            const valIdx = params.length;\n            let pathIndex: number | undefined;\n            if (leaf.path !== undefined) {\n                params.push(leaf.path);\n                pathIndex = params.length;\n            }\n            return sql.jsonArrayContains(col, valIdx, { raw: leaf.raw, pathIndex });\n        }\n        case \"isNull\": return `${col} IS NULL`;\n        case \"isNotNull\": return `${col} IS NOT NULL`;\n    }\n}\n\nexport function matchesPredicate(row: Record<string, unknown>, predicate: Predicate): boolean {\n    switch (predicate.kind) {\n        case \"and\": return predicate.children.every((c) => matchesPredicate(row, c));\n        case \"or\": return predicate.children.some((c) => matchesPredicate(row, c));\n        case \"leaf\": return matchesLeaf(row, predicate);\n    }\n}\n\nfunction matchesLeaf(row: Record<string, unknown>, leaf: LeafPredicate): boolean {\n    const val = row[leaf.column];\n\n    switch (leaf.operator) {\n        case \"=\": return val === leaf.value;\n        case \"!=\": return val !== leaf.value;\n        case \">\": return (val as number) > (leaf.value as number);\n        case \">=\": return (val as number) >= (leaf.value as number);\n        case \"<\": return (val as number) < (leaf.value as number);\n        case \"<=\": return (val as number) <= (leaf.value as number);\n\n        case \"between\":\n            return (val as number) >= (leaf.value as number) &&\n                (val as number) <= (leaf.value2 as number);\n\n        case \"in\":\n            return Array.isArray(leaf.value) && (leaf.value as unknown[]).includes(val);\n\n        case \"like\":\n        case \"contains\":\n        case \"ilike\":\n        case \"icontains\": {\n            if (typeof val !== \"string\" || typeof leaf.value !== \"string\") return false;\n            const haystack = (leaf.operator === \"ilike\" || leaf.operator === \"icontains\")\n                ? (val as string).toLowerCase()\n                : val as string;\n            const raw = leaf.value as string;\n            const needle = (leaf.operator === \"ilike\" || leaf.operator === \"icontains\")\n                ? raw.toLowerCase()\n                : raw;\n            const pattern = (leaf.operator === \"contains\" || leaf.operator === \"icontains\")\n                ? `%${needle}%`\n                : needle;\n            const regex = new RegExp(\n                \"^\" + pattern.replace(/%/g, \".*\").replace(/_/g, \".\") + \"$\"\n            );\n            return regex.test(haystack);\n        }\n\n        case \"jsonContains\": {\n            const candidate = decodeJsonLeafValue(leaf);\n            const target = leaf.path !== undefined ? jsonPathExtract(val, leaf.path) : val;\n            if (target === undefined) return false;\n            return jsonContains(target, candidate);\n        }\n\n        case \"jsonContainedBy\": {\n            const candidate = decodeJsonLeafValue(leaf);\n            const target = leaf.path !== undefined ? jsonPathExtract(val, leaf.path) : val;\n            if (target === undefined) return false;\n            return jsonContains(candidate, target);\n        }\n\n        case \"jsonHasKey\": {\n            if (leaf.mode && Array.isArray(leaf.value)) {\n                const paths = leaf.value as string[];\n                if (paths.length === 0) return false;\n                return leaf.mode === \"all\"\n                    ? paths.every((p) => jsonPathExists(val, p))\n                    : paths.some((p) => jsonPathExists(val, p));\n            }\n            if (leaf.raw) {\n                return jsonPathExists(val, leaf.value as string);\n            }\n            const key = leaf.value as string;\n            if (val === null || typeof val !== \"object\") return false;\n            if (Array.isArray(val)) return (val as unknown[]).includes(key);\n            return key in (val as object);\n        }\n\n        case \"jsonArrayContains\": {\n            const candidate = decodeJsonLeafValue(leaf);\n            const target = leaf.path !== undefined ? jsonPathExtract(val, leaf.path) : val;\n            if (!Array.isArray(target)) return false;\n            return (target as unknown[]).some((el) => jsonContains(el, candidate));\n        }\n\n        case \"isNull\":\n            return val === null;\n\n        case \"isNotNull\":\n            return val !== null;\n\n        default:\n            return false;\n    }\n}\n\n// When raw=true the leaf.value is a JSON-encoded string; decode for in-memory\n// comparison. Otherwise the value is the original JS value as passed.\nfunction decodeJsonLeafValue(leaf: LeafPredicate): unknown {\n    if (!leaf.raw) return leaf.value;\n    if (typeof leaf.value !== \"string\") return leaf.value;\n    try { return JSON.parse(leaf.value); } catch { return leaf.value; }\n}\n\n// PG `@>` / MySQL `JSON_CONTAINS` semantics. Recursive containment:\n//   - scalars: strict equality\n//   - object: every candidate key matches target's value recursively\n//   - array: every candidate element is contained in some target element\n//   - scalar candidate vs array target: candidate equals some element\nexport function jsonContains(target: unknown, candidate: unknown): boolean {\n    if (candidate === target) return true;\n    if (target === null || candidate === null) return target === candidate;\n    if (target === undefined || candidate === undefined) return false;\n\n    const tArr = Array.isArray(target);\n    const cArr = Array.isArray(candidate);\n    const tObj = !tArr && typeof target === \"object\";\n    const cObj = !cArr && typeof candidate === \"object\";\n\n    // Scalar candidate in array target.\n    if (!cArr && !cObj && tArr) {\n        return (target as unknown[]).some((el) => jsonContains(el, candidate));\n    }\n    // Both arrays: every candidate element matches some target element.\n    if (cArr && tArr) {\n        const t = target as unknown[];\n        return (candidate as unknown[]).every((c) => t.some((el) => jsonContains(el, c)));\n    }\n    // Both objects.\n    if (cObj && tObj) {\n        const t = target as Record<string, unknown>;\n        const c = candidate as Record<string, unknown>;\n        for (const k of Object.keys(c)) {\n            if (!(k in t)) return false;\n            if (!jsonContains(t[k], c[k])) return false;\n        }\n        return true;\n    }\n    return false;\n}\n\n// Walk the JSON path and return the value at it, or `undefined` if any\n// segment is missing or unresolvable. Same syntax subset as\n// {@link jsonPathExists}.\nexport function jsonPathExtract(val: unknown, path: string): unknown {\n    let p = path;\n    if (p.startsWith(\"$\")) p = p.slice(1);\n    let cur: unknown = val;\n    while (p.length > 0) {\n        if (p.startsWith('.\"')) {\n            let end = 2;\n            while (end < p.length) {\n                if (p[end] === \"\\\\\" && end + 1 < p.length) { end += 2; continue; }\n                if (p[end] === '\"') break;\n                end++;\n            }\n            if (end >= p.length) return undefined;\n            const key = p.slice(2, end).replace(/\\\\\"/g, '\"').replace(/\\\\\\\\/g, \"\\\\\");\n            if (cur === null || typeof cur !== \"object\" || Array.isArray(cur)) return undefined;\n            if (!(key in (cur as object))) return undefined;\n            cur = (cur as Record<string, unknown>)[key];\n            p = p.slice(end + 1);\n        } else if (p.startsWith(\".\")) {\n            const m = p.slice(1).match(/^([^.[]+)/);\n            if (!m) return undefined;\n            const key = m[1];\n            if (cur === null || typeof cur !== \"object\" || Array.isArray(cur)) return undefined;\n            if (!(key in (cur as object))) return undefined;\n            cur = (cur as Record<string, unknown>)[key];\n            p = p.slice(1 + key.length);\n        } else if (p.startsWith(\"[\")) {\n            const end = p.indexOf(\"]\");\n            if (end === -1) return undefined;\n            const idx = parseInt(p.slice(1, end), 10);\n            if (!Array.isArray(cur) || idx < 0 || idx >= (cur as unknown[]).length) return undefined;\n            cur = (cur as unknown[])[idx];\n            p = p.slice(end + 1);\n        } else {\n            return undefined;\n        }\n    }\n    return cur;\n}\n\n// Best-effort JSON path evaluator for the in-memory predicate match.\n// Supports the path syntax this module emits (`$.\"key\".\"nested\"`) plus the\n// common shorthands `$.key` and `$.key[0]`. Anything more exotic (filters,\n// wildcards) returns false — DB will still evaluate it correctly server-side.\nexport function jsonPathExists(val: unknown, path: string): boolean {\n    let p = path;\n    if (p.startsWith(\"$\")) p = p.slice(1);\n    let cur: unknown = val;\n    while (p.length > 0) {\n        if (p.startsWith('.\"')) {\n            let end = 2;\n            while (end < p.length) {\n                if (p[end] === \"\\\\\" && end + 1 < p.length) { end += 2; continue; }\n                if (p[end] === '\"') break;\n                end++;\n            }\n            if (end >= p.length) return false;\n            const key = p.slice(2, end).replace(/\\\\\"/g, '\"').replace(/\\\\\\\\/g, \"\\\\\");\n            if (cur === null || typeof cur !== \"object\" || Array.isArray(cur)) return false;\n            if (!(key in (cur as object))) return false;\n            cur = (cur as Record<string, unknown>)[key];\n            p = p.slice(end + 1);\n        } else if (p.startsWith(\".\")) {\n            const m = p.slice(1).match(/^([^.[]+)/);\n            if (!m) return false;\n            const key = m[1];\n            if (cur === null || typeof cur !== \"object\" || Array.isArray(cur)) return false;\n            if (!(key in (cur as object))) return false;\n            cur = (cur as Record<string, unknown>)[key];\n            p = p.slice(1 + key.length);\n        } else if (p.startsWith(\"[\")) {\n            const end = p.indexOf(\"]\");\n            if (end === -1) return false;\n            const idx = parseInt(p.slice(1, end), 10);\n            if (!Array.isArray(cur) || idx < 0 || idx >= (cur as unknown[]).length) return false;\n            cur = (cur as unknown[])[idx];\n            p = p.slice(end + 1);\n        } else {\n            return false;\n        }\n    }\n    return cur !== undefined;\n}\n"],"mappings":";;;;AAAA,SAAgB,QAAQ,OAAgD;CACpE,IAAI,CAAC,OAAO,OAAO;CACnB,IAAI,OAAO,UAAU,UAAU,OAAO,KAAK,MAAM;CACjD,MAAM,UAAU,OAAO,QAAQ,KAAK,CAAC,CAAC,QAAQ,CAAC,GAAG,OAAO,KAAK,IAAI;CAClE,IAAI,QAAQ,WAAW,GAAG,OAAO;CAIjC,OAAO,KAHO,QACT,KAAK,CAAC,GAAG,OAAO,GAAG,mBAAmB,CAAC,EAAE,IAAI,mBAAmB,CAAC,EAAE,EAAE,CAAC,CACtE,KACW,CAAC,CAAC,KAAK,GAAG,EAAE;AAChC;;;ACmEA,SAAS,eAAe,MAAwB;CAC5C,IAAI,MAAM;CACV,KAAK,MAAM,KAAK,MACZ,OAAO,KAAK,EAAE,QAAQ,MAAM,MAAK,EAAE;CAEvC,OAAO;AACX;AAMA,SAAS,gBAAgB,MAA2D;CAChF,IAAI,MAAM,SAAS,KAAA,KAAa,MAAM,YAAY,KAAA,GAC9C,MAAM,IAAI,MAAM,yDAAyD;CAE7E,IAAI,MAAM,YAAY,KAAA,GAAW,OAAO,KAAK;CAC7C,IAAI,MAAM,SAAS,KAAA,GAEf,OAAO,eADK,MAAM,QAAQ,KAAK,IAAI,IAAI,KAAK,OAAO,CAAC,KAAK,IAAI,CACpC;AAGjC;AAEA,IAAa,eAAb,MAA2E;CAEzD;CACA;CAFd,YACI,KACA,OACF;EAFY,KAAA,MAAA;EACA,KAAA,QAAA;CACV;CAEJ,cAAwB,KAAqB;EACzC,OAAO,KAAK,MAAM,QAAQ,QAAQ;CACtC;CAIA,OAAuC,GAAG,SAAwC;EAC9E,MAAM,gBAAiB,QAAQ,SAAS,IAAI,UAAU,OAAO,KAAK,KAAK,MAAM,OAAO;EACpF,OAAO,IAAI,mBAAyB,KAAK,KAAK,KAAK,OAAO,CAAC,GAAG,MAAM,MAAM,MAAM,aAAa;CACjG;AACJ;AA+EA,IAAM,qBAAN,MAAM,mBAIJ;CAWc;CACA;CAXZ,UAAsD,CAAC;CACvD,mBAAqG;CACrG,gBAAyC;CACzC,WAAkC;CAClC,YAAmC;CACnC,gBAAkD,CAAC;CACnD,iBAA0C,CAAC;CAC3C,aAA6B;CAE7B,YACI,KACA,OACA,UAA8C,CAAC,GAC/C,gBAAiC,MACjC,WAA0B,MAC1B,YAA2B,MAC3B,gBAA0C,CAAC,GAC3C,iBAAkC,CAAC,GACnC,aAAqB,IACvB;EATU,KAAA,MAAA;EACA,KAAA,QAAA;EASR,KAAK,UAAU;EACf,KAAK,gBAAgB;EACrB,KAAK,WAAW;EAChB,KAAK,YAAY;EACjB,KAAK,gBAAgB;EACrB,KAAK,iBAAiB;EACtB,KAAK,aAAa;CACtB;CAEA,cAAsB,KAAqB;EACvC,OAAO,KAAK,MAAM,QAAQ,QAAQ;CACtC;CAEA,gBAAwB,QAAwB;EAC5C,OAAO,KAAK,MAAM,eAAe,WAAW,KAAK,eAAe,MAAK,MAAK,EAAE,UAAU,MAAM,CAAC,EAAE,SAAS;CAC5G;CAEA,eAAuB,KAA+C;EAClE,MAAM,SAA8B,CAAC;EACrC,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,GAAG,GAAG;GAC5C,MAAM,OAAO,KAAK,gBAAgB,GAAG;GACrC,MAAM,QAAQ,KAAK,MAAM,OAAO,SAAS,KAAK,eAAe,MAAM,MAAM,EAAE,UAAU,GAAG,CAAC,EAAE;GAC3F,OAAO,QAAQ,OAAO,UAAU,UAAU,KAAA,KAAa,UAAU,OAAO,MAAM,OAAO,KAAK,IAAI;EAClG;EACA,OAAO;CACX;CAEA,MAAM,UAAuE;EACzE,KAAK,QAAQ,KAAK,QAAQ;EAC1B,OAAO;CACX;CAEA,SACI,QAC2B;EAC3B,KAAK,mBAAmB;EACxB,OAAO;CACX;CAMA,QACI,QACA,qBAAsD,OAC3B;EAC3B,MAAM,MAAM,KAAK,gBAAgB,QAAQ,kBAAkB;EAE3D,IAAI,CAAC,KAAK,eACN,KAAK,gBAAgB,CAAC;EAG1B,KAAK,cAAc,KAAK,GAAG;EAC3B,OAAO;CACX;CAEA,gBACI,QACA,qBAAsD,OACxD;EACE,MAAM,UACF,OAAO,uBAAuB,WACxB,EAAE,WAAW,mBAAmB,IAChC;EAEV,IAAI,MAAM,KAAK,cAAc,MAAgB;EAC7C,IAAI,SAAS,SACT,OAAO,YAAY,QAAQ;EAG/B,OAAO,KAAK,SAAS,aAAa,MAAA,CAAO,YAAY;EACrD,IAAI,KAAK,IAAI,GAAG,WAAW;OACnB,SAAS,OACT,OAAO,UAAU,QAAQ,MAAM,YAAY;EAAA;EAInD,OAAO;CACX;CAEA,WAAW,KAA0C;EACjD,IAAI,CAAC,KAAK,eACN,KAAK,gBAAgB,CAAC;EAG1B,KAAK,cAAc,KAAK,GAAG;EAC3B,OAAO;CACX;CAEA,MAAM,GAAwC;EAC1C,KAAK,WAAW;EAChB,OAAO;CACX;CAEA,OAAO,GAAwC;EAC3C,KAAK,YAAY;EACjB,OAAO;CACX;CAqBA,SAKI,QAG+F;EAC/F,MAAM,WAA0B;GAC5B,OAAO,OAAO;GACd,KAAK,OAAO;GACZ,OAAO,OAAO,SAAS,OAAO;GAC9B,OAAO,eAAe,OAAO,OAAO,OAAO,IAAI;EACnD;EACA,KAAK,eAAe,KAAK,QAAQ;EACjC,OAAO,IAAI,mBACP,KAAK,KAAK,KAAK,OAAO,KAAK,SAAS,KAAK,eACzC,KAAK,UAAU,KAAK,WAAW,CAAC,GAAG,KAAK,eAAe,OAAO,KAAK,GAAG,KAAK,gBAC3E,KAAK,UACT;CACJ;CAEA,QAAQ,OAAqE;EACzE,KAAK,aAAaA,QAAc,KAAK;EACrC,OAAO;CACX;CAEA,MAAM,QAA4C;EAE9C,QAAQ,MADW,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,EAAA,CACxB,MAAM;CACvB;CAEA,MAAM,SAA2B;EAC7B,OAAO,MAAM,KAAK,MAAM,IAAI;CAChC;CAEA,OAAe,mBAAmBC,IAAE,OAAO,OAAO;CAIlD,MAAM,MAA2B,QAAkC;EAC/D,MAAM,YAAY,KAAK,eAAe,KAAK,KAAK;GAAE,MAAM;GAAiB,QAAQ;GAAK,UAAU;GAAc,OAAO;EAAI;EACzH,MAAM,QAAQ,KAAK,MAAM;EAGzB,MAAM,YAAuB;GACzB,MAAM;GACC;GACI;GACX,SAAS,CAAC,OAAO;GACjB,SAAS;GACT,OAAO;GACP,QAAQ;EACZ;EAGA,MAAM,SAAoB,CAAC;EAG3B,MAAM,MAAM,iCAAiC,MAAM,UAFlC,kBAAkB,WAAW,QAAQ,KAAK,IAAI,GAAG,UAEE,EAAE,GAAG,KAAK,aAAa,MAAM,KAAK,aAAa;EAEnH,MAAM,OAAM,MADS,KAAK,IAAI,GAAG,MAAM,KAAK,MAAM,EAAA,CAC/B,KAAK,EAAE,EAAE,SAAS;EAGrC,KAAK,IAAI,mBAAmB,CAAC,CAAC,KAAK,EAAE,GAAG,UAAU,CAAC;EAEnD,IAAI,QACA,OAAO,OAAO,MAAM,GAAG;OAEvB,OAAO,mBAAmB,iBAAiB,MAAM,GAAG;CAE5D;CAEA,MAAM,KAAK,IAAgD;EACvD,IAAI,KAAK,QAAQ,SAAS,GACtB,MAAM,IAAI,MAAM,sGAAsG;EAG1H,MAAM,QAAQ,KAAK,MAAM;EACzB,MAAM,UAAU,KAAK,MAAM;EAG3B,MAAM,eAAe,KAAK,IAAI,oBAAoB,CAAC,CAAC,MAAK,MAAK,EAAE,OAAO,MAAM,WAAW,EAAE,SAAS,OAAO,CAAC;EAE3G,IAAI,cAAc;GACd,IAAI,aAAa,OAAO,UAEpB,OAAO;GAGX,OADY,KAAK,eAAe;IAAE,GAAG,aAAa;IAAM;IAAI,WAAW,KAAK,IAAI;GAAQ,CAC/E;EACb;EAEA,MAAM,eAAe,KAAK,eAAe,KAAI,MAAK,GAAG,EAAE,IAAI,MAAM,EAAE,OAAO;EAC1E,MAAM,0BAA0B,KAAK,cAAc,MAAM,GAAG,KAAK,cAAc,SAAS,KAAK,eAAe,MAAM;EAIlH,IAAI,MAAM,UAHS,wBAAwB,SAAS,IAC9C;GAAC;GAAM,GAAG,wBAAwB,KAAI,MAAK,KAAK,cAAc,CAAW,CAAC;GAAG,GAAG;GAAc;EAAW,CAAC,CAAC,KAAK,IAAI,IACpH,IACyB,QAAQ,MAAM,cAAc,KAAK,IAAI,GAAG,WAAW,YAAY,CAAC;EAC/F,IAAI,KAAK,YAAY,OAAO,IAAI,KAAK;EAGrC,MAAM,OAAM,MAFS,KAAK,IAAI,GAAG,MAAM,KAAK,CAAC,EAAE,CAAC,EAAA,CAE7B,KAAK,MAAM;EAK9B,MAAM,mBAAkC,MAAM,OAAO,IAAI,SAAS,IAAI;EACtE,KAAK,IAAI,mBAAmB,CAAC,CAAC,KAAK;GAC/B,MAAM;GACN;GACA;GACA;EACJ,CAAC;EAID,OAFkB,MAAM,KAAK,eAAe,GAAG,IAA0B;CAG7E;CAEA,MAAM,MAAqC;EACvC,MAAM,YAAY,KAAK,eAAe,IAAI,KAAK;GAAE,MAAM;GAAiB,QAAQ;GAAK,UAAU;GAAc,OAAO;EAAI;EACxH,MAAM,QAAQ,KAAK,MAAM;EAGzB,MAAM,YAAuB;GACzB,MAAM;GACC;GACI;GACX,SAAS,KAAK;GACd,SAAS,KAAK;GACd,OAAO,KAAK;GACZ,QAAQ,KAAK;EACjB;EAGA,MAAM,SAAoB,CAAC;EAC3B,MAAM,WAAW,kBAAkB,WAAW,QAAQ,KAAK,IAAI,GAAG,UAAU;EAE5E,MAAM,eAAe,KAAK,eAAe,KAAI,MAAK,GAAG,EAAE,IAAI,MAAM,EAAE,OAAO;EAC1E,MAAM,0BAA0B,KAAK,cAAc,MAAM,GAAG,KAAK,cAAc,SAAS,KAAK,eAAe,MAAM;EAClH,MAAM,kBAAkB,wBAAwB,SAAS,IACnD;GAAC;GAAM,GAAG,wBAAwB,KAAI,MAAK,KAAK,cAAc,CAAW,CAAC;GAAG,GAAG;GAAc;EAAW,IACzG;EAEN,IAAI,MAAM,UADS,MAAM,KAAK,IAAI,IAAI,eAAe,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,IACzC,EAAE,QAAQ,MAAM,UAAU,SAAS;EAEhE,IAAI;EACJ,MAAM,iBAAiB,KAAK;EAE5B,IAAI,gBAAgB;GAChB,MAAM,UAAW,eAAe,SAAS;GACzC,MAAM,WAAW,eAAe,aAAa;GAE7C,gBAAgB,CACZ,KAAK,gBAAgB,eAAe,SAAS,QAAQ,GACrD,KAAK,gBAAgB,SAAS,QAAQ,CAC1C;GAEA,IAAI,KAAK,eACL,cAAc,KAAK,GAAG,KAAK,aAAa;EAEhD,OAAO,IAAI,KAAK,eACZ,gBAAgB,KAAK;EAGzB,IAAI,eACA,OAAO,aAAa,cAAc,KAAK,IAAI;EAG/C,MAAM,QAAQ,gBAAgB,SAAS,KAAK;EAC5C,IAAI,UAAU,MACV,OAAO,UAAU;EAErB,IAAI,KAAK,cAAc,QAAQ,CAAC,KAAK,kBACjC,OAAO,WAAW,KAAK;EAE3B,IAAI,KAAK,YAAY,OAAO,IAAI,KAAK;EAErC,MAAM,SAAS,MAAM,KAAK,IAAI,GAAG,MAAM,KAAK,MAAM;EAGlD,KAAK,IAAI,mBAAmB,CAAC,CAAC,KAAK,EAAE,GAAG,UAAU,CAAC;EAInD,OAFa,OAAO,KAAK,KAAI,QAAO,KAAK,eAAe,GAAG,CAEjD;CACd;CAEA,eAAuB,mBAA8C;EACjE,IAAI,KAAK,QAAQ,WAAW,GAAG,OAAO;EAEtC,MAAM,aAA0B,CAAC;EACjC,MAAM,KAAK,IAAI,cAAiB,KAAK,MAAM,SAAS,KAAK,MAAM,MAAM;EACrE,IAAI;EAEJ,MAAM,SAAS,KAAK;EACpB,MAAM,SAAS,QAAQ;EACvB,IAAI,UAAU,UAAU,MAAM;GAE1B,MAAM,cADW,OAAO,aAAa,YACL;GAChC,MAAM,UAAW,OAAO,SAAS;GAEjC,kBAAkB,MAAM;IACpB,EAAE,GAAG,EACA,OAAO;KACJ,OAAO,aACH,GAAG,GAAG,OAAO,SAAS,OAAO,IAAI,IACjC,GAAG,GAAG,OAAO,SAAS,OAAO,IAAI;IACzC,IACC,OAAO;KACJ,MAAM,IAAI,GAAG,GAAG,OAAO,SAAS,OAAO,IAAI;KAC3C,OAAO,aACH,EAAE,GAAG,SAAS,OAAO,EAAE,IACvB,EAAE,GAAG,SAAS,OAAO,EAAE;IAC/B,CACJ,CAAC;GACL;EAEJ;EAGA,MAAM,QAAQ,KAAK,QAAQ,UAAU,iBAAiB,IAAI;EAC1D,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;GAK5B,CAJiB,KAAK,KAAK,QAAQ,SAC7B,iBACA,KAAK,QAAQ,GAAA,CAEV,EAAE;GACX,IAAI,GAAG,WAAW,SAAS,GAAG;IAE1B,IADc,GAAG,WAAW,MAAK,MAAK,EAAE,SAAS,IACzC,GACJ,WAAW,KAAK,GAAG,GAAG,UAAU;SAEhC,WAAW,KAAK;KAAE,MAAM;KAAO,UAAU,GAAG;IAAW,CAAC;IAE5D,GAAG,aAAa,CAAC;GACrB;EACJ;EAEA,IAAI,WAAW,WAAW,GAAG,OAAO;EACpC,IAAI,WAAW,WAAW,GAAG,OAAO,WAAW,MAAM;EACrD,OAAO;GAAE,MAAM;GAAO,UAAU;EAAW;CAC/C;AACJ;AAIA,IAAM,gBAAN,MAAM,cAA+D;CAIrD;CACA;CAJZ,aAA0B,CAAC;CAE3B,YACI,SACA,QACF;EAFU,KAAA,UAAA;EACA,KAAA,SAAA;CACR;CAEJ,IAAY,QAAgB,UAA2B,OAAgB,QAAkB,KAAqB;EAC1G,MAAM,OAAsB;GAAE,MAAM;GAAQ;GAAkB;GAAiB;GAAO;EAAO;EAC7F,IAAI,KAAK,KAAK,MAAM;EACpB,KAAK,WAAW,KAAK,IAAI;CAC7B;CAEA,gBAAwB,UAA2B,KAAa,OAAgB,MAA6C;EAEzH,MAAM,OAAsB;GACxB,MAAM;GACN,QAHQ,KAAK,cAAc,GAGjB;GACA;GACV,OAAO,KAAK,WAAW,OAAO,MAAM,GAAG;EAC3C;EACA,IAAI,MAAM,KAAK,KAAK,MAAM;EAC1B,MAAM,OAAO,gBAAgB,IAAI;EACjC,IAAI,SAAS,KAAA,GAAW,KAAK,OAAO;EACpC,KAAK,WAAW,KAAK,IAAI;CAC7B;CAEA,cAAsB,KAAqB;EACvC,OAAO,KAAK,QAAQ,QAAQ;CAChC;CAEA,OAAe,KAAa,OAAyB;EACjD,MAAM,QAAQ,KAAK,OAAO;EAC1B,IAAI,CAAC,OAAO,UAAU,UAAU,KAAA,KAAa,UAAU,MAAM,OAAO;EACpE,OAAO,MAAM,OAAO,KAAK;CAC7B;CAEA,WAAmB,OAAgB,KAAmC;EAClE,IAAI,UAAU,QAAQ,UAAU,KAAA,GAAW,OAAO;EAGlD,IAAI,KAAK,OAAO;EAGhB,OAAO,KAAK,UAAU,KAAK;CAC/B;CAEA,GAAmC,KAAQ,OAA2C;EAClF,KAAK,IAAI,KAAK,cAAc,GAAa,GAAG,KAAK,KAAK,OAAO,KAAe,KAAK,CAAC;EAClF,OAAO;CACX;CAEA,IAAoC,KAAQ,OAA2C;EACnF,KAAK,IAAI,KAAK,cAAc,GAAa,GAAG,MAAM,KAAK,OAAO,KAAe,KAAK,CAAC;EACnF,OAAO;CACX;CAEA,GAAoC,KAAQ,OAA2C;EACnF,KAAK,IAAI,KAAK,cAAc,GAAa,GAAG,KAAK,KAAK,OAAO,KAAe,KAAK,CAAC;EAClF,OAAO;CACX;CAEA,IAAqC,KAAQ,OAA2C;EACpF,KAAK,IAAI,KAAK,cAAc,GAAa,GAAG,MAAM,KAAK,OAAO,KAAe,KAAK,CAAC;EACnF,OAAO;CACX;CAEA,GAAoC,KAAQ,OAA2C;EACnF,KAAK,IAAI,KAAK,cAAc,GAAa,GAAG,KAAK,KAAK,OAAO,KAAe,KAAK,CAAC;EAClF,OAAO;CACX;CAEA,IAAqC,KAAQ,OAA2C;EACpF,KAAK,IAAI,KAAK,cAAc,GAAa,GAAG,MAAM,KAAK,OAAO,KAAe,KAAK,CAAC;EACnF,OAAO;CACX;CAEA,KAAmC,KAAQ,SAAmC;EAC1E,KAAK,IAAI,KAAK,cAAc,GAAa,GAAG,QAAQ,KAAK,OAAO,KAAe,OAAO,CAAC;EACvF,OAAO;CACX;CAEA,MAAoC,KAAQ,SAAmC;EAC3E,KAAK,IAAI,KAAK,cAAc,GAAa,GAAG,SAAS,KAAK,OAAO,KAAe,OAAO,CAAC;EACxF,OAAO;CACX;CAEA,SAAuC,KAAQ,OAAiC;EAC5E,KAAK,IAAI,KAAK,cAAc,GAAa,GAAG,YAAY,KAAK,OAAO,KAAe,KAAK,CAAC;EACzF,OAAO;CACX;CAEA,UAAwC,KAAQ,OAAiC;EAC7E,KAAK,IAAI,KAAK,cAAc,GAAa,GAAG,aAAa,KAAK,OAAO,KAAe,KAAK,CAAC;EAC1F,OAAO;CACX;;;;;;;;;CAUA,aAAyC,KAAQ,OAAgB,MAA8C;EAC3G,KAAK,gBAAgB,gBAAgB,KAAe,OAAO,IAAI;EAC/D,OAAO;CACX;;CAGA,gBAA4C,KAAQ,OAAgB,MAA8C;EAC9G,KAAK,gBAAgB,mBAAmB,KAAe,OAAO,IAAI;EAClE,OAAO;CACX;CAsBA,WACI,KACA,OACA,MACgB;EAChB,MAAM,MAAM,KAAK,cAAc,GAAa;EAE5C,IAAI,MAAM,QAAQ,MAAM,QAAQ,KAAK,GAAG;GAIpC,MAAM,OAAsB;IACxB,MAAM;IACN,QAAQ;IACR,UAAU;IACV,OAPW,MAAgC,KAAK,MAChD,KAAK,OAAO,OAAO,MAAM,WAAW,IAAI,eAAe,MAAM,QAAQ,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAMtE;IACX,MAAM,KAAK;GACf;GACA,KAAK,WAAW,KAAK,IAAI;GACzB,OAAO;EACX;EAEA,IAAI,MAAM,QAAQ,KAAK,GACnB,KAAK,IAAI,KAAK,cAAc,eAAe,KAAiB,GAAG,KAAA,GAAW,IAAI;OAC3E,IAAI,MAAM,KACb,KAAK,IAAI,KAAK,cAAc,OAAO,KAAA,GAAW,IAAI;OAElD,KAAK,IAAI,KAAK,cAAc,OAAO,KAAA,GAAW,KAAK;EAEvD,OAAO;CACX;;;;;;;CAQA,kBAA8C,KAAQ,OAAgB,MAA8C;EAChH,KAAK,gBAAgB,qBAAqB,KAAe,OAAO,IAAI;EACpE,OAAO;CACX;CAEA,QAAyC,KAAQ,IAAsB,IAAwC;EAC3G,KAAK,IAAI,KAAK,cAAc,GAAa,GAAG,WAAW,KAAK,OAAO,KAAe,EAAE,GAAG,KAAK,OAAO,KAAe,EAAE,CAAC;EACrH,OAAO;CACX;;;;;;;CAQA,GAAmC,KAAQ,QAAuD;EAC9F,MAAM,MAAM,KAAK,cAAc,GAAa;EAC5C,KAAK,IAAI,KAAK,MAAM,OAAO,KAAK,MAAM,KAAK,OAAO,KAAe,CAAC,CAAC,CAAC;EACpE,OAAO;CACX;CAEA,OAAuC,KAA0B;EAC7D,KAAK,IAAI,KAAK,cAAc,GAAa,GAAG,UAAU,IAAI;EAC1D,OAAO;CACX;CAEA,QAAwC,KAA0B;EAC9D,KAAK,IAAI,KAAK,cAAc,GAAa,GAAG,aAAa,IAAI;EAC7D,OAAO;CACX;;;;;;;;;;;CAYA,GAAG,UAAgE;EAC/D,MAAM,WAAwB,CAAC;EAC/B,KAAK,MAAM,MAAM,UAAU;GACvB,MAAM,MAAM,IAAI,cAAiB,KAAK,SAAS,KAAK,MAAM;GAC1D,GAAG,GAAG;GACN,IAAI,IAAI,WAAW,WAAW,GAC1B,SAAS,KAAK,IAAI,WAAW,EAAE;QAC5B,IAAI,IAAI,WAAW,SAAS,GAC/B,SAAS,KAAK;IAAE,MAAM;IAAO,UAAU,IAAI;GAAW,CAAC;EAE/D;EACA,IAAI,SAAS,SAAS,GAClB,KAAK,WAAW,KAAK;GAAE,MAAM;GAAM;EAAS,CAAC;EAEjD,OAAO;CACX;AACJ;AAGA,SAAgB,kBAAkB,WAAsB,QAAmB,KAAyB;CAChG,QAAQ,UAAU,MAAlB;EACI,KAAK,OAED,OAAO,IADO,UAAU,SAAS,KAAK,MAAM,kBAAkB,GAAG,QAAQ,GAAG,CAC7D,CAAC,CAAC,KAAK,OAAO,EAAE;EAEnC,KAAK,MAED,OAAO,IADO,UAAU,SAAS,KAAK,MAAM,kBAAkB,GAAG,QAAQ,GAAG,CAC7D,CAAC,CAAC,KAAK,MAAM,EAAE;EAElC,KAAK,QACD,OAAO,aAAa,WAAW,QAAQ,GAAG;CAElD;AACJ;AAEA,SAAS,aAAa,MAAqB,QAAmB,KAAyB;CACnF,MAAM,MAAM,KAAK;CACjB,QAAQ,KAAK,UAAb;EACI,KAAK;EAAK,KAAK;EAAM,KAAK;EAAK,KAAK;EAAM,KAAK;EAAK,KAAK;GACrD,OAAO,KAAK,KAAK,KAAK;GACtB,OAAO,GAAG,IAAI,GAAG,KAAK,SAAS,GAAG,IAAI,YAAY,OAAO,MAAM;EAEnE,KAAK,WAAW;GACZ,OAAO,KAAK,KAAK,KAAK;GACtB,MAAM,KAAK,IAAI,YAAY,OAAO,MAAM;GACxC,OAAO,KAAK,KAAK,MAAM;GAEvB,OAAO,GAAG,IAAI,WAAW,GAAG,OADjB,IAAI,YAAY,OAAO,MACE;EACxC;EACA,KAAK,MAAM;GACP,MAAM,SAAU,KAAK,SAAS,CAAC;GAE/B,IAAI,OAAO,WAAW,GAAG,OAAO;GAKhC,OAAO,GAAG,IAAI,OAJO,OAAO,KAAK,MAAM;IACnC,OAAO,KAAK,CAAC;IACb,OAAO,IAAI,YAAY,OAAO,MAAM;GACxC,CACgC,CAAC,CAAC,KAAK,IAAI,EAAE;EACjD;EACA,KAAK;GACD,OAAO,KAAK,KAAK,KAAK;GACtB,OAAO,GAAG,IAAI,QAAQ,IAAI,YAAY,OAAO,MAAM;EAEvD,KAAK;GACD,OAAO,KAAK,KAAK,KAAK;GACtB,OAAO,IAAI,MAAM,KAAK,OAAO,MAAM;EAEvC,KAAK;GACD,OAAO,KAAK,IAAI,KAAK,MAAM,EAAE;GAC7B,OAAO,GAAG,IAAI,QAAQ,IAAI,YAAY,OAAO,MAAM;EAEvD,KAAK;GACD,OAAO,KAAK,IAAI,KAAK,MAAM,EAAE;GAC7B,OAAO,IAAI,UAAU,KAAK,OAAO,MAAM;EAE3C,KAAK,gBAAgB;GACjB,OAAO,KAAK,KAAK,KAAK;GACtB,MAAM,SAAS,OAAO;GACtB,IAAI;GACJ,IAAI,KAAK,SAAS,KAAA,GAAW;IACzB,OAAO,KAAK,KAAK,IAAI;IACrB,YAAY,OAAO;GACvB;GACA,OAAO,IAAI,aAAa,KAAK,QAAQ;IAAE,KAAK,KAAK;IAAK;GAAU,CAAC;EACrE;EACA,KAAK,mBAAmB;GACpB,OAAO,KAAK,KAAK,KAAK;GACtB,MAAM,SAAS,OAAO;GACtB,IAAI;GACJ,IAAI,KAAK,SAAS,KAAA,GAAW;IACzB,OAAO,KAAK,KAAK,IAAI;IACrB,YAAY,OAAO;GACvB;GACA,OAAO,IAAI,gBAAgB,KAAK,QAAQ;IAAE,KAAK,KAAK;IAAK;GAAU,CAAC;EACxE;EACA,KAAK;GACD,IAAI,KAAK,QAAQ,MAAM,QAAQ,KAAK,KAAK,GAAG;IACxC,MAAM,QAAQ,KAAK;IACnB,MAAM,WAAW,OAAO,SAAS;IACjC,KAAK,MAAM,KAAK,OAAO,OAAO,KAAK,CAAC;IACpC,OAAO,IAAI,WAAW,KAAK,UAAU;KACjC,KAAK;KACL,MAAM,KAAK;KACX,WAAW,MAAM;IACrB,CAAC;GACL;GACA,OAAO,KAAK,KAAK,KAAK;GACtB,OAAO,IAAI,WAAW,KAAK,OAAO,QAAQ,EAAE,KAAK,KAAK,IAAI,CAAC;EAE/D,KAAK,qBAAqB;GACtB,OAAO,KAAK,KAAK,KAAK;GACtB,MAAM,SAAS,OAAO;GACtB,IAAI;GACJ,IAAI,KAAK,SAAS,KAAA,GAAW;IACzB,OAAO,KAAK,KAAK,IAAI;IACrB,YAAY,OAAO;GACvB;GACA,OAAO,IAAI,kBAAkB,KAAK,QAAQ;IAAE,KAAK,KAAK;IAAK;GAAU,CAAC;EAC1E;EACA,KAAK,UAAU,OAAO,GAAG,IAAI;EAC7B,KAAK,aAAa,OAAO,GAAG,IAAI;CACpC;AACJ;AAEA,SAAgB,iBAAiB,KAA8B,WAA+B;CAC1F,QAAQ,UAAU,MAAlB;EACI,KAAK,OAAO,OAAO,UAAU,SAAS,OAAO,MAAM,iBAAiB,KAAK,CAAC,CAAC;EAC3E,KAAK,MAAM,OAAO,UAAU,SAAS,MAAM,MAAM,iBAAiB,KAAK,CAAC,CAAC;EACzE,KAAK,QAAQ,OAAO,YAAY,KAAK,SAAS;CAClD;AACJ;AAEA,SAAS,YAAY,KAA8B,MAA8B;CAC7E,MAAM,MAAM,IAAI,KAAK;CAErB,QAAQ,KAAK,UAAb;EACI,KAAK,KAAK,OAAO,QAAQ,KAAK;EAC9B,KAAK,MAAM,OAAO,QAAQ,KAAK;EAC/B,KAAK,KAAK,OAAQ,MAAkB,KAAK;EACzC,KAAK,MAAM,OAAQ,OAAmB,KAAK;EAC3C,KAAK,KAAK,OAAQ,MAAkB,KAAK;EACzC,KAAK,MAAM,OAAQ,OAAmB,KAAK;EAE3C,KAAK,WACD,OAAQ,OAAmB,KAAK,SAC3B,OAAmB,KAAK;EAEjC,KAAK,MACD,OAAO,MAAM,QAAQ,KAAK,KAAK,KAAM,KAAK,MAAoB,SAAS,GAAG;EAE9E,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK,aAAa;GACd,IAAI,OAAO,QAAQ,YAAY,OAAO,KAAK,UAAU,UAAU,OAAO;GACtE,MAAM,WAAY,KAAK,aAAa,WAAW,KAAK,aAAa,cAC1D,IAAe,YAAY,IAC5B;GACN,MAAM,MAAM,KAAK;GACjB,MAAM,SAAU,KAAK,aAAa,WAAW,KAAK,aAAa,cACzD,IAAI,YAAY,IAChB;GACN,MAAM,UAAW,KAAK,aAAa,cAAc,KAAK,aAAa,cAC7D,IAAI,OAAO,KACX;GAIN,OAAO,IAHW,OACd,MAAM,QAAQ,QAAQ,MAAM,IAAI,CAAC,CAAC,QAAQ,MAAM,GAAG,IAAI,GAEhD,CAAC,CAAC,KAAK,QAAQ;EAC9B;EAEA,KAAK,gBAAgB;GACjB,MAAM,YAAY,oBAAoB,IAAI;GAC1C,MAAM,SAAS,KAAK,SAAS,KAAA,IAAY,gBAAgB,KAAK,KAAK,IAAI,IAAI;GAC3E,IAAI,WAAW,KAAA,GAAW,OAAO;GACjC,OAAO,aAAa,QAAQ,SAAS;EACzC;EAEA,KAAK,mBAAmB;GACpB,MAAM,YAAY,oBAAoB,IAAI;GAC1C,MAAM,SAAS,KAAK,SAAS,KAAA,IAAY,gBAAgB,KAAK,KAAK,IAAI,IAAI;GAC3E,IAAI,WAAW,KAAA,GAAW,OAAO;GACjC,OAAO,aAAa,WAAW,MAAM;EACzC;EAEA,KAAK,cAAc;GACf,IAAI,KAAK,QAAQ,MAAM,QAAQ,KAAK,KAAK,GAAG;IACxC,MAAM,QAAQ,KAAK;IACnB,IAAI,MAAM,WAAW,GAAG,OAAO;IAC/B,OAAO,KAAK,SAAS,QACf,MAAM,OAAO,MAAM,eAAe,KAAK,CAAC,CAAC,IACzC,MAAM,MAAM,MAAM,eAAe,KAAK,CAAC,CAAC;GAClD;GACA,IAAI,KAAK,KACL,OAAO,eAAe,KAAK,KAAK,KAAe;GAEnD,MAAM,MAAM,KAAK;GACjB,IAAI,QAAQ,QAAQ,OAAO,QAAQ,UAAU,OAAO;GACpD,IAAI,MAAM,QAAQ,GAAG,GAAG,OAAQ,IAAkB,SAAS,GAAG;GAC9D,OAAO,OAAQ;EACnB;EAEA,KAAK,qBAAqB;GACtB,MAAM,YAAY,oBAAoB,IAAI;GAC1C,MAAM,SAAS,KAAK,SAAS,KAAA,IAAY,gBAAgB,KAAK,KAAK,IAAI,IAAI;GAC3E,IAAI,CAAC,MAAM,QAAQ,MAAM,GAAG,OAAO;GACnC,OAAQ,OAAqB,MAAM,OAAO,aAAa,IAAI,SAAS,CAAC;EACzE;EAEA,KAAK,UACD,OAAO,QAAQ;EAEnB,KAAK,aACD,OAAO,QAAQ;EAEnB,SACI,OAAO;CACf;AACJ;AAIA,SAAS,oBAAoB,MAA8B;CACvD,IAAI,CAAC,KAAK,KAAK,OAAO,KAAK;CAC3B,IAAI,OAAO,KAAK,UAAU,UAAU,OAAO,KAAK;CAChD,IAAI;EAAE,OAAO,KAAK,MAAM,KAAK,KAAK;CAAG,QAAQ;EAAE,OAAO,KAAK;CAAO;AACtE;AAOA,SAAgB,aAAa,QAAiB,WAA6B;CACvE,IAAI,cAAc,QAAQ,OAAO;CACjC,IAAI,WAAW,QAAQ,cAAc,MAAM,OAAO,WAAW;CAC7D,IAAI,WAAW,KAAA,KAAa,cAAc,KAAA,GAAW,OAAO;CAE5D,MAAM,OAAO,MAAM,QAAQ,MAAM;CACjC,MAAM,OAAO,MAAM,QAAQ,SAAS;CACpC,MAAM,OAAO,CAAC,QAAQ,OAAO,WAAW;CACxC,MAAM,OAAO,CAAC,QAAQ,OAAO,cAAc;CAG3C,IAAI,CAAC,QAAQ,CAAC,QAAQ,MAClB,OAAQ,OAAqB,MAAM,OAAO,aAAa,IAAI,SAAS,CAAC;CAGzE,IAAI,QAAQ,MAAM;EACd,MAAM,IAAI;EACV,OAAQ,UAAwB,OAAO,MAAM,EAAE,MAAM,OAAO,aAAa,IAAI,CAAC,CAAC,CAAC;CACpF;CAEA,IAAI,QAAQ,MAAM;EACd,MAAM,IAAI;EACV,MAAM,IAAI;EACV,KAAK,MAAM,KAAK,OAAO,KAAK,CAAC,GAAG;GAC5B,IAAI,EAAE,KAAK,IAAI,OAAO;GACtB,IAAI,CAAC,aAAa,EAAE,IAAI,EAAE,EAAE,GAAG,OAAO;EAC1C;EACA,OAAO;CACX;CACA,OAAO;AACX;AAKA,SAAgB,gBAAgB,KAAc,MAAuB;CACjE,IAAI,IAAI;CACR,IAAI,EAAE,WAAW,GAAG,GAAG,IAAI,EAAE,MAAM,CAAC;CACpC,IAAI,MAAe;CACnB,OAAO,EAAE,SAAS,GACd,IAAI,EAAE,WAAW,KAAI,GAAG;EACpB,IAAI,MAAM;EACV,OAAO,MAAM,EAAE,QAAQ;GACnB,IAAI,EAAE,SAAS,QAAQ,MAAM,IAAI,EAAE,QAAQ;IAAE,OAAO;IAAG;GAAU;GACjE,IAAI,EAAE,SAAS,MAAK;GACpB;EACJ;EACA,IAAI,OAAO,EAAE,QAAQ,OAAO,KAAA;EAC5B,MAAM,MAAM,EAAE,MAAM,GAAG,GAAG,CAAC,CAAC,QAAQ,QAAQ,IAAG,CAAC,CAAC,QAAQ,SAAS,IAAI;EACtE,IAAI,QAAQ,QAAQ,OAAO,QAAQ,YAAY,MAAM,QAAQ,GAAG,GAAG,OAAO,KAAA;EAC1E,IAAI,EAAE,OAAQ,MAAiB,OAAO,KAAA;EACtC,MAAO,IAAgC;EACvC,IAAI,EAAE,MAAM,MAAM,CAAC;CACvB,OAAO,IAAI,EAAE,WAAW,GAAG,GAAG;EAC1B,MAAM,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,MAAM,WAAW;EACtC,IAAI,CAAC,GAAG,OAAO,KAAA;EACf,MAAM,MAAM,EAAE;EACd,IAAI,QAAQ,QAAQ,OAAO,QAAQ,YAAY,MAAM,QAAQ,GAAG,GAAG,OAAO,KAAA;EAC1E,IAAI,EAAE,OAAQ,MAAiB,OAAO,KAAA;EACtC,MAAO,IAAgC;EACvC,IAAI,EAAE,MAAM,IAAI,IAAI,MAAM;CAC9B,OAAO,IAAI,EAAE,WAAW,GAAG,GAAG;EAC1B,MAAM,MAAM,EAAE,QAAQ,GAAG;EACzB,IAAI,QAAQ,IAAI,OAAO,KAAA;EACvB,MAAM,MAAM,SAAS,EAAE,MAAM,GAAG,GAAG,GAAG,EAAE;EACxC,IAAI,CAAC,MAAM,QAAQ,GAAG,KAAK,MAAM,KAAK,OAAQ,IAAkB,QAAQ,OAAO,KAAA;EAC/E,MAAO,IAAkB;EACzB,IAAI,EAAE,MAAM,MAAM,CAAC;CACvB,OACI;CAGR,OAAO;AACX;AAMA,SAAgB,eAAe,KAAc,MAAuB;CAChE,IAAI,IAAI;CACR,IAAI,EAAE,WAAW,GAAG,GAAG,IAAI,EAAE,MAAM,CAAC;CACpC,IAAI,MAAe;CACnB,OAAO,EAAE,SAAS,GACd,IAAI,EAAE,WAAW,KAAI,GAAG;EACpB,IAAI,MAAM;EACV,OAAO,MAAM,EAAE,QAAQ;GACnB,IAAI,EAAE,SAAS,QAAQ,MAAM,IAAI,EAAE,QAAQ;IAAE,OAAO;IAAG;GAAU;GACjE,IAAI,EAAE,SAAS,MAAK;GACpB;EACJ;EACA,IAAI,OAAO,EAAE,QAAQ,OAAO;EAC5B,MAAM,MAAM,EAAE,MAAM,GAAG,GAAG,CAAC,CAAC,QAAQ,QAAQ,IAAG,CAAC,CAAC,QAAQ,SAAS,IAAI;EACtE,IAAI,QAAQ,QAAQ,OAAO,QAAQ,YAAY,MAAM,QAAQ,GAAG,GAAG,OAAO;EAC1E,IAAI,EAAE,OAAQ,MAAiB,OAAO;EACtC,MAAO,IAAgC;EACvC,IAAI,EAAE,MAAM,MAAM,CAAC;CACvB,OAAO,IAAI,EAAE,WAAW,GAAG,GAAG;EAC1B,MAAM,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,MAAM,WAAW;EACtC,IAAI,CAAC,GAAG,OAAO;EACf,MAAM,MAAM,EAAE;EACd,IAAI,QAAQ,QAAQ,OAAO,QAAQ,YAAY,MAAM,QAAQ,GAAG,GAAG,OAAO;EAC1E,IAAI,EAAE,OAAQ,MAAiB,OAAO;EACtC,MAAO,IAAgC;EACvC,IAAI,EAAE,MAAM,IAAI,IAAI,MAAM;CAC9B,OAAO,IAAI,EAAE,WAAW,GAAG,GAAG;EAC1B,MAAM,MAAM,EAAE,QAAQ,GAAG;EACzB,IAAI,QAAQ,IAAI,OAAO;EACvB,MAAM,MAAM,SAAS,EAAE,MAAM,GAAG,GAAG,GAAG,EAAE;EACxC,IAAI,CAAC,MAAM,QAAQ,GAAG,KAAK,MAAM,KAAK,OAAQ,IAAkB,QAAQ,OAAO;EAC/E,MAAO,IAAkB;EACzB,IAAI,EAAE,MAAM,MAAM,CAAC;CACvB,OACI,OAAO;CAGf,OAAO,QAAQ,KAAA;AACnB"}

package/dist/realtime_db-DnZKn_FZ.js

@@ -0,0 +1,312 @@
+import { a as unwrapZodType, i as normalizeCodec } from "./table-id-DyrJBKAQ.js";
+import { t as QueryBuilder } from "./query-Bk2W-ynQ.js";
+import { r as LazyCommitTsParam } from "./db-ClCicssQ.js";
+import { l as OccConflictError } from "./types_db-Dw2RHWrd.js";
+import { z as z$1 } from "zod";
+import { ExponentialBackoff, handleWhen, retry } from "cockatiel";
+//#region src/db/context.ts
+/**
+* Materialize a schema's runtime {@link Model}: column-name mapping, per-column
+* coarse type tags, and the codec used to (de)serialize each column.
+*
+* Codecs are resolved via {@link normalizeCodec}, which supplies a sensible
+* default per Zod type (e.g. a {@link dateCodec} for `z.date()`, so `Date`
+* columns round-trip automatically) while letting a user-supplied codec in
+* `schema.columnsOptions.codecs` override it — partially or fully.
+*/
+function buildModel(schema) {
+	const shape = schema.schema.shape;
+	const customColumns = schema.columns;
+	const columns = {};
+	const types = {};
+	const codecs = {};
+	const schemaCodecs = schema.columnsOptions.codecs ?? {};
+	for (const key of Object.keys(shape)) {
+		columns[key] = customColumns?.[key] ?? key;
+		const field = shape[key];
+		const baseField = unwrapZodType(field);
+		if (baseField instanceof z$1.ZodNumber) types[key] = "integer";
+		else if (baseField instanceof z$1.ZodString) types[key] = "string";
+		else if (baseField instanceof z$1.ZodBoolean) types[key] = "boolean";
+		else if (baseField instanceof z$1.ZodDate) types[key] = "date";
+		else if (baseField instanceof z$1.ZodArray) types[key] = "array";
+		else types[key] = "json";
+		codecs[key] = normalizeCodec(schemaCodecs[key], baseField);
+	}
+	return {
+		table: schema.table,
+		tableId: schema.tableId,
+		columns,
+		reverseColumns: Object.fromEntries(Object.entries(columns).map(([k, v]) => [v, k])),
+		types,
+		codecs
+	};
+}
+var TxContext = class {
+	beginTs;
+	db;
+	readSet = [];
+	writeSet = [];
+	models = /* @__PURE__ */ new Map();
+	getOrCreateModel(schema) {
+		const existing = this.models.get(schema.table);
+		if (existing) return existing;
+		const model = buildModel(schema);
+		this.models.set(schema.table, model);
+		return model;
+	}
+	constructor(db, beginTs) {
+		this.db = db;
+		this.beginTs = beginTs;
+	}
+	/**
+	* Rebind the read connection (and its snapshot ts). Used by the replica
+	* router when a query handler calls `ctx.usePrimaryConn()`/`useReplicaConn()`.
+	* Must be called BEFORE any read — the readSet/beginTs would otherwise mix
+	* snapshots — so this throws if a read or write has already happened.
+	*/
+	useConnection(db, beginTs) {
+		if (this.readSet.length > 0 || this.writeSet.length > 0) throw new Error("useConnection()/usePrimaryConn()/useReplicaConn() must be called before any read or write in the handler");
+		this.db = db;
+		this.beginTs = beginTs;
+	}
+	internalGetReadSet() {
+		return this.readSet;
+	}
+	internalGetWriteSet() {
+		return this.writeSet;
+	}
+	/**
+	* Merge a parent procedure's reads into this context's readSet. Used when a
+	* `runMutation` sub-transaction inherits the reads of the procedure that
+	* invoked it, so the sub-tx's OCC validation also fences on those rows.
+	* Entries are shallow-cloned so the two readSets don't alias.
+	*/
+	appendInternalReadSet(parentEntries) {
+		this.readSet.push(...parentEntries.map((e) => ({ ...e })));
+	}
+	findPendingWrite(table, id) {
+		return this.writeSet.find((w) => w.table === table && w.id === id);
+	}
+	findPendingInsert(table, id) {
+		return this.writeSet.find((w) => w.table === table && w.id === id && w.op === "insert");
+	}
+	encodeWithCodec(model, property, value) {
+		const codec = model.codecs[property];
+		if (!codec?.encode || value === void 0 || value === null) return value;
+		return codec.encode(value);
+	}
+};
+var DbReader = class extends TxContext {
+	query(schema) {
+		const model = this.getOrCreateModel(schema);
+		return new QueryBuilder(this, model);
+	}
+};
+var DbWriter = class extends DbReader {
+	async insert(schema, id, data) {
+		const model = this.getOrCreateModel(schema);
+		const mappedData = { id };
+		const shape = schema.schema.shape;
+		for (const key of Object.keys(shape)) {
+			let value = data[key];
+			if (value === void 0) {
+				const field = shape[key];
+				if (field instanceof z$1.ZodDefault) {
+					const defaultVal = field.def.defaultValue;
+					value = typeof defaultVal === "function" ? defaultVal() : defaultVal;
+					if (value !== void 0) {
+						const columnName = model.columns[key] ?? key;
+						mappedData[columnName] = this.encodeWithCodec(model, key, value);
+					}
+				}
+			} else {
+				const columnName = model.columns[key] ?? key;
+				mappedData[columnName] = this.encodeWithCodec(model, key, value);
+			}
+		}
+		mappedData["id"] = id;
+		const existing = this.findPendingWrite(schema.table, id);
+		if (existing) if (existing.op === "delete") {
+			existing.op = "update";
+			existing.data = mappedData;
+		} else existing.data = {
+			...existing.data,
+			...mappedData
+		};
+		else this.writeSet.push({
+			table: schema.table,
+			tableId: schema.tableId,
+			id,
+			op: "insert",
+			data: mappedData
+		});
+	}
+	async update(schema, id, data) {
+		const model = this.getOrCreateModel(schema);
+		const mappedData = {};
+		for (const [key, value] of Object.entries(data)) {
+			const columnName = model.columns[key] ?? key;
+			mappedData[columnName] = this.encodeWithCodec(model, key, value);
+		}
+		const existing = this.findPendingWrite(schema.table, id);
+		if (existing) {
+			existing.op = existing.op === "insert" ? "insert" : "update";
+			existing.data = {
+				...existing.data,
+				...mappedData
+			};
+		} else this.writeSet.push({
+			table: schema.table,
+			tableId: schema.tableId,
+			id,
+			op: "update",
+			data: mappedData
+		});
+	}
+	async delete(schema, id) {
+		const existingInsert = this.findPendingInsert(schema.table, id);
+		if (existingInsert) {
+			this.writeSet = this.writeSet.filter((w) => w !== existingInsert);
+			return;
+		}
+		this.writeSet.push({
+			table: schema.table,
+			tableId: schema.tableId,
+			id,
+			op: "delete"
+		});
+	}
+};
+//#endregion
+//#region src/db/realtime_db.ts
+const occRetryPolicy = retry(handleWhen((err) => OccConflictError.isOccConflictError(err)), {
+	maxAttempts: 15,
+	backoff: new ExponentialBackoff({
+		initialDelay: 10,
+		maxDelay: 7e3,
+		exponent: 2
+	})
+});
+const getDbclientRetryPolicy = retry(handleWhen((err) => err.message.includes("timeout exceeded")), {
+	maxAttempts: 3,
+	backoff: new ExponentialBackoff({
+		initialDelay: 500,
+		maxDelay: 2e3,
+		exponent: 2
+	})
+});
+var SupaliveDb = class SupaliveDb {
+	impl;
+	replica;
+	/**
+	* @param impl     the PRIMARY (writer) connection — all mutations, the OCC
+	*                 commit-ts source, and cache-freshness commit-log scans run here.
+	* @param replica  optional read replica for query/action reads (see the
+	*                 routing in one-shot-query.ts). Undefined → reads use primary.
+	*/
+	constructor(impl, replica) {
+		this.impl = impl;
+		this.replica = replica;
+	}
+	static create(config) {
+		return new SupaliveDb(config.db, config.replica ? new SupaliveDb(config.replica) : void 0);
+	}
+	/** True when a distinct read replica is configured. */
+	get hasReplica() {
+		return this.replica !== void 0;
+	}
+	onAfterCommit;
+	/**
+	* Register a hook fired once after every successful `mutation()` commit
+	* (never on an OCC conflict/rollback), with the committed writeSet and its
+	* commitTs. The server uses this to drive subscription invalidation for ALL
+	* mutation sources — client WS calls, actions, jobs, and the internal caller —
+	* so a server-side write pushes live updates just like a client write does.
+	* Non-server consumers (migration tooling, tests) leave it unset (no-op).
+	*/
+	setOnAfterCommit(cb) {
+		this.onAfterCommit = cb;
+	}
+	/**
+	* One-shot read against an EXPLICIT connection + snapshot ts (rather than this
+	* db's own latest). Used by the replica router: the caller pre-resolves the
+	* default read connection (replica for queries) and hands the handler a
+	* `DbReader` it can rebind via `useConnection` (ctx.usePrimaryConn/…). The
+	* returned `ts` is the FINAL bound connection's snapshot, so the cache entry is
+	* stamped with the ts actually read at.
+	*/
+	async queryInternalOn(read, fn) {
+		const ctx = new DbReader(read.impl, read.beginTs);
+		const data = await fn(ctx);
+		return {
+			ts: ctx.beginTs,
+			data,
+			readSet: ctx.internalGetReadSet()
+		};
+	}
+	async query(fn) {
+		const beginTs = await this.impl.getLatestSnapshotTimestamp();
+		return await fn(new DbReader(this.impl, beginTs));
+	}
+	/**
+	* Compute a query once at the latest snapshot, returning the result together
+	* with the snapshot `ts` and the tracked `readSet`. This is a plain one-shot
+	* evaluation — it registers NO live subscription; the `readSet`/`ts` are
+	* returned purely so the caller (e.g. the one-shot query cache) can store
+	* freshness metadata. Use this for cached one-shot query calls (WS `call`,
+	* HTTP RPC). `liveQuery` is the same computation under the subscription path's
+	* name and simply delegates here.
+	*/
+	async queryInternal(fn) {
+		const beginTs = await this.impl.getLatestSnapshotTimestamp();
+		const ctx = new DbReader(this.impl, beginTs);
+		return {
+			ts: beginTs,
+			data: await fn(ctx),
+			readSet: ctx.internalGetReadSet()
+		};
+	}
+	async liveQuery(fn) {
+		return this.queryInternal(fn);
+	}
+	async mutation(fn, retryPolicy = occRetryPolicy) {
+		return await retryPolicy.execute(async (p) => {
+			let db;
+			try {
+				const beginTs = await this.impl.getLatestSnapshotTimestamp() + 1n;
+				const ctx = new DbWriter(this.impl, beginTs);
+				const result = await fn(ctx);
+				const readSet = ctx.internalGetReadSet();
+				const writeSet = ctx.internalGetWriteSet();
+				const commitTsLazy = new LazyCommitTsParam(void 0);
+				await this.impl.attachPrevDataToWriteSet(writeSet, readSet);
+				const queries = await this.impl.prepareCommitWrites(readSet, writeSet, commitTsLazy);
+				db = await getDbclientRetryPolicy.execute(() => this.impl.getTransactionClient());
+				await db.begin();
+				const commitTs = await db.getNextTimestamp();
+				commitTsLazy.value = commitTs;
+				const commitResult = await db.commitWrites(beginTs, queries, commitTs);
+				if (!commitResult.success) throw new OccConflictError("Commit failed", { commitResult });
+				await db.updateLatestSnapshotTimestamp(commitTs);
+				await db.commit();
+				this.onAfterCommit?.(writeSet, commitTs);
+				return {
+					result,
+					writeSet,
+					commitTs
+				};
+			} catch (err) {
+				await db?.rollback();
+				throw err;
+			} finally {
+				db?.release();
+			}
+		});
+	}
+};
+const sleep = (ms) => new Promise((res) => setTimeout(res, ms));
+//#endregion
+export { TxContext as a, DbWriter as i, sleep as n, DbReader as r, SupaliveDb as t };
+
+//# sourceMappingURL=realtime_db-DnZKn_FZ.js.map

package/dist/realtime_db-DnZKn_FZ.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"realtime_db-DnZKn_FZ.js","names":["z"],"sources":["../src/db/context.ts","../src/db/realtime_db.ts"],"sourcesContent":["import { z, ZodRawShape } from \"zod\";\nimport { Database } from \"./db\";\nimport { ReadEntry, WriteEntry, } from \"./types_db\";\n\nimport { ColumnCodec, InferSchema, InsertData, Model, SchemaDefinition } from \"./schema\";\nimport { normalizeCodec, unwrapZodType } from \"./codec\";\nimport { QueryBuilder } from \"./query\";\n\n/**\n * Materialize a schema's runtime {@link Model}: column-name mapping, per-column\n * coarse type tags, and the codec used to (de)serialize each column.\n *\n * Codecs are resolved via {@link normalizeCodec}, which supplies a sensible\n * default per Zod type (e.g. a {@link dateCodec} for `z.date()`, so `Date`\n * columns round-trip automatically) while letting a user-supplied codec in\n * `schema.columnsOptions.codecs` override it — partially or fully.\n */\nexport function buildModel(schema: SchemaDefinition<string, ZodRawShape>): Model {\n  const shape = schema.schema.shape;\n  const customColumns = (schema as any).columns;\n  const columns: Record<string, string> = {};\n  const types: Record<string, string> = {};\n  const codecs: Record<string, ColumnCodec<any, any>> = {};\n  const schemaCodecs = schema.columnsOptions.codecs ?? {};\n\n  for (const key of Object.keys(shape)) {\n    columns[key] = customColumns?.[key] ?? key;\n    const field = shape[key];\n    const baseField = unwrapZodType(field);\n    if (baseField instanceof z.ZodNumber) {\n      types[key] = \"integer\";\n    } else if (baseField instanceof z.ZodString) {\n      types[key] = \"string\";\n    } else if (baseField instanceof z.ZodBoolean) {\n      types[key] = \"boolean\";\n    } else if (baseField instanceof z.ZodDate) {\n      types[key] = \"date\";\n    } else if (baseField instanceof z.ZodArray) {\n      types[key] = \"array\";\n    } else {\n      types[key] = \"json\";\n    }\n    codecs[key] = normalizeCodec(schemaCodecs[key], baseField);\n  }\n\n  return {\n    table: schema.table,\n    tableId: schema.tableId,\n    columns,\n    reverseColumns: Object.fromEntries(Object.entries(columns).map(([k, v]) => [v, k])),\n    types,\n    codecs,\n  };\n}\n\nexport class TxContext {\n  // Not `readonly`: a query's read connection can be rebound (primary↔replica)\n  // via {@link useConnection} before the first read — see the replica routing in\n  // realtime_db.ts / one-shot-query.ts. Mutations never rebind.\n  beginTs: bigint;\n  db: Database;\n  protected readSet: ReadEntry[] = [];\n  protected writeSet: WriteEntry[] = [];\n  private models: Map<string, Model> = new Map();\n\n  protected getOrCreateModel(schema: SchemaDefinition<string, ZodRawShape>): Model {\n    const existing = this.models.get(schema.table);\n    if (existing) return existing;\n\n    const model = buildModel(schema);\n    this.models.set(schema.table, model);\n    return model;\n  }\n\n  constructor(db: Database, beginTs: bigint) {\n    this.db = db;\n    this.beginTs = beginTs;\n  }\n\n  /**\n   * Rebind the read connection (and its snapshot ts). Used by the replica\n   * router when a query handler calls `ctx.usePrimaryConn()`/`useReplicaConn()`.\n   * Must be called BEFORE any read — the readSet/beginTs would otherwise mix\n   * snapshots — so this throws if a read or write has already happened.\n   */\n  useConnection(db: Database, beginTs: bigint): void {\n    if (this.readSet.length > 0 || this.writeSet.length > 0) {\n      throw new Error(\n        \"useConnection()/usePrimaryConn()/useReplicaConn() must be called before any read or write in the handler\",\n      );\n    }\n    this.db = db;\n    this.beginTs = beginTs;\n  }\n\n  internalGetReadSet(): ReadEntry[] { return this.readSet; }\n  internalGetWriteSet(): WriteEntry[] { return this.writeSet; }\n\n  /**\n   * Merge a parent procedure's reads into this context's readSet. Used when a\n   * `runMutation` sub-transaction inherits the reads of the procedure that\n   * invoked it, so the sub-tx's OCC validation also fences on those rows.\n   * Entries are shallow-cloned so the two readSets don't alias.\n   */\n  appendInternalReadSet(parentEntries: ReadEntry[]) {\n    this.readSet.push(...parentEntries.map((e) => ({...e})));\n  }\n\n  protected findPendingWrite(table: string, id: string): WriteEntry | undefined {\n    return this.writeSet.find(w => w.table === table && w.id === id);\n  }\n\n  protected findPendingInsert(table: string, id: string): WriteEntry | undefined {\n    return this.writeSet.find(w => w.table === table && w.id === id && w.op === \"insert\");\n  }\n\n  protected encodeWithCodec(model: Model, property: string, value: unknown): unknown {\n    const codec = model.codecs[property];\n    if (!codec?.encode || value === undefined || value === null) return value;\n    return codec.encode(value);\n  }\n}\n\nexport class DbReader extends TxContext {\n  query<S extends SchemaDefinition<string, ZodRawShape>>(schema: S): QueryBuilder<S> {\n    const model = this.getOrCreateModel(schema);\n    return new QueryBuilder<S>(this, model);\n  }\n}\n\nexport class DbWriter extends DbReader {\n  async insert<S extends SchemaDefinition<string, ZodRawShape>, ID extends string>(\n    schema: S,\n    id: ID,\n    data: InsertData<S>\n  ): Promise<void> {\n    const model = this.getOrCreateModel(schema);\n    const mappedData: Record<string, unknown> = { id };\n    const shape = schema.schema.shape;\n\n    for (const key of Object.keys(shape)) {\n      let value = data[key];\n\n      if (value === undefined) {\n        const field = shape[key];\n        if (field instanceof z.ZodDefault) {\n          const defaultVal = field.def.defaultValue;\n          value = (typeof defaultVal === \"function\" ? defaultVal() : defaultVal)\n\n          if (value !== undefined) {\n            const columnName = model.columns[key] ?? key;\n            mappedData[columnName] = this.encodeWithCodec(model, key, value);\n          }\n        }\n      } else {\n        const columnName = model.columns[key] ?? key;\n        mappedData[columnName] = this.encodeWithCodec(model, key, value);\n      }\n    }\n    // ensure id same\n    mappedData[\"id\"] = id;\n\n    // Check for existing pending write for the same ID\n    const existing = this.findPendingWrite(schema.table, id);\n    if (existing) {\n      if (existing.op === \"delete\") {\n        // If there's a pending delete, change it to an update with the new data\n        existing.op = \"update\";\n        existing.data = mappedData;\n      } else {\n        // If there's a pending update or same insert with the same ID , merge the new data\n        existing.data = { ...existing.data, ...mappedData };\n      }\n    } else {\n      this.writeSet.push({ table: schema.table, tableId: schema.tableId, id: id, op: \"insert\", data: mappedData });\n    }\n  }\n\n  async update<S extends SchemaDefinition<string, ZodRawShape>, ID extends string>(\n    schema: S,\n    id: ID,\n    data: Partial<Omit<InferSchema<S>, \"id\" | \"commitTs\">>,\n  ): Promise<void> {\n    const model = this.getOrCreateModel(schema);\n    const mappedData: Record<string, unknown> = {};\n\n    for (const [key, value] of Object.entries(data)) {\n      const columnName = model.columns[key] ?? key;\n      mappedData[columnName] = this.encodeWithCodec(model, key, value);\n    }\n\n    const existing = this.findPendingWrite(schema.table, id);\n    if (existing) {\n      existing.op = existing.op === \"insert\" ? \"insert\" : \"update\";\n      existing.data = { ...existing.data, ...mappedData };\n    } else {\n      // expectedTs will be filled by the committer via batch fetch if not known yet\n      this.writeSet.push({ table: schema.table, tableId: schema.tableId, id, op: \"update\", data: mappedData });\n    }\n  }\n\n  async delete<S extends SchemaDefinition<string, ZodRawShape>, ID extends string>(\n    schema: S,\n    id: ID,\n  ): Promise<void> {\n    // If there's a pending insert for the same ID, remove it instead of adding a delete\n    const existingInsert = this.findPendingInsert(schema.table, id);\n    if (existingInsert) {\n      this.writeSet = this.writeSet.filter(w => w !== existingInsert);\n      return;\n    }\n\n    // expectedTs will be filled by the committer via batch fetch if not known yet\n    this.writeSet.push({ table: schema.table, tableId: schema.tableId, id, op: \"delete\" });\n  }\n}\n","import { Database, LazyCommitTsParam, TxDatabase } from \"./db\";\nimport {\n  OccConflictError, WriteEntry, CommitTs, LiveResult, MutationResult\n} from \"./types_db\";\nimport { DbReader, DbWriter } from \"./context\";\nimport { ExponentialBackoff, handleWhen, retry, RetryPolicy } from \"cockatiel\";\n\nexport const occRetryPolicy = retry(\n  handleWhen((err) => OccConflictError.isOccConflictError(err)),\n  {\n    maxAttempts: 15,\n    backoff: new ExponentialBackoff({\n      initialDelay: 10,\n      maxDelay: 7000,\n      exponent: 2,\n    }),\n  },\n);\n\nexport const getDbclientRetryPolicy = retry(\n  handleWhen((err) => err.message.includes('timeout exceeded')),\n  {\n    maxAttempts: 3,\n    backoff: new ExponentialBackoff({\n      initialDelay: 500,\n      maxDelay: 2000,\n      exponent: 2,\n    }),\n  },\n);\n\nexport class SupaliveDb {\n  /**\n   * @param impl     the PRIMARY (writer) connection — all mutations, the OCC\n   *                 commit-ts source, and cache-freshness commit-log scans run here.\n   * @param replica  optional read replica for query/action reads (see the\n   *                 routing in one-shot-query.ts). Undefined → reads use primary.\n   */\n  constructor(readonly impl: Database, readonly replica?: SupaliveDb) { }\n\n  static create(config: { db: Database; replica?: Database }): SupaliveDb {\n    return new SupaliveDb(config.db, config.replica ? new SupaliveDb(config.replica) : undefined);\n  }\n\n  /** True when a distinct read replica is configured. */\n  get hasReplica(): boolean {\n    return this.replica !== undefined;\n  }\n\n  protected onAfterCommit?: (writeSet: WriteEntry[], commitTs: CommitTs) => void;\n\n  /**\n   * Register a hook fired once after every successful `mutation()` commit\n   * (never on an OCC conflict/rollback), with the committed writeSet and its\n   * commitTs. The server uses this to drive subscription invalidation for ALL\n   * mutation sources — client WS calls, actions, jobs, and the internal caller —\n   * so a server-side write pushes live updates just like a client write does.\n   * Non-server consumers (migration tooling, tests) leave it unset (no-op).\n   */\n  setOnAfterCommit(cb: (writeSet: WriteEntry[], commitTs: CommitTs) => void): void {\n    this.onAfterCommit = cb;\n  }\n\n  // ── Read-only query ──────────────────────────────────────────────\n\n  /**\n   * One-shot read against an EXPLICIT connection + snapshot ts (rather than this\n   * db's own latest). Used by the replica router: the caller pre-resolves the\n   * default read connection (replica for queries) and hands the handler a\n   * `DbReader` it can rebind via `useConnection` (ctx.usePrimaryConn/…). The\n   * returned `ts` is the FINAL bound connection's snapshot, so the cache entry is\n   * stamped with the ts actually read at.\n   */\n  async queryInternalOn<T>(\n    read: { impl: Database; beginTs: bigint },\n    fn: (ctx: DbReader) => Promise<T>,\n  ): Promise<LiveResult<T>> {\n    const ctx = new DbReader(read.impl, read.beginTs);\n    const data = await fn(ctx);\n    return { ts: ctx.beginTs, data, readSet: ctx.internalGetReadSet() };\n  }\n\n  async query<T>(fn: (ctx: DbReader) => Promise<T>): Promise<T> {\n    const beginTs = await this.impl.getLatestSnapshotTimestamp();\n    const ctx = new DbReader(this.impl, beginTs);\n    return await fn(ctx);\n  }\n\n  /**\n   * Compute a query once at the latest snapshot, returning the result together\n   * with the snapshot `ts` and the tracked `readSet`. This is a plain one-shot\n   * evaluation — it registers NO live subscription; the `readSet`/`ts` are\n   * returned purely so the caller (e.g. the one-shot query cache) can store\n   * freshness metadata. Use this for cached one-shot query calls (WS `call`,\n   * HTTP RPC). `liveQuery` is the same computation under the subscription path's\n   * name and simply delegates here.\n   */\n  async queryInternal<T>(fn: (ctx: DbReader) => Promise<T>): Promise<LiveResult<T>> {\n    const beginTs = await this.impl.getLatestSnapshotTimestamp();\n    const ctx = new DbReader(this.impl, beginTs);\n    const data = await fn(ctx);\n\n    return {\n      ts: beginTs,\n      data,\n      readSet: ctx.internalGetReadSet(),\n    };\n  }\n\n  async liveQuery<T>(fn: (ctx: DbReader) => Promise<T>): Promise<LiveResult<T>> {\n    return this.queryInternal(fn);\n  }\n\n  // ── Mutation ───────────────────────────────────────────────────────\n\n  async mutation<T>(\n    fn: (ctx: DbWriter) => Promise<T>,\n    retryPolicy: RetryPolicy = occRetryPolicy,\n  ): Promise<MutationResult<T>> {\n    return await retryPolicy.execute(async (p) => {\n      let db: TxDatabase | undefined;\n      try {\n        // Step1: Get latest snapshot timestamp as beginTs\n        const beginTs = await this.impl.getLatestSnapshotTimestamp() + 1n;\n\n        const ctx = new DbWriter(this.impl, beginTs);\n        const result = await fn(ctx);\n\n        const readSet = ctx.internalGetReadSet();\n        const writeSet = ctx.internalGetWriteSet();\n        const commitTsLazy = new LazyCommitTsParam(undefined);\n\n        // Step2: Capture prevData + expectedCommitTs per write. prevData\n        // is consumed by the invalidator (range subs need it to detect\n        // result-set transitions). expectedCommitTs becomes the CAS fence\n        // for the apply step — preferring prior find()-captured ts so\n        // read-then-update patterns get beginTs-level isolation.\n        await this.impl.attachPrevDataToWriteSet(writeSet, readSet);\n\n        // Step3: Prepare quieries before transaction\n        const queries = await this.impl.prepareCommitWrites(\n          readSet,\n          writeSet,\n          commitTsLazy,\n        );\n\n        // Step4: Starts new transaction\n        db = await getDbclientRetryPolicy.execute(() => this.impl.getTransactionClient());\n        await db.begin();\n\n        // Step5: Get commitTs from DB sequence (bigger than all previous)\n        const commitTs = await db.getNextTimestamp();\n        commitTsLazy.value = commitTs;\n\n        // Step6: Apply + validate. CAS UPDATE/DELETE catches concurrent\n        // peer touches on the write set; the readSet is validated either\n        // per-row (fast path, no range reads) or via commit-log scan\n        // (slow path, when range reads are present so phantoms still\n        // need detection).\n        const commitResult = await db.commitWrites(\n          beginTs,\n          queries,\n          commitTs,\n        );\n\n        if (!commitResult.success) {\n          throw new OccConflictError(\"Commit failed\", { commitResult });\n        }\n\n        await db.updateLatestSnapshotTimestamp(commitTs);\n        await db.commit();\n\n        // Notify after successful commit\n        this.onAfterCommit?.(writeSet, commitTs);\n\n        return { result, writeSet, commitTs };\n      } catch (err) {\n        await db?.rollback();\n        throw err;\n      } finally {\n        db?.release();\n      }\n    });\n  }\n}\n\nexport const sleep = (ms: number) => new Promise<void>((res) => setTimeout(res, ms));\n"],"mappings":";;;;;;;;;;;;;;;;AAiBA,SAAgB,WAAW,QAAsD;CAC/E,MAAM,QAAQ,OAAO,OAAO;CAC5B,MAAM,gBAAiB,OAAe;CACtC,MAAM,UAAkC,CAAC;CACzC,MAAM,QAAgC,CAAC;CACvC,MAAM,SAAgD,CAAC;CACvD,MAAM,eAAe,OAAO,eAAe,UAAU,CAAC;CAEtD,KAAK,MAAM,OAAO,OAAO,KAAK,KAAK,GAAG;EACpC,QAAQ,OAAO,gBAAgB,QAAQ;EACvC,MAAM,QAAQ,MAAM;EACpB,MAAM,YAAY,cAAc,KAAK;EACrC,IAAI,qBAAqBA,IAAE,WACzB,MAAM,OAAO;OACR,IAAI,qBAAqBA,IAAE,WAChC,MAAM,OAAO;OACR,IAAI,qBAAqBA,IAAE,YAChC,MAAM,OAAO;OACR,IAAI,qBAAqBA,IAAE,SAChC,MAAM,OAAO;OACR,IAAI,qBAAqBA,IAAE,UAChC,MAAM,OAAO;OAEb,MAAM,OAAO;EAEf,OAAO,OAAO,eAAe,aAAa,MAAM,SAAS;CAC3D;CAEA,OAAO;EACL,OAAO,OAAO;EACd,SAAS,OAAO;EAChB;EACA,gBAAgB,OAAO,YAAY,OAAO,QAAQ,OAAO,CAAC,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;EAClF;EACA;CACF;AACF;AAEA,IAAa,YAAb,MAAuB;CAIrB;CACA;CACA,UAAiC,CAAC;CAClC,WAAmC,CAAC;CACpC,yBAAqC,IAAI,IAAI;CAE7C,iBAA2B,QAAsD;EAC/E,MAAM,WAAW,KAAK,OAAO,IAAI,OAAO,KAAK;EAC7C,IAAI,UAAU,OAAO;EAErB,MAAM,QAAQ,WAAW,MAAM;EAC/B,KAAK,OAAO,IAAI,OAAO,OAAO,KAAK;EACnC,OAAO;CACT;CAEA,YAAY,IAAc,SAAiB;EACzC,KAAK,KAAK;EACV,KAAK,UAAU;CACjB;;;;;;;CAQA,cAAc,IAAc,SAAuB;EACjD,IAAI,KAAK,QAAQ,SAAS,KAAK,KAAK,SAAS,SAAS,GACpD,MAAM,IAAI,MACR,0GACF;EAEF,KAAK,KAAK;EACV,KAAK,UAAU;CACjB;CAEA,qBAAkC;EAAE,OAAO,KAAK;CAAS;CACzD,sBAAoC;EAAE,OAAO,KAAK;CAAU;;;;;;;CAQ5D,sBAAsB,eAA4B;EAChD,KAAK,QAAQ,KAAK,GAAG,cAAc,KAAK,OAAO,EAAC,GAAG,EAAC,EAAE,CAAC;CACzD;CAEA,iBAA2B,OAAe,IAAoC;EAC5E,OAAO,KAAK,SAAS,MAAK,MAAK,EAAE,UAAU,SAAS,EAAE,OAAO,EAAE;CACjE;CAEA,kBAA4B,OAAe,IAAoC;EAC7E,OAAO,KAAK,SAAS,MAAK,MAAK,EAAE,UAAU,SAAS,EAAE,OAAO,MAAM,EAAE,OAAO,QAAQ;CACtF;CAEA,gBAA0B,OAAc,UAAkB,OAAyB;EACjF,MAAM,QAAQ,MAAM,OAAO;EAC3B,IAAI,CAAC,OAAO,UAAU,UAAU,KAAA,KAAa,UAAU,MAAM,OAAO;EACpE,OAAO,MAAM,OAAO,KAAK;CAC3B;AACF;AAEA,IAAa,WAAb,cAA8B,UAAU;CACtC,MAAuD,QAA4B;EACjF,MAAM,QAAQ,KAAK,iBAAiB,MAAM;EAC1C,OAAO,IAAI,aAAgB,MAAM,KAAK;CACxC;AACF;AAEA,IAAa,WAAb,cAA8B,SAAS;CACrC,MAAM,OACJ,QACA,IACA,MACe;EACf,MAAM,QAAQ,KAAK,iBAAiB,MAAM;EAC1C,MAAM,aAAsC,EAAE,GAAG;EACjD,MAAM,QAAQ,OAAO,OAAO;EAE5B,KAAK,MAAM,OAAO,OAAO,KAAK,KAAK,GAAG;GACpC,IAAI,QAAQ,KAAK;GAEjB,IAAI,UAAU,KAAA,GAAW;IACvB,MAAM,QAAQ,MAAM;IACpB,IAAI,iBAAiBA,IAAE,YAAY;KACjC,MAAM,aAAa,MAAM,IAAI;KAC7B,QAAS,OAAO,eAAe,aAAa,WAAW,IAAI;KAE3D,IAAI,UAAU,KAAA,GAAW;MACvB,MAAM,aAAa,MAAM,QAAQ,QAAQ;MACzC,WAAW,cAAc,KAAK,gBAAgB,OAAO,KAAK,KAAK;KACjE;IACF;GACF,OAAO;IACL,MAAM,aAAa,MAAM,QAAQ,QAAQ;IACzC,WAAW,cAAc,KAAK,gBAAgB,OAAO,KAAK,KAAK;GACjE;EACF;EAEA,WAAW,QAAQ;EAGnB,MAAM,WAAW,KAAK,iBAAiB,OAAO,OAAO,EAAE;EACvD,IAAI,UACF,IAAI,SAAS,OAAO,UAAU;GAE5B,SAAS,KAAK;GACd,SAAS,OAAO;EAClB,OAEE,SAAS,OAAO;GAAE,GAAG,SAAS;GAAM,GAAG;EAAW;OAGpD,KAAK,SAAS,KAAK;GAAE,OAAO,OAAO;GAAO,SAAS,OAAO;GAAa;GAAI,IAAI;GAAU,MAAM;EAAW,CAAC;CAE/G;CAEA,MAAM,OACJ,QACA,IACA,MACe;EACf,MAAM,QAAQ,KAAK,iBAAiB,MAAM;EAC1C,MAAM,aAAsC,CAAC;EAE7C,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,IAAI,GAAG;GAC/C,MAAM,aAAa,MAAM,QAAQ,QAAQ;GACzC,WAAW,cAAc,KAAK,gBAAgB,OAAO,KAAK,KAAK;EACjE;EAEA,MAAM,WAAW,KAAK,iBAAiB,OAAO,OAAO,EAAE;EACvD,IAAI,UAAU;GACZ,SAAS,KAAK,SAAS,OAAO,WAAW,WAAW;GACpD,SAAS,OAAO;IAAE,GAAG,SAAS;IAAM,GAAG;GAAW;EACpD,OAEE,KAAK,SAAS,KAAK;GAAE,OAAO,OAAO;GAAO,SAAS,OAAO;GAAS;GAAI,IAAI;GAAU,MAAM;EAAW,CAAC;CAE3G;CAEA,MAAM,OACJ,QACA,IACe;EAEf,MAAM,iBAAiB,KAAK,kBAAkB,OAAO,OAAO,EAAE;EAC9D,IAAI,gBAAgB;GAClB,KAAK,WAAW,KAAK,SAAS,QAAO,MAAK,MAAM,cAAc;GAC9D;EACF;EAGA,KAAK,SAAS,KAAK;GAAE,OAAO,OAAO;GAAO,SAAS,OAAO;GAAS;GAAI,IAAI;EAAS,CAAC;CACvF;AACF;;;AChNA,MAAa,iBAAiB,MAC5B,YAAY,QAAQ,iBAAiB,mBAAmB,GAAG,CAAC,GAC5D;CACE,aAAa;CACb,SAAS,IAAI,mBAAmB;EAC9B,cAAc;EACd,UAAU;EACV,UAAU;CACZ,CAAC;AACH,CACF;AAEA,MAAa,yBAAyB,MACpC,YAAY,QAAQ,IAAI,QAAQ,SAAS,kBAAkB,CAAC,GAC5D;CACE,aAAa;CACb,SAAS,IAAI,mBAAmB;EAC9B,cAAc;EACd,UAAU;EACV,UAAU;CACZ,CAAC;AACH,CACF;AAEA,IAAa,aAAb,MAAa,WAAW;CAOD;CAAyB;;;;;;;CAA9C,YAAY,MAAyB,SAA+B;EAA/C,KAAA,OAAA;EAAyB,KAAA,UAAA;CAAwB;CAEtE,OAAO,OAAO,QAA0D;EACtE,OAAO,IAAI,WAAW,OAAO,IAAI,OAAO,UAAU,IAAI,WAAW,OAAO,OAAO,IAAI,KAAA,CAAS;CAC9F;;CAGA,IAAI,aAAsB;EACxB,OAAO,KAAK,YAAY,KAAA;CAC1B;CAEA;;;;;;;;;CAUA,iBAAiB,IAAgE;EAC/E,KAAK,gBAAgB;CACvB;;;;;;;;;CAYA,MAAM,gBACJ,MACA,IACwB;EACxB,MAAM,MAAM,IAAI,SAAS,KAAK,MAAM,KAAK,OAAO;EAChD,MAAM,OAAO,MAAM,GAAG,GAAG;EACzB,OAAO;GAAE,IAAI,IAAI;GAAS;GAAM,SAAS,IAAI,mBAAmB;EAAE;CACpE;CAEA,MAAM,MAAS,IAA+C;EAC5D,MAAM,UAAU,MAAM,KAAK,KAAK,2BAA2B;EAE3D,OAAO,MAAM,GAAG,IADA,SAAS,KAAK,MAAM,OAClB,CAAC;CACrB;;;;;;;;;;CAWA,MAAM,cAAiB,IAA2D;EAChF,MAAM,UAAU,MAAM,KAAK,KAAK,2BAA2B;EAC3D,MAAM,MAAM,IAAI,SAAS,KAAK,MAAM,OAAO;EAG3C,OAAO;GACL,IAAI;GACJ,MAAA,MAJiB,GAAG,GAAG;GAKvB,SAAS,IAAI,mBAAmB;EAClC;CACF;CAEA,MAAM,UAAa,IAA2D;EAC5E,OAAO,KAAK,cAAc,EAAE;CAC9B;CAIA,MAAM,SACJ,IACA,cAA2B,gBACC;EAC5B,OAAO,MAAM,YAAY,QAAQ,OAAO,MAAM;GAC5C,IAAI;GACJ,IAAI;IAEF,MAAM,UAAU,MAAM,KAAK,KAAK,2BAA2B,IAAI;IAE/D,MAAM,MAAM,IAAI,SAAS,KAAK,MAAM,OAAO;IAC3C,MAAM,SAAS,MAAM,GAAG,GAAG;IAE3B,MAAM,UAAU,IAAI,mBAAmB;IACvC,MAAM,WAAW,IAAI,oBAAoB;IACzC,MAAM,eAAe,IAAI,kBAAkB,KAAA,CAAS;IAOpD,MAAM,KAAK,KAAK,yBAAyB,UAAU,OAAO;IAG1D,MAAM,UAAU,MAAM,KAAK,KAAK,oBAC9B,SACA,UACA,YACF;IAGA,KAAK,MAAM,uBAAuB,cAAc,KAAK,KAAK,qBAAqB,CAAC;IAChF,MAAM,GAAG,MAAM;IAGf,MAAM,WAAW,MAAM,GAAG,iBAAiB;IAC3C,aAAa,QAAQ;IAOrB,MAAM,eAAe,MAAM,GAAG,aAC5B,SACA,SACA,QACF;IAEA,IAAI,CAAC,aAAa,SAChB,MAAM,IAAI,iBAAiB,iBAAiB,EAAE,aAAa,CAAC;IAG9D,MAAM,GAAG,8BAA8B,QAAQ;IAC/C,MAAM,GAAG,OAAO;IAGhB,KAAK,gBAAgB,UAAU,QAAQ;IAEvC,OAAO;KAAE;KAAQ;KAAU;IAAS;GACtC,SAAS,KAAK;IACZ,MAAM,IAAI,SAAS;IACnB,MAAM;GACR,UAAU;IACR,IAAI,QAAQ;GACd;EACF,CAAC;CACH;AACF;AAEA,MAAa,SAAS,OAAe,IAAI,SAAe,QAAQ,WAAW,KAAK,EAAE,CAAC"}