@rindle/client 0.1.0-rc.5

package/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/README.md

@@ -0,0 +1,65 @@
+# @rindle/client — backend-agnostic flat-change client core
+
+The shared core for the flat-change client: a **typed schema + query builder**, the
+**`ArrayView`** (folds a flat change stream into a live, materialized tree), the **comparator**,
+the **`Store`**, and the **`Backend`** seam. It talks to no engine directly — pair it with a
+backend such as [`@rindle/wasm`](../wasm) (local, in-process) or a remote (network) backend.
+
+## Schema + queries
+
+```ts
+import { table, string, number, boolean, json, createSchema, eq, gt, ilike, or, exists } from "@rindle/client";
+
+const issue = table("issue")
+  .columns({ id: number(), title: string(), priority: number(), meta: json<{ tags: string[] }>() })
+  .primaryKey("id");
+
+const schema = createSchema({ tables: [issue] }); // pass to `new Store(schema, backend)`
+```
+
+- **Operators** are named value-functions: `eq / ne / gt / ge / lt / le / like / ilike / inList / …`.
+- **`where`** is a typed proxy — `where.closed(false)`, `where.priority(gt(3))` — with camelCase
+  sugar `whereClosed(false)`. Multiple `where`s are AND-ed.
+- **`or` / `and` / `exists`** are plain top-level functions (no closure): conditions carry their
+  table type, e.g. `where(or(issue.priority(gt(8)), exists(comment, { parent: ["id"], child: ["issueID"] })))`.
+- **Nesting** is `sub(alias, childTable, correlation, build?)` — explicit correlation, inline child
+  table, no schema-declared relationships.
+- **Paging / single-row**: `orderBy(col, dir)`, `limit(n)`, `start(cursor, { exclusive })` (cursor
+  paging from a partial row over the sort columns), and `one()`.
+
+The result type flows through: `store.query.issue.sub("comments", …).materialize()` yields an
+`ArrayView` whose `.data` is typed `{ …issue, comments: Comment[] }[]`.
+
+A top-level **`.one()`** flips `materialize()` to a `SingularArrayView` whose `.data` is the single
+row or `null` (the engine caps the query to `limit 1`) — the unwrap is type-level too:
+
+```ts
+const view = store.query.issue.where.id(id).one().materialize();
+view.subscribe((row) => render(row)); // row: Issue | null, not Issue[]
+```
+
+## The Backend seam
+
+A `Backend` emits a per-query `ChangeEvent` stream (`hello` → `snapshot` → `batch`) and accepts
+mutations. The `Store` builds one `ArrayView` per query and routes events to it. The **same**
+`Store` / `ArrayView` / builder work behind a local (WASM) or remote (network) backend — only the
+backend differs.
+
+```ts
+const store = new Store(schema, backend);
+const view = store.query.issue.where.closed(false).materialize();
+view.subscribe(render);
+await store.write((tx) => tx.add("issue", { id: 1, title: "x", priority: 3, meta: { tags: [] } }));
+```
+
+## Reads
+
+`view.data` is the materialized tree, reference-stable: an update re-projects only what changed, so
+unchanged subtrees keep their object identity (React/Solid memoize on it). JSON columns are parsed
+to objects on read.
+
+## Build
+
+`pnpm run build` (from the repo root) compiles `src/` → `dist/` (`.js` + `.d.ts`) — what the package
+publishes. In-repo, tooling resolves the TS source directly via the `@rindle/source` export condition,
+so `pnpm test` runs without a build.

package/dist/ast.d.ts

