@absolutejs/sync 0.0.1 → 0.1.0

package/dist/adapters/prisma/index.js

@@ -0,0 +1,231 @@
+// @bun
+// src/adapters/prisma/topics.ts
+var tableTopic = (model) => model;
+var keyTopic = (model, key) => `${model}:${key}`;
+var isRowKey = (value) => typeof value === "string" || typeof value === "number" || typeof value === "bigint";
+var extractKeyFromWhere = (where, keyField) => {
+  const fields = Object.keys(where);
+  if (fields.length !== 1 || fields[0] !== keyField) {
+    return;
+  }
+  const condition = where[keyField];
+  if (isRowKey(condition)) {
+    return condition;
+  }
+  if (condition !== null && typeof condition === "object" && !Array.isArray(condition)) {
+    const operators = Object.keys(condition);
+    if (operators.length === 1 && operators[0] === "equals") {
+      const value = condition.equals;
+      if (isRowKey(value)) {
+        return value;
+      }
+    }
+  }
+  return;
+};
+var extractRowKeys = (rows, keyField) => {
+  const keys = [];
+  for (const row of rows) {
+    const value = row[keyField];
+    if (isRowKey(value)) {
+      keys.push(value);
+    }
+  }
+  return keys;
+};
+// src/adapters/prisma/read.ts
+var deriveReadTopics = (model, where, options = {}) => {
+  const keyField = options.keyField ?? "id";
+  const key = where === undefined ? undefined : extractKeyFromWhere(where, keyField);
+  if (key === undefined) {
+    return { topics: [tableTopic(model)], rowLevel: false };
+  }
+  return { topics: [keyTopic(model, key)], rowLevel: true };
+};
+// src/adapters/prisma/write.ts
+var publishChange = (hub, model, options = {}) => {
+  const name = tableTopic(model);
+  const keys = options.keys === undefined ? [] : [...new Set(options.keys)];
+  const payload = { table: name, op: options.op, keys };
+  const topics = [
+    ...new Set([name, ...keys.map((key) => keyTopic(model, key))])
+  ];
+  for (const topic of topics) {
+    hub.publish(topic, payload);
+  }
+  return topics;
+};
+var publishRows = (hub, model, rows, options = {}) => {
+  const list = Array.isArray(rows) ? rows : [rows];
+  return publishChange(hub, model, {
+    keys: extractRowKeys(list, options.keyField ?? "id"),
+    op: options.op
+  });
+};
+var publishWhere = (hub, model, where, options = {}) => {
+  const key = extractKeyFromWhere(where, options.keyField ?? "id");
+  return publishChange(hub, model, {
+    keys: key === undefined ? [] : [key],
+    op: options.op
+  });
+};
+// src/adapters/prisma/predicate.ts
+class UnsupportedFilterError extends Error {
+  constructor(operator) {
+    super(`Cannot evaluate Prisma filter operator "${operator}" incrementally`);
+    this.name = "UnsupportedFilterError";
+  }
+}
+var isPlainObject = (value) => typeof value === "object" && value !== null && !Array.isArray(value) && !(value instanceof Date);
+var equals = (value, operand) => {
+  if (operand === null) {
+    return value === null || value === undefined;
+  }
+  if (value instanceof Date && operand instanceof Date) {
+    return value.getTime() === operand.getTime();
+  }
+  return value === operand;
+};
+var order = (value) => value instanceof Date ? value.getTime() : value;
+var compare = (value, operand) => {
+  const a = order(value);
+  const b = order(operand);
+  if (a < b) {
+    return -1;
+  }
+  if (a > b) {
+    return 1;
+  }
+  return 0;
+};
+var comparable = (value) => value !== null && value !== undefined;
+var FIELD_OPERATORS = new Set([
+  "equals",
+  "not",
+  "in",
+  "notIn",
+  "lt",
+  "lte",
+  "gt",
+  "gte",
+  "contains",
+  "startsWith",
+  "endsWith"
+]);
+var matchesField = (value, condition) => {
+  if (!isPlainObject(condition)) {
+    return equals(value, condition);
+  }
+  for (const operator of Object.keys(condition)) {
+    if (!FIELD_OPERATORS.has(operator)) {
+      throw new UnsupportedFilterError(operator);
+    }
+  }
+  for (const [operator, operand] of Object.entries(condition)) {
+    switch (operator) {
+      case "equals":
+        if (!equals(value, operand))
+          return false;
+        break;
+      case "not":
+        if (isPlainObject(operand)) {
+          if (matchesField(value, operand))
+            return false;
+        } else if (equals(value, operand)) {
+          return false;
+        }
+        break;
+      case "in":
+        if (!Array.isArray(operand) || !operand.some((item) => equals(value, item)))
+          return false;
+        break;
+      case "notIn":
+        if (Array.isArray(operand) && operand.some((item) => equals(value, item)))
+          return false;
+        break;
+      case "lt":
+        if (!comparable(value) || compare(value, operand) >= 0)
+          return false;
+        break;
+      case "lte":
+        if (!comparable(value) || compare(value, operand) > 0)
+          return false;
+        break;
+      case "gt":
+        if (!comparable(value) || compare(value, operand) <= 0)
+          return false;
+        break;
+      case "gte":
+        if (!comparable(value) || compare(value, operand) < 0)
+          return false;
+        break;
+      case "contains":
+        if (typeof value !== "string" || !value.includes(String(operand)))
+          return false;
+        break;
+      case "startsWith":
+        if (typeof value !== "string" || !value.startsWith(String(operand)))
+          return false;
+        break;
+      case "endsWith":
+        if (typeof value !== "string" || !value.endsWith(String(operand)))
+          return false;
+        break;
+      default:
+        throw new UnsupportedFilterError(operator);
+    }
+  }
+  return true;
+};
+var toConditions = (value) => {
+  if (Array.isArray(value)) {
+    return value.filter(isPlainObject);
+  }
+  return isPlainObject(value) ? [value] : [];
+};
+var matchesWhere = (where, row) => {
+  for (const [field, condition] of Object.entries(where)) {
+    if (field === "AND") {
+      if (!toConditions(condition).every((part) => matchesWhere(part, row)))
+        return false;
+      continue;
+    }
+    if (field === "OR") {
+      const parts = toConditions(condition);
+      if (parts.length > 0 && !parts.some((part) => matchesWhere(part, row)))
+        return false;
+      continue;
+    }
+    if (field === "NOT") {
+      if (toConditions(condition).some((part) => matchesWhere(part, row)))
+        return false;
+      continue;
+    }
+    if (!matchesField(row[field], condition)) {
+      return false;
+    }
+  }
+  return true;
+};
+// src/adapters/prisma/collection.ts
+var prismaCollection = (options) => ({
+  name: options.name,
+  hydrate: (params, ctx) => options.find(options.where(params, ctx), params, ctx),
+  match: (row, params, ctx) => matchesWhere(options.where(params, ctx), row),
+  key: options.key,
+  authorize: options.authorize
+});
+export {
+  tableTopic,
+  publishWhere,
+  publishRows,
+  publishChange,
+  prismaCollection,
+  matchesWhere,
+  keyTopic,
+  deriveReadTopics,
+  UnsupportedFilterError
+};
+
+//# debugId=96C8D5DF158A4DF864756E2164756E21
+//# sourceMappingURL=index.js.map

package/dist/adapters/prisma/index.js.map

