@cavelang/query 0.27.14 → 0.29.1

package/dist/src/page.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"page.js","sourceRoot":"","sources":["../../src/page.ts"],"names":[],"mappings":"AAAA,6CAA6C;AAE7C,OAAO,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAA;AAElD,OAAO,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAA;AAEtC,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAA;AAC1C,OAAO,EAAE,EAAE,IAAI,QAAQ,EAAE,MAAM,aAAa,CAAA;AAE5C,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAA;AACrC,OAAO,KAAK,OAAO,MAAM,cAAc,CAAA;AAEvC,MAAM,CAAC,MAAM,MAAM,GAAG,iBAA0B,CAAA;AAChD,MAAM,CAAC,MAAM,OAAO,GAAG,CAAU,CAAA;AACjC,MAAM,CAAC,MAAM,YAAY,GAAG,GAAG,CAAA;AAC/B,MAAM,CAAC,MAAM,QAAQ,GAAG,KAAK,CAAA;AAkB7B,MAAM,WAAW,GAAG,CAAC,KAAa,EAAE,OAAoB,EAAE,KAAa,EAAU,EAAE;IACjF,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC;QAC1B,KAAK,EAAE,KAAK;QACZ,GAAG,EAAE,OAAO,CAAC,GAAG,KAAK,IAAI;QACzB,OAAO,EAAE,OAAO,CAAC,OAAO,KAAK,IAAI;QACjC,IAAI,EAAE,OAAO,CAAC,IAAI,IAAI,IAAI;QAC1B,EAAE,EAAE,OAAO,CAAC,EAAE,IAAI,IAAI;QACtB,OAAO,EAAE,OAAO,CAAC,OAAO,KAAK,IAAI;KAClC,CAAC,CAAA;IACF,IAAI,IAAI,GAAG,mBAAmB,CAAA;IAC9B,KAAK,MAAM,IAAI,IAAI,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;QAClD,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,EAAE,EAAE,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,cAAc,CAAC,CAAA;IACnE,CAAC;IACD,OAAO,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,EAAE,EAAE,GAAG,CAAC,CAAA;AAC5C,CAAC,CAAA;AAED,MAAM,YAAY,GAAG,CAAC,MAAc,EAAU,EAAE,CAAC,kBAAkB,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAA;AAE3F,MAAM,YAAY,GAAG,CAAC,IAAY,EAAU,EAAE;IAC5C,IAAI,CAAC;QACH,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAoB,CAAA;QACrE,IAAI,KAAK,CAAC,CAAC,KAAK,CAAC,IAAI,OAAO,KAAK,CAAC,WAAW,KAAK,QAAQ,IAAI,OAAO,KAAK,CAAC,QAAQ,KAAK,QAAQ;YAC5F,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,MAAO,GAAG,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,SAAS,CAAC,CAAA;QACpF,OAAO,KAAe,CAAA;IACxB,CAAC;IAAC,MAAM,CAAC;QACP,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAA;IACtD,CAAC;AACH,CAAC,CAAA;AAED,MAAM,UAAU,GAAG,CAAC,KAAY,EAAE,IAAwB,EAAiB,EAAE;IAC3E,MAAM,QAAQ,GAAG,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,CAAA;IAC7E,IAAI,IAAI,KAAK,SAAS,IAAI,QAAQ,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,uCAAuC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IAChI,MAAM,KAAK,GAAG,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,QAAQ,CAAC,aAAa,CAAC,QAAQ,CAAC,EAAE,CAAA;IACxF,MAAM,GAAG,GAAG,KAAK,CAAC,EAAE,CAAC,OAAO,CAAC,uCAAuC,KAAK,EAAE,CAAC,CAAC,GAAG,EAAE,CAAA;IAClF,OAAO,OAAO,GAAG,EAAE,CAAC,IAAI,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAA;AAC3D,CAAC,CAAA;AAED,iFAAiF;AACjF,MAAM,CAAC,MAAM,IAAI,GAAG,CAAC,KAAY,EAAE,KAAa,EAAE,UAAuB,EAAE,EAAQ,EAAE;IACnF,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,YAAY,CAAA;IAC3C,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;QAC9D,MAAM,IAAI,KAAK,CAAC,mDAAmD,QAAQ,EAAE,CAAC,CAAA;IAChF,CAAC;IACD,MAAM,QAAQ,GAAG,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,CAAC,CAAA;IACnD,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,YAAY,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;IACtF,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,CAAC,WAAW,KAAK,QAAQ,EAAE,CAAC;QAC5D,MAAM,IAAI,KAAK,CAAC,qEAAqE,CAAC,CAAA;IACxF,CAAC;IACD,MAAM,QAAQ,GAAG,MAAM,EAAE,QAAQ,IAAI,UAAU,CAAC,KAAK,EAAE,OAAO,CAAC,IAAI,CAAC,CAAA;IACpE,IAAI,QAAQ,KAAK,IAAI;QAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,EAAE,EAAE,CAAA;IACxE,MAAM,MAAM,GAAG,MAAM,EAAE,MAAM,IAAI,CAAC,CAAA;IAClC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,YAAY,EAAE,GAAG,OAAO,CAAA;IACnE,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;IACpC,MAAM,YAAY,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,KAAK,WAAW,IAAI,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,MAAM;QAChG,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAA;IAC3D,IAAI,OAA+B,CAAA;IACnC,IAAI,UAA8B,CAAA;IAClC,IAAI,OAAO,CAAC,EAAE,KAAK,SAAS,IAAI,CAAC,YAAY,EAAE,CAAC;QAC9C,MAAM,KAAK,GAAG,YAAY,CAAC,KAAK,EAAE,KAAK,EAAE;YACvC,GAAG,YAAY;YACf,IAAI,EAAE,QAAQ;YACd,KAAK,EAAE,KAAK,GAAG,CAAC;YAChB,MAAM;SACP,CAAC,CAAA;QACF,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;QAC/B,IAAI,KAAK,CAAC,MAAM,GAAG,KAAK;YAAE,UAAU,GAAG,MAAM,GAAG,KAAK,CAAA;IACvD,CAAC;SAAM,CAAC;QACN,oEAAoE;QACpE,wEAAwE;QACxE,uEAAuE;QACvE,MAAM,KAAK,GAAkB,EAAE,CAAA;QAC/B,IAAI,SAAS,GAAG,MAAM,CAAA;QACtB,IAAI,OAAO,GAAG,CAAC,CAAA;QACf,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,KAAK,CAAC,CAAA;QAChD,IAAI,SAAS,GAAG,KAAK,CAAA;QACrB,OAAO,KAAK,CAAC,MAAM,GAAG,KAAK,IAAI,OAAO,GAAG,UAAU,EAAE,CAAC;YACpD,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,EAAE,OAAO,EAAE;gBACpC,GAAG,YAAY;gBACf,IAAI,EAAE,QAAQ;gBACd,KAAK,EAAE,CAAC;gBACR,MAAM,EAAE,SAAS;aAClB,CAAC,CAAA;YACF,IAAI,MAAM,CAAC,OAAO,KAAK,CAAC,EAAE,CAAC;gBACzB,SAAS,GAAG,IAAI,CAAA;gBAChB,MAAK;YACP,CAAC;YACD,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC9B,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,CAAC,CAAA;YACjD,CAAC;YACD,SAAS,IAAI,MAAM,CAAC,OAAO,CAAA;YAC3B,OAAO,IAAI,MAAM,CAAC,OAAO,CAAA;QAC3B,CAAC;QACD,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,sEAAsE;YACtE,wEAAwE;YACxE,gEAAgE;YAChE,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,EAAE,OAAO,EAAE;gBACnC,GAAG,YAAY;gBACf,IAAI,EAAE,QAAQ;gBACd,KAAK,EAAE,CAAC;gBACR,MAAM,EAAE,SAAS;aAClB,CAAC,CAAA;YACF,IAAI,KAAK,CAAC,OAAO,GAAG,CAAC;gBAAE,UAAU,GAAG,SAAS,CAAA;QAC/C,CAAC;QACD,OAAO,GAAG,KAAK,CAAA;IACjB,CAAC;IACD,OAAO;QACL,MAAM;QACN,OAAO;QACP,QAAQ;QACR,OAAO;QACP,GAAG,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACjC,IAAI,EAAE,YAAY,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,WAAW,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC;SAClF;KACF,CAAA;AACH,CAAC,CAAA"}

