@rocicorp/zero 1.10.0-canary.23 → 1.10.0-canary.25

package/out/replicache/src/dag/invalid-ref-count-error.js

@@ -1,19 +0,0 @@
-//#region ../replicache/src/dag/invalid-ref-count-error.ts
-/**
-* Thrown when a ref count read from the store is not a valid Uint16. This
-* means the store is corrupt (due to some unknown bug) and cannot be repaired.
-*/
-var InvalidRefCountError = class extends Error {
-	name = "InvalidRefCountError";
-	hash;
-	value;
-	constructor(hash, value) {
-		super(`Invalid ref count ${String(value)} for ${hash}. We expect the value to be a Uint16`);
-		this.hash = hash;
-		this.value = value;
-	}
-};
-//#endregion
-export { InvalidRefCountError };
-
-//# sourceMappingURL=invalid-ref-count-error.js.map

package/out/replicache/src/dag/invalid-ref-count-error.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"invalid-ref-count-error.js","names":[],"sources":["../../../../../replicache/src/dag/invalid-ref-count-error.ts"],"sourcesContent":["import type {Hash} from '../hash.ts';\n\n/**\n * Thrown when a ref count read from the store is not a valid Uint16. This\n * means the store is corrupt (due to some unknown bug) and cannot be repaired.\n */\nexport class InvalidRefCountError extends Error {\n  name = 'InvalidRefCountError';\n  readonly hash: Hash;\n  readonly value: unknown;\n  constructor(hash: Hash, value: unknown) {\n    super(\n      `Invalid ref count ${String(value)} for ${hash}. We expect the value to be a Uint16`,\n    );\n    this.hash = hash;\n    this.value = value;\n  }\n}\n"],"mappings":";;;;;AAMA,IAAa,uBAAb,cAA0C,MAAM;CAC9C,OAAO;CACP;CACA;CACA,YAAY,MAAY,OAAgB;EACtC,MACE,qBAAqB,OAAO,KAAK,EAAE,OAAO,KAAK,qCACjD;EACA,KAAK,OAAO;EACZ,KAAK,QAAQ;CACf;AACF"}

package/out/shared/src/xxhash32.d.ts

@@ -1,36 +0,0 @@
-/**
- * The two arithmetic steps at the core of xxHash32, shared by everything here
- * that builds a hash out of it.
- *
- * xxHash32 is defined over a byte stream, but its round and avalanche steps
- * are just 32-bit word arithmetic and are reusable on their own. `hash.ts`
- * feeds them UTF-8 bytes to produce digests bit-compatible with the reference
- * implementation; `zero-protocol`'s AST hash feeds them words taken straight
- * from a structure, never materializing bytes at all. Same mixing, different
- * ingestion.
- *
- * These constants and steps are frozen: both callers' digests are persisted or
- * compared against stored values, so changing anything here silently changes
- * hashes across the system. `hash.test.ts` pins the byte-oriented side against
- * the js-xxhash reference; `query-hash-visitor.test.ts` pins the word-oriented
- * side against a corpus.
- */
-export declare const PRIME32_1 = 2654435761;
-export declare const PRIME32_2 = 2246822519;
-export declare const PRIME32_3 = 3266489917;
-export declare const PRIME32_4 = 668265263;
-export declare const PRIME32_5 = 374761393;
-/**
- * One xxHash32 round: fold a 32-bit word into an accumulator.
- *
- * `Math.imul` is the whole multiply. Reference JS ports write it as two 16-bit
- * half-multiplies recombined; that computes the same low 32 bits by a longer
- * route, which is why moving to `Math.imul` left every digest unchanged.
- */
-export declare function round32(acc: number, word: number): number;
-/**
- * xxHash32's final mix, spreading every input bit across the whole word.
- * Returns an unsigned 32-bit number.
- */
-export declare function avalanche32(acc: number): number;
-//# sourceMappingURL=xxhash32.d.ts.map