@@ -0,0 +1,14 @@
+{
+  "version": 3,
+  "sources": ["../src/adapters/prisma/topics.ts", "../src/adapters/prisma/read.ts", "../src/adapters/prisma/write.ts", "../src/adapters/prisma/predicate.ts", "../src/adapters/prisma/collection.ts"],
+  "sourcesContent": [
+    "/**\n * Shared topic vocabulary + key extraction for the Prisma adapter. Operates on\n * Prisma's plain `where` objects and result records — there is no\n * `@prisma/client` import, so it stays generic across every database Prisma\n * supports. Both the read side (derive a query's topics) and the write side\n * (publish a mutation's topics) build on these so the two always agree.\n */\n\n/** A Prisma `where` filter object, e.g. `{ id: 5 }` or `{ id: { gt: 5 } }`. */\nexport type PrismaWhere = Record<string, unknown>;\n\n/** A scalar usable as a row key. */\nexport type RowKey = string | number | bigint;\n\n/** The coarse topic every read/write of `model` touches, e.g. `user`. */\nexport const tableTopic = (model: string): string => model;\n\n/** The row-level topic for one key of `model`, e.g. `user:5`. */\nexport const keyTopic = (model: string, key: RowKey): string =>\n\t`${model}:${key}`;\n\nconst isRowKey = (value: unknown): value is RowKey =>\n\ttypeof value === 'string' ||\n\ttypeof value === 'number' ||\n\ttypeof value === 'bigint';\n\n/**\n * Best-effort: pull a single key-field equality value out of a Prisma `where`.\n * Recognises `{ [keyField]: scalar }` and `{ [keyField]: { equals: scalar } }`\n * only — extra fields, other operators (`gt`/`in`/`not`/…), `AND`/`OR`, or a\n * compound-key object yield `undefined`, so the caller falls back to the table\n * topic (over-invalidating a little rather than missing an update).\n */\nexport const extractKeyFromWhere = (\n\twhere: PrismaWhere,\n\tkeyField: string\n): RowKey | undefined => {\n\tconst fields = Object.keys(where);\n\tif (fields.length !== 1 || fields[0] !== keyField) {\n\t\treturn undefined;\n\t}\n\tconst condition = where[keyField];\n\tif (isRowKey(condition)) {\n\t\treturn condition;\n\t}\n\tif (\n\t\tcondition !== null &&\n\t\ttypeof condition === 'object' &&\n\t\t!Array.isArray(condition)\n\t) {\n\t\tconst operators = Object.keys(condition as Record<string, unknown>);\n\t\tif (operators.length === 1 && operators[0] === 'equals') {\n\t\t\tconst value = (condition as Record<string, unknown>).equals;\n\t\t\tif (isRowKey(value)) {\n\t\t\t\treturn value;\n\t\t\t}\n\t\t}\n\t}\n\treturn undefined;\n};\n\n/**\n * Read the key value from each result record (e.g. the output of a Prisma\n * `create`/`update`/`delete`), using `keyField`. Records without a scalar key\n * are skipped.\n */\nexport const extractRowKeys = (\n\trows: ReadonlyArray<Record<string, unknown>>,\n\tkeyField: string\n): RowKey[] => {\n\tconst keys: RowKey[] = [];\n\tfor (const row of rows) {\n\t\tconst value = row[keyField];\n\t\tif (isRowKey(value)) {\n\t\t\tkeys.push(value);\n\t\t}\n\t}\n\treturn keys;\n};\n",
+    "import { extractKeyFromWhere, keyTopic, tableTopic } from './topics';\nimport type { PrismaWhere } from './topics';\n\nexport type DeriveReadTopicsOptions = {\n\t/**\n\t * Primary-key field name to narrow on. Defaults to `id` (Prisma's\n\t * convention); set it for models keyed by another field.\n\t */\n\tkeyField?: string;\n};\n\nexport type DerivedReadTopics = {\n\t/** Topics this read depends on — subscribe to all of them. */\n\ttopics: string[];\n\t/**\n\t * `true` when derivation narrowed to a specific row (`model:key`); `false`\n\t * when it fell back to the whole-model topic.\n\t */\n\trowLevel: boolean;\n};\n\n/**\n * Derive the reactive topics a read of `model` (optionally filtered by `where`)\n * depends on. A recognised key-field equality narrows to a single `model:key`\n * topic; everything else subscribes to the whole-model topic.\n *\n * @example\n * deriveReadTopics('user');                       // { topics: ['user'], rowLevel: false }\n * deriveReadTopics('user', { id: 5 });            // { topics: ['user:5'], rowLevel: true }\n * deriveReadTopics('user', { id: { gt: 5 } });    // { topics: ['user'], rowLevel: false }\n */\nexport const deriveReadTopics = (\n\tmodel: string,\n\twhere?: PrismaWhere,\n\toptions: DeriveReadTopicsOptions = {}\n): DerivedReadTopics => {\n\tconst keyField = options.keyField ?? 'id';\n\tconst key =\n\t\twhere === undefined ? undefined : extractKeyFromWhere(where, keyField);\n\n\tif (key === undefined) {\n\t\treturn { topics: [tableTopic(model)], rowLevel: false };\n\t}\n\treturn { topics: [keyTopic(model, key)], rowLevel: true };\n};\n",
+    "import type { ReactiveHub } from '../../reactiveHub';\nimport {\n\textractKeyFromWhere,\n\textractRowKeys,\n\tkeyTopic,\n\ttableTopic\n} from './topics';\nimport type { PrismaWhere, RowKey } from './topics';\n\n/**\n * Prisma write-side topic publishing (Tier 2).\n *\n * The mirror of {@link deriveReadTopics}: after a mutation commits, publish the\n * topics it invalidates so subscribed reads refetch. Every change publishes the\n * **model** topic (so list queries refresh) plus a **row** topic per affected\n * key (so row-level queries refresh) — the exact topics the read side derives.\n *\n * Use the SAME model identifier you pass on the read side; the topic is the\n * model name verbatim.\n */\n\n/** The kind of mutation, forwarded in the change-event payload. */\nexport type ChangeOp = 'insert' | 'update' | 'delete';\n\n/** Payload carried by every change event the write side publishes. */\nexport type ChangePayload = {\n\t/** Name of the model that changed. */\n\ttable: string;\n\t/** Mutation kind, when the caller provided it. */\n\top?: ChangeOp;\n\t/** Affected row keys (empty for a model-wide change). */\n\tkeys: RowKey[];\n};\n\nexport type PublishChangeOptions = {\n\t/** Row keys that changed; each emits a `model:key` topic. */\n\tkeys?: ReadonlyArray<RowKey>;\n\top?: ChangeOp;\n};\n\n/**\n * Publish the reactive topics a change to `model` invalidates: the whole-model\n * topic (always) plus a `model:key` topic per affected row. Call after the\n * mutation resolves. Returns the (de-duplicated) topics published.\n */\nexport const publishChange = (\n\thub: Pick<ReactiveHub, 'publish'>,\n\tmodel: string,\n\toptions: PublishChangeOptions = {}\n): string[] => {\n\tconst name = tableTopic(model);\n\tconst keys = options.keys === undefined ? [] : [...new Set(options.keys)];\n\tconst payload: ChangePayload = { table: name, op: options.op, keys };\n\tconst topics = [\n\t\t...new Set([name, ...keys.map((key) => keyTopic(model, key))])\n\t];\n\tfor (const topic of topics) {\n\t\thub.publish(topic, payload);\n\t}\n\treturn topics;\n};\n\nexport type PublishRowsOptions = {\n\t/** Key field (defaults to `id`). */\n\tkeyField?: string;\n\top?: ChangeOp;\n};\n\n/**\n * Publish change topics for the record(s) a mutation returned. Accepts a single\n * record (Prisma `create`/`update`/`delete`) or an array (`findMany` results),\n * reading each record's `keyField` to emit `model:key` topics.\n *\n * @example\n * const user = await prisma.user.create({ data });\n * publishRows(hub, 'user', user, { op: 'insert' });\n */\nexport const publishRows = (\n\thub: Pick<ReactiveHub, 'publish'>,\n\tmodel: string,\n\trows: Record<string, unknown> | ReadonlyArray<Record<string, unknown>>,\n\toptions: PublishRowsOptions = {}\n): string[] => {\n\tconst list = (Array.isArray(rows) ? rows : [rows]) as ReadonlyArray<\n\t\tRecord<string, unknown>\n\t>;\n\treturn publishChange(hub, model, {\n\t\tkeys: extractRowKeys(list, options.keyField ?? 'id'),\n\t\top: options.op\n\t});\n};\n\nexport type PublishWhereOptions = {\n\t/** Key field (defaults to `id`). */\n\tkeyField?: string;\n\top?: ChangeOp;\n};\n\n/**\n * Publish change topics for an `update`/`delete` identified by a `where` filter.\n * A simple key-field equality narrows to that row's topic; any other filter\n * publishes just the model topic, so every affected subscriber refetches.\n *\n * @example\n * await prisma.user.update({ where: { id }, data });\n * publishWhere(hub, 'user', { id }, { op: 'update' });\n */\nexport const publishWhere = (\n\thub: Pick<ReactiveHub, 'publish'>,\n\tmodel: string,\n\twhere: PrismaWhere,\n\toptions: PublishWhereOptions = {}\n): string[] => {\n\tconst key = extractKeyFromWhere(where, options.keyField ?? 'id');\n\treturn publishChange(hub, model, {\n\t\tkeys: key === undefined ? [] : [key],\n\t\top: options.op\n\t});\n};\n",
+    "import type { PrismaWhere } from './topics';\n\n/**\n * Thrown when a Prisma `where` uses an operator the incremental matcher can't\n * evaluate in JS. The sync engine catches it and degrades that subscription to\n * a refetch, so it never produces a wrong result — only a less efficient one.\n */\nexport class UnsupportedFilterError extends Error {\n\tconstructor(operator: string) {\n\t\tsuper(\n\t\t\t`Cannot evaluate Prisma filter operator \"${operator}\" incrementally`\n\t\t);\n\t\tthis.name = 'UnsupportedFilterError';\n\t}\n}\n\nconst isPlainObject = (value: unknown): value is Record<string, unknown> =>\n\ttypeof value === 'object' &&\n\tvalue !== null &&\n\t!Array.isArray(value) &&\n\t!(value instanceof Date);\n\n/** Prisma equality semantics (a `null` operand means IS NULL). */\nconst equals = (value: unknown, operand: unknown): boolean => {\n\tif (operand === null) {\n\t\treturn value === null || value === undefined;\n\t}\n\tif (value instanceof Date && operand instanceof Date) {\n\t\treturn value.getTime() === operand.getTime();\n\t}\n\treturn value === operand;\n};\n\nconst order = (value: unknown): number | string =>\n\tvalue instanceof Date ? value.getTime() : (value as number | string);\n\nconst compare = (value: unknown, operand: unknown): number => {\n\tconst a = order(value);\n\tconst b = order(operand);\n\tif (a < b) {\n\t\treturn -1;\n\t}\n\tif (a > b) {\n\t\treturn 1;\n\t}\n\treturn 0;\n};\n\nconst comparable = (value: unknown): boolean =>\n\tvalue !== null && value !== undefined;\n\nconst FIELD_OPERATORS = new Set([\n\t'equals',\n\t'not',\n\t'in',\n\t'notIn',\n\t'lt',\n\t'lte',\n\t'gt',\n\t'gte',\n\t'contains',\n\t'startsWith',\n\t'endsWith'\n]);\n\n/** Evaluate a single field's condition (scalar equality or an operator object). */\nconst matchesField = (value: unknown, condition: unknown): boolean => {\n\tif (!isPlainObject(condition)) {\n\t\treturn equals(value, condition);\n\t}\n\t// Validate support up front: an unsupported operator must force a refetch\n\t// even when an earlier operator would short-circuit to false.\n\tfor (const operator of Object.keys(condition)) {\n\t\tif (!FIELD_OPERATORS.has(operator)) {\n\t\t\tthrow new UnsupportedFilterError(operator);\n\t\t}\n\t}\n\tfor (const [operator, operand] of Object.entries(condition)) {\n\t\tswitch (operator) {\n\t\t\tcase 'equals':\n\t\t\t\tif (!equals(value, operand)) return false;\n\t\t\t\tbreak;\n\t\t\tcase 'not':\n\t\t\t\tif (isPlainObject(operand)) {\n\t\t\t\t\tif (matchesField(value, operand)) return false;\n\t\t\t\t} else if (equals(value, operand)) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase 'in':\n\t\t\t\tif (\n\t\t\t\t\t!Array.isArray(operand) ||\n\t\t\t\t\t!operand.some((item) => equals(value, item))\n\t\t\t\t)\n\t\t\t\t\treturn false;\n\t\t\t\tbreak;\n\t\t\tcase 'notIn':\n\t\t\t\tif (\n\t\t\t\t\tArray.isArray(operand) &&\n\t\t\t\t\toperand.some((item) => equals(value, item))\n\t\t\t\t)\n\t\t\t\t\treturn false;\n\t\t\t\tbreak;\n\t\t\tcase 'lt':\n\t\t\t\tif (!comparable(value) || compare(value, operand) >= 0)\n\t\t\t\t\treturn false;\n\t\t\t\tbreak;\n\t\t\tcase 'lte':\n\t\t\t\tif (!comparable(value) || compare(value, operand) > 0)\n\t\t\t\t\treturn false;\n\t\t\t\tbreak;\n\t\t\tcase 'gt':\n\t\t\t\tif (!comparable(value) || compare(value, operand) <= 0)\n\t\t\t\t\treturn false;\n\t\t\t\tbreak;\n\t\t\tcase 'gte':\n\t\t\t\tif (!comparable(value) || compare(value, operand) < 0)\n\t\t\t\t\treturn false;\n\t\t\t\tbreak;\n\t\t\tcase 'contains':\n\t\t\t\tif (\n\t\t\t\t\ttypeof value !== 'string' ||\n\t\t\t\t\t!value.includes(String(operand))\n\t\t\t\t)\n\t\t\t\t\treturn false;\n\t\t\t\tbreak;\n\t\t\tcase 'startsWith':\n\t\t\t\tif (\n\t\t\t\t\ttypeof value !== 'string' ||\n\t\t\t\t\t!value.startsWith(String(operand))\n\t\t\t\t)\n\t\t\t\t\treturn false;\n\t\t\t\tbreak;\n\t\t\tcase 'endsWith':\n\t\t\t\tif (\n\t\t\t\t\ttypeof value !== 'string' ||\n\t\t\t\t\t!value.endsWith(String(operand))\n\t\t\t\t)\n\t\t\t\t\treturn false;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\t// `mode`, relation filters, etc. — bail so the engine refetches.\n\t\t\t\tthrow new UnsupportedFilterError(operator);\n\t\t}\n\t}\n\treturn true;\n};\n\nconst toConditions = (value: unknown): PrismaWhere[] => {\n\tif (Array.isArray(value)) {\n\t\treturn value.filter(isPlainObject);\n\t}\n\treturn isPlainObject(value) ? [value] : [];\n};\n\n/**\n * Evaluate a Prisma `where` object against an in-memory row — the JS mirror of\n * the SQL filter, used for incremental matching. Supports field equality and the\n * `equals/not/in/notIn/lt/lte/gt/gte/contains/startsWith/endsWith` operators\n * plus `AND`/`OR`/`NOT`. Anything else throws {@link UnsupportedFilterError}, so\n * the engine falls back to a refetch.\n *\n * @example\n * matchesWhere({ userId: 5, status: { not: 'archived' } }, row)\n */\nexport const matchesWhere = (\n\twhere: PrismaWhere,\n\trow: Record<string, unknown>\n): boolean => {\n\tfor (const [field, condition] of Object.entries(where)) {\n\t\tif (field === 'AND') {\n\t\t\tif (\n\t\t\t\t!toConditions(condition).every((part) =>\n\t\t\t\t\tmatchesWhere(part, row)\n\t\t\t\t)\n\t\t\t)\n\t\t\t\treturn false;\n\t\t\tcontinue;\n\t\t}\n\t\tif (field === 'OR') {\n\t\t\tconst parts = toConditions(condition);\n\t\t\tif (\n\t\t\t\tparts.length > 0 &&\n\t\t\t\t!parts.some((part) => matchesWhere(part, row))\n\t\t\t)\n\t\t\t\treturn false;\n\t\t\tcontinue;\n\t\t}\n\t\tif (field === 'NOT') {\n\t\t\tif (toConditions(condition).some((part) => matchesWhere(part, row)))\n\t\t\t\treturn false;\n\t\t\tcontinue;\n\t\t}\n\t\tif (!matchesField(row[field], condition)) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n};\n",
+    "import type {\n\tCollectionContext,\n\tCollectionDefinition\n} from '../../engine/collection';\nimport type { RowKey } from '../../engine/types';\nimport { matchesWhere } from './predicate';\nimport type { PrismaWhere } from './topics';\n\nexport type PrismaCollectionOptions<T, P, Ctx> = {\n\t/** Collection name (change-feed key and topic root). */\n\tname: string;\n\t/**\n\t * The query filter, written once. Used both to hydrate from the database\n\t * (passed to `find`) and, mirrored in JS, to match changed rows\n\t * incrementally. Receives the subscription's params and context.\n\t */\n\twhere: (params: P, ctx: Ctx) => PrismaWhere;\n\t/**\n\t * Run the database read for a given `where` — your Prisma call, e.g.\n\t * `(where) => prisma.order.findMany({ where })`.\n\t */\n\tfind: (\n\t\twhere: PrismaWhere,\n\t\tparams: P,\n\t\tctx: Ctx\n\t) => Promise<Iterable<T>> | Iterable<T>;\n\t/** Row identity. Defaults to `row.id`. */\n\tkey?: (row: T) => RowKey;\n\t/** Access control; return false (or throw) to deny. */\n\tauthorize?: (params: P, ctx: Ctx) => boolean | Promise<boolean>;\n};\n\n/**\n * Build a syncable {@link CollectionDefinition} for Prisma from a single filter:\n * `where` is written once and powers both `hydrate` (via your `find`) and the\n * incremental `match` (via {@link matchesWhere}) — no restating the WHERE.\n *\n * If the filter uses an operator the JS matcher can't evaluate, that change\n * degrades to a refetch (handled by the engine), so the result stays correct.\n *\n * @example\n * prismaCollection({\n *   name: 'orders',\n *   where: (p) => ({ userId: p.userId, status: 'open' }),\n *   find: (where) => prisma.order.findMany({ where }),\n *   authorize: (p, ctx) => p.userId === ctx.userId\n * });\n */\nexport const prismaCollection = <T, P = void, Ctx = CollectionContext>(\n\toptions: PrismaCollectionOptions<T, P, Ctx>\n): CollectionDefinition<T, P, Ctx> => ({\n\tname: options.name,\n\thydrate: (params, ctx) =>\n\t\toptions.find(options.where(params, ctx), params, ctx),\n\tmatch: (row, params, ctx) =>\n\t\tmatchesWhere(\n\t\t\toptions.where(params, ctx),\n\t\t\trow as Record<string, unknown>\n\t\t),\n\tkey: options.key,\n\tauthorize: options.authorize\n});\n"
+  ],
+  "mappings": ";;AAeO,IAAM,aAAa,CAAC,UAA0B;AAG9C,IAAM,WAAW,CAAC,OAAe,QACvC,GAAG,SAAS;AAEb,IAAM,WAAW,CAAC,UACjB,OAAO,UAAU,YACjB,OAAO,UAAU,YACjB,OAAO,UAAU;AASX,IAAM,sBAAsB,CAClC,OACA,aACwB;AAAA,EACxB,MAAM,SAAS,OAAO,KAAK,KAAK;AAAA,EAChC,IAAI,OAAO,WAAW,KAAK,OAAO,OAAO,UAAU;AAAA,IAClD;AAAA,EACD;AAAA,EACA,MAAM,YAAY,MAAM;AAAA,EACxB,IAAI,SAAS,SAAS,GAAG;AAAA,IACxB,OAAO;AAAA,EACR;AAAA,EACA,IACC,cAAc,QACd,OAAO,cAAc,YACrB,CAAC,MAAM,QAAQ,SAAS,GACvB;AAAA,IACD,MAAM,YAAY,OAAO,KAAK,SAAoC;AAAA,IAClE,IAAI,UAAU,WAAW,KAAK,UAAU,OAAO,UAAU;AAAA,MACxD,MAAM,QAAS,UAAsC;AAAA,MACrD,IAAI,SAAS,KAAK,GAAG;AAAA,QACpB,OAAO;AAAA,MACR;AAAA,IACD;AAAA,EACD;AAAA,EACA;AAAA;AAQM,IAAM,iBAAiB,CAC7B,MACA,aACc;AAAA,EACd,MAAM,OAAiB,CAAC;AAAA,EACxB,WAAW,OAAO,MAAM;AAAA,IACvB,MAAM,QAAQ,IAAI;AAAA,IAClB,IAAI,SAAS,KAAK,GAAG;AAAA,MACpB,KAAK,KAAK,KAAK;AAAA,IAChB;AAAA,EACD;AAAA,EACA,OAAO;AAAA;;AC9CD,IAAM,mBAAmB,CAC/B,OACA,OACA,UAAmC,CAAC,MACb;AAAA,EACvB,MAAM,WAAW,QAAQ,YAAY;AAAA,EACrC,MAAM,MACL,UAAU,YAAY,YAAY,oBAAoB,OAAO,QAAQ;AAAA,EAEtE,IAAI,QAAQ,WAAW;AAAA,IACtB,OAAO,EAAE,QAAQ,CAAC,WAAW,KAAK,CAAC,GAAG,UAAU,MAAM;AAAA,EACvD;AAAA,EACA,OAAO,EAAE,QAAQ,CAAC,SAAS,OAAO,GAAG,CAAC,GAAG,UAAU,KAAK;AAAA;;ACElD,IAAM,gBAAgB,CAC5B,KACA,OACA,UAAgC,CAAC,MACnB;AAAA,EACd,MAAM,OAAO,WAAW,KAAK;AAAA,EAC7B,MAAM,OAAO,QAAQ,SAAS,YAAY,CAAC,IAAI,CAAC,GAAG,IAAI,IAAI,QAAQ,IAAI,CAAC;AAAA,EACxE,MAAM,UAAyB,EAAE,OAAO,MAAM,IAAI,QAAQ,IAAI,KAAK;AAAA,EACnE,MAAM,SAAS;AAAA,IACd,GAAG,IAAI,IAAI,CAAC,MAAM,GAAG,KAAK,IAAI,CAAC,QAAQ,SAAS,OAAO,GAAG,CAAC,CAAC,CAAC;AAAA,EAC9D;AAAA,EACA,WAAW,SAAS,QAAQ;AAAA,IAC3B,IAAI,QAAQ,OAAO,OAAO;AAAA,EAC3B;AAAA,EACA,OAAO;AAAA;AAkBD,IAAM,cAAc,CAC1B,KACA,OACA,MACA,UAA8B,CAAC,MACjB;AAAA,EACd,MAAM,OAAQ,MAAM,QAAQ,IAAI,IAAI,OAAO,CAAC,IAAI;AAAA,EAGhD,OAAO,cAAc,KAAK,OAAO;AAAA,IAChC,MAAM,eAAe,MAAM,QAAQ,YAAY,IAAI;AAAA,IACnD,IAAI,QAAQ;AAAA,EACb,CAAC;AAAA;AAkBK,IAAM,eAAe,CAC3B,KACA,OACA,OACA,UAA+B,CAAC,MAClB;AAAA,EACd,MAAM,MAAM,oBAAoB,OAAO,QAAQ,YAAY,IAAI;AAAA,EAC/D,OAAO,cAAc,KAAK,OAAO;AAAA,IAChC,MAAM,QAAQ,YAAY,CAAC,IAAI,CAAC,GAAG;AAAA,IACnC,IAAI,QAAQ;AAAA,EACb,CAAC;AAAA;;AC9GK,MAAM,+BAA+B,MAAM;AAAA,EACjD,WAAW,CAAC,UAAkB;AAAA,IAC7B,MACC,2CAA2C,yBAC5C;AAAA,IACA,KAAK,OAAO;AAAA;AAEd;AAEA,IAAM,gBAAgB,CAAC,UACtB,OAAO,UAAU,YACjB,UAAU,QACV,CAAC,MAAM,QAAQ,KAAK,KACpB,EAAE,iBAAiB;AAGpB,IAAM,SAAS,CAAC,OAAgB,YAA8B;AAAA,EAC7D,IAAI,YAAY,MAAM;AAAA,IACrB,OAAO,UAAU,QAAQ,UAAU;AAAA,EACpC;AAAA,EACA,IAAI,iBAAiB,QAAQ,mBAAmB,MAAM;AAAA,IACrD,OAAO,MAAM,QAAQ,MAAM,QAAQ,QAAQ;AAAA,EAC5C;AAAA,EACA,OAAO,UAAU;AAAA;AAGlB,IAAM,QAAQ,CAAC,UACd,iBAAiB,OAAO,MAAM,QAAQ,IAAK;AAE5C,IAAM,UAAU,CAAC,OAAgB,YAA6B;AAAA,EAC7D,MAAM,IAAI,MAAM,KAAK;AAAA,EACrB,MAAM,IAAI,MAAM,OAAO;AAAA,EACvB,IAAI,IAAI,GAAG;AAAA,IACV,OAAO;AAAA,EACR;AAAA,EACA,IAAI,IAAI,GAAG;AAAA,IACV,OAAO;AAAA,EACR;AAAA,EACA,OAAO;AAAA;AAGR,IAAM,aAAa,CAAC,UACnB,UAAU,QAAQ,UAAU;AAE7B,IAAM,kBAAkB,IAAI,IAAI;AAAA,EAC/B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACD,CAAC;AAGD,IAAM,eAAe,CAAC,OAAgB,cAAgC;AAAA,EACrE,IAAI,CAAC,cAAc,SAAS,GAAG;AAAA,IAC9B,OAAO,OAAO,OAAO,SAAS;AAAA,EAC/B;AAAA,EAGA,WAAW,YAAY,OAAO,KAAK,SAAS,GAAG;AAAA,IAC9C,IAAI,CAAC,gBAAgB,IAAI,QAAQ,GAAG;AAAA,MACnC,MAAM,IAAI,uBAAuB,QAAQ;AAAA,IAC1C;AAAA,EACD;AAAA,EACA,YAAY,UAAU,YAAY,OAAO,QAAQ,SAAS,GAAG;AAAA,IAC5D,QAAQ;AAAA,WACF;AAAA,QACJ,IAAI,CAAC,OAAO,OAAO,OAAO;AAAA,UAAG,OAAO;AAAA,QACpC;AAAA,WACI;AAAA,QACJ,IAAI,cAAc,OAAO,GAAG;AAAA,UAC3B,IAAI,aAAa,OAAO,OAAO;AAAA,YAAG,OAAO;AAAA,QAC1C,EAAO,SAAI,OAAO,OAAO,OAAO,GAAG;AAAA,UAClC,OAAO;AAAA,QACR;AAAA,QACA;AAAA,WACI;AAAA,QACJ,IACC,CAAC,MAAM,QAAQ,OAAO,KACtB,CAAC,QAAQ,KAAK,CAAC,SAAS,OAAO,OAAO,IAAI,CAAC;AAAA,UAE3C,OAAO;AAAA,QACR;AAAA,WACI;AAAA,QACJ,IACC,MAAM,QAAQ,OAAO,KACrB,QAAQ,KAAK,CAAC,SAAS,OAAO,OAAO,IAAI,CAAC;AAAA,UAE1C,OAAO;AAAA,QACR;AAAA,WACI;AAAA,QACJ,IAAI,CAAC,WAAW,KAAK,KAAK,QAAQ,OAAO,OAAO,KAAK;AAAA,UACpD,OAAO;AAAA,QACR;AAAA,WACI;AAAA,QACJ,IAAI,CAAC,WAAW,KAAK,KAAK,QAAQ,OAAO,OAAO,IAAI;AAAA,UACnD,OAAO;AAAA,QACR;AAAA,WACI;AAAA,QACJ,IAAI,CAAC,WAAW,KAAK,KAAK,QAAQ,OAAO,OAAO,KAAK;AAAA,UACpD,OAAO;AAAA,QACR;AAAA,WACI;AAAA,QACJ,IAAI,CAAC,WAAW,KAAK,KAAK,QAAQ,OAAO,OAAO,IAAI;AAAA,UACnD,OAAO;AAAA,QACR;AAAA,WACI;AAAA,QACJ,IACC,OAAO,UAAU,YACjB,CAAC,MAAM,SAAS,OAAO,OAAO,CAAC;AAAA,UAE/B,OAAO;AAAA,QACR;AAAA,WACI;AAAA,QACJ,IACC,OAAO,UAAU,YACjB,CAAC,MAAM,WAAW,OAAO,OAAO,CAAC;AAAA,UAEjC,OAAO;AAAA,QACR;AAAA,WACI;AAAA,QACJ,IACC,OAAO,UAAU,YACjB,CAAC,MAAM,SAAS,OAAO,OAAO,CAAC;AAAA,UAE/B,OAAO;AAAA,QACR;AAAA;AAAA,QAGA,MAAM,IAAI,uBAAuB,QAAQ;AAAA;AAAA,EAE5C;AAAA,EACA,OAAO;AAAA;AAGR,IAAM,eAAe,CAAC,UAAkC;AAAA,EACvD,IAAI,MAAM,QAAQ,KAAK,GAAG;AAAA,IACzB,OAAO,MAAM,OAAO,aAAa;AAAA,EAClC;AAAA,EACA,OAAO,cAAc,KAAK,IAAI,CAAC,KAAK,IAAI,CAAC;AAAA;AAanC,IAAM,eAAe,CAC3B,OACA,QACa;AAAA,EACb,YAAY,OAAO,cAAc,OAAO,QAAQ,KAAK,GAAG;AAAA,IACvD,IAAI,UAAU,OAAO;AAAA,MACpB,IACC,CAAC,aAAa,SAAS,EAAE,MAAM,CAAC,SAC/B,aAAa,MAAM,GAAG,CACvB;AAAA,QAEA,OAAO;AAAA,MACR;AAAA,IACD;AAAA,IACA,IAAI,UAAU,MAAM;AAAA,MACnB,MAAM,QAAQ,aAAa,SAAS;AAAA,MACpC,IACC,MAAM,SAAS,KACf,CAAC,MAAM,KAAK,CAAC,SAAS,aAAa,MAAM,GAAG,CAAC;AAAA,QAE7C,OAAO;AAAA,MACR;AAAA,IACD;AAAA,IACA,IAAI,UAAU,OAAO;AAAA,MACpB,IAAI,aAAa,SAAS,EAAE,KAAK,CAAC,SAAS,aAAa,MAAM,GAAG,CAAC;AAAA,QACjE,OAAO;AAAA,MACR;AAAA,IACD;AAAA,IACA,IAAI,CAAC,aAAa,IAAI,QAAQ,SAAS,GAAG;AAAA,MACzC,OAAO;AAAA,IACR;AAAA,EACD;AAAA,EACA,OAAO;AAAA;;ACrJD,IAAM,mBAAmB,CAC/B,aACsC;AAAA,EACtC,MAAM,QAAQ;AAAA,EACd,SAAS,CAAC,QAAQ,QACjB,QAAQ,KAAK,QAAQ,MAAM,QAAQ,GAAG,GAAG,QAAQ,GAAG;AAAA,EACrD,OAAO,CAAC,KAAK,QAAQ,QACpB,aACC,QAAQ,MAAM,QAAQ,GAAG,GACzB,GACD;AAAA,EACD,KAAK,QAAQ;AAAA,EACb,WAAW,QAAQ;AACpB;",
+  "debugId": "96C8D5DF158A4DF864756E2164756E21",
+  "names": []
+}