package/dist/src/record.d.ts

@@ -0,0 +1,21 @@
+/** Versioned JSON projection of CAVE-Q matches. */
+import { Record as ClaimRecord } from '@cavelang/store/adapter';
+import type { Store } from '@cavelang/store/adapter';
+import type { Match, Options } from './compile.ts';
+export declare const format: "cave.query-match";
+export declare const version: 1;
+export type t = {
+    readonly format: typeof format;
+    readonly version: typeof version;
+    readonly bindings: Readonly<Record<string, string>>;
+    readonly claim?: ClaimRecord.t;
+    readonly support?: readonly ClaimRecord.t[];
+    readonly at?: Match['at'];
+};
+export declare const of: (store: Store, match: Match) => t;
+/** Decode a persisted query-match record and every nested claim record. */
+export declare const decode: (input: string | unknown) => t;
+export declare const encode: (record: t, space?: number) => string;
+/** Stable library/JSON query surface; raw `query()` remains storage-oriented. */
+export declare const queryRecords: (store: Store, input: string, options?: Options) => t[];
+//# sourceMappingURL=record.d.ts.map

package/dist/src/record.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"record.d.ts","sourceRoot":"","sources":["../../src/record.ts"],"names":[],"mappings":"AAAA,mDAAmD;AAEnD,OAAO,EAAE,MAAM,IAAI,WAAW,EAAE,MAAM,yBAAyB,CAAA;AAC/D,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,yBAAyB,CAAA;AACpD,OAAO,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,cAAc,CAAA;AAGlD,eAAO,MAAM,MAAM,EAAG,kBAA2B,CAAA;AACjD,eAAO,MAAM,OAAO,EAAG,CAAU,CAAA;AAEjC,MAAM,MAAM,CAAC,GAAG;IACd,QAAQ,CAAC,MAAM,EAAE,OAAO,MAAM,CAAA;IAC9B,QAAQ,CAAC,OAAO,EAAE,OAAO,OAAO,CAAA;IAChC,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAA;IACnD,QAAQ,CAAC,KAAK,CAAC,EAAE,WAAW,CAAC,CAAC,CAAA;IAC9B,QAAQ,CAAC,OAAO,CAAC,EAAE,SAAS,WAAW,CAAC,CAAC,EAAE,CAAA;IAC3C,QAAQ,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAA;CAC1B,CAAA;AAED,eAAO,MAAM,EAAE,GAAI,OAAO,KAAK,EAAE,OAAO,KAAK,KAAG,CAO9C,CAAA;AAKF,2EAA2E;AAC3E,eAAO,MAAM,MAAM,GAAI,OAAO,MAAM,GAAG,OAAO,KAAG,CAqBhD,CAAA;AAED,eAAO,MAAM,MAAM,GAAI,QAAQ,CAAC,EAAE,QAAQ,MAAM,KAAG,MACT,CAAA;AAE1C,iFAAiF;AACjF,eAAO,MAAM,YAAY,GACvB,OAAO,KAAK,EACZ,OAAO,MAAM,EACb,UAAS,OAAY,KACpB,CAAC,EAAiE,CAAA"}

