joist-core 2.3.0 → 2.4.0-next.2

package/build/queries/valueFilters.cjs

@@ -0,0 +1,240 @@
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const require_queries_find_Aliases = require("./find/Aliases.cjs");
+const require_queries_find_scopes = require("./find/scopes.cjs");
+const require_utils = require("../utils.cjs");
+const require_EntityManager = require("../EntityManager.cjs");
+const require_Entity = require("../Entity.cjs");
+let joist_utils = require("joist-utils");
+//#region src/queries/valueFilters.ts
+/** Parses an entity filter, which could be "just an id", an array of ids, or a nested filter. */
+function parseEntityFilter(_meta, filter) {
+	if (filter === void 0) return;
+	else if (require_queries_find_Aliases.isAlias(filter)) return;
+	else if (require_queries_find_scopes.isScope(filter)) return {
+		kind: "join",
+		subFilter: {}
+	};
+	else if (filter === null) return { kind: "is-null" };
+	else if (typeof filter === "string" || typeof filter === "number") return {
+		kind: "eq",
+		value: filter
+	};
+	else if (typeof filter === "boolean") return filter ? { kind: "not-null" } : { kind: "is-null" };
+	else if (Array.isArray(filter)) return {
+		kind: "in",
+		value: filter.flatMap((value) => {
+			if (!require_Entity.isEntity(value)) return [value];
+			return isNotInDb(value) ? [] : [value.idTagged];
+		})
+	};
+	else if (require_Entity.isEntity(filter)) return isNotInDb(filter) ? {
+		kind: "in",
+		value: []
+	} : {
+		kind: "eq",
+		value: filter.idTagged
+	};
+	else if (typeof filter === "object") {
+		const keys = Object.keys(filter);
+		if (keys.length === 1 && keys[0] === "ne") {
+			const value = filter["ne"];
+			if (value === void 0) return;
+			else if (value === null) return { kind: "not-null" };
+			else if (typeof value === "string" || typeof value === "number") return {
+				kind: "ne",
+				value
+			};
+			else if (require_Entity.isEntity(value)) return isNotInDb(value) ? { kind: "not-null" } : {
+				kind: "ne",
+				value: value.idTagged
+			};
+			else throw new Error(`Unsupported "ne" value ${value}`);
+		}
+		if (keys.length === 1 && keys[0] === "id") {
+			const value = filter["id"];
+			if (value === void 0) return;
+			else if (value === null) return { kind: "is-null" };
+			else if (typeof value === "string" || typeof value === "number") return {
+				kind: "eq",
+				value
+			};
+			else if (require_Entity.isEntity(value)) return isNotInDb(value) ? {
+				kind: "in",
+				value: []
+			} : {
+				kind: "eq",
+				value: value.idTagged
+			};
+			else return parseValueFilter(value)[0];
+		}
+		const subFilter = {};
+		for (const [key, value] of Object.entries(filter)) if (value && typeof value === "object" && !require_Entity.isEntity(value) && !(0, joist_utils.isPlainObject)(value) && "idTaggedMaybe" in value) subFilter[key] = value.idTaggedMaybe === void 0 ? [] : value.idTaggedMaybe;
+		else subFilter[key] = value;
+		return {
+			kind: "join",
+			subFilter
+		};
+	} else throw new Error(`Unrecognized filter ${filter}`);
+}
+/**
+* Parses the many/hodgepodge (ergonomic!) patterns of value filters into a `ParsedValueFilter[]`.
+*
+* Note we return an array because filter might be a `ValueGraphQLFilter` that is allowed to have
+* multiple conditions, i.e. `{ lt: 10, gt: 5 }`.
+*/
+function parseValueFilter(filter) {
+	if (filter === null) return [{ kind: "is-null" }];
+	else if (filter === void 0) return [];
+	else if (Array.isArray(filter)) return [{
+		kind: "in",
+		value: filter
+	}];
+	else if ((0, joist_utils.isPlainObject)(filter)) {
+		const keys = Object.keys(filter);
+		if (keys.length === 0) return [];
+		else if (keys.length === 2 && "op" in filter && "value" in filter) {
+			const { op, value } = filter;
+			if (shouldPruneValueFilter(op, value)) return [];
+			else if (value === null) return [{ kind: "is-null" }];
+			else return [{
+				kind: op,
+				value: value ?? null
+			}];
+		} else if (keys.length === 2 && "gte" in filter && "lte" in filter) {
+			const { gte, lte } = filter;
+			return [{
+				kind: "between",
+				value: [gte, lte]
+			}];
+		} else return Object.entries(filter).map(([key, value]) => {
+			if (shouldPruneValueFilter(key, value)) return;
+			switch (key) {
+				case "eq": if (value === null) return { kind: "is-null" };
+				else return {
+					kind: "eq",
+					value: filter[key]
+				};
+				case "ne": if (value === null) return { kind: "not-null" };
+				else return {
+					kind: "ne",
+					value: filter[key] ?? null
+				};
+				case "in":
+				case "nin":
+				case "gt":
+				case "gte":
+				case "lt":
+				case "lte":
+				case "like":
+				case "nlike":
+				case "ilike":
+				case "nilike":
+				case "regex":
+				case "nregex":
+				case "iregex":
+				case "niregex":
+				case "contains":
+				case "overlaps":
+				case "containedBy": return {
+					kind: key,
+					value: filter[key]
+				};
+				case "pathExists": return {
+					kind: "jsonPathExists",
+					value: filter[key]
+				};
+				case "pathIsTrue": return {
+					kind: "jsonPathPredicate",
+					value: filter[key]
+				};
+				case "search": return {
+					kind: "ilike",
+					value: makeLike(filter[key])
+				};
+				case "between": return {
+					kind: key,
+					value: filter[key]
+				};
+				default: throw new Error(`Unsupported value filter key ${key}`);
+			}
+		}).filter(require_EntityManager.isDefined);
+	} else return [{
+		kind: "eq",
+		value: filter
+	}];
+}
+/** Converts domain-level values like string ids/enums into their db equivalent. */
+function mapToDb(column, filter) {
+	switch (filter.kind) {
+		case "eq":
+		case "gt":
+		case "gte":
+		case "ne":
+		case "lt":
+		case "lte":
+		case "like":
+		case "nlike":
+		case "ilike":
+		case "nilike":
+		case "regex":
+		case "nregex":
+		case "iregex":
+		case "niregex":
+			filter.value = column.mapToDb(filter.value);
+			return filter;
+		case "in":
+			if (column.isArray) return {
+				kind: "contains",
+				value: column.mapToDb(filter.value)
+			};
+			else filter.value = filter.value.map((v) => column.mapToDb(v));
+			return filter;
+		case "nin":
+			if (column.isArray) throw new Error("The nin operator is not supported on array columns yet");
+			else filter.value = filter.value.map((v) => column.mapToDb(v));
+			return filter;
+		case "contains":
+		case "ncontains":
+		case "overlaps":
+		case "noverlaps":
+		case "containedBy":
+			if (!(column.isArray || column.dbType === "jsonb")) throw new Error(`${filter.kind} is only unsupported on array or jsonb columns`);
+			if (column.isArray) filter.value = column.mapToDb(filter.value);
+			return filter;
+		case "between":
+			filter.value = [column.mapToDb(filter.value[0]), column.mapToDb(filter.value[1])];
+			return filter;
+		case "is-null":
+		case "not-null":
+		case "jsonPathExists":
+		case "jsonPathPredicate": return filter;
+		default: throw require_utils.assertNever(filter);
+	}
+}
+/** Converts a search term like `foo bar` into a SQL `like` pattern like `%foo%bar%`. */
+function makeLike(search) {
+	return search ? `%${search.replace(/\s+/g, "%")}%` : void 0;
+}
+/** Returns true for values that should be treated like an omitted filter. */
+function shouldPruneValueFilter(key, value) {
+	if (value === void 0) return true;
+	return value === false && key !== "eq" && key !== "ne";
+}
+/**
+* Returns whether an entity is known not to be queryable from the database.
+*
+* We check `idTaggedMaybe` instead of `isNewEntity` because commit rules run after INSERTs while those
+* entities still report as new until the flush completes (and yet, because they are in the database, we
+* must keep them in the query instead of ignoring them). An ID can also be assigned before INSERT, so an
+* ID-bearing entity conservatively falls through to a harmless database query.
+*/
+function isNotInDb(value) {
+	return value.idTaggedMaybe === void 0;
+}
+//#endregion
+exports.makeLike = makeLike;
+exports.mapToDb = mapToDb;
+exports.parseEntityFilter = parseEntityFilter;
+exports.parseValueFilter = parseValueFilter;
+
+//# sourceMappingURL=valueFilters.cjs.map