package/dist/adapters/prisma/predicate.d.ts

@@ -0,0 +1,20 @@
+import type { PrismaWhere } from './topics';
+/**
+ * Thrown when a Prisma `where` uses an operator the incremental matcher can't
+ * evaluate in JS. The sync engine catches it and degrades that subscription to
+ * a refetch, so it never produces a wrong result — only a less efficient one.
+ */
+export declare class UnsupportedFilterError extends Error {
+    constructor(operator: string);
+}
+/**
+ * Evaluate a Prisma `where` object against an in-memory row — the JS mirror of
+ * the SQL filter, used for incremental matching. Supports field equality and the
+ * `equals/not/in/notIn/lt/lte/gt/gte/contains/startsWith/endsWith` operators
+ * plus `AND`/`OR`/`NOT`. Anything else throws {@link UnsupportedFilterError}, so
+ * the engine falls back to a refetch.
+ *
+ * @example
+ * matchesWhere({ userId: 5, status: { not: 'archived' } }, row)
+ */
+export declare const matchesWhere: (where: PrismaWhere, row: Record<string, unknown>) => boolean;

package/dist/adapters/prisma/read.d.ts

@@ -0,0 +1,28 @@
+import type { PrismaWhere } from './topics';
+export type DeriveReadTopicsOptions = {
+    /**
+     * Primary-key field name to narrow on. Defaults to `id` (Prisma's
+     * convention); set it for models keyed by another field.
+     */
+    keyField?: string;
+};
+export type DerivedReadTopics = {
+    /** Topics this read depends on — subscribe to all of them. */
+    topics: string[];
+    /**
+     * `true` when derivation narrowed to a specific row (`model:key`); `false`
+     * when it fell back to the whole-model topic.
+     */
+    rowLevel: boolean;
+};
+/**
+ * Derive the reactive topics a read of `model` (optionally filtered by `where`)
+ * depends on. A recognised key-field equality narrows to a single `model:key`
+ * topic; everything else subscribes to the whole-model topic.
+ *
+ * @example
+ * deriveReadTopics('user');                       // { topics: ['user'], rowLevel: false }
+ * deriveReadTopics('user', { id: 5 });            // { topics: ['user:5'], rowLevel: true }
+ * deriveReadTopics('user', { id: { gt: 5 } });    // { topics: ['user'], rowLevel: false }
+ */
+export declare const deriveReadTopics: (model: string, where?: PrismaWhere, options?: DeriveReadTopicsOptions) => DerivedReadTopics;

