@earendil-works/chord 1.3.0 → 1.5.0

package/dist/next/store/evaluate.js

@@ -0,0 +1,128 @@
+// The JavaScript evaluator of the compiled table vocabulary (slice 6a §6; rule 10): the `tx.get` overlay matches
+// `where` nodes and applies `set` nodes with SQL's three-valued `NULL` rules and code point text order, as the SQL
+// that `sql.ts` renders from the same nodes does in SQLite.
+import { invalid } from "../data/internal.js";
+import { compareText } from "./text.js";
+/** Whether `row` matches `node` under SQL's rules: unknown (`NULL`) does not match. */
+export function matches(node, row) {
+    return truth(node, row) === true;
+}
+function truth(node, row) {
+    if ("and" in node)
+        return node.and.reduce((all, each) => (all === false ? false : both(all, truth(each, row))), true);
+    if ("or" in node)
+        return node.or.reduce((any, each) => (any === true ? true : either(any, truth(each, row))), false);
+    if ("not" in node) {
+        const inner = truth(node.not, row);
+        return inner === null ? null : !inner;
+    }
+    if ("isNull" in node)
+        return row[node.isNull] === undefined;
+    // The row is checked against the table the condition was compiled for: its columns hold scalars.
+    if ("inArray" in node) {
+        const [column, values] = node.inArray;
+        // SQL: `x IN ()` is false, for a `NULL` x too.
+        if (values.length === 0)
+            return false;
+        const value = row[column];
+        return value === undefined ? null : values.some((each) => compareScalar(value, each) === 0);
+    }
+    if ("prefix" in node) {
+        const value = row[node.prefix[0]];
+        return value === undefined ? null : value.startsWith(node.prefix[1]);
+    }
+    // The remaining nodes are the comparisons, one entry each; `Object.entries` loses that.
+    const [op, [column, operand]] = Object.entries(node)[0];
+    const value = row[column];
+    if (value === undefined)
+        return null;
+    const order = compareScalar(value, operand);
+    switch (op) {
+        case "eq":
+            return order === 0;
+        case "ne":
+            return order !== 0;
+        case "lt":
+            return order < 0;
+        case "lte":
+            return order <= 0;
+        case "gt":
+            return order > 0;
+        case "gte":
+            return order >= 0;
+    }
+}
+function both(a, b) {
+    if (a === false || b === false)
+        return false;
+    return a === null || b === null ? null : true;
+}
+function either(a, b) {
+    if (a === true || b === true)
+        return true;
+    return a === null || b === null ? null : false;
+}
+/** Orders two cells of one column as SQLite does: text by code point, booleans as 0 and 1, numbers numerically. */
+export function compareScalar(a, b) {
+    if (typeof a === "string")
+        return compareText(a, b);
+    return Number(a) - Number(b);
+}
+const SAFE = Number.MAX_SAFE_INTEGER;
+/**
+ * `row` after `set`, every right side evaluated against `row` (simultaneous: `{ a: b, b: a }` swaps); an integer
+ * result outside ±(2^53 - 1) throws `invalid/args` (rule 10), as the column's `CHECK` fails the step.
+ */
+export function applySet(set, row, table) {
+    const next = { ...row };
+    for (const [column, node] of Object.entries(set)) {
+        const value = evaluate(node, row, table);
+        if (value === undefined)
+            delete next[column];
+        else
+            next[column] = value;
+    }
+    return next;
+}
+function evaluate(node, row, table) {
+    if (node === null)
+        return undefined;
+    if (typeof node !== "object")
+        return node;
+    if ("col" in node)
+        return row[node.col];
+    if ("json" in node)
+        return node.json;
+    if ("when" in node) {
+        const [condition, a, b] = node.when;
+        return evaluate(matches(condition, row) ? a : b, row, table);
+    }
+    if ("coalesce" in node)
+        return evaluate(node.coalesce[0], row, table) ?? evaluate(node.coalesce[1], row, table);
+    if ("replacePrefix" in node) {
+        const [subject, from, to] = node.replacePrefix;
+        const value = evaluate(subject, row, table);
+        return value === undefined || !value.startsWith(from) ? value : to + value.slice(from.length);
+    }
+    // The remaining nodes are the arithmetic and text operations, one entry each, over scalar operands (compiled so).
+    const [op, [x, y]] = Object.entries(node)[0];
+    const a = evaluate(x, row, table);
+    const b = evaluate(y, row, table);
+    if (a === undefined || b === undefined)
+        return undefined;
+    switch (op) {
+        case "concat":
+            return a + b;
+        case "max":
+            return compareScalar(a, b) >= 0 ? a : b;
+        case "min":
+            return compareScalar(a, b) <= 0 ? a : b;
+        default: {
+            const result = op === "add" ? a + b : a - b;
+            if (result > SAFE || result < -SAFE)
+                throw invalid("args", `${table}: ${op} gives ${result}, outside ±(2^53 - 1)`);
+            return result;
+        }
+    }
+}
+//# sourceMappingURL=evaluate.js.map

