@rindle/normalized 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,23 @@
+# @rindle/normalized
+
+The **normalized local-first** client glue (`NORMALIZED-CHANGES-DESIGN.md` §5/§7) — the
+sibling of the flat remote client that runs its **own local DB** and queries over it (so it
+can do optimistic writes + local query resolution), with its base tables fed by a server
+stream instead of by direct user writes.
+
+This package's Slice 4 surface is **`NormalizedSync`**: the cross-query refcount + GC layer
+that sits between the per-query normalized streams (`NormalizedOp` batches, validated by
+`@rindle/remote`) and the one shared local store (the `@rindle/wasm` `Db`'s base tables).
+
+- The **server** already de-duplicates *intra-query* multi-path (NormalizeFold, §4.2).
+- `NormalizedSync` does the *cross-query* refcount the server deliberately does **not** —
+  keyed by `(table, pk)`, each query's footprint a membership set. A row shared by N queries
+  lands in the local `Db` **once** and is GC'd only when the last query stops referencing it.
+  No CVR — the refcount lives on the client, per row.
+
+It is pure logic: `applyBatch(queryId, ops)` / `rehydrate(queryId, snapshot)` /
+`dropQuery(queryId)` each return the NET `Mutation[]` to commit to the wasm `Db` in one
+transaction. The `Db` re-materializes and each query's `FlatArrayView` folds the result.
+
+The `NormalizedStore` wiring (remote normalized stream → `NormalizedSync` → wasm `Db`) lands
+in Slice 5.

package/dist/agg-table.d.ts

@@ -0,0 +1,19 @@
+import type { Ast, CorrelatedSubquery, NormalizedTableSchema } from "@rindle/client";
+/** The synthetic base-table name for a relationship `count` aggregate — the byte-exact twin
+ *  of Rust `agg_table_name` (`normalize.rs` §3.1). A content hash of the aggregate definition
+ *  (child table, kind, group key = correlation **child** fields, child `where`); the parent
+ *  correlation field is excluded. Same definition ⇒ same name (cross-query sharing); a
+ *  different filter ⇒ a different name (no `(table, pk)` collision). */
+export declare function aggTableName(csq: CorrelatedSubquery): string;
+/** Every synthetic aggregate table `ast` surfaces (recursively, a nested aggregate under a
+ *  materialized relationship included), as flat table schemas — the twin of Rust
+ *  `agg_table_schemas`. Columns `[childField…, "count"]`; PK = the leading group columns. */
+export declare function aggTableSchemas(ast: Ast): NormalizedTableSchema[];
+/** Rewrite an AST for the LOCAL engine: each relationship `count` becomes a precomputed,
+ *  source-backed singular relationship over its synthetic table — read the server's count
+ *  with a plain join + the same scalar projection (`aggregatePrecomputed`), never a `reduce`
+ *  (which would recount the already-aggregated rows). Non-aggregate relationships recurse
+ *  (a nested aggregate is rewritten too); the parent's frame is otherwise untouched, so the
+ *  view-schema slot order is preserved. Returns a new AST; the input is not mutated. */
+export declare function rewriteAggregates(ast: Ast): Ast;
+//# sourceMappingURL=agg-table.d.ts.map

package/dist/agg-table.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"agg-table.d.ts","sourceRoot":"","sources":["../src/agg-table.ts"],"names":[],"mappings":"AAaA,OAAO,KAAK,EAEV,GAAG,EAEH,kBAAkB,EAGlB,qBAAqB,EAEtB,MAAM,gBAAgB,CAAC;AAsCxB;;;;wEAIwE;AACxE,wBAAgB,YAAY,CAAC,GAAG,EAAE,kBAAkB,GAAG,MAAM,CAM5D;AA8FD;;6FAE6F;AAC7F,wBAAgB,eAAe,CAAC,GAAG,EAAE,GAAG,GAAG,qBAAqB,EAAE,CAIjE;AAiBD;;;;;wFAKwF;AACxF,wBAAgB,iBAAiB,CAAC,GAAG,EAAE,GAAG,GAAG,GAAG,CAG/C"}

package/dist/agg-table.js

