@rocicorp/zero 1.11.0-canary.4 → 1.11.0-canary.40

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

@@ -23,6 +23,15 @@ export declare function test<T>(value: unknown, schema: v.Type<T>, mode?: ParseO
  * to operate directly on an Optional field.
  */
 export declare function testOptional<T>(value: unknown, schema: v.Type<T> | v.Optional<T>, mode?: ParseOptionsMode): Result<T | undefined>;
+/**
+ * Parses `schema` in strict mode, whatever mode the enclosing parse uses. Use
+ * it for the parts of a message that a reader must not silently ignore inside
+ * a lenient parse.
+ *
+ * Wrap a field, not a union variant: a union sees the wrapped type as
+ * `unknown`, so it can no longer pick the variant by its literal fields.
+ */
+export declare function strict<T>(schema: v.Type<T>): v.Type<T>;
 /**
  * Shallowly marks the schema as readonly.
  */
@@ -32,6 +41,19 @@ export declare function readonlyArray<T extends v.Type>(t: T): v.Type<readonly v
 export declare function readonlyRecord<T extends v.Type>(t: T): v.Type<Readonly<Record<string, v.Infer<T>>>>;
 declare const AbstractType: any;
 export declare function instanceOfAbstractType<T = unknown>(obj: unknown): obj is v.Type<T> | v.Optional<T>;
+export type TerminalType = Parameters<Parameters<v.Type['_toTerminals']>[0]>[0];
+/**
+ * Calls `func` for each terminal type that `type` is composed of, looking
+ * through unions, optionals and the transforms created by
+ * `.optional(() => x)`, `.assert()`, `.map()` and `.chain()`.
+ *
+ * This is the only use of valita's internal `_toTerminals`. The public API
+ * has no way to look inside a transform, so there is no alternative. The
+ * `toTerminals` test in valita.test.ts pins the behavior options.ts depends
+ * on, so a valita upgrade that changes it fails there instead of misparsing
+ * flags.
+ */
+export declare function toTerminals(type: v.Type | v.Optional, func: (t: TerminalType) => void): void;
 type ObjectShape = Record<string, typeof AbstractType>;
 /**
  * Similar to `ObjectType.partial()` except it recurses into nested objects.
@@ -40,4 +62,70 @@ type ObjectShape = Record<string, typeof AbstractType>;
 export declare function deepPartial<Shape extends ObjectShape>(s: v.ObjectType<Shape, undefined>): v.ObjectType<{ [K in keyof Shape]: v.Optional<v.Infer<Shape[K]>>; }, undefined>;
 type Literal = string | number | bigint | boolean;
 export declare function literalUnion<T extends [...Literal[]]>(...literals: T): v.Type<T[number]>;
+declare const unrecognized: unique symbol;
+/** A value of an open enum that this build doesn't know. Keeps the raw value. */
+export type Unrecognized<T extends Literal = string> = T & {
+    readonly [unrecognized]: true;
+};
+/**
+ * Like {@link literalUnion}, but any string parses, so a reader accepts values
+ * that a newer writer added. Unknown values keep their raw string and are typed
+ * as {@link Unrecognized}.
+ *
+ * Use it only where a reader can ignore or display an unknown value. Never use
+ * it for a value that changes what the reader computes, or for the
+ * discriminator of a union.
+ */
+export declare function openLiteralUnion<T extends [string, ...string[]]>(..._literals: T): v.Type<T[number] | Unrecognized>;
+/**
+ * Call in the `default` case of a `switch` over an open enum, so that a known
+ * value without a `case` fails to compile.
+ */
+export declare function assertUnrecognized(_value: Unrecognized): void;
+/** A tuple whose first element, its tag, is a literal. */
+type TaggedTuple = v.TupleType<[v.Type<Literal>, ...v.Type[]]>;
+/** A tuple with a tag this build doesn't know, as {@link taggedTupleUnion} parses it. */
+export type UnrecognizedTuple = [
+    tag: Unrecognized<Literal>,
+    ...rest: unknown[]
+];
+/**
+ * A union of tuples tagged by a literal in their first element, such as
+ * `['ping', {}]`. Unlike `union`, it picks the tuple by its tag instead of
+ * trying each in turn.
+ *
+ * With `open`, a tuple whose tag it doesn't know, but of the same type as a
+ * known tag, parses as is, typed as {@link UnrecognizedTuple}, so a reader can
+ * skip kinds a newer writer added. Use `isKnown` to tell them apart:
+ * TypeScript can't narrow the union by comparing the tag, because a tag
+ * literal is comparable to `Unrecognized`. A closed union is not implemented
+ * yet.
+ */
+export declare function taggedTupleUnion<T extends TaggedTuple[]>(tuples: T, options: {
+    readonly open: boolean;
+}): v.Type<v.Infer<T[number]> | UnrecognizedTuple> & {
+    isKnown(value: v.Infer<T[number]> | UnrecognizedTuple): value is v.Infer<T[number]>;
+};
+/** An object with a tag this build doesn't know, as {@link taggedObjectUnion} parses it. */
+export type UnrecognizedObject<K extends string> = {
+    readonly [P in K]: Unrecognized<Literal>;
+} & {
+    readonly [key: string]: unknown;
+};
+/**
+ * A union of objects told apart by a literal in their `key` property, their
+ * tag, such as `{op: 'queries', id: '1'}`. Unlike `union`, it picks the object
+ * by its tag instead of trying each in turn, so a bad object of a known kind
+ * fails with that kind's error.
+ *
+ * With `open`, an object whose tag it doesn't know, but of the same type as a
+ * known tag, parses as is, typed as {@link UnrecognizedObject}, so a reader
+ * can answer or skip kinds a newer writer added. Use `isKnown` to tell them
+ * apart. A closed union is not implemented yet.
+ */
+export declare function taggedObjectUnion<K extends string, T extends v.ObjectType[]>(key: K, objects: T, options: {
+    readonly open: boolean;
+}): v.Type<v.Infer<T[number]> | UnrecognizedObject<K>> & {
+    isKnown(value: v.Infer<T[number]> | UnrecognizedObject<K>): value is v.Infer<T[number]>;
+};
 //# sourceMappingURL=valita.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"valita.d.ts","sourceRoot":"","sources":["../../../../shared/src/valita.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,CAAC,MAAM,gBAAgB,CAAC;AAEpC,cAAc,gBAAgB,CAAC;AA+K/B;;;;GAIG;AACH,MAAM,MAAM,gBAAgB,GAAG,aAAa,GAAG,QAAQ,GAAG,OAAO,CAAC;AAElE,wBAAgB,KAAK,CAAC,CAAC,EACrB,KAAK,EAAE,OAAO,EACd,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EACjB,IAAI,CAAC,EAAE,gBAAgB,GACtB,CAAC,CAMH;AAED,wBAAgB,EAAE,CAAC,CAAC,EAClB,KAAK,EAAE,OAAO,EACd,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EACjB,IAAI,CAAC,EAAE,gBAAgB,GACtB,KAAK,IAAI,CAAC,CAEZ;AAED,wBAAgB,MAAM,CAAC,CAAC,EACtB,KAAK,EAAE,OAAO,EACd,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EACjB,IAAI,CAAC,EAAE,gBAAgB,GACtB,OAAO,CAAC,KAAK,IAAI,CAAC,CAEpB;AAED,KAAK,MAAM,CAAC,CAAC,IAAI;IAAC,EAAE,EAAE,IAAI,CAAC;IAAC,KAAK,EAAE,CAAC,CAAA;CAAC,GAAG;IAAC,EAAE,EAAE,KAAK,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAC,CAAC;AAEnE,wBAAgB,IAAI,CAAC,CAAC,EACpB,KAAK,EAAE,OAAO,EACd,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EACjB,IAAI,CAAC,EAAE,gBAAgB,GACtB,MAAM,CAAC,CAAC,CAAC,CASX;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAC5B,KAAK,EAAE,OAAO,EACd,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EACjC,IAAI,CAAC,EAAE,gBAAgB,GACtB,MAAM,CAAC,CAAC,GAAG,SAAS,CAAC,CAevB;AAED;;GAEG;AACH,wBAAgB,QAAQ,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAE7E;AAED,wBAAgB,cAAc,CAAC,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,QAAQ,CAAC,EAC1E,CAAC,EAAE,CAAC,GACH,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAEtC;AAED,wBAAgB,aAAa,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,EAC5C,CAAC,EAAE,CAAC,GACH,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAE/B;AAED,wBAAgB,cAAc,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,EAC7C,CAAC,EAAE,CAAC,GACH,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAE9C;AAED,QAAA,MAAM,YAAY,KAEL,CAAC;AAEd,wBAAgB,sBAAsB,CAAC,CAAC,GAAG,OAAO,EAChD,GAAG,EAAE,OAAO,GACX,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAElC;AAED,KAAK,WAAW,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,YAAY,CAAC,CAAC;AAEvD;;;GAGG;AACH,wBAAgB,WAAW,CAAC,KAAK,SAAS,WAAW,EACnD,CAAC,EAAE,CAAC,CAAC,UAAU,CAAC,KAAK,EAAE,SAAS,CAAC,mBAUN,CAAC,+DAC7B;AAED,KAAK,OAAO,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,OAAO,CAAC;AAElD,wBAAgB,YAAY,CAAC,CAAC,SAAS,CAAC,GAAG,OAAO,EAAE,CAAC,EACnD,GAAG,QAAQ,EAAE,CAAC,GACb,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAEnB"}
+{"version":3,"file":"valita.d.ts","sourceRoot":"","sources":["../../../../shared/src/valita.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,CAAC,MAAM,gBAAgB,CAAC;AAEpC,cAAc,gBAAgB,CAAC;AAwK/B;;;;GAIG;AACH,MAAM,MAAM,gBAAgB,GAAG,aAAa,GAAG,QAAQ,GAAG,OAAO,CAAC;AAElE,wBAAgB,KAAK,CAAC,CAAC,EACrB,KAAK,EAAE,OAAO,EACd,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EACjB,IAAI,CAAC,EAAE,gBAAgB,GACtB,CAAC,CAMH;AAED,wBAAgB,EAAE,CAAC,CAAC,EAClB,KAAK,EAAE,OAAO,EACd,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EACjB,IAAI,CAAC,EAAE,gBAAgB,GACtB,KAAK,IAAI,CAAC,CAEZ;AAED,wBAAgB,MAAM,CAAC,CAAC,EACtB,KAAK,EAAE,OAAO,EACd,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EACjB,IAAI,CAAC,EAAE,gBAAgB,GACtB,OAAO,CAAC,KAAK,IAAI,CAAC,CAEpB;AAED,KAAK,MAAM,CAAC,CAAC,IAAI;IAAC,EAAE,EAAE,IAAI,CAAC;IAAC,KAAK,EAAE,CAAC,CAAA;CAAC,GAAG;IAAC,EAAE,EAAE,KAAK,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAC,CAAC;AAEnE,wBAAgB,IAAI,CAAC,CAAC,EACpB,KAAK,EAAE,OAAO,EACd,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EACjB,IAAI,CAAC,EAAE,gBAAgB,GACtB,MAAM,CAAC,CAAC,CAAC,CAGX;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAC5B,KAAK,EAAE,OAAO,EACd,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EACjC,IAAI,CAAC,EAAE,gBAAgB,GACtB,MAAM,CAAC,CAAC,GAAG,SAAS,CAAC,CAMvB;AAID;;;;;;;GAOG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAKtD;AAED;;GAEG;AACH,wBAAgB,QAAQ,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAE7E;AAED,wBAAgB,cAAc,CAAC,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,QAAQ,CAAC,EAC1E,CAAC,EAAE,CAAC,GACH,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAEtC;AAED,wBAAgB,aAAa,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,EAC5C,CAAC,EAAE,CAAC,GACH,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAE/B;AAED,wBAAgB,cAAc,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,EAC7C,CAAC,EAAE,CAAC,GACH,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAE9C;AAED,QAAA,MAAM,YAAY,KAEL,CAAC;AAEd,wBAAgB,sBAAsB,CAAC,CAAC,GAAG,OAAO,EAChD,GAAG,EAAE,OAAO,GACX,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAElC;AAGD,MAAM,MAAM,YAAY,GAAG,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAEhF;;;;;;;;;;GAUG;AACH,wBAAgB,WAAW,CACzB,IAAI,EAAE,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,QAAQ,EACzB,IAAI,EAAE,CAAC,CAAC,EAAE,YAAY,KAAK,IAAI,GAC9B,IAAI,CAEN;AAED,KAAK,WAAW,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,YAAY,CAAC,CAAC;AAEvD;;;GAGG;AACH,wBAAgB,WAAW,CAAC,KAAK,SAAS,WAAW,EACnD,CAAC,EAAE,CAAC,CAAC,UAAU,CAAC,KAAK,EAAE,SAAS,CAAC,mBAYN,CAAC,+DAC7B;AAED,KAAK,OAAO,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,OAAO,CAAC;AAElD,wBAAgB,YAAY,CAAC,CAAC,SAAS,CAAC,GAAG,OAAO,EAAE,CAAC,EACnD,GAAG,QAAQ,EAAE,CAAC,GACb,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAEnB;AAED,OAAO,CAAC,MAAM,YAAY,EAAE,OAAO,MAAM,CAAC;AAE1C,iFAAiF;AACjF,MAAM,MAAM,YAAY,CAAC,CAAC,SAAS,OAAO,GAAG,MAAM,IAAI,CAAC,GAAG;IACzD,QAAQ,CAAC,CAAC,YAAY,CAAC,EAAE,IAAI,CAAC;CAC/B,CAAC;AAEF;;;;;;;;GAQG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,SAAS,CAAC,MAAM,EAAE,GAAG,MAAM,EAAE,CAAC,EAC9D,GAAG,SAAS,EAAE,CAAC,GACd,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,YAAY,CAAC,CAElC;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,YAAY,GAAG,IAAI,CAAG;AAEjE,0DAA0D;AAC1D,KAAK,WAAW,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;AAE/D,yFAAyF;AACzF,MAAM,MAAM,iBAAiB,GAAG;IAC9B,GAAG,EAAE,YAAY,CAAC,OAAO,CAAC;IAC1B,GAAG,IAAI,EAAE,OAAO,EAAE;CACnB,CAAC;AAEF;;;;;;;;;;;GAWG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,SAAS,WAAW,EAAE,EACtD,MAAM,EAAE,CAAC,EACT,OAAO,EAAE;IAAC,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAA;CAAC,GAChC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,iBAAiB,CAAC,GAAG;IAClD,OAAO,CACL,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,iBAAiB,GAC5C,KAAK,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;CAChC,CA0CA;AAED,4FAA4F;AAC5F,MAAM,MAAM,kBAAkB,CAAC,CAAC,SAAS,MAAM,IAAI;IACjD,QAAQ,EAAE,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,OAAO,CAAC;CACzC,GAAG;IAAC,QAAQ,EAAE,GAAG,EAAE,MAAM,GAAG,OAAO,CAAA;CAAC,CAAC;AAEtC;;;;;;;;;;GAUG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,SAAS,MAAM,EAAE,CAAC,SAAS,CAAC,CAAC,UAAU,EAAE,EAC1E,GAAG,EAAE,CAAC,EACN,OAAO,EAAE,CAAC,EACV,OAAO,EAAE;IAAC,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAA;CAAC,GAChC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,kBAAkB,CAAC,CAAC,CAAC,CAAC,GAAG;IACtD,OAAO,CACL,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,kBAAkB,CAAC,CAAC,CAAC,GAChD,KAAK,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;CAChC,CAgDA"}

package/out/shared/src/valita.js

@@ -4,17 +4,23 @@ export * from "@badrap/valita";
 //#region ../shared/src/valita.ts
 var valita_exports = /* @__PURE__ */ __exportAll({
 	assert: () => assert,
+	assertUnrecognized: () => assertUnrecognized,
 	deepPartial: () => deepPartial,
 	instanceOfAbstractType: () => instanceOfAbstractType,
 	is: () => is,
 	literalUnion: () => literalUnion,
+	openLiteralUnion: () => openLiteralUnion,
 	parse: () => parse,
 	readonly: () => readonly,
 	readonlyArray: () => readonlyArray,
 	readonlyObject: () => readonlyObject,
 	readonlyRecord: () => readonlyRecord,
+	strict: () => strict,
+	taggedObjectUnion: () => taggedObjectUnion,
+	taggedTupleUnion: () => taggedTupleUnion,
 	test: () => test,
-	testOptional: () => testOptional
+	testOptional: () => testOptional,
+	toTerminals: () => toTerminals
 });
 import * as import__badrap_valita from "@badrap/valita";
 __reExport(valita_exports, import__badrap_valita);
@@ -60,10 +66,7 @@ function getMessage(err, v, schema, mode) {
 			if (firstIssue.keys.length === 1) return `Unexpected property ${firstIssue.keys[0]}${atPath}`;
 			return `Unexpected properties ${displayList("and", firstIssue.keys)}${atPath}`;
 		case "invalid_union": return schema.name === "union" ? getDeepestUnionParseError(v, schema, mode ?? "strict") : `Invalid union value${atPath}`;
-		case "custom_error": {
-			const { error } = firstIssue;
-			return `${!error ? "unknown" : typeof error === "string" ? error : error.message ?? "unknown"}${atPath}. Got ${toDisplayAtPath(v, path)}`;
-		}
+		case "custom_error": return `${firstIssue.message}${atPath}. Got ${toDisplayAtPath(v, path)}`;
 	}
 }
 function getDeepestUnionParseError(value, schema, mode) {
@@ -107,12 +110,7 @@ function assert(value, schema, mode) {
 	parse(value, schema, mode);
 }
 function test(value, schema, mode) {
-	const res = schema.try(value, mode ? { mode } : void 0);
-	if (!res.ok) return {
-		ok: false,
-		error: getMessage(res, value, schema, mode)
-	};
-	return res;
+	return testOptional(value, schema, mode);
 }
 /**
 * Similar to {@link test} but works for AbstractTypes such as Optional.
@@ -120,19 +118,25 @@ function test(value, schema, mode) {
 * to operate directly on an Optional field.
 */
 function testOptional(value, schema, mode) {
-	let flags = 1;
-	if (mode === "passthrough") flags = 0;
-	else if (mode === "strip") flags = 2;
-	const res = schema.func(value, flags);
-	if (res === void 0) return {
-		ok: true,
-		value
-	};
-	else if (res.ok) return res;
-	return {
+	const res = schema.try(value, mode ? { mode } : void 0);
+	if (!res.ok) return {
 		ok: false,
-		error: getMessage(new v.ValitaError(res), value, schema, mode)
+		error: getMessage(res, value, schema, mode)
 	};
+	return res;
+}
+var STRICT = { mode: "strict" };
+/**
+* Parses `schema` in strict mode, whatever mode the enclosing parse uses. Use
+* it for the parts of a message that a reader must not silently ignore inside
+* a lenient parse.
+*
+* Wrap a field, not a union variant: a union sees the wrapped type as
+* `unknown`, so it can no longer pick the variant by its literal fields.
+*/
+function strict(schema) {
+	const type = v.unknown().chain((value) => schema.try(value, STRICT));
+	return Object.assign(type, { strict: schema });
 }
 /**
 * Shallowly marks the schema as readonly.
@@ -154,6 +158,20 @@ function instanceOfAbstractType(obj) {
 	return obj instanceof AbstractType;
 }
 /**
+* Calls `func` for each terminal type that `type` is composed of, looking
+* through unions, optionals and the transforms created by
+* `.optional(() => x)`, `.assert()`, `.map()` and `.chain()`.
+*
+* This is the only use of valita's internal `_toTerminals`. The public API
+* has no way to look inside a transform, so there is no alternative. The
+* `toTerminals` test in valita.test.ts pins the behavior options.ts depends
+* on, so a valita upgrade that changes it fails there instead of misparsing
+* flags.
+*/
+function toTerminals(type, func) {
+	type._toTerminals(func);
+}
+/**
 * Similar to `ObjectType.partial()` except it recurses into nested objects.
 * Rest types are not supported.
 */
@@ -166,7 +184,107 @@ function deepPartial(s) {
 function literalUnion(...literals) {
 	return v.union(...literals.map(v.literal));
 }
+/**
+* Like {@link literalUnion}, but any string parses, so a reader accepts values
+* that a newer writer added. Unknown values keep their raw string and are typed
+* as {@link Unrecognized}.
+*
+* Use it only where a reader can ignore or display an unknown value. Never use
+* it for a value that changes what the reader computes, or for the
+* discriminator of a union.
+*/
+function openLiteralUnion(..._literals) {
+	return v.string();
+}
+/**
+* Call in the `default` case of a `switch` over an open enum, so that a known
+* value without a `case` fails to compile.
+*/
+function assertUnrecognized(_value) {}
+/**
+* A union of tuples tagged by a literal in their first element, such as
+* `['ping', {}]`. Unlike `union`, it picks the tuple by its tag instead of
+* trying each in turn.
+*
+* With `open`, a tuple whose tag it doesn't know, but of the same type as a
+* known tag, parses as is, typed as {@link UnrecognizedTuple}, so a reader can
+* skip kinds a newer writer added. Use `isKnown` to tell them apart:
+* TypeScript can't narrow the union by comparing the tag, because a tag
+* literal is comparable to `Unrecognized`. A closed union is not implemented
+* yet.
+*/
+function taggedTupleUnion(tuples, options) {
+	if (!options.open) throw new Error("A closed taggedTupleUnion is not implemented");
+	const byTag = /* @__PURE__ */ new Map();
+	const tagTypes = /* @__PURE__ */ new Set();
+	for (const tuple of tuples) toTerminals(tuple.prefix[0], (t) => {
+		if (t.name !== "literal") throw new Error("Expected every tag to be a literal");
+		if (byTag.has(t.value)) throw new Error(`Duplicate tag ${toDisplay(t.value)}`);
+		byTag.set(t.value, tuple);
+		tagTypes.add(typeof t.value);
+	});
+	const expectedTag = `Expected ${displayList("or", [...tagTypes])}`;
+	const type = v.unknown().chain((value, options) => {
+		if (!Array.isArray(value)) return v.err("Expected array");
+		const [tag] = value;
+		const tuple = byTag.get(tag);
+		if (tuple) return tuple.try(value, options);
+		return tagTypes.has(typeof tag) ? v.ok(value) : v.err({
+			message: expectedTag,
+			path: [0]
+		});
+	});
+	return Object.assign(type, {
+		taggedTupleUnion: tuples,
+		isKnown: (value) => byTag.has(value[0])
+	});
+}
+/**
+* A union of objects told apart by a literal in their `key` property, their
+* tag, such as `{op: 'queries', id: '1'}`. Unlike `union`, it picks the object
+* by its tag instead of trying each in turn, so a bad object of a known kind
+* fails with that kind's error.
+*
+* With `open`, an object whose tag it doesn't know, but of the same type as a
+* known tag, parses as is, typed as {@link UnrecognizedObject}, so a reader
+* can answer or skip kinds a newer writer added. Use `isKnown` to tell them
+* apart. A closed union is not implemented yet.
+*/
+function taggedObjectUnion(key, objects, options) {
+	if (!options.open) throw new Error("A closed taggedObjectUnion is not implemented");
+	const byTag = /* @__PURE__ */ new Map();
+	const tagTypes = /* @__PURE__ */ new Set();
+	for (const object of objects) {
+		const tag = object.shape[key];
+		if (tag === void 0) throw new Error(`Expected every object to have ${key}`);
+		toTerminals(tag, (t) => {
+			if (t.name !== "literal") throw new Error("Expected every tag to be a literal");
+			if (byTag.has(t.value)) throw new Error(`Duplicate tag ${toDisplay(t.value)}`);
+			byTag.set(t.value, object);
+			tagTypes.add(typeof t.value);
+		});
+	}
+	const expectedTag = `Expected ${displayList("or", [...tagTypes])}`;
+	const tagOf = (value) => Object.hasOwn(value, key) ? value[key] : void 0;
+	const type = v.unknown().chain((value, options) => {
+		if (typeof value !== "object" || value === null || Array.isArray(value)) return v.err("Expected object");
+		const tag = tagOf(value);
+		const object = byTag.get(tag);
+		if (object) return object.try(value, options);
+		return tagTypes.has(typeof tag) ? v.ok(value) : v.err({
+			message: expectedTag,
+			path: [key]
+		});
+	});
+	return Object.assign(type, {
+		taggedObjectUnion: {
+			key,
+			objects
+		},
+		isKnown: (value) => byTag.has(tagOf(value))
+	});
+}
 //#endregion
-export { assert, deepPartial, instanceOfAbstractType, literalUnion, parse, readonly, readonlyArray, readonlyObject, readonlyRecord, test, testOptional, valita_exports };
+export { assert, deepPartial, instanceOfAbstractType, literalUnion, openLiteralUnion, parse, readonly, readonlyArray, readonlyObject, readonlyRecord, strict, taggedObjectUnion, taggedTupleUnion, test, testOptional, toTerminals, valita_exports };
 
 //# sourceMappingURL=valita.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"valita.js","names":[],"sources":["../../../../shared/src/valita.ts"],"sourcesContent":["import * as v from '@badrap/valita';\n\nexport * from '@badrap/valita';\n\nfunction toDisplay(value: unknown): string {\n  switch (typeof value) {\n    case 'string':\n    case 'number':\n    case 'boolean':\n      return JSON.stringify(value);\n    case 'undefined':\n      return 'undefined';\n    case 'bigint':\n      return value.toString() + 'n';\n    default:\n      if (value === null) {\n        return 'null';\n      }\n      if (Array.isArray(value)) {\n        return 'array';\n      }\n      return typeof value;\n  }\n}\n\ntype Key = string | number;\n\nfunction toDisplayAtPath(v: unknown, path: Key[] | undefined): string {\n  if (!path?.length) {\n    return toDisplay(v);\n  }\n\n  let cur = v;\n  for (const p of path) {\n    // oxlint-disable-next-line @typescript-eslint/no-explicit-any\n    cur = (cur as any)[p];\n  }\n  return toDisplay(cur);\n}\n\nfunction displayList<T>(\n  word: string,\n  expected: T[],\n  toDisplay: (x: T) => string | number = x => String(x),\n): string | number {\n  if (expected.length === 1) {\n    return toDisplay(expected[0]);\n  }\n\n  const suffix = `${toDisplay(\n    expected[expected.length - 2],\n    // oxlint-disable-next-line typescript/no-non-null-assertion\n  )} ${word} ${toDisplay(expected.at(-1)!)}`;\n  if (expected.length === 2) {\n    return suffix;\n  }\n  return `${expected.slice(0, -2).map(toDisplay).join(', ')}, ${suffix}`;\n}\n\nfunction getMessage(\n  err: v.Err | v.ValitaError,\n  v: unknown,\n  schema: v.Type | v.Optional,\n  mode: ParseOptionsMode | undefined,\n): string {\n  const firstIssue = err.issues[0];\n  const {path} = firstIssue;\n  const atPath = path?.length ? ` at ${path.join('.')}` : '';\n\n  switch (firstIssue.code) {\n    case 'invalid_type':\n      return `Expected ${displayList(\n        'or',\n        firstIssue.expected,\n      )}${atPath}. Got ${toDisplayAtPath(v, path)}`;\n    case 'missing_value': {\n      const atPath =\n        path && path.length > 1 ? ` at ${path.slice(0, -1).join('.')}` : '';\n\n      if (firstIssue.path?.length) {\n        return `Missing property ${firstIssue.path.at(-1)}${atPath}`;\n      }\n      return `TODO Unknown missing property${atPath}`;\n    }\n\n    case 'invalid_literal':\n      return `Expected literal value ${displayList(\n        'or',\n        firstIssue.expected,\n        toDisplay,\n      )}${atPath} Got ${toDisplayAtPath(v, path)}`;\n\n    case 'invalid_length': {\n      return `Expected array with length ${\n        firstIssue.minLength === firstIssue.maxLength\n          ? firstIssue.minLength\n          : `between ${firstIssue.minLength} and ${firstIssue.maxLength}`\n      }${atPath}. Got array with length ${(v as {length: number}).length}`;\n    }\n\n    case 'unrecognized_keys':\n      if (firstIssue.keys.length === 1) {\n        return `Unexpected property ${firstIssue.keys[0]}${atPath}`;\n      }\n      return `Unexpected properties ${displayList(\n        'and',\n        firstIssue.keys,\n      )}${atPath}`;\n\n    case 'invalid_union':\n      return schema.name === 'union'\n        ? getDeepestUnionParseError(v, schema as v.UnionType, mode ?? 'strict')\n        : `Invalid union value${atPath}`;\n\n    case 'custom_error': {\n      const {error} = firstIssue;\n      const message = !error\n        ? 'unknown'\n        : typeof error === 'string'\n          ? error\n          : (error.message ?? 'unknown');\n      return `${message}${atPath}. Got ${toDisplayAtPath(v, path)}`;\n    }\n  }\n}\n\ntype FailedType = {type: v.Type; err: v.Err};\n\nfunction getDeepestUnionParseError(\n  value: unknown,\n  schema: v.UnionType,\n  mode: ParseOptionsMode,\n): string {\n  const failures: FailedType[] = [];\n  for (const type of schema.options) {\n    const r = type.try(value, {mode});\n    if (!r.ok) {\n      failures.push({type, err: r});\n    }\n  }\n  if (failures.length) {\n    // compare the first and second longest-path errors\n    failures.sort(pathCmp);\n    if (failures.length === 1 || pathCmp(failures[0], failures[1]) < 0) {\n      return getMessage(failures[0].err, value, failures[0].type, mode);\n    }\n  }\n  // paths are equivalent\n  try {\n    const str = JSON.stringify(value);\n    return `Invalid union value: ${str}`;\n  } catch {\n    // fallback if the value could not be stringified\n    return `Invalid union value`;\n  }\n}\n\n// Descending-order comparison of Issue paths.\n// * [1, 'a'] sorts before [1]\n// * [1] sorts before [0]  (i.e. errors later in the tuple sort before earlier errors)\nfunction pathCmp(a: FailedType, b: FailedType) {\n  const aPath = a.err.issues[0].path;\n  const bPath = b.err.issues[0].path;\n  if (aPath.length !== bPath.length) {\n    return bPath.length - aPath.length;\n  }\n  for (let i = 0; i < aPath.length; i++) {\n    if (bPath[i] > aPath[i]) {\n      return -1;\n    }\n    if (bPath[i] < aPath[i]) {\n      return 1;\n    }\n  }\n  return 0;\n}\n\n/**\n * 'strip' allows unknown properties and removes unknown properties.\n * 'strict' errors if there are unknown properties.\n * 'passthrough' allows unknown properties.\n */\nexport type ParseOptionsMode = 'passthrough' | 'strict' | 'strip';\n\nexport function parse<T>(\n  value: unknown,\n  schema: v.Type<T>,\n  mode?: ParseOptionsMode,\n): T {\n  const res = test(value, schema, mode);\n  if (!res.ok) {\n    throw new TypeError(res.error);\n  }\n  return res.value;\n}\n\nexport function is<T>(\n  value: unknown,\n  schema: v.Type<T>,\n  mode?: ParseOptionsMode,\n): value is T {\n  return test(value, schema, mode).ok;\n}\n\nexport function assert<T>(\n  value: unknown,\n  schema: v.Type<T>,\n  mode?: ParseOptionsMode,\n): asserts value is T {\n  parse(value, schema, mode);\n}\n\ntype Result<T> = {ok: true; value: T} | {ok: false; error: string};\n\nexport function test<T>(\n  value: unknown,\n  schema: v.Type<T>,\n  mode?: ParseOptionsMode,\n): Result<T> {\n  const res = schema.try(value, mode ? {mode} : undefined);\n  if (!res.ok) {\n    return {\n      ok: false,\n      error: getMessage(res, value, schema, mode),\n    };\n  }\n  return res;\n}\n\n/**\n * Similar to {@link test} but works for AbstractTypes such as Optional.\n * This is for advanced usage. Prefer {@link test} unless you really need\n * to operate directly on an Optional field.\n */\nexport function testOptional<T>(\n  value: unknown,\n  schema: v.Type<T> | v.Optional<T>,\n  mode?: ParseOptionsMode,\n): Result<T | undefined> {\n  let flags = 0x1; // FLAG_FORBID_EXTRA_KEYS;\n  if (mode === 'passthrough') {\n    flags = 0;\n  } else if (mode === 'strip') {\n    flags = 0x2; // FLAG_STRIP_EXTRA_KEYS;\n  }\n  const res = schema.func(value, flags);\n  if (res === undefined) {\n    return {ok: true, value} as Result<T>;\n  } else if (res.ok) {\n    return res;\n  }\n  const err = new v.ValitaError(res);\n  return {ok: false, error: getMessage(err, value, schema, mode)};\n}\n\n/**\n * Shallowly marks the schema as readonly.\n */\nexport function readonly<T extends v.Type>(t: T): v.Type<Readonly<v.Infer<T>>> {\n  return t as v.Type<Readonly<v.Infer<T>>>;\n}\n\nexport function readonlyObject<T extends Record<string, v.Type | v.Optional>>(\n  t: T,\n): v.ObjectType<Readonly<T>, undefined> {\n  return v.object(t);\n}\n\nexport function readonlyArray<T extends v.Type>(\n  t: T,\n): v.Type<readonly v.Infer<T>[]> {\n  return v.array(t);\n}\n\nexport function readonlyRecord<T extends v.Type>(\n  t: T,\n): v.Type<Readonly<Record<string, v.Infer<T>>>> {\n  return v.record(t);\n}\n\nconst AbstractType = Object.getPrototypeOf(\n  Object.getPrototypeOf(v.string().optional()),\n).constructor;\n\nexport function instanceOfAbstractType<T = unknown>(\n  obj: unknown,\n): obj is v.Type<T> | v.Optional<T> {\n  return obj instanceof AbstractType;\n}\n\ntype ObjectShape = Record<string, typeof AbstractType>;\n\n/**\n * Similar to `ObjectType.partial()` except it recurses into nested objects.\n * Rest types are not supported.\n */\nexport function deepPartial<Shape extends ObjectShape>(\n  s: v.ObjectType<Shape, undefined>,\n) {\n  const shape = {} as Record<string, unknown>;\n  for (const [key, type] of Object.entries(s.shape)) {\n    if (type.name === 'object') {\n      shape[key] = deepPartial(type as v.ObjectType).optional();\n    } else {\n      shape[key] = type.optional();\n    }\n  }\n  return v.object(shape as {[K in keyof Shape]: v.Optional<v.Infer<Shape[K]>>});\n}\n\ntype Literal = string | number | bigint | boolean;\n\nexport function literalUnion<T extends [...Literal[]]>(\n  ...literals: T\n): v.Type<T[number]> {\n  return v.union(...literals.map(v.literal));\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAIA,SAAS,UAAU,OAAwB;CACzC,QAAQ,OAAO,OAAf;EACE,KAAK;EACL,KAAK;EACL,KAAK,WACH,OAAO,KAAK,UAAU,KAAK;EAC7B,KAAK,aACH,OAAO;EACT,KAAK,UACH,OAAO,MAAM,SAAS,IAAI;EAC5B;GACE,IAAI,UAAU,MACZ,OAAO;GAET,IAAI,MAAM,QAAQ,KAAK,GACrB,OAAO;GAET,OAAO,OAAO;CAClB;AACF;AAIA,SAAS,gBAAgB,GAAY,MAAiC;CACpE,IAAI,CAAC,MAAM,QACT,OAAO,UAAU,CAAC;CAGpB,IAAI,MAAM;CACV,KAAK,MAAM,KAAK,MAEd,MAAO,IAAY;CAErB,OAAO,UAAU,GAAG;AACtB;AAEA,SAAS,YACP,MACA,UACA,aAAuC,MAAK,OAAO,CAAC,GACnC;CACjB,IAAI,SAAS,WAAW,GACtB,OAAO,UAAU,SAAS,EAAE;CAG9B,MAAM,SAAS,GAAG,UAChB,SAAS,SAAS,SAAS,EAE7B,EAAE,GAAG,KAAK,GAAG,UAAU,SAAS,GAAG,EAAE,CAAE;CACvC,IAAI,SAAS,WAAW,GACtB,OAAO;CAET,OAAO,GAAG,SAAS,MAAM,GAAG,EAAE,EAAE,IAAI,SAAS,EAAE,KAAK,IAAI,EAAE,IAAI;AAChE;AAEA,SAAS,WACP,KACA,GACA,QACA,MACQ;CACR,MAAM,aAAa,IAAI,OAAO;CAC9B,MAAM,EAAC,SAAQ;CACf,MAAM,SAAS,MAAM,SAAS,OAAO,KAAK,KAAK,GAAG,MAAM;CAExD,QAAQ,WAAW,MAAnB;EACE,KAAK,gBACH,OAAO,YAAY,YACjB,MACA,WAAW,QACb,IAAI,OAAO,QAAQ,gBAAgB,GAAG,IAAI;EAC5C,KAAK,iBAAiB;GACpB,MAAM,SACJ,QAAQ,KAAK,SAAS,IAAI,OAAO,KAAK,MAAM,GAAG,EAAE,EAAE,KAAK,GAAG,MAAM;GAEnE,IAAI,WAAW,MAAM,QACnB,OAAO,oBAAoB,WAAW,KAAK,GAAG,EAAE,IAAI;GAEtD,OAAO,gCAAgC;EACzC;EAEA,KAAK,mBACH,OAAO,0BAA0B,YAC/B,MACA,WAAW,UACX,SACF,IAAI,OAAO,OAAO,gBAAgB,GAAG,IAAI;EAE3C,KAAK,kBACH,OAAO,8BACL,WAAW,cAAc,WAAW,YAChC,WAAW,YACX,WAAW,WAAW,UAAU,OAAO,WAAW,cACrD,OAAO,0BAA2B,EAAuB;EAG9D,KAAK;GACH,IAAI,WAAW,KAAK,WAAW,GAC7B,OAAO,uBAAuB,WAAW,KAAK,KAAK;GAErD,OAAO,yBAAyB,YAC9B,OACA,WAAW,IACb,IAAI;EAEN,KAAK,iBACH,OAAO,OAAO,SAAS,UACnB,0BAA0B,GAAG,QAAuB,QAAQ,QAAQ,IACpE,sBAAsB;EAE5B,KAAK,gBAAgB;GACnB,MAAM,EAAC,UAAS;GAMhB,OAAO,GALS,CAAC,QACb,YACA,OAAO,UAAU,WACf,QACC,MAAM,WAAW,YACJ,OAAO,QAAQ,gBAAgB,GAAG,IAAI;EAC5D;CACF;AACF;AAIA,SAAS,0BACP,OACA,QACA,MACQ;CACR,MAAM,WAAyB,CAAC;CAChC,KAAK,MAAM,QAAQ,OAAO,SAAS;EACjC,MAAM,IAAI,KAAK,IAAI,OAAO,EAAC,KAAI,CAAC;EAChC,IAAI,CAAC,EAAE,IACL,SAAS,KAAK;GAAC;GAAM,KAAK;EAAC,CAAC;CAEhC;CACA,IAAI,SAAS,QAAQ;EAEnB,SAAS,KAAK,OAAO;EACrB,IAAI,SAAS,WAAW,KAAK,QAAQ,SAAS,IAAI,SAAS,EAAE,IAAI,GAC/D,OAAO,WAAW,SAAS,GAAG,KAAK,OAAO,SAAS,GAAG,MAAM,IAAI;CAEpE;CAEA,IAAI;EAEF,OAAO,wBADK,KAAK,UAAU,KACI;CACjC,QAAQ;EAEN,OAAO;CACT;AACF;AAKA,SAAS,QAAQ,GAAe,GAAe;CAC7C,MAAM,QAAQ,EAAE,IAAI,OAAO,GAAG;CAC9B,MAAM,QAAQ,EAAE,IAAI,OAAO,GAAG;CAC9B,IAAI,MAAM,WAAW,MAAM,QACzB,OAAO,MAAM,SAAS,MAAM;CAE9B,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;EACrC,IAAI,MAAM,KAAK,MAAM,IACnB,OAAO;EAET,IAAI,MAAM,KAAK,MAAM,IACnB,OAAO;CAEX;CACA,OAAO;AACT;AASA,SAAgB,MACd,OACA,QACA,MACG;CACH,MAAM,MAAM,KAAK,OAAO,QAAQ,IAAI;CACpC,IAAI,CAAC,IAAI,IACP,MAAM,IAAI,UAAU,IAAI,KAAK;CAE/B,OAAO,IAAI;AACb;AAEA,SAAgB,GACd,OACA,QACA,MACY;CACZ,OAAO,KAAK,OAAO,QAAQ,IAAI,EAAE;AACnC;AAEA,SAAgB,OACd,OACA,QACA,MACoB;CACpB,MAAM,OAAO,QAAQ,IAAI;AAC3B;AAIA,SAAgB,KACd,OACA,QACA,MACW;CACX,MAAM,MAAM,OAAO,IAAI,OAAO,OAAO,EAAC,KAAI,IAAI,KAAA,CAAS;CACvD,IAAI,CAAC,IAAI,IACP,OAAO;EACL,IAAI;EACJ,OAAO,WAAW,KAAK,OAAO,QAAQ,IAAI;CAC5C;CAEF,OAAO;AACT;;;;;;AAOA,SAAgB,aACd,OACA,QACA,MACuB;CACvB,IAAI,QAAQ;CACZ,IAAI,SAAS,eACX,QAAQ;MACH,IAAI,SAAS,SAClB,QAAQ;CAEV,MAAM,MAAM,OAAO,KAAK,OAAO,KAAK;CACpC,IAAI,QAAQ,KAAA,GACV,OAAO;EAAC,IAAI;EAAM;CAAK;MAClB,IAAI,IAAI,IACb,OAAO;CAGT,OAAO;EAAC,IAAI;EAAO,OAAO,WAAW,IADrB,EAAE,YAAY,GACO,GAAK,OAAO,QAAQ,IAAI;CAAC;AAChE;;;;AAKA,SAAgB,SAA2B,GAAoC;CAC7E,OAAO;AACT;AAEA,SAAgB,eACd,GACsC;CACtC,OAAO,EAAE,OAAO,CAAC;AACnB;AAEA,SAAgB,cACd,GAC+B;CAC/B,OAAO,EAAE,MAAM,CAAC;AAClB;AAEA,SAAgB,eACd,GAC8C;CAC9C,OAAO,EAAE,OAAO,CAAC;AACnB;AAEA,IAAM,eAAe,OAAO,eAC1B,OAAO,eAAe,EAAE,OAAO,EAAE,SAAS,CAAC,CAC7C,EAAE;AAEF,SAAgB,uBACd,KACkC;CAClC,OAAO,eAAe;AACxB;;;;;AAQA,SAAgB,YACd,GACA;CACA,MAAM,QAAQ,CAAC;CACf,KAAK,MAAM,CAAC,KAAK,SAAS,OAAO,QAAQ,EAAE,KAAK,GAC9C,IAAI,KAAK,SAAS,UAChB,MAAM,OAAO,YAAY,IAAoB,EAAE,SAAS;MAExD,MAAM,OAAO,KAAK,SAAS;CAG/B,OAAO,EAAE,OAAO,KAA4D;AAC9E;AAIA,SAAgB,aACd,GAAG,UACgB;CACnB,OAAO,EAAE,MAAM,GAAG,SAAS,IAAI,EAAE,OAAO,CAAC;AAC3C"}
+{"version":3,"file":"valita.js","names":[],"sources":["../../../../shared/src/valita.ts"],"sourcesContent":["import * as v from '@badrap/valita';\n\nexport * from '@badrap/valita';\n\nfunction toDisplay(value: unknown): string {\n  switch (typeof value) {\n    case 'string':\n    case 'number':\n    case 'boolean':\n      return JSON.stringify(value);\n    case 'undefined':\n      return 'undefined';\n    case 'bigint':\n      return value.toString() + 'n';\n    default:\n      if (value === null) {\n        return 'null';\n      }\n      if (Array.isArray(value)) {\n        return 'array';\n      }\n      return typeof value;\n  }\n}\n\ntype Key = string | number;\n\nfunction toDisplayAtPath(v: unknown, path: Key[] | undefined): string {\n  if (!path?.length) {\n    return toDisplay(v);\n  }\n\n  let cur = v;\n  for (const p of path) {\n    // oxlint-disable-next-line @typescript-eslint/no-explicit-any\n    cur = (cur as any)[p];\n  }\n  return toDisplay(cur);\n}\n\nfunction displayList<T>(\n  word: string,\n  expected: T[],\n  toDisplay: (x: T) => string | number = x => String(x),\n): string | number {\n  if (expected.length === 1) {\n    return toDisplay(expected[0]);\n  }\n\n  const suffix = `${toDisplay(\n    expected[expected.length - 2],\n    // oxlint-disable-next-line typescript/no-non-null-assertion\n  )} ${word} ${toDisplay(expected.at(-1)!)}`;\n  if (expected.length === 2) {\n    return suffix;\n  }\n  return `${expected.slice(0, -2).map(toDisplay).join(', ')}, ${suffix}`;\n}\n\nfunction getMessage(\n  err: v.Err,\n  v: unknown,\n  schema: v.Type | v.Optional,\n  mode: ParseOptionsMode | undefined,\n): string {\n  const firstIssue = err.issues[0];\n  const {path} = firstIssue;\n  const atPath = path?.length ? ` at ${path.join('.')}` : '';\n\n  switch (firstIssue.code) {\n    case 'invalid_type':\n      return `Expected ${displayList(\n        'or',\n        firstIssue.expected,\n      )}${atPath}. Got ${toDisplayAtPath(v, path)}`;\n    case 'missing_value': {\n      const atPath =\n        path && path.length > 1 ? ` at ${path.slice(0, -1).join('.')}` : '';\n\n      if (firstIssue.path?.length) {\n        return `Missing property ${firstIssue.path.at(-1)}${atPath}`;\n      }\n      return `TODO Unknown missing property${atPath}`;\n    }\n\n    case 'invalid_literal':\n      return `Expected literal value ${displayList(\n        'or',\n        firstIssue.expected,\n        toDisplay,\n      )}${atPath} Got ${toDisplayAtPath(v, path)}`;\n\n    case 'invalid_length': {\n      return `Expected array with length ${\n        firstIssue.minLength === firstIssue.maxLength\n          ? firstIssue.minLength\n          : `between ${firstIssue.minLength} and ${firstIssue.maxLength}`\n      }${atPath}. Got array with length ${(v as {length: number}).length}`;\n    }\n\n    case 'unrecognized_keys':\n      if (firstIssue.keys.length === 1) {\n        return `Unexpected property ${firstIssue.keys[0]}${atPath}`;\n      }\n      return `Unexpected properties ${displayList(\n        'and',\n        firstIssue.keys,\n      )}${atPath}`;\n\n    case 'invalid_union':\n      return schema.name === 'union'\n        ? getDeepestUnionParseError(v, schema as v.UnionType, mode ?? 'strict')\n        : `Invalid union value${atPath}`;\n\n    case 'custom_error':\n      return `${firstIssue.message}${atPath}. Got ${toDisplayAtPath(v, path)}`;\n  }\n}\n\ntype FailedType = {type: v.Type; err: v.Err};\n\nfunction getDeepestUnionParseError(\n  value: unknown,\n  schema: v.UnionType,\n  mode: ParseOptionsMode,\n): string {\n  const failures: FailedType[] = [];\n  for (const type of schema.options) {\n    const r = type.try(value, {mode});\n    if (!r.ok) {\n      failures.push({type, err: r});\n    }\n  }\n  if (failures.length) {\n    // compare the first and second longest-path errors\n    failures.sort(pathCmp);\n    if (failures.length === 1 || pathCmp(failures[0], failures[1]) < 0) {\n      return getMessage(failures[0].err, value, failures[0].type, mode);\n    }\n  }\n  // paths are equivalent\n  try {\n    const str = JSON.stringify(value);\n    return `Invalid union value: ${str}`;\n  } catch {\n    // fallback if the value could not be stringified\n    return `Invalid union value`;\n  }\n}\n\n// Descending-order comparison of Issue paths.\n// * [1, 'a'] sorts before [1]\n// * [1] sorts before [0]  (i.e. errors later in the tuple sort before earlier errors)\nfunction pathCmp(a: FailedType, b: FailedType) {\n  const aPath = a.err.issues[0].path;\n  const bPath = b.err.issues[0].path;\n  if (aPath.length !== bPath.length) {\n    return bPath.length - aPath.length;\n  }\n  for (let i = 0; i < aPath.length; i++) {\n    if (bPath[i] > aPath[i]) {\n      return -1;\n    }\n    if (bPath[i] < aPath[i]) {\n      return 1;\n    }\n  }\n  return 0;\n}\n\n/**\n * 'strip' allows unknown properties and removes unknown properties.\n * 'strict' errors if there are unknown properties.\n * 'passthrough' allows unknown properties.\n */\nexport type ParseOptionsMode = 'passthrough' | 'strict' | 'strip';\n\nexport function parse<T>(\n  value: unknown,\n  schema: v.Type<T>,\n  mode?: ParseOptionsMode,\n): T {\n  const res = test(value, schema, mode);\n  if (!res.ok) {\n    throw new TypeError(res.error);\n  }\n  return res.value;\n}\n\nexport function is<T>(\n  value: unknown,\n  schema: v.Type<T>,\n  mode?: ParseOptionsMode,\n): value is T {\n  return test(value, schema, mode).ok;\n}\n\nexport function assert<T>(\n  value: unknown,\n  schema: v.Type<T>,\n  mode?: ParseOptionsMode,\n): asserts value is T {\n  parse(value, schema, mode);\n}\n\ntype Result<T> = {ok: true; value: T} | {ok: false; error: string};\n\nexport function test<T>(\n  value: unknown,\n  schema: v.Type<T>,\n  mode?: ParseOptionsMode,\n): Result<T> {\n  // A Type<T> only yields undefined if T includes it.\n  return testOptional(value, schema, mode) as Result<T>;\n}\n\n/**\n * Similar to {@link test} but works for AbstractTypes such as Optional.\n * This is for advanced usage. Prefer {@link test} unless you really need\n * to operate directly on an Optional field.\n */\nexport function testOptional<T>(\n  value: unknown,\n  schema: v.Type<T> | v.Optional<T>,\n  mode?: ParseOptionsMode,\n): Result<T | undefined> {\n  const res = schema.try(value, mode ? {mode} : undefined);\n  if (!res.ok) {\n    return {ok: false, error: getMessage(res, value, schema, mode)};\n  }\n  return res;\n}\n\nconst STRICT = {mode: 'strict'} as const;\n\n/**\n * Parses `schema` in strict mode, whatever mode the enclosing parse uses. Use\n * it for the parts of a message that a reader must not silently ignore inside\n * a lenient parse.\n *\n * Wrap a field, not a union variant: a union sees the wrapped type as\n * `unknown`, so it can no longer pick the variant by its literal fields.\n */\nexport function strict<T>(schema: v.Type<T>): v.Type<T> {\n  const type = v.unknown().chain(value => schema.try(value, STRICT));\n  // A transform serializes as just its name. Show the wrapped schema too, so a\n  // change to it still changes the hash in protocol-version.test.ts.\n  return Object.assign(type, {strict: schema});\n}\n\n/**\n * Shallowly marks the schema as readonly.\n */\nexport function readonly<T extends v.Type>(t: T): v.Type<Readonly<v.Infer<T>>> {\n  return t as v.Type<Readonly<v.Infer<T>>>;\n}\n\nexport function readonlyObject<T extends Record<string, v.Type | v.Optional>>(\n  t: T,\n): v.ObjectType<Readonly<T>, undefined> {\n  return v.object(t);\n}\n\nexport function readonlyArray<T extends v.Type>(\n  t: T,\n): v.Type<readonly v.Infer<T>[]> {\n  return v.array(t);\n}\n\nexport function readonlyRecord<T extends v.Type>(\n  t: T,\n): v.Type<Readonly<Record<string, v.Infer<T>>>> {\n  return v.record(t);\n}\n\nconst AbstractType = Object.getPrototypeOf(\n  Object.getPrototypeOf(v.string().optional()),\n).constructor;\n\nexport function instanceOfAbstractType<T = unknown>(\n  obj: unknown,\n): obj is v.Type<T> | v.Optional<T> {\n  return obj instanceof AbstractType;\n}\n\n// valita does not export TerminalType.\nexport type TerminalType = Parameters<Parameters<v.Type['_toTerminals']>[0]>[0];\n\n/**\n * Calls `func` for each terminal type that `type` is composed of, looking\n * through unions, optionals and the transforms created by\n * `.optional(() => x)`, `.assert()`, `.map()` and `.chain()`.\n *\n * This is the only use of valita's internal `_toTerminals`. The public API\n * has no way to look inside a transform, so there is no alternative. The\n * `toTerminals` test in valita.test.ts pins the behavior options.ts depends\n * on, so a valita upgrade that changes it fails there instead of misparsing\n * flags.\n */\nexport function toTerminals(\n  type: v.Type | v.Optional,\n  func: (t: TerminalType) => void,\n): void {\n  type._toTerminals(func);\n}\n\ntype ObjectShape = Record<string, typeof AbstractType>;\n\n/**\n * Similar to `ObjectType.partial()` except it recurses into nested objects.\n * Rest types are not supported.\n */\nexport function deepPartial<Shape extends ObjectShape>(\n  s: v.ObjectType<Shape, undefined>,\n) {\n  const shape = {} as Record<string, unknown>;\n  for (const [key, type] of Object.entries(s.shape)) {\n    if (type.name === 'object') {\n      shape[key] = deepPartial(\n        type as v.ObjectType<ObjectShape, undefined>,\n      ).optional();\n    } else {\n      shape[key] = type.optional();\n    }\n  }\n  return v.object(shape as {[K in keyof Shape]: v.Optional<v.Infer<Shape[K]>>});\n}\n\ntype Literal = string | number | bigint | boolean;\n\nexport function literalUnion<T extends [...Literal[]]>(\n  ...literals: T\n): v.Type<T[number]> {\n  return v.union(...literals.map(v.literal));\n}\n\ndeclare const unrecognized: unique symbol;\n\n/** A value of an open enum that this build doesn't know. Keeps the raw value. */\nexport type Unrecognized<T extends Literal = string> = T & {\n  readonly [unrecognized]: true;\n};\n\n/**\n * Like {@link literalUnion}, but any string parses, so a reader accepts values\n * that a newer writer added. Unknown values keep their raw string and are typed\n * as {@link Unrecognized}.\n *\n * Use it only where a reader can ignore or display an unknown value. Never use\n * it for a value that changes what the reader computes, or for the\n * discriminator of a union.\n */\nexport function openLiteralUnion<T extends [string, ...string[]]>(\n  ..._literals: T\n): v.Type<T[number] | Unrecognized> {\n  return v.string() as v.Type<T[number] | Unrecognized>;\n}\n\n/**\n * Call in the `default` case of a `switch` over an open enum, so that a known\n * value without a `case` fails to compile.\n */\nexport function assertUnrecognized(_value: Unrecognized): void {}\n\n/** A tuple whose first element, its tag, is a literal. */\ntype TaggedTuple = v.TupleType<[v.Type<Literal>, ...v.Type[]]>;\n\n/** A tuple with a tag this build doesn't know, as {@link taggedTupleUnion} parses it. */\nexport type UnrecognizedTuple = [\n  tag: Unrecognized<Literal>,\n  ...rest: unknown[],\n];\n\n/**\n * A union of tuples tagged by a literal in their first element, such as\n * `['ping', {}]`. Unlike `union`, it picks the tuple by its tag instead of\n * trying each in turn.\n *\n * With `open`, a tuple whose tag it doesn't know, but of the same type as a\n * known tag, parses as is, typed as {@link UnrecognizedTuple}, so a reader can\n * skip kinds a newer writer added. Use `isKnown` to tell them apart:\n * TypeScript can't narrow the union by comparing the tag, because a tag\n * literal is comparable to `Unrecognized`. A closed union is not implemented\n * yet.\n */\nexport function taggedTupleUnion<T extends TaggedTuple[]>(\n  tuples: T,\n  options: {readonly open: boolean},\n): v.Type<v.Infer<T[number]> | UnrecognizedTuple> & {\n  isKnown(\n    value: v.Infer<T[number]> | UnrecognizedTuple,\n  ): value is v.Infer<T[number]>;\n} {\n  if (!options.open) {\n    throw new Error('A closed taggedTupleUnion is not implemented');\n  }\n  type Known = v.Infer<T[number]>;\n  const byTag = new Map<unknown, v.Type>();\n  const tagTypes = new Set<string>();\n  for (const tuple of tuples) {\n    toTerminals(tuple.prefix[0], t => {\n      if (t.name !== 'literal') {\n        throw new Error('Expected every tag to be a literal');\n      }\n      if (byTag.has(t.value)) {\n        throw new Error(`Duplicate tag ${toDisplay(t.value)}`);\n      }\n      byTag.set(t.value, tuple);\n      tagTypes.add(typeof t.value);\n    });\n  }\n  const expectedTag = `Expected ${displayList('or', [...tagTypes])}`;\n  const type = v\n    .unknown()\n    .chain((value, options): v.ValitaResult<Known | UnrecognizedTuple> => {\n      if (!Array.isArray(value)) {\n        return v.err('Expected array');\n      }\n      const [tag] = value;\n      const tuple = byTag.get(tag);\n      if (tuple) {\n        return tuple.try(value, options) as v.ValitaResult<Known>;\n      }\n      return tagTypes.has(typeof tag)\n        ? v.ok(value as UnrecognizedTuple)\n        : v.err({message: expectedTag, path: [0]});\n    });\n  return Object.assign(type, {\n    // A transform serializes as just its name. Show the tuples too, so a\n    // change to them still changes the hash in protocol-version.test.ts.\n    taggedTupleUnion: tuples,\n    isKnown: (value: Known | UnrecognizedTuple): value is Known =>\n      byTag.has(value[0]),\n  });\n}\n\n/** An object with a tag this build doesn't know, as {@link taggedObjectUnion} parses it. */\nexport type UnrecognizedObject<K extends string> = {\n  readonly [P in K]: Unrecognized<Literal>;\n} & {readonly [key: string]: unknown};\n\n/**\n * A union of objects told apart by a literal in their `key` property, their\n * tag, such as `{op: 'queries', id: '1'}`. Unlike `union`, it picks the object\n * by its tag instead of trying each in turn, so a bad object of a known kind\n * fails with that kind's error.\n *\n * With `open`, an object whose tag it doesn't know, but of the same type as a\n * known tag, parses as is, typed as {@link UnrecognizedObject}, so a reader\n * can answer or skip kinds a newer writer added. Use `isKnown` to tell them\n * apart. A closed union is not implemented yet.\n */\nexport function taggedObjectUnion<K extends string, T extends v.ObjectType[]>(\n  key: K,\n  objects: T,\n  options: {readonly open: boolean},\n): v.Type<v.Infer<T[number]> | UnrecognizedObject<K>> & {\n  isKnown(\n    value: v.Infer<T[number]> | UnrecognizedObject<K>,\n  ): value is v.Infer<T[number]>;\n} {\n  if (!options.open) {\n    throw new Error('A closed taggedObjectUnion is not implemented');\n  }\n  type Known = v.Infer<T[number]>;\n  const byTag = new Map<unknown, v.Type>();\n  const tagTypes = new Set<string>();\n  for (const object of objects) {\n    const tag = object.shape[key] as v.Type | v.Optional | undefined;\n    if (tag === undefined) {\n      throw new Error(`Expected every object to have ${key}`);\n    }\n    toTerminals(tag, t => {\n      if (t.name !== 'literal') {\n        throw new Error('Expected every tag to be a literal');\n      }\n      if (byTag.has(t.value)) {\n        throw new Error(`Duplicate tag ${toDisplay(t.value)}`);\n      }\n      byTag.set(t.value, object);\n      tagTypes.add(typeof t.value);\n    });\n  }\n  const expectedTag = `Expected ${displayList('or', [...tagTypes])}`;\n  const tagOf = (value: object): unknown =>\n    Object.hasOwn(value, key) ? (value as Record<K, unknown>)[key] : undefined;\n  const type = v\n    .unknown()\n    .chain((value, options): v.ValitaResult<Known | UnrecognizedObject<K>> => {\n      if (typeof value !== 'object' || value === null || Array.isArray(value)) {\n        return v.err('Expected object');\n      }\n      const tag = tagOf(value);\n      const object = byTag.get(tag);\n      if (object) {\n        return object.try(value, options) as v.ValitaResult<Known>;\n      }\n      return tagTypes.has(typeof tag)\n        ? v.ok(value as UnrecognizedObject<K>)\n        : v.err({message: expectedTag, path: [key]});\n    });\n  return Object.assign(type, {\n    // A transform serializes as just its name. Show the objects too, so a\n    // change to them still changes the hash in protocol-version.test.ts.\n    taggedObjectUnion: {key, objects},\n    isKnown: (value: Known | UnrecognizedObject<K>): value is Known =>\n      byTag.has(tagOf(value)),\n  });\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;AAIA,SAAS,UAAU,OAAwB;CACzC,QAAQ,OAAO,OAAf;EACE,KAAK;EACL,KAAK;EACL,KAAK,WACH,OAAO,KAAK,UAAU,KAAK;EAC7B,KAAK,aACH,OAAO;EACT,KAAK,UACH,OAAO,MAAM,SAAS,IAAI;EAC5B;GACE,IAAI,UAAU,MACZ,OAAO;GAET,IAAI,MAAM,QAAQ,KAAK,GACrB,OAAO;GAET,OAAO,OAAO;CAClB;AACF;AAIA,SAAS,gBAAgB,GAAY,MAAiC;CACpE,IAAI,CAAC,MAAM,QACT,OAAO,UAAU,CAAC;CAGpB,IAAI,MAAM;CACV,KAAK,MAAM,KAAK,MAEd,MAAO,IAAY;CAErB,OAAO,UAAU,GAAG;AACtB;AAEA,SAAS,YACP,MACA,UACA,aAAuC,MAAK,OAAO,CAAC,GACnC;CACjB,IAAI,SAAS,WAAW,GACtB,OAAO,UAAU,SAAS,EAAE;CAG9B,MAAM,SAAS,GAAG,UAChB,SAAS,SAAS,SAAS,EAE7B,EAAE,GAAG,KAAK,GAAG,UAAU,SAAS,GAAG,EAAE,CAAE;CACvC,IAAI,SAAS,WAAW,GACtB,OAAO;CAET,OAAO,GAAG,SAAS,MAAM,GAAG,EAAE,EAAE,IAAI,SAAS,EAAE,KAAK,IAAI,EAAE,IAAI;AAChE;AAEA,SAAS,WACP,KACA,GACA,QACA,MACQ;CACR,MAAM,aAAa,IAAI,OAAO;CAC9B,MAAM,EAAC,SAAQ;CACf,MAAM,SAAS,MAAM,SAAS,OAAO,KAAK,KAAK,GAAG,MAAM;CAExD,QAAQ,WAAW,MAAnB;EACE,KAAK,gBACH,OAAO,YAAY,YACjB,MACA,WAAW,QACb,IAAI,OAAO,QAAQ,gBAAgB,GAAG,IAAI;EAC5C,KAAK,iBAAiB;GACpB,MAAM,SACJ,QAAQ,KAAK,SAAS,IAAI,OAAO,KAAK,MAAM,GAAG,EAAE,EAAE,KAAK,GAAG,MAAM;GAEnE,IAAI,WAAW,MAAM,QACnB,OAAO,oBAAoB,WAAW,KAAK,GAAG,EAAE,IAAI;GAEtD,OAAO,gCAAgC;EACzC;EAEA,KAAK,mBACH,OAAO,0BAA0B,YAC/B,MACA,WAAW,UACX,SACF,IAAI,OAAO,OAAO,gBAAgB,GAAG,IAAI;EAE3C,KAAK,kBACH,OAAO,8BACL,WAAW,cAAc,WAAW,YAChC,WAAW,YACX,WAAW,WAAW,UAAU,OAAO,WAAW,cACrD,OAAO,0BAA2B,EAAuB;EAG9D,KAAK;GACH,IAAI,WAAW,KAAK,WAAW,GAC7B,OAAO,uBAAuB,WAAW,KAAK,KAAK;GAErD,OAAO,yBAAyB,YAC9B,OACA,WAAW,IACb,IAAI;EAEN,KAAK,iBACH,OAAO,OAAO,SAAS,UACnB,0BAA0B,GAAG,QAAuB,QAAQ,QAAQ,IACpE,sBAAsB;EAE5B,KAAK,gBACH,OAAO,GAAG,WAAW,UAAU,OAAO,QAAQ,gBAAgB,GAAG,IAAI;CACzE;AACF;AAIA,SAAS,0BACP,OACA,QACA,MACQ;CACR,MAAM,WAAyB,CAAC;CAChC,KAAK,MAAM,QAAQ,OAAO,SAAS;EACjC,MAAM,IAAI,KAAK,IAAI,OAAO,EAAC,KAAI,CAAC;EAChC,IAAI,CAAC,EAAE,IACL,SAAS,KAAK;GAAC;GAAM,KAAK;EAAC,CAAC;CAEhC;CACA,IAAI,SAAS,QAAQ;EAEnB,SAAS,KAAK,OAAO;EACrB,IAAI,SAAS,WAAW,KAAK,QAAQ,SAAS,IAAI,SAAS,EAAE,IAAI,GAC/D,OAAO,WAAW,SAAS,GAAG,KAAK,OAAO,SAAS,GAAG,MAAM,IAAI;CAEpE;CAEA,IAAI;EAEF,OAAO,wBADK,KAAK,UAAU,KACI;CACjC,QAAQ;EAEN,OAAO;CACT;AACF;AAKA,SAAS,QAAQ,GAAe,GAAe;CAC7C,MAAM,QAAQ,EAAE,IAAI,OAAO,GAAG;CAC9B,MAAM,QAAQ,EAAE,IAAI,OAAO,GAAG;CAC9B,IAAI,MAAM,WAAW,MAAM,QACzB,OAAO,MAAM,SAAS,MAAM;CAE9B,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;EACrC,IAAI,MAAM,KAAK,MAAM,IACnB,OAAO;EAET,IAAI,MAAM,KAAK,MAAM,IACnB,OAAO;CAEX;CACA,OAAO;AACT;AASA,SAAgB,MACd,OACA,QACA,MACG;CACH,MAAM,MAAM,KAAK,OAAO,QAAQ,IAAI;CACpC,IAAI,CAAC,IAAI,IACP,MAAM,IAAI,UAAU,IAAI,KAAK;CAE/B,OAAO,IAAI;AACb;AAEA,SAAgB,GACd,OACA,QACA,MACY;CACZ,OAAO,KAAK,OAAO,QAAQ,IAAI,EAAE;AACnC;AAEA,SAAgB,OACd,OACA,QACA,MACoB;CACpB,MAAM,OAAO,QAAQ,IAAI;AAC3B;AAIA,SAAgB,KACd,OACA,QACA,MACW;CAEX,OAAO,aAAa,OAAO,QAAQ,IAAI;AACzC;;;;;;AAOA,SAAgB,aACd,OACA,QACA,MACuB;CACvB,MAAM,MAAM,OAAO,IAAI,OAAO,OAAO,EAAC,KAAI,IAAI,KAAA,CAAS;CACvD,IAAI,CAAC,IAAI,IACP,OAAO;EAAC,IAAI;EAAO,OAAO,WAAW,KAAK,OAAO,QAAQ,IAAI;CAAC;CAEhE,OAAO;AACT;AAEA,IAAM,SAAS,EAAC,MAAM,SAAQ;;;;;;;;;AAU9B,SAAgB,OAAU,QAA8B;CACtD,MAAM,OAAO,EAAE,QAAQ,EAAE,OAAM,UAAS,OAAO,IAAI,OAAO,MAAM,CAAC;CAGjE,OAAO,OAAO,OAAO,MAAM,EAAC,QAAQ,OAAM,CAAC;AAC7C;;;;AAKA,SAAgB,SAA2B,GAAoC;CAC7E,OAAO;AACT;AAEA,SAAgB,eACd,GACsC;CACtC,OAAO,EAAE,OAAO,CAAC;AACnB;AAEA,SAAgB,cACd,GAC+B;CAC/B,OAAO,EAAE,MAAM,CAAC;AAClB;AAEA,SAAgB,eACd,GAC8C;CAC9C,OAAO,EAAE,OAAO,CAAC;AACnB;AAEA,IAAM,eAAe,OAAO,eAC1B,OAAO,eAAe,EAAE,OAAO,EAAE,SAAS,CAAC,CAC7C,EAAE;AAEF,SAAgB,uBACd,KACkC;CAClC,OAAO,eAAe;AACxB;;;;;;;;;;;;AAgBA,SAAgB,YACd,MACA,MACM;CACN,KAAK,aAAa,IAAI;AACxB;;;;;AAQA,SAAgB,YACd,GACA;CACA,MAAM,QAAQ,CAAC;CACf,KAAK,MAAM,CAAC,KAAK,SAAS,OAAO,QAAQ,EAAE,KAAK,GAC9C,IAAI,KAAK,SAAS,UAChB,MAAM,OAAO,YACX,IACF,EAAE,SAAS;MAEX,MAAM,OAAO,KAAK,SAAS;CAG/B,OAAO,EAAE,OAAO,KAA4D;AAC9E;AAIA,SAAgB,aACd,GAAG,UACgB;CACnB,OAAO,EAAE,MAAM,GAAG,SAAS,IAAI,EAAE,OAAO,CAAC;AAC3C;;;;;;;;;;AAkBA,SAAgB,iBACd,GAAG,WAC+B;CAClC,OAAO,EAAE,OAAO;AAClB;;;;;AAMA,SAAgB,mBAAmB,QAA4B,CAAC;;;;;;;;;;;;;AAuBhE,SAAgB,iBACd,QACA,SAKA;CACA,IAAI,CAAC,QAAQ,MACX,MAAM,IAAI,MAAM,8CAA8C;CAGhE,MAAM,wBAAQ,IAAI,IAAqB;CACvC,MAAM,2BAAW,IAAI,IAAY;CACjC,KAAK,MAAM,SAAS,QAClB,YAAY,MAAM,OAAO,KAAI,MAAK;EAChC,IAAI,EAAE,SAAS,WACb,MAAM,IAAI,MAAM,oCAAoC;EAEtD,IAAI,MAAM,IAAI,EAAE,KAAK,GACnB,MAAM,IAAI,MAAM,iBAAiB,UAAU,EAAE,KAAK,GAAG;EAEvD,MAAM,IAAI,EAAE,OAAO,KAAK;EACxB,SAAS,IAAI,OAAO,EAAE,KAAK;CAC7B,CAAC;CAEH,MAAM,cAAc,YAAY,YAAY,MAAM,CAAC,GAAG,QAAQ,CAAC;CAC/D,MAAM,OAAO,EACV,QAAQ,EACR,OAAO,OAAO,YAAuD;EACpE,IAAI,CAAC,MAAM,QAAQ,KAAK,GACtB,OAAO,EAAE,IAAI,gBAAgB;EAE/B,MAAM,CAAC,OAAO;EACd,MAAM,QAAQ,MAAM,IAAI,GAAG;EAC3B,IAAI,OACF,OAAO,MAAM,IAAI,OAAO,OAAO;EAEjC,OAAO,SAAS,IAAI,OAAO,GAAG,IAC1B,EAAE,GAAG,KAA0B,IAC/B,EAAE,IAAI;GAAC,SAAS;GAAa,MAAM,CAAC,CAAC;EAAC,CAAC;CAC7C,CAAC;CACH,OAAO,OAAO,OAAO,MAAM;EAGzB,kBAAkB;EAClB,UAAU,UACR,MAAM,IAAI,MAAM,EAAE;CACtB,CAAC;AACH;;;;;;;;;;;;AAkBA,SAAgB,kBACd,KACA,SACA,SAKA;CACA,IAAI,CAAC,QAAQ,MACX,MAAM,IAAI,MAAM,+CAA+C;CAGjE,MAAM,wBAAQ,IAAI,IAAqB;CACvC,MAAM,2BAAW,IAAI,IAAY;CACjC,KAAK,MAAM,UAAU,SAAS;EAC5B,MAAM,MAAM,OAAO,MAAM;EACzB,IAAI,QAAQ,KAAA,GACV,MAAM,IAAI,MAAM,iCAAiC,KAAK;EAExD,YAAY,MAAK,MAAK;GACpB,IAAI,EAAE,SAAS,WACb,MAAM,IAAI,MAAM,oCAAoC;GAEtD,IAAI,MAAM,IAAI,EAAE,KAAK,GACnB,MAAM,IAAI,MAAM,iBAAiB,UAAU,EAAE,KAAK,GAAG;GAEvD,MAAM,IAAI,EAAE,OAAO,MAAM;GACzB,SAAS,IAAI,OAAO,EAAE,KAAK;EAC7B,CAAC;CACH;CACA,MAAM,cAAc,YAAY,YAAY,MAAM,CAAC,GAAG,QAAQ,CAAC;CAC/D,MAAM,SAAS,UACb,OAAO,OAAO,OAAO,GAAG,IAAK,MAA6B,OAAO,KAAA;CACnE,MAAM,OAAO,EACV,QAAQ,EACR,OAAO,OAAO,YAA2D;EACxE,IAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,MAAM,QAAQ,KAAK,GACpE,OAAO,EAAE,IAAI,iBAAiB;EAEhC,MAAM,MAAM,MAAM,KAAK;EACvB,MAAM,SAAS,MAAM,IAAI,GAAG;EAC5B,IAAI,QACF,OAAO,OAAO,IAAI,OAAO,OAAO;EAElC,OAAO,SAAS,IAAI,OAAO,GAAG,IAC1B,EAAE,GAAG,KAA8B,IACnC,EAAE,IAAI;GAAC,SAAS;GAAa,MAAM,CAAC,GAAG;EAAC,CAAC;CAC/C,CAAC;CACH,OAAO,OAAO,OAAO,MAAM;EAGzB,mBAAmB;GAAC;GAAK;EAAO;EAChC,UAAU,UACR,MAAM,IAAI,MAAM,KAAK,CAAC;CAC1B,CAAC;AACH"}

package/out/z2s/src/compiler.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"compiler.d.ts","sourceRoot":"","sources":["../../../../z2s/src/compiler.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,QAAQ,EAAC,MAAM,gBAAgB,CAAC;AAQ7C,OAAO,EAAC,KAAK,SAAS,EAAC,MAAM,0BAA0B,CAAC;AAExD,OAAO,KAAK,EACV,GAAG,EACH,KAAK,EAEL,kBAAkB,EAElB,WAAW,EAEX,QAAQ,EACR,eAAe,EAEhB,MAAM,gCAAgC,CAAC;AACxC,OAAO,EAEL,KAAK,UAAU,EAChB,MAAM,sCAAsC,CAAC;AAC9C,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,gCAAgC,CAAC;AAC3D,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,uCAAuC,CAAC;AACxE,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,2BAA2B,CAAC;AAUtD,KAAK,KAAK,GAAG;IACX,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;CACf,CAAC;AAEF,KAAK,eAAe,GAAG;IACrB,KAAK,EAAE,KAAK,CAAC;IACb,GAAG,EAAE,MAAM,CAAC;CACb,CAAC;AAEF,KAAK,UAAU,GAAG;IAChB,MAAM,EAAE,YAAY,CAAC;IAErB,MAAM,EAAE,UAAU,CAAC;CACpB,CAAC;AAEF,MAAM,MAAM,IAAI,GAAG;IACjB,MAAM,EAAE,UAAU,CAAC;IACnB,GAAG,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;IACtB,UAAU,EAAE,MAAM,CAAC;CACpB,CAAC;AAQF,wBAAgB,OAAO,CACrB,YAAY,EAAE,YAAY,EAC1B,SAAS,EAAE,MAAM,EACjB,GAAG,EAAE,GAAG,EACR,MAAM,CAAC,EAAE,MAAM,GACd,QAAQ,CAgBV;AAiDD,wBAAgB,KAAK,CACnB,KAAK,EAAE,MAAM,GAAG,SAAS,EACzB,QAAQ,EAAE,OAAO,GAAG,SAAS,GAC5B,QAAQ,CAWV;AAUD,wBAAgB,OAAO,CACrB,IAAI,EAAE,IAAI,EACV,OAAO,EAAE,QAAQ,GAAG,SAAS,EAC7B,KAAK,EAAE,KAAK,GACX,QAAQ,CAoBV;AAED,wBAAgB,KAAK,CACnB,IAAI,EAAE,IAAI,EACV,KAAK,EAAE,KAAK,GAAG,SAAS,EACxB,OAAO,EAAE,QAAQ,GAAG,SAAS,EAC7B,KAAK,EAAE,KAAK,GACX,QAAQ,CA4CV;AA2KD,wBAAgB,cAAc,CAC5B,IAAI,EAAE,IAAI,EACV,YAAY,EAAE,SAAS,eAAe,EAAE,EACxC,cAAc,EAAE,SAAS,MAAM,EAAE,GAChC,CAAC,UAAU,EAAE,KAAK,KAAK,QAAQ,CAiBjC;AAED,wBAAgB,MAAM,CACpB,IAAI,EAAE,IAAI,EACV,SAAS,EAAE,eAAe,EAC1B,KAAK,EAAE,KAAK,GACX,QAAQ,CAgCV;AAED,wBAAgB,GAAG,CACjB,IAAI,EAAE,IAAI,EACV,SAAS,EAAE,eAAe,EAC1B,KAAK,EAAE,KAAK,GACX,QAAQ,CAMV;AAED,wBAAgB,YAAY,CAC1B,IAAI,EAAE,IAAI,EACV,SAAS,EAAE,eAAe,EAC1B,KAAK,EAAE,KAAK,GACX,QAAQ,CAIV;AA4ID,wBAAgB,gBAAgB,CAC9B,IAAI,EAAE,IAAI,EACV,YAAY,EAAE,kBAAkB,GAC/B;IACD,IAAI,EAAE,QAAQ,CAAC;IACf,mBAAmB,EAAE,UAAU,CAAC,OAAO,qBAAqB,CAAC,CAAC;CAC/D,CA2BA;AAED,wBAAgB,qBAAqB,CACnC,IAAI,EAAE,IAAI,EACV,YAAY,EAAE,kBAAkB,GAC/B;IACD;QACE,KAAK,EAAE,KAAK,CAAC;QACb,WAAW,EAAE,WAAW,CAAC;QACzB,KAAK,EAAE,MAAM,GAAG,SAAS,CAAC;KAC3B;IACD;QAAC,KAAK,EAAE,KAAK,CAAC;QAAC,WAAW,EAAE,WAAW,CAAC;QAAC,KAAK,EAAE,MAAM,GAAG,SAAS,CAAA;KAAC;CACpE,CAsBA;AAyED,wBAAgB,gBAAgB,CAAC,QAAQ,EAAE,KAAK,CAAC,GAAG,CAAC,GAAG,SAAS,CAMhE"}
+{"version":3,"file":"compiler.d.ts","sourceRoot":"","sources":["../../../../z2s/src/compiler.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,QAAQ,EAAC,MAAM,gBAAgB,CAAC;AAQ7C,OAAO,EAAC,KAAK,SAAS,EAAC,MAAM,0BAA0B,CAAC;AAExD,OAAO,KAAK,EACV,GAAG,EACH,KAAK,EAEL,kBAAkB,EAElB,WAAW,EAEX,QAAQ,EACR,eAAe,EAEhB,MAAM,gCAAgC,CAAC;AACxC,OAAO,EAEL,KAAK,UAAU,EAChB,MAAM,sCAAsC,CAAC;AAC9C,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,gCAAgC,CAAC;AAC3D,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,uCAAuC,CAAC;AACxE,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,2BAA2B,CAAC;AAUtD,KAAK,KAAK,GAAG;IACX,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;CACf,CAAC;AAEF,KAAK,eAAe,GAAG;IACrB,KAAK,EAAE,KAAK,CAAC;IACb,GAAG,EAAE,MAAM,CAAC;CACb,CAAC;AAEF,KAAK,UAAU,GAAG;IAChB,MAAM,EAAE,YAAY,CAAC;IAErB,MAAM,EAAE,UAAU,CAAC;CACpB,CAAC;AAEF,MAAM,MAAM,IAAI,GAAG;IACjB,MAAM,EAAE,UAAU,CAAC;IACnB,GAAG,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;IACtB,UAAU,EAAE,MAAM,CAAC;CACpB,CAAC;AAQF,wBAAgB,OAAO,CACrB,YAAY,EAAE,YAAY,EAC1B,SAAS,EAAE,MAAM,EACjB,GAAG,EAAE,GAAG,EACR,MAAM,CAAC,EAAE,MAAM,GACd,QAAQ,CAgBV;AAiDD,wBAAgB,KAAK,CACnB,KAAK,EAAE,MAAM,GAAG,SAAS,EACzB,QAAQ,EAAE,OAAO,GAAG,SAAS,GAC5B,QAAQ,CAWV;AAUD,wBAAgB,OAAO,CACrB,IAAI,EAAE,IAAI,EACV,OAAO,EAAE,QAAQ,GAAG,SAAS,EAC7B,KAAK,EAAE,KAAK,GACX,QAAQ,CAoBV;AAED,wBAAgB,KAAK,CACnB,IAAI,EAAE,IAAI,EACV,KAAK,EAAE,KAAK,GAAG,SAAS,EACxB,OAAO,EAAE,QAAQ,GAAG,SAAS,EAC7B,KAAK,EAAE,KAAK,GACX,QAAQ,CA4CV;AA2KD,wBAAgB,cAAc,CAC5B,IAAI,EAAE,IAAI,EACV,YAAY,EAAE,SAAS,eAAe,EAAE,EACxC,cAAc,EAAE,SAAS,MAAM,EAAE,GAChC,CAAC,UAAU,EAAE,KAAK,KAAK,QAAQ,CAiBjC;AAED,wBAAgB,MAAM,CACpB,IAAI,EAAE,IAAI,EACV,SAAS,EAAE,eAAe,EAC1B,KAAK,EAAE,KAAK,GACX,QAAQ,CAkDV;AAED,wBAAgB,GAAG,CACjB,IAAI,EAAE,IAAI,EACV,SAAS,EAAE,eAAe,EAC1B,KAAK,EAAE,KAAK,GACX,QAAQ,CAMV;AAED,wBAAgB,YAAY,CAC1B,IAAI,EAAE,IAAI,EACV,SAAS,EAAE,eAAe,EAC1B,KAAK,EAAE,KAAK,GACX,QAAQ,CAIV;AA4ID,wBAAgB,gBAAgB,CAC9B,IAAI,EAAE,IAAI,EACV,YAAY,EAAE,kBAAkB,GAC/B;IACD,IAAI,EAAE,QAAQ,CAAC;IACf,mBAAmB,EAAE,UAAU,CAAC,OAAO,qBAAqB,CAAC,CAAC;CAC/D,CA2BA;AAED,wBAAgB,qBAAqB,CACnC,IAAI,EAAE,IAAI,EACV,YAAY,EAAE,kBAAkB,GAC/B;IACD;QACE,KAAK,EAAE,KAAK,CAAC;QACb,WAAW,EAAE,WAAW,CAAC;QACzB,KAAK,EAAE,MAAM,GAAG,SAAS,CAAC;KAC3B;IACD;QAAC,KAAK,EAAE,KAAK,CAAC;QAAC,WAAW,EAAE,WAAW,CAAC;QAAC,KAAK,EAAE,MAAM,GAAG,SAAS,CAAA;KAAC;CACpE,CAsBA;AAyED,wBAAgB,gBAAgB,CAAC,QAAQ,EAAE,KAAK,CAAC,GAAG,CAAC,GAAG,SAAS,CAMhE"}

package/out/z2s/src/compiler.js

@@ -1,10 +1,10 @@
 import { assert, unreachable } from "../../shared/src/asserts.js";
 import { hasOwn } from "../../shared/src/has-own.js";
 import "../../shared/src/json.js";
+import { last, zip } from "../../shared/src/arrays.js";
 import { must } from "../../shared/src/must.js";
 import { clientToServer } from "../../zero-schema/src/name-mapper.js";
 import { completeOrdering } from "../../zql/src/query/complete-ordering.js";
-import { last, zip } from "../../shared/src/arrays.js";
 import { parse } from "../../shared/src/bigint-json.js";
 import { sql, sqlConvertColumnArg, sqlConvertPluralLiteralArg, sqlConvertSingularLiteralArg } from "./sql.js";
 //#region ../z2s/src/compiler.ts
@@ -152,16 +152,20 @@ function makeCorrelator(spec, parentFields, childZqlFields) {
 }
 function simple(spec, condition, table) {
 	switch (condition.op) {
+		case "ILIKE":
+		case "LIKE":
+		case "NOT ILIKE":
+		case "NOT LIKE": {
+			const { right } = condition;
+			assert(right.type === "literal", "Static parameters must be bound to a value before compiling to SQL");
+			return sql`${valueComparison(spec, condition.left, table, right, false)} ${sql.__dangerous__rawValue(condition.op)} ${sqlConvertSingularLiteralArg(right.value === null ? null : String(right.value))}`;
+		}
 		case "!=":
 		case "<":
 		case "<=":
 		case "=":
 		case ">":
-		case ">=":
-		case "ILIKE":
-		case "LIKE":
-		case "NOT ILIKE":
-		case "NOT LIKE": return sql`${valueComparison(spec, condition.left, table, condition.right, false)} ${sql.__dangerous__rawValue(condition.op)} ${valueComparison(spec, condition.right, table, condition.left, false)}`;
+		case ">=": return sql`${valueComparison(spec, condition.left, table, condition.right, false)} ${sql.__dangerous__rawValue(condition.op)} ${valueComparison(spec, condition.right, table, condition.left, false)}`;
 		case "NOT IN":
 		case "IN": return any(spec, condition, table);
 		case "IS":