@@ -0,0 +1,83 @@
+export type Dir = "asc" | "desc";
+/** One `(field, direction)` ordering — serializes as the 2-tuple `["id", "asc"]`. */
+export type OrderPart = [field: string, dir: Dir];
+/** An untagged literal (`null | bool | number | string | array`). Numbers are one f64. */
+export type LitValue = null | boolean | number | string | LitValue[];
+/** A column reference or a literal — `type`-tagged. */
+export type ValuePosition = {
+    type: "column";
+    name: string;
+} | {
+    type: "literal";
+    value: LitValue;
+};
+/** The wire comparison operators (exact strings, `src/ast.rs` `Op`). */
+export type SimpleOp = "=" | "!=" | "<" | "<=" | ">" | ">=" | "IS" | "IS NOT" | "LIKE" | "NOT LIKE" | "ILIKE" | "NOT ILIKE" | "IN" | "NOT IN";
+export type ExistsOp = "EXISTS" | "NOT EXISTS";
+/** The filter tree — `type`-tagged; recursive. There is no generic NOT node (negation is
+ *  via the negated operators and `NOT EXISTS`, matching `src/ast.rs` `Condition`). */
+export type Condition = {
+    type: "simple";
+    op: SimpleOp;
+    left: ValuePosition;
+    right: ValuePosition;
+} | {
+    type: "and";
+    conditions: Condition[];
+} | {
+    type: "or";
+    conditions: Condition[];
+} | {
+    type: "correlatedSubquery";
+    related: CorrelatedSubquery;
+    op: ExistsOp;
+    flip?: boolean;
+    scalar?: boolean;
+};
+export interface Correlation {
+    parentField: string[];
+    childField: string[];
+}
+/** A paging lower bound (`Bound`, `src/ast.rs`). `row` is a *partial* wire row — the bound
+ *  columns by name (only the sort columns are read by the engine's `Skip` comparator).
+ *  `exclusive` ⇒ start *after* the bound row (`Basis::After`); else *at* it (`Basis::At`). */
+export interface Bound {
+    row: Record<string, LitValue>;
+    exclusive: boolean;
+}
+export interface CorrelatedSubquery {
+    correlation: Correlation;
+    subquery: Ast;
+    system?: "client" | "permissions" | "test";
+}
+/** An aggregate over a (correlated) subquery's rows (`REDUCE-DESIGN.md`). v1: `count(*)`.
+ *  Set on a `related` subquery (`Ast.aggregate`), it marks that relationship a count
+ *  aggregate the builder lowers to a scalar-projected singular relationship (§9). */
+export type Aggregate = "count";
+/** The query AST. `table` is the only required field; the builder omits empty/false fields
+ *  (matching the Rust `skip_serializing_if`), which the deserializer treats as absent. */
+export interface Ast {
+    table: string;
+    alias?: string;
+    /** Projection (PROJECTION-SUPPORT-DESIGN.md §6). Absent ⇒ select all columns; present ⇒
+     *  project to just these (drives what syncs + what the view reports). Serializes only when
+     *  set, matching the Rust `Ast.select`'s `skip_serializing_if`. */
+    select?: string[];
+    where?: Condition;
+    related?: CorrelatedSubquery[];
+    start?: Bound;
+    limit?: number;
+    one?: boolean;
+    /** Aggregate this (sub)query's rows instead of materializing them (`REDUCE-DESIGN.md`
+     *  §9). `count` on a `related` subquery surfaces a scalar `commentCount` field; the
+     *  builder lowers it to a scalar-projected singular relationship. Absent ⇒ ordinary rows. */
+    aggregate?: Aggregate;
+    /** The {@link Ast.aggregate} value is **precomputed** — supplied as rows of a (synthetic)
+     *  source table rather than reduced from child rows. Set by the normalized client's AST
+     *  rewrite (`AGGREGATE-SYNC-DESIGN.md` §3.3) so the local engine reads the server's count
+     *  with a plain singular join + the same projection instead of a `reduce`. Only meaningful
+     *  with `aggregate`; absent ⇒ `false`. */
+    aggregatePrecomputed?: boolean;
+    orderBy?: OrderPart[];
+}
+//# sourceMappingURL=ast.d.ts.map