package/dist/adapters/prisma/topics.d.ts

@@ -0,0 +1,29 @@
+/**
+ * Shared topic vocabulary + key extraction for the Prisma adapter. Operates on
+ * Prisma's plain `where` objects and result records — there is no
+ * `@prisma/client` import, so it stays generic across every database Prisma
+ * supports. Both the read side (derive a query's topics) and the write side
+ * (publish a mutation's topics) build on these so the two always agree.
+ */
+/** A Prisma `where` filter object, e.g. `{ id: 5 }` or `{ id: { gt: 5 } }`. */
+export type PrismaWhere = Record<string, unknown>;
+/** A scalar usable as a row key. */
+export type RowKey = string | number | bigint;
+/** The coarse topic every read/write of `model` touches, e.g. `user`. */
+export declare const tableTopic: (model: string) => string;
+/** The row-level topic for one key of `model`, e.g. `user:5`. */
+export declare const keyTopic: (model: string, key: RowKey) => string;
+/**
+ * Best-effort: pull a single key-field equality value out of a Prisma `where`.
+ * Recognises `{ [keyField]: scalar }` and `{ [keyField]: { equals: scalar } }`
+ * only — extra fields, other operators (`gt`/`in`/`not`/…), `AND`/`OR`, or a
+ * compound-key object yield `undefined`, so the caller falls back to the table
+ * topic (over-invalidating a little rather than missing an update).
+ */
+export declare const extractKeyFromWhere: (where: PrismaWhere, keyField: string) => RowKey | undefined;
+/**
+ * Read the key value from each result record (e.g. the output of a Prisma
+ * `create`/`update`/`delete`), using `keyField`. Records without a scalar key
+ * are skipped.
+ */
+export declare const extractRowKeys: (rows: ReadonlyArray<Record<string, unknown>>, keyField: string) => RowKey[];