@@ -0,0 +1,211 @@
+// Synthetic aggregate tables (AGGREGATE-SYNC-DESIGN.md §3.1/§3.3) — the client twin of
+// `rindle-replica/src/normalize.rs`. A relationship `count` is never recomputed locally
+// (the client lacks the child rows); the server ships the reduce's `(group_key, count)`
+// output as a SYNTHETIC base table, and the client:
+//   1. registers that table on its local engine + the `NormalizedSync` refcount layer,
+//   2. rewrites the local AST so the relationship reads the table with a plain singular
+//      join + the same scalar projection (`aggregatePrecomputed`) instead of a reduce.
+//
+// The table NAME is a content hash of the aggregate's definition, so client and server
+// agree without coordinating. `aggTableName` is the **byte-exact** twin of Rust
+// `agg_table_name` — the FNV-1a-64 byte protocol documented there; cross-language vectors
+// pin it (Rust `agg_table_name_cross_language_vector` ↔ this module's test).
+// FNV-1a-64, the same constants as `protocol.ts`'s `Fnv` (a local copy so `@rindle/normalized`
+// keeps no dependency on `@rindle/remote`). The byte methods mirror Rust `normalize::Fnv`.
+const FNV_OFFSET = 0xcbf29ce484222325n;
+const FNV_PRIME = 0x00000100000001b3n;
+const MASK = 0xffffffffffffffffn;
+const enc = new TextEncoder();
+class Fnv {
+    h = FNV_OFFSET;
+    byte(b) {
+        this.h = ((this.h ^ BigInt(b & 0xff)) * FNV_PRIME) & MASK;
+    }
+    /** A `u32` little-endian (Rust `v.to_le_bytes()`). */
+    u32(v) {
+        this.byte(v & 0xff);
+        this.byte((v >>> 8) & 0xff);
+        this.byte((v >>> 16) & 0xff);
+        this.byte((v >>> 24) & 0xff);
+    }
+    /** A length-prefixed string: `u32(byteLen)` then UTF-8 bytes. */
+    s(str) {
+        const bytes = enc.encode(str);
+        this.u32(bytes.length);
+        for (const b of bytes)
+            this.byte(b);
+    }
+    /** An `f64` little-endian (Rust `n.to_le_bytes()` — IEEE-754 binary64). */
+    f64(v) {
+        const buf = new ArrayBuffer(8);
+        new DataView(buf).setFloat64(0, v, true);
+        for (const b of new Uint8Array(buf))
+            this.byte(b);
+    }
+    hex() {
+        return this.h.toString(16).padStart(16, "0");
+    }
+}
+/** The synthetic base-table name for a relationship `count` aggregate — the byte-exact twin
+ *  of Rust `agg_table_name` (`normalize.rs` §3.1). A content hash of the aggregate definition
+ *  (child table, kind, group key = correlation **child** fields, child `where`); the parent
+ *  correlation field is excluded. Same definition ⇒ same name (cross-query sharing); a
+ *  different filter ⇒ a different name (no `(table, pk)` collision). */
+export function aggTableName(csq) {
+    const f = new Fnv();
+    f.u32(csq.correlation.childField.length);
+    for (const cf of csq.correlation.childField)
+        f.s(cf);
+    hashAggSubquery(f, csq.subquery);
+    return `__agg_${f.hex()}`;
+}
+function hashAggSubquery(f, ast) {
+    f.s(ast.table);
+    f.byte(ast.aggregate === "count" ? 1 : 0); // Some(Count)=1, None=0
+    if (ast.where === undefined)
+        f.byte(0);
+    else {
+        f.byte(1);
+        hashCondition(f, ast.where);
+    }
+    const related = ast.related ?? [];
+    f.u32(related.length);
+    for (const r of related) {
+        hashCorrelation(f, r.correlation);
+        hashAggSubquery(f, r.subquery);
+    }
+}
+function hashCorrelation(f, c) {
+    f.u32(c.parentField.length);
+    for (const p of c.parentField)
+        f.s(p);
+    f.u32(c.childField.length);
+    for (const x of c.childField)
+        f.s(x);
+}
+function hashCondition(f, cond) {
+    switch (cond.type) {
+        case "simple":
+            f.byte(0);
+            f.s(cond.op); // SimpleOp is the wire string ("=", "!=", …) === Rust `op_str`
+            hashValuePosition(f, cond.left);
+            hashValuePosition(f, cond.right);
+            break;
+        case "and":
+            f.byte(1);
+            f.u32(cond.conditions.length);
+            for (const c of cond.conditions)
+                hashCondition(f, c);
+            break;
+        case "or":
+            f.byte(2);
+            f.u32(cond.conditions.length);
+            for (const c of cond.conditions)
+                hashCondition(f, c);
+            break;
+        case "correlatedSubquery":
+            f.byte(3);
+            f.byte(cond.op === "EXISTS" ? 1 : 0); // Exists=1, NotExists=0
+            f.byte(systemByte(cond.related.system));
+            hashCorrelation(f, cond.related.correlation);
+            hashAggSubquery(f, cond.related.subquery);
+            break;
+    }
+}
+function systemByte(sys) {
+    switch (sys) {
+        case "permissions":
+            return 1; // System::Permissions
+        case "client":
+            return 2; // System::Client
+        case "test":
+            return 3; // System::Test
+        default:
+            return 0; // None
+    }
+}
+function hashValuePosition(f, vp) {
+    if (vp.type === "column") {
+        f.byte(0);
+        f.s(vp.name);
+    }
+    else {
+        f.byte(1);
+        hashLit(f, vp.value);
+    }
+}
+function hashLit(f, lit) {
+    if (lit === null)
+        f.byte(0);
+    else if (typeof lit === "boolean") {
+        f.byte(1);
+        f.byte(lit ? 1 : 0);
+    }
+    else if (typeof lit === "number") {
+        f.byte(2);
+        f.f64(lit);
+    }
+    else if (typeof lit === "string") {
+        f.byte(3);
+        f.s(lit);
+    }
+    else {
+        f.byte(4);
+        f.u32(lit.length);
+        for (const x of lit)
+            hashLit(f, x);
+    }
+}
+/** Every synthetic aggregate table `ast` surfaces (recursively, a nested aggregate under a
+ *  materialized relationship included), as flat table schemas — the twin of Rust
+ *  `agg_table_schemas`. Columns `[childField…, "count"]`; PK = the leading group columns. */
+export function aggTableSchemas(ast) {
+    const out = [];
+    collectAggTables(ast, out);
+    return out;
+}
+function collectAggTables(ast, out) {
+    for (const r of ast.related ?? []) {
+        if (r.subquery.aggregate) {
+            const k = r.correlation.childField.length;
+            out.push({
+                name: aggTableName(r),
+                columns: [...r.correlation.childField, "count"],
+                primaryKey: Array.from({ length: k }, (_, i) => i),
+            });
+        }
+        else {
+            collectAggTables(r.subquery, out);
+        }
+    }
+}
+/** Rewrite an AST for the LOCAL engine: each relationship `count` becomes a precomputed,
+ *  source-backed singular relationship over its synthetic table — read the server's count
+ *  with a plain join + the same scalar projection (`aggregatePrecomputed`), never a `reduce`
+ *  (which would recount the already-aggregated rows). Non-aggregate relationships recurse
+ *  (a nested aggregate is rewritten too); the parent's frame is otherwise untouched, so the
+ *  view-schema slot order is preserved. Returns a new AST; the input is not mutated. */
+export function rewriteAggregates(ast) {
+    if (!ast.related?.length)
+        return ast;
+    return { ...ast, related: ast.related.map(rewriteRelationship) };
+}
+function rewriteRelationship(csq) {
+    if (csq.subquery.aggregate) {
+        const subquery = {
+            table: aggTableName(csq),
+            aggregate: csq.subquery.aggregate,
+            aggregatePrecomputed: true,
+        };
+        // The correlation is unchanged: the synthetic table's group columns are named after the
+        // child correlation fields, so `childField` still resolves against `[childField…, count]`.
+        if (csq.subquery.alias !== undefined)
+            subquery.alias = csq.subquery.alias;
+        const out = { correlation: csq.correlation, subquery };
+        if (csq.system !== undefined)
+            out.system = csq.system;
+        return out;
+    }
+    return { ...csq, subquery: rewriteAggregates(csq.subquery) };
+}
+//# sourceMappingURL=agg-table.js.map