package/dist/ast.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ast.d.ts","sourceRoot":"","sources":["../src/ast.ts"],"names":[],"mappings":"AAIA,MAAM,MAAM,GAAG,GAAG,KAAK,GAAG,MAAM,CAAC;AAEjC,qFAAqF;AACrF,MAAM,MAAM,SAAS,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AAElD,0FAA0F;AAC1F,MAAM,MAAM,QAAQ,GAAG,IAAI,GAAG,OAAO,GAAG,MAAM,GAAG,MAAM,GAAG,QAAQ,EAAE,CAAC;AAErE,uDAAuD;AACvD,MAAM,MAAM,aAAa,GACrB;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GAChC;IAAE,IAAI,EAAE,SAAS,CAAC;IAAC,KAAK,EAAE,QAAQ,CAAA;CAAE,CAAC;AAEzC,wEAAwE;AACxE,MAAM,MAAM,QAAQ,GAChB,GAAG,GACH,IAAI,GACJ,GAAG,GACH,IAAI,GACJ,GAAG,GACH,IAAI,GACJ,IAAI,GACJ,QAAQ,GACR,MAAM,GACN,UAAU,GACV,OAAO,GACP,WAAW,GACX,IAAI,GACJ,QAAQ,CAAC;AAEb,MAAM,MAAM,QAAQ,GAAG,QAAQ,GAAG,YAAY,CAAC;AAE/C;sFACsF;AACtF,MAAM,MAAM,SAAS,GACjB;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,EAAE,EAAE,QAAQ,CAAC;IAAC,IAAI,EAAE,aAAa,CAAC;IAAC,KAAK,EAAE,aAAa,CAAA;CAAE,GAC3E;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,UAAU,EAAE,SAAS,EAAE,CAAA;CAAE,GACxC;IAAE,IAAI,EAAE,IAAI,CAAC;IAAC,UAAU,EAAE,SAAS,EAAE,CAAA;CAAE,GACvC;IAAE,IAAI,EAAE,oBAAoB,CAAC;IAAC,OAAO,EAAE,kBAAkB,CAAC;IAAC,EAAE,EAAE,QAAQ,CAAC;IAAC,IAAI,CAAC,EAAE,OAAO,CAAC;IAAC,MAAM,CAAC,EAAE,OAAO,CAAA;CAAE,CAAC;AAEhH,MAAM,WAAW,WAAW;IAC1B,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,UAAU,EAAE,MAAM,EAAE,CAAC;CACtB;AAED;;8FAE8F;AAC9F,MAAM,WAAW,KAAK;IACpB,GAAG,EAAE,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IAC9B,SAAS,EAAE,OAAO,CAAC;CACpB;AAED,MAAM,WAAW,kBAAkB;IACjC,WAAW,EAAE,WAAW,CAAC;IACzB,QAAQ,EAAE,GAAG,CAAC;IACd,MAAM,CAAC,EAAE,QAAQ,GAAG,aAAa,GAAG,MAAM,CAAC;CAC5C;AAED;;qFAEqF;AACrF,MAAM,MAAM,SAAS,GAAG,OAAO,CAAC;AAEhC;0FAC0F;AAC1F,MAAM,WAAW,GAAG;IAClB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE,MAAM,CAAC;IACf;;uEAEmE;IACnE,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC;IAClB,KAAK,CAAC,EAAE,SAAS,CAAC;IAClB,OAAO,CAAC,EAAE,kBAAkB,EAAE,CAAC;IAC/B,KAAK,CAAC,EAAE,KAAK,CAAC;IACd,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,GAAG,CAAC,EAAE,OAAO,CAAC;IACd;;iGAE6F;IAC7F,SAAS,CAAC,EAAE,SAAS,CAAC;IACtB;;;;8CAI0C;IAC1C,oBAAoB,CAAC,EAAE,OAAO,CAAC;IAC/B,OAAO,CAAC,EAAE,SAAS,EAAE,CAAC;CACvB"}

package/dist/ast.js

@@ -0,0 +1,5 @@
+// The Zero-wire query AST — the exact JSON shape the Rust `Ast` deserializes
+// (src/ast.rs). The builder emits these; the wasm `Db.query` (and a remote server) parse
+// them. camelCase keys, `type`-tagged unions, ops as SQL-ish strings, untagged literals.
+export {};
+//# sourceMappingURL=ast.js.map

package/dist/ast.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ast.js","sourceRoot":"","sources":["../src/ast.ts"],"names":[],"mappings":"AAAA,6EAA6E;AAC7E,yFAAyF;AACzF,yFAAyF"}

package/dist/compare.d.ts

@@ -0,0 +1,17 @@
+import type { WireValue } from "./types.ts";
+/** The `compare_values` / `compare_rows` algorithm-contract version (=== the engine's
+ *  `wire_schema::COMPARATOR_VERSION`). A remote subscriber hard-rejects a `hello` whose
+ *  `comparatorVersion` differs — the total order is a code contract, not data, so a schema
+ *  fingerprint can't cover it. Bump in lockstep with the Rust constant if the order changes. */
+export declare const COMPARATOR_VERSION = 1;
+/** number compare with `f64::total_cmp` semantics (NaN deterministic & last; -0 < +0). */
+export declare function compareNumber(a: number, b: number): -1 | 0 | 1;
+/** UTF-8 bytewise string compare (=== SQLite `BINARY` / Rust `&str` Ord). Correct for
+ *  supplementary-plane code points, where JS `<` / `localeCompare` (UTF-16) would disagree. */
+export declare function compareString(a: string, b: string): -1 | 0 | 1;
+/** Compare two bare cells, dispatching on the runtime type (null sorts first). */
+export declare function compareValue(a: WireValue, b: WireValue): -1 | 0 | 1;
+/** Compare two rows by a resolved sort (`[columnIndex, ascending]` pairs). First non-equal
+ *  column wins; a descending column negates. */
+export declare function compareRows(a: WireValue[], b: WireValue[], sort: [number, boolean][]): -1 | 0 | 1;
+//# sourceMappingURL=compare.d.ts.map