package/dist/adapters/prisma/write.d.ts

@@ -0,0 +1,65 @@
+import type { ReactiveHub } from '../../reactiveHub';
+import type { PrismaWhere, RowKey } from './topics';
+/**
+ * Prisma write-side topic publishing (Tier 2).
+ *
+ * The mirror of {@link deriveReadTopics}: after a mutation commits, publish the
+ * topics it invalidates so subscribed reads refetch. Every change publishes the
+ * **model** topic (so list queries refresh) plus a **row** topic per affected
+ * key (so row-level queries refresh) — the exact topics the read side derives.
+ *
+ * Use the SAME model identifier you pass on the read side; the topic is the
+ * model name verbatim.
+ */
+/** The kind of mutation, forwarded in the change-event payload. */
+export type ChangeOp = 'insert' | 'update' | 'delete';
+/** Payload carried by every change event the write side publishes. */
+export type ChangePayload = {
+    /** Name of the model that changed. */
+    table: string;
+    /** Mutation kind, when the caller provided it. */
+    op?: ChangeOp;
+    /** Affected row keys (empty for a model-wide change). */
+    keys: RowKey[];
+};
+export type PublishChangeOptions = {
+    /** Row keys that changed; each emits a `model:key` topic. */
+    keys?: ReadonlyArray<RowKey>;
+    op?: ChangeOp;
+};
+/**
+ * Publish the reactive topics a change to `model` invalidates: the whole-model
+ * topic (always) plus a `model:key` topic per affected row. Call after the
+ * mutation resolves. Returns the (de-duplicated) topics published.
+ */
+export declare const publishChange: (hub: Pick<ReactiveHub, "publish">, model: string, options?: PublishChangeOptions) => string[];
+export type PublishRowsOptions = {
+    /** Key field (defaults to `id`). */
+    keyField?: string;
+    op?: ChangeOp;
+};
+/**
+ * Publish change topics for the record(s) a mutation returned. Accepts a single
+ * record (Prisma `create`/`update`/`delete`) or an array (`findMany` results),
+ * reading each record's `keyField` to emit `model:key` topics.
+ *
+ * @example
+ * const user = await prisma.user.create({ data });
+ * publishRows(hub, 'user', user, { op: 'insert' });
+ */
+export declare const publishRows: (hub: Pick<ReactiveHub, "publish">, model: string, rows: Record<string, unknown> | ReadonlyArray<Record<string, unknown>>, options?: PublishRowsOptions) => string[];
+export type PublishWhereOptions = {
+    /** Key field (defaults to `id`). */
+    keyField?: string;
+    op?: ChangeOp;
+};
+/**
+ * Publish change topics for an `update`/`delete` identified by a `where` filter.
+ * A simple key-field equality narrows to that row's topic; any other filter
+ * publishes just the model topic, so every affected subscriber refetches.
+ *
+ * @example
+ * await prisma.user.update({ where: { id }, data });
+ * publishWhere(hub, 'user', { id }, { op: 'update' });
+ */
+export declare const publishWhere: (hub: Pick<ReactiveHub, "publish">, model: string, where: PrismaWhere, options?: PublishWhereOptions) => string[];