package/out/shared/src/xxhash32.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"xxhash32.d.ts","sourceRoot":"","sources":["../../../../shared/src/xxhash32.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,eAAO,MAAM,SAAS,aAAa,CAAC;AACpC,eAAO,MAAM,SAAS,aAAa,CAAC;AACpC,eAAO,MAAM,SAAS,aAAa,CAAC;AACpC,eAAO,MAAM,SAAS,YAAY,CAAC;AACnC,eAAO,MAAM,SAAS,YAAY,CAAC;AAEnC;;;;;;GAMG;AACH,wBAAgB,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAIzD;AAED;;;GAGG;AACH,wBAAgB,WAAW,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAO/C"}

package/out/shared/src/xxhash32.js

@@ -1,51 +0,0 @@
-//#region ../shared/src/xxhash32.ts
-/**
-* The two arithmetic steps at the core of xxHash32, shared by everything here
-* that builds a hash out of it.
-*
-* xxHash32 is defined over a byte stream, but its round and avalanche steps
-* are just 32-bit word arithmetic and are reusable on their own. `hash.ts`
-* feeds them UTF-8 bytes to produce digests bit-compatible with the reference
-* implementation; `zero-protocol`'s AST hash feeds them words taken straight
-* from a structure, never materializing bytes at all. Same mixing, different
-* ingestion.
-*
-* These constants and steps are frozen: both callers' digests are persisted or
-* compared against stored values, so changing anything here silently changes
-* hashes across the system. `hash.test.ts` pins the byte-oriented side against
-* the js-xxhash reference; `query-hash-visitor.test.ts` pins the word-oriented
-* side against a corpus.
-*/
-var PRIME32_1 = 2654435761;
-var PRIME32_2 = 2246822519;
-var PRIME32_3 = 3266489917;
-var PRIME32_4 = 668265263;
-var PRIME32_5 = 374761393;
-/**
-* One xxHash32 round: fold a 32-bit word into an accumulator.
-*
-* `Math.imul` is the whole multiply. Reference JS ports write it as two 16-bit
-* half-multiplies recombined; that computes the same low 32 bits by a longer
-* route, which is why moving to `Math.imul` left every digest unchanged.
-*/
-function round32(acc, word) {
-	acc = acc + Math.imul(word, PRIME32_2) | 0;
-	acc = acc << 13 | acc >>> 19;
-	return Math.imul(acc, PRIME32_1);
-}
-/**
-* xxHash32's final mix, spreading every input bit across the whole word.
-* Returns an unsigned 32-bit number.
-*/
-function avalanche32(acc) {
-	acc ^= acc >>> 15;
-	acc = Math.imul(acc, PRIME32_2);
-	acc ^= acc >>> 13;
-	acc = Math.imul(acc, PRIME32_3);
-	acc ^= acc >>> 16;
-	return acc >>> 0;
-}
-//#endregion
-export { PRIME32_1, PRIME32_2, PRIME32_3, PRIME32_4, PRIME32_5, avalanche32, round32 };
-
-//# sourceMappingURL=xxhash32.js.map

