@ai-matrx/records 0.96.3 → 0.96.4

package/dist/memory/index.d.cts

@@ -1,5 +1,5 @@
 import { d as RecordsDataSource, a as RecordsConfig } from '../ports-DEkN-WfA.cjs';
-import { T as TemplateSpec } from '../types-BhGs3f8s.cjs';
+import { T as TemplateSpec } from '../types-KdeN9-5L.cjs';
 import { P as PgError } from '../record-zwSBU5PQ.cjs';
 import '../field-DjS7iId2.cjs';
 import '../subscription-ycCVo9e2.cjs';

package/dist/memory/index.d.ts

@@ -1,5 +1,5 @@
 import { d as RecordsDataSource, a as RecordsConfig } from '../ports-YOhD5T7h.js';
-import { T as TemplateSpec } from '../types-DAruHh1G.js';
+import { T as TemplateSpec } from '../types-qvGJwpw3.js';
 import { P as PgError } from '../record-zwSBU5PQ.js';
 import '../field-D-1OKy5r.js';
 import '../subscription-DucBLG-Y.js';

package/dist/memory/index.js

@@ -1840,11 +1840,28 @@ function compileInstallPlan(written) {
   const spec = tokenizeValues({ ...written, attachments: void 0 }, attachmentKeys);
   const bound = new Map(allTables(spec).filter((t) => t.bindsTo?.tableId).map((t) => [t.token, t.bindsTo]));
   const has = (token, key) => bound.get(token)?.fields.includes(key) ?? false;
+  const resolves = (target, v) => {
+    const b = bound.get(target);
+    return !b || !!b.seedRows || typeof v === "string" && !!b.rowIds?.[v];
+  };
   const tables = allTables(spec).map((t) => {
-    if (bound.has(t.token)) return { ...t, rows: [] };
-    const toBound = t.fields.filter((f) => f.parityType === "relation" && f.relationTarget && bound.has(f.relationTarget)).map((f) => f.key);
+    if (bound.has(t.token)) return bound.get(t.token).seedRows ? t : { ...t, rows: [] };
+    const toBound = t.fields.filter((f) => f.parityType === "relation" && f.relationTarget && bound.has(f.relationTarget));
     if (!toBound.length) return t;
-    return { ...t, rows: t.rows.map((r) => ({ ...r, values: Object.fromEntries(Object.entries(r.values ?? {}).filter(([k]) => !toBound.includes(k))) })) };
+    const lost = /* @__PURE__ */ new Set();
+    const rows = t.rows.map((r) => {
+      const values = { ...r.values ?? {} };
+      for (const f of toBound) {
+        const v = values[f.key];
+        if (v === null || v === void 0) continue;
+        const keep = Array.isArray(v) ? v.filter((x) => resolves(f.relationTarget, x)) : resolves(f.relationTarget, v) ? v : null;
+        if (Array.isArray(keep) ? keep.length < v.length : keep === null) lost.add(f.key);
+        if (keep === null || Array.isArray(keep) && !keep.length) delete values[f.key];
+        else values[f.key] = keep;
+      }
+      return { ...r, values };
+    });
+    return { ...t, rows, fields: t.fields.map((f) => lost.has(f.key) && f.required ? { ...f, required: false } : f) };
   });
   const steps = [];
   const tableRef = (token) => {
@@ -1920,6 +1937,7 @@ function compileInstallPlan(written) {
   }
   const rowIds = /* @__PURE__ */ new Map();
   for (const t of tables) for (const r of t.rows) rowIds.set(`${t.token}.${r.key}`, minted(`row.${t.token}.${r.key}`));
+  for (const [token, b] of bound) if (!b.seedRows) for (const [key, id] of Object.entries(b.rowIds ?? {})) rowIds.set(`${token}.${key}`, id);
   const deferred = deferredRelations(tables);
   for (const level of rowLevels(tables)) {
     for (const t of level) {