package/dist/compare.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"compare.d.ts","sourceRoot":"","sources":["../src/compare.ts"],"names":[],"mappings":"AAcA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAI5C;;;gGAGgG;AAChG,eAAO,MAAM,kBAAkB,IAAI,CAAC;AAepC,0FAA0F;AAC1F,wBAAgB,aAAa,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAI9D;AAED;+FAC+F;AAC/F,wBAAgB,aAAa,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAQ9D;AAED,kFAAkF;AAClF,wBAAgB,YAAY,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAiBnE;AAED;gDACgD;AAChD,wBAAgB,WAAW,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,IAAI,EAAE,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAMjG"}

package/dist/compare.js

@@ -0,0 +1,81 @@
+// The comparator — a faithful port of the engine's `compare_values` / `compare_rows`
+// (src/value.rs §4 of FLAT-CHANGES-DESIGN.md), the single most correctness-critical unit
+// (WASM-CLIENT-DESIGN.md §8.1). One fixed total order, NO collation.
+//
+// It is **value-driven** — it switches on the runtime JS type, exactly as the engine
+// switches on the `OwnedValue` variant. Bare wire values collapse Int/Float → number and
+// Str/Json → string, but within a sort column values are homogeneous, and number→total_cmp
+// / string→bytewise cover both, so this matches the engine without needing column types:
+//
+//   - null sorts FIRST (null < anything; null == null)
+//   - number:  IEEE-754 totalOrder (=== Rust `f64::total_cmp`) — NOT `<` / `-`
+//   - boolean: false < true
+//   - string:  UTF-8 BYTEWISE (=== SQLite BINARY / Rust `&str` Ord) — NOT `localeCompare`/`<`
+const enc = new TextEncoder();
+/** The `compare_values` / `compare_rows` algorithm-contract version (=== the engine's
+ *  `wire_schema::COMPARATOR_VERSION`). A remote subscriber hard-rejects a `hello` whose
+ *  `comparatorVersion` differs — the total order is a code contract, not data, so a schema
+ *  fingerprint can't cover it. Bump in lockstep with the Rust constant if the order changes. */
+export const COMPARATOR_VERSION = 1;
+const SIGN = 0x8000000000000000n;
+const ALL = 0xffffffffffffffffn;
+/** Map an f64 to an unsigned 64-bit key whose unsigned order is IEEE-754 totalOrder
+ *  (=== Rust `f64::total_cmp`): flip all bits for negatives (incl. -0 / -NaN), else set
+ *  the sign bit. */
+function orderedKey(x) {
+    const dv = new DataView(new ArrayBuffer(8));
+    dv.setFloat64(0, x);
+    const bits = dv.getBigUint64(0);
+    return bits & SIGN ? bits ^ ALL : bits | SIGN;
+}
+/** number compare with `f64::total_cmp` semantics (NaN deterministic & last; -0 < +0). */
+export function compareNumber(a, b) {
+    const ka = orderedKey(a);
+    const kb = orderedKey(b);
+    return ka < kb ? -1 : ka > kb ? 1 : 0;
+}
+/** UTF-8 bytewise string compare (=== SQLite `BINARY` / Rust `&str` Ord). Correct for
+ *  supplementary-plane code points, where JS `<` / `localeCompare` (UTF-16) would disagree. */
+export function compareString(a, b) {
+    const ba = enc.encode(a);
+    const bb = enc.encode(b);
+    const n = Math.min(ba.length, bb.length);
+    for (let i = 0; i < n; i++) {
+        if (ba[i] !== bb[i])
+            return ba[i] < bb[i] ? -1 : 1;
+    }
+    return ba.length === bb.length ? 0 : ba.length < bb.length ? -1 : 1;
+}
+/** Compare two bare cells, dispatching on the runtime type (null sorts first). */
+export function compareValue(a, b) {
+    const an = a === null || a === undefined;
+    const bn = b === null || b === undefined;
+    if (an && bn)
+        return 0;
+    if (an)
+        return -1;
+    if (bn)
+        return 1;
+    switch (typeof a) {
+        case "number":
+            return compareNumber(a, b);
+        case "boolean":
+            return a === b ? 0 : a ? 1 : -1;
+        case "string":
+            return compareString(a, b);
+        default:
+            // A parsed-JSON object in a sort column (rare): compare its text bytewise.
+            return compareString(JSON.stringify(a), JSON.stringify(b));
+    }
+}
+/** Compare two rows by a resolved sort (`[columnIndex, ascending]` pairs). First non-equal
+ *  column wins; a descending column negates. */
+export function compareRows(a, b, sort) {
+    for (const [col, asc] of sort) {
+        const c = compareValue(a[col], b[col]);
+        if (c !== 0)
+            return asc ? c : (-c);
+    }
+    return 0;
+}
+//# sourceMappingURL=compare.js.map