package/dist/adapters/sqlite/index.d.ts

@@ -0,0 +1,32 @@
+/**
+ * SQLite CDC adapter for @absolutejs/sync (Tier 3, M5).
+ *
+ * SQLite has no `LISTEN/NOTIFY`, and its `update_hook` isn't reachable from the
+ * JS runtimes we target, so out-of-band writes are caught with the portable
+ * changelog (outbox) pattern: install triggers that append every row change to a
+ * changelog table, then tail it with {@link createPollingChangeSource}. Polling a
+ * local SQLite table is cheap (same process, no network).
+ *
+ * Dependency-free — it only generates SQL; bring your own client (`bun:sqlite`,
+ * better-sqlite3, …) to run it and to back the poll query.
+ */
+export { createPollingChangeSource, parseOutboxRow } from '../../engine/pollingSource';
+export type { OutboxRow, PollingChangeSourceOptions } from '../../engine/pollingSource';
+export type SqliteChangelogOptions = {
+    /** Table name → the column names to capture in the change payload. */
+    tables: Record<string, string[]>;
+    /** Changelog table name. Defaults to `absolute_sync_changelog`. */
+    changelogTable?: string;
+    /** Trigger name prefix. Defaults to `absolute_sync`. */
+    prefix?: string;
+};
+/**
+ * Generate the SQL that installs the changelog table and per-table
+ * insert/update/delete triggers — run it once (e.g. in a migration). Each
+ * trigger appends `{ tbl, op, payload }` (payload built with `json_object` from
+ * the listed columns) to the changelog for {@link createPollingChangeSource}.
+ *
+ * The statements are `;`-separated; run them as a script, or split on `;` if your
+ * driver executes one statement per call.
+ */
+export declare const sqliteChangelogSchema: (options: SqliteChangelogOptions) => string;

package/dist/adapters/sqlite/index.js

@@ -0,0 +1,128 @@
+// @bun
+// src/engine/pollingSource.ts
+var OP_BY_NAME = {
+  insert: "insert",
+  INSERT: "insert",
+  update: "update",
+  UPDATE: "update",
+  delete: "delete",
+  DELETE: "delete"
+};
+var parseOutboxRow = (row) => {
+  if (typeof row.tbl !== "string") {
+    return;
+  }
+  const op = OP_BY_NAME[row.op];
+  if (op === undefined) {
+    return;
+  }
+  let payload = row.payload;
+  if (typeof payload === "string") {
+    try {
+      payload = JSON.parse(payload);
+    } catch {
+      return;
+    }
+  }
+  if (typeof payload !== "object" || payload === null) {
+    return;
+  }
+  return { table: row.tbl, change: { op, row: payload } };
+};
+var createPollingChangeSource = (options) => {
+  const intervalMs = options.intervalMs ?? 1000;
+  const parse = options.parse ?? parseOutboxRow;
+  const onError = options.onError ?? ((error) => {
+    console.warn("[sync] polling change source error:", error);
+  });
+  let cursor = options.startSeq ?? 0;
+  let running = false;
+  let timer;
+  const tick = async (emit) => {
+    if (!running) {
+      return;
+    }
+    try {
+      const rows = await options.poll(cursor);
+      for (const row of rows) {
+        const parsed = parse(row);
+        if (parsed !== undefined) {
+          await emit(parsed.table, parsed.change);
+        }
+        if (typeof row.seq === "number" && row.seq > cursor) {
+          cursor = row.seq;
+        }
+      }
+      if (rows.length > 0) {
+        await options.onProcessed?.(cursor);
+      }
+    } catch (error) {
+      onError(error);
+    }
+    if (running) {
+      timer = setTimeout(() => {
+        tick(emit);
+      }, intervalMs);
+    }
+  };
+  return {
+    start: async (emit) => {
+      if (running) {
+        return;
+      }
+      running = true;
+      await tick(emit);
+    },
+    stop: () => {
+      running = false;
+      if (timer !== undefined) {
+        clearTimeout(timer);
+        timer = undefined;
+      }
+    }
+  };
+};
+
+// src/adapters/sqlite/index.ts
+var DEFAULT_CHANGELOG = "absolute_sync_changelog";
+var DEFAULT_PREFIX = "absolute_sync";
+var OPS = ["insert", "update", "delete"];
+var sqliteChangelogSchema = (options) => {
+  const changelog = options.changelogTable ?? DEFAULT_CHANGELOG;
+  const prefix = options.prefix ?? DEFAULT_PREFIX;
+  const createTable = [
+    `CREATE TABLE IF NOT EXISTS ${changelog} (`,
+    "\tseq INTEGER PRIMARY KEY AUTOINCREMENT,",
+    "\ttbl TEXT NOT NULL,",
+    "\top TEXT NOT NULL,",
+    "\tpayload TEXT NOT NULL,",
+    "\tcreated_at TEXT NOT NULL DEFAULT (datetime('now'))",
+    ");"
+  ].join(`
+`);
+  const jsonObject = (columns, ref) => `json_object(${columns.map((column) => `'${column}', ${ref}.${column}`).join(", ")})`;
+  const triggers = Object.entries(options.tables).flatMap(([table, columns]) => OPS.map((op) => {
+    const ref = op === "delete" ? "OLD" : "NEW";
+    const name = `${prefix}_${table}_${op}`;
+    return [
+      `DROP TRIGGER IF EXISTS ${name};`,
+      `CREATE TRIGGER ${name} AFTER ${op.toUpperCase()} ON ${table}`,
+      "BEGIN",
+      `	INSERT INTO ${changelog} (tbl, op, payload)`,
+      `	VALUES ('${table}', '${op}', ${jsonObject(columns, ref)});`,
+      "END;"
+    ].join(`
+`);
+  }));
+  return [createTable, ...triggers].join(`
+
+`);
+};
+export {
+  sqliteChangelogSchema,
+  parseOutboxRow,
+  createPollingChangeSource
+};
+
+//# debugId=3D209B4D7BF1282864756E2164756E21
+//# sourceMappingURL=index.js.map