package/out/shared/src/xxhash32.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"xxhash32.js","names":[],"sources":["../../../../shared/src/xxhash32.ts"],"sourcesContent":["/**\n * The two arithmetic steps at the core of xxHash32, shared by everything here\n * that builds a hash out of it.\n *\n * xxHash32 is defined over a byte stream, but its round and avalanche steps\n * are just 32-bit word arithmetic and are reusable on their own. `hash.ts`\n * feeds them UTF-8 bytes to produce digests bit-compatible with the reference\n * implementation; `zero-protocol`'s AST hash feeds them words taken straight\n * from a structure, never materializing bytes at all. Same mixing, different\n * ingestion.\n *\n * These constants and steps are frozen: both callers' digests are persisted or\n * compared against stored values, so changing anything here silently changes\n * hashes across the system. `hash.test.ts` pins the byte-oriented side against\n * the js-xxhash reference; `query-hash-visitor.test.ts` pins the word-oriented\n * side against a corpus.\n */\n\nexport const PRIME32_1 = 2654435761;\nexport const PRIME32_2 = 2246822519;\nexport const PRIME32_3 = 3266489917;\nexport const PRIME32_4 = 668265263;\nexport const PRIME32_5 = 374761393;\n\n/**\n * One xxHash32 round: fold a 32-bit word into an accumulator.\n *\n * `Math.imul` is the whole multiply. Reference JS ports write it as two 16-bit\n * half-multiplies recombined; that computes the same low 32 bits by a longer\n * route, which is why moving to `Math.imul` left every digest unchanged.\n */\nexport function round32(acc: number, word: number): number {\n  acc = (acc + Math.imul(word, PRIME32_2)) | 0;\n  acc = (acc << 13) | (acc >>> 19);\n  return Math.imul(acc, PRIME32_1);\n}\n\n/**\n * xxHash32's final mix, spreading every input bit across the whole word.\n * Returns an unsigned 32-bit number.\n */\nexport function avalanche32(acc: number): number {\n  acc ^= acc >>> 15;\n  acc = Math.imul(acc, PRIME32_2);\n  acc ^= acc >>> 13;\n  acc = Math.imul(acc, PRIME32_3);\n  acc ^= acc >>> 16;\n  return acc >>> 0;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;AAkBA,IAAa,YAAY;AACzB,IAAa,YAAY;AACzB,IAAa,YAAY;AACzB,IAAa,YAAY;AACzB,IAAa,YAAY;;;;;;;;AASzB,SAAgB,QAAQ,KAAa,MAAsB;CACzD,MAAO,MAAM,KAAK,KAAK,MAAM,SAAS,IAAK;CAC3C,MAAO,OAAO,KAAO,QAAQ;CAC7B,OAAO,KAAK,KAAK,KAAK,SAAS;AACjC;;;;;AAMA,SAAgB,YAAY,KAAqB;CAC/C,OAAO,QAAQ;CACf,MAAM,KAAK,KAAK,KAAK,SAAS;CAC9B,OAAO,QAAQ;CACf,MAAM,KAAK,KAAK,KAAK,SAAS;CAC9B,OAAO,QAAQ;CACf,OAAO,QAAQ;AACjB"}

package/out/zero-cache/src/db/index-predicate.d.ts

@@ -1,4 +0,0 @@
-import type { IndexPredicate } from './specs.ts';
-export declare function liteIndexPredicateSQL(predicate: IndexPredicate): string;
-export declare function mapIndexPredicateColumns(predicate: IndexPredicate, map: (column: string) => string): IndexPredicate;
-//# sourceMappingURL=index-predicate.d.ts.map

package/out/zero-cache/src/db/index-predicate.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index-predicate.d.ts","sourceRoot":"","sources":["../../../../../zero-cache/src/db/index-predicate.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAC,cAAc,EAAsB,MAAM,YAAY,CAAC;AAIpE,wBAAgB,qBAAqB,CAAC,SAAS,EAAE,cAAc,GAAG,MAAM,CAiBvE;AAkBD,wBAAgB,wBAAwB,CACtC,SAAS,EAAE,cAAc,EACzB,GAAG,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,MAAM,GAC9B,cAAc,CAmBhB"}

package/out/zero-cache/src/db/index-predicate.js

@@ -1,46 +0,0 @@
-import { assert } from "../../../shared/src/asserts.js";
-import { id, lit } from "../types/sql.js";
-//#region ../zero-cache/src/db/index-predicate.ts
-var CANONICAL_INTEGER_RE = /^-?(?:0|[1-9]\d*)$/;
-function liteIndexPredicateSQL(predicate) {
-	switch (predicate.type) {
-		case "and":
-		case "or":
-			assert(predicate.conditions.length > 0, "empty index predicate");
-			return `(${predicate.conditions.map(liteIndexPredicateSQL).join(` ${predicate.type.toUpperCase()} `)})`;
-		case "not": return `(NOT ${liteIndexPredicateSQL(predicate.condition)})`;
-		case "null-test": return `${id(predicate.column)} ${predicate.op}`;
-		case "comparison": return `${id(predicate.column)} ${predicate.op} ${predicateValueSQL(predicate.value)}`;
-	}
-}
-function predicateValueSQL(value) {
-	switch (value.type) {
-		case "boolean": return value.value ? "1" : "0";
-		case "integer":
-			assert(CANONICAL_INTEGER_RE.test(value.value), "invalid integer predicate");
-			return value.value;
-		case "string": return lit(value.value);
-	}
-}
-function mapIndexPredicateColumns(predicate, map) {
-	switch (predicate.type) {
-		case "and":
-		case "or": return {
-			...predicate,
-			conditions: predicate.conditions.map((condition) => mapIndexPredicateColumns(condition, map))
-		};
-		case "not": return {
-			...predicate,
-			condition: mapIndexPredicateColumns(predicate.condition, map)
-		};
-		case "null-test":
-		case "comparison": return {
-			...predicate,
-			column: map(predicate.column)
-		};
-	}
-}
-//#endregion
-export { liteIndexPredicateSQL, mapIndexPredicateColumns };
-
-//# sourceMappingURL=index-predicate.js.map