package/dist/compare.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"compare.js","sourceRoot":"","sources":["../src/compare.ts"],"names":[],"mappings":"AAAA,qFAAqF;AACrF,yFAAyF;AACzF,qEAAqE;AACrE,EAAE;AACF,qFAAqF;AACrF,yFAAyF;AACzF,2FAA2F;AAC3F,yFAAyF;AACzF,EAAE;AACF,uDAAuD;AACvD,+EAA+E;AAC/E,4BAA4B;AAC5B,8FAA8F;AAI9F,MAAM,GAAG,GAAG,IAAI,WAAW,EAAE,CAAC;AAE9B;;;gGAGgG;AAChG,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,CAAC;AAEpC,MAAM,IAAI,GAAG,mBAAmB,CAAC;AACjC,MAAM,GAAG,GAAG,mBAAmB,CAAC;AAEhC;;oBAEoB;AACpB,SAAS,UAAU,CAAC,CAAS;IAC3B,MAAM,EAAE,GAAG,IAAI,QAAQ,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5C,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,MAAM,IAAI,GAAG,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAChC,OAAO,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC;AAChD,CAAC;AAED,0FAA0F;AAC1F,MAAM,UAAU,aAAa,CAAC,CAAS,EAAE,CAAS;IAChD,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;IACzB,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;IACzB,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACxC,CAAC;AAED;+FAC+F;AAC/F,MAAM,UAAU,aAAa,CAAC,CAAS,EAAE,CAAS;IAChD,MAAM,EAAE,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACzB,MAAM,EAAE,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACzB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC;IACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAAE,OAAO,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,CAAC;IACD,OAAO,EAAE,CAAC,MAAM,KAAK,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACtE,CAAC;AAED,kFAAkF;AAClF,MAAM,UAAU,YAAY,CAAC,CAAY,EAAE,CAAY;IACrD,MAAM,EAAE,GAAG,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,SAAS,CAAC;IACzC,MAAM,EAAE,GAAG,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,SAAS,CAAC;IACzC,IAAI,EAAE,IAAI,EAAE;QAAE,OAAO,CAAC,CAAC;IACvB,IAAI,EAAE;QAAE,OAAO,CAAC,CAAC,CAAC;IAClB,IAAI,EAAE;QAAE,OAAO,CAAC,CAAC;IACjB,QAAQ,OAAO,CAAC,EAAE,CAAC;QACjB,KAAK,QAAQ;YACX,OAAO,aAAa,CAAC,CAAC,EAAE,CAAW,CAAC,CAAC;QACvC,KAAK,SAAS;YACZ,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,KAAK,QAAQ;YACX,OAAO,aAAa,CAAC,CAAC,EAAE,CAAW,CAAC,CAAC;QACvC;YACE,2EAA2E;YAC3E,OAAO,aAAa,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/D,CAAC;AACH,CAAC;AAED;gDACgD;AAChD,MAAM,UAAU,WAAW,CAAC,CAAc,EAAE,CAAc,EAAE,IAAyB;IACnF,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC;QAC9B,MAAM,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,CAAY,CAAC;IACjD,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,12 @@
+export * from "./schema.ts";
+export * from "./operators.ts";
+export * from "./query.ts";
+export * from "./view.ts";
+export * from "./store.ts";
+export * from "./ssr.ts";
+export { stableKey } from "./key.ts";
+export { COMPARATOR_VERSION, compareNumber, compareRows, compareString, compareValue } from "./compare.ts";
+export type { Backend, ChangeEvent, ColType, FlatChange, FlatOp, Mutation, MutationEnvelope, NormalizedEvent, NormalizedOp, NormalizedSource, NormalizedTableSchema, OptimisticSource, PathSeg, ProgressFrame, QueryId, RemoteQuery, ResultType, WireNode, WireProjection, WireRel, WireSchema, WireValue, } from "./types.ts";
+export { CLIENT_MUTATIONS_SCHEMA, CLIENT_MUTATIONS_TABLE, LMID_QUERY_NAME } from "./types.ts";
+export type { Aggregate, Ast, Bound, Condition, CorrelatedSubquery, Correlation, Dir, ExistsOp, LitValue, OrderPart, SimpleOp, ValuePosition, } from "./ast.ts";
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAIA,cAAc,aAAa,CAAC;AAC5B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,YAAY,CAAC;AAC3B,cAAc,WAAW,CAAC;AAC1B,cAAc,YAAY,CAAC;AAC3B,cAAc,UAAU,CAAC;AAEzB,OAAO,EAAE,SAAS,EAAE,MAAM,UAAU,CAAC;AAErC,OAAO,EAAE,kBAAkB,EAAE,aAAa,EAAE,WAAW,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAE3G,YAAY,EACV,OAAO,EACP,WAAW,EACX,OAAO,EACP,UAAU,EACV,MAAM,EACN,QAAQ,EACR,gBAAgB,EAChB,eAAe,EACf,YAAY,EACZ,gBAAgB,EAChB,qBAAqB,EACrB,gBAAgB,EAChB,OAAO,EACP,aAAa,EACb,OAAO,EACP,WAAW,EACX,UAAU,EACV,QAAQ,EACR,cAAc,EACd,OAAO,EACP,UAAU,EACV,SAAS,GACV,MAAM,YAAY,CAAC;AAEpB,OAAO,EAAE,uBAAuB,EAAE,sBAAsB,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAG9F,YAAY,EACV,SAAS,EACT,GAAG,EACH,KAAK,EACL,SAAS,EACT,kBAAkB,EAClB,WAAW,EACX,GAAG,EACH,QAAQ,EACR,QAAQ,EACR,SAAS,EACT,QAAQ,EACR,aAAa,GACd,MAAM,UAAU,CAAC"}

