@gaganref/confect-test 10.3.1-fork.91 → 10.3.1-fork.93

package/dist/internal/KernelQuery.js

@@ -35,9 +35,11 @@ const resolveSource = (view, query) => {
 	let order;
 	let table;
 	let range = [];
+	let index;
 	switch (source.type) {
 		case "FullTableScan":
 			table = source.tableName;
+			index = "by_creation_time";
 			docs = [...view.scan(source.tableName)];
 			order = source.order ?? "asc";
 			fieldPathsToSortBy = ["_creationTime"];
@@ -45,15 +47,16 @@ const resolveSource = (view, query) => {
 		case "IndexRange": {
 			const [tableName, indexName] = source.indexName.split(".");
 			table = tableName;
+			index = indexName;
 			range = source.range;
 			order = source.order ?? "asc";
 			let fields;
 			if (indexName === "by_creation_time") fields = ["_creationTime", "_id"];
 			else if (indexName === "by_id") fields = ["_id"];
 			else {
-				const index = view.schema?.tables.get(tableName)?.indexes.find(({ indexDescriptor }) => indexDescriptor === indexName);
-				if (index === void 0) throw new Error(`Cannot use index "${indexName}" for table "${tableName}" because it is not declared in the schema.`);
-				fields = index.fields.concat(["_creationTime", "_id"]);
+				const declared = view.schema?.tables.get(tableName)?.indexes.find(({ indexDescriptor }) => indexDescriptor === indexName);
+				if (declared === void 0) throw new Error(`Cannot use index "${indexName}" for table "${tableName}" because it is not declared in the schema.`);
+				fields = declared.fields.concat(["_creationTime", "_id"]);
 			}
 			fieldPathsToSortBy = fields;
 			validateIndexRangeExpression(source, fields);
@@ -79,6 +82,7 @@ const resolveSource = (view, query) => {
 		order,
 		interval: {
 			kind: "interval",
+			index,
 			table,
 			fields: fieldPathsToSortBy.includes("_id") ? fieldPathsToSortBy : [...fieldPathsToSortBy, "_id"],
 			order,
@@ -98,6 +102,7 @@ const stream = (view, query) => {
 		let returned = 0;
 		for (const doc of sortedDocs) {
 			if (limit !== null && returned >= limit) return;
+			view.examine(interval.table, doc);
 			examined(keyOf(interval.fields, doc));
 			if (filterFn(doc)) {
 				returned++;
@@ -158,6 +163,7 @@ const paginate = (view, { query, cursor, endCursor, pageSize, maximumRowsRead, m
 				reachedEnd = false;
 				examined(endCursorKeys);
 				if (cmp === 0) {
+					view.examine(interval.table, doc);
 					rowsRead += 1;
 					bytesRead += getDocumentSize(doc);
 					readDocCursors.push(encodeCursor(doc, cursorFields));
@@ -167,6 +173,7 @@ const paginate = (view, { query, cursor, endCursor, pageSize, maximumRowsRead, m
 				break;
 			}
 		}
+		view.examine(interval.table, doc);
 		rowsRead += 1;
 		bytesRead += getDocumentSize(doc);
 		readDocCursors.push(encodeCursor(doc, cursorFields));

package/dist/internal/KernelQuery.js.map

@@ -1 +1 @@
-{"version":3,"file":"KernelQuery.js","names":["KernelRefusal.requiresBinary","ReadSet.keyOf"],"sources":["../../src/internal/KernelQuery.ts"],"sourcesContent":["// Derived from convex-test 0.0.65 (index.ts, `DatabaseFake`), Copyright Convex,\n// Inc., licensed under the Apache License, Version 2.0\n// (https://www.apache.org/licenses/LICENSE-2.0). The ordering, index range and\n// pagination rules are convex-test's. They read a table through the attempt\n// that runs the query instead of convex-test's database, and record the\n// interval each query examined.\n\nimport type {\n  GenericDocument,\n  GenericSchema,\n  SchemaDefinition,\n} from \"convex/server\";\nimport {\n  compareValues,\n  convexToJson,\n  getDocumentSize,\n  jsonToConvex,\n} from \"convex/values\";\nimport * as KernelRefusal from \"./KernelRefusal.js\";\nimport * as ReadSet from \"./ReadSet.js\";\nimport type {\n  FilterJson,\n  Index,\n  SerializedQuery,\n  SerializedRangeExpression,\n  StoredDocument,\n  ValidatorJSON,\n} from \"./KernelValues.js\";\nimport {\n  evaluateFieldPath,\n  evaluateFilter,\n  evaluateRangeFilter,\n  isValidIdentifier,\n  resolvePendingValues,\n  validateFieldNames,\n  validateIndexRangeExpression,\n  validateValidator,\n} from \"./KernelValues.js\";\n\n/**\n * A component's tables as its schema declares them.\n */\nexport interface KernelSchema {\n  readonly schemaValidation: boolean;\n  readonly tables: ReadonlyMap<\n    string,\n    {\n      readonly indexes: ReadonlyArray<Index>;\n      readonly documentType: ValidatorJSON;\n    }\n  >;\n}\n\nexport const exportSchema = (\n  schema: SchemaDefinition<GenericSchema, boolean> | null | undefined,\n): KernelSchema | null => {\n  if (schema === null || schema === undefined) return null;\n  const exported: KernelSchema = {\n    schemaValidation: (schema as unknown as { schemaValidation: boolean })\n      .schemaValidation,\n    tables: new Map(\n      Object.entries(schema.tables).map(([name, table]) => [\n        name,\n        (table as unknown as { export: () => any }).export(),\n      ]),\n    ),\n  };\n  exported.tables.forEach((table, tableName) => {\n    if (!isValidIdentifier(tableName)) {\n      throw new Error(\n        `Table names must be valid identifiers, got \"${tableName}\"`,\n      );\n    }\n    validateFieldNames(table.documentType);\n    table.indexes.forEach(({ indexDescriptor }) => {\n      if (!isValidIdentifier(indexDescriptor)) {\n        throw new Error(\n          `Index names must be valid identifiers, got \"${indexDescriptor}\"`,\n        );\n      }\n    });\n  });\n  return exported;\n};\n\n/**\n * Check a document against its table's declared type, as the backend does\n * before a write.\n */\nexport const validateDocument = (\n  schema: KernelSchema | null,\n  tableName: string,\n  doc: Record<string, unknown>,\n) => {\n  if (schema === null || !schema.schemaValidation) return;\n  const validator = schema.tables.get(tableName)?.documentType;\n  if (validator === undefined) return;\n  validateValidator(validator, resolvePendingValues(doc as GenericDocument));\n};\n\n/**\n * An interval a query reads, before it says where it starts and how far it got.\n */\nexport type Interval = Omit<\n  ReadSet.IntervalRead,\n  \"componentPath\" | \"after\" | \"through\"\n>;\n\n/**\n * What a query reads: one table of one component, as the running attempt sees\n * it. `read` records an interval in the attempt's read set and returns how to\n * advance it.\n */\nexport interface TableView {\n  readonly schema: KernelSchema | null;\n  readonly scan: (tableName: string) => ReadonlyArray<StoredDocument>;\n  readonly read: (\n    interval: Interval,\n    after: ReadSet.Key | null,\n  ) => (through: ReadSet.Key | \"end\") => void;\n}\n\ninterface ResolvedSource {\n  readonly sortedDocs: ReadonlyArray<GenericDocument>;\n  readonly filterFn: (doc: GenericDocument) => boolean;\n  readonly limit: number | null;\n  readonly order: \"asc\" | \"desc\";\n  readonly interval: Interval;\n}\n\nconst resolveSource = (\n  view: TableView,\n  query: SerializedQuery,\n): ResolvedSource => {\n  const source = query.source;\n  let docs: Array<GenericDocument>;\n  let fieldPathsToSortBy: Array<string>;\n  let order: \"asc\" | \"desc\";\n  let table: string;\n  let range: ReadonlyArray<SerializedRangeExpression> = [];\n  switch (source.type) {\n    case \"FullTableScan\": {\n      table = source.tableName;\n      docs = [...view.scan(source.tableName)];\n      order = source.order ?? \"asc\";\n      fieldPathsToSortBy = [\"_creationTime\"];\n      break;\n    }\n    case \"IndexRange\": {\n      const [tableName, indexName] = source.indexName.split(\".\") as [\n        string,\n        string,\n      ];\n      table = tableName;\n      range = source.range;\n      order = source.order ?? \"asc\";\n      let fields: Array<string>;\n      if (indexName === \"by_creation_time\") {\n        fields = [\"_creationTime\", \"_id\"];\n      } else if (indexName === \"by_id\") {\n        fields = [\"_id\"];\n      } else {\n        const index = view.schema?.tables\n          .get(tableName)\n          ?.indexes.find(\n            ({ indexDescriptor }) => indexDescriptor === indexName,\n          );\n        if (index === undefined) {\n          throw new Error(\n            `Cannot use index \"${indexName}\" for table \"${tableName}\" because ` +\n              `it is not declared in the schema.`,\n          );\n        }\n        fields = index.fields.concat([\"_creationTime\", \"_id\"]);\n      }\n      fieldPathsToSortBy = fields;\n      validateIndexRangeExpression(source, fields);\n      docs = view\n        .scan(tableName)\n        .filter((doc) =>\n          source.range.every((filter) => evaluateRangeFilter(doc, filter)),\n        );\n      break;\n    }\n    case \"Search\": {\n      throw KernelRefusal.requiresBinary(\"textSearch\");\n    }\n  }\n\n  const filters = query.operators\n    .filter(\n      (operator): operator is { filter: FilterJson } => \"filter\" in operator,\n    )\n    .map((operator) => operator.filter);\n  const limit =\n    query.operators.find(\n      (operator): operator is { limit: number } => \"limit\" in operator,\n    ) ?? null;\n\n  const orderMultiplier = order === \"asc\" ? 1 : -1;\n  docs.sort((a, b) => {\n    for (const fp of fieldPathsToSortBy) {\n      const v = compareValues(\n        evaluateFieldPath(fp, a),\n        evaluateFieldPath(fp, b),\n      );\n      if (v !== 0) return v * orderMultiplier;\n    }\n    return 0;\n  });\n\n  return {\n    sortedDocs: docs,\n    filterFn: (doc) => filters.every((f) => evaluateFilter(doc, f)),\n    limit: limit?.limit ?? null,\n    order,\n    interval: {\n      kind: \"interval\",\n      table,\n      fields: fieldPathsToSortBy.includes(\"_id\")\n        ? fieldPathsToSortBy\n        : [...fieldPathsToSortBy, \"_id\"],\n      order,\n      range,\n    },\n  };\n};\n\n/**\n * A query's documents in order. The source is read when the query starts, as a\n * snapshot, and consumed lazily. The read set holds the prefix the stream has\n * examined, filtered documents included, or the whole range once it ends.\n */\nexport const stream = (\n  view: TableView,\n  query: SerializedQuery,\n): Iterator<GenericDocument> => {\n  const { sortedDocs, filterFn, limit, interval } = resolveSource(view, query);\n  const examined = view.read(interval, null);\n  return (function* () {\n    let returned = 0;\n    for (const doc of sortedDocs) {\n      if (limit !== null && returned >= limit) return;\n      examined(ReadSet.keyOf(interval.fields, doc as StoredDocument));\n      if (filterFn(doc)) {\n        returned++;\n        yield doc;\n      }\n    }\n    examined(\"end\");\n  })();\n};\n\nconst encodeCursor = (\n  doc: GenericDocument,\n  fieldPaths: ReadonlyArray<string>,\n): string =>\n  JSON.stringify(\n    fieldPaths.map((fp) => {\n      const k = evaluateFieldPath(fp, doc);\n      return k === undefined ? null : JSON.stringify(convexToJson(k));\n    }),\n  );\n\nconst parseCursor = (c: string | null | undefined) =>\n  c\n    ? (JSON.parse(c) as Array<string | null>).map((k) =>\n        k === null ? undefined : jsonToConvex(JSON.parse(k)),\n      )\n    : null;\n\nconst compareToCursor = (\n  doc: GenericDocument,\n  cursorKeys: ReadonlyArray<unknown>,\n  fieldPaths: ReadonlyArray<string>,\n  order: \"asc\" | \"desc\",\n): number => {\n  const orderMultiplier = order === \"asc\" ? 1 : -1;\n  for (let i = 0; i < fieldPaths.length; i++) {\n    const cmp = compareValues(\n      evaluateFieldPath(fieldPaths[i]!, doc),\n      cursorKeys[i] as any,\n    );\n    if (cmp !== 0) return cmp * orderMultiplier;\n  }\n  return 0;\n};\n\nexport interface PageRequest {\n  readonly query: SerializedQuery;\n  readonly cursor: string | null;\n  readonly endCursor?: string | null;\n  readonly pageSize: number;\n  readonly maximumRowsRead?: number | null;\n  readonly maximumBytesRead?: number | null;\n}\n\nexport const paginate = (\n  view: TableView,\n  {\n    query,\n    cursor,\n    endCursor,\n    pageSize,\n    maximumRowsRead,\n    maximumBytesRead,\n  }: PageRequest,\n) => {\n  const { sortedDocs, filterFn, order, interval } = resolveSource(view, query);\n  // A page from the terminal cursor reads the empty interval past the end, so\n  // it depends on nothing.\n  if (cursor === \"_end_cursor\") {\n    return {\n      page: [],\n      isDone: true,\n      continueCursor: \"_end_cursor\",\n      splitCursor: null,\n      pageStatus: null,\n    };\n  }\n  const cursorFields = interval.fields;\n  const cursorKeys = parseCursor(cursor);\n  const hasEndBoundary = !!endCursor && endCursor !== \"_end_cursor\";\n  const endCursorKeys = hasEndBoundary ? parseCursor(endCursor) : null;\n  const examined = view.read(interval, cursorKeys);\n  let reachedEnd = true;\n\n  const page: Array<GenericDocument> = [];\n  let isInPage = cursor === null;\n  let continueCursor = \"_end_cursor\";\n  let splitCursor: string | null = null;\n  let pageStatus: \"SplitRecommended\" | \"SplitRequired\" | null = null;\n  let rowsRead = 0;\n  let bytesRead = 0;\n  const readDocCursors: Array<string> = [];\n\n  for (let i = 0; i < sortedDocs.length; i++) {\n    const doc = sortedDocs[i]!;\n    const isLastDoc = i === sortedDocs.length - 1;\n    if (!isInPage) {\n      if (cursorKeys) {\n        if (compareToCursor(doc, cursorKeys, cursorFields, order) > 0) {\n          isInPage = true;\n        } else {\n          continue;\n        }\n      }\n    }\n    if (hasEndBoundary && endCursorKeys) {\n      const cmp = compareToCursor(doc, endCursorKeys, cursorFields, order);\n      if (cmp >= 0) {\n        reachedEnd = false;\n        examined(endCursorKeys);\n        if (cmp === 0) {\n          rowsRead += 1;\n          bytesRead += getDocumentSize(doc);\n          readDocCursors.push(encodeCursor(doc, cursorFields));\n          if (filterFn(doc)) page.push(doc);\n          continueCursor = encodeCursor(doc, cursorFields);\n        }\n        break;\n      }\n    }\n    rowsRead += 1;\n    bytesRead += getDocumentSize(doc);\n    readDocCursors.push(encodeCursor(doc, cursorFields));\n    examined(ReadSet.keyOf(cursorFields, doc as StoredDocument));\n    const hitLimit =\n      (!!maximumRowsRead && rowsRead >= maximumRowsRead) ||\n      (!!maximumBytesRead && bytesRead >= maximumBytesRead);\n    if (filterFn(doc)) page.push(doc);\n    if (hitLimit) {\n      reachedEnd = false;\n      pageStatus = \"SplitRequired\";\n      continueCursor = encodeCursor(doc, cursorFields);\n      break;\n    }\n    if (!endCursor && page.length >= pageSize) {\n      reachedEnd = isLastDoc;\n      if (!isLastDoc) continueCursor = encodeCursor(doc, cursorFields);\n      break;\n    }\n  }\n  // A page bounded by an end cursor examined the range only up to it.\n  if (reachedEnd) examined(endCursorKeys ?? \"end\");\n\n  if (pageStatus === \"SplitRequired\" && readDocCursors.length >= 2) {\n    splitCursor = readDocCursors[Math.floor((readDocCursors.length - 1) / 2)]!;\n  } else if (\n    pageStatus === null &&\n    rowsRead > pageSize + 1 &&\n    readDocCursors.length >= 2\n  ) {\n    pageStatus = \"SplitRecommended\";\n    splitCursor = readDocCursors[Math.floor((readDocCursors.length - 1) / 2)]!;\n  }\n\n  return {\n    page,\n    isDone: continueCursor === \"_end_cursor\",\n    continueCursor,\n    splitCursor,\n    pageStatus,\n  };\n};\n"],"mappings":";;;;;AAqDA,MAAa,gBACX,WACwB;CACxB,IAAI,WAAW,QAAQ,WAAW,KAAA,GAAW,OAAO;CACpD,MAAM,WAAyB;EAC7B,kBAAmB,OAChB;EACH,QAAQ,IAAI,IACV,OAAO,QAAQ,OAAO,MAAM,CAAC,CAAC,KAAK,CAAC,MAAM,WAAW,CACnD,MACC,MAA2C,OAAO,CACrD,CAAC,CACH;CACF;CACA,SAAS,OAAO,SAAS,OAAO,cAAc;EAC5C,IAAI,CAAC,kBAAkB,SAAS,GAC9B,MAAM,IAAI,MACR,+CAA+C,UAAU,EAC3D;EAEF,mBAAmB,MAAM,YAAY;EACrC,MAAM,QAAQ,SAAS,EAAE,sBAAsB;GAC7C,IAAI,CAAC,kBAAkB,eAAe,GACpC,MAAM,IAAI,MACR,+CAA+C,gBAAgB,EACjE;EAEJ,CAAC;CACH,CAAC;CACD,OAAO;AACT;;;;;AAMA,MAAa,oBACX,QACA,WACA,QACG;CACH,IAAI,WAAW,QAAQ,CAAC,OAAO,kBAAkB;CACjD,MAAM,YAAY,OAAO,OAAO,IAAI,SAAS,CAAC,EAAE;CAChD,IAAI,cAAc,KAAA,GAAW;CAC7B,kBAAkB,WAAW,qBAAqB,GAAsB,CAAC;AAC3E;AAgCA,MAAM,iBACJ,MACA,UACmB;CACnB,MAAM,SAAS,MAAM;CACrB,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI,QAAkD,CAAC;CACvD,QAAQ,OAAO,MAAf;EACE,KAAK;GACH,QAAQ,OAAO;GACf,OAAO,CAAC,GAAG,KAAK,KAAK,OAAO,SAAS,CAAC;GACtC,QAAQ,OAAO,SAAS;GACxB,qBAAqB,CAAC,eAAe;GACrC;EAEF,KAAK,cAAc;GACjB,MAAM,CAAC,WAAW,aAAa,OAAO,UAAU,MAAM,GAAG;GAIzD,QAAQ;GACR,QAAQ,OAAO;GACf,QAAQ,OAAO,SAAS;GACxB,IAAI;GACJ,IAAI,cAAc,oBAChB,SAAS,CAAC,iBAAiB,KAAK;QAC3B,IAAI,cAAc,SACvB,SAAS,CAAC,KAAK;QACV;IACL,MAAM,QAAQ,KAAK,QAAQ,OACxB,IAAI,SAAS,CAAC,EACb,QAAQ,MACP,EAAE,sBAAsB,oBAAoB,SAC/C;IACF,IAAI,UAAU,KAAA,GACZ,MAAM,IAAI,MACR,qBAAqB,UAAU,eAAe,UAAU,4CAE1D;IAEF,SAAS,MAAM,OAAO,OAAO,CAAC,iBAAiB,KAAK,CAAC;GACvD;GACA,qBAAqB;GACrB,6BAA6B,QAAQ,MAAM;GAC3C,OAAO,KACJ,KAAK,SAAS,CAAC,CACf,QAAQ,QACP,OAAO,MAAM,OAAO,WAAW,oBAAoB,KAAK,MAAM,CAAC,CACjE;GACF;EACF;EACA,KAAK,UACH,MAAMA,eAA6B,YAAY;CAEnD;CAEA,MAAM,UAAU,MAAM,UACnB,QACE,aAAiD,YAAY,QAChE,CAAC,CACA,KAAK,aAAa,SAAS,MAAM;CACpC,MAAM,QACJ,MAAM,UAAU,MACb,aAA4C,WAAW,QAC1D,KAAK;CAEP,MAAM,kBAAkB,UAAU,QAAQ,IAAI;CAC9C,KAAK,MAAM,GAAG,MAAM;EAClB,KAAK,MAAM,MAAM,oBAAoB;GACnC,MAAM,IAAI,cACR,kBAAkB,IAAI,CAAC,GACvB,kBAAkB,IAAI,CAAC,CACzB;GACA,IAAI,MAAM,GAAG,OAAO,IAAI;EAC1B;EACA,OAAO;CACT,CAAC;CAED,OAAO;EACL,YAAY;EACZ,WAAW,QAAQ,QAAQ,OAAO,MAAM,eAAe,KAAK,CAAC,CAAC;EAC9D,OAAO,OAAO,SAAS;EACvB;EACA,UAAU;GACR,MAAM;GACN;GACA,QAAQ,mBAAmB,SAAS,KAAK,IACrC,qBACA,CAAC,GAAG,oBAAoB,KAAK;GACjC;GACA;EACF;CACF;AACF;;;;;;AAOA,MAAa,UACX,MACA,UAC8B;CAC9B,MAAM,EAAE,YAAY,UAAU,OAAO,aAAa,cAAc,MAAM,KAAK;CAC3E,MAAM,WAAW,KAAK,KAAK,UAAU,IAAI;CACzC,QAAQ,aAAa;EACnB,IAAI,WAAW;EACf,KAAK,MAAM,OAAO,YAAY;GAC5B,IAAI,UAAU,QAAQ,YAAY,OAAO;GACzC,SAASC,MAAc,SAAS,QAAQ,GAAqB,CAAC;GAC9D,IAAI,SAAS,GAAG,GAAG;IACjB;IACA,MAAM;GACR;EACF;EACA,SAAS,KAAK;CAChB,EAAA,CAAG;AACL;AAEA,MAAM,gBACJ,KACA,eAEA,KAAK,UACH,WAAW,KAAK,OAAO;CACrB,MAAM,IAAI,kBAAkB,IAAI,GAAG;CACnC,OAAO,MAAM,KAAA,IAAY,OAAO,KAAK,UAAU,aAAa,CAAC,CAAC;AAChE,CAAC,CACH;AAEF,MAAM,eAAe,MACnB,IACK,KAAK,MAAM,CAAC,CAAC,CAA0B,KAAK,MAC3C,MAAM,OAAO,KAAA,IAAY,aAAa,KAAK,MAAM,CAAC,CAAC,CACrD,IACA;AAEN,MAAM,mBACJ,KACA,YACA,YACA,UACW;CACX,MAAM,kBAAkB,UAAU,QAAQ,IAAI;CAC9C,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;EAC1C,MAAM,MAAM,cACV,kBAAkB,WAAW,IAAK,GAAG,GACrC,WAAW,EACb;EACA,IAAI,QAAQ,GAAG,OAAO,MAAM;CAC9B;CACA,OAAO;AACT;AAWA,MAAa,YACX,MACA,EACE,OACA,QACA,WACA,UACA,iBACA,uBAEC;CACH,MAAM,EAAE,YAAY,UAAU,OAAO,aAAa,cAAc,MAAM,KAAK;CAG3E,IAAI,WAAW,eACb,OAAO;EACL,MAAM,CAAC;EACP,QAAQ;EACR,gBAAgB;EAChB,aAAa;EACb,YAAY;CACd;CAEF,MAAM,eAAe,SAAS;CAC9B,MAAM,aAAa,YAAY,MAAM;CACrC,MAAM,iBAAiB,CAAC,CAAC,aAAa,cAAc;CACpD,MAAM,gBAAgB,iBAAiB,YAAY,SAAS,IAAI;CAChE,MAAM,WAAW,KAAK,KAAK,UAAU,UAAU;CAC/C,IAAI,aAAa;CAEjB,MAAM,OAA+B,CAAC;CACtC,IAAI,WAAW,WAAW;CAC1B,IAAI,iBAAiB;CACrB,IAAI,cAA6B;CACjC,IAAI,aAA0D;CAC9D,IAAI,WAAW;CACf,IAAI,YAAY;CAChB,MAAM,iBAAgC,CAAC;CAEvC,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;EAC1C,MAAM,MAAM,WAAW;EACvB,MAAM,YAAY,MAAM,WAAW,SAAS;EAC5C,IAAI,CAAC,UACC;OAAA,YAAY;IACd,IAAI,gBAAgB,KAAK,YAAY,cAAc,KAAK,IAAI,GAC1D,WAAW;SAEX;GAEJ;;EAEF,IAAI,kBAAkB,eAAe;GACnC,MAAM,MAAM,gBAAgB,KAAK,eAAe,cAAc,KAAK;GACnE,IAAI,OAAO,GAAG;IACZ,aAAa;IACb,SAAS,aAAa;IACtB,IAAI,QAAQ,GAAG;KACb,YAAY;KACZ,aAAa,gBAAgB,GAAG;KAChC,eAAe,KAAK,aAAa,KAAK,YAAY,CAAC;KACnD,IAAI,SAAS,GAAG,GAAG,KAAK,KAAK,GAAG;KAChC,iBAAiB,aAAa,KAAK,YAAY;IACjD;IACA;GACF;EACF;EACA,YAAY;EACZ,aAAa,gBAAgB,GAAG;EAChC,eAAe,KAAK,aAAa,KAAK,YAAY,CAAC;EACnD,SAASA,MAAc,cAAc,GAAqB,CAAC;EAC3D,MAAM,WACH,CAAC,CAAC,mBAAmB,YAAY,mBACjC,CAAC,CAAC,oBAAoB,aAAa;EACtC,IAAI,SAAS,GAAG,GAAG,KAAK,KAAK,GAAG;EAChC,IAAI,UAAU;GACZ,aAAa;GACb,aAAa;GACb,iBAAiB,aAAa,KAAK,YAAY;GAC/C;EACF;EACA,IAAI,CAAC,aAAa,KAAK,UAAU,UAAU;GACzC,aAAa;GACb,IAAI,CAAC,WAAW,iBAAiB,aAAa,KAAK,YAAY;GAC/D;EACF;CACF;CAEA,IAAI,YAAY,SAAS,iBAAiB,KAAK;CAE/C,IAAI,eAAe,mBAAmB,eAAe,UAAU,GAC7D,cAAc,eAAe,KAAK,OAAO,eAAe,SAAS,KAAK,CAAC;MAClE,IACL,eAAe,QACf,WAAW,WAAW,KACtB,eAAe,UAAU,GACzB;EACA,aAAa;EACb,cAAc,eAAe,KAAK,OAAO,eAAe,SAAS,KAAK,CAAC;CACzE;CAEA,OAAO;EACL;EACA,QAAQ,mBAAmB;EAC3B;EACA;EACA;CACF;AACF"}
+{"version":3,"file":"KernelQuery.js","names":["KernelRefusal.requiresBinary","ReadSet.keyOf"],"sources":["../../src/internal/KernelQuery.ts"],"sourcesContent":["// Derived from convex-test 0.0.65 (index.ts, `DatabaseFake`), Copyright Convex,\n// Inc., licensed under the Apache License, Version 2.0\n// (https://www.apache.org/licenses/LICENSE-2.0). The ordering, index range and\n// pagination rules are convex-test's. They read a table through the attempt\n// that runs the query instead of convex-test's database, and record the\n// interval each query examined.\n\nimport type {\n  GenericDocument,\n  GenericSchema,\n  SchemaDefinition,\n} from \"convex/server\";\nimport {\n  compareValues,\n  convexToJson,\n  getDocumentSize,\n  jsonToConvex,\n} from \"convex/values\";\nimport * as KernelRefusal from \"./KernelRefusal.js\";\nimport * as ReadSet from \"./ReadSet.js\";\nimport type {\n  FilterJson,\n  Index,\n  SerializedQuery,\n  SerializedRangeExpression,\n  StoredDocument,\n  ValidatorJSON,\n} from \"./KernelValues.js\";\nimport {\n  evaluateFieldPath,\n  evaluateFilter,\n  evaluateRangeFilter,\n  isValidIdentifier,\n  resolvePendingValues,\n  validateFieldNames,\n  validateIndexRangeExpression,\n  validateValidator,\n} from \"./KernelValues.js\";\n\n/**\n * A component's tables as its schema declares them.\n */\nexport interface KernelSchema {\n  readonly schemaValidation: boolean;\n  readonly tables: ReadonlyMap<\n    string,\n    {\n      readonly indexes: ReadonlyArray<Index>;\n      readonly documentType: ValidatorJSON;\n    }\n  >;\n}\n\nexport const exportSchema = (\n  schema: SchemaDefinition<GenericSchema, boolean> | null | undefined,\n): KernelSchema | null => {\n  if (schema === null || schema === undefined) return null;\n  const exported: KernelSchema = {\n    schemaValidation: (schema as unknown as { schemaValidation: boolean })\n      .schemaValidation,\n    tables: new Map(\n      Object.entries(schema.tables).map(([name, table]) => [\n        name,\n        (table as unknown as { export: () => any }).export(),\n      ]),\n    ),\n  };\n  exported.tables.forEach((table, tableName) => {\n    if (!isValidIdentifier(tableName)) {\n      throw new Error(\n        `Table names must be valid identifiers, got \"${tableName}\"`,\n      );\n    }\n    validateFieldNames(table.documentType);\n    table.indexes.forEach(({ indexDescriptor }) => {\n      if (!isValidIdentifier(indexDescriptor)) {\n        throw new Error(\n          `Index names must be valid identifiers, got \"${indexDescriptor}\"`,\n        );\n      }\n    });\n  });\n  return exported;\n};\n\n/**\n * Check a document against its table's declared type, as the backend does\n * before a write.\n */\nexport const validateDocument = (\n  schema: KernelSchema | null,\n  tableName: string,\n  doc: Record<string, unknown>,\n) => {\n  if (schema === null || !schema.schemaValidation) return;\n  const validator = schema.tables.get(tableName)?.documentType;\n  if (validator === undefined) return;\n  validateValidator(validator, resolvePendingValues(doc as GenericDocument));\n};\n\n/**\n * An interval a query reads, before it says where it starts and how far it got,\n * and the index it reads it from.\n */\nexport type Interval = Omit<\n  ReadSet.IntervalRead,\n  \"componentPath\" | \"after\" | \"through\"\n> & { readonly index: string };\n\n/**\n * What a query reads: one table of one component, as the running attempt sees\n * it. `read` records an interval in the attempt's read set and returns how to\n * advance it. `examine` charges one document the query examined, before the\n * query's filters see it.\n */\nexport interface TableView {\n  readonly schema: KernelSchema | null;\n  readonly scan: (tableName: string) => ReadonlyArray<StoredDocument>;\n  readonly read: (\n    interval: Interval,\n    after: ReadSet.Key | null,\n  ) => (through: ReadSet.Key | \"end\") => void;\n  readonly examine: (table: string, doc: GenericDocument) => void;\n}\n\ninterface ResolvedSource {\n  readonly sortedDocs: ReadonlyArray<GenericDocument>;\n  readonly filterFn: (doc: GenericDocument) => boolean;\n  readonly limit: number | null;\n  readonly order: \"asc\" | \"desc\";\n  readonly interval: Interval;\n}\n\nconst resolveSource = (\n  view: TableView,\n  query: SerializedQuery,\n): ResolvedSource => {\n  const source = query.source;\n  let docs: Array<GenericDocument>;\n  let fieldPathsToSortBy: Array<string>;\n  let order: \"asc\" | \"desc\";\n  let table: string;\n  let range: ReadonlyArray<SerializedRangeExpression> = [];\n  let index: string;\n  switch (source.type) {\n    case \"FullTableScan\": {\n      table = source.tableName;\n      // The binary scans a whole table through its creation-time index.\n      index = \"by_creation_time\";\n      docs = [...view.scan(source.tableName)];\n      order = source.order ?? \"asc\";\n      fieldPathsToSortBy = [\"_creationTime\"];\n      break;\n    }\n    case \"IndexRange\": {\n      const [tableName, indexName] = source.indexName.split(\".\") as [\n        string,\n        string,\n      ];\n      table = tableName;\n      index = indexName;\n      range = source.range;\n      order = source.order ?? \"asc\";\n      let fields: Array<string>;\n      if (indexName === \"by_creation_time\") {\n        fields = [\"_creationTime\", \"_id\"];\n      } else if (indexName === \"by_id\") {\n        fields = [\"_id\"];\n      } else {\n        const declared = view.schema?.tables\n          .get(tableName)\n          ?.indexes.find(\n            ({ indexDescriptor }) => indexDescriptor === indexName,\n          );\n        if (declared === undefined) {\n          throw new Error(\n            `Cannot use index \"${indexName}\" for table \"${tableName}\" because ` +\n              `it is not declared in the schema.`,\n          );\n        }\n        fields = declared.fields.concat([\"_creationTime\", \"_id\"]);\n      }\n      fieldPathsToSortBy = fields;\n      validateIndexRangeExpression(source, fields);\n      docs = view\n        .scan(tableName)\n        .filter((doc) =>\n          source.range.every((filter) => evaluateRangeFilter(doc, filter)),\n        );\n      break;\n    }\n    case \"Search\": {\n      throw KernelRefusal.requiresBinary(\"textSearch\");\n    }\n  }\n\n  const filters = query.operators\n    .filter(\n      (operator): operator is { filter: FilterJson } => \"filter\" in operator,\n    )\n    .map((operator) => operator.filter);\n  const limit =\n    query.operators.find(\n      (operator): operator is { limit: number } => \"limit\" in operator,\n    ) ?? null;\n\n  const orderMultiplier = order === \"asc\" ? 1 : -1;\n  docs.sort((a, b) => {\n    for (const fp of fieldPathsToSortBy) {\n      const v = compareValues(\n        evaluateFieldPath(fp, a),\n        evaluateFieldPath(fp, b),\n      );\n      if (v !== 0) return v * orderMultiplier;\n    }\n    return 0;\n  });\n\n  return {\n    sortedDocs: docs,\n    filterFn: (doc) => filters.every((f) => evaluateFilter(doc, f)),\n    limit: limit?.limit ?? null,\n    order,\n    interval: {\n      kind: \"interval\",\n      index,\n      table,\n      fields: fieldPathsToSortBy.includes(\"_id\")\n        ? fieldPathsToSortBy\n        : [...fieldPathsToSortBy, \"_id\"],\n      order,\n      range,\n    },\n  };\n};\n\n/**\n * A query's documents in order. The source is read when the query starts, as a\n * snapshot, and consumed lazily. The read set holds the prefix the stream has\n * examined, filtered documents included, or the whole range once it ends.\n */\nexport const stream = (\n  view: TableView,\n  query: SerializedQuery,\n): Iterator<GenericDocument> => {\n  const { sortedDocs, filterFn, limit, interval } = resolveSource(view, query);\n  const examined = view.read(interval, null);\n  return (function* () {\n    let returned = 0;\n    for (const doc of sortedDocs) {\n      if (limit !== null && returned >= limit) return;\n      view.examine(interval.table, doc);\n      examined(ReadSet.keyOf(interval.fields, doc as StoredDocument));\n      if (filterFn(doc)) {\n        returned++;\n        yield doc;\n      }\n    }\n    examined(\"end\");\n  })();\n};\n\nconst encodeCursor = (\n  doc: GenericDocument,\n  fieldPaths: ReadonlyArray<string>,\n): string =>\n  JSON.stringify(\n    fieldPaths.map((fp) => {\n      const k = evaluateFieldPath(fp, doc);\n      return k === undefined ? null : JSON.stringify(convexToJson(k));\n    }),\n  );\n\nconst parseCursor = (c: string | null | undefined) =>\n  c\n    ? (JSON.parse(c) as Array<string | null>).map((k) =>\n        k === null ? undefined : jsonToConvex(JSON.parse(k)),\n      )\n    : null;\n\nconst compareToCursor = (\n  doc: GenericDocument,\n  cursorKeys: ReadonlyArray<unknown>,\n  fieldPaths: ReadonlyArray<string>,\n  order: \"asc\" | \"desc\",\n): number => {\n  const orderMultiplier = order === \"asc\" ? 1 : -1;\n  for (let i = 0; i < fieldPaths.length; i++) {\n    const cmp = compareValues(\n      evaluateFieldPath(fieldPaths[i]!, doc),\n      cursorKeys[i] as any,\n    );\n    if (cmp !== 0) return cmp * orderMultiplier;\n  }\n  return 0;\n};\n\nexport interface PageRequest {\n  readonly query: SerializedQuery;\n  readonly cursor: string | null;\n  readonly endCursor?: string | null;\n  readonly pageSize: number;\n  readonly maximumRowsRead?: number | null;\n  readonly maximumBytesRead?: number | null;\n}\n\nexport const paginate = (\n  view: TableView,\n  {\n    query,\n    cursor,\n    endCursor,\n    pageSize,\n    maximumRowsRead,\n    maximumBytesRead,\n  }: PageRequest,\n) => {\n  const { sortedDocs, filterFn, order, interval } = resolveSource(view, query);\n  // A page from the terminal cursor reads the empty interval past the end, so\n  // it depends on nothing.\n  if (cursor === \"_end_cursor\") {\n    return {\n      page: [],\n      isDone: true,\n      continueCursor: \"_end_cursor\",\n      splitCursor: null,\n      pageStatus: null,\n    };\n  }\n  const cursorFields = interval.fields;\n  const cursorKeys = parseCursor(cursor);\n  const hasEndBoundary = !!endCursor && endCursor !== \"_end_cursor\";\n  const endCursorKeys = hasEndBoundary ? parseCursor(endCursor) : null;\n  const examined = view.read(interval, cursorKeys);\n  let reachedEnd = true;\n\n  const page: Array<GenericDocument> = [];\n  let isInPage = cursor === null;\n  let continueCursor = \"_end_cursor\";\n  let splitCursor: string | null = null;\n  let pageStatus: \"SplitRecommended\" | \"SplitRequired\" | null = null;\n  let rowsRead = 0;\n  let bytesRead = 0;\n  const readDocCursors: Array<string> = [];\n\n  for (let i = 0; i < sortedDocs.length; i++) {\n    const doc = sortedDocs[i]!;\n    const isLastDoc = i === sortedDocs.length - 1;\n    if (!isInPage) {\n      if (cursorKeys) {\n        if (compareToCursor(doc, cursorKeys, cursorFields, order) > 0) {\n          isInPage = true;\n        } else {\n          continue;\n        }\n      }\n    }\n    if (hasEndBoundary && endCursorKeys) {\n      const cmp = compareToCursor(doc, endCursorKeys, cursorFields, order);\n      if (cmp >= 0) {\n        reachedEnd = false;\n        examined(endCursorKeys);\n        if (cmp === 0) {\n          view.examine(interval.table, doc);\n          rowsRead += 1;\n          bytesRead += getDocumentSize(doc);\n          readDocCursors.push(encodeCursor(doc, cursorFields));\n          if (filterFn(doc)) page.push(doc);\n          continueCursor = encodeCursor(doc, cursorFields);\n        }\n        break;\n      }\n    }\n    view.examine(interval.table, doc);\n    rowsRead += 1;\n    bytesRead += getDocumentSize(doc);\n    readDocCursors.push(encodeCursor(doc, cursorFields));\n    examined(ReadSet.keyOf(cursorFields, doc as StoredDocument));\n    const hitLimit =\n      (!!maximumRowsRead && rowsRead >= maximumRowsRead) ||\n      (!!maximumBytesRead && bytesRead >= maximumBytesRead);\n    if (filterFn(doc)) page.push(doc);\n    if (hitLimit) {\n      reachedEnd = false;\n      pageStatus = \"SplitRequired\";\n      continueCursor = encodeCursor(doc, cursorFields);\n      break;\n    }\n    if (!endCursor && page.length >= pageSize) {\n      reachedEnd = isLastDoc;\n      if (!isLastDoc) continueCursor = encodeCursor(doc, cursorFields);\n      break;\n    }\n  }\n  // A page bounded by an end cursor examined the range only up to it.\n  if (reachedEnd) examined(endCursorKeys ?? \"end\");\n\n  if (pageStatus === \"SplitRequired\" && readDocCursors.length >= 2) {\n    splitCursor = readDocCursors[Math.floor((readDocCursors.length - 1) / 2)]!;\n  } else if (\n    pageStatus === null &&\n    rowsRead > pageSize + 1 &&\n    readDocCursors.length >= 2\n  ) {\n    pageStatus = \"SplitRecommended\";\n    splitCursor = readDocCursors[Math.floor((readDocCursors.length - 1) / 2)]!;\n  }\n\n  return {\n    page,\n    isDone: continueCursor === \"_end_cursor\",\n    continueCursor,\n    splitCursor,\n    pageStatus,\n  };\n};\n"],"mappings":";;;;;AAqDA,MAAa,gBACX,WACwB;CACxB,IAAI,WAAW,QAAQ,WAAW,KAAA,GAAW,OAAO;CACpD,MAAM,WAAyB;EAC7B,kBAAmB,OAChB;EACH,QAAQ,IAAI,IACV,OAAO,QAAQ,OAAO,MAAM,CAAC,CAAC,KAAK,CAAC,MAAM,WAAW,CACnD,MACC,MAA2C,OAAO,CACrD,CAAC,CACH;CACF;CACA,SAAS,OAAO,SAAS,OAAO,cAAc;EAC5C,IAAI,CAAC,kBAAkB,SAAS,GAC9B,MAAM,IAAI,MACR,+CAA+C,UAAU,EAC3D;EAEF,mBAAmB,MAAM,YAAY;EACrC,MAAM,QAAQ,SAAS,EAAE,sBAAsB;GAC7C,IAAI,CAAC,kBAAkB,eAAe,GACpC,MAAM,IAAI,MACR,+CAA+C,gBAAgB,EACjE;EAEJ,CAAC;CACH,CAAC;CACD,OAAO;AACT;;;;;AAMA,MAAa,oBACX,QACA,WACA,QACG;CACH,IAAI,WAAW,QAAQ,CAAC,OAAO,kBAAkB;CACjD,MAAM,YAAY,OAAO,OAAO,IAAI,SAAS,CAAC,EAAE;CAChD,IAAI,cAAc,KAAA,GAAW;CAC7B,kBAAkB,WAAW,qBAAqB,GAAsB,CAAC;AAC3E;AAmCA,MAAM,iBACJ,MACA,UACmB;CACnB,MAAM,SAAS,MAAM;CACrB,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI,QAAkD,CAAC;CACvD,IAAI;CACJ,QAAQ,OAAO,MAAf;EACE,KAAK;GACH,QAAQ,OAAO;GAEf,QAAQ;GACR,OAAO,CAAC,GAAG,KAAK,KAAK,OAAO,SAAS,CAAC;GACtC,QAAQ,OAAO,SAAS;GACxB,qBAAqB,CAAC,eAAe;GACrC;EAEF,KAAK,cAAc;GACjB,MAAM,CAAC,WAAW,aAAa,OAAO,UAAU,MAAM,GAAG;GAIzD,QAAQ;GACR,QAAQ;GACR,QAAQ,OAAO;GACf,QAAQ,OAAO,SAAS;GACxB,IAAI;GACJ,IAAI,cAAc,oBAChB,SAAS,CAAC,iBAAiB,KAAK;QAC3B,IAAI,cAAc,SACvB,SAAS,CAAC,KAAK;QACV;IACL,MAAM,WAAW,KAAK,QAAQ,OAC3B,IAAI,SAAS,CAAC,EACb,QAAQ,MACP,EAAE,sBAAsB,oBAAoB,SAC/C;IACF,IAAI,aAAa,KAAA,GACf,MAAM,IAAI,MACR,qBAAqB,UAAU,eAAe,UAAU,4CAE1D;IAEF,SAAS,SAAS,OAAO,OAAO,CAAC,iBAAiB,KAAK,CAAC;GAC1D;GACA,qBAAqB;GACrB,6BAA6B,QAAQ,MAAM;GAC3C,OAAO,KACJ,KAAK,SAAS,CAAC,CACf,QAAQ,QACP,OAAO,MAAM,OAAO,WAAW,oBAAoB,KAAK,MAAM,CAAC,CACjE;GACF;EACF;EACA,KAAK,UACH,MAAMA,eAA6B,YAAY;CAEnD;CAEA,MAAM,UAAU,MAAM,UACnB,QACE,aAAiD,YAAY,QAChE,CAAC,CACA,KAAK,aAAa,SAAS,MAAM;CACpC,MAAM,QACJ,MAAM,UAAU,MACb,aAA4C,WAAW,QAC1D,KAAK;CAEP,MAAM,kBAAkB,UAAU,QAAQ,IAAI;CAC9C,KAAK,MAAM,GAAG,MAAM;EAClB,KAAK,MAAM,MAAM,oBAAoB;GACnC,MAAM,IAAI,cACR,kBAAkB,IAAI,CAAC,GACvB,kBAAkB,IAAI,CAAC,CACzB;GACA,IAAI,MAAM,GAAG,OAAO,IAAI;EAC1B;EACA,OAAO;CACT,CAAC;CAED,OAAO;EACL,YAAY;EACZ,WAAW,QAAQ,QAAQ,OAAO,MAAM,eAAe,KAAK,CAAC,CAAC;EAC9D,OAAO,OAAO,SAAS;EACvB;EACA,UAAU;GACR,MAAM;GACN;GACA;GACA,QAAQ,mBAAmB,SAAS,KAAK,IACrC,qBACA,CAAC,GAAG,oBAAoB,KAAK;GACjC;GACA;EACF;CACF;AACF;;;;;;AAOA,MAAa,UACX,MACA,UAC8B;CAC9B,MAAM,EAAE,YAAY,UAAU,OAAO,aAAa,cAAc,MAAM,KAAK;CAC3E,MAAM,WAAW,KAAK,KAAK,UAAU,IAAI;CACzC,QAAQ,aAAa;EACnB,IAAI,WAAW;EACf,KAAK,MAAM,OAAO,YAAY;GAC5B,IAAI,UAAU,QAAQ,YAAY,OAAO;GACzC,KAAK,QAAQ,SAAS,OAAO,GAAG;GAChC,SAASC,MAAc,SAAS,QAAQ,GAAqB,CAAC;GAC9D,IAAI,SAAS,GAAG,GAAG;IACjB;IACA,MAAM;GACR;EACF;EACA,SAAS,KAAK;CAChB,EAAA,CAAG;AACL;AAEA,MAAM,gBACJ,KACA,eAEA,KAAK,UACH,WAAW,KAAK,OAAO;CACrB,MAAM,IAAI,kBAAkB,IAAI,GAAG;CACnC,OAAO,MAAM,KAAA,IAAY,OAAO,KAAK,UAAU,aAAa,CAAC,CAAC;AAChE,CAAC,CACH;AAEF,MAAM,eAAe,MACnB,IACK,KAAK,MAAM,CAAC,CAAC,CAA0B,KAAK,MAC3C,MAAM,OAAO,KAAA,IAAY,aAAa,KAAK,MAAM,CAAC,CAAC,CACrD,IACA;AAEN,MAAM,mBACJ,KACA,YACA,YACA,UACW;CACX,MAAM,kBAAkB,UAAU,QAAQ,IAAI;CAC9C,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;EAC1C,MAAM,MAAM,cACV,kBAAkB,WAAW,IAAK,GAAG,GACrC,WAAW,EACb;EACA,IAAI,QAAQ,GAAG,OAAO,MAAM;CAC9B;CACA,OAAO;AACT;AAWA,MAAa,YACX,MACA,EACE,OACA,QACA,WACA,UACA,iBACA,uBAEC;CACH,MAAM,EAAE,YAAY,UAAU,OAAO,aAAa,cAAc,MAAM,KAAK;CAG3E,IAAI,WAAW,eACb,OAAO;EACL,MAAM,CAAC;EACP,QAAQ;EACR,gBAAgB;EAChB,aAAa;EACb,YAAY;CACd;CAEF,MAAM,eAAe,SAAS;CAC9B,MAAM,aAAa,YAAY,MAAM;CACrC,MAAM,iBAAiB,CAAC,CAAC,aAAa,cAAc;CACpD,MAAM,gBAAgB,iBAAiB,YAAY,SAAS,IAAI;CAChE,MAAM,WAAW,KAAK,KAAK,UAAU,UAAU;CAC/C,IAAI,aAAa;CAEjB,MAAM,OAA+B,CAAC;CACtC,IAAI,WAAW,WAAW;CAC1B,IAAI,iBAAiB;CACrB,IAAI,cAA6B;CACjC,IAAI,aAA0D;CAC9D,IAAI,WAAW;CACf,IAAI,YAAY;CAChB,MAAM,iBAAgC,CAAC;CAEvC,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;EAC1C,MAAM,MAAM,WAAW;EACvB,MAAM,YAAY,MAAM,WAAW,SAAS;EAC5C,IAAI,CAAC,UACC;OAAA,YAAY;IACd,IAAI,gBAAgB,KAAK,YAAY,cAAc,KAAK,IAAI,GAC1D,WAAW;SAEX;GAEJ;;EAEF,IAAI,kBAAkB,eAAe;GACnC,MAAM,MAAM,gBAAgB,KAAK,eAAe,cAAc,KAAK;GACnE,IAAI,OAAO,GAAG;IACZ,aAAa;IACb,SAAS,aAAa;IACtB,IAAI,QAAQ,GAAG;KACb,KAAK,QAAQ,SAAS,OAAO,GAAG;KAChC,YAAY;KACZ,aAAa,gBAAgB,GAAG;KAChC,eAAe,KAAK,aAAa,KAAK,YAAY,CAAC;KACnD,IAAI,SAAS,GAAG,GAAG,KAAK,KAAK,GAAG;KAChC,iBAAiB,aAAa,KAAK,YAAY;IACjD;IACA;GACF;EACF;EACA,KAAK,QAAQ,SAAS,OAAO,GAAG;EAChC,YAAY;EACZ,aAAa,gBAAgB,GAAG;EAChC,eAAe,KAAK,aAAa,KAAK,YAAY,CAAC;EACnD,SAASA,MAAc,cAAc,GAAqB,CAAC;EAC3D,MAAM,WACH,CAAC,CAAC,mBAAmB,YAAY,mBACjC,CAAC,CAAC,oBAAoB,aAAa;EACtC,IAAI,SAAS,GAAG,GAAG,KAAK,KAAK,GAAG;EAChC,IAAI,UAAU;GACZ,aAAa;GACb,aAAa;GACb,iBAAiB,aAAa,KAAK,YAAY;GAC/C;EACF;EACA,IAAI,CAAC,aAAa,KAAK,UAAU,UAAU;GACzC,aAAa;GACb,IAAI,CAAC,WAAW,iBAAiB,aAAa,KAAK,YAAY;GAC/D;EACF;CACF;CAEA,IAAI,YAAY,SAAS,iBAAiB,KAAK;CAE/C,IAAI,eAAe,mBAAmB,eAAe,UAAU,GAC7D,cAAc,eAAe,KAAK,OAAO,eAAe,SAAS,KAAK,CAAC;MAClE,IACL,eAAe,QACf,WAAW,WAAW,KACtB,eAAe,UAAU,GACzB;EACA,aAAa;EACb,cAAc,eAAe,KAAK,OAAO,eAAe,SAAS,KAAK,CAAC;CACzE;CAEA,OAAO;EACL;EACA,QAAQ,mBAAmB;EAC3B;EACA;EACA;CACF;AACF"}

package/dist/internal/KernelRefusal.d.ts

@@ -98,5 +98,139 @@ export declare class UnknownStandingSource extends UnknownStandingSource_base {
 }
 export declare const requiresBinary: (operation: RequiresBinary["operation"]) => RequiresBinary;
 export declare const rowPending: (operation: string, row: number) => KernelRowPending;
+declare const SnapshotMalformed_base: Schema.Class<SnapshotMalformed, Schema.TaggedStruct<"SnapshotMalformed", {
+    readonly reason: Schema.String;
+    readonly message: Schema.String;
+}>, import("effect/Cause").YieldableError>;
+/**
+ * Snapshot bytes are not a kernel snapshot this kernel reads: an unknown
+ * header, a body that is not the snapshot's JSON, or a value that does not
+ * decode.
+ */
+export declare class SnapshotMalformed extends SnapshotMalformed_base {
+}
+declare const SnapshotDigestMismatch_base: Schema.Class<SnapshotDigestMismatch, Schema.TaggedStruct<"SnapshotDigestMismatch", {
+    readonly expected: Schema.String;
+    readonly actual: Schema.String;
+    readonly message: Schema.String;
+}>, import("effect/Cause").YieldableError>;
+/**
+ * A snapshot's body does not hash to the digest its header names, so its bytes
+ * changed after export.
+ */
+export declare class SnapshotDigestMismatch extends SnapshotDigestMismatch_base {
+}
+declare const SnapshotComponentMismatch_base: Schema.Class<SnapshotComponentMismatch, Schema.TaggedStruct<"SnapshotComponentMismatch", {
+    readonly snapshot: Schema.$Array<Schema.String>;
+    readonly registered: Schema.$Array<Schema.String>;
+    readonly message: Schema.String;
+}>, import("effect/Cause").YieldableError>;
+/**
+ * A snapshot's components are not the components registered on the world
+ * restoring it.
+ */
+export declare class SnapshotComponentMismatch extends SnapshotComponentMismatch_base {
+}
+declare const SnapshotWorldUnresolved_base: Schema.Class<SnapshotWorldUnresolved, Schema.TaggedStruct<"SnapshotWorldUnresolved", {
+    readonly name: Schema.String;
+    readonly reason: Schema.Literals<readonly ["missing", "ambiguous"]>;
+    readonly message: Schema.String;
+}>, import("effect/Cause").YieldableError>;
+/**
+ * A job's test world is named by no world, or by more than one, so the job
+ * could not run under the world that scheduled it.
+ */
+export declare class SnapshotWorldUnresolved extends SnapshotWorldUnresolved_base {
+}
+declare const SnapshotWorldBusy_base: Schema.Class<SnapshotWorldBusy, Schema.TaggedStruct<"SnapshotWorldBusy", {
+    readonly version: Schema.Int;
+    readonly held: Schema.$Array<Schema.String>;
+    readonly message: Schema.String;
+}>, import("effect/Cause").YieldableError>;
+/**
+ * A world holds work a snapshot does not carry: attempts held for `apply`, or,
+ * when it restores, commits of its own.
+ */
+export declare class SnapshotWorldBusy extends SnapshotWorldBusy_base {
+}
+declare const SnapshotSecretMissing_base: Schema.Class<SnapshotSecretMissing, Schema.TaggedStruct<"SnapshotSecretMissing", {
+    readonly ref: Schema.String;
+    readonly message: Schema.String;
+}>, import("effect/Cause").YieldableError>;
+/**
+ * A snapshot marks a secret the restore was not given, so the raw value its
+ * replay needs is not in memory.
+ */
+export declare class SnapshotSecretMissing extends SnapshotSecretMissing_base {
+}
+declare const SnapshotWorldRunning_base: Schema.Class<SnapshotWorldRunning, Schema.TaggedStruct<"SnapshotWorldRunning", {
+    readonly registry: Schema.Literals<readonly ["running", "walks", "functions"]>;
+    readonly count: Schema.Int;
+    readonly message: Schema.String;
+}>, import("effect/Cause").YieldableError>;
+/**
+ * A world is running work a snapshot taken or restored now would split: calls
+ * from the test, scheduler walks, or function executions, nested and detached
+ * ones included.
+ */
+export declare class SnapshotWorldRunning extends SnapshotWorldRunning_base {
+}
+declare const SnapshotSubscribed_base: Schema.Class<SnapshotSubscribed, Schema.TaggedStruct<"SnapshotSubscribed", {
+    readonly subscribers: Schema.Int;
+    readonly message: Schema.String;
+}>, import("effect/Cause").YieldableError>;
+/**
+ * A world has subscribers, whose identity versions a restore would rewind.
+ * Subscriptions are live client state, so a restore needs a world with none.
+ */
+export declare class SnapshotSubscribed extends SnapshotSubscribed_base {
+}
+declare const SnapshotAllocatorBehind_base: Schema.Class<SnapshotAllocatorBehind, Schema.TaggedStruct<"SnapshotAllocatorBehind", {
+    readonly allocator: Schema.Literals<readonly ["nextDocumentId", "lastCreationTime", "nextAttemptId", "identityEpoch"]>;
+    readonly value: Schema.Finite;
+    readonly required: Schema.Finite;
+    readonly message: Schema.String;
+}>, import("effect/Cause").YieldableError>;
+/**
+ * A snapshot's identity counters stand at or behind an identity its state
+ * already holds, so the next allocation would reuse one.
+ */
+export declare class SnapshotAllocatorBehind extends SnapshotAllocatorBehind_base {
+}
+declare const SnapshotRowInconsistent_base: Schema.Class<SnapshotRowInconsistent, Schema.TaggedStruct<"SnapshotRowInconsistent", {
+    readonly componentPath: Schema.String;
+    readonly id: Schema.String;
+    readonly reason: Schema.Literals<readonly ["id", "component", "log", "row", "systemFields", "duplicate"]>;
+    readonly message: Schema.String;
+}>, import("effect/Cause").YieldableError>;
+/**
+ * A snapshot's rows are not what its write log publishes: a row filed under
+ * another table or an unregistered component, a version the log does not give
+ * it, or a log change whose before value is not the row it replaced.
+ */
+export declare class SnapshotRowInconsistent extends SnapshotRowInconsistent_base {
+}
+declare const SnapshotTimestampInconsistent_base: Schema.Class<SnapshotTimestampInconsistent, Schema.TaggedStruct<"SnapshotTimestampInconsistent", {
+    readonly version: Schema.Int;
+    readonly commitTs: Schema.String;
+    readonly message: Schema.String;
+}>, import("effect/Cause").YieldableError>;
+/**
+ * A snapshot's commit timestamps do not strictly increase through its write
+ * log, or its latest commit timestamp is not the log's last.
+ */
+export declare class SnapshotTimestampInconsistent extends SnapshotTimestampInconsistent_base {
+}
+declare const SnapshotJobInconsistent_base: Schema.Class<SnapshotJobInconsistent, Schema.TaggedStruct<"SnapshotJobInconsistent", {
+    readonly id: Schema.String;
+    readonly reason: Schema.Literals<readonly ["row", "untargeted", "inProgress", "component", "function", "duplicate"]>;
+    readonly message: Schema.String;
+}>, import("effect/Cause").YieldableError>;
+/**
+ * A snapshot's jobs and job rows disagree: a job with no row, a row with no
+ * job, a job left running, or a target no registered component exports.
+ */
+export declare class SnapshotJobInconsistent extends SnapshotJobInconsistent_base {
+}
 export {};
 //# sourceMappingURL=KernelRefusal.d.ts.map

package/dist/internal/KernelRefusal.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"KernelRefusal.d.ts","sourceRoot":"","sources":["../../src/internal/KernelRefusal.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,MAAM,MAAM,eAAe,CAAC;;;;;AAExC;;GAEG;AACH,qBAAa,cAAe,SAAQ,mBAMnC;CAAG;;;;;;AAEJ;;;GAGG;AACH,qBAAa,gBAAiB,SAAQ,qBAOrC;CAAG;;;;;AAEJ;;;GAGG;AACH,qBAAa,mBAAoB,SAAQ,wBAGxC;CAAG;;;;;AAEJ;;;GAGG;AACH,qBAAa,mCAAoC,SAAQ,wCAGxD;CAAG;;;;;AAEJ;;;GAGG;AACH,qBAAa,aAAc,SAAQ,kBAGlC;CAAG;;;;;AAEJ;;;GAGG;AACH,qBAAa,YAAa,SAAQ,iBAGjC;CAAG;;;;;;;AAEJ;;;GAGG;AACH,qBAAa,qBAAsB,SAAQ,0BAQ1C;CAAG;;;;;;;;;AAEJ;;;;GAIG;AACH,qBAAa,mBAAoB,SAAQ,wBASxC;CAAG;;;;;;AAEJ;;GAEG;AACH,qBAAa,qBAAsB,SAAQ,0BAG1C;CAAG;AAEJ,eAAO,MAAM,cAAc,cAAe,cAAc,CAAC,WAAW,CAAC,mBAIjE,CAAC;AAEL,eAAO,MAAM,UAAU,cAAe,MAAM,OAAO,MAAM,qBAKrD,CAAC"}
+{"version":3,"file":"KernelRefusal.d.ts","sourceRoot":"","sources":["../../src/internal/KernelRefusal.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,MAAM,MAAM,eAAe,CAAC;;;;;AAExC;;GAEG;AACH,qBAAa,cAAe,SAAQ,mBAMnC;CAAG;;;;;;AAEJ;;;GAGG;AACH,qBAAa,gBAAiB,SAAQ,qBAOrC;CAAG;;;;;AAEJ;;;GAGG;AACH,qBAAa,mBAAoB,SAAQ,wBAGxC;CAAG;;;;;AAEJ;;;GAGG;AACH,qBAAa,mCAAoC,SAAQ,wCAGxD;CAAG;;;;;AAEJ;;;GAGG;AACH,qBAAa,aAAc,SAAQ,kBAGlC;CAAG;;;;;AAEJ;;;GAGG;AACH,qBAAa,YAAa,SAAQ,iBAGjC;CAAG;;;;;;;AAEJ;;;GAGG;AACH,qBAAa,qBAAsB,SAAQ,0BAQ1C;CAAG;;;;;;;;;AAEJ;;;;GAIG;AACH,qBAAa,mBAAoB,SAAQ,wBASxC;CAAG;;;;;;AAEJ;;GAEG;AACH,qBAAa,qBAAsB,SAAQ,0BAG1C;CAAG;AAEJ,eAAO,MAAM,cAAc,cAAe,cAAc,CAAC,WAAW,CAAC,mBAIjE,CAAC;AAEL,eAAO,MAAM,UAAU,cAAe,MAAM,OAAO,MAAM,qBAKrD,CAAC;;;;;AAEL;;;;GAIG;AACH,qBAAa,iBAAkB,SAAQ,sBAGtC;CAAG;;;;;;AAEJ;;;GAGG;AACH,qBAAa,sBAAuB,SAAQ,2BAG3C;CAAG;;;;;;AAEJ;;;GAGG;AACH,qBAAa,yBAA0B,SAAQ,8BAO9C;CAAG;;;;;;AAEJ;;;GAGG;AACH,qBAAa,uBAAwB,SAAQ,4BAO5C;CAAG;;;;;;AAEJ;;;GAGG;AACH,qBAAa,iBAAkB,SAAQ,sBAOtC;CAAG;;;;;AAEJ;;;GAGG;AACH,qBAAa,qBAAsB,SAAQ,0BAG1C;CAAG;;;;;;AAEJ;;;;GAIG;AACH,qBAAa,oBAAqB,SAAQ,yBAOzC;CAAG;;;;;AAEJ;;;GAGG;AACH,qBAAa,kBAAmB,SAAQ,uBAGvC;CAAG;;;;;;;AAEJ;;;GAGG;AACH,qBAAa,uBAAwB,SAAQ,4BAa5C;CAAG;;;;;;;AAEJ;;;;GAIG;AACH,qBAAa,uBAAwB,SAAQ,4BAe5C;CAAG;;;;;;AAEJ;;;GAGG;AACH,qBAAa,6BAA8B,SAAQ,kCAGlD;CAAG;;;;;;AAEJ;;;GAGG;AACH,qBAAa,uBAAwB,SAAQ,4BAc5C;CAAG"}

package/dist/internal/KernelRefusal.js

@@ -88,7 +88,140 @@ const rowPending = (operation, row) => new KernelRowPending({
 	row,
 	message: `The test kernel supplies ${operation} in build-order row ${row}.`
 });
+/**
+* Snapshot bytes are not a kernel snapshot this kernel reads: an unknown
+* header, a body that is not the snapshot's JSON, or a value that does not
+* decode.
+*/
+var SnapshotMalformed = class extends Schema.TaggedError()("SnapshotMalformed", {
+	reason: Schema.String,
+	message: Schema.String
+}) {};
+/**
+* A snapshot's body does not hash to the digest its header names, so its bytes
+* changed after export.
+*/
+var SnapshotDigestMismatch = class extends Schema.TaggedError()("SnapshotDigestMismatch", {
+	expected: Schema.String,
+	actual: Schema.String,
+	message: Schema.String
+}) {};
+/**
+* A snapshot's components are not the components registered on the world
+* restoring it.
+*/
+var SnapshotComponentMismatch = class extends Schema.TaggedError()("SnapshotComponentMismatch", {
+	snapshot: Schema.Array(Schema.String),
+	registered: Schema.Array(Schema.String),
+	message: Schema.String
+}) {};
+/**
+* A job's test world is named by no world, or by more than one, so the job
+* could not run under the world that scheduled it.
+*/
+var SnapshotWorldUnresolved = class extends Schema.TaggedError()("SnapshotWorldUnresolved", {
+	name: Schema.String,
+	reason: Schema.Literals(["missing", "ambiguous"]),
+	message: Schema.String
+}) {};
+/**
+* A world holds work a snapshot does not carry: attempts held for `apply`, or,
+* when it restores, commits of its own.
+*/
+var SnapshotWorldBusy = class extends Schema.TaggedError()("SnapshotWorldBusy", {
+	version: Schema.Int,
+	held: Schema.Array(Schema.String),
+	message: Schema.String
+}) {};
+/**
+* A snapshot marks a secret the restore was not given, so the raw value its
+* replay needs is not in memory.
+*/
+var SnapshotSecretMissing = class extends Schema.TaggedError()("SnapshotSecretMissing", {
+	ref: Schema.String,
+	message: Schema.String
+}) {};
+/**
+* A world is running work a snapshot taken or restored now would split: calls
+* from the test, scheduler walks, or function executions, nested and detached
+* ones included.
+*/
+var SnapshotWorldRunning = class extends Schema.TaggedError()("SnapshotWorldRunning", {
+	registry: Schema.Literals([
+		"running",
+		"walks",
+		"functions"
+	]),
+	count: Schema.Int,
+	message: Schema.String
+}) {};
+/**
+* A world has subscribers, whose identity versions a restore would rewind.
+* Subscriptions are live client state, so a restore needs a world with none.
+*/
+var SnapshotSubscribed = class extends Schema.TaggedError()("SnapshotSubscribed", {
+	subscribers: Schema.Int,
+	message: Schema.String
+}) {};
+/**
+* A snapshot's identity counters stand at or behind an identity its state
+* already holds, so the next allocation would reuse one.
+*/
+var SnapshotAllocatorBehind = class extends Schema.TaggedError()("SnapshotAllocatorBehind", {
+	allocator: Schema.Literals([
+		"nextDocumentId",
+		"lastCreationTime",
+		"nextAttemptId",
+		"identityEpoch"
+	]),
+	value: Schema.Finite,
+	required: Schema.Finite,
+	message: Schema.String
+}) {};
+/**
+* A snapshot's rows are not what its write log publishes: a row filed under
+* another table or an unregistered component, a version the log does not give
+* it, or a log change whose before value is not the row it replaced.
+*/
+var SnapshotRowInconsistent = class extends Schema.TaggedError()("SnapshotRowInconsistent", {
+	componentPath: Schema.String,
+	id: Schema.String,
+	reason: Schema.Literals([
+		"id",
+		"component",
+		"log",
+		"row",
+		"systemFields",
+		"duplicate"
+	]),
+	message: Schema.String
+}) {};
+/**
+* A snapshot's commit timestamps do not strictly increase through its write
+* log, or its latest commit timestamp is not the log's last.
+*/
+var SnapshotTimestampInconsistent = class extends Schema.TaggedError()("SnapshotTimestampInconsistent", {
+	version: Schema.Int,
+	commitTs: Schema.String,
+	message: Schema.String
+}) {};
+/**
+* A snapshot's jobs and job rows disagree: a job with no row, a row with no
+* job, a job left running, or a target no registered component exports.
+*/
+var SnapshotJobInconsistent = class extends Schema.TaggedError()("SnapshotJobInconsistent", {
+	id: Schema.String,
+	reason: Schema.Literals([
+		"row",
+		"untargeted",
+		"inProgress",
+		"component",
+		"function",
+		"duplicate"
+	]),
+	message: Schema.String
+}) {};
 //#endregion
-export { ClosedAttempt, CommitTsNotIncreasing, DrainBudgetExceeded, KernelRowPending, OptimisticConcurrencyControlFailure, RegisteredAfterOpen, RequiresBinary, StaleAttempt, UnknownStandingSource, requiresBinary, rowPending };
+export { ClosedAttempt, CommitTsNotIncreasing, DrainBudgetExceeded, KernelRowPending, OptimisticConcurrencyControlFailure, RegisteredAfterOpen, RequiresBinary, SnapshotAllocatorBehind, SnapshotComponentMismatch, SnapshotDigestMismatch, SnapshotJobInconsistent, SnapshotMalformed, SnapshotRowInconsistent, SnapshotSecretMissing, SnapshotSubscribed, SnapshotTimestampInconsistent, SnapshotWorldBusy, SnapshotWorldRunning, SnapshotWorldUnresolved, StaleAttempt, UnknownStandingSource, requiresBinary, rowPending };
 
 //# sourceMappingURL=KernelRefusal.js.map

package/dist/internal/KernelRefusal.js.map

@@ -1 +1 @@
-{"version":3,"file":"KernelRefusal.js","names":[],"sources":["../../src/internal/KernelRefusal.ts"],"sourcesContent":["import * as Schema from \"effect/Schema\";\n\n/**\n * The kernel never answers this operation in process. Only the binary does.\n */\nexport class RequiresBinary extends Schema.TaggedError<RequiresBinary>()(\n  \"RequiresBinary\",\n  {\n    operation: Schema.Literals([\"textSearch\", \"vectorSearch\"]),\n    message: Schema.String,\n  },\n) {}\n\n/**\n * A later kernel row supplies this operation. Until then the kernel refuses it\n * rather than answer with convex-test's behaviour.\n */\nexport class KernelRowPending extends Schema.TaggedError<KernelRowPending>()(\n  \"KernelRowPending\",\n  {\n    operation: Schema.String,\n    row: Schema.Int,\n    message: Schema.String,\n  },\n) {}\n\n/**\n * A component was registered after the test backend opened, so its modules\n * would load after a function had already run.\n */\nexport class RegisteredAfterOpen extends Schema.TaggedError<RegisteredAfterOpen>()(\n  \"RegisteredAfterOpen\",\n  { componentPath: Schema.String, message: Schema.String },\n) {}\n\n/**\n * Every attempt of a mutation read data a commit changed before it could\n * publish. The kernel gives up on attempt 5.\n */\nexport class OptimisticConcurrencyControlFailure extends Schema.TaggedError<OptimisticConcurrencyControlFailure>()(\n  \"OptimisticConcurrencyControlFailure\",\n  { attempts: Schema.Int, message: Schema.String },\n) {}\n\n/**\n * A syscall reached a mutation's attempt after the mutation returned and its\n * syscalls drained, so the attempt was already held or published.\n */\nexport class ClosedAttempt extends Schema.TaggedError<ClosedAttempt>()(\n  \"ClosedAttempt\",\n  { operation: Schema.String, message: Schema.String },\n) {}\n\n/**\n * `apply` named an attempt the kernel does not hold: it was already applied, or\n * never prepared.\n */\nexport class StaleAttempt extends Schema.TaggedError<StaleAttempt>()(\n  \"StaleAttempt\",\n  { id: Schema.String, message: Schema.String },\n) {}\n\n/**\n * The runtime answered a commit timestamp no greater than the previous\n * commit's.\n */\nexport class CommitTsNotIncreasing extends Schema.TaggedError<CommitTsNotIncreasing>()(\n  \"CommitTsNotIncreasing\",\n  {\n    version: Schema.Int,\n    previous: Schema.BigInt,\n    commitTs: Schema.BigInt,\n    message: Schema.String,\n  },\n) {}\n\n/**\n * Draining scheduled functions ran its budget of jobs and work still remained.\n * A self-rescheduling function keeps the drain from ending unless its kit\n * declares it standing.\n */\nexport class DrainBudgetExceeded extends Schema.TaggedError<DrainBudgetExceeded>()(\n  \"DrainBudgetExceeded\",\n  {\n    budget: Schema.Int,\n    pending: Schema.Array(\n      Schema.Struct({ componentPath: Schema.String, name: Schema.String }),\n    ),\n    message: Schema.String,\n  },\n) {}\n\n/**\n * A component declared a standing source its modules do not export.\n */\nexport class UnknownStandingSource extends Schema.TaggedError<UnknownStandingSource>()(\n  \"UnknownStandingSource\",\n  { componentPath: Schema.String, name: Schema.String, message: Schema.String },\n) {}\n\nexport const requiresBinary = (operation: RequiresBinary[\"operation\"]) =>\n  new RequiresBinary({\n    operation,\n    message: `The test kernel does not simulate ${operation}. Run this case against the Convex binary.`,\n  });\n\nexport const rowPending = (operation: string, row: number) =>\n  new KernelRowPending({\n    operation,\n    row,\n    message: `The test kernel supplies ${operation} in build-order row ${row}.`,\n  });\n"],"mappings":";;;;;AAKA,IAAa,iBAAb,cAAoC,OAAO,YAA4B,CAAC,CACtE,kBACA;CACE,WAAW,OAAO,SAAS,CAAC,cAAc,cAAc,CAAC;CACzD,SAAS,OAAO;AAClB,CACF,CAAC,CAAC,CAAC;;;;;AAMH,IAAa,mBAAb,cAAsC,OAAO,YAA8B,CAAC,CAC1E,oBACA;CACE,WAAW,OAAO;CAClB,KAAK,OAAO;CACZ,SAAS,OAAO;AAClB,CACF,CAAC,CAAC,CAAC;;;;;AAMH,IAAa,sBAAb,cAAyC,OAAO,YAAiC,CAAC,CAChF,uBACA;CAAE,eAAe,OAAO;CAAQ,SAAS,OAAO;AAAO,CACzD,CAAC,CAAC,CAAC;;;;;AAMH,IAAa,sCAAb,cAAyD,OAAO,YAAiD,CAAC,CAChH,uCACA;CAAE,UAAU,OAAO;CAAK,SAAS,OAAO;AAAO,CACjD,CAAC,CAAC,CAAC;;;;;AAMH,IAAa,gBAAb,cAAmC,OAAO,YAA2B,CAAC,CACpE,iBACA;CAAE,WAAW,OAAO;CAAQ,SAAS,OAAO;AAAO,CACrD,CAAC,CAAC,CAAC;;;;;AAMH,IAAa,eAAb,cAAkC,OAAO,YAA0B,CAAC,CAClE,gBACA;CAAE,IAAI,OAAO;CAAQ,SAAS,OAAO;AAAO,CAC9C,CAAC,CAAC,CAAC;;;;;AAMH,IAAa,wBAAb,cAA2C,OAAO,YAAmC,CAAC,CACpF,yBACA;CACE,SAAS,OAAO;CAChB,UAAU,OAAO;CACjB,UAAU,OAAO;CACjB,SAAS,OAAO;AAClB,CACF,CAAC,CAAC,CAAC;;;;;;AAOH,IAAa,sBAAb,cAAyC,OAAO,YAAiC,CAAC,CAChF,uBACA;CACE,QAAQ,OAAO;CACf,SAAS,OAAO,MACd,OAAO,OAAO;EAAE,eAAe,OAAO;EAAQ,MAAM,OAAO;CAAO,CAAC,CACrE;CACA,SAAS,OAAO;AAClB,CACF,CAAC,CAAC,CAAC;;;;AAKH,IAAa,wBAAb,cAA2C,OAAO,YAAmC,CAAC,CACpF,yBACA;CAAE,eAAe,OAAO;CAAQ,MAAM,OAAO;CAAQ,SAAS,OAAO;AAAO,CAC9E,CAAC,CAAC,CAAC;AAEH,MAAa,kBAAkB,cAC7B,IAAI,eAAe;CACjB;CACA,SAAS,qCAAqC,UAAU;AAC1D,CAAC;AAEH,MAAa,cAAc,WAAmB,QAC5C,IAAI,iBAAiB;CACnB;CACA;CACA,SAAS,4BAA4B,UAAU,sBAAsB,IAAI;AAC3E,CAAC"}
+{"version":3,"file":"KernelRefusal.js","names":[],"sources":["../../src/internal/KernelRefusal.ts"],"sourcesContent":["import * as Schema from \"effect/Schema\";\n\n/**\n * The kernel never answers this operation in process. Only the binary does.\n */\nexport class RequiresBinary extends Schema.TaggedError<RequiresBinary>()(\n  \"RequiresBinary\",\n  {\n    operation: Schema.Literals([\"textSearch\", \"vectorSearch\"]),\n    message: Schema.String,\n  },\n) {}\n\n/**\n * A later kernel row supplies this operation. Until then the kernel refuses it\n * rather than answer with convex-test's behaviour.\n */\nexport class KernelRowPending extends Schema.TaggedError<KernelRowPending>()(\n  \"KernelRowPending\",\n  {\n    operation: Schema.String,\n    row: Schema.Int,\n    message: Schema.String,\n  },\n) {}\n\n/**\n * A component was registered after the test backend opened, so its modules\n * would load after a function had already run.\n */\nexport class RegisteredAfterOpen extends Schema.TaggedError<RegisteredAfterOpen>()(\n  \"RegisteredAfterOpen\",\n  { componentPath: Schema.String, message: Schema.String },\n) {}\n\n/**\n * Every attempt of a mutation read data a commit changed before it could\n * publish. The kernel gives up on attempt 5.\n */\nexport class OptimisticConcurrencyControlFailure extends Schema.TaggedError<OptimisticConcurrencyControlFailure>()(\n  \"OptimisticConcurrencyControlFailure\",\n  { attempts: Schema.Int, message: Schema.String },\n) {}\n\n/**\n * A syscall reached a mutation's attempt after the mutation returned and its\n * syscalls drained, so the attempt was already held or published.\n */\nexport class ClosedAttempt extends Schema.TaggedError<ClosedAttempt>()(\n  \"ClosedAttempt\",\n  { operation: Schema.String, message: Schema.String },\n) {}\n\n/**\n * `apply` named an attempt the kernel does not hold: it was already applied, or\n * never prepared.\n */\nexport class StaleAttempt extends Schema.TaggedError<StaleAttempt>()(\n  \"StaleAttempt\",\n  { id: Schema.String, message: Schema.String },\n) {}\n\n/**\n * The runtime answered a commit timestamp no greater than the previous\n * commit's.\n */\nexport class CommitTsNotIncreasing extends Schema.TaggedError<CommitTsNotIncreasing>()(\n  \"CommitTsNotIncreasing\",\n  {\n    version: Schema.Int,\n    previous: Schema.BigInt,\n    commitTs: Schema.BigInt,\n    message: Schema.String,\n  },\n) {}\n\n/**\n * Draining scheduled functions ran its budget of jobs and work still remained.\n * A self-rescheduling function keeps the drain from ending unless its kit\n * declares it standing.\n */\nexport class DrainBudgetExceeded extends Schema.TaggedError<DrainBudgetExceeded>()(\n  \"DrainBudgetExceeded\",\n  {\n    budget: Schema.Int,\n    pending: Schema.Array(\n      Schema.Struct({ componentPath: Schema.String, name: Schema.String }),\n    ),\n    message: Schema.String,\n  },\n) {}\n\n/**\n * A component declared a standing source its modules do not export.\n */\nexport class UnknownStandingSource extends Schema.TaggedError<UnknownStandingSource>()(\n  \"UnknownStandingSource\",\n  { componentPath: Schema.String, name: Schema.String, message: Schema.String },\n) {}\n\nexport const requiresBinary = (operation: RequiresBinary[\"operation\"]) =>\n  new RequiresBinary({\n    operation,\n    message: `The test kernel does not simulate ${operation}. Run this case against the Convex binary.`,\n  });\n\nexport const rowPending = (operation: string, row: number) =>\n  new KernelRowPending({\n    operation,\n    row,\n    message: `The test kernel supplies ${operation} in build-order row ${row}.`,\n  });\n\n/**\n * Snapshot bytes are not a kernel snapshot this kernel reads: an unknown\n * header, a body that is not the snapshot's JSON, or a value that does not\n * decode.\n */\nexport class SnapshotMalformed extends Schema.TaggedError<SnapshotMalformed>()(\n  \"SnapshotMalformed\",\n  { reason: Schema.String, message: Schema.String },\n) {}\n\n/**\n * A snapshot's body does not hash to the digest its header names, so its bytes\n * changed after export.\n */\nexport class SnapshotDigestMismatch extends Schema.TaggedError<SnapshotDigestMismatch>()(\n  \"SnapshotDigestMismatch\",\n  { expected: Schema.String, actual: Schema.String, message: Schema.String },\n) {}\n\n/**\n * A snapshot's components are not the components registered on the world\n * restoring it.\n */\nexport class SnapshotComponentMismatch extends Schema.TaggedError<SnapshotComponentMismatch>()(\n  \"SnapshotComponentMismatch\",\n  {\n    snapshot: Schema.Array(Schema.String),\n    registered: Schema.Array(Schema.String),\n    message: Schema.String,\n  },\n) {}\n\n/**\n * A job's test world is named by no world, or by more than one, so the job\n * could not run under the world that scheduled it.\n */\nexport class SnapshotWorldUnresolved extends Schema.TaggedError<SnapshotWorldUnresolved>()(\n  \"SnapshotWorldUnresolved\",\n  {\n    name: Schema.String,\n    reason: Schema.Literals([\"missing\", \"ambiguous\"]),\n    message: Schema.String,\n  },\n) {}\n\n/**\n * A world holds work a snapshot does not carry: attempts held for `apply`, or,\n * when it restores, commits of its own.\n */\nexport class SnapshotWorldBusy extends Schema.TaggedError<SnapshotWorldBusy>()(\n  \"SnapshotWorldBusy\",\n  {\n    version: Schema.Int,\n    held: Schema.Array(Schema.String),\n    message: Schema.String,\n  },\n) {}\n\n/**\n * A snapshot marks a secret the restore was not given, so the raw value its\n * replay needs is not in memory.\n */\nexport class SnapshotSecretMissing extends Schema.TaggedError<SnapshotSecretMissing>()(\n  \"SnapshotSecretMissing\",\n  { ref: Schema.String, message: Schema.String },\n) {}\n\n/**\n * A world is running work a snapshot taken or restored now would split: calls\n * from the test, scheduler walks, or function executions, nested and detached\n * ones included.\n */\nexport class SnapshotWorldRunning extends Schema.TaggedError<SnapshotWorldRunning>()(\n  \"SnapshotWorldRunning\",\n  {\n    registry: Schema.Literals([\"running\", \"walks\", \"functions\"]),\n    count: Schema.Int,\n    message: Schema.String,\n  },\n) {}\n\n/**\n * A world has subscribers, whose identity versions a restore would rewind.\n * Subscriptions are live client state, so a restore needs a world with none.\n */\nexport class SnapshotSubscribed extends Schema.TaggedError<SnapshotSubscribed>()(\n  \"SnapshotSubscribed\",\n  { subscribers: Schema.Int, message: Schema.String },\n) {}\n\n/**\n * A snapshot's identity counters stand at or behind an identity its state\n * already holds, so the next allocation would reuse one.\n */\nexport class SnapshotAllocatorBehind extends Schema.TaggedError<SnapshotAllocatorBehind>()(\n  \"SnapshotAllocatorBehind\",\n  {\n    allocator: Schema.Literals([\n      \"nextDocumentId\",\n      \"lastCreationTime\",\n      \"nextAttemptId\",\n      \"identityEpoch\",\n    ]),\n    value: Schema.Finite,\n    required: Schema.Finite,\n    message: Schema.String,\n  },\n) {}\n\n/**\n * A snapshot's rows are not what its write log publishes: a row filed under\n * another table or an unregistered component, a version the log does not give\n * it, or a log change whose before value is not the row it replaced.\n */\nexport class SnapshotRowInconsistent extends Schema.TaggedError<SnapshotRowInconsistent>()(\n  \"SnapshotRowInconsistent\",\n  {\n    componentPath: Schema.String,\n    id: Schema.String,\n    reason: Schema.Literals([\n      \"id\",\n      \"component\",\n      \"log\",\n      \"row\",\n      \"systemFields\",\n      \"duplicate\",\n    ]),\n    message: Schema.String,\n  },\n) {}\n\n/**\n * A snapshot's commit timestamps do not strictly increase through its write\n * log, or its latest commit timestamp is not the log's last.\n */\nexport class SnapshotTimestampInconsistent extends Schema.TaggedError<SnapshotTimestampInconsistent>()(\n  \"SnapshotTimestampInconsistent\",\n  { version: Schema.Int, commitTs: Schema.String, message: Schema.String },\n) {}\n\n/**\n * A snapshot's jobs and job rows disagree: a job with no row, a row with no\n * job, a job left running, or a target no registered component exports.\n */\nexport class SnapshotJobInconsistent extends Schema.TaggedError<SnapshotJobInconsistent>()(\n  \"SnapshotJobInconsistent\",\n  {\n    id: Schema.String,\n    reason: Schema.Literals([\n      \"row\",\n      \"untargeted\",\n      \"inProgress\",\n      \"component\",\n      \"function\",\n      \"duplicate\",\n    ]),\n    message: Schema.String,\n  },\n) {}\n"],"mappings":";;;;;AAKA,IAAa,iBAAb,cAAoC,OAAO,YAA4B,CAAC,CACtE,kBACA;CACE,WAAW,OAAO,SAAS,CAAC,cAAc,cAAc,CAAC;CACzD,SAAS,OAAO;AAClB,CACF,CAAC,CAAC,CAAC;;;;;AAMH,IAAa,mBAAb,cAAsC,OAAO,YAA8B,CAAC,CAC1E,oBACA;CACE,WAAW,OAAO;CAClB,KAAK,OAAO;CACZ,SAAS,OAAO;AAClB,CACF,CAAC,CAAC,CAAC;;;;;AAMH,IAAa,sBAAb,cAAyC,OAAO,YAAiC,CAAC,CAChF,uBACA;CAAE,eAAe,OAAO;CAAQ,SAAS,OAAO;AAAO,CACzD,CAAC,CAAC,CAAC;;;;;AAMH,IAAa,sCAAb,cAAyD,OAAO,YAAiD,CAAC,CAChH,uCACA;CAAE,UAAU,OAAO;CAAK,SAAS,OAAO;AAAO,CACjD,CAAC,CAAC,CAAC;;;;;AAMH,IAAa,gBAAb,cAAmC,OAAO,YAA2B,CAAC,CACpE,iBACA;CAAE,WAAW,OAAO;CAAQ,SAAS,OAAO;AAAO,CACrD,CAAC,CAAC,CAAC;;;;;AAMH,IAAa,eAAb,cAAkC,OAAO,YAA0B,CAAC,CAClE,gBACA;CAAE,IAAI,OAAO;CAAQ,SAAS,OAAO;AAAO,CAC9C,CAAC,CAAC,CAAC;;;;;AAMH,IAAa,wBAAb,cAA2C,OAAO,YAAmC,CAAC,CACpF,yBACA;CACE,SAAS,OAAO;CAChB,UAAU,OAAO;CACjB,UAAU,OAAO;CACjB,SAAS,OAAO;AAClB,CACF,CAAC,CAAC,CAAC;;;;;;AAOH,IAAa,sBAAb,cAAyC,OAAO,YAAiC,CAAC,CAChF,uBACA;CACE,QAAQ,OAAO;CACf,SAAS,OAAO,MACd,OAAO,OAAO;EAAE,eAAe,OAAO;EAAQ,MAAM,OAAO;CAAO,CAAC,CACrE;CACA,SAAS,OAAO;AAClB,CACF,CAAC,CAAC,CAAC;;;;AAKH,IAAa,wBAAb,cAA2C,OAAO,YAAmC,CAAC,CACpF,yBACA;CAAE,eAAe,OAAO;CAAQ,MAAM,OAAO;CAAQ,SAAS,OAAO;AAAO,CAC9E,CAAC,CAAC,CAAC;AAEH,MAAa,kBAAkB,cAC7B,IAAI,eAAe;CACjB;CACA,SAAS,qCAAqC,UAAU;AAC1D,CAAC;AAEH,MAAa,cAAc,WAAmB,QAC5C,IAAI,iBAAiB;CACnB;CACA;CACA,SAAS,4BAA4B,UAAU,sBAAsB,IAAI;AAC3E,CAAC;;;;;;AAOH,IAAa,oBAAb,cAAuC,OAAO,YAA+B,CAAC,CAC5E,qBACA;CAAE,QAAQ,OAAO;CAAQ,SAAS,OAAO;AAAO,CAClD,CAAC,CAAC,CAAC;;;;;AAMH,IAAa,yBAAb,cAA4C,OAAO,YAAoC,CAAC,CACtF,0BACA;CAAE,UAAU,OAAO;CAAQ,QAAQ,OAAO;CAAQ,SAAS,OAAO;AAAO,CAC3E,CAAC,CAAC,CAAC;;;;;AAMH,IAAa,4BAAb,cAA+C,OAAO,YAAuC,CAAC,CAC5F,6BACA;CACE,UAAU,OAAO,MAAM,OAAO,MAAM;CACpC,YAAY,OAAO,MAAM,OAAO,MAAM;CACtC,SAAS,OAAO;AAClB,CACF,CAAC,CAAC,CAAC;;;;;AAMH,IAAa,0BAAb,cAA6C,OAAO,YAAqC,CAAC,CACxF,2BACA;CACE,MAAM,OAAO;CACb,QAAQ,OAAO,SAAS,CAAC,WAAW,WAAW,CAAC;CAChD,SAAS,OAAO;AAClB,CACF,CAAC,CAAC,CAAC;;;;;AAMH,IAAa,oBAAb,cAAuC,OAAO,YAA+B,CAAC,CAC5E,qBACA;CACE,SAAS,OAAO;CAChB,MAAM,OAAO,MAAM,OAAO,MAAM;CAChC,SAAS,OAAO;AAClB,CACF,CAAC,CAAC,CAAC;;;;;AAMH,IAAa,wBAAb,cAA2C,OAAO,YAAmC,CAAC,CACpF,yBACA;CAAE,KAAK,OAAO;CAAQ,SAAS,OAAO;AAAO,CAC/C,CAAC,CAAC,CAAC;;;;;;AAOH,IAAa,uBAAb,cAA0C,OAAO,YAAkC,CAAC,CAClF,wBACA;CACE,UAAU,OAAO,SAAS;EAAC;EAAW;EAAS;CAAW,CAAC;CAC3D,OAAO,OAAO;CACd,SAAS,OAAO;AAClB,CACF,CAAC,CAAC,CAAC;;;;;AAMH,IAAa,qBAAb,cAAwC,OAAO,YAAgC,CAAC,CAC9E,sBACA;CAAE,aAAa,OAAO;CAAK,SAAS,OAAO;AAAO,CACpD,CAAC,CAAC,CAAC;;;;;AAMH,IAAa,0BAAb,cAA6C,OAAO,YAAqC,CAAC,CACxF,2BACA;CACE,WAAW,OAAO,SAAS;EACzB;EACA;EACA;EACA;CACF,CAAC;CACD,OAAO,OAAO;CACd,UAAU,OAAO;CACjB,SAAS,OAAO;AAClB,CACF,CAAC,CAAC,CAAC;;;;;;AAOH,IAAa,0BAAb,cAA6C,OAAO,YAAqC,CAAC,CACxF,2BACA;CACE,eAAe,OAAO;CACtB,IAAI,OAAO;CACX,QAAQ,OAAO,SAAS;EACtB;EACA;EACA;EACA;EACA;EACA;CACF,CAAC;CACD,SAAS,OAAO;AAClB,CACF,CAAC,CAAC,CAAC;;;;;AAMH,IAAa,gCAAb,cAAmD,OAAO,YAA2C,CAAC,CACpG,iCACA;CAAE,SAAS,OAAO;CAAK,UAAU,OAAO;CAAQ,SAAS,OAAO;AAAO,CACzE,CAAC,CAAC,CAAC;;;;;AAMH,IAAa,0BAAb,cAA6C,OAAO,YAAqC,CAAC,CACxF,2BACA;CACE,IAAI,OAAO;CACX,QAAQ,OAAO,SAAS;EACtB;EACA;EACA;EACA;EACA;EACA;CACF,CAAC;CACD,SAAS,OAAO;AAClB,CACF,CAAC,CAAC,CAAC"}