@fougere/adapter-sql 0.2.0-alpha.2

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 Fougere contributors
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,18 @@
+# @fougere/adapter-sql
+> Entity → SQL tables, through Kysely
+The SQL realization of the schema: the tables, the additive migration and the
+per-entity scoped ORM. Four dialects — SQLite, PostgreSQL, MySQL, SQL Server.
+
+Validation judges, storage realizes: this ORM passes no judgment on what a handler
+hands it — it applies the `lifecycle` rules.
+
+## Installation
+```bash
+pnpm add @fougere/adapter-sql
+```
+
+---
+
+Part of [Fougere](https://github.com/chok/fougere) — one schema, a gradient from
+monolith to distributed, the same user code.
+Reference documentation: [the site](https://chok.github.io/fougere/) (en/fr).

package/dist/check.d.ts

@@ -0,0 +1,41 @@
+/**
+ * Shape → CHECK constraints.
+ *
+ * `oneOf`, `min`, `max` were declared on the field and read by the façade alone: a
+ * handler writing through the ORM put `status: 'brouillon'` in a column that declares
+ * two values, and nothing said a word. The rule was in the schema; no one held it on
+ * that path.
+ *
+ * So the storage learns what the shape already says. `validate` judges what a client
+ * proposes; this holds what anyone writes — including us.
+ *
+ * Only the keywords a database can decide alone. `pattern` and `format` are left to
+ * the façade: regex dialects diverge (POSIX here, PCRE there, nothing in SQLite
+ * without an extension), and a constraint that means something different per engine
+ * is worse than none.
+ *
+ * Every value is inlined with `sql.lit`, not bound: SQLite answers `parameters
+ * prohibited in CHECK constraints`, and a constraint is part of the schema rather
+ * than of a query. The values are the author's own literals — `oneOf('draft', …)`,
+ * `max: 160` — never anything a request carried, and Kysely escapes them.
+ */
+import { type Expression, type SqlBool } from 'kysely';
+import type { ColumnDef } from './table.js';
+/** What a column's shape can be checked for, beyond its type. */
+export interface ShapeBounds {
+    enum?: readonly (string | number)[];
+    minLength?: number;
+    maxLength?: number;
+    minimum?: number;
+    maximum?: number;
+}
+/**
+ * The CHECK expression for one column, or nothing when its shape bounds nothing.
+ *
+ * A nullable column passes when it holds `null`: `NOT NULL` is the axis that decides
+ * presence, and stacking the two would make `optional()` unwritable.
+ */
+export declare function checkFor(column: ColumnDef): Expression<SqlBool> | undefined;
+/** Read the bounds off a field's base shape — the keywords a database can decide. */
+export declare function boundsOf(shape: Record<string, unknown> | undefined): ShapeBounds | undefined;
+//# sourceMappingURL=check.d.ts.map

package/dist/check.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"check.d.ts","sourceRoot":"","sources":["../src/check.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,OAAO,EAAO,KAAK,UAAU,EAAE,KAAK,OAAO,EAAE,MAAM,QAAQ,CAAC;AAC5D,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAE5C,iEAAiE;AACjE,MAAM,WAAW,WAAW;IAC1B,IAAI,CAAC,EAAE,SAAS,CAAC,MAAM,GAAG,MAAM,CAAC,EAAE,CAAC;IACpC,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,MAAM,EAAE,SAAS,GAAG,UAAU,CAAC,OAAO,CAAC,GAAG,SAAS,CAuB3E;AAED,qFAAqF;AACrF,wBAAgB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,GAAG,WAAW,GAAG,SAAS,CAU5F"}

package/dist/check.js

@@ -0,0 +1,67 @@
+/**
+ * Shape → CHECK constraints.
+ *
+ * `oneOf`, `min`, `max` were declared on the field and read by the façade alone: a
+ * handler writing through the ORM put `status: 'brouillon'` in a column that declares
+ * two values, and nothing said a word. The rule was in the schema; no one held it on
+ * that path.
+ *
+ * So the storage learns what the shape already says. `validate` judges what a client
+ * proposes; this holds what anyone writes — including us.
+ *
+ * Only the keywords a database can decide alone. `pattern` and `format` are left to
+ * the façade: regex dialects diverge (POSIX here, PCRE there, nothing in SQLite
+ * without an extension), and a constraint that means something different per engine
+ * is worse than none.
+ *
+ * Every value is inlined with `sql.lit`, not bound: SQLite answers `parameters
+ * prohibited in CHECK constraints`, and a constraint is part of the schema rather
+ * than of a query. The values are the author's own literals — `oneOf('draft', …)`,
+ * `max: 160` — never anything a request carried, and Kysely escapes them.
+ */
+import { sql } from 'kysely';
+/**
+ * The CHECK expression for one column, or nothing when its shape bounds nothing.
+ *
+ * A nullable column passes when it holds `null`: `NOT NULL` is the axis that decides
+ * presence, and stacking the two would make `optional()` unwritable.
+ */
+export function checkFor(column) {
+    const bounds = column.bounds;
+    if (!bounds)
+        return undefined;
+    const col = sql.ref(column.name);
+    const terms = [];
+    if (bounds.enum?.length) {
+        terms.push(sql `${col} in (${sql.join(bounds.enum.map((v) => sql.lit(v)))})`);
+    }
+    // Length, not value: a text bound is about the string, and `maxLength` is already
+    // spent on the column type where the dialect uses it (varchar(n)) — stating it
+    // again costs nothing and holds where the type does not (text columns).
+    if (bounds.minLength !== undefined)
+        terms.push(sql `length(${col}) >= ${sql.lit(bounds.minLength)}`);
+    if (bounds.maxLength !== undefined)
+        terms.push(sql `length(${col}) <= ${sql.lit(bounds.maxLength)}`);
+    if (bounds.minimum !== undefined)
+        terms.push(sql `${col} >= ${sql.lit(bounds.minimum)}`);
+    if (bounds.maximum !== undefined)
+        terms.push(sql `${col} <= ${sql.lit(bounds.maximum)}`);
+    if (terms.length === 0)
+        return undefined;
+    const all = terms.reduce((left, right) => sql `${left} and ${right}`);
+    return column.nullable ? sql `${col} is null or (${all})` : all;
+}
+/** Read the bounds off a field's base shape — the keywords a database can decide. */
+export function boundsOf(shape) {
+    if (!shape)
+        return undefined;
+    const bounds = {};
+    if (Array.isArray(shape.enum) && shape.enum.length > 0)
+        bounds.enum = shape.enum;
+    for (const key of ['minLength', 'maxLength', 'minimum', 'maximum']) {
+        if (typeof shape[key] === 'number')
+            bounds[key] = shape[key];
+    }
+    return Object.keys(bounds).length > 0 ? bounds : undefined;
+}
+//# sourceMappingURL=check.js.map

package/dist/check.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"check.js","sourceRoot":"","sources":["../src/check.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,OAAO,EAAE,GAAG,EAAiC,MAAM,QAAQ,CAAC;AAY5D;;;;;GAKG;AACH,MAAM,UAAU,QAAQ,CAAC,MAAiB;IACxC,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;IAC7B,IAAI,CAAC,MAAM;QAAE,OAAO,SAAS,CAAC;IAE9B,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACjC,MAAM,KAAK,GAA0B,EAAE,CAAC;IAExC,IAAI,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC;QACxB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAS,GAAG,GAAG,QAAQ,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACxF,CAAC;IACD,kFAAkF;IAClF,+EAA+E;IAC/E,wEAAwE;IACxE,IAAI,MAAM,CAAC,SAAS,KAAK,SAAS;QAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAS,UAAU,GAAG,QAAQ,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;IAC7G,IAAI,MAAM,CAAC,SAAS,KAAK,SAAS;QAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAS,UAAU,GAAG,QAAQ,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;IAC7G,IAAI,MAAM,CAAC,OAAO,KAAK,SAAS;QAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAS,GAAG,GAAG,OAAO,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACjG,IAAI,MAAM,CAAC,OAAO,KAAK,SAAS;QAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAS,GAAG,GAAG,OAAO,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAEjG,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAEzC,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,CAAS,GAAG,IAAI,QAAQ,KAAK,EAAE,CAAC,CAAC;IAE9E,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAS,GAAG,GAAG,gBAAgB,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;AAC1E,CAAC;AAED,qFAAqF;AACrF,MAAM,UAAU,QAAQ,CAAC,KAA0C;IACjE,IAAI,CAAC,KAAK;QAAE,OAAO,SAAS,CAAC;IAE7B,MAAM,MAAM,GAAgB,EAAE,CAAC;IAC/B,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC;QAAE,MAAM,CAAC,IAAI,GAAG,KAAK,CAAC,IAAgB,CAAC;IAC7F,KAAK,MAAM,GAAG,IAAI,CAAC,WAAW,EAAE,WAAW,EAAE,SAAS,EAAE,SAAS,CAAU,EAAE,CAAC;QAC5E,IAAI,OAAO,KAAK,CAAC,GAAG,CAAC,KAAK,QAAQ;YAAE,MAAM,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAW,CAAC;IACzE,CAAC;IAED,OAAO,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;AAC7D,CAAC"}

package/dist/crud.d.ts

@@ -0,0 +1,153 @@
+/**
+ * SqlEntityOrm — per-entity ORM over Kysely, one implementation for every engine.
+ *
+ * Structurally matches @fougere/core's EntityOrm (duck typed, no dep). There is
+ * no generated table object: Kysely addresses tables and columns by name, so the
+ * entity stays the only description. The field↔column mapping is explicit rather
+ * than a global plugin — auth tables carry their own naming and must not be
+ * rewritten behind the caller's back.
+ *
+ * `create` and `update` re-read the row instead of using `RETURNING`: the
+ * contract is to hand back the COMPLETE row, including defaults realised by SQL.
+ * That also makes the code identical on MySQL and SQL Server, which have no
+ * `RETURNING` clause.
+ */
+import { type Kysely } from 'kysely';
+import { type SchemaView, type SchemaSource } from '@fougere/schema';
+import { type DialectName } from './dialect.js';
+/** ListOptions — duplicated from @fougere/core to avoid a runtime dep. */
+interface ListOptions {
+    limit?: number;
+    offset?: number;
+    page?: number;
+    after?: string;
+    orderBy?: string;
+    order?: 'asc' | 'desc';
+    count?: boolean;
+}
+interface ListResult<T> extends Array<T> {
+    total?: number;
+    endCursor?: string;
+    hasMore?: boolean;
+}
+interface SelectOption {
+    select?: SchemaView;
+}
+export declare class SqlEntityOrm {
+    private db;
+    private table;
+    private pk;
+    /** The axes `applyCreate`/`applyUpdate` read — held once, they are asked per write. */
+    private fields;
+    private selectFields?;
+    /** field → column and back; the entity names travel, the SQL names stay inside. */
+    private toColumn;
+    private toField;
+    /** field → the value pair a driver needs; only for the shapes a driver can't bind. */
+    private codecs;
+    /** How many keys one statement may carry here — see `Dialect.maxBindings`. */
+    private maxBindings;
+    /** How this engine spells an upsert, or `false` when it cannot — see `Dialect.upsert`. */
+    private upsertClause;
+    constructor(db: Kysely<any>, source: SchemaSource, tableName: string, selectFields?: Set<string>, dialect?: DialectName);
+    /** The Kysely instance this ORM wraps — no judge sits behind it. See EntityOrm.client. */
+    get client(): Kysely<any>;
+    /** Returns a scoped ORM that restricts all read results to the fields of the given schema. */
+    output(schema: SchemaView): SqlEntityOrm;
+    private resolveSelect;
+    private column;
+    /** The value a driver can bind — `true` becomes 1, a Date becomes its ISO string. */
+    private write;
+    /** Entity keys → column keys, and entity values → bindable values. */
+    private toRow;
+    /** Column keys → entity keys, and column values → the values the entity declares. */
+    private fromRow;
+    /**
+     * Apply a primary-key filter (simple or composite).
+     *
+     * The key crosses to the column exactly like every other value — `whereAll` states
+     * the rule two lines below and this did not follow it. It cost nothing while every
+     * generated key was a string; a key that holds a Date (`primary(created())`) inserted
+     * fine and then failed its own re-read, with the row already persisted.
+     */
+    private wherePk;
+    private whereAll;
+    list(options?: ListOptions & SelectOption & {
+        where?: Record<string, unknown>;
+    }): Promise<ListResult<Record<string, unknown>>>;
+    /**
+     * One query for N keys, never N queries — what every page-level read stands on:
+     * a computed field, a relation, a resolver on the other side of a wire.
+     *
+     * A composite key has no list form: it is refused by name rather than answering a
+     * partial result that reads as complete.
+     */
+    findByKeys(ids: readonly string[], options?: SelectOption): Promise<Map<string, Record<string, unknown>>>;
+    /**
+     * The other direction of a relation, in one query — see the port's `findAllByKeys`.
+     *
+     * The grouping key is read off the ROW rather than trusted from the request: a codec
+     * may write a value one way and read it back another, and a group keyed on the
+     * request's spelling would then be empty while the rows sit there.
+     */
+    findAllByKeys(field: string, keys: readonly string[], options?: SelectOption): Promise<Map<string, Record<string, unknown>[]>>;
+    /**
+     * Write the row, or make the existing one look like this — one statement.
+     *
+     * The gesture an import needs and the port did not have: `create` throws on the
+     * second run (`UNIQUE constraint failed`), so re-reading anything meant deleting
+     * first. Measured pulling 500 rows from an API twice.
+     *
+     * Both lifecycles are realized, each on the side it belongs to: `applyCreate` fills
+     * what a first write owes (a generated key, `created()`, a declared default) and
+     * `applyUpdate` stamps what every write owes (`updated()`). On conflict the key and
+     * the creation stamps are left alone — a row keeps the moment it appeared, whatever
+     * later overwrites say.
+     */
+    upsert(input: Record<string, unknown>, options?: SelectOption): Promise<Record<string, unknown>>;
+    /**
+     * Upsert a whole page in one statement — what an import writes through.
+     *
+     * Row by row, 500 rows were 500 statements (measured pulling an API); the shape of
+     * an import is a page, so the write should be one too. Sliced like every other batch,
+     * but by rows × COLUMNS: a statement binds values, not rows, so the ceiling divides.
+     *
+     * Answers how many rows were written and not the rows themselves. `create` hands back
+     * the complete row because a caller acts on it; an import acts on none of them, and
+     * re-reading a page to satisfy a symmetry nobody uses would double the work.
+     */
+    upsertAll(inputs: readonly Record<string, unknown>[], _options?: SelectOption): Promise<number>;
+    /**
+     * The COLUMNS a later write must not touch: the key, and a stamp that is create-only.
+     * One that is also `update: 'now'` is the opposite — it exists to move.
+     */
+    private frozenColumns;
+    findById(id: string | Record<string, unknown>, options?: SelectOption): Promise<Record<string, unknown> | undefined>;
+    findBy(criteria: Record<string, unknown>, options?: SelectOption): Promise<Record<string, unknown> | undefined>;
+    findAllBy(criteria: Record<string, unknown>, options?: SelectOption): Promise<Record<string, unknown>[]>;
+    /**
+     * One criteria object per statement — the oversized set is the one that splits.
+     *
+     * Only ONE criterion may be split: two split sets would need their cross product,
+     * which is a different query, so the second is refused rather than silently wrong.
+     */
+    private refuseOversized;
+    private splitCriteria;
+    create(input: Record<string, unknown>, options?: SelectOption): Promise<Record<string, unknown>>;
+    update(id: string | Record<string, unknown>, input: Record<string, unknown>, options?: SelectOption): Promise<Record<string, unknown>>;
+    delete(id: string | Record<string, unknown>): Promise<boolean>;
+}
+export interface OrmFactoryOptions {
+    /** Override table name resolution. Default: camelCase → snake_case + 's'. */
+    tableName?: (entityName: string) => string;
+}
+/**
+ * Create an OrmFactory backed by Kysely — same call shape on every engine.
+ *
+ * ```ts
+ * const app = await createApp({ createContainer, ormFactory: createOrmFactory(db) });
+ * ```
+ */
+export declare function createOrmFactory(db: Kysely<any>, options?: OrmFactoryOptions, dialect?: DialectName): (entity: SchemaSource, name: string) => SqlEntityOrm;
+export {};
+//# sourceMappingURL=crud.d.ts.map

package/dist/crud.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"crud.d.ts","sourceRoot":"","sources":["../src/crud.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AACH,OAAO,EAAO,KAAK,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAAmD,KAAK,UAAU,EAAE,KAAK,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAEtH,OAAO,EAAkB,KAAK,WAAW,EAAE,MAAM,cAAc,CAAC;AAGhE,0EAA0E;AAC1E,UAAU,WAAW;IACnB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,KAAK,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC;IACvB,KAAK,CAAC,EAAE,OAAO,CAAC;CACjB;AAED,UAAU,UAAU,CAAC,CAAC,CAAE,SAAQ,KAAK,CAAC,CAAC,CAAC;IACtC,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,OAAO,CAAC,EAAE,OAAO,CAAC;CACnB;AAED,UAAU,YAAY;IACpB,MAAM,CAAC,EAAE,UAAU,CAAC;CACrB;AAgDD,qBAAa,YAAY;IAkBrB,OAAO,CAAC,EAAE;IAjBZ,OAAO,CAAC,KAAK,CAAW;IACxB,OAAO,CAAC,EAAE,CAAiB;IAC3B,uFAAuF;IACvF,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,YAAY,CAAC,CAAc;IACnC,mFAAmF;IACnF,OAAO,CAAC,QAAQ,CAA6B;IAC7C,OAAO,CAAC,OAAO,CAA6B;IAC5C,sFAAsF;IACtF,OAAO,CAAC,MAAM,CAA0B;IAExC,8EAA8E;IAC9E,OAAO,CAAC,WAAW,CAAS;IAC5B,0FAA0F;IAC1F,OAAO,CAAC,YAAY,CAA6C;IAEjE,YACU,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,EACvB,MAAM,EAAE,YAAY,EACpB,SAAS,EAAE,MAAM,EACjB,YAAY,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,EAC1B,OAAO,GAAE,WAAsB,EAkBhC;IAED,0FAA0F;IAC1F,IAAI,MAAM,IAAI,MAAM,CAAC,GAAG,CAAC,CAExB;IAED,8FAA8F;IAC9F,MAAM,CAAC,MAAM,EAAE,UAAU,GAAG,YAAY,CAIvC;IAED,OAAO,CAAC,aAAa;IAKrB,OAAO,CAAC,MAAM;IAId,qFAAqF;IACrF,OAAO,CAAC,KAAK;IAIb,sEAAsE;IACtE,OAAO,CAAC,KAAK;IAMb,qFAAqF;IACrF,OAAO,CAAC,OAAO;IASf;;;;;;;OAOG;IACH,OAAO,CAAC,OAAO;IAiBf,OAAO,CAAC,QAAQ;IASV,IAAI,CAAC,OAAO,CAAC,EAAE,WAAW,GAAG,YAAY,GAAG;QAAE,KAAK,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;KAAE,GAAG,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,CA+DnI;IAED;;;;;;OAMG;IACG,UAAU,CAAC,GAAG,EAAE,SAAS,MAAM,EAAE,EAAE,OAAO,CAAC,EAAE,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,CAsB9G;IAED;;;;;;OAMG;IACG,aAAa,CACjB,KAAK,EAAE,MAAM,EACb,IAAI,EAAE,SAAS,MAAM,EAAE,EACvB,OAAO,CAAC,EAAE,YAAY,GACrB,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC,CAAC,CAUjD;IAED;;;;;;;;;;;;OAYG;IACG,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC,EAAE,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CA4BrG;IAED;;;;;;;;;;OAUG;IACG,SAAS,CAAC,MAAM,EAAE,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,CA4BpG;IAED;;;OAGG;IACH,OAAO,CAAC,aAAa;IASf,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC,EAAE,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,CAAC,CAMzH;IAEK,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC,EAAE,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,CAAC,CAQpH;IAEK,SAAS,CAAC,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC,EAAE,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC,CAa7G;IAED;;;;;OAKG;IACH,OAAO,CAAC,eAAe;IAWvB,OAAO,CAAC,aAAa;IAef,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC,EAAE,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAiBrG;IAEK,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC,EAAE,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAS3I;IAEK,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,CAKnE;CACF;AAGD,MAAM,WAAW,iBAAiB;IAChC,6EAA6E;IAC7E,SAAS,CAAC,EAAE,CAAC,UAAU,EAAE,MAAM,KAAK,MAAM,CAAC;CAC5C;AAED;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAAC,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,OAAO,CAAC,EAAE,iBAAiB,EAAE,OAAO,GAAE,WAAsB,YAE5F,YAAY,QAAQ,MAAM,kBAC3C"}