package/dist/index.js

@@ -0,0 +1,13 @@
+// @rindle/client — the backend-agnostic flat-change client core: typed schema, query builder,
+// comparator, Backend seam, and the ArrayView contract. (The ArrayView folding impl + the
+// Store/backend wiring land in later slices.)
+export * from "./schema.js"; // table/columns/primaryKey, createSchema, string/number/boolean/json, Col, RowOf, Row, TableDef, tableSpec, SCHEMA
+export * from "./operators.js"; // eq/ne/gt/ge/lt/le/like/notLike/ilike/notIlike/inList/notInList/is/isNot, and/or, Pred, Cond, Arg
+export * from "./query.js"; // Query, QueryRoot, queries/newQueryBuilder, defineQuery/NamedQuery, exists, notExists, defineFragment/Fragment/FragmentRef/isFragment
+export * from "./view.js"; // ArrayView, SingularArrayView, FlatArrayView, SingularView, ViewTypes
+export * from "./store.js"; // Store, WriteTx, AssembledNode, DehydratedQuery, DehydratedState
+export * from "./ssr.js"; // createServerStore, ServerStore, OneShotBackend, OneShotQueryFn, OneShotResult, ServerStoreOptions
+export { stableKey } from "./key.js"; // canonical viewKey for an AST (shared with @rindle/react)
+export { COMPARATOR_VERSION, compareNumber, compareRows, compareString, compareValue } from "./compare.js";
+export { CLIENT_MUTATIONS_SCHEMA, CLIENT_MUTATIONS_TABLE, LMID_QUERY_NAME } from "./types.js";
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,8FAA8F;AAC9F,0FAA0F;AAC1F,8CAA8C;AAE9C,cAAc,aAAa,CAAC,CAAC,mHAAmH;AAChJ,cAAc,gBAAgB,CAAC,CAAC,mGAAmG;AACnI,cAAc,YAAY,CAAC,CAAC,uIAAuI;AACnK,cAAc,WAAW,CAAC,CAAC,uEAAuE;AAClG,cAAc,YAAY,CAAC,CAAC,kEAAkE;AAC9F,cAAc,UAAU,CAAC,CAAC,oGAAoG;AAE9H,OAAO,EAAE,SAAS,EAAE,MAAM,UAAU,CAAC,CAAC,2DAA2D;AAEjG,OAAO,EAAE,kBAAkB,EAAE,aAAa,EAAE,WAAW,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AA2B3G,OAAO,EAAE,uBAAuB,EAAE,sBAAsB,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC"}