package/build/queries/valueFilters.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"valueFilters.cjs","names":["isAlias","isScope","isEntity","isPlainObject","isDefined","assertNever"],"sources":["../../src/queries/valueFilters.ts"],"sourcesContent":["import { isPlainObject } from \"joist-utils\";\nimport { type Entity, isEntity } from \"src/Entity.ts\";\nimport { isDefined } from \"src/EntityManager.ts\";\nimport type { EntityMetadata } from \"src/EntityMetadata.ts\";\nimport { isAlias } from \"src/queries/find/Aliases.ts\";\nimport type { ValueFilter } from \"src/queries/find/EntityFilter.ts\";\nimport { isScope } from \"src/queries/find/scopes.ts\";\nimport type { ParsedValueFilter } from \"src/queries/parsedConditions.ts\";\nimport type { Column } from \"src/serde/columns.ts\";\nimport { assertNever } from \"src/utils.ts\";\n\n/** An ADT version of `EntityFilter`. */\nexport type ParsedEntityFilter =\n  // ParsedValueFilter is any simple match on `id`\n  | ParsedValueFilter<string | number>\n  // Otherwise we return the join/complex\n  | { kind: \"join\"; subFilter: object };\n\n/** Parses an entity filter, which could be \"just an id\", an array of ids, or a nested filter. */\nexport function parseEntityFilter(_meta: EntityMetadata, filter: any): ParsedEntityFilter | undefined {\n  if (filter === undefined) {\n    // This matches legacy `em.find(Book, { author: undefined })` behavior\n    return undefined;\n  } else if (isAlias(filter)) {\n    // We're just binding an alias to this position in the join tree\n    return undefined;\n  } else if (isScope(filter)) {\n    // A scope on a relation (e.g. `{ author: Author.adult }`) always implies conditions on the\n    // related entity, so signal \"needs a join\" via the existing `join` discriminant rather than\n    // adding a dedicated `kind: \"scope\"` that every relation branch would have to learn. The empty\n    // `subFilter` is intentionally never read: the m2o/m2m branches only check `kind === \"join\"` to\n    // decide whether to join, then re-dispatch the original scope value back through `addTable`,\n    // where `isScope(...)` routes it to `addScopeFilterAt` to apply the scope's actual fragments.\n    return { kind: \"join\", subFilter: {} };\n  } else if (filter === null) {\n    return { kind: \"is-null\" };\n  } else if (typeof filter === \"string\" || typeof filter === \"number\") {\n    return { kind: \"eq\", value: filter };\n  } else if (typeof filter === \"boolean\") {\n    return filter ? { kind: \"not-null\" } : { kind: \"is-null\" };\n  } else if (Array.isArray(filter)) {\n    return {\n      kind: \"in\",\n      value: filter.flatMap((value: string | number | Entity) => {\n        if (!isEntity(value)) return [value];\n        // If no IDs remain, `in: []` marks the condition as unable to match a database row.\n        return isNotInDb(value) ? [] : [value.idTagged];\n      }),\n    };\n  } else if (isEntity(filter)) {\n    // We use `in: []` to mark an ID-less entity as unable to match a database row.\n    return isNotInDb(filter) ? { kind: \"in\", value: [] } : { kind: \"eq\", value: filter.idTagged };\n  } else if (typeof filter === \"object\") {\n    // Looking for `{ firstName: \"f1\" }` or `{ ne: \"f1\" }`\n    const keys = Object.keys(filter);\n    // Special case only looking at `ne`\n    if (keys.length === 1 && keys[0] === \"ne\") {\n      const value = filter[\"ne\"];\n      if (value === undefined) {\n        return undefined;\n      } else if (value === null) {\n        return { kind: \"not-null\" };\n      } else if (typeof value === \"string\" || typeof value === \"number\") {\n        return { kind: \"ne\", value };\n      } else if (isEntity(value)) {\n        // No persisted FK can equal an ID-less entity, and SQL `!=` excludes nulls, so this is `IS NOT NULL`.\n        return isNotInDb(value) ? { kind: \"not-null\" } : { kind: \"ne\", value: value.idTagged };\n      } else {\n        throw new Error(`Unsupported \"ne\" value ${value}`);\n      }\n    }\n    // Special case only looking at `id`\n    if (keys.length === 1 && keys[0] === \"id\") {\n      const value = filter[\"id\"];\n      if (value === undefined) {\n        return undefined;\n      } else if (value === null) {\n        return { kind: \"is-null\" };\n      } else if (typeof value === \"string\" || typeof value === \"number\") {\n        return { kind: \"eq\", value };\n      } else if (isEntity(value)) {\n        return isNotInDb(value) ? { kind: \"in\", value: [] } : { kind: \"eq\", value: value.idTagged };\n      } else {\n        return parseValueFilter(value)[0] as any;\n      }\n    }\n    // Look for subFilter values being EntityFilter-ish instances like ManyToOneReference\n    // that have an id, and so structurally match the entity filter without really being filters,\n    // and convert them over here before getting into parseValueFilter.\n    const subFilter = {} as any;\n    for (const [key, value] of Object.entries(filter)) {\n      if (value && typeof value === \"object\" && !isEntity(value) && !isPlainObject(value) && \"idTaggedMaybe\" in value) {\n        subFilter[key] = value.idTaggedMaybe === undefined ? [] : value.idTaggedMaybe;\n      } else {\n        subFilter[key] = value;\n      }\n    }\n    return { kind: \"join\", subFilter };\n  } else {\n    throw new Error(`Unrecognized filter ${filter}`);\n  }\n}\n\n/**\n * Parses the many/hodgepodge (ergonomic!) patterns of value filters into a `ParsedValueFilter[]`.\n *\n * Note we return an array because filter might be a `ValueGraphQLFilter` that is allowed to have\n * multiple conditions, i.e. `{ lt: 10, gt: 5 }`.\n */\nexport function parseValueFilter<V>(filter: ValueFilter<V, any>): ParsedValueFilter<V>[] {\n  if (filter === null) {\n    return [{ kind: \"is-null\" }];\n  } else if (filter === undefined) {\n    // This is legacy behavior where `em.find(Book, { author: undefined })` would match all books\n    return [];\n  } else if (Array.isArray(filter)) {\n    return [{ kind: \"in\", value: filter }];\n  } else if (isPlainObject(filter)) {\n    const keys = Object.keys(filter);\n    if (keys.length === 0) {\n      // Should this be an error?\n      return [];\n    } else if (keys.length === 2 && \"op\" in filter && \"value\" in filter) {\n      // Probe for `findGql` op & value\n      const { op, value } = filter;\n      if (shouldPruneValueFilter(op, value)) {\n        return [];\n      } else if (value === null) {\n        return [{ kind: \"is-null\" }];\n      } else {\n        return [{ kind: op, value: value ?? null }];\n      }\n    } else if (keys.length === 2 && \"gte\" in filter && \"lte\" in filter) {\n      const { gte, lte } = filter;\n      return [{ kind: \"between\", value: [gte, lte] }];\n    } else {\n      return Object.entries(filter)\n        .map(([key, value]) => {\n          // Always do condition pruning on the value\n          if (shouldPruneValueFilter(key, value)) {\n            return undefined;\n          }\n          switch (key) {\n            case \"eq\":\n              if (value === null) {\n                return { kind: \"is-null\" as const };\n              } else {\n                return { kind: \"eq\" as const, value: filter[key] };\n              }\n            case \"ne\":\n              if (value === null) {\n                return { kind: \"not-null\" as const };\n              } else {\n                return { kind: \"ne\" as const, value: filter[key] ?? null };\n              }\n            case \"in\":\n            case \"nin\":\n            case \"gt\":\n            case \"gte\":\n            case \"lt\":\n            case \"lte\":\n            case \"like\":\n            case \"nlike\":\n            case \"ilike\":\n            case \"nilike\":\n            case \"regex\":\n            case \"nregex\":\n            case \"iregex\":\n            case \"niregex\":\n            case \"contains\":\n            case \"overlaps\":\n            case \"containedBy\":\n              return { kind: key, value: filter[key] };\n            case \"pathExists\":\n              return { kind: \"jsonPathExists\" as const, value: filter[key] };\n            case \"pathIsTrue\":\n              return { kind: \"jsonPathPredicate\" as const, value: filter[key] };\n            case \"search\":\n              return { kind: \"ilike\" as const, value: makeLike(filter[key]) };\n            case \"between\":\n              return { kind: key, value: filter[key] };\n            default:\n              throw new Error(`Unsupported value filter key ${key}`);\n          }\n        })\n        .filter(isDefined);\n    }\n  } else {\n    // This is a primitive like a string, number\n    return [{ kind: \"eq\", value: filter }];\n  }\n}\n\n/** Converts domain-level values like string ids/enums into their db equivalent. */\nexport function mapToDb(column: Column, filter: ParsedValueFilter<any>): ParsedValueFilter<any> {\n  // ...to teach this `mapToDb` function to handle/rewrite `in: [1, null]` handling, we'd need to:\n  // 1. return a maybe-simple/maybe-nested condition, so basically a `ParsedExpressionCondition`, because\n  // this would let `in` return an `{ or: ... }` to all the callers.\n  // 2. also return `{ parsed: ParsedExpressionCondition, simples: SimpleCondition[] }` tuple, for the\n  // alias `addCondition` processing to track the `simples` and rewrite their alias when later bound.\n  switch (filter.kind) {\n    case \"eq\":\n    case \"gt\":\n    case \"gte\":\n    case \"ne\":\n    case \"lt\":\n    case \"lte\":\n    case \"like\":\n    case \"nlike\":\n    case \"ilike\":\n    case \"nilike\":\n    case \"regex\":\n    case \"nregex\":\n    case \"iregex\":\n    case \"niregex\":\n      filter.value = column.mapToDb(filter.value);\n      return filter;\n    case \"in\":\n      if (column.isArray) {\n        // Arrays need a special operator\n        return { kind: \"contains\", value: column.mapToDb(filter.value) };\n      } else {\n        filter.value = filter.value.map((v) => column.mapToDb(v));\n      }\n      return filter;\n    case \"nin\":\n      if (column.isArray) {\n        // Arrays need a special operator\n        throw new Error(\"The nin operator is not supported on array columns yet\");\n      } else {\n        filter.value = filter.value.map((v) => column.mapToDb(v));\n      }\n      return filter;\n    case \"contains\":\n    case \"ncontains\":\n    case \"overlaps\":\n    case \"noverlaps\":\n    case \"containedBy\":\n      const supportsContains = column.isArray || column.dbType === \"jsonb\";\n      if (!supportsContains) {\n        throw new Error(`${filter.kind} is only unsupported on array or jsonb columns`);\n      }\n      if (column.isArray) {\n        filter.value = column.mapToDb(filter.value);\n      } else {\n        // leave jsonb values alone\n      }\n      return filter;\n    case \"between\":\n      filter.value = [column.mapToDb(filter.value[0]), column.mapToDb(filter.value[1])];\n      return filter;\n    case \"is-null\":\n    case \"not-null\":\n    case \"jsonPathExists\":\n    case \"jsonPathPredicate\":\n      return filter;\n    default:\n      throw assertNever(filter);\n  }\n}\n\n/** Converts a search term like `foo bar` into a SQL `like` pattern like `%foo%bar%`. */\nexport function makeLike(search: any | undefined): any {\n  return search ? `%${search.replace(/\\s+/g, \"%\")}%` : undefined;\n}\n\n/** Returns true for values that should be treated like an omitted filter. */\nfunction shouldPruneValueFilter(key: unknown, value: unknown): boolean {\n  if (value === undefined) return true;\n  return value === false && key !== \"eq\" && key !== \"ne\";\n}\n\n/**\n * Returns whether an entity is known not to be queryable from the database.\n *\n * We check `idTaggedMaybe` instead of `isNewEntity` because commit rules run after INSERTs while those\n * entities still report as new until the flush completes (and yet, because they are in the database, we\n * must keep them in the query instead of ignoring them). An ID can also be assigned before INSERT, so an\n * ID-bearing entity conservatively falls through to a harmless database query.\n */\nfunction isNotInDb(value: Entity): boolean {\n  return value.idTaggedMaybe === undefined;\n}\n"],"mappings":";;;;;;;;;AAmBA,SAAgB,kBAAkB,OAAuB,QAA6C;CACpG,IAAI,WAAW,KAAA,GAEb;MACK,IAAIA,6BAAAA,QAAQ,MAAM,GAEvB;MACK,IAAIC,4BAAAA,QAAQ,MAAM,GAOvB,OAAO;EAAE,MAAM;EAAQ,WAAW,CAAC;CAAE;MAChC,IAAI,WAAW,MACpB,OAAO,EAAE,MAAM,UAAU;MACpB,IAAI,OAAO,WAAW,YAAY,OAAO,WAAW,UACzD,OAAO;EAAE,MAAM;EAAM,OAAO;CAAO;MAC9B,IAAI,OAAO,WAAW,WAC3B,OAAO,SAAS,EAAE,MAAM,WAAW,IAAI,EAAE,MAAM,UAAU;MACpD,IAAI,MAAM,QAAQ,MAAM,GAC7B,OAAO;EACL,MAAM;EACN,OAAO,OAAO,SAAS,UAAoC;GACzD,IAAI,CAACC,eAAAA,SAAS,KAAK,GAAG,OAAO,CAAC,KAAK;GAEnC,OAAO,UAAU,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,QAAQ;EAChD,CAAC;CACH;MACK,IAAIA,eAAAA,SAAS,MAAM,GAExB,OAAO,UAAU,MAAM,IAAI;EAAE,MAAM;EAAM,OAAO,CAAC;CAAE,IAAI;EAAE,MAAM;EAAM,OAAO,OAAO;CAAS;MACvF,IAAI,OAAO,WAAW,UAAU;EAErC,MAAM,OAAO,OAAO,KAAK,MAAM;EAE/B,IAAI,KAAK,WAAW,KAAK,KAAK,OAAO,MAAM;GACzC,MAAM,QAAQ,OAAO;GACrB,IAAI,UAAU,KAAA,GACZ;QACK,IAAI,UAAU,MACnB,OAAO,EAAE,MAAM,WAAW;QACrB,IAAI,OAAO,UAAU,YAAY,OAAO,UAAU,UACvD,OAAO;IAAE,MAAM;IAAM;GAAM;QACtB,IAAIA,eAAAA,SAAS,KAAK,GAEvB,OAAO,UAAU,KAAK,IAAI,EAAE,MAAM,WAAW,IAAI;IAAE,MAAM;IAAM,OAAO,MAAM;GAAS;QAErF,MAAM,IAAI,MAAM,0BAA0B,OAAO;EAErD;EAEA,IAAI,KAAK,WAAW,KAAK,KAAK,OAAO,MAAM;GACzC,MAAM,QAAQ,OAAO;GACrB,IAAI,UAAU,KAAA,GACZ;QACK,IAAI,UAAU,MACnB,OAAO,EAAE,MAAM,UAAU;QACpB,IAAI,OAAO,UAAU,YAAY,OAAO,UAAU,UACvD,OAAO;IAAE,MAAM;IAAM;GAAM;QACtB,IAAIA,eAAAA,SAAS,KAAK,GACvB,OAAO,UAAU,KAAK,IAAI;IAAE,MAAM;IAAM,OAAO,CAAC;GAAE,IAAI;IAAE,MAAM;IAAM,OAAO,MAAM;GAAS;QAE1F,OAAO,iBAAiB,KAAK,CAAC,CAAC;EAEnC;EAIA,MAAM,YAAY,CAAC;EACnB,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,MAAM,GAC9C,IAAI,SAAS,OAAO,UAAU,YAAY,CAACA,eAAAA,SAAS,KAAK,KAAK,EAAA,GAACC,YAAAA,cAAAA,CAAc,KAAK,KAAK,mBAAmB,OACxG,UAAU,OAAO,MAAM,kBAAkB,KAAA,IAAY,CAAC,IAAI,MAAM;OAEhE,UAAU,OAAO;EAGrB,OAAO;GAAE,MAAM;GAAQ;EAAU;CACnC,OACE,MAAM,IAAI,MAAM,uBAAuB,QAAQ;AAEnD;;;;;;;AAQA,SAAgB,iBAAoB,QAAqD;CACvF,IAAI,WAAW,MACb,OAAO,CAAC,EAAE,MAAM,UAAU,CAAC;MACtB,IAAI,WAAW,KAAA,GAEpB,OAAO,CAAC;MACH,IAAI,MAAM,QAAQ,MAAM,GAC7B,OAAO,CAAC;EAAE,MAAM;EAAM,OAAO;CAAO,CAAC;MAChC,KAAA,GAAIA,YAAAA,cAAAA,CAAc,MAAM,GAAG;EAChC,MAAM,OAAO,OAAO,KAAK,MAAM;EAC/B,IAAI,KAAK,WAAW,GAElB,OAAO,CAAC;OACH,IAAI,KAAK,WAAW,KAAK,QAAQ,UAAU,WAAW,QAAQ;GAEnE,MAAM,EAAE,IAAI,UAAU;GACtB,IAAI,uBAAuB,IAAI,KAAK,GAClC,OAAO,CAAC;QACH,IAAI,UAAU,MACnB,OAAO,CAAC,EAAE,MAAM,UAAU,CAAC;QAE3B,OAAO,CAAC;IAAE,MAAM;IAAI,OAAO,SAAS;GAAK,CAAC;EAE9C,OAAO,IAAI,KAAK,WAAW,KAAK,SAAS,UAAU,SAAS,QAAQ;GAClE,MAAM,EAAE,KAAK,QAAQ;GACrB,OAAO,CAAC;IAAE,MAAM;IAAW,OAAO,CAAC,KAAK,GAAG;GAAE,CAAC;EAChD,OACE,OAAO,OAAO,QAAQ,MAAM,CAAC,CAC1B,KAAK,CAAC,KAAK,WAAW;GAErB,IAAI,uBAAuB,KAAK,KAAK,GACnC;GAEF,QAAQ,KAAR;IACE,KAAK,MACH,IAAI,UAAU,MACZ,OAAO,EAAE,MAAM,UAAmB;SAElC,OAAO;KAAE,MAAM;KAAe,OAAO,OAAO;IAAK;IAErD,KAAK,MACH,IAAI,UAAU,MACZ,OAAO,EAAE,MAAM,WAAoB;SAEnC,OAAO;KAAE,MAAM;KAAe,OAAO,OAAO,QAAQ;IAAK;IAE7D,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK,eACH,OAAO;KAAE,MAAM;KAAK,OAAO,OAAO;IAAK;IACzC,KAAK,cACH,OAAO;KAAE,MAAM;KAA2B,OAAO,OAAO;IAAK;IAC/D,KAAK,cACH,OAAO;KAAE,MAAM;KAA8B,OAAO,OAAO;IAAK;IAClE,KAAK,UACH,OAAO;KAAE,MAAM;KAAkB,OAAO,SAAS,OAAO,IAAI;IAAE;IAChE,KAAK,WACH,OAAO;KAAE,MAAM;KAAK,OAAO,OAAO;IAAK;IACzC,SACE,MAAM,IAAI,MAAM,gCAAgC,KAAK;GACzD;EACF,CAAC,CAAC,CACD,OAAOC,sBAAAA,SAAS;CAEvB,OAEE,OAAO,CAAC;EAAE,MAAM;EAAM,OAAO;CAAO,CAAC;AAEzC;;AAGA,SAAgB,QAAQ,QAAgB,QAAwD;CAM9F,QAAQ,OAAO,MAAf;EACE,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;GACH,OAAO,QAAQ,OAAO,QAAQ,OAAO,KAAK;GAC1C,OAAO;EACT,KAAK;GACH,IAAI,OAAO,SAET,OAAO;IAAE,MAAM;IAAY,OAAO,OAAO,QAAQ,OAAO,KAAK;GAAE;QAE/D,OAAO,QAAQ,OAAO,MAAM,KAAK,MAAM,OAAO,QAAQ,CAAC,CAAC;GAE1D,OAAO;EACT,KAAK;GACH,IAAI,OAAO,SAET,MAAM,IAAI,MAAM,wDAAwD;QAExE,OAAO,QAAQ,OAAO,MAAM,KAAK,MAAM,OAAO,QAAQ,CAAC,CAAC;GAE1D,OAAO;EACT,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;GAEH,IAAI,EADqB,OAAO,WAAW,OAAO,WAAW,UAE3D,MAAM,IAAI,MAAM,GAAG,OAAO,KAAK,+CAA+C;GAEhF,IAAI,OAAO,SACT,OAAO,QAAQ,OAAO,QAAQ,OAAO,KAAK;GAI5C,OAAO;EACT,KAAK;GACH,OAAO,QAAQ,CAAC,OAAO,QAAQ,OAAO,MAAM,EAAE,GAAG,OAAO,QAAQ,OAAO,MAAM,EAAE,CAAC;GAChF,OAAO;EACT,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK,qBACH,OAAO;EACT,SACE,MAAMC,cAAAA,YAAY,MAAM;CAC5B;AACF;;AAGA,SAAgB,SAAS,QAA8B;CACrD,OAAO,SAAS,IAAI,OAAO,QAAQ,QAAQ,GAAG,EAAE,KAAK,KAAA;AACvD;;AAGA,SAAS,uBAAuB,KAAc,OAAyB;CACrE,IAAI,UAAU,KAAA,GAAW,OAAO;CAChC,OAAO,UAAU,SAAS,QAAQ,QAAQ,QAAQ;AACpD;;;;;;;;;AAUA,SAAS,UAAU,OAAwB;CACzC,OAAO,MAAM,kBAAkB,KAAA;AACjC"}