package/dist/agg-table.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"agg-table.js","sourceRoot":"","sources":["../src/agg-table.ts"],"names":[],"mappings":"AAAA,uFAAuF;AACvF,wFAAwF;AACxF,wFAAwF;AACxF,oDAAoD;AACpD,uFAAuF;AACvF,wFAAwF;AACxF,uFAAuF;AACvF,EAAE;AACF,uFAAuF;AACvF,gFAAgF;AAChF,0FAA0F;AAC1F,6EAA6E;AAa7E,+FAA+F;AAC/F,2FAA2F;AAC3F,MAAM,UAAU,GAAG,mBAAmB,CAAC;AACvC,MAAM,SAAS,GAAG,mBAAmB,CAAC;AACtC,MAAM,IAAI,GAAG,mBAAmB,CAAC;AACjC,MAAM,GAAG,GAAG,IAAI,WAAW,EAAE,CAAC;AAE9B,MAAM,GAAG;IACP,CAAC,GAAG,UAAU,CAAC;IACf,IAAI,CAAC,CAAS;QACZ,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC;IAC5D,CAAC;IACD,sDAAsD;IACtD,GAAG,CAAC,CAAS;QACX,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;QACpB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;QAC5B,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;QAC7B,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;IAC/B,CAAC;IACD,iEAAiE;IACjE,CAAC,CAAC,GAAW;QACX,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACvB,KAAK,MAAM,CAAC,IAAI,KAAK;YAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC;IACD,2EAA2E;IAC3E,GAAG,CAAC,CAAS;QACX,MAAM,GAAG,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QACzC,KAAK,MAAM,CAAC,IAAI,IAAI,UAAU,CAAC,GAAG,CAAC;YAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpD,CAAC;IACD,GAAG;QACD,OAAO,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;IAC/C,CAAC;CACF;AAED;;;;wEAIwE;AACxE,MAAM,UAAU,YAAY,CAAC,GAAuB;IAClD,MAAM,CAAC,GAAG,IAAI,GAAG,EAAE,CAAC;IACpB,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IACzC,KAAK,MAAM,EAAE,IAAI,GAAG,CAAC,WAAW,CAAC,UAAU;QAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACrD,eAAe,CAAC,CAAC,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC;IACjC,OAAO,SAAS,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC;AAC5B,CAAC;AAED,SAAS,eAAe,CAAC,CAAM,EAAE,GAAQ;IACvC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACf,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,wBAAwB;IACnE,IAAI,GAAG,CAAC,KAAK,KAAK,SAAS;QAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;SAClC,CAAC;QACJ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACV,aAAa,CAAC,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;IAC9B,CAAC;IACD,MAAM,OAAO,GAAG,GAAG,CAAC,OAAO,IAAI,EAAE,CAAC;IAClC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACtB,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC;QAClC,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC;IACjC,CAAC;AACH,CAAC;AAED,SAAS,eAAe,CAAC,CAAM,EAAE,CAAc;IAC7C,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;IAC5B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,WAAW;QAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IAC3B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,UAAU;QAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACvC,CAAC;AAED,SAAS,aAAa,CAAC,CAAM,EAAE,IAAe;IAC5C,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,QAAQ;YACX,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACV,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,+DAA+D;YAC7E,iBAAiB,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;YAChC,iBAAiB,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;YACjC,MAAM;QACR,KAAK,KAAK;YACR,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACV,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;YAC9B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,UAAU;gBAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACrD,MAAM;QACR,KAAK,IAAI;YACP,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACV,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;YAC9B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,UAAU;gBAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACrD,MAAM;QACR,KAAK,oBAAoB;YACvB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACV,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,wBAAwB;YAC9D,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;YACxC,eAAe,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;YAC7C,eAAe,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;YAC1C,MAAM;IACV,CAAC;AACH,CAAC;AAED,SAAS,UAAU,CAAC,GAAiC;IACnD,QAAQ,GAAG,EAAE,CAAC;QACZ,KAAK,aAAa;YAChB,OAAO,CAAC,CAAC,CAAC,sBAAsB;QAClC,KAAK,QAAQ;YACX,OAAO,CAAC,CAAC,CAAC,iBAAiB;QAC7B,KAAK,MAAM;YACT,OAAO,CAAC,CAAC,CAAC,eAAe;QAC3B;YACE,OAAO,CAAC,CAAC,CAAC,OAAO;IACrB,CAAC;AACH,CAAC;AAED,SAAS,iBAAiB,CAAC,CAAM,EAAE,EAAiB;IAClD,IAAI,EAAE,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QACzB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACV,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;IACf,CAAC;SAAM,CAAC;QACN,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACV,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;IACvB,CAAC;AACH,CAAC;AAED,SAAS,OAAO,CAAC,CAAM,EAAE,GAAa;IACpC,IAAI,GAAG,KAAK,IAAI;QAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;SACvB,IAAI,OAAO,GAAG,KAAK,SAAS,EAAE,CAAC;QAClC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACV,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;SAAM,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,CAAC;QACnC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACV,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACb,CAAC;SAAM,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,CAAC;QACnC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACV,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACX,CAAC;SAAM,CAAC;QACN,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACV,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAClB,KAAK,MAAM,CAAC,IAAI,GAAG;YAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACrC,CAAC;AACH,CAAC;AAED;;6FAE6F;AAC7F,MAAM,UAAU,eAAe,CAAC,GAAQ;IACtC,MAAM,GAAG,GAA4B,EAAE,CAAC;IACxC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IAC3B,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,gBAAgB,CAAC,GAAQ,EAAE,GAA4B;IAC9D,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,OAAO,IAAI,EAAE,EAAE,CAAC;QAClC,IAAI,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC;YACzB,MAAM,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,CAAC;YAC1C,GAAG,CAAC,IAAI,CAAC;gBACP,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC;gBACrB,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,UAAU,EAAE,OAAO,CAAC;gBAC/C,UAAU,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;aACnD,CAAC,CAAC;QACL,CAAC;aAAM,CAAC;YACN,gBAAgB,CAAC,CAAC,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;wFAKwF;AACxF,MAAM,UAAU,iBAAiB,CAAC,GAAQ;IACxC,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM;QAAE,OAAO,GAAG,CAAC;IACrC,OAAO,EAAE,GAAG,GAAG,EAAE,OAAO,EAAE,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,mBAAmB,CAAC,EAAE,CAAC;AACnE,CAAC;AAED,SAAS,mBAAmB,CAAC,GAAuB;IAClD,IAAI,GAAG,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC;QAC3B,MAAM,QAAQ,GAAQ;YACpB,KAAK,EAAE,YAAY,CAAC,GAAG,CAAC;YACxB,SAAS,EAAE,GAAG,CAAC,QAAQ,CAAC,SAAsB;YAC9C,oBAAoB,EAAE,IAAI;SAC3B,CAAC;QACF,wFAAwF;QACxF,2FAA2F;QAC3F,IAAI,GAAG,CAAC,QAAQ,CAAC,KAAK,KAAK,SAAS;YAAE,QAAQ,CAAC,KAAK,GAAG,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC;QAC1E,MAAM,GAAG,GAAuB,EAAE,WAAW,EAAE,GAAG,CAAC,WAAW,EAAE,QAAQ,EAAE,CAAC;QAC3E,IAAI,GAAG,CAAC,MAAM,KAAK,SAAS;YAAE,GAAG,CAAC,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC;QACtD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,OAAO,EAAE,GAAG,GAAG,EAAE,QAAQ,EAAE,iBAAiB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;AAC/D,CAAC"}