package/dist/key.d.ts

@@ -0,0 +1,2 @@
+export declare function stableKey(value: unknown, seen?: WeakSet<object>): string;
+//# sourceMappingURL=key.d.ts.map

package/dist/key.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"key.d.ts","sourceRoot":"","sources":["../src/key.ts"],"names":[],"mappings":"AAKA,wBAAgB,SAAS,CAAC,KAAK,EAAE,OAAO,EAAE,IAAI,kBAAwB,GAAG,MAAM,CAiB9E"}

package/dist/key.js

@@ -0,0 +1,26 @@
+// A stable, canonical JSON string for a query AST — the `viewKey` shared by the React cache
+// (one cached view per AST) and the SSR dehydrate/hydrate map (seed lookup by AST). Both sides
+// MUST agree byte-for-byte, so the one canonical serializer lives here. Object keys are sorted;
+// `undefined` is encoded distinctly (so `{a:undefined}` ≠ `{}`); cycles throw.
+export function stableKey(value, seen = new WeakSet()) {
+    if (value === undefined)
+        return '{"$undefined":true}';
+    if (value === null || typeof value !== "object")
+        return JSON.stringify(value);
+    if (seen.has(value))
+        throw new TypeError("Rindle query keys must be acyclic JSON values");
+    seen.add(value);
+    if (Array.isArray(value)) {
+        const out = `[${value.map((v) => stableKey(v, seen)).join(",")}]`;
+        seen.delete(value);
+        return out;
+    }
+    const obj = value;
+    const out = `{${Object.keys(obj)
+        .sort()
+        .map((k) => `${JSON.stringify(k)}:${stableKey(obj[k], seen)}`)
+        .join(",")}}`;
+    seen.delete(value);
+    return out;
+}
+//# sourceMappingURL=key.js.map

package/dist/key.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"key.js","sourceRoot":"","sources":["../src/key.ts"],"names":[],"mappings":"AAAA,4FAA4F;AAC5F,+FAA+F;AAC/F,gGAAgG;AAChG,+EAA+E;AAE/E,MAAM,UAAU,SAAS,CAAC,KAAc,EAAE,OAAO,IAAI,OAAO,EAAU;IACpE,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,qBAAqB,CAAC;IACtD,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IAC9E,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC;QAAE,MAAM,IAAI,SAAS,CAAC,+CAA+C,CAAC,CAAC;IAC1F,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAChB,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;QAClE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACnB,OAAO,GAAG,CAAC;IACb,CAAC;IACD,MAAM,GAAG,GAAG,KAAgC,CAAC;IAC7C,MAAM,GAAG,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC;SAC7B,IAAI,EAAE;SACN,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC;SAC7D,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;IAChB,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACnB,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/operators.d.ts

@@ -0,0 +1,39 @@
+import type { Condition, LitValue, SimpleOp } from "./ast.ts";
+declare const PRED: unique symbol;
+/** A value predicate (an operator applied to a value). `V` is a phantom for type-checking. */
+export interface Pred<V> {
+    readonly [PRED]: true;
+    readonly op: SimpleOp;
+    readonly value: LitValue;
+    readonly __v?: V;
+}
+export declare function isPred(x: unknown): x is Pred<unknown>;
+export declare const eq: <V>(v: V) => Pred<V>;
+export declare const ne: <V>(v: V) => Pred<V>;
+export declare const gt: <V extends number | string>(v: V) => Pred<V>;
+export declare const ge: <V extends number | string>(v: V) => Pred<V>;
+export declare const lt: <V extends number | string>(v: V) => Pred<V>;
+export declare const le: <V extends number | string>(v: V) => Pred<V>;
+export declare const like: (pattern: string) => Pred<string>;
+export declare const notLike: (pattern: string) => Pred<string>;
+export declare const ilike: (pattern: string) => Pred<string>;
+export declare const notIlike: (pattern: string) => Pred<string>;
+export declare const inList: <V>(values: V[]) => Pred<V>;
+export declare const notInList: <V>(values: V[]) => Pred<V>;
+export declare const is: <V>(v: V) => Pred<V>;
+export declare const isNot: <V>(v: V) => Pred<V>;
+/** A field argument: its typed predicate, or a bare value (bare = `eq` sugar). */
+export type Arg<V> = Pred<V> | V;
+/** A condition over row `R`. The runtime value is the wire {@link Condition}; `R` is a
+ *  phantom brand so a condition for one table can't be `.where()`d onto another. */
+export type Cond<R> = Condition & {
+    readonly __row?: R;
+};
+/** Build a `simple` condition from a field name + (predicate | bare value). */
+export declare function fieldCondition(field: string, arg: unknown): Condition;
+/** All children must hold. */
+export declare function and<R>(...conds: Cond<R>[]): Cond<R>;
+/** At least one child must hold. */
+export declare function or<R>(...conds: Cond<R>[]): Cond<R>;
+export {};
+//# sourceMappingURL=operators.d.ts.map