package/build/queries/valueFilters.d.cts

@@ -0,0 +1,26 @@
+import { ParsedValueFilter } from "./parsedConditions.cjs";
+import { ValueFilter } from "./find/EntityFilter.cjs";
+import { Column } from "../serde/columns.cjs";
+import { EntityMetadata } from "../EntityMetadata.cjs";
+//#region src/queries/valueFilters.d.ts
+/** An ADT version of `EntityFilter`. */
+type ParsedEntityFilter = ParsedValueFilter<string | number> | {
+  kind: "join";
+  subFilter: object;
+};
+/** Parses an entity filter, which could be "just an id", an array of ids, or a nested filter. */
+declare function parseEntityFilter(_meta: EntityMetadata, filter: any): ParsedEntityFilter | undefined;
+/**
+ * Parses the many/hodgepodge (ergonomic!) patterns of value filters into a `ParsedValueFilter[]`.
+ *
+ * Note we return an array because filter might be a `ValueGraphQLFilter` that is allowed to have
+ * multiple conditions, i.e. `{ lt: 10, gt: 5 }`.
+ */
+declare function parseValueFilter<V>(filter: ValueFilter<V, any>): ParsedValueFilter<V>[];
+/** Converts domain-level values like string ids/enums into their db equivalent. */
+declare function mapToDb(column: Column, filter: ParsedValueFilter<any>): ParsedValueFilter<any>;
+/** Converts a search term like `foo bar` into a SQL `like` pattern like `%foo%bar%`. */
+declare function makeLike(search: any | undefined): any;
+//#endregion
+export { ParsedEntityFilter, makeLike, mapToDb, parseEntityFilter, parseValueFilter };
+//# sourceMappingURL=valueFilters.d.cts.map