package/dist/src/record.js

@@ -0,0 +1,41 @@
+/** Versioned JSON projection of CAVE-Q matches. */
+import { Record as ClaimRecord } from '@cavelang/store/adapter';
+import { query } from "./bounded.js";
+export const format = 'cave.query-match';
+export const version = 1;
+export const of = (store, match) => ({
+    format,
+    version,
+    bindings: match.bindings,
+    ...(match.row === undefined ? {} : { claim: store.recordOf(match.row) }),
+    ...(match.rows === undefined ? {} : { support: match.rows.map(store.recordOf) }),
+    ...(match.at === undefined ? {} : { at: match.at }),
+});
+const object = (value) => typeof value === 'object' && value !== null && !Array.isArray(value);
+/** Decode a persisted query-match record and every nested claim record. */
+export const decode = (input) => {
+    const value = typeof input === 'string' ? JSON.parse(input) : input;
+    if (!object(value) || value['format'] !== format) {
+        throw new Error(`CAVE query record: expected format ${JSON.stringify(format)}`);
+    }
+    if (value['version'] !== version) {
+        throw new Error(`CAVE query record: unsupported ${format} version ${JSON.stringify(value['version'])}`);
+    }
+    if (!object(value['bindings']) ||
+        !Object.values(value['bindings']).every(binding => typeof binding === 'string') ||
+        (value['support'] !== undefined && !Array.isArray(value['support']))) {
+        throw new Error(`CAVE query record: malformed ${format}/v${version}`);
+    }
+    const decoded = value;
+    return {
+        ...decoded,
+        ...(decoded.claim === undefined ? {} : { claim: ClaimRecord.decode(decoded.claim) }),
+        ...(decoded.support === undefined ? {} : {
+            support: decoded.support.map(record => ClaimRecord.decode(record))
+        }),
+    };
+};
+export const encode = (record, space) => JSON.stringify(record, undefined, space);
+/** Stable library/JSON query surface; raw `query()` remains storage-oriented. */
+export const queryRecords = (store, input, options = {}) => query(store, input, options).map(match => of(store, match));
+//# sourceMappingURL=record.js.map

package/dist/src/record.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"record.js","sourceRoot":"","sources":["../../src/record.ts"],"names":[],"mappings":"AAAA,mDAAmD;AAEnD,OAAO,EAAE,MAAM,IAAI,WAAW,EAAE,MAAM,yBAAyB,CAAA;AAG/D,OAAO,EAAE,KAAK,EAAE,MAAM,cAAc,CAAA;AAEpC,MAAM,CAAC,MAAM,MAAM,GAAG,kBAA2B,CAAA;AACjD,MAAM,CAAC,MAAM,OAAO,GAAG,CAAU,CAAA;AAWjC,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,KAAY,EAAE,KAAY,EAAK,EAAE,CAAC,CAAC;IACpD,MAAM;IACN,OAAO;IACP,QAAQ,EAAE,KAAK,CAAC,QAAQ;IACxB,GAAG,CAAC,KAAK,CAAC,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;IACxE,GAAG,CAAC,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;IAChF,GAAG,CAAC,KAAK,CAAC,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC;CACpD,CAAC,CAAA;AAEF,MAAM,MAAM,GAAG,CAAC,KAAc,EAAoC,EAAE,CAClE,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;AAEtE,2EAA2E;AAC3E,MAAM,CAAC,MAAM,MAAM,GAAG,CAAC,KAAuB,EAAK,EAAE;IACnD,MAAM,KAAK,GAAY,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAA;IAC5E,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,KAAK,MAAM,EAAE,CAAC;QACjD,MAAM,IAAI,KAAK,CAAC,sCAAsC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;IACjF,CAAC;IACD,IAAI,KAAK,CAAC,SAAS,CAAC,KAAK,OAAO,EAAE,CAAC;QACjC,MAAM,IAAI,KAAK,CAAC,kCAAkC,MAAM,YAAY,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAA;IACzG,CAAC;IACD,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QAC1B,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,OAAO,KAAK,QAAQ,CAAC;QAC/E,CAAC,KAAK,CAAC,SAAS,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;QACzE,MAAM,IAAI,KAAK,CAAC,gCAAgC,MAAM,KAAK,OAAO,EAAE,CAAC,CAAA;IACvE,CAAC;IACD,MAAM,OAAO,GAAG,KAAU,CAAA;IAC1B,OAAO;QACL,GAAG,OAAO;QACV,GAAG,CAAC,OAAO,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACpF,GAAG,CAAC,OAAO,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACvC,OAAO,EAAE,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;SACnE,CAAC;KACH,CAAA;AACH,CAAC,CAAA;AAED,MAAM,CAAC,MAAM,MAAM,GAAG,CAAC,MAAS,EAAE,KAAc,EAAU,EAAE,CAC1D,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,EAAE,KAAK,CAAC,CAAA;AAE1C,iFAAiF;AACjF,MAAM,CAAC,MAAM,YAAY,GAAG,CAC1B,KAAY,EACZ,KAAa,EACb,UAAmB,EAAE,EAChB,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAA"}