package/dist/next/store/evaluate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"evaluate.js","sourceRoot":"","sources":["../../../src/next/store/evaluate.ts"],"names":[],"mappings":"AAAA,iHAAiH;AACjH,mHAAmH;AACnH,4DAA4D;AAG5D,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAG9C,OAAO,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AAQxC,uFAAuF;AACvF,MAAM,UAAU,OAAO,CAAC,IAAe,EAAE,GAAiB;IACzD,OAAO,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,KAAK,IAAI,CAAC;AAClC,CAAC;AAED,SAAS,KAAK,CAAC,IAAe,EAAE,GAAiB;IAChD,IAAI,KAAK,IAAI,IAAI;QAChB,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,CAAQ,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAC3G,IAAI,IAAI,IAAI,IAAI;QACf,OAAO,IAAI,CAAC,EAAE,CAAC,MAAM,CAAQ,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAC3G,IAAI,KAAK,IAAI,IAAI,EAAE,CAAC;QACnB,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACnC,OAAO,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;IACvC,CAAC;IACD,IAAI,QAAQ,IAAI,IAAI;QAAE,OAAO,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,SAAS,CAAC;IAC5D,iGAAiG;IACjG,IAAI,SAAS,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC;QACtC,+CAA+C;QAC/C,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QACtC,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,CAAuB,CAAC;QAChD,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,aAAa,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAC7F,CAAC;IACD,IAAI,QAAQ,IAAI,IAAI,EAAE,CAAC;QACtB,MAAM,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAuB,CAAC;QACxD,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACtE,CAAC;IACD,wFAAwF;IACxF,MAAM,CAAC,EAAE,EAAE,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAA4C,CAAC;IACnG,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,CAAuB,CAAC;IAChD,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IACrC,MAAM,KAAK,GAAG,aAAa,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAC5C,QAAQ,EAAE,EAAE,CAAC;QACZ,KAAK,IAAI;YACR,OAAO,KAAK,KAAK,CAAC,CAAC;QACpB,KAAK,IAAI;YACR,OAAO,KAAK,KAAK,CAAC,CAAC;QACpB,KAAK,IAAI;YACR,OAAO,KAAK,GAAG,CAAC,CAAC;QAClB,KAAK,KAAK;YACT,OAAO,KAAK,IAAI,CAAC,CAAC;QACnB,KAAK,IAAI;YACR,OAAO,KAAK,GAAG,CAAC,CAAC;QAClB,KAAK,KAAK;YACT,OAAO,KAAK,IAAI,CAAC,CAAC;IACpB,CAAC;AACF,CAAC;AAED,SAAS,IAAI,CAAC,CAAQ,EAAE,CAAQ;IAC/B,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,KAAK;QAAE,OAAO,KAAK,CAAC;IAC7C,OAAO,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;AAC/C,CAAC;AAED,SAAS,MAAM,CAAC,CAAQ,EAAE,CAAQ;IACjC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAC1C,OAAO,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;AAChD,CAAC;AAED,mHAAmH;AACnH,MAAM,UAAU,aAAa,CAAC,CAAS,EAAE,CAAS;IACjD,IAAI,OAAO,CAAC,KAAK,QAAQ;QAAE,OAAO,WAAW,CAAC,CAAC,EAAE,CAAW,CAAC,CAAC;IAC9D,OAAO,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;AAC9B,CAAC;AAED,MAAM,IAAI,GAAG,MAAM,CAAC,gBAAgB,CAAC;AAErC;;;GAGG;AACH,MAAM,UAAU,QAAQ,CAAC,GAAY,EAAE,GAAiB,EAAE,KAAa;IACtE,MAAM,IAAI,GAAyD,EAAE,GAAG,GAAG,EAAE,CAAC;IAC9E,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QAClD,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;QACzC,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC;;YACxC,IAAI,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC;IAC3B,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC;AAED,SAAS,QAAQ,CAAC,IAAc,EAAE,GAAiB,EAAE,KAAa;IACjE,IAAI,IAAI,KAAK,IAAI;QAAE,OAAO,SAAS,CAAC;IACpC,IAAI,OAAO,IAAI,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC;IAC1C,IAAI,KAAK,IAAI,IAAI;QAAE,OAAO,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACxC,IAAI,MAAM,IAAI,IAAI;QAAE,OAAO,IAAI,CAAC,IAAI,CAAC;IACrC,IAAI,MAAM,IAAI,IAAI,EAAE,CAAC;QACpB,MAAM,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;QACpC,OAAO,QAAQ,CAAC,OAAO,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;IAC9D,CAAC;IACD,IAAI,UAAU,IAAI,IAAI;QAAE,OAAO,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,IAAI,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;IAChH,IAAI,eAAe,IAAI,IAAI,EAAE,CAAC;QAC7B,MAAM,CAAC,OAAO,EAAE,IAAI,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC;QAC/C,MAAM,KAAK,GAAG,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE,KAAK,CAAuB,CAAC;QAClE,OAAO,KAAK,KAAK,SAAS,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC/F,CAAC;IACD,kHAAkH;IAClH,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAA+C,CAAC;IAC3F,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAuB,CAAC;IACxD,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAuB,CAAC;IACxD,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IACzD,QAAQ,EAAE,EAAE,CAAC;QACZ,KAAK,QAAQ;YACZ,OAAQ,CAAY,GAAI,CAAY,CAAC;QACtC,KAAK,KAAK;YACT,OAAO,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,KAAK,KAAK;YACT,OAAO,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,SAAS,CAAC;YACT,MAAM,MAAM,GAAG,EAAE,KAAK,KAAK,CAAC,CAAC,CAAE,CAAY,GAAI,CAAY,CAAC,CAAC,CAAE,CAAY,GAAI,CAAY,CAAC;YAC5F,IAAI,MAAM,GAAG,IAAI,IAAI,MAAM,GAAG,CAAC,IAAI;gBAClC,MAAM,OAAO,CAAC,MAAM,EAAE,GAAG,KAAK,KAAK,EAAE,UAAU,MAAM,uBAAuB,CAAC,CAAC;YAC/E,OAAO,MAAM,CAAC;QACf,CAAC;IACF,CAAC;AACF,CAAC","sourcesContent":["// The JavaScript evaluator of the compiled table vocabulary (slice 6a §6; rule 10): the `tx.get` overlay matches\n// `where` nodes and applies `set` nodes with SQL's three-valued `NULL` rules and code point text order, as the SQL\n// that `sql.ts` renders from the same nodes does in SQLite.\n\nimport type { JsonValue } from \"../../json.ts\";\nimport { invalid } from \"../data/internal.ts\";\nimport type { Comparison, ExprNode, Operation, SetNode, WhereNode } from \"./expression.ts\";\nimport type { Scalar } from \"./rows.ts\";\nimport { compareText } from \"./text.ts\";\n\n/** A row as the evaluator reads it: stored cells, an absent column being `NULL`. */\nexport type EvaluatedRow = { readonly [column: string]: Scalar | JsonValue | undefined };\n\n/** SQL's three-valued truth: `null` is unknown (a comparison with `NULL`). */\ntype Truth = boolean | null;\n\n/** Whether `row` matches `node` under SQL's rules: unknown (`NULL`) does not match. */\nexport function matches(node: WhereNode, row: EvaluatedRow): boolean {\n\treturn truth(node, row) === true;\n}\n\nfunction truth(node: WhereNode, row: EvaluatedRow): Truth {\n\tif (\"and\" in node)\n\t\treturn node.and.reduce<Truth>((all, each) => (all === false ? false : both(all, truth(each, row))), true);\n\tif (\"or\" in node)\n\t\treturn node.or.reduce<Truth>((any, each) => (any === true ? true : either(any, truth(each, row))), false);\n\tif (\"not\" in node) {\n\t\tconst inner = truth(node.not, row);\n\t\treturn inner === null ? null : !inner;\n\t}\n\tif (\"isNull\" in node) return row[node.isNull] === undefined;\n\t// The row is checked against the table the condition was compiled for: its columns hold scalars.\n\tif (\"inArray\" in node) {\n\t\tconst [column, values] = node.inArray;\n\t\t// SQL: `x IN ()` is false, for a `NULL` x too.\n\t\tif (values.length === 0) return false;\n\t\tconst value = row[column] as Scalar | undefined;\n\t\treturn value === undefined ? null : values.some((each) => compareScalar(value, each) === 0);\n\t}\n\tif (\"prefix\" in node) {\n\t\tconst value = row[node.prefix[0]] as string | undefined;\n\t\treturn value === undefined ? null : value.startsWith(node.prefix[1]);\n\t}\n\t// The remaining nodes are the comparisons, one entry each; `Object.entries` loses that.\n\tconst [op, [column, operand]] = Object.entries(node)[0] as [Comparison, readonly [string, Scalar]];\n\tconst value = row[column] as Scalar | undefined;\n\tif (value === undefined) return null;\n\tconst order = compareScalar(value, operand);\n\tswitch (op) {\n\t\tcase \"eq\":\n\t\t\treturn order === 0;\n\t\tcase \"ne\":\n\t\t\treturn order !== 0;\n\t\tcase \"lt\":\n\t\t\treturn order < 0;\n\t\tcase \"lte\":\n\t\t\treturn order <= 0;\n\t\tcase \"gt\":\n\t\t\treturn order > 0;\n\t\tcase \"gte\":\n\t\t\treturn order >= 0;\n\t}\n}\n\nfunction both(a: Truth, b: Truth): Truth {\n\tif (a === false || b === false) return false;\n\treturn a === null || b === null ? null : true;\n}\n\nfunction either(a: Truth, b: Truth): Truth {\n\tif (a === true || b === true) return true;\n\treturn a === null || b === null ? null : false;\n}\n\n/** Orders two cells of one column as SQLite does: text by code point, booleans as 0 and 1, numbers numerically. */\nexport function compareScalar(a: Scalar, b: Scalar): number {\n\tif (typeof a === \"string\") return compareText(a, b as string);\n\treturn Number(a) - Number(b);\n}\n\nconst SAFE = Number.MAX_SAFE_INTEGER;\n\n/**\n * `row` after `set`, every right side evaluated against `row` (simultaneous: `{ a: b, b: a }` swaps); an integer\n * result outside ±(2^53 - 1) throws `invalid/args` (rule 10), as the column's `CHECK` fails the step.\n */\nexport function applySet(set: SetNode, row: EvaluatedRow, table: string): EvaluatedRow {\n\tconst next: { [column: string]: Scalar | JsonValue | undefined } = { ...row };\n\tfor (const [column, node] of Object.entries(set)) {\n\t\tconst value = evaluate(node, row, table);\n\t\tif (value === undefined) delete next[column];\n\t\telse next[column] = value;\n\t}\n\treturn next;\n}\n\nfunction evaluate(node: ExprNode, row: EvaluatedRow, table: string): Scalar | JsonValue | undefined {\n\tif (node === null) return undefined;\n\tif (typeof node !== \"object\") return node;\n\tif (\"col\" in node) return row[node.col];\n\tif (\"json\" in node) return node.json;\n\tif (\"when\" in node) {\n\t\tconst [condition, a, b] = node.when;\n\t\treturn evaluate(matches(condition, row) ? a : b, row, table);\n\t}\n\tif (\"coalesce\" in node) return evaluate(node.coalesce[0], row, table) ?? evaluate(node.coalesce[1], row, table);\n\tif (\"replacePrefix\" in node) {\n\t\tconst [subject, from, to] = node.replacePrefix;\n\t\tconst value = evaluate(subject, row, table) as string | undefined;\n\t\treturn value === undefined || !value.startsWith(from) ? value : to + value.slice(from.length);\n\t}\n\t// The remaining nodes are the arithmetic and text operations, one entry each, over scalar operands (compiled so).\n\tconst [op, [x, y]] = Object.entries(node)[0] as [Operation, readonly [ExprNode, ExprNode]];\n\tconst a = evaluate(x, row, table) as Scalar | undefined;\n\tconst b = evaluate(y, row, table) as Scalar | undefined;\n\tif (a === undefined || b === undefined) return undefined;\n\tswitch (op) {\n\t\tcase \"concat\":\n\t\t\treturn (a as string) + (b as string);\n\t\tcase \"max\":\n\t\t\treturn compareScalar(a, b) >= 0 ? a : b;\n\t\tcase \"min\":\n\t\t\treturn compareScalar(a, b) <= 0 ? a : b;\n\t\tdefault: {\n\t\t\tconst result = op === \"add\" ? (a as number) + (b as number) : (a as number) - (b as number);\n\t\t\tif (result > SAFE || result < -SAFE)\n\t\t\t\tthrow invalid(\"args\", `${table}: ${op} gives ${result}, outside ±(2^53 - 1)`);\n\t\t\treturn result;\n\t\t}\n\t}\n}\n"]}