package/build/queries/valueFilters.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"valueFilters.d.cts","names":[],"sources":["../../src/queries/valueFilters.ts"],"mappings":";;;;;;KAYY,qBAER;EAEE;EAAc;;;iBAGJ,kBAAkB,OAAO,gBAAgB,cAAc;;;;;;;iBA0FvD,iBAAiB,GAAG,QAAQ,YAAY,UAAU,kBAAkB;;iBAqFpE,QAAQ,QAAQ,QAAQ,QAAQ,yBAAyB;;iBAoEzD,SAAS"}

package/build/queries/valueFilters.d.mts

@@ -0,0 +1,26 @@
+import { ParsedValueFilter } from "./parsedConditions.mjs";
+import { ValueFilter } from "./find/EntityFilter.mjs";
+import { Column } from "../serde/columns.mjs";
+import { EntityMetadata } from "../EntityMetadata.mjs";
+//#region src/queries/valueFilters.d.ts
+/** An ADT version of `EntityFilter`. */
+type ParsedEntityFilter = ParsedValueFilter<string | number> | {
+  kind: "join";
+  subFilter: object;
+};
+/** Parses an entity filter, which could be "just an id", an array of ids, or a nested filter. */
+declare function parseEntityFilter(_meta: EntityMetadata, filter: any): ParsedEntityFilter | undefined;
+/**
+ * Parses the many/hodgepodge (ergonomic!) patterns of value filters into a `ParsedValueFilter[]`.
+ *
+ * Note we return an array because filter might be a `ValueGraphQLFilter` that is allowed to have
+ * multiple conditions, i.e. `{ lt: 10, gt: 5 }`.
+ */
+declare function parseValueFilter<V>(filter: ValueFilter<V, any>): ParsedValueFilter<V>[];
+/** Converts domain-level values like string ids/enums into their db equivalent. */
+declare function mapToDb(column: Column, filter: ParsedValueFilter<any>): ParsedValueFilter<any>;
+/** Converts a search term like `foo bar` into a SQL `like` pattern like `%foo%bar%`. */
+declare function makeLike(search: any | undefined): any;
+//#endregion
+export { ParsedEntityFilter, makeLike, mapToDb, parseEntityFilter, parseValueFilter };
+//# sourceMappingURL=valueFilters.d.mts.map