package/dist/backend.d.ts

@@ -0,0 +1,53 @@
+import { Store } from "@rindle/client";
+import type { Ast, Backend, ChangeEvent, ColsMap, Mutation, NormalizedSource, QueryId, RemoteQuery, Schema } from "@rindle/client";
+export type { NormalizedEvent, NormalizedSource, NormalizedTableSchema } from "@rindle/client";
+export declare class NormalizedBackend<S extends ColsMap> implements Backend {
+    private readonly local;
+    private readonly sync;
+    private readonly source;
+    private handler;
+    private readonly remoteSubs;
+    private readonly localToRemote;
+    /** The client's OWN typed per-table schemas (for CRIT#4 validation), fixed at construction. */
+    private readonly clientTables;
+    /** Synthetic aggregate tables (`__agg_*`) registered so far, by name (§3.3). Per aggregate
+     *  DEFINITION (not per query), so two queries over the same count share one table. */
+    private readonly synthetic;
+    /** table → (column name → base ColId), for mapping a projected hello to base positions. */
+    private readonly colIndex;
+    /** table → full column count, to detect whether a hello's table is projected. */
+    private readonly colCounts;
+    /** Synthetic table name → how many registered queries reference it. Materialized on `0→1`,
+     *  reclaimed (engine source + refcount layer) on `1→0` — so aggregate state is not permanent (§4). */
+    private readonly syntheticRefs;
+    /** queryId → the synthetic tables it referenced at registration, to decrement on teardown. */
+    private readonly queryAggTables;
+    constructor(schema: Schema<S>, source: NormalizedSource);
+    registerQuery(qid: QueryId, ast: Ast, remote?: RemoteQuery): void;
+    /** Register every synthetic aggregate table `ast` needs that we haven't seen yet: on the
+     *  local engine (so it can join to it), on `NormalizedSync` (so its rows refcount/GC by
+     *  group key), and into the source's expected-schema set (so the server's `hello` — which
+     *  advertises the same table — passes CRIT#4 validation, the client deriving the schema
+     *  identically). Idempotent across queries that share an aggregate definition. */
+    private ensureSyntheticTables;
+    /** Decrement each synthetic table query `qid` referenced; remove the ones that reach 0 (no
+     *  reader left) from the engine + refcount layer — aggregate state reclaimed, not permanent
+     *  (§4). Runs AFTER `local.unregisterQuery(qid)` so the source has no live connection when
+     *  `unregisterTable` frees it. */
+    private releaseSyntheticTables;
+    unregisterQuery(qid: QueryId): void;
+    retainRemoteQuery(qid: QueryId, remote: RemoteQuery): void;
+    releaseRemoteQuery(qid: QueryId): void;
+    /** Writes are authoritative-only here: send to the server, the stream reconciles locally.
+     *  (Optimistic local apply + rebase is Slice 6.) */
+    mutate(mutations: Mutation[]): Promise<void>;
+    onEvent(handler: (qid: QueryId, ev: ChangeEvent) => void): void;
+    private onNormalized;
+    private retainRemote;
+    private releaseRemote;
+}
+/** A local-first {@link Store} whose base tables are fed by a server's normalized stream.
+ *  The returned Store is the ordinary `@rindle/client` Store — `store.query…materialize()` and
+ *  `store.write(…)` work as always; only the backend composition differs. */
+export declare function createNormalizedStore<S extends ColsMap>(schema: Schema<S>, source: NormalizedSource): Store<S>;
+//# sourceMappingURL=backend.d.ts.map