package/out/zero-cache/src/db/index-predicate.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index-predicate.js","names":[],"sources":["../../../../../zero-cache/src/db/index-predicate.ts"],"sourcesContent":["import {assert} from '../../../shared/src/asserts.ts';\nimport {id, lit} from '../types/sql.ts';\nimport type {IndexPredicate, IndexPredicateValue} from './specs.ts';\n\nconst CANONICAL_INTEGER_RE = /^-?(?:0|[1-9]\\d*)$/;\n\nexport function liteIndexPredicateSQL(predicate: IndexPredicate): string {\n  switch (predicate.type) {\n    case 'and':\n    case 'or':\n      assert(predicate.conditions.length > 0, 'empty index predicate');\n      return `(${predicate.conditions\n        .map(liteIndexPredicateSQL)\n        .join(` ${predicate.type.toUpperCase()} `)})`;\n    case 'not':\n      return `(NOT ${liteIndexPredicateSQL(predicate.condition)})`;\n    case 'null-test':\n      return `${id(predicate.column)} ${predicate.op}`;\n    case 'comparison':\n      return `${id(predicate.column)} ${predicate.op} ${predicateValueSQL(\n        predicate.value,\n      )}`;\n  }\n}\n\nfunction predicateValueSQL(value: IndexPredicateValue): string {\n  switch (value.type) {\n    case 'boolean':\n      return value.value ? '1' : '0';\n    case 'integer':\n      // The PostgreSQL translator only constructs canonical decimal integers.\n      assert(\n        CANONICAL_INTEGER_RE.test(value.value),\n        'invalid integer predicate',\n      );\n      return value.value;\n    case 'string':\n      return lit(value.value);\n  }\n}\n\nexport function mapIndexPredicateColumns(\n  predicate: IndexPredicate,\n  map: (column: string) => string,\n): IndexPredicate {\n  switch (predicate.type) {\n    case 'and':\n    case 'or':\n      return {\n        ...predicate,\n        conditions: predicate.conditions.map(condition =>\n          mapIndexPredicateColumns(condition, map),\n        ),\n      };\n    case 'not':\n      return {\n        ...predicate,\n        condition: mapIndexPredicateColumns(predicate.condition, map),\n      };\n    case 'null-test':\n    case 'comparison':\n      return {...predicate, column: map(predicate.column)};\n  }\n}\n"],"mappings":";;;AAIA,IAAM,uBAAuB;AAE7B,SAAgB,sBAAsB,WAAmC;CACvE,QAAQ,UAAU,MAAlB;EACE,KAAK;EACL,KAAK;GACH,OAAO,UAAU,WAAW,SAAS,GAAG,uBAAuB;GAC/D,OAAO,IAAI,UAAU,WAClB,IAAI,qBAAqB,EACzB,KAAK,IAAI,UAAU,KAAK,YAAY,EAAE,EAAE,EAAE;EAC/C,KAAK,OACH,OAAO,QAAQ,sBAAsB,UAAU,SAAS,EAAE;EAC5D,KAAK,aACH,OAAO,GAAG,GAAG,UAAU,MAAM,EAAE,GAAG,UAAU;EAC9C,KAAK,cACH,OAAO,GAAG,GAAG,UAAU,MAAM,EAAE,GAAG,UAAU,GAAG,GAAG,kBAChD,UAAU,KACZ;CACJ;AACF;AAEA,SAAS,kBAAkB,OAAoC;CAC7D,QAAQ,MAAM,MAAd;EACE,KAAK,WACH,OAAO,MAAM,QAAQ,MAAM;EAC7B,KAAK;GAEH,OACE,qBAAqB,KAAK,MAAM,KAAK,GACrC,2BACF;GACA,OAAO,MAAM;EACf,KAAK,UACH,OAAO,IAAI,MAAM,KAAK;CAC1B;AACF;AAEA,SAAgB,yBACd,WACA,KACgB;CAChB,QAAQ,UAAU,MAAlB;EACE,KAAK;EACL,KAAK,MACH,OAAO;GACL,GAAG;GACH,YAAY,UAAU,WAAW,KAAI,cACnC,yBAAyB,WAAW,GAAG,CACzC;EACF;EACF,KAAK,OACH,OAAO;GACL,GAAG;GACH,WAAW,yBAAyB,UAAU,WAAW,GAAG;EAC9D;EACF,KAAK;EACL,KAAK,cACH,OAAO;GAAC,GAAG;GAAW,QAAQ,IAAI,UAAU,MAAM;EAAC;CACvD;AACF"}

package/out/zero-cache/src/services/change-source/pg/schema/index-predicate.d.ts

@@ -1,19 +0,0 @@
-import type { IndexPredicate, PublishedTableSpec } from '../../../../db/specs.ts';
-export declare const unsupportedPredicateReasons: readonly ["unpublished-column", "unsupported-type", "unsupported-operator", "unsupported-function", "unsupported-cast", "unsupported-syntax", "non-deterministic-collation"];
-export type UnsupportedPredicateReason = (typeof unsupportedPredicateReasons)[number];
-export type PredicateTranslation = {
-    readonly supported: true;
-    readonly predicate: IndexPredicate;
-} | {
-    readonly supported: false;
-    readonly reason: UnsupportedPredicateReason;
-};
-type PredicateColumnSpec = PublishedTableSpec['columns'][string] & {
-    readonly collationIsDeterministic?: boolean | null | undefined;
-};
-type PredicateTableSpec = Omit<PublishedTableSpec, 'columns'> & {
-    readonly columns: Readonly<Record<string, PredicateColumnSpec>>;
-};
-export declare function translatePostgresIndexPredicate(sql: string, table: PredicateTableSpec): PredicateTranslation;
-export {};
-//# sourceMappingURL=index-predicate.d.ts.map

package/out/zero-cache/src/services/change-source/pg/schema/index-predicate.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index-predicate.d.ts","sourceRoot":"","sources":["../../../../../../../../zero-cache/src/services/change-source/pg/schema/index-predicate.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EACV,cAAc,EAEd,kBAAkB,EACnB,MAAM,yBAAyB,CAAC;AAmBjC,eAAO,MAAM,2BAA2B,8KAQ9B,CAAC;AAEX,MAAM,MAAM,0BAA0B,GACpC,CAAC,OAAO,2BAA2B,CAAC,CAAC,MAAM,CAAC,CAAC;AAE/C,MAAM,MAAM,oBAAoB,GAC5B;IAAC,QAAQ,CAAC,SAAS,EAAE,IAAI,CAAC;IAAC,QAAQ,CAAC,SAAS,EAAE,cAAc,CAAA;CAAC,GAC9D;IAAC,QAAQ,CAAC,SAAS,EAAE,KAAK,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,0BAA0B,CAAA;CAAC,CAAC;AAE7E,KAAK,mBAAmB,GAAG,kBAAkB,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,GAAG;IACjE,QAAQ,CAAC,wBAAwB,CAAC,EAAE,OAAO,GAAG,IAAI,GAAG,SAAS,CAAC;CAChE,CAAC;AAEF,KAAK,kBAAkB,GAAG,IAAI,CAAC,kBAAkB,EAAE,SAAS,CAAC,GAAG;IAC9D,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,mBAAmB,CAAC,CAAC,CAAC;CACjE,CAAC;AAoEF,wBAAgB,+BAA+B,CAC7C,GAAG,EAAE,MAAM,EACX,KAAK,EAAE,kBAAkB,GACxB,oBAAoB,CAetB"}