package/build/queries/valueFilters.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"valueFilters.d.mts","names":[],"sources":["../../src/queries/valueFilters.ts"],"mappings":";;;;;;KAYY,qBAER;EAEE;EAAc;;;iBAGJ,kBAAkB,OAAO,gBAAgB,cAAc;;;;;;;iBA0FvD,iBAAiB,GAAG,QAAQ,YAAY,UAAU,kBAAkB;;iBAqFpE,QAAQ,QAAQ,QAAQ,QAAQ,yBAAyB;;iBAoEzD,SAAS"}

package/build/queries/valueFilters.js

@@ -0,0 +1,236 @@
+import { isAlias } from "./find/Aliases.js";
+import { isScope } from "./find/scopes.js";
+import { assertNever } from "../utils.js";
+import { isDefined } from "../EntityManager.js";
+import { isEntity } from "../Entity.js";
+import { isPlainObject } from "joist-utils";
+//#region src/queries/valueFilters.ts
+/** Parses an entity filter, which could be "just an id", an array of ids, or a nested filter. */
+function parseEntityFilter(_meta, filter) {
+	if (filter === void 0) return;
+	else if (isAlias(filter)) return;
+	else if (isScope(filter)) return {
+		kind: "join",
+		subFilter: {}
+	};
+	else if (filter === null) return { kind: "is-null" };
+	else if (typeof filter === "string" || typeof filter === "number") return {
+		kind: "eq",
+		value: filter
+	};
+	else if (typeof filter === "boolean") return filter ? { kind: "not-null" } : { kind: "is-null" };
+	else if (Array.isArray(filter)) return {
+		kind: "in",
+		value: filter.flatMap((value) => {
+			if (!isEntity(value)) return [value];
+			return isNotInDb(value) ? [] : [value.idTagged];
+		})
+	};
+	else if (isEntity(filter)) return isNotInDb(filter) ? {
+		kind: "in",
+		value: []
+	} : {
+		kind: "eq",
+		value: filter.idTagged
+	};
+	else if (typeof filter === "object") {
+		const keys = Object.keys(filter);
+		if (keys.length === 1 && keys[0] === "ne") {
+			const value = filter["ne"];
+			if (value === void 0) return;
+			else if (value === null) return { kind: "not-null" };
+			else if (typeof value === "string" || typeof value === "number") return {
+				kind: "ne",
+				value
+			};
+			else if (isEntity(value)) return isNotInDb(value) ? { kind: "not-null" } : {
+				kind: "ne",
+				value: value.idTagged
+			};
+			else throw new Error(`Unsupported "ne" value ${value}`);
+		}
+		if (keys.length === 1 && keys[0] === "id") {
+			const value = filter["id"];
+			if (value === void 0) return;
+			else if (value === null) return { kind: "is-null" };
+			else if (typeof value === "string" || typeof value === "number") return {
+				kind: "eq",
+				value
+			};
+			else if (isEntity(value)) return isNotInDb(value) ? {
+				kind: "in",
+				value: []
+			} : {
+				kind: "eq",
+				value: value.idTagged
+			};
+			else return parseValueFilter(value)[0];
+		}
+		const subFilter = {};
+		for (const [key, value] of Object.entries(filter)) if (value && typeof value === "object" && !isEntity(value) && !isPlainObject(value) && "idTaggedMaybe" in value) subFilter[key] = value.idTaggedMaybe === void 0 ? [] : value.idTaggedMaybe;
+		else subFilter[key] = value;
+		return {
+			kind: "join",
+			subFilter
+		};
+	} else throw new Error(`Unrecognized filter ${filter}`);
+}
+/**
+* Parses the many/hodgepodge (ergonomic!) patterns of value filters into a `ParsedValueFilter[]`.
+*
+* Note we return an array because filter might be a `ValueGraphQLFilter` that is allowed to have
+* multiple conditions, i.e. `{ lt: 10, gt: 5 }`.
+*/
+function parseValueFilter(filter) {
+	if (filter === null) return [{ kind: "is-null" }];
+	else if (filter === void 0) return [];
+	else if (Array.isArray(filter)) return [{
+		kind: "in",
+		value: filter
+	}];
+	else if (isPlainObject(filter)) {
+		const keys = Object.keys(filter);
+		if (keys.length === 0) return [];
+		else if (keys.length === 2 && "op" in filter && "value" in filter) {
+			const { op, value } = filter;
+			if (shouldPruneValueFilter(op, value)) return [];
+			else if (value === null) return [{ kind: "is-null" }];
+			else return [{
+				kind: op,
+				value: value ?? null
+			}];
+		} else if (keys.length === 2 && "gte" in filter && "lte" in filter) {
+			const { gte, lte } = filter;
+			return [{
+				kind: "between",
+				value: [gte, lte]
+			}];
+		} else return Object.entries(filter).map(([key, value]) => {
+			if (shouldPruneValueFilter(key, value)) return;
+			switch (key) {
+				case "eq": if (value === null) return { kind: "is-null" };
+				else return {
+					kind: "eq",
+					value: filter[key]
+				};
+				case "ne": if (value === null) return { kind: "not-null" };
+				else return {
+					kind: "ne",
+					value: filter[key] ?? null
+				};
+				case "in":
+				case "nin":
+				case "gt":
+				case "gte":
+				case "lt":
+				case "lte":
+				case "like":
+				case "nlike":
+				case "ilike":
+				case "nilike":
+				case "regex":
+				case "nregex":
+				case "iregex":
+				case "niregex":
+				case "contains":
+				case "overlaps":
+				case "containedBy": return {
+					kind: key,
+					value: filter[key]
+				};
+				case "pathExists": return {
+					kind: "jsonPathExists",
+					value: filter[key]
+				};
+				case "pathIsTrue": return {
+					kind: "jsonPathPredicate",
+					value: filter[key]
+				};
+				case "search": return {
+					kind: "ilike",
+					value: makeLike(filter[key])
+				};
+				case "between": return {
+					kind: key,
+					value: filter[key]
+				};
+				default: throw new Error(`Unsupported value filter key ${key}`);
+			}
+		}).filter(isDefined);
+	} else return [{
+		kind: "eq",
+		value: filter
+	}];
+}
+/** Converts domain-level values like string ids/enums into their db equivalent. */
+function mapToDb(column, filter) {
+	switch (filter.kind) {
+		case "eq":
+		case "gt":
+		case "gte":
+		case "ne":
+		case "lt":
+		case "lte":
+		case "like":
+		case "nlike":
+		case "ilike":
+		case "nilike":
+		case "regex":
+		case "nregex":
+		case "iregex":
+		case "niregex":
+			filter.value = column.mapToDb(filter.value);
+			return filter;
+		case "in":
+			if (column.isArray) return {
+				kind: "contains",
+				value: column.mapToDb(filter.value)
+			};
+			else filter.value = filter.value.map((v) => column.mapToDb(v));
+			return filter;
+		case "nin":
+			if (column.isArray) throw new Error("The nin operator is not supported on array columns yet");
+			else filter.value = filter.value.map((v) => column.mapToDb(v));
+			return filter;
+		case "contains":
+		case "ncontains":
+		case "overlaps":
+		case "noverlaps":
+		case "containedBy":
+			if (!(column.isArray || column.dbType === "jsonb")) throw new Error(`${filter.kind} is only unsupported on array or jsonb columns`);
+			if (column.isArray) filter.value = column.mapToDb(filter.value);
+			return filter;
+		case "between":
+			filter.value = [column.mapToDb(filter.value[0]), column.mapToDb(filter.value[1])];
+			return filter;
+		case "is-null":
+		case "not-null":
+		case "jsonPathExists":
+		case "jsonPathPredicate": return filter;
+		default: throw assertNever(filter);
+	}
+}
+/** Converts a search term like `foo bar` into a SQL `like` pattern like `%foo%bar%`. */
+function makeLike(search) {
+	return search ? `%${search.replace(/\s+/g, "%")}%` : void 0;
+}
+/** Returns true for values that should be treated like an omitted filter. */
+function shouldPruneValueFilter(key, value) {
+	if (value === void 0) return true;
+	return value === false && key !== "eq" && key !== "ne";
+}
+/**
+* Returns whether an entity is known not to be queryable from the database.
+*
+* We check `idTaggedMaybe` instead of `isNewEntity` because commit rules run after INSERTs while those
+* entities still report as new until the flush completes (and yet, because they are in the database, we
+* must keep them in the query instead of ignoring them). An ID can also be assigned before INSERT, so an
+* ID-bearing entity conservatively falls through to a harmless database query.
+*/
+function isNotInDb(value) {
+	return value.idTaggedMaybe === void 0;
+}
+//#endregion
+export { makeLike, mapToDb, parseEntityFilter, parseValueFilter };
+
+//# sourceMappingURL=valueFilters.js.map