package/dist/backend.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"backend.d.ts","sourceRoot":"","sources":["../src/backend.ts"],"names":[],"mappings":"AAoBA,OAAO,EAA0B,KAAK,EAAa,MAAM,gBAAgB,CAAC;AAC1E,OAAO,KAAK,EACV,GAAG,EACH,OAAO,EACP,WAAW,EACX,OAAO,EACP,QAAQ,EAER,gBAAgB,EAEhB,OAAO,EACP,WAAW,EACX,MAAM,EACP,MAAM,gBAAgB,CAAC;AASxB,YAAY,EAAE,eAAe,EAAE,gBAAgB,EAAE,qBAAqB,EAAE,MAAM,gBAAgB,CAAC;AA2B/F,qBAAa,iBAAiB,CAAC,CAAC,SAAS,OAAO,CAAE,YAAW,OAAO;IAClE,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAiB;IACvC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAiB;IACtC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAmB;IAC1C,OAAO,CAAC,OAAO,CAAqD;IACpE,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAgC;IAC3D,OAAO,CAAC,QAAQ,CAAC,aAAa,CAA8B;IAC5D,+FAA+F;IAC/F,OAAO,CAAC,QAAQ,CAAC,YAAY,CAA0B;IACvD;0FACsF;IACtF,OAAO,CAAC,QAAQ,CAAC,SAAS,CAA4C;IACtE,2FAA2F;IAC3F,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAsC;IAC/D,iFAAiF;IACjF,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAY;IACtC;0GACsG;IACtG,OAAO,CAAC,QAAQ,CAAC,aAAa,CAA6B;IAC3D,8FAA8F;IAC9F,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAgC;gBAEnD,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,gBAAgB;IAevD,aAAa,CAAC,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,MAAM,CAAC,EAAE,WAAW,GAAG,IAAI;IAWjE;;;;sFAIkF;IAClF,OAAO,CAAC,qBAAqB;IAkB7B;;;sCAGkC;IAClC,OAAO,CAAC,sBAAsB;IAoB9B,eAAe,CAAC,GAAG,EAAE,OAAO,GAAG,IAAI;IAanC,iBAAiB,CAAC,GAAG,EAAE,OAAO,EAAE,MAAM,EAAE,WAAW,GAAG,IAAI;IAI1D,kBAAkB,CAAC,GAAG,EAAE,OAAO,GAAG,IAAI;IAOtC;wDACoD;IACpD,MAAM,CAAC,SAAS,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAI5C,OAAO,CAAC,OAAO,EAAE,CAAC,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE,WAAW,KAAK,IAAI,GAAG,IAAI;IAI/D,OAAO,CAAC,YAAY;IAgCpB,OAAO,CAAC,YAAY;IAYpB,OAAO,CAAC,aAAa;CAYtB;AAsBD;;6EAE6E;AAC7E,wBAAgB,qBAAqB,CAAC,CAAC,SAAS,OAAO,EACrD,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,EACjB,MAAM,EAAE,gBAAgB,GACvB,KAAK,CAAC,CAAC,CAAC,CAEV"}