package/dist/operators.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"operators.d.ts","sourceRoot":"","sources":["../src/operators.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,UAAU,CAAC;AAE9D,QAAA,MAAM,IAAI,EAAE,OAAO,MAA8B,CAAC;AAElD,8FAA8F;AAC9F,MAAM,WAAW,IAAI,CAAC,CAAC;IACrB,QAAQ,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC;IACtB,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC;IACtB,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC;IACzB,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;CAClB;AAMD,wBAAgB,MAAM,CAAC,CAAC,EAAE,OAAO,GAAG,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,CAErD;AAED,eAAO,MAAM,EAAE,GAAI,CAAC,EAAE,GAAG,CAAC,KAAG,IAAI,CAAC,CAAC,CAA2B,CAAC;AAC/D,eAAO,MAAM,EAAE,GAAI,CAAC,EAAE,GAAG,CAAC,KAAG,IAAI,CAAC,CAAC,CAA4B,CAAC;AAChE,eAAO,MAAM,EAAE,GAAI,CAAC,SAAS,MAAM,GAAG,MAAM,EAAE,GAAG,CAAC,KAAG,IAAI,CAAC,CAAC,CAA2B,CAAC;AACvF,eAAO,MAAM,EAAE,GAAI,CAAC,SAAS,MAAM,GAAG,MAAM,EAAE,GAAG,CAAC,KAAG,IAAI,CAAC,CAAC,CAA4B,CAAC;AACxF,eAAO,MAAM,EAAE,GAAI,CAAC,SAAS,MAAM,GAAG,MAAM,EAAE,GAAG,CAAC,KAAG,IAAI,CAAC,CAAC,CAA2B,CAAC;AACvF,eAAO,MAAM,EAAE,GAAI,CAAC,SAAS,MAAM,GAAG,MAAM,EAAE,GAAG,CAAC,KAAG,IAAI,CAAC,CAAC,CAA4B,CAAC;AACxF,eAAO,MAAM,IAAI,GAAI,SAAS,MAAM,KAAG,IAAI,CAAC,MAAM,CAAwB,CAAC;AAC3E,eAAO,MAAM,OAAO,GAAI,SAAS,MAAM,KAAG,IAAI,CAAC,MAAM,CAA4B,CAAC;AAClF,eAAO,MAAM,KAAK,GAAI,SAAS,MAAM,KAAG,IAAI,CAAC,MAAM,CAAyB,CAAC;AAC7E,eAAO,MAAM,QAAQ,GAAI,SAAS,MAAM,KAAG,IAAI,CAAC,MAAM,CAA6B,CAAC;AACpF,eAAO,MAAM,MAAM,GAAI,CAAC,EAAE,QAAQ,CAAC,EAAE,KAAG,IAAI,CAAC,CAAC,CAAiC,CAAC;AAChF,eAAO,MAAM,SAAS,GAAI,CAAC,EAAE,QAAQ,CAAC,EAAE,KAAG,IAAI,CAAC,CAAC,CAAqC,CAAC;AACvF,eAAO,MAAM,EAAE,GAAI,CAAC,EAAE,GAAG,CAAC,KAAG,IAAI,CAAC,CAAC,CAA4B,CAAC;AAChE,eAAO,MAAM,KAAK,GAAI,CAAC,EAAE,GAAG,CAAC,KAAG,IAAI,CAAC,CAAC,CAAgC,CAAC;AAEvE,kFAAkF;AAClF,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AAEjC;oFACoF;AACpF,MAAM,MAAM,IAAI,CAAC,CAAC,IAAI,SAAS,GAAG;IAAE,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,CAAA;CAAE,CAAC;AAEzD,+EAA+E;AAC/E,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,OAAO,GAAG,SAAS,CASrE;AAED,8BAA8B;AAC9B,wBAAgB,GAAG,CAAC,CAAC,EAAE,GAAG,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAEnD;AAED,oCAAoC;AACpC,wBAAgB,EAAE,CAAC,CAAC,EAAE,GAAG,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAElD"}