package/build/queries/valueFilters.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"valueFilters.js","names":[],"sources":["../../src/queries/valueFilters.ts"],"sourcesContent":["import { isPlainObject } from \"joist-utils\";\nimport { type Entity, isEntity } from \"src/Entity.ts\";\nimport { isDefined } from \"src/EntityManager.ts\";\nimport type { EntityMetadata } from \"src/EntityMetadata.ts\";\nimport { isAlias } from \"src/queries/find/Aliases.ts\";\nimport type { ValueFilter } from \"src/queries/find/EntityFilter.ts\";\nimport { isScope } from \"src/queries/find/scopes.ts\";\nimport type { ParsedValueFilter } from \"src/queries/parsedConditions.ts\";\nimport type { Column } from \"src/serde/columns.ts\";\nimport { assertNever } from \"src/utils.ts\";\n\n/** An ADT version of `EntityFilter`. */\nexport type ParsedEntityFilter =\n  // ParsedValueFilter is any simple match on `id`\n  | ParsedValueFilter<string | number>\n  // Otherwise we return the join/complex\n  | { kind: \"join\"; subFilter: object };\n\n/** Parses an entity filter, which could be \"just an id\", an array of ids, or a nested filter. */\nexport function parseEntityFilter(_meta: EntityMetadata, filter: any): ParsedEntityFilter | undefined {\n  if (filter === undefined) {\n    // This matches legacy `em.find(Book, { author: undefined })` behavior\n    return undefined;\n  } else if (isAlias(filter)) {\n    // We're just binding an alias to this position in the join tree\n    return undefined;\n  } else if (isScope(filter)) {\n    // A scope on a relation (e.g. `{ author: Author.adult }`) always implies conditions on the\n    // related entity, so signal \"needs a join\" via the existing `join` discriminant rather than\n    // adding a dedicated `kind: \"scope\"` that every relation branch would have to learn. The empty\n    // `subFilter` is intentionally never read: the m2o/m2m branches only check `kind === \"join\"` to\n    // decide whether to join, then re-dispatch the original scope value back through `addTable`,\n    // where `isScope(...)` routes it to `addScopeFilterAt` to apply the scope's actual fragments.\n    return { kind: \"join\", subFilter: {} };\n  } else if (filter === null) {\n    return { kind: \"is-null\" };\n  } else if (typeof filter === \"string\" || typeof filter === \"number\") {\n    return { kind: \"eq\", value: filter };\n  } else if (typeof filter === \"boolean\") {\n    return filter ? { kind: \"not-null\" } : { kind: \"is-null\" };\n  } else if (Array.isArray(filter)) {\n    return {\n      kind: \"in\",\n      value: filter.flatMap((value: string | number | Entity) => {\n        if (!isEntity(value)) return [value];\n        // If no IDs remain, `in: []` marks the condition as unable to match a database row.\n        return isNotInDb(value) ? [] : [value.idTagged];\n      }),\n    };\n  } else if (isEntity(filter)) {\n    // We use `in: []` to mark an ID-less entity as unable to match a database row.\n    return isNotInDb(filter) ? { kind: \"in\", value: [] } : { kind: \"eq\", value: filter.idTagged };\n  } else if (typeof filter === \"object\") {\n    // Looking for `{ firstName: \"f1\" }` or `{ ne: \"f1\" }`\n    const keys = Object.keys(filter);\n    // Special case only looking at `ne`\n    if (keys.length === 1 && keys[0] === \"ne\") {\n      const value = filter[\"ne\"];\n      if (value === undefined) {\n        return undefined;\n      } else if (value === null) {\n        return { kind: \"not-null\" };\n      } else if (typeof value === \"string\" || typeof value === \"number\") {\n        return { kind: \"ne\", value };\n      } else if (isEntity(value)) {\n        // No persisted FK can equal an ID-less entity, and SQL `!=` excludes nulls, so this is `IS NOT NULL`.\n        return isNotInDb(value) ? { kind: \"not-null\" } : { kind: \"ne\", value: value.idTagged };\n      } else {\n        throw new Error(`Unsupported \"ne\" value ${value}`);\n      }\n    }\n    // Special case only looking at `id`\n    if (keys.length === 1 && keys[0] === \"id\") {\n      const value = filter[\"id\"];\n      if (value === undefined) {\n        return undefined;\n      } else if (value === null) {\n        return { kind: \"is-null\" };\n      } else if (typeof value === \"string\" || typeof value === \"number\") {\n        return { kind: \"eq\", value };\n      } else if (isEntity(value)) {\n        return isNotInDb(value) ? { kind: \"in\", value: [] } : { kind: \"eq\", value: value.idTagged };\n      } else {\n        return parseValueFilter(value)[0] as any;\n      }\n    }\n    // Look for subFilter values being EntityFilter-ish instances like ManyToOneReference\n    // that have an id, and so structurally match the entity filter without really being filters,\n    // and convert them over here before getting into parseValueFilter.\n    const subFilter = {} as any;\n    for (const [key, value] of Object.entries(filter)) {\n      if (value && typeof value === \"object\" && !isEntity(value) && !isPlainObject(value) && \"idTaggedMaybe\" in value) {\n        subFilter[key] = value.idTaggedMaybe === undefined ? [] : value.idTaggedMaybe;\n      } else {\n        subFilter[key] = value;\n      }\n    }\n    return { kind: \"join\", subFilter };\n  } else {\n    throw new Error(`Unrecognized filter ${filter}`);\n  }\n}\n\n/**\n * Parses the many/hodgepodge (ergonomic!) patterns of value filters into a `ParsedValueFilter[]`.\n *\n * Note we return an array because filter might be a `ValueGraphQLFilter` that is allowed to have\n * multiple conditions, i.e. `{ lt: 10, gt: 5 }`.\n */\nexport function parseValueFilter<V>(filter: ValueFilter<V, any>): ParsedValueFilter<V>[] {\n  if (filter === null) {\n    return [{ kind: \"is-null\" }];\n  } else if (filter === undefined) {\n    // This is legacy behavior where `em.find(Book, { author: undefined })` would match all books\n    return [];\n  } else if (Array.isArray(filter)) {\n    return [{ kind: \"in\", value: filter }];\n  } else if (isPlainObject(filter)) {\n    const keys = Object.keys(filter);\n    if (keys.length === 0) {\n      // Should this be an error?\n      return [];\n    } else if (keys.length === 2 && \"op\" in filter && \"value\" in filter) {\n      // Probe for `findGql` op & value\n      const { op, value } = filter;\n      if (shouldPruneValueFilter(op, value)) {\n        return [];\n      } else if (value === null) {\n        return [{ kind: \"is-null\" }];\n      } else {\n        return [{ kind: op, value: value ?? null }];\n      }\n    } else if (keys.length === 2 && \"gte\" in filter && \"lte\" in filter) {\n      const { gte, lte } = filter;\n      return [{ kind: \"between\", value: [gte, lte] }];\n    } else {\n      return Object.entries(filter)\n        .map(([key, value]) => {\n          // Always do condition pruning on the value\n          if (shouldPruneValueFilter(key, value)) {\n            return undefined;\n          }\n          switch (key) {\n            case \"eq\":\n              if (value === null) {\n                return { kind: \"is-null\" as const };\n              } else {\n                return { kind: \"eq\" as const, value: filter[key] };\n              }\n            case \"ne\":\n              if (value === null) {\n                return { kind: \"not-null\" as const };\n              } else {\n                return { kind: \"ne\" as const, value: filter[key] ?? null };\n              }\n            case \"in\":\n            case \"nin\":\n            case \"gt\":\n            case \"gte\":\n            case \"lt\":\n            case \"lte\":\n            case \"like\":\n            case \"nlike\":\n            case \"ilike\":\n            case \"nilike\":\n            case \"regex\":\n            case \"nregex\":\n            case \"iregex\":\n            case \"niregex\":\n            case \"contains\":\n            case \"overlaps\":\n            case \"containedBy\":\n              return { kind: key, value: filter[key] };\n            case \"pathExists\":\n              return { kind: \"jsonPathExists\" as const, value: filter[key] };\n            case \"pathIsTrue\":\n              return { kind: \"jsonPathPredicate\" as const, value: filter[key] };\n            case \"search\":\n              return { kind: \"ilike\" as const, value: makeLike(filter[key]) };\n            case \"between\":\n              return { kind: key, value: filter[key] };\n            default:\n              throw new Error(`Unsupported value filter key ${key}`);\n          }\n        })\n        .filter(isDefined);\n    }\n  } else {\n    // This is a primitive like a string, number\n    return [{ kind: \"eq\", value: filter }];\n  }\n}\n\n/** Converts domain-level values like string ids/enums into their db equivalent. */\nexport function mapToDb(column: Column, filter: ParsedValueFilter<any>): ParsedValueFilter<any> {\n  // ...to teach this `mapToDb` function to handle/rewrite `in: [1, null]` handling, we'd need to:\n  // 1. return a maybe-simple/maybe-nested condition, so basically a `ParsedExpressionCondition`, because\n  // this would let `in` return an `{ or: ... }` to all the callers.\n  // 2. also return `{ parsed: ParsedExpressionCondition, simples: SimpleCondition[] }` tuple, for the\n  // alias `addCondition` processing to track the `simples` and rewrite their alias when later bound.\n  switch (filter.kind) {\n    case \"eq\":\n    case \"gt\":\n    case \"gte\":\n    case \"ne\":\n    case \"lt\":\n    case \"lte\":\n    case \"like\":\n    case \"nlike\":\n    case \"ilike\":\n    case \"nilike\":\n    case \"regex\":\n    case \"nregex\":\n    case \"iregex\":\n    case \"niregex\":\n      filter.value = column.mapToDb(filter.value);\n      return filter;\n    case \"in\":\n      if (column.isArray) {\n        // Arrays need a special operator\n        return { kind: \"contains\", value: column.mapToDb(filter.value) };\n      } else {\n        filter.value = filter.value.map((v) => column.mapToDb(v));\n      }\n      return filter;\n    case \"nin\":\n      if (column.isArray) {\n        // Arrays need a special operator\n        throw new Error(\"The nin operator is not supported on array columns yet\");\n      } else {\n        filter.value = filter.value.map((v) => column.mapToDb(v));\n      }\n      return filter;\n    case \"contains\":\n    case \"ncontains\":\n    case \"overlaps\":\n    case \"noverlaps\":\n    case \"containedBy\":\n      const supportsContains = column.isArray || column.dbType === \"jsonb\";\n      if (!supportsContains) {\n        throw new Error(`${filter.kind} is only unsupported on array or jsonb columns`);\n      }\n      if (column.isArray) {\n        filter.value = column.mapToDb(filter.value);\n      } else {\n        // leave jsonb values alone\n      }\n      return filter;\n    case \"between\":\n      filter.value = [column.mapToDb(filter.value[0]), column.mapToDb(filter.value[1])];\n      return filter;\n    case \"is-null\":\n    case \"not-null\":\n    case \"jsonPathExists\":\n    case \"jsonPathPredicate\":\n      return filter;\n    default:\n      throw assertNever(filter);\n  }\n}\n\n/** Converts a search term like `foo bar` into a SQL `like` pattern like `%foo%bar%`. */\nexport function makeLike(search: any | undefined): any {\n  return search ? `%${search.replace(/\\s+/g, \"%\")}%` : undefined;\n}\n\n/** Returns true for values that should be treated like an omitted filter. */\nfunction shouldPruneValueFilter(key: unknown, value: unknown): boolean {\n  if (value === undefined) return true;\n  return value === false && key !== \"eq\" && key !== \"ne\";\n}\n\n/**\n * Returns whether an entity is known not to be queryable from the database.\n *\n * We check `idTaggedMaybe` instead of `isNewEntity` because commit rules run after INSERTs while those\n * entities still report as new until the flush completes (and yet, because they are in the database, we\n * must keep them in the query instead of ignoring them). An ID can also be assigned before INSERT, so an\n * ID-bearing entity conservatively falls through to a harmless database query.\n */\nfunction isNotInDb(value: Entity): boolean {\n  return value.idTaggedMaybe === undefined;\n}\n"],"mappings":";;;;;;;;AAmBA,SAAgB,kBAAkB,OAAuB,QAA6C;CACpG,IAAI,WAAW,KAAA,GAEb;MACK,IAAI,QAAQ,MAAM,GAEvB;MACK,IAAI,QAAQ,MAAM,GAOvB,OAAO;EAAE,MAAM;EAAQ,WAAW,CAAC;CAAE;MAChC,IAAI,WAAW,MACpB,OAAO,EAAE,MAAM,UAAU;MACpB,IAAI,OAAO,WAAW,YAAY,OAAO,WAAW,UACzD,OAAO;EAAE,MAAM;EAAM,OAAO;CAAO;MAC9B,IAAI,OAAO,WAAW,WAC3B,OAAO,SAAS,EAAE,MAAM,WAAW,IAAI,EAAE,MAAM,UAAU;MACpD,IAAI,MAAM,QAAQ,MAAM,GAC7B,OAAO;EACL,MAAM;EACN,OAAO,OAAO,SAAS,UAAoC;GACzD,IAAI,CAAC,SAAS,KAAK,GAAG,OAAO,CAAC,KAAK;GAEnC,OAAO,UAAU,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,QAAQ;EAChD,CAAC;CACH;MACK,IAAI,SAAS,MAAM,GAExB,OAAO,UAAU,MAAM,IAAI;EAAE,MAAM;EAAM,OAAO,CAAC;CAAE,IAAI;EAAE,MAAM;EAAM,OAAO,OAAO;CAAS;MACvF,IAAI,OAAO,WAAW,UAAU;EAErC,MAAM,OAAO,OAAO,KAAK,MAAM;EAE/B,IAAI,KAAK,WAAW,KAAK,KAAK,OAAO,MAAM;GACzC,MAAM,QAAQ,OAAO;GACrB,IAAI,UAAU,KAAA,GACZ;QACK,IAAI,UAAU,MACnB,OAAO,EAAE,MAAM,WAAW;QACrB,IAAI,OAAO,UAAU,YAAY,OAAO,UAAU,UACvD,OAAO;IAAE,MAAM;IAAM;GAAM;QACtB,IAAI,SAAS,KAAK,GAEvB,OAAO,UAAU,KAAK,IAAI,EAAE,MAAM,WAAW,IAAI;IAAE,MAAM;IAAM,OAAO,MAAM;GAAS;QAErF,MAAM,IAAI,MAAM,0BAA0B,OAAO;EAErD;EAEA,IAAI,KAAK,WAAW,KAAK,KAAK,OAAO,MAAM;GACzC,MAAM,QAAQ,OAAO;GACrB,IAAI,UAAU,KAAA,GACZ;QACK,IAAI,UAAU,MACnB,OAAO,EAAE,MAAM,UAAU;QACpB,IAAI,OAAO,UAAU,YAAY,OAAO,UAAU,UACvD,OAAO;IAAE,MAAM;IAAM;GAAM;QACtB,IAAI,SAAS,KAAK,GACvB,OAAO,UAAU,KAAK,IAAI;IAAE,MAAM;IAAM,OAAO,CAAC;GAAE,IAAI;IAAE,MAAM;IAAM,OAAO,MAAM;GAAS;QAE1F,OAAO,iBAAiB,KAAK,CAAC,CAAC;EAEnC;EAIA,MAAM,YAAY,CAAC;EACnB,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,MAAM,GAC9C,IAAI,SAAS,OAAO,UAAU,YAAY,CAAC,SAAS,KAAK,KAAK,CAAC,cAAc,KAAK,KAAK,mBAAmB,OACxG,UAAU,OAAO,MAAM,kBAAkB,KAAA,IAAY,CAAC,IAAI,MAAM;OAEhE,UAAU,OAAO;EAGrB,OAAO;GAAE,MAAM;GAAQ;EAAU;CACnC,OACE,MAAM,IAAI,MAAM,uBAAuB,QAAQ;AAEnD;;;;;;;AAQA,SAAgB,iBAAoB,QAAqD;CACvF,IAAI,WAAW,MACb,OAAO,CAAC,EAAE,MAAM,UAAU,CAAC;MACtB,IAAI,WAAW,KAAA,GAEpB,OAAO,CAAC;MACH,IAAI,MAAM,QAAQ,MAAM,GAC7B,OAAO,CAAC;EAAE,MAAM;EAAM,OAAO;CAAO,CAAC;MAChC,IAAI,cAAc,MAAM,GAAG;EAChC,MAAM,OAAO,OAAO,KAAK,MAAM;EAC/B,IAAI,KAAK,WAAW,GAElB,OAAO,CAAC;OACH,IAAI,KAAK,WAAW,KAAK,QAAQ,UAAU,WAAW,QAAQ;GAEnE,MAAM,EAAE,IAAI,UAAU;GACtB,IAAI,uBAAuB,IAAI,KAAK,GAClC,OAAO,CAAC;QACH,IAAI,UAAU,MACnB,OAAO,CAAC,EAAE,MAAM,UAAU,CAAC;QAE3B,OAAO,CAAC;IAAE,MAAM;IAAI,OAAO,SAAS;GAAK,CAAC;EAE9C,OAAO,IAAI,KAAK,WAAW,KAAK,SAAS,UAAU,SAAS,QAAQ;GAClE,MAAM,EAAE,KAAK,QAAQ;GACrB,OAAO,CAAC;IAAE,MAAM;IAAW,OAAO,CAAC,KAAK,GAAG;GAAE,CAAC;EAChD,OACE,OAAO,OAAO,QAAQ,MAAM,CAAC,CAC1B,KAAK,CAAC,KAAK,WAAW;GAErB,IAAI,uBAAuB,KAAK,KAAK,GACnC;GAEF,QAAQ,KAAR;IACE,KAAK,MACH,IAAI,UAAU,MACZ,OAAO,EAAE,MAAM,UAAmB;SAElC,OAAO;KAAE,MAAM;KAAe,OAAO,OAAO;IAAK;IAErD,KAAK,MACH,IAAI,UAAU,MACZ,OAAO,EAAE,MAAM,WAAoB;SAEnC,OAAO;KAAE,MAAM;KAAe,OAAO,OAAO,QAAQ;IAAK;IAE7D,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK,eACH,OAAO;KAAE,MAAM;KAAK,OAAO,OAAO;IAAK;IACzC,KAAK,cACH,OAAO;KAAE,MAAM;KAA2B,OAAO,OAAO;IAAK;IAC/D,KAAK,cACH,OAAO;KAAE,MAAM;KAA8B,OAAO,OAAO;IAAK;IAClE,KAAK,UACH,OAAO;KAAE,MAAM;KAAkB,OAAO,SAAS,OAAO,IAAI;IAAE;IAChE,KAAK,WACH,OAAO;KAAE,MAAM;KAAK,OAAO,OAAO;IAAK;IACzC,SACE,MAAM,IAAI,MAAM,gCAAgC,KAAK;GACzD;EACF,CAAC,CAAC,CACD,OAAO,SAAS;CAEvB,OAEE,OAAO,CAAC;EAAE,MAAM;EAAM,OAAO;CAAO,CAAC;AAEzC;;AAGA,SAAgB,QAAQ,QAAgB,QAAwD;CAM9F,QAAQ,OAAO,MAAf;EACE,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;GACH,OAAO,QAAQ,OAAO,QAAQ,OAAO,KAAK;GAC1C,OAAO;EACT,KAAK;GACH,IAAI,OAAO,SAET,OAAO;IAAE,MAAM;IAAY,OAAO,OAAO,QAAQ,OAAO,KAAK;GAAE;QAE/D,OAAO,QAAQ,OAAO,MAAM,KAAK,MAAM,OAAO,QAAQ,CAAC,CAAC;GAE1D,OAAO;EACT,KAAK;GACH,IAAI,OAAO,SAET,MAAM,IAAI,MAAM,wDAAwD;QAExE,OAAO,QAAQ,OAAO,MAAM,KAAK,MAAM,OAAO,QAAQ,CAAC,CAAC;GAE1D,OAAO;EACT,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;GAEH,IAAI,EADqB,OAAO,WAAW,OAAO,WAAW,UAE3D,MAAM,IAAI,MAAM,GAAG,OAAO,KAAK,+CAA+C;GAEhF,IAAI,OAAO,SACT,OAAO,QAAQ,OAAO,QAAQ,OAAO,KAAK;GAI5C,OAAO;EACT,KAAK;GACH,OAAO,QAAQ,CAAC,OAAO,QAAQ,OAAO,MAAM,EAAE,GAAG,OAAO,QAAQ,OAAO,MAAM,EAAE,CAAC;GAChF,OAAO;EACT,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK,qBACH,OAAO;EACT,SACE,MAAM,YAAY,MAAM;CAC5B;AACF;;AAGA,SAAgB,SAAS,QAA8B;CACrD,OAAO,SAAS,IAAI,OAAO,QAAQ,QAAQ,GAAG,EAAE,KAAK,KAAA;AACvD;;AAGA,SAAS,uBAAuB,KAAc,OAAyB;CACrE,IAAI,UAAU,KAAA,GAAW,OAAO;CAChC,OAAO,UAAU,SAAS,QAAQ,QAAQ,QAAQ;AACpD;;;;;;;;;AAUA,SAAS,UAAU,OAAwB;CACzC,OAAO,MAAM,kBAAkB,KAAA;AACjC"}