package/package.json

@@ -1,8 +1,18 @@
 {
   "name": "@cavelang/query",
-  "version": "0.27.14",
+  "version": "0.29.1",
   "type": "module",
-  "description": "CAVE-Q — graph-pattern queries (?x vars, wildcards, inverse verbs, transitive hops, WHERE filters) compiled to SQL.",
+  "description": "CAVE-Q — graph-pattern queries with variables, lifecycle and inverse verbs, transitive hops, and filters.",
+  "keywords": [
+    "cave",
+    "knowledge-graph",
+    "knowledge-representation",
+    "typescript"
+  ],
+  "homepage": "https://github.com/mirek/cave#readme",
+  "bugs": {
+    "url": "https://github.com/mirek/cave/issues"
+  },
   "license": "CC0-1.0",
   "author": "Mirek Rusin (https://github.com/mirek)",
   "repository": {
@@ -20,26 +30,29 @@
     }
   },
   "files": [
+    "bench",
     "dist",
     "!dist/test",
     "!dist/tsconfig.tsbuildinfo",
     "src",
     "!src/**/*.test.ts",
     "README.md",
-    "License.md"
+    "License.md",
+    "Authors.md"
   ],
   "publishConfig": {
     "access": "public"
   },
   "dependencies": {
-    "@cavelang/canonical": "0.27.14",
-    "@cavelang/parser": "0.27.14",
-    "@cavelang/core": "0.27.14",
-    "@cavelang/store": "0.27.14"
+    "@cavelang/canonical": "0.29.1",
+    "@cavelang/parser": "0.29.1",
+    "@cavelang/store": "0.29.1",
+    "@cavelang/core": "0.29.1"
   },
   "scripts": {
+    "bench:transitive": "node --disable-warning=ExperimentalWarning bench/transitive.ts",
     "build": "tsc -b",
-    "test": "node --disable-warning=ExperimentalWarning --test 'test/*.test.ts'",
+    "test": "node --disable-warning=ExperimentalWarning --test \"test/*.test.ts\"",
     "typecheck": "tsc -b"
   }
 }

package/src/bounded.ts

@@ -1,9 +1,10 @@
 import { Value } from '@cavelang/core'
-import type { Store } from '@cavelang/store'
+import type { Store } from '@cavelang/store/adapter'
 import * as Compile from './compile.ts'
 import * as Pattern from './pattern.ts'
 
 export type { Match, Options } from './compile.ts'
+export type { Window } from './compile.ts'
 
 /**
  * Compile historical queries against vocabulary reconstructed at the same
@@ -25,17 +26,17 @@ const storeAtBoundary = (store: Store, options: Compile.Options): Store => {
  * value filter pushes the normalized comparison into SQL; the final check
  * preserves exact unit and approximation semantics.
  */