package/dist/next/store/export.d.ts

@@ -0,0 +1,17 @@
+import { type Context } from "../../context/index.ts";
+import { type ArchivePart } from "./archive.ts";
+import type { ChordStore } from "./store.ts";
+/** The rows and documents an export reads per page. */
+export declare const EXPORT_PAGE = 100;
+/**
+ * An export of `store` under `context`: an async iterator of its parts. One pass; after an abort `next()` rejects
+ * `aborted`, after the store closed `released`.
+ */
+export declare class StoreExport implements AsyncIterableIterator<ArchivePart> {
+    #private;
+    constructor(store: ChordStore, context: Context);
+    [Symbol.asyncIterator](): this;
+    next(): Promise<IteratorResult<ArchivePart>>;
+    return(): Promise<IteratorResult<ArchivePart>>;
+}
+//# sourceMappingURL=export.d.ts.map

package/dist/next/store/export.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"export.d.ts","sourceRoot":"","sources":["../../../src/next/store/export.ts"],"names":[],"mappings":"AAMA,OAAO,EAAoB,KAAK,OAAO,EAAE,MAAM,wBAAwB,CAAC;AAIxE,OAAO,EAAkB,KAAK,WAAW,EAAE,MAAM,cAAc,CAAC;AAMhE,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAE7C,uDAAuD;AACvD,eAAO,MAAM,WAAW,MAAM,CAAC;AAE/B;;;GAGG;AACH,qBAAa,WAAY,YAAW,qBAAqB,CAAC,WAAW,CAAC;;IASrE,YAAY,KAAK,EAAE,UAAU,EAAE,OAAO,EAAE,OAAO,EAI9C;IAED,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,IAAI,CAE7B;IAEK,IAAI,IAAI,OAAO,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC,CAmBjD;IAEK,MAAM,IAAI,OAAO,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC,CAGnD;CA6BD"}

package/dist/next/store/export.js