package/dist/adapters/sqlite/index.js.map

@@ -0,0 +1,11 @@
+{
+  "version": 3,
+  "sources": ["../src/engine/pollingSource.ts", "../src/adapters/sqlite/index.ts"],
+  "sourcesContent": [
+    "import type { ChangeSource, EmitChange, ParsedChange, RowOp } from './types';\n\n/**\n * A database-agnostic CDC {@link ChangeSource} that tails an append-only\n * changelog (outbox) table and emits its rows into the engine.\n *\n * This is the portable way to catch out-of-band writes on databases without a\n * native push channel — MySQL (no `LISTEN/NOTIFY`) and SQLite (no update hook\n * reachable from the JS runtime). Install per-table triggers that append to the\n * changelog (see `@absolutejs/sync/mysql` and `/sqlite`), then poll it here. It\n * is also a fine fallback for Postgres when you'd rather not run `LISTEN`.\n *\n * Driver-agnostic: you supply `poll(sinceSeq)` — a single\n * `SELECT seq, tbl, op, payload FROM <changelog> WHERE seq > ? ORDER BY seq` run\n * with your client — and the adapter tracks the cursor, parses each row, emits,\n * and advances. Delivery is at-least-once across crashes (a row may re-emit if\n * the process dies mid-batch); the engine's per-key last-write-wins makes that\n * safe. Use `onProcessed` to prune the changelog once a watermark is durable.\n */\n\nconst OP_BY_NAME: Record<string, RowOp> = {\n\tinsert: 'insert',\n\tINSERT: 'insert',\n\tupdate: 'update',\n\tUPDATE: 'update',\n\tdelete: 'delete',\n\tDELETE: 'delete'\n};\n\n/** One changelog row, as returned by your `poll` query. */\nexport type OutboxRow = {\n\t/** Monotonic sequence (the cursor advances to the max seen). */\n\tseq: number;\n\t/** Source table the change happened on. */\n\ttbl: string;\n\t/** `insert` | `update` | `delete` (upper- or lower-case). */\n\top: string;\n\t/** The row's captured values — a JSON string or an already-parsed object. */\n\tpayload: unknown;\n};\n\n/**\n * Default changelog-row parser: normalizes `op`, JSON-parses a string `payload`,\n * and returns `{ table, change }`. Returns `undefined` for a malformed row so it\n * is skipped (and its `seq` still advances the cursor) rather than wedging the\n * feed.\n */\nexport const parseOutboxRow = (row: OutboxRow): ParsedChange | undefined => {\n\tif (typeof row.tbl !== 'string') {\n\t\treturn undefined;\n\t}\n\tconst op = OP_BY_NAME[row.op];\n\tif (op === undefined) {\n\t\treturn undefined;\n\t}\n\tlet payload: unknown = row.payload;\n\tif (typeof payload === 'string') {\n\t\ttry {\n\t\t\tpayload = JSON.parse(payload);\n\t\t} catch {\n\t\t\treturn undefined;\n\t\t}\n\t}\n\tif (typeof payload !== 'object' || payload === null) {\n\t\treturn undefined;\n\t}\n\treturn { table: row.tbl, change: { op, row: payload } };\n};\n\nexport type PollingChangeSourceOptions = {\n\t/**\n\t * Fetch changelog rows with `seq > sinceSeq`, ordered by `seq` ascending.\n\t * e.g. `(since) => sql\\`SELECT seq, tbl, op, payload FROM absolute_sync_changelog WHERE seq > ${since} ORDER BY seq\\``.\n\t */\n\tpoll: (sinceSeq: number) => Promise<OutboxRow[]> | OutboxRow[];\n\t/** Poll interval in ms. Defaults to 1000. */\n\tintervalMs?: number;\n\t/** Resume cursor (highest `seq` already processed). Defaults to 0. */\n\tstartSeq?: number;\n\t/** Override the row parser (defaults to {@link parseOutboxRow}). */\n\tparse?: (row: OutboxRow) => ParsedChange | undefined;\n\t/** Called after a non-empty batch with the new watermark — prune here. */\n\tonProcessed?: (uptoSeq: number) => void | Promise<void>;\n\t/** Called if a poll throws (the loop keeps running). Defaults to a warning. */\n\tonError?: (error: unknown) => void;\n};\n\n/**\n * Create a polling {@link ChangeSource} over a changelog table. Connect it with\n * `engine.connectSource(...)`; `start` runs an immediate first poll (draining any\n * backlog) and then polls every `intervalMs` until `stop`.\n */\nexport const createPollingChangeSource = (\n\toptions: PollingChangeSourceOptions\n): ChangeSource => {\n\tconst intervalMs = options.intervalMs ?? 1000;\n\tconst parse = options.parse ?? parseOutboxRow;\n\tconst onError =\n\t\toptions.onError ??\n\t\t((error: unknown) => {\n\t\t\tconsole.warn('[sync] polling change source error:', error);\n\t\t});\n\tlet cursor = options.startSeq ?? 0;\n\tlet running = false;\n\tlet timer: ReturnType<typeof setTimeout> | undefined;\n\n\tconst tick = async (emit: EmitChange): Promise<void> => {\n\t\tif (!running) {\n\t\t\treturn;\n\t\t}\n\t\ttry {\n\t\t\tconst rows = await options.poll(cursor);\n\t\t\tfor (const row of rows) {\n\t\t\t\tconst parsed = parse(row);\n\t\t\t\tif (parsed !== undefined) {\n\t\t\t\t\tawait emit(parsed.table, parsed.change);\n\t\t\t\t}\n\t\t\t\tif (typeof row.seq === 'number' && row.seq > cursor) {\n\t\t\t\t\tcursor = row.seq;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (rows.length > 0) {\n\t\t\t\tawait options.onProcessed?.(cursor);\n\t\t\t}\n\t\t} catch (error) {\n\t\t\tonError(error);\n\t\t}\n\t\tif (running) {\n\t\t\ttimer = setTimeout(() => {\n\t\t\t\tvoid tick(emit);\n\t\t\t}, intervalMs);\n\t\t}\n\t};\n\n\treturn {\n\t\tstart: async (emit) => {\n\t\t\tif (running) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\trunning = true;\n\t\t\tawait tick(emit);\n\t\t},\n\t\tstop: () => {\n\t\t\trunning = false;\n\t\t\tif (timer !== undefined) {\n\t\t\t\tclearTimeout(timer);\n\t\t\t\ttimer = undefined;\n\t\t\t}\n\t\t}\n\t};\n};\n",
+    "/**\n * SQLite CDC adapter for @absolutejs/sync (Tier 3, M5).\n *\n * SQLite has no `LISTEN/NOTIFY`, and its `update_hook` isn't reachable from the\n * JS runtimes we target, so out-of-band writes are caught with the portable\n * changelog (outbox) pattern: install triggers that append every row change to a\n * changelog table, then tail it with {@link createPollingChangeSource}. Polling a\n * local SQLite table is cheap (same process, no network).\n *\n * Dependency-free — it only generates SQL; bring your own client (`bun:sqlite`,\n * better-sqlite3, …) to run it and to back the poll query.\n */\n\nexport {\n\tcreatePollingChangeSource,\n\tparseOutboxRow\n} from '../../engine/pollingSource';\nexport type {\n\tOutboxRow,\n\tPollingChangeSourceOptions\n} from '../../engine/pollingSource';\n\nconst DEFAULT_CHANGELOG = 'absolute_sync_changelog';\nconst DEFAULT_PREFIX = 'absolute_sync';\nconst OPS = ['insert', 'update', 'delete'] as const;\n\nexport type SqliteChangelogOptions = {\n\t/** Table name → the column names to capture in the change payload. */\n\ttables: Record<string, string[]>;\n\t/** Changelog table name. Defaults to `absolute_sync_changelog`. */\n\tchangelogTable?: string;\n\t/** Trigger name prefix. Defaults to `absolute_sync`. */\n\tprefix?: string;\n};\n\n/**\n * Generate the SQL that installs the changelog table and per-table\n * insert/update/delete triggers — run it once (e.g. in a migration). Each\n * trigger appends `{ tbl, op, payload }` (payload built with `json_object` from\n * the listed columns) to the changelog for {@link createPollingChangeSource}.\n *\n * The statements are `;`-separated; run them as a script, or split on `;` if your\n * driver executes one statement per call.\n */\nexport const sqliteChangelogSchema = (\n\toptions: SqliteChangelogOptions\n): string => {\n\tconst changelog = options.changelogTable ?? DEFAULT_CHANGELOG;\n\tconst prefix = options.prefix ?? DEFAULT_PREFIX;\n\n\tconst createTable = [\n\t\t`CREATE TABLE IF NOT EXISTS ${changelog} (`,\n\t\t'\\tseq INTEGER PRIMARY KEY AUTOINCREMENT,',\n\t\t'\\ttbl TEXT NOT NULL,',\n\t\t'\\top TEXT NOT NULL,',\n\t\t'\\tpayload TEXT NOT NULL,',\n\t\t\"\\tcreated_at TEXT NOT NULL DEFAULT (datetime('now'))\",\n\t\t');'\n\t].join('\\n');\n\n\tconst jsonObject = (columns: string[], ref: 'NEW' | 'OLD'): string =>\n\t\t`json_object(${columns\n\t\t\t.map((column) => `'${column}', ${ref}.${column}`)\n\t\t\t.join(', ')})`;\n\n\tconst triggers = Object.entries(options.tables).flatMap(\n\t\t([table, columns]) =>\n\t\t\tOPS.map((op) => {\n\t\t\t\tconst ref = op === 'delete' ? 'OLD' : 'NEW';\n\t\t\t\tconst name = `${prefix}_${table}_${op}`;\n\t\t\t\treturn [\n\t\t\t\t\t`DROP TRIGGER IF EXISTS ${name};`,\n\t\t\t\t\t`CREATE TRIGGER ${name} AFTER ${op.toUpperCase()} ON ${table}`,\n\t\t\t\t\t'BEGIN',\n\t\t\t\t\t`\\tINSERT INTO ${changelog} (tbl, op, payload)`,\n\t\t\t\t\t`\\tVALUES ('${table}', '${op}', ${jsonObject(columns, ref)});`,\n\t\t\t\t\t'END;'\n\t\t\t\t].join('\\n');\n\t\t\t})\n\t);\n\n\treturn [createTable, ...triggers].join('\\n\\n');\n};\n"
+  ],
+  "mappings": ";;AAoBA,IAAM,aAAoC;AAAA,EACzC,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,QAAQ;AACT;AAoBO,IAAM,iBAAiB,CAAC,QAA6C;AAAA,EAC3E,IAAI,OAAO,IAAI,QAAQ,UAAU;AAAA,IAChC;AAAA,EACD;AAAA,EACA,MAAM,KAAK,WAAW,IAAI;AAAA,EAC1B,IAAI,OAAO,WAAW;AAAA,IACrB;AAAA,EACD;AAAA,EACA,IAAI,UAAmB,IAAI;AAAA,EAC3B,IAAI,OAAO,YAAY,UAAU;AAAA,IAChC,IAAI;AAAA,MACH,UAAU,KAAK,MAAM,OAAO;AAAA,MAC3B,MAAM;AAAA,MACP;AAAA;AAAA,EAEF;AAAA,EACA,IAAI,OAAO,YAAY,YAAY,YAAY,MAAM;AAAA,IACpD;AAAA,EACD;AAAA,EACA,OAAO,EAAE,OAAO,IAAI,KAAK,QAAQ,EAAE,IAAI,KAAK,QAAQ,EAAE;AAAA;AA0BhD,IAAM,4BAA4B,CACxC,YACkB;AAAA,EAClB,MAAM,aAAa,QAAQ,cAAc;AAAA,EACzC,MAAM,QAAQ,QAAQ,SAAS;AAAA,EAC/B,MAAM,UACL,QAAQ,YACP,CAAC,UAAmB;AAAA,IACpB,QAAQ,KAAK,uCAAuC,KAAK;AAAA;AAAA,EAE3D,IAAI,SAAS,QAAQ,YAAY;AAAA,EACjC,IAAI,UAAU;AAAA,EACd,IAAI;AAAA,EAEJ,MAAM,OAAO,OAAO,SAAoC;AAAA,IACvD,IAAI,CAAC,SAAS;AAAA,MACb;AAAA,IACD;AAAA,IACA,IAAI;AAAA,MACH,MAAM,OAAO,MAAM,QAAQ,KAAK,MAAM;AAAA,MACtC,WAAW,OAAO,MAAM;AAAA,QACvB,MAAM,SAAS,MAAM,GAAG;AAAA,QACxB,IAAI,WAAW,WAAW;AAAA,UACzB,MAAM,KAAK,OAAO,OAAO,OAAO,MAAM;AAAA,QACvC;AAAA,QACA,IAAI,OAAO,IAAI,QAAQ,YAAY,IAAI,MAAM,QAAQ;AAAA,UACpD,SAAS,IAAI;AAAA,QACd;AAAA,MACD;AAAA,MACA,IAAI,KAAK,SAAS,GAAG;AAAA,QACpB,MAAM,QAAQ,cAAc,MAAM;AAAA,MACnC;AAAA,MACC,OAAO,OAAO;AAAA,MACf,QAAQ,KAAK;AAAA;AAAA,IAEd,IAAI,SAAS;AAAA,MACZ,QAAQ,WAAW,MAAM;AAAA,QACnB,KAAK,IAAI;AAAA,SACZ,UAAU;AAAA,IACd;AAAA;AAAA,EAGD,OAAO;AAAA,IACN,OAAO,OAAO,SAAS;AAAA,MACtB,IAAI,SAAS;AAAA,QACZ;AAAA,MACD;AAAA,MACA,UAAU;AAAA,MACV,MAAM,KAAK,IAAI;AAAA;AAAA,IAEhB,MAAM,MAAM;AAAA,MACX,UAAU;AAAA,MACV,IAAI,UAAU,WAAW;AAAA,QACxB,aAAa,KAAK;AAAA,QAClB,QAAQ;AAAA,MACT;AAAA;AAAA,EAEF;AAAA;;;AC/HD,IAAM,oBAAoB;AAC1B,IAAM,iBAAiB;AACvB,IAAM,MAAM,CAAC,UAAU,UAAU,QAAQ;AAoBlC,IAAM,wBAAwB,CACpC,YACY;AAAA,EACZ,MAAM,YAAY,QAAQ,kBAAkB;AAAA,EAC5C,MAAM,SAAS,QAAQ,UAAU;AAAA,EAEjC,MAAM,cAAc;AAAA,IACnB,8BAA8B;AAAA,IAC9B;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACD,EAAE,KAAK;AAAA,CAAI;AAAA,EAEX,MAAM,aAAa,CAAC,SAAmB,QACtC,eAAe,QACb,IAAI,CAAC,WAAW,IAAI,YAAY,OAAO,QAAQ,EAC/C,KAAK,IAAI;AAAA,EAEZ,MAAM,WAAW,OAAO,QAAQ,QAAQ,MAAM,EAAE,QAC/C,EAAE,OAAO,aACR,IAAI,IAAI,CAAC,OAAO;AAAA,IACf,MAAM,MAAM,OAAO,WAAW,QAAQ;AAAA,IACtC,MAAM,OAAO,GAAG,UAAU,SAAS;AAAA,IACnC,OAAO;AAAA,MACN,0BAA0B;AAAA,MAC1B,kBAAkB,cAAc,GAAG,YAAY,QAAQ;AAAA,MACvD;AAAA,MACA,gBAAiB;AAAA,MACjB,aAAc,YAAY,QAAQ,WAAW,SAAS,GAAG;AAAA,MACzD;AAAA,IACD,EAAE,KAAK;AAAA,CAAI;AAAA,GACX,CACH;AAAA,EAEA,OAAO,CAAC,aAAa,GAAG,QAAQ,EAAE,KAAK;AAAA;AAAA,CAAM;AAAA;",
+  "debugId": "3D209B4D7BF1282864756E2164756E21",
+  "names": []
+}

package/dist/angular/index.d.ts

@@ -0,0 +1 @@
+export { SyncCollectionService } from './sync-collection.service';