-export const match = (
+const execute = (
   store: Store,
   pattern: Pattern.t,
   options: Compile.Options = {}
-): Compile.Match[] => {
+): Compile.Window => {
   if (pattern.payload.kind !== 'attribute' || pattern.payload.value.kind !== 'term') {
-    return Compile.match(storeAtBoundary(store, options), pattern, options)
+    return Compile.window(storeAtBoundary(store, options), pattern, options)
   }
   const value = Value.parse(pattern.payload.value.text)
   if (value.kind !== 'number' || value.num === undefined) {
-    return Compile.match(storeAtBoundary(store, options), pattern, options)
+    return Compile.window(storeAtBoundary(store, options), pattern, options)
   }
   const expectedNum = value.num
   const filter: Pattern.Filter = {
@@ -53,16 +54,28 @@ export const match = (
   }
   const expectedUnit = value.unit ?? null
   const expectedApprox = value.approx ? 1 : 0
-  return Compile.match(storeAtBoundary(store, options), normalized, options)
-    .filter(result => {
-      const row = result.row
-      return row !== undefined &&
-        row.value_num === expectedNum &&
-        row.value_unit === expectedUnit &&
-        row.value_approx === expectedApprox
-    })
+  const result = Compile.window(storeAtBoundary(store, options), normalized, options)
+  return { ...result, matches: result.matches.filter(match => {
+    const row = match.row
+    return row !== undefined &&
+      row.value_num === expectedNum &&
+      row.value_unit === expectedUnit &&
+      row.value_approx === expectedApprox
+  }) }
 }
 
+export const window = (
+  store: Store,
+  pattern: Pattern.t,
+  options: Compile.Options = {}
+): Compile.Window => execute(store, pattern, options)
+
+export const match = (
+  store: Store,
+  pattern: Pattern.t,
+  options: Compile.Options = {}
+): Compile.Match[] => execute(store, pattern, options).matches
+
 export const query = (
   store: Store,
   input: string,

package/src/compile.ts

@@ -14,16 +14,22 @@
  * on the object side.
  *
  * Transitive patterns (`terrier EXTENDS+ animal`) compile to a recursive
- * CTE over current, positive, non-retracted edges (depth-capped at 32).
+ * CTE over current, positive, non-retracted edges. Recursive state is the
+ * reachable endpoint pair itself, so SQL `UNION` deduplication terminates
+ * cycles without an arbitrary semantic depth cap.
  */
 
-import { Time, Uuidv7, Value } from '@cavelang/core'
+import { Time, Value } from '@cavelang/core'
 import { Registry } from '@cavelang/canonical'
-import { Resolve, Row } from '@cavelang/store'
-import type { Store } from '@cavelang/store'
+import { QuerySql, Resolve, Row } from '@cavelang/store/adapter'
+import type { Store } from '@cavelang/store/adapter'
 import * as Pattern from './pattern.ts'
 
-/** One query solution: variable bindings plus the matched row (absent for transitive hops). */
+/**
+ * One storage-oriented query solution. `row`/`rows` expose SQLite-shaped
+ * data for in-process reasoning engines; use `queryRecords()` for versioned
+ * public JSON and cross-process integrations.
+ */
 export type Match = {
   readonly bindings: Readonly<Record<string, string>>
   readonly row?: Row.t
@@ -43,6 +49,10 @@ export type Match = {
 }
 
 export type Options = {
+  /** Maximum rows SQLite may return. Prefer the snapshot-aware page API for continuations. */
+  readonly limit?: number
+  /** Internal SQL offset used by the snapshot-aware page API. */
+  readonly offset?: number
   /** Match all appended rows, not only current beliefs. */
   readonly all?: boolean
   /**
@@ -100,47 +110,44 @@ export type Options = {
 }
 
 /**
- * UUIDv7 interval `[lo, hi)` for a tx filter value: a bare date covers the
- * whole UTC day, a timestamp covers one second. Interval semantics keep
- * adjacent operators distinguishable (`<=` includes the boundary day that
- * `<` excludes) and make `WHERE tx = 2026-01-01` mean "recorded that day".
+ * UUIDv7 interval `[lo, hi)` for a tx filter value: a date-like value covers
+ * its whole UTC period and a timestamp covers one second. Interval semantics
+ * keep adjacent operators distinguishable (`<=` includes the boundary period
+ * that `<` excludes) and make `WHERE tx = 2026-01-01` mean "recorded that day".
  */
 const txBounds = (text: string, label = 'tx date'): { lo: string, hi: string } => {
-  const hasTime = text.includes('T')
-  const start = Date.parse(hasTime ? text : `${text}T00:00:00Z`)
-  if (Number.isNaN(start)) {
+  const bounds = QuerySql.transactionBounds(text)
+  if (bounds === undefined) {
     throw new Error(`CAVE-Q: cannot parse ${label} ${JSON.stringify(text)}`)
   }
-  const end = start + (hasTime ? 1_000 : 86_400_000)
-  return { lo: Uuidv7.at(start, 0, new Uint8Array(8)), hi: Uuidv7.at(end, 0, new Uint8Array(8)) }
+  return bounds
 }
 
 /**
  * SQL tx condition for an as-of boundary (spec §12.3). A UUIDv7 names an
- * exact transaction, included — belief as of that append; a date or
- * timestamp is inclusive of the whole named day/second, the same interval
+ * exact transaction, included — belief as of that append; a date-like value
+ * or timestamp is inclusive of the whole named period/second, the same interval
  * semantics as `WHERE tx <=` (§12.2). Both forms inline as literals: the
- * id is shape-validated hex-and-dashes and the interval bound comes from
- * `Uuidv7.at` — no free-form text reaches the SQL, and a literal keeps
+ * id is shape-validated hex-and-dashes and the interval bound is a generated
+ * UUIDv7 — no free-form text reaches the SQL, and a literal keeps
  * the fragment embeddable in CTEs that positional parameters would
  * complicate.
  */
-const asOfCondition = (asOf: string): string => {
-  const id = asOf.toLowerCase()
-  return Uuidv7.is(id) ? `tx <= '${id}'` : `tx < '${txBounds(asOf, 'as-of boundary').hi}'`
+const asOfBoundary = (asOf: string): QuerySql.AsOfBoundary => {
+  const boundary = QuerySql.asOfBoundary(asOf)
+  if (boundary === undefined) {
+    throw new Error(`CAVE-Q: cannot parse as-of boundary ${JSON.stringify(asOf)}`)
+  }
+  return boundary
 }
 
 /** Row universe under resolution: every appended row, or only rows recorded up to the as-of boundary. */
 const claimsSql = (asOf: undefined | string): string =>
-  asOf === undefined ? 'cave_claim' : `(SELECT * FROM cave_claim WHERE ${asOfCondition(asOf)})`
+  asOf === undefined ? QuerySql.claims() :
+    QuerySql.claims(asOfBoundary(asOf))
 
-const currentSql = (asOf: undefined | string): string => `
-SELECT c.* FROM cave_claim c
-JOIN (
-  SELECT claim_key, MAX(tx) AS max_tx
-  FROM ${claimsSql(asOf)} GROUP BY claim_key
-) latest ON c.claim_key = latest.claim_key AND c.tx = latest.max_tx
-`
+const currentSql = (asOf: undefined | string): string =>
+  QuerySql.current(claimsSql(asOf))
 
 /**
  * Row universe a pattern matches over: the full history under `all`,
@@ -173,23 +180,12 @@ const baseSql = (options: Options, policy: undefined | readonly Resolve.Entry[])
  * and the closure reconstructs entity resolution as believed then
  * (spec §12.3).
  */
-const aliasPairSql = (asOf: undefined | string): string => `alias_edge(a, b) AS (
-  SELECT c.subject, c.object FROM (${currentSql(asOf)}) c
-  WHERE c.verb = 'ALIAS' AND c.negated = 0 AND c.conf > 0 AND c.object IS NOT NULL
-    AND ${Row.entityTermSql('c.subject')} AND ${Row.entityTermSql('c.object')}
-  UNION
-  SELECT c.object, c.subject FROM (${currentSql(asOf)}) c
-  WHERE c.verb = 'ALIAS' AND c.negated = 0 AND c.conf > 0 AND c.object IS NOT NULL
-    AND ${Row.entityTermSql('c.subject')} AND ${Row.entityTermSql('c.object')}
-), alias_pair(a, b) AS (
-  SELECT a, b FROM alias_edge
-  UNION
-  SELECT p.a, e.b FROM alias_pair p JOIN alias_edge e ON e.a = p.b
-)`
+const aliasPairSql = (asOf: undefined | string): string =>
+  QuerySql.aliasPairs(currentSql(asOf))
 
 /** SQL for "these two expressions name the same entity" under the closure. */
 const aliasSame = (left: string, right: string): string =>
-  `(${left} = ${right} OR EXISTS (SELECT 1 FROM alias_pair p WHERE p.a = ${left} AND p.b = ${right}))`
+  QuerySql.aliasSame(left, right)
 
 type Compiled = {
   readonly sql: string
@@ -200,7 +196,20 @@ type Compiled = {
   readonly valueVars: readonly string[]
 }
 
-const compile = (pattern: Pattern.t, registry: Registry.t, options: Options, policy?: readonly Resolve.Entry[]): Compiled => {
+const bounded = (compiled: Compiled, options: Options): Compiled => {
+  if (options.limit === undefined) return compiled
+  if (!Number.isInteger(options.limit) || options.limit < 1 ||
+      !Number.isInteger(options.offset ?? 0) || (options.offset ?? 0) < 0) {
+    throw new Error('CAVE-Q: limit must be positive and offset must be non-negative')
+  }
+  return {
+    ...compiled,
+    sql: `${compiled.sql}\nLIMIT ? OFFSET ?`,
+    params: [...compiled.params, options.limit, options.offset ?? 0]
+  }
+}
+
+export const compile = (pattern: Pattern.t, registry: Registry.t, options: Options, policy?: readonly Resolve.Entry[]): Compiled => {
   // Inverse resolution (spec §12.1): swap the pattern's endpoint slots and
   // query the primary verb.
   let verb = pattern.verb
@@ -217,11 +226,15 @@ const compile = (pattern: Pattern.t, registry: Registry.t, options: Options, pol
       objectSlot = subjectSlot
       subjectSlot = swapped
       verb = { kind: 'verb', name: primary, transitive: verb.transitive }
+    } else {
+      // A lifecycle alias keeps direction but resolves to the stable
+      // storage spelling before SQL is compiled (spec §5.8).
+      verb = { kind: 'verb', name: primary, transitive: verb.transitive }
     }
   }
 
   if (verb.kind === 'verb' && verb.transitive) {
-    return compileTransitive(pattern, verb.name, subjectSlot, objectSlot, options, policy)
+    return bounded(compileTransitive(pattern, verb.name, subjectSlot, objectSlot, options, policy), options)
   }
 
   const aliases = options.aliases === true
@@ -390,7 +403,7 @@ const compile = (pattern: Pattern.t, registry: Registry.t, options: Options, pol
   const valueVars = [...varColumns]
     .filter(([, columns]) => columns[0] === 'value_text')
     .map(([name]) => name)
-  return { sql, params, bind, transitive: false, valueVars }
+  return bounded({ sql, params, bind, transitive: false, valueVars }, options)
 }
 
 const compileTransitive = (
@@ -412,19 +425,23 @@ const compileTransitive = (
     aliases ? aliasSame(left, right) : `${left} = ${right}`
   const conditions: string[] = []
   const params: (string | number)[] = [verb]
+  const pushTerm = (term: string): void => {
+    params.push(term)
+    if (aliases) params.push(term)
+  }
+  // A concrete source gives forward recursion its smallest seed. If only the
+  // destination is concrete, recurse backwards over the object index. Both
+  // forms retain normal (src, dst) orientation in their output.
+  const direction = subjectSlot.kind === 'term' ? 'forward' :
+    objectSlot?.kind === 'term' ? 'reverse' : 'all-pairs'
   if (subjectSlot.kind === 'term') {
-    conditions.push(same('h.src', '?'))
-    params.push(subjectSlot.text)
-    if (aliases) {
-      params.push(subjectSlot.text)
-    }
+    pushTerm(subjectSlot.text)
+  } else if (objectSlot?.kind === 'term') {
+    pushTerm(objectSlot.text)
   }
-  if (objectSlot?.kind === 'term') {
+  if (objectSlot?.kind === 'term' && direction !== 'reverse') {
     conditions.push(same('h.dst', '?'))
-    params.push(objectSlot.text)
-    if (aliases) {
-      params.push(objectSlot.text)
-    }
+    pushTerm(objectSlot.text)
   }
   // A repeated variable forces equality here just as in single-hop
   // patterns: `?x EXTENDS+ ?x` asks for nodes on a cycle, not for every
@@ -433,38 +450,74 @@ const compileTransitive = (
     conditions.push(same('h.src', 'h.dst'))
   }
   const withRecursive = `WITH RECURSIVE ${aliases ? `${aliasPairSql(options.asOf)}, ` : ''}`
-  const hopsSql = `hops(src, dst, depth) AS (
-  SELECT src, dst, 1 FROM cur
+  // Reachable pairs are the complete recursive state. UNION (not UNION ALL)
+  // deduplicates each pair before it can be expanded again, so a finite graph
+  // reaches a fixed point even with cycles and no hop-depth cutoff.
+  const seedSql = direction === 'forward' ?
+    `SELECT src, dst FROM cur WHERE ${same('src', '?')}` :
+    direction === 'reverse' ?
+      `SELECT src, dst FROM cur WHERE ${same('dst', '?')}` :
+      'SELECT src, dst FROM cur'
+  const recursiveSql = direction === 'reverse' ?
+    `SELECT cur.src, h.dst FROM hops h JOIN cur ON ${same('cur.dst', 'h.src')}` :
+    `SELECT h.src, cur.dst FROM hops h JOIN cur ON ${same('cur.src', 'h.dst')}`
+  const hopsSql = `hops(src, dst) AS (
+  ${seedSql}
+  UNION
+  ${recursiveSql}
+)`
+  // Support (an opt-in): propagate each edge id with every reachable pair it
+  // supports. The triple is finite and UNION-deduplicated like `hops`, while
+  // preserving forward/reverse seeding instead of rebuilding all-pairs
+  // reachability merely to recover path evidence.
+  const supportAddedSql = direction === 'reverse' ?
+    `SELECT cur.src, h.dst, cur.edge_id FROM hops h JOIN cur ON ${same('cur.dst', 'h.src')}` :
+    `SELECT h.src, cur.dst, cur.edge_id FROM hops h JOIN cur ON ${same('cur.src', 'h.dst')}`
+  const supportRecursiveSql = direction === 'reverse' ?
+    `SELECT cur.src, s.dst, s.edge_id FROM support s JOIN cur ON ${same('cur.dst', 's.src')}` :
+    `SELECT s.src, cur.dst, s.edge_id FROM support s JOIN cur ON ${same('cur.src', 's.dst')}`
+  const supportSql = `support(src, dst, edge_id) AS (
+  SELECT h.src, h.dst, cur.edge_id FROM hops h JOIN cur
+    ON ${same('cur.src', 'h.src')} AND ${same('cur.dst', 'h.dst')}
+  UNION
+  ${supportAddedSql}
   UNION
-  SELECT h.src, cur.dst, h.depth + 1 FROM hops h JOIN cur ON ${same('cur.src', 'h.dst')}
-  WHERE h.depth < 32
+  ${supportRecursiveSql}
 )`
-  // Support (an opt-in): an edge row backs a pair when its endpoints sit
-  // on some path between them — reflexive or through the same hop
-  // closure, so alias-equal endpoints connect exactly as matching did.
+  const aliasedSelect = (() => {
+    if (!aliases) return 'SELECT DISTINCT h.src AS src, h.dst AS dst FROM hops h'
+    // Alias widening can produce several physical endpoint pairs with the
+    // same visible bindings. Project unbound slots to constants before
+    // DISTINCT so SQL-level pagination sees the same solutions match()
+    // exposes, rather than duplicate pairs that only collapse afterwards.
+    const repeated = subjectSlot.kind === 'var' && objectSlot?.kind === 'var' &&
+      subjectSlot.name === objectSlot.name
+    const src = subjectSlot.kind === 'var' ? repeated ? 'h.dst' : 'h.src' : "''"
+    const dst = objectSlot?.kind === 'var' ? 'h.dst' : "''"
+    return `SELECT DISTINCT ${src} AS src, ${dst} AS dst FROM hops h`
+  })()
   const sql = options.support === true ? `
 ${withRecursive}edge AS (
   SELECT c.* FROM (${base}) c
   WHERE c.verb = ? AND c.negated = 0 AND c.conf > 0 AND c.object IS NOT NULL
 ), cur AS (
-  SELECT DISTINCT subject AS src, object AS dst FROM edge
-), ${hopsSql}, pair(src, dst) AS (
+  SELECT subject AS src, object AS dst, id AS edge_id FROM edge
+), ${hopsSql}, ${supportSql}, pair(src, dst) AS (
   SELECT DISTINCT h.src, h.dst FROM hops h
   ${conditions.length > 0 ? `WHERE ${conditions.join(' AND ')}` : ''}
 )
 SELECT p.src AS src, p.dst AS dst, e.*
-FROM pair p JOIN edge e
-  ON (${same('e.subject', 'p.src')} OR EXISTS (SELECT 1 FROM hops f WHERE ${same('f.src', 'p.src')} AND ${same('f.dst', 'e.subject')}))
- AND (${same('e.object', 'p.dst')} OR EXISTS (SELECT 1 FROM hops b WHERE ${same('b.src', 'e.object')} AND ${same('b.dst', 'p.dst')}))
+FROM pair p JOIN support s ON ${same('s.src', 'p.src')} AND ${same('s.dst', 'p.dst')}
+JOIN edge e ON e.id = s.edge_id
 ORDER BY p.src, p.dst, e.tx` : `
 ${withRecursive}cur AS (
   SELECT c.subject AS src, c.object AS dst
   FROM (${base}) c
   WHERE c.verb = ? AND c.negated = 0 AND c.conf > 0 AND c.object IS NOT NULL
 ), ${hopsSql}
-SELECT DISTINCT h.src AS src, h.dst AS dst FROM hops h
+${aliasedSelect}
 ${conditions.length > 0 ? `WHERE ${conditions.join(' AND ')}` : ''}
-ORDER BY h.src, h.dst`
+ORDER BY src, dst`
   const bind = (row: Record<string, unknown>): Record<string, string> => {
     const bindings: Record<string, string> = {}
     if (subjectSlot.kind === 'var') {
@@ -528,7 +581,14 @@ const evaluateAt = (
  * (the §24 rules engine substitutes bindings into premise patterns
  * between joins) rather than as text.
  */
-export const match = (store: Store, pattern: Pattern.t, options: Options = {}): Match[] => {
+export type Window = {
+  /** Matches remaining after any valid-time evaluation. */
+  readonly matches: Match[]
+  /** Rows returned by SQLite before valid-time evaluation. */
+  readonly scanned: number
+}
+
+const run = (store: Store, pattern: Pattern.t, options: Options = {}): Window => {
   const instant = options.at === undefined ? undefined : Time.parseInstant(options.at)
   if (options.at !== undefined && instant === undefined) {
     throw new Error(
@@ -564,7 +624,10 @@ export const match = (store: Store, pattern: Pattern.t, options: Options = {}):
         entry.rows.push(row as unknown as Row.t)
       }
     }
-    return [...matches.values()].map(entry => ({ bindings: entry.bindings, rows: entry.rows }))
+    return {
+      scanned: rows.length,
+      matches: [...matches.values()].map(entry => ({ bindings: entry.bindings, rows: entry.rows }))
+    }
   }
   if (compiled.transitive && options.aliases === true) {
     // Distinct (src, dst) pairs can repeat a binding set when an endpoint
@@ -572,7 +635,7 @@ export const match = (store: Store, pattern: Pattern.t, options: Options = {}):
     // transitive match carries no row, so identical bindings are identical
     // answers.
     const seen = new Set<string>()
-    return rows.flatMap(row => {
+    return { scanned: rows.length, matches: rows.flatMap(row => {
       const bindings = compiled.bind(row)
       const key = JSON.stringify(bindings)
       if (seen.has(key)) {
@@ -580,18 +643,21 @@ export const match = (store: Store, pattern: Pattern.t, options: Options = {}):
       }
       seen.add(key)
       return [{ bindings }]
-    })
+    }) }
   }
   if (compiled.transitive) {
-    return rows.map(row => ({ bindings: compiled.bind(row) }))
+    return { scanned: rows.length, matches: rows.map(row => ({ bindings: compiled.bind(row) })) }
   }
   if (instant === undefined) {
-    return rows.map(row => ({ bindings: compiled.bind(row), row: row as unknown as Row.t }))
+    return {
+      scanned: rows.length,
+      matches: rows.map(row => ({ bindings: compiled.bind(row), row: row as unknown as Row.t }))
+    }
   }
   // Valid-time pass (spec §32.4): contexts are read per row — coverage
   // needs period interpretation no SQL expression can do.
   const contextsOf = store.db.prepare('SELECT context FROM cave_context WHERE claim_id = ?')
-  return rows.flatMap(row => {
+  return { scanned: rows.length, matches: rows.flatMap(row => {
     const contexts = (contextsOf.all(String(row['id'])) as { context: string }[])
       .map(entry => entry.context)
     if (!Time.appliesAt(contexts, instant)) {
@@ -606,5 +672,12 @@ export const match = (store: Store, pattern: Pattern.t, options: Options = {}):
       bindings[name] = at.text
     }
     return [{ bindings, row: row as unknown as Row.t, at }]
-  })
+  }) }
 }
+
+/** Execute one SQL window and report how many pre-filter rows it consumed. */
+export const window = (store: Store, pattern: Pattern.t, options: Options = {}): Window =>
+  run(store, pattern, options)
+
+export const match = (store: Store, pattern: Pattern.t, options: Options = {}): Match[] =>
+  run(store, pattern, options).matches

package/src/index.ts

@@ -16,3 +16,7 @@
 export * as Pattern from './pattern.ts'
 export { match, query } from './bounded.ts'
 export type { Match, Options } from './bounded.ts'
+export { queryRecords } from './record.ts'
+export * as Record from './record.ts'
+export { defaultLimit, maxLimit, page } from './page.ts'
+export type { Page, PageOptions } from './page.ts'