@@ -0,0 +1,200 @@
+// `store.export(ctx)` (slice 6a §13, rule 26): the store's state after its `lastSeq` as archive parts, read page by
+// page with plain reads while the export holds the commit queue (no commit can interleave, no long read transaction).
+// The queue is taken at the first `next()` and given back when the iteration ends, throws, is closed or `ctx` aborts;
+// an abort while the consumer is suspended gives it back at once and drops the pages and records the export held, and
+// an abort while it waits for the queue ends the wait. Closing the store ends it too (`released`).
+import { awaitWithContext } from "../../context/index.js";
+import { ChordError } from "../data/index.js";
+import { ARCHIVE_FORMAT } from "./archive.js";
+import { listRecords, listRevisions } from "./engine.js";
+import { ROW_VERSION, versionColumn } from "./rows.js";
+import { STORE_SCHEMA } from "./schema.js";
+import { quote, recordedPut } from "./sql.js";
+/** The rows and documents an export reads per page. */
+export const EXPORT_PAGE = 100;
+/**
+ * An export of `store` under `context`: an async iterator of its parts. One pass; after an abort `next()` rejects
+ * `aborted`, after the store closed `released`.
+ */
+export class StoreExport {
+    #context;
+    /** The parts, until the export ends; dropped then, with the pages they hold. */
+    #parts;
+    #state = "open";
+    /** Gives the commit queue back while the export holds it. */
+    #release;
+    #abort = () => this.#end("aborted");
+    constructor(store, context) {
+        this.#context = context;
+        const hold = (release) => this.#hold(release);
+        this.#parts = parts(store, context, hold, () => this.#end("closed"));
+    }
+    [Symbol.asyncIterator]() {
+        return this;
+    }
+    async next() {
+        if (this.#context.abortSignal?.aborted)
+            this.#end("aborted");
+        this.#assertOpen();
+        if (this.#parts === undefined)
+            return { done: true, value: undefined };
+        const pending = this.#parts.next();
+        let result;
+        try {
+            // Until the export holds the queue only `context` ends the wait; from then on its abort listener does.
+            result = await (this.#release === undefined ? awaitWithContext(pending, this.#context) : pending);
+        }
+        catch (error) {
+            if (this.#context.abortSignal?.aborted)
+                this.#end("aborted");
+            this.#assertOpen();
+            this.#end("ended");
+            throw error;
+        }
+        // Ended meanwhile (an abort, the store's close): no part after that, even one that needed no read.
+        this.#assertOpen();
+        if (result.done)
+            this.#end("ended");
+        return result;
+    }
+    async return() {
+        this.#end("ended");
+        return { done: true, value: undefined };
+    }
+    /** The parts took the queue: the export holds it until it ends, and an abort ends it; ended already, it gives it back. */
+    #hold(release) {
+        if (this.#state !== "open") {
+            release();
+            return;
+        }
+        this.#release = release;
+        this.#context.abortSignal?.addEventListener("abort", this.#abort, { once: true });
+    }
+    /** Ends the export once: the queue given back, the parts closed (once they reach a `yield`) and dropped. */
+    #end(state) {
+        if (this.#state !== "open")
+            return;
+        this.#state = state;
+        this.#release?.();
+        this.#release = undefined;
+        this.#context.abortSignal?.removeEventListener("abort", this.#abort);
+        void this.#parts?.return(undefined).catch(() => { });
+        this.#parts = undefined;
+    }
+    /** Throws `aborted` after an abort, `released` after the store closed. */
+    #assertOpen() {
+        if (this.#state === "aborted")
+            throw aborted(this.#context);
+        if (this.#state === "closed")
+            throw new ChordError({ code: "released", reason: "closed", message: "store: closed" });
+    }
+}
+/** The error of a use of an aborted export: `aborted`, the signal's reason as the cause. */
+function aborted(context) {
+    return new ChordError({ code: "aborted", message: "store: export aborted" }, { cause: context.abortSignal?.reason });
+}
+/**
+ * The parts in archive order, after taking the queue (handed to `hold`; the store's close calls `end`); the queue is
+ * given back when they end.
+ */
+async function* parts(store, context, hold, end) {
+    const release = await store.take(end);
+    hold(release);
+    try {
+        if (context.abortSignal?.aborted)
+            throw aborted(context);
+        const { lastSeq, nextId } = store;
+        yield { kind: "manifest", format: ARCHIVE_FORMAT, schema: STORE_SCHEMA, lastSeq, nextId };
+        let writes = 0;
+        const tables = [...store.tables.values()].sort((a, b) => (a.table < b.table ? -1 : 1));
+        for (const record of tables) {
+            const { table, version, state, columns, key, fingerprint } = record;
+            yield { kind: "table", table, version, state, columns, key, fingerprint };
+            writes++;
+            for await (const put of puts(store, record, context)) {
+                yield put;
+                writes++;
+            }
+            for (const [name, on] of Object.entries(record.indexes)) {
+                yield { kind: "index", table, name, columns: on };
+                writes++;
+            }
+        }
+        for await (const part of documents(store, context)) {
+            yield part;
+            writes++;
+        }
+        yield { kind: "end", writes };
+    }
+    finally {
+        release();
+    }
+}
+/** The `put`s of a recorded table in key order, a page per read: the stored values and their versions. */
+async function* puts(store, record, context) {
+    const { table, columns, key } = record;
+    const select = recordedPut(table, columns)
+        .physical.map((name) => quote(name))
+        .join(", ");
+    const order = key.map(quote).join(", ");
+    let after;
+    do {
+        const page = after;
+        const from = page === undefined ? "" : ` WHERE (${order}) > (${page.map(() => "?").join(", ")})`;
+        const sql = `SELECT ${select} FROM ${quote(table)}${from} ORDER BY ${order} LIMIT ?`;
+        const rows = await store.read((executor) => executor.all(sql, ...(page ?? []), EXPORT_PAGE), context);
+        for (const stored of rows)
+            yield putOf(record, stored);
+        after = rows.length < EXPORT_PAGE ? undefined : key.map((name) => rows.at(-1)[name]);
+    } while (after !== undefined);
+}
+/** A stored row as its `put`: `NULL` cells absent, booleans from 0 and 1, `json(...)` cells parsed with versions. */
+function putOf(record, stored) {
+    const row = {};
+    const versions = {};
+    for (const [name, column] of Object.entries(record.columns)) {
+        const value = stored[name];
+        if (value === null || value === undefined)
+            continue;
+        // The recorded columns' types say what SQLite stored (STRICT tables): text for `json(...)` with its version.
+        if (column.type === "bool")
+            row[name] = value === 1;
+        else if (column.type === "json") {
+            row[name] = JSON.parse(value);
+            versions[name] = stored[versionColumn(name)];
+        }
+        else
+            row[name] = value;
+    }
+    return { kind: "put", table: record.table, row, version: stored[ROW_VERSION], columns: versions };
+}
+/**
+ * Every stored record by id, live and retired, as its creation without a base, then its kept revisions in seq order:
+ * a `none` or `latest` record's current base and its deltas, a retired `latest` one none, a `rewindable` one all.
+ */
+async function* documents(store, context) {
+    let after = 0;
+    for (;;) {
+        const records = await store.read((executor) => listRecords(executor, after, EXPORT_PAGE), context);
+        for (const record of records) {
+            yield { kind: "document.create", record };
+            yield* revisions(store, record.id, context);
+        }
+        if (records.length < EXPORT_PAGE)
+            return;
+        after = records.at(-1).id;
+    }
+}
+/** Document `id`'s kept revisions in seq order, read page by page (a long history is never one array). */
+async function* revisions(store, id, context) {
+    let after = 0;
+    for (;;) {
+        const page = await store.read((executor) => listRevisions(executor, id, after, EXPORT_PAGE), context);
+        for (const revision of page)
+            yield { kind: "document.revision", ...revision };
+        if (page.length < EXPORT_PAGE)
+            return;
+        after = page.at(-1).seq;
+    }
+}
+//# sourceMappingURL=export.js.map

package/dist/next/store/export.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"export.js","sourceRoot":"","sources":["../../../src/next/store/export.ts"],"names":[],"mappings":"AAAA,oHAAoH;AACpH,sHAAsH;AACtH,sHAAsH;AACtH,sHAAsH;AACtH,mGAAmG;AAEnG,OAAO,EAAE,gBAAgB,EAAgB,MAAM,wBAAwB,CAAC;AAGxE,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAC9C,OAAO,EAAE,cAAc,EAAoB,MAAM,cAAc,CAAC;AAEhE,OAAO,EAAE,WAAW,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AACzD,OAAO,EAAE,WAAW,EAAe,aAAa,EAAE,MAAM,WAAW,CAAC;AACpE,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAC3C,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,MAAM,UAAU,CAAC;AAG9C,uDAAuD;AACvD,MAAM,CAAC,MAAM,WAAW,GAAG,GAAG,CAAC;AAE/B;;;GAGG;AACH,MAAM,OAAO,WAAW;IACd,QAAQ,CAAU;IAC3B,gFAAgF;IAChF,MAAM,CAA0C;IAChD,MAAM,GAA4C,MAAM,CAAC;IACzD,6DAA6D;IAC7D,QAAQ,CAA2B;IAC1B,MAAM,GAAG,GAAS,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAEnD,YAAY,KAAiB,EAAE,OAAgB;QAC9C,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,MAAM,IAAI,GAAG,CAAC,OAAmB,EAAQ,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAChE,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;IACtE,CAAC;IAED,CAAC,MAAM,CAAC,aAAa,CAAC;QACrB,OAAO,IAAI,CAAC;IACb,CAAC;IAED,KAAK,CAAC,IAAI;QACT,IAAI,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE,OAAO;YAAE,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC7D,IAAI,CAAC,WAAW,EAAE,CAAC;QACnB,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS;YAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QACvE,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QACnC,IAAI,MAAmC,CAAC;QACxC,IAAI,CAAC;YACJ,uGAAuG;YACvG,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,gBAAgB,CAAC,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QACnG,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YAChB,IAAI,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE,OAAO;gBAAE,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC7D,IAAI,CAAC,WAAW,EAAE,CAAC;YACnB,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACnB,MAAM,KAAK,CAAC;QACb,CAAC;QACD,mGAAmG;QACnG,IAAI,CAAC,WAAW,EAAE,CAAC;QACnB,IAAI,MAAM,CAAC,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACpC,OAAO,MAAM,CAAC;IACf,CAAC;IAED,KAAK,CAAC,MAAM;QACX,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACnB,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;IACzC,CAAC;IAED,0HAA0H;IAC1H,KAAK,CAAC,OAAmB;QACxB,IAAI,IAAI,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;YAC5B,OAAO,EAAE,CAAC;YACV,OAAO;QACR,CAAC;QACD,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE,gBAAgB,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;IACnF,CAAC;IAED,4GAA4G;IAC5G,IAAI,CAAC,KAAqC;QACzC,IAAI,IAAI,CAAC,MAAM,KAAK,MAAM;YAAE,OAAO;QACnC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC;QAClB,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;QAC1B,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE,mBAAmB,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACrE,KAAK,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,SAAS,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;QACpD,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;IACzB,CAAC;IAED,0EAA0E;IAC1E,WAAW;QACV,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS;YAAE,MAAM,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC5D,IAAI,IAAI,CAAC,MAAM,KAAK,QAAQ;YAC3B,MAAM,IAAI,UAAU,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,eAAe,EAAE,CAAC,CAAC;IACzF,CAAC;CACD;AAED,4FAA4F;AAC5F,SAAS,OAAO,CAAC,OAAgB;IAChC,OAAO,IAAI,UAAU,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,uBAAuB,EAAE,EAAE,EAAE,KAAK,EAAE,OAAO,CAAC,WAAW,EAAE,MAAM,EAAE,CAAC,CAAC;AACtH,CAAC;AAED;;;GAGG;AACH,KAAK,SAAS,CAAC,CAAC,KAAK,CACpB,KAAiB,EACjB,OAAgB,EAChB,IAAmC,EACnC,GAAe;IAEf,MAAM,OAAO,GAAG,MAAM,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACtC,IAAI,CAAC,OAAO,CAAC,CAAC;IACd,IAAI,CAAC;QACJ,IAAI,OAAO,CAAC,WAAW,EAAE,OAAO;YAAE,MAAM,OAAO,CAAC,OAAO,CAAC,CAAC;QACzD,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC;QAClC,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,EAAE,YAAY,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;QAC1F,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,MAAM,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvF,KAAK,MAAM,MAAM,IAAI,MAAM,EAAE,CAAC;YAC7B,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,WAAW,EAAE,GAAG,MAAM,CAAC;YACpE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,WAAW,EAAE,CAAC;YAC1E,MAAM,EAAE,CAAC;YACT,IAAI,KAAK,EAAE,MAAM,GAAG,IAAI,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC;gBACtD,MAAM,GAAG,CAAC;gBACV,MAAM,EAAE,CAAC;YACV,CAAC;YACD,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;gBACzD,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;gBAClD,MAAM,EAAE,CAAC;YACV,CAAC;QACF,CAAC;QACD,IAAI,KAAK,EAAE,MAAM,IAAI,IAAI,SAAS,CAAC,KAAK,EAAE,OAAO,CAAC,EAAE,CAAC;YACpD,MAAM,IAAI,CAAC;YACX,MAAM,EAAE,CAAC;QACV,CAAC;QACD,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;IAC/B,CAAC;YAAS,CAAC;QACV,OAAO,EAAE,CAAC;IACX,CAAC;AACF,CAAC;AAED,0GAA0G;AAC1G,KAAK,SAAS,CAAC,CAAC,IAAI,CACnB,KAAiB,EACjB,MAAmB,EACnB,OAAgB;IAEhB,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,MAAM,CAAC;IACvC,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,OAAO,CAAC;SACxC,QAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;SACnC,IAAI,CAAC,IAAI,CAAC,CAAC;IACb,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxC,IAAI,KAAgC,CAAC;IACrC,GAAG,CAAC;QACH,MAAM,IAAI,GAAG,KAAK,CAAC;QACnB,MAAM,IAAI,GAAG,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,KAAK,QAAQ,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;QACjG,MAAM,GAAG,GAAG,UAAU,MAAM,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG,IAAI,aAAa,KAAK,UAAU,CAAC;QACrF,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,IAAI,CAC5B,CAAC,QAAQ,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAA6C,GAAG,EAAE,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,WAAW,CAAC,EACzG,OAAO,CACP,CAAC;QACF,KAAK,MAAM,MAAM,IAAI,IAAI;YAAE,MAAM,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACvD,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC,IAAI,CAAE,CAAC,CAAC;IACxF,CAAC,QAAQ,KAAK,KAAK,SAAS,EAAE;AAC/B,CAAC;AAED,qHAAqH;AACrH,SAAS,KAAK,CACb,MAAmB,EACnB,MAAkD;IAElD,MAAM,GAAG,GAA6C,EAAE,CAAC;IACzD,MAAM,QAAQ,GAAiC,EAAE,CAAC;IAClD,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;QAC7D,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS;YAAE,SAAS;QACpD,6GAA6G;QAC7G,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM;YAAE,GAAG,CAAC,IAAI,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC;aAC/C,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YACjC,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAe,CAAc,CAAC;YACrD,QAAQ,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,CAAW,CAAC;QACxD,CAAC;;YAAM,GAAG,CAAC,IAAI,CAAC,GAAG,KAAe,CAAC;IACpC,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,CAAC,WAAW,CAAW,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC;AAC7G,CAAC;AAED;;;GAGG;AACH,KAAK,SAAS,CAAC,CAAC,SAAS,CACxB,KAAiB,EACjB,OAAgB;IAEhB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,SAAS,CAAC;QACT,MAAM,OAAO,GAAG,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,WAAW,CAAC,QAAQ,EAAE,KAAK,EAAE,WAAW,CAAC,EAAE,OAAO,CAAC,CAAC;QACnG,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC9B,MAAM,EAAE,IAAI,EAAE,iBAAiB,EAAE,MAAM,EAAE,CAAC;YAC1C,KAAK,CAAC,CAAC,SAAS,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;QAC7C,CAAC;QACD,IAAI,OAAO,CAAC,MAAM,GAAG,WAAW;YAAE,OAAO;QACzC,KAAK,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC;IAC5B,CAAC;AACF,CAAC;AAED,0GAA0G;AAC1G,KAAK,SAAS,CAAC,CAAC,SAAS,CACxB,KAAiB,EACjB,EAAU,EACV,OAAgB;IAEhB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,SAAS,CAAC;QACT,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,aAAa,CAAC,QAAQ,EAAE,EAAE,EAAE,KAAK,EAAE,WAAW,CAAC,EAAE,OAAO,CAAC,CAAC;QACtG,KAAK,MAAM,QAAQ,IAAI,IAAI;YAAE,MAAM,EAAE,IAAI,EAAE,mBAAmB,EAAE,GAAG,QAAQ,EAAE,CAAC;QAC9E,IAAI,IAAI,CAAC,MAAM,GAAG,WAAW;YAAE,OAAO;QACtC,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC;IAC1B,CAAC;AACF,CAAC","sourcesContent":["// `store.export(ctx)` (slice 6a §13, rule 26): the store's state after its `lastSeq` as archive parts, read page by\n// page with plain reads while the export holds the commit queue (no commit can interleave, no long read transaction).\n// The queue is taken at the first `next()` and given back when the iteration ends, throws, is closed or `ctx` aborts;\n// an abort while the consumer is suspended gives it back at once and drops the pages and records the export held, and\n// an abort while it waits for the queue ends the wait. Closing the store ends it too (`released`).\n\nimport { awaitWithContext, type Context } from \"../../context/index.ts\";\nimport type { JsonValue } from \"../../json.ts\";\nimport type { SqliteValue } from \"../../sqlite/index.ts\";\nimport { ChordError } from \"../data/index.ts\";\nimport { ARCHIVE_FORMAT, type ArchivePart } from \"./archive.ts\";\nimport type { TableRecord } from \"./catalog.ts\";\nimport { listRecords, listRevisions } from \"./engine.ts\";\nimport { ROW_VERSION, type Scalar, versionColumn } from \"./rows.ts\";\nimport { STORE_SCHEMA } from \"./schema.ts\";\nimport { quote, recordedPut } from \"./sql.ts\";\nimport type { ChordStore } from \"./store.ts\";\n\n/** The rows and documents an export reads per page. */\nexport const EXPORT_PAGE = 100;\n\n/**\n * An export of `store` under `context`: an async iterator of its parts. One pass; after an abort `next()` rejects\n * `aborted`, after the store closed `released`.\n */\nexport class StoreExport implements AsyncIterableIterator<ArchivePart> {\n\treadonly #context: Context;\n\t/** The parts, until the export ends; dropped then, with the pages they hold. */\n\t#parts: AsyncGenerator<ArchivePart> | undefined;\n\t#state: \"open\" | \"aborted\" | \"closed\" | \"ended\" = \"open\";\n\t/** Gives the commit queue back while the export holds it. */\n\t#release: (() => void) | undefined;\n\treadonly #abort = (): void => this.#end(\"aborted\");\n\n\tconstructor(store: ChordStore, context: Context) {\n\t\tthis.#context = context;\n\t\tconst hold = (release: () => void): void => this.#hold(release);\n\t\tthis.#parts = parts(store, context, hold, () => this.#end(\"closed\"));\n\t}\n\n\t[Symbol.asyncIterator](): this {\n\t\treturn this;\n\t}\n\n\tasync next(): Promise<IteratorResult<ArchivePart>> {\n\t\tif (this.#context.abortSignal?.aborted) this.#end(\"aborted\");\n\t\tthis.#assertOpen();\n\t\tif (this.#parts === undefined) return { done: true, value: undefined };\n\t\tconst pending = this.#parts.next();\n\t\tlet result: IteratorResult<ArchivePart>;\n\t\ttry {\n\t\t\t// Until the export holds the queue only `context` ends the wait; from then on its abort listener does.\n\t\t\tresult = await (this.#release === undefined ? awaitWithContext(pending, this.#context) : pending);\n\t\t} catch (error) {\n\t\t\tif (this.#context.abortSignal?.aborted) this.#end(\"aborted\");\n\t\t\tthis.#assertOpen();\n\t\t\tthis.#end(\"ended\");\n\t\t\tthrow error;\n\t\t}\n\t\t// Ended meanwhile (an abort, the store's close): no part after that, even one that needed no read.\n\t\tthis.#assertOpen();\n\t\tif (result.done) this.#end(\"ended\");\n\t\treturn result;\n\t}\n\n\tasync return(): Promise<IteratorResult<ArchivePart>> {\n\t\tthis.#end(\"ended\");\n\t\treturn { done: true, value: undefined };\n\t}\n\n\t/** The parts took the queue: the export holds it until it ends, and an abort ends it; ended already, it gives it back. */\n\t#hold(release: () => void): void {\n\t\tif (this.#state !== \"open\") {\n\t\t\trelease();\n\t\t\treturn;\n\t\t}\n\t\tthis.#release = release;\n\t\tthis.#context.abortSignal?.addEventListener(\"abort\", this.#abort, { once: true });\n\t}\n\n\t/** Ends the export once: the queue given back, the parts closed (once they reach a `yield`) and dropped. */\n\t#end(state: \"aborted\" | \"closed\" | \"ended\"): void {\n\t\tif (this.#state !== \"open\") return;\n\t\tthis.#state = state;\n\t\tthis.#release?.();\n\t\tthis.#release = undefined;\n\t\tthis.#context.abortSignal?.removeEventListener(\"abort\", this.#abort);\n\t\tvoid this.#parts?.return(undefined).catch(() => {});\n\t\tthis.#parts = undefined;\n\t}\n\n\t/** Throws `aborted` after an abort, `released` after the store closed. */\n\t#assertOpen(): void {\n\t\tif (this.#state === \"aborted\") throw aborted(this.#context);\n\t\tif (this.#state === \"closed\")\n\t\t\tthrow new ChordError({ code: \"released\", reason: \"closed\", message: \"store: closed\" });\n\t}\n}\n\n/** The error of a use of an aborted export: `aborted`, the signal's reason as the cause. */\nfunction aborted(context: Context): ChordError {\n\treturn new ChordError({ code: \"aborted\", message: \"store: export aborted\" }, { cause: context.abortSignal?.reason });\n}\n\n/**\n * The parts in archive order, after taking the queue (handed to `hold`; the store's close calls `end`); the queue is\n * given back when they end.\n */\nasync function* parts(\n\tstore: ChordStore,\n\tcontext: Context,\n\thold: (release: () => void) => void,\n\tend: () => void,\n): AsyncGenerator<ArchivePart> {\n\tconst release = await store.take(end);\n\thold(release);\n\ttry {\n\t\tif (context.abortSignal?.aborted) throw aborted(context);\n\t\tconst { lastSeq, nextId } = store;\n\t\tyield { kind: \"manifest\", format: ARCHIVE_FORMAT, schema: STORE_SCHEMA, lastSeq, nextId };\n\t\tlet writes = 0;\n\t\tconst tables = [...store.tables.values()].sort((a, b) => (a.table < b.table ? -1 : 1));\n\t\tfor (const record of tables) {\n\t\t\tconst { table, version, state, columns, key, fingerprint } = record;\n\t\t\tyield { kind: \"table\", table, version, state, columns, key, fingerprint };\n\t\t\twrites++;\n\t\t\tfor await (const put of puts(store, record, context)) {\n\t\t\t\tyield put;\n\t\t\t\twrites++;\n\t\t\t}\n\t\t\tfor (const [name, on] of Object.entries(record.indexes)) {\n\t\t\t\tyield { kind: \"index\", table, name, columns: on };\n\t\t\t\twrites++;\n\t\t\t}\n\t\t}\n\t\tfor await (const part of documents(store, context)) {\n\t\t\tyield part;\n\t\t\twrites++;\n\t\t}\n\t\tyield { kind: \"end\", writes };\n\t} finally {\n\t\trelease();\n\t}\n}\n\n/** The `put`s of a recorded table in key order, a page per read: the stored values and their versions. */\nasync function* puts(\n\tstore: ChordStore,\n\trecord: TableRecord,\n\tcontext: Context,\n): AsyncGenerator<Extract<ArchivePart, { readonly kind: \"put\" }>> {\n\tconst { table, columns, key } = record;\n\tconst select = recordedPut(table, columns)\n\t\t.physical.map((name) => quote(name))\n\t\t.join(\", \");\n\tconst order = key.map(quote).join(\", \");\n\tlet after: SqliteValue[] | undefined;\n\tdo {\n\t\tconst page = after;\n\t\tconst from = page === undefined ? \"\" : ` WHERE (${order}) > (${page.map(() => \"?\").join(\", \")})`;\n\t\tconst sql = `SELECT ${select} FROM ${quote(table)}${from} ORDER BY ${order} LIMIT ?`;\n\t\tconst rows = await store.read(\n\t\t\t(executor) => executor.all<{ readonly [column: string]: SqliteValue }>(sql, ...(page ?? []), EXPORT_PAGE),\n\t\t\tcontext,\n\t\t);\n\t\tfor (const stored of rows) yield putOf(record, stored);\n\t\tafter = rows.length < EXPORT_PAGE ? undefined : key.map((name) => rows.at(-1)![name]!);\n\t} while (after !== undefined);\n}\n\n/** A stored row as its `put`: `NULL` cells absent, booleans from 0 and 1, `json(...)` cells parsed with versions. */\nfunction putOf(\n\trecord: TableRecord,\n\tstored: { readonly [column: string]: SqliteValue },\n): Extract<ArchivePart, { readonly kind: \"put\" }> {\n\tconst row: { [column: string]: Scalar | JsonValue } = {};\n\tconst versions: { [column: string]: number } = {};\n\tfor (const [name, column] of Object.entries(record.columns)) {\n\t\tconst value = stored[name];\n\t\tif (value === null || value === undefined) continue;\n\t\t// The recorded columns' types say what SQLite stored (STRICT tables): text for `json(...)` with its version.\n\t\tif (column.type === \"bool\") row[name] = value === 1;\n\t\telse if (column.type === \"json\") {\n\t\t\trow[name] = JSON.parse(value as string) as JsonValue;\n\t\t\tversions[name] = stored[versionColumn(name)] as number;\n\t\t} else row[name] = value as Scalar;\n\t}\n\treturn { kind: \"put\", table: record.table, row, version: stored[ROW_VERSION] as number, columns: versions };\n}\n\n/**\n * Every stored record by id, live and retired, as its creation without a base, then its kept revisions in seq order:\n * a `none` or `latest` record's current base and its deltas, a retired `latest` one none, a `rewindable` one all.\n */\nasync function* documents(\n\tstore: ChordStore,\n\tcontext: Context,\n): AsyncGenerator<Extract<ArchivePart, { readonly kind: \"document.create\" | \"document.revision\" }>> {\n\tlet after = 0;\n\tfor (;;) {\n\t\tconst records = await store.read((executor) => listRecords(executor, after, EXPORT_PAGE), context);\n\t\tfor (const record of records) {\n\t\t\tyield { kind: \"document.create\", record };\n\t\t\tyield* revisions(store, record.id, context);\n\t\t}\n\t\tif (records.length < EXPORT_PAGE) return;\n\t\tafter = records.at(-1)!.id;\n\t}\n}\n\n/** Document `id`'s kept revisions in seq order, read page by page (a long history is never one array). */\nasync function* revisions(\n\tstore: ChordStore,\n\tid: number,\n\tcontext: Context,\n): AsyncGenerator<Extract<ArchivePart, { readonly kind: \"document.revision\" }>> {\n\tlet after = 0;\n\tfor (;;) {\n\t\tconst page = await store.read((executor) => listRevisions(executor, id, after, EXPORT_PAGE), context);\n\t\tfor (const revision of page) yield { kind: \"document.revision\", ...revision };\n\t\tif (page.length < EXPORT_PAGE) return;\n\t\tafter = page.at(-1)!.seq;\n\t}\n}\n"]}

package/dist/next/store/expression.d.ts

@@ -0,0 +1,150 @@
+import type { JsonValue } from "../../json.ts";
+import type { Optional } from "../contracts/index.ts";
+import type { Column, Columns, ColumnType, ColumnTypeOf, ValueOf } from "./columns.ts";
+import { type Scalar } from "./rows.ts";
+import type { TableDefinition } from "./table.ts";
+/** A compiled condition: column comparisons with checked operands, combined by `and`, `or`, `not`. */
+export type WhereNode = {
+    readonly eq: readonly [string, Scalar];
+} | {
+    readonly ne: readonly [string, Scalar];
+} | {
+    readonly lt: readonly [string, Scalar];
+} | {
+    readonly lte: readonly [string, Scalar];
+} | {
+    readonly gt: readonly [string, Scalar];
+} | {
+    readonly gte: readonly [string, Scalar];
+} | {
+    readonly inArray: readonly [string, readonly Scalar[]];
+} | {
+    readonly isNull: string;
+} | {
+    readonly prefix: readonly [string, string];
+} | {
+    readonly and: readonly WhereNode[];
+} | {
+    readonly or: readonly WhereNode[];
+} | {
+    readonly not: WhereNode;
+};
+/** A compiled value expression: a literal (`null` clears), a column, a `json(...)` cell, or an operation. */
+export type ExprNode = Scalar | null | {
+    readonly col: string;
+} | {
+    readonly json: JsonValue;
+} | {
+    readonly add: readonly [ExprNode, ExprNode];
+} | {
+    readonly sub: readonly [ExprNode, ExprNode];
+} | {
+    readonly max: readonly [ExprNode, ExprNode];
+} | {
+    readonly min: readonly [ExprNode, ExprNode];
+} | {
+    readonly concat: readonly [ExprNode, ExprNode];
+} | {
+    readonly coalesce: readonly [ExprNode, ExprNode];
+} | {
+    readonly replacePrefix: readonly [ExprNode, string, string];
+} | {
+    readonly when: readonly [WhereNode, ExprNode, ExprNode];
+};
+/** A compiled `set`: the new value of each changed column, every right side evaluated against the row before. */
+export type SetNode = {
+    readonly [column: string]: ExprNode;
+};
+/** The comparison operators of a `WhereNode`. */
+export type Comparison = "eq" | "ne" | "lt" | "lte" | "gt" | "gte";
+/** The operations of an `ExprNode`. */
+export type Operation = "add" | "sub" | "max" | "min" | "concat" | "coalesce" | "replacePrefix" | "when";
+/** A value expression as a plugin builds it: `T` is its value, `K` its column type. Compiled when staged. */
+export declare class Expression<T = unknown, K extends ColumnType = ColumnType> {
+    readonly op: Operation | "col";
+    readonly args: readonly unknown[];
+    /** Type only. */
+    readonly "~value"?: T;
+    readonly "~type"?: K;
+    constructor(op: Operation | "col", args: readonly unknown[]);
+}
+/** A reference to a column of the row, as `(t) => …` callbacks get them. */
+export declare class ColumnRef<T = unknown, K extends ColumnType = ColumnType> extends Expression<T, K> {
+    readonly column: string;
+    constructor(column: string);
+}
+/** A condition as a plugin builds it; compiled when staged or run. */
+export declare class Condition {
+    readonly op: Comparison | "inArray" | "isNull" | "prefix" | "and" | "or" | "not";
+    readonly args: readonly unknown[];
+    constructor(op: Condition["op"], args: readonly unknown[]);
+}
+/**
+ * A `set` of a table with columns `C` and key `K`: new values of non-key columns, each a value or an expression of
+ * the column's type; `undefined` clears an `opt(...)` column.
+ */
+export type SetOf<C extends Columns, K extends readonly string[]> = {
+    readonly [P in Exclude<keyof C & string, K[number]>]?: C[P] extends Optional ? ValueOf<C[P]> | Expression<ValueOf<C[P]>, ColumnTypeOf<C[P]>> | undefined : ValueOf<C[P]> | Expression<ValueOf<C[P]>, ColumnTypeOf<C[P]>>;
+};
+/** A scalar column type. */
+type ScalarType = Exclude<ColumnType, "json">;
+/** An operand of type `T` and column type `K`: an expression or a plain value. */
+type Operand<T, K extends ColumnType> = Expression<T, K> | T;
+/** The column equals `value` (`NULL` never matches). */
+export declare function eq<T extends Scalar>(column: ColumnRef<T, ScalarType>, value: T): Condition;
+/** The column differs from `value` (`NULL` never matches). */
+export declare function ne<T extends Scalar>(column: ColumnRef<T, ScalarType>, value: T): Condition;
+/** The column is below `value`. */
+export declare function lt<T extends Scalar>(column: ColumnRef<T, ScalarType>, value: T): Condition;
+/** The column is at most `value`. */
+export declare function lte<T extends Scalar>(column: ColumnRef<T, ScalarType>, value: T): Condition;
+/** The column is above `value`. */
+export declare function gt<T extends Scalar>(column: ColumnRef<T, ScalarType>, value: T): Condition;
+/** The column is at least `value`. */
+export declare function gte<T extends Scalar>(column: ColumnRef<T, ScalarType>, value: T): Condition;
+/** The column equals one of `values` (`[]` matches nothing). */
+export declare function inArray<T extends Scalar>(column: ColumnRef<T, ScalarType>, values: readonly T[]): Condition;
+/** The column is `NULL` (an `opt(...)` column without a value). */
+export declare function isNull(column: ColumnRef<unknown, ScalarType>): Condition;
+/** The text column starts with `prefix`, compared by code point (`""` matches every value). */
+export declare function prefix(column: ColumnRef<string, "str">, prefix: string): Condition;
+/** Every condition holds (`and()` always does). */
+export declare function and(...conditions: Condition[]): Condition;
+/** Some condition holds (`or()` never does). */
+export declare function or(...conditions: Condition[]): Condition;
+/** The condition does not hold (`NULL` stays `NULL`: it never matches). */
+export declare function not(condition: Condition): Condition;
+/** `a + b` over integers; a result outside ±(2^53 - 1) fails (rule 10). */
+export declare function add(a: Operand<number, "int">, b: Operand<number, "int">): Expression<number, "int">;
+/** `a - b` over integers; a result outside ±(2^53 - 1) fails (rule 10). */
+export declare function sub(a: Operand<number, "int">, b: Operand<number, "int">): Expression<number, "int">;
+/** The larger of `a` and b` (`int` or `num`). */
+export declare function max<K extends "int" | "num">(a: Operand<number, K>, b: Operand<number, K>): Expression<number, K>;
+/** The smaller of `a` and `b` (`int` or `num`). */
+export declare function min<K extends "int" | "num">(a: Operand<number, K>, b: Operand<number, K>): Expression<number, K>;
+/** `a` followed by `b`. */
+export declare function concat(a: Operand<string, "str">, b: Operand<string, "str">): Expression<string, "str">;
+/** `value` with its prefix `from` replaced by `to`; a value without the prefix stays as it is. */
+export declare function replacePrefix(value: Operand<string, "str">, from: string, to: string): Expression<string, "str">;
+/** `a` unless it is `NULL`, else `b`. */
+export declare function coalesce<T, K extends ScalarType>(a: Expression<T, K>, b: Operand<T, K>): Expression<T, K>;
+/** `a` where `condition` holds for the row, else `b`. */
+export declare function when<T, K extends ScalarType>(condition: Condition, a: Operand<T, K>, b: Operand<T, K>): Expression<T, K>;
+/** One `ColumnRef` per column of `definition`, for its `(t) => …` callbacks. */
+export declare function columnRefs(columns: readonly Column[]): {
+    readonly [column: string]: ColumnRef;
+};
+/**
+ * Compiles a plugin's condition over `table`'s columns (a trust boundary: plugin values): known scalar columns,
+ * operands of their type made storable (`invalid/args` otherwise, `undefined` included: ask with `isNull`, rule 16).
+ */
+export declare function compileWhere(table: TableDefinition, condition: unknown, what: string): WhereNode;
+/**
+ * Compiles a plugin's `set` (plain values or a callback's result) for `table` (a trust boundary): known non-key
+ * columns (rule 13), at least one (rule 14), `undefined` clearing an `opt(...)` column as the explicit `null` (a
+ * `null` value is a `json(...)` cell's JSON `null`, refused for other columns), an
+ * expression whose result may be `NULL` only for an `opt(...)` column; integer arithmetic only on `int` columns.
+ */
+export declare function compileSet(table: TableDefinition, set: unknown, what: string): SetNode;
+export {};
+//# sourceMappingURL=expression.d.ts.map

package/dist/next/store/expression.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"expression.d.ts","sourceRoot":"","sources":["../../../src/next/store/expression.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAC/C,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AAEtD,OAAO,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AACvF,OAAO,EAA2B,KAAK,MAAM,EAAE,MAAM,WAAW,CAAC;AACjE,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAElD,sGAAsG;AACtG,MAAM,MAAM,SAAS,GAClB;IAAE,QAAQ,CAAC,EAAE,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;CAAE,GAC1C;IAAE,QAAQ,CAAC,EAAE,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;CAAE,GAC1C;IAAE,QAAQ,CAAC,EAAE,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;CAAE,GAC1C;IAAE,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;CAAE,GAC3C;IAAE,QAAQ,CAAC,EAAE,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;CAAE,GAC1C;IAAE,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;CAAE,GAC3C;IAAE,QAAQ,CAAC,OAAO,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CAAA;CAAE,GAC1D;IAAE,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GAC3B;IAAE,QAAQ,CAAC,MAAM,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;CAAE,GAC9C;IAAE,QAAQ,CAAC,GAAG,EAAE,SAAS,SAAS,EAAE,CAAA;CAAE,GACtC;IAAE,QAAQ,CAAC,EAAE,EAAE,SAAS,SAAS,EAAE,CAAA;CAAE,GACrC;IAAE,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAA;CAAE,CAAC;AAE/B,6GAA6G;AAC7G,MAAM,MAAM,QAAQ,GACjB,MAAM,GACN,IAAI,GACJ;IAAE,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAA;CAAE,GACxB;IAAE,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAA;CAAE,GAC5B;IAAE,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAA;CAAE,GAC/C;IAAE,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAA;CAAE,GAC/C;IAAE,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAA;CAAE,GAC/C;IAAE,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAA;CAAE,GAC/C;IAAE,QAAQ,CAAC,MAAM,EAAE,SAAS,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAA;CAAE,GAClD;IAAE,QAAQ,CAAC,QAAQ,EAAE,SAAS,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAA;CAAE,GACpD;IAAE,QAAQ,CAAC,aAAa,EAAE,SAAS,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,CAAC,CAAA;CAAE,GAC/D;IAAE,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC,SAAS,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAA;CAAE,CAAC;AAE/D,iHAAiH;AACjH,MAAM,MAAM,OAAO,GAAG;IAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,GAAG,QAAQ,CAAA;CAAE,CAAC;AAE9D,iDAAiD;AACjD,MAAM,MAAM,UAAU,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG,IAAI,GAAG,KAAK,CAAC;AAEnE,uCAAuC;AACvC,MAAM,MAAM,SAAS,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,QAAQ,GAAG,UAAU,GAAG,eAAe,GAAG,MAAM,CAAC;AAEzG,6GAA6G;AAC7G,qBAAa,UAAU,CAAC,CAAC,GAAG,OAAO,EAAE,CAAC,SAAS,UAAU,GAAG,UAAU;IACrE,QAAQ,CAAC,EAAE,EAAE,SAAS,GAAG,KAAK,CAAC;IAC/B,QAAQ,CAAC,IAAI,EAAE,SAAS,OAAO,EAAE,CAAC;IAClC,iBAAiB;IACjB,SAAiB,QAAQ,CAAC,EAAE,CAAC,CAAC;IAC9B,SAAiB,OAAO,CAAC,EAAE,CAAC,CAAC;IAE7B,YAAY,EAAE,EAAE,SAAS,GAAG,KAAK,EAAE,IAAI,EAAE,SAAS,OAAO,EAAE,EAG1D;CACD;AAED,4EAA4E;AAC5E,qBAAa,SAAS,CAAC,CAAC,GAAG,OAAO,EAAE,CAAC,SAAS,UAAU,GAAG,UAAU,CAAE,SAAQ,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC;IAC9F,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IAExB,YAAY,MAAM,EAAE,MAAM,EAGzB;CACD;AAED,sEAAsE;AACtE,qBAAa,SAAS;IACrB,QAAQ,CAAC,EAAE,EAAE,UAAU,GAAG,SAAS,GAAG,QAAQ,GAAG,QAAQ,GAAG,KAAK,GAAG,IAAI,GAAG,KAAK,CAAC;IACjF,QAAQ,CAAC,IAAI,EAAE,SAAS,OAAO,EAAE,CAAC;IAElC,YAAY,EAAE,EAAE,SAAS,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,OAAO,EAAE,EAGxD;CACD;AAED;;;GAGG;AACH,MAAM,MAAM,KAAK,CAAC,CAAC,SAAS,OAAO,EAAE,CAAC,SAAS,SAAS,MAAM,EAAE,IAAI;IACnE,QAAQ,EAAE,CAAC,IAAI,OAAO,CAAC,MAAM,CAAC,GAAG,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,QAAQ,GACzE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,SAAS,GACzE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;CAChE,CAAC;AAEF,4BAA4B;AAC5B,KAAK,UAAU,GAAG,OAAO,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;AAE9C,kFAAkF;AAClF,KAAK,OAAO,CAAC,CAAC,EAAE,CAAC,SAAS,UAAU,IAAI,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;AAE7D,wDAAwD;AACxD,wBAAgB,EAAE,CAAC,CAAC,SAAS,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC,EAAE,UAAU,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,SAAS,CAE1F;AAED,8DAA8D;AAC9D,wBAAgB,EAAE,CAAC,CAAC,SAAS,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC,EAAE,UAAU,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,SAAS,CAE1F;AAED,mCAAmC;AACnC,wBAAgB,EAAE,CAAC,CAAC,SAAS,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC,EAAE,UAAU,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,SAAS,CAE1F;AAED,qCAAqC;AACrC,wBAAgB,GAAG,CAAC,CAAC,SAAS,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC,EAAE,UAAU,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,SAAS,CAE3F;AAED,mCAAmC;AACnC,wBAAgB,EAAE,CAAC,CAAC,SAAS,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC,EAAE,UAAU,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,SAAS,CAE1F;AAED,sCAAsC;AACtC,wBAAgB,GAAG,CAAC,CAAC,SAAS,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC,EAAE,UAAU,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,SAAS,CAE3F;AAED,gEAAgE;AAChE,wBAAgB,OAAO,CAAC,CAAC,SAAS,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC,EAAE,UAAU,CAAC,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,GAAG,SAAS,CAE3G;AAED,mEAAmE;AACnE,wBAAgB,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,OAAO,EAAE,UAAU,CAAC,GAAG,SAAS,CAExE;AAED,+FAA+F;AAC/F,wBAAgB,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,EAAE,MAAM,GAAG,SAAS,CAElF;AAED,mDAAmD;AACnD,wBAAgB,GAAG,CAAC,GAAG,UAAU,EAAE,SAAS,EAAE,GAAG,SAAS,CAEzD;AAED,gDAAgD;AAChD,wBAAgB,EAAE,CAAC,GAAG,UAAU,EAAE,SAAS,EAAE,GAAG,SAAS,CAExD;AAED,2EAA2E;AAC3E,wBAAgB,GAAG,CAAC,SAAS,EAAE,SAAS,GAAG,SAAS,CAEnD;AAED,2EAA2E;AAC3E,wBAAgB,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC,CAEnG;AAED,2EAA2E;AAC3E,wBAAgB,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC,CAEnG;AAED,iDAAiD;AACjD,wBAAgB,GAAG,CAAC,CAAC,SAAS,KAAK,GAAG,KAAK,EAAE,CAAC,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC,CAEhH;AAED,mDAAmD;AACnD,wBAAgB,GAAG,CAAC,CAAC,SAAS,KAAK,GAAG,KAAK,EAAE,CAAC,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC,CAEhH;AAED,2BAA2B;AAC3B,wBAAgB,MAAM,CAAC,CAAC,EAAE,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC,CAEtG;AAED,kGAAkG;AAClG,wBAAgB,aAAa,CAAC,KAAK,EAAE,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC,CAEhH;AAED,yCAAyC;AACzC,wBAAgB,QAAQ,CAAC,CAAC,EAAE,CAAC,SAAS,UAAU,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAEzG;AAED,yDAAyD;AACzD,wBAAgB,IAAI,CAAC,CAAC,EAAE,CAAC,SAAS,UAAU,EAC3C,SAAS,EAAE,SAAS,EACpB,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAChB,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,GACd,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAElB;AAED,gFAAgF;AAChF,wBAAgB,UAAU,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,GAAG;IAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,GAAG,SAAS,CAAA;CAAE,CAE/F;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,eAAe,EAAE,SAAS,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,GAAG,SAAS,CA8BhG;AAED;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,eAAe,EAAE,GAAG,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,CAiCtF"}