prisma-ltree 0.5.0 → 0.7.0

package/dist/{descriptor-meta-2In8FI1I.mjs → descriptor-meta-DwbFei9y.mjs}

@@ -1,9 +1,10 @@
 import { i as LTREE_MAX_LABEL_LENGTH, n as LTREE_CODEC_ID, r as LTREE_MAX_LABELS, t as LTREE_ARRAY_CODEC_ID } from "./constants-Dfknw-h5.mjs";
 import { buildOperation, codecOf, toExpr } from "@prisma/orm-family-sql/relational-core/expression";
+import { CodecImpl, refuseJsonValue } from "@prisma/orm-framework/components/codec";
 import { sqlDataType } from "@prisma/orm-family-sql/contract/data-type";
 import { pgText } from "@prisma/orm-target-postgres/target/data-types";
 import { buildCodecDescriptorRegistry } from "@prisma/orm-family-sql/relational-core/codec-descriptor-registry";
-import { CodecImpl } from "@prisma/orm-framework/components/codec";
+import { CastExpr } from "@prisma/orm-family-sql/relational-core/ast";
 import { PostgresCodecDescriptor, definePostgresCodecs } from "@prisma/orm-target-postgres/target/codec-descriptor";
 //#region src/core/authoring.ts
 const ltreeAuthoringTypes = { ltree: {
@@ -19,8 +20,32 @@ const ltreeAuthoringTypes = { ltree: {
 	}
 } };
 //#endregion
+//#region src/core/codecs-validation.ts
+const LABEL_PATTERN = /^[A-Za-z0-9_-]+$/;
+function assertValidLtree(value) {
+	if (typeof value !== "string") throw new Error("ltree value must be a string");
+	if (value.length === 0) throw new Error("ltree value must not be empty");
+	const labels = value.split(".");
+	if (labels.length > 65535) throw new Error(`ltree path exceeds max labels: got ${labels.length}, max ${LTREE_MAX_LABELS}`);
+	for (const label of labels) {
+		if (label.length === 0) throw new Error(`ltree label must not be empty in path "${value}"`);
+		if (label.length > 1e3) throw new Error(`ltree label exceeds max length: got ${label.length}, max ${LTREE_MAX_LABEL_LENGTH}`);
+		if (!LABEL_PATTERN.test(label)) throw new Error(`ltree label "${label}" contains invalid characters; allowed: alphanumeric, underscore, hyphen`);
+	}
+}
+//#endregion
 //#region src/core/data-types.ts
+const readLtree = (json) => {
+	if (typeof json !== "string") return refuseJsonValue("ltree/ltree", "an ltree path string", json);
+	try {
+		assertValidLtree(json);
+	} catch {
+		return refuseJsonValue("ltree/ltree", "a valid ltree path string", json);
+	}
+	return json;
+};
 const ltreeDataType = sqlDataType("ltree/ltree", {
+	read: readLtree,
 	texts: [{
 		text: "ltree",
 		written: true,
@@ -28,15 +53,31 @@ const ltreeDataType = sqlDataType("ltree/ltree", {
 	}],
 	casts: { [pgText.id]: (value) => value }
 });
+const readLtreeArray = (json) => {
+	const expected = "an array of ltree path strings";
+	if (!Array.isArray(json)) return refuseJsonValue("ltree/ltree-array", expected, json);
+	for (const entry of json) {
+		if (typeof entry !== "string") return refuseJsonValue("ltree/ltree-array", expected, entry);
+		try {
+			assertValidLtree(entry);
+		} catch {
+			return refuseJsonValue("ltree/ltree-array", expected, entry);
+		}
+	}
+	return json;
+};
 /**
 * `sqlDataType` accepts parentheses in a type name and refuses square brackets.
 * PostgreSQL writes this type as `ltree[]`, and `format_type` reports `ltree[]`.
 * Declare the type first, then set that text so a migration and a catalog check use it.
 */
-const ltreeArrayDeclared = sqlDataType("ltree/ltree-array", { listCast: {
-	of: [pgText.id],
-	cast: (elements) => [...elements]
-} });
+const ltreeArrayDeclared = sqlDataType("ltree/ltree-array", {
+	read: readLtreeArray,
+	listCast: {
+		of: [pgText.id],
+		cast: (elements) => [...elements]
+	}
+});
 const ltreeArrayDataType = {
 	...ltreeArrayDeclared,
 	sql: {
@@ -50,39 +91,265 @@ const ltreeArrayDataType = {
 };
 const ltreeDataTypes = [ltreeDataType, ltreeArrayDataType];
 //#endregion
-//#region src/core/codecs.ts
-const LABEL_PATTERN = /^[A-Za-z0-9_-]+$/;
-function assertValidLtree(value) {
-	if (typeof value !== "string") throw new Error("ltree value must be a string");
-	if (value.length === 0) throw new Error("ltree value must not be empty");
-	const labels = value.split(".");
-	if (labels.length > 65535) throw new Error(`ltree path exceeds max labels: got ${labels.length}, max ${LTREE_MAX_LABELS}`);
-	for (const label of labels) {
-		if (label.length === 0) throw new Error(`ltree label must not be empty in path "${value}"`);
-		if (label.length > 1e3) throw new Error(`ltree label exceeds max length: got ${label.length}, max ${LTREE_MAX_LABEL_LENGTH}`);
-		if (!LABEL_PATTERN.test(label)) throw new Error(`ltree label "${label}" contains invalid characters; allowed: alphanumeric, underscore, hyphen`);
+//#region src/core/pattern-validation.ts
+/**
+* Lightweight structural checks for PostgreSQL `lquery` / `ltxtquery` pattern
+* arguments. These catch empty values, empty path segments, unbalanced
+* operators/parentheses, and obviously illegal syntax before the value is cast
+* in SQL — without inventing framework PN-* error codes.
+*
+* Label bodies intentionally allow Unicode letters/numbers (`\p{L}` / `\p{N}`)
+* plus `_` / `-` so locale-dependent labels that Postgres accepts are not
+* rejected here. Full Postgres parsing still happens at the database.
+*/
+/** Word body chars: locale letters/digits, underscore, hyphen. */
+const WORD_CHAR = /[\p{L}\p{N}_-]/u;
+function isWordChar(ch) {
+	return WORD_CHAR.test(ch);
+}
+function isDigit(ch) {
+	return ch >= "0" && ch <= "9";
+}
+function fail(kind, message, value) {
+	throw new Error(`${kind} ${message}: "${value}"`);
+}
+/**
+* Parse an optional `{n}`, `{n,}`, `{,m}`, `{n,m}`, or `{,}` quantifier starting
+* at `i`. Returns the index after the closing `}`, or `i` when no quantifier
+* begins here. Throws on a malformed `{...}`.
+*/
+function consumeQuantifier(kind, value, i, allow) {
+	if (value[i] !== "{") return i;
+	if (!allow) fail(kind, `syntax error at character ${i + 1}`, value);
+	let j = i + 1;
+	let low;
+	let high;
+	let sawComma = false;
+	const readNumber = () => {
+		if (j >= value.length || !isDigit(value[j])) return void 0;
+		const start = j;
+		while (j < value.length && isDigit(value[j])) j += 1;
+		return Number(value.slice(start, j));
+	};
+	low = readNumber();
+	if (j < value.length && value[j] === ",") {
+		sawComma = true;
+		j += 1;
+		high = readNumber();
+	}
+	if (j >= value.length || value[j] !== "}") fail(kind, `syntax error at character ${i + 1}`, value);
+	j += 1;
+	if (low === void 0 && high === void 0 && !sawComma) fail(kind, `syntax error at character ${i + 1}`, value);
+	if (low !== void 0 && high !== void 0 && low > high) fail(kind, "syntax error (quantifier low > high)", value);
+	return j;
+}
+/** Consume `@` / `*` / `%` modifiers that follow a non-star word. */
+function consumeModifiers(value, i) {
+	while (i < value.length) {
+		const ch = value[i];
+		if (ch === "@" || ch === "*" || ch === "%") {
+			i += 1;
+			continue;
+		}
+		break;
+	}
+	return i;
+}
+function consumeWord(kind, value, i) {
+	if (i >= value.length || !isWordChar(value[i])) fail(kind, `syntax error at character ${i + 1}`, value);
+	let j = i;
+	while (j < value.length && isWordChar(value[j])) j += 1;
+	return j;
+}
+/**
+* One lquery level: either `*` + optional quantifier, or an optional `!`
+* followed by `word mods? (| word mods?)*` and an optional trailing quantifier.
+*/
+function consumeLqueryLevel(value, i) {
+	if (value[i] === "*") return consumeQuantifier("lquery", value, i + 1, true);
+	let j = i;
+	if (value[j] === "!") j += 1;
+	j = consumeWord("lquery", value, j);
+	j = consumeModifiers(value, j);
+	while (j < value.length && value[j] === "|") {
+		j += 1;
+		j = consumeWord("lquery", value, j);
+		j = consumeModifiers(value, j);
 	}
+	return consumeQuantifier("lquery", value, j, true);
 }
+function assertValidLquery(value) {
+	if (typeof value !== "string") throw new Error("lquery pattern must be a string");
+	if (value.length === 0) throw new Error("lquery pattern must not be empty: \"\"");
+	let i = 0;
+	i = consumeLqueryLevel(value, i);
+	while (i < value.length) {
+		if (value[i] !== ".") fail("lquery", `syntax error at character ${i + 1}`, value);
+		i += 1;
+		if (i >= value.length) fail("lquery", "syntax error (trailing '.' / empty label)", value);
+		i = consumeLqueryLevel(value, i);
+	}
+}
+function assertValidLqueryArray(value) {
+	if (!Array.isArray(value)) throw new Error("lquery[] patterns must be a string array");
+	for (let index = 0; index < value.length; index += 1) {
+		const entry = value[index];
+		try {
+			assertValidLquery(entry);
+		} catch (error) {
+			const message = error instanceof Error ? error.message : String(error);
+			throw new Error(`lquery[] patterns[${index}]: ${message}`);
+		}
+	}
+}
+function tokenizeLtxtquery(value) {
+	const tokens = [];
+	let i = 0;
+	while (i < value.length) {
+		const ch = value[i];
+		if (ch === " " || ch === "	" || ch === "\n" || ch === "\r") {
+			i += 1;
+			continue;
+		}
+		if (ch === "&") {
+			tokens.push({ kind: "and" });
+			i += 1;
+			continue;
+		}
+		if (ch === "|") {
+			tokens.push({ kind: "or" });
+			i += 1;
+			continue;
+		}
+		if (ch === "!") {
+			tokens.push({ kind: "not" });
+			i += 1;
+			continue;
+		}
+		if (ch === "(") {
+			tokens.push({ kind: "lparen" });
+			i += 1;
+			continue;
+		}
+		if (ch === ")") {
+			tokens.push({ kind: "rparen" });
+			i += 1;
+			continue;
+		}
+		if (isWordChar(ch)) {
+			const start = i;
+			i = consumeWord("ltxtquery", value, i);
+			i = consumeModifiers(value, i);
+			tokens.push({
+				kind: "word",
+				text: value.slice(start, i)
+			});
+			continue;
+		}
+		fail("ltxtquery", `syntax error at character ${i + 1}`, value);
+	}
+	return tokens;
+}
+/**
+* Recursive-descent check mirroring Postgres ltxtquery operator precedence:
+* OR < AND < NOT < primary (word / parenthesized expr).
+*/
+function parseLtxtExpr(tokens, value) {
+	let pos = 0;
+	const peek = () => tokens[pos];
+	const take = () => {
+		const tok = tokens[pos];
+		if (!tok) fail("ltxtquery", "syntax error (unexpected end)", value);
+		pos += 1;
+		return tok;
+	};
+	const parsePrimary = () => {
+		const tok = peek();
+		if (!tok) fail("ltxtquery", "syntax error (missing operand)", value);
+		if (tok.kind === "word") {
+			take();
+			return;
+		}
+		if (tok.kind === "lparen") {
+			take();
+			parseOr();
+			if (take().kind !== "rparen") fail("ltxtquery", "syntax error (expected ')')", value);
+			return;
+		}
+		fail("ltxtquery", "syntax error (missing operand)", value);
+	};
+	const parseFactor = () => {
+		while (peek()?.kind === "not") take();
+		parsePrimary();
+	};
+	const parseAnd = () => {
+		parseFactor();
+		while (peek()?.kind === "and") {
+			take();
+			parseFactor();
+		}
+	};
+	const parseOr = () => {
+		parseAnd();
+		while (peek()?.kind === "or") {
+			take();
+			parseAnd();
+		}
+	};
+	parseOr();
+	if (pos !== tokens.length) fail("ltxtquery", "syntax error (unexpected token)", value);
+}
+function assertValidLtxtquery(value) {
+	if (typeof value !== "string") throw new Error("ltxtquery query must be a string");
+	if (value.length === 0) throw new Error("ltxtquery query must not be empty: \"\"");
+	const tokens = tokenizeLtxtquery(value);
+	if (tokens.length === 0) fail("ltxtquery", "syntax error (missing operand)", value);
+	parseLtxtExpr(tokens, value);
+}
+/**
+* Validate a pattern argument when the caller passed a raw JS value. Expression
+* / ParamRef objects are left alone so dynamic binds still round-trip to
+* Postgres (which remains the authority for those).
+*/
+function assertPatternArg(castType, arg) {
+	if (arg !== null && typeof arg === "object" && !Array.isArray(arg)) return;
+	switch (castType) {
+		case "lquery":
+			assertValidLquery(arg);
+			return;
+		case "ltxtquery":
+			assertValidLtxtquery(arg);
+			return;
+		case "lquery[]":
+			assertValidLqueryArray(arg);
+			return;
+	}
+}
+//#endregion
+//#region src/core/codecs.ts
 var LtreeCodec = class extends CodecImpl {
-	async encode(value, _ctx) {
+	constructor(descriptor) {
+		super(descriptor, ltreeDataType);
+	}
+	async toWire(value, _ctx) {
 		assertValidLtree(value);
 		return value;
 	}
-	async decode(wire, _ctx) {
+	async fromWire(wire, _ctx) {
 		return wire;
 	}
-	encodeJson(value) {
+	toDataTypeValue(value) {
 		assertValidLtree(value);
-		return value;
+		return this.dataTypeValueOf(value);
 	}
-	decodeJson(json) {
-		assertValidLtree(json);
-		return json;
+	fromDataTypeValue(value) {
+		return value.value;
 	}
 };
 var LtreeDescriptor = class extends PostgresCodecDescriptor {
+	jsonType = "string";
 	jsonProjection(expression) {
-		return expression;
+		return CastExpr.as(expression, "text");
 	}
 	dataType = ltreeDataType.id;
 	codecId = LTREE_CODEC_ID;
@@ -98,26 +365,28 @@ var LtreeDescriptor = class extends PostgresCodecDescriptor {
 };
 const ltreeDescriptor = new LtreeDescriptor();
 var LtreeArrayCodec = class extends CodecImpl {
-	async encode(value, _ctx) {
+	constructor(descriptor) {
+		super(descriptor, ltreeArrayDataType);
+	}
+	async toWire(value, _ctx) {
 		for (const entry of value) assertValidLtree(entry);
 		return value;
 	}
-	async decode(wire, _ctx) {
+	async fromWire(wire, _ctx) {
 		return wire;
 	}
-	encodeJson(value) {
+	toDataTypeValue(value) {
 		for (const entry of value) assertValidLtree(entry);
-		return [...value];
+		return this.dataTypeValueOf([...value]);
 	}
-	decodeJson(json) {
+	fromDataTypeValue(value) {
+		const json = value.value;
 		if (!Array.isArray(json)) return [];
-		return json.map((entry) => {
-			assertValidLtree(entry);
-			return String(entry);
-		});
+		return json.map((entry) => String(entry));
 	}
 };
 var LtreeArrayDescriptor = class extends PostgresCodecDescriptor {
+	jsonType = "array";
 	jsonProjection(expression) {
 		return expression;
 	}
@@ -193,6 +462,7 @@ function ltreeQueryOperations() {
 		});
 	};
 	const patternOp = (method, operator, castType, self, arg, many = false) => {
+		assertPatternArg(castType, arg);
 		return buildOperation({
 			method,
 			args: [toExpr(self, codecOf(self)), toExpr(arg, many ? {
@@ -215,7 +485,24 @@ function ltreeQueryOperations() {
 			template
 		}
 	});
+	const arrayBoolOp = (method, operator, self, arg, argCodecId, castType, many = false) => {
+		if (castType) assertPatternArg(castType, arg);
+		const template = castType ? `{{self}} ${operator} ({{arg0}})::${castType}` : `{{self}} ${operator} {{arg0}}`;
+		return buildOperation({
+			method,
+			args: [toExpr(self, codecOf(self)), toExpr(arg, many ? {
+				codecId: argCodecId,
+				many: true
+			} : { codecId: argCodecId })],
+			returns: BOOL_RETURN,
+			lowering: {
+				targetFamily: "sql",
+				template
+			}
+		});
+	};
 	const firstMatchOp = (method, operator, self, arg, argCodecId, castType) => {
+		if (castType) assertPatternArg(castType, arg);
 		const selfCodec = codecOf(self);
 		const template = castType ? `{{self}} ${operator} ({{arg0}})::${castType}` : `{{self}} ${operator} {{arg0}}`;
 		return buildOperation({
@@ -326,6 +613,26 @@ function ltreeQueryOperations() {
 			self: { codecId: LTREE_ARRAY_CODEC_ID },
 			impl: (self, query) => firstMatchOp("firstMatchLtxtquery", "?@", self, query, TEXT_CODEC_ID, "ltxtquery")
 		},
+		containsAncestorOf: {
+			self: { codecId: LTREE_ARRAY_CODEC_ID },
+			impl: (self, other) => arrayBoolOp("containsAncestorOf", "@>", self, other, LTREE_CODEC_ID)
+		},
+		containsDescendantOf: {
+			self: { codecId: LTREE_ARRAY_CODEC_ID },
+			impl: (self, other) => arrayBoolOp("containsDescendantOf", "<@", self, other, LTREE_CODEC_ID)
+		},
+		matchesAnyLquery: {
+			self: { codecId: LTREE_ARRAY_CODEC_ID },
+			impl: (self, pattern) => arrayBoolOp("matchesAnyLquery", "~", self, pattern, TEXT_CODEC_ID, "lquery")
+		},
+		matchesAnyLqueryArray: {
+			self: { codecId: LTREE_ARRAY_CODEC_ID },
+			impl: (self, patterns) => arrayBoolOp("matchesAnyLqueryArray", "?", self, patterns, TEXT_CODEC_ID, "lquery[]", true)
+		},
+		matchesAnyLtxtquery: {
+			self: { codecId: LTREE_ARRAY_CODEC_ID },
+			impl: (self, query) => arrayBoolOp("matchesAnyLtxtquery", "@", self, query, TEXT_CODEC_ID, "ltxtquery")
+		},
 		lcaAll: {
 			self: { codecId: LTREE_ARRAY_CODEC_ID },
 			impl: (self) => funcOp("lcaAll", "lca", LTREE_RETURN, [toExpr(self, codecOf(self))])
@@ -365,4 +672,4 @@ const ltreePackMeta = {
 //#endregion
 export { ltreeQueryOperations as n, ltreeCodecRegistry as r, ltreePackMeta as t };
 
-//# sourceMappingURL=descriptor-meta-2In8FI1I.mjs.map
+//# sourceMappingURL=descriptor-meta-DwbFei9y.mjs.map

package/dist/descriptor-meta-DwbFei9y.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"descriptor-meta-DwbFei9y.mjs","names":[],"sources":["../src/core/authoring.ts","../src/core/codecs-validation.ts","../src/core/data-types.ts","../src/core/pattern-validation.ts","../src/core/codecs.ts","../src/core/registry.ts","../src/core/descriptor-meta.ts"],"sourcesContent":["import type { AuthoringTypeNamespace } from \"@prisma/orm-framework/components/authoring\";\nimport { LTREE_ARRAY_CODEC_ID, LTREE_CODEC_ID } from \"./constants\";\n\nexport const ltreeAuthoringTypes = {\n  ltree: {\n    Ltree: {\n      kind: \"typeConstructor\",\n      inferred: true,\n      output: {\n        codecId: LTREE_CODEC_ID,\n      },\n    },\n    LtreeArray: {\n      kind: \"typeConstructor\",\n      inferred: true,\n      output: {\n        codecId: LTREE_ARRAY_CODEC_ID,\n      },\n    },\n  },\n} as const satisfies AuthoringTypeNamespace;\n","import { LTREE_MAX_LABEL_LENGTH, LTREE_MAX_LABELS } from \"./constants\";\n\nconst LABEL_PATTERN = /^[A-Za-z0-9_-]+$/;\n\nexport function assertValidLtree(value: unknown): asserts value is string {\n  if (typeof value !== \"string\") {\n    throw new Error(\"ltree value must be a string\");\n  }\n  if (value.length === 0) {\n    throw new Error(\"ltree value must not be empty\");\n  }\n  const labels = value.split(\".\");\n  if (labels.length > LTREE_MAX_LABELS) {\n    throw new Error(`ltree path exceeds max labels: got ${labels.length}, max ${LTREE_MAX_LABELS}`);\n  }\n  for (const label of labels) {\n    if (label.length === 0) {\n      throw new Error(`ltree label must not be empty in path \"${value}\"`);\n    }\n    if (label.length > LTREE_MAX_LABEL_LENGTH) {\n      throw new Error(\n        `ltree label exceeds max length: got ${label.length}, max ${LTREE_MAX_LABEL_LENGTH}`,\n      );\n    }\n    if (!LABEL_PATTERN.test(label)) {\n      throw new Error(\n        `ltree label \"${label}\" contains invalid characters; allowed: alphanumeric, underscore, hyphen`,\n      );\n    }\n  }\n}\n","/**\n * Data types this extension owns.\n *\n * `ltree` and `ltree[]` are PostgreSQL types the target does not register.\n * A path's stored form is its label text. An array's stored form is a\n * JSON array of those texts. Both accept text the contract can already write.\n * The texts are what a migration writes and what the catalog reports.\n */\n\nimport type { DataType, DataTypeReader } from \"@prisma/orm-framework/components/codec\";\nimport { refuseJsonValue } from \"@prisma/orm-framework/components/codec\";\nimport { sqlDataType } from \"@prisma/orm-family-sql/contract/data-type\";\nimport { pgText } from \"@prisma/orm-target-postgres/target/data-types\";\nimport { assertValidLtree } from \"./codecs-validation\";\n\nconst readLtree: DataTypeReader = (json) => {\n  if (typeof json !== \"string\") {\n    return refuseJsonValue(\"ltree/ltree\", \"an ltree path string\", json);\n  }\n  try {\n    assertValidLtree(json);\n  } catch {\n    return refuseJsonValue(\"ltree/ltree\", \"a valid ltree path string\", json);\n  }\n  return json;\n};\n\nexport const ltreeDataType = sqlDataType(\"ltree/ltree\", {\n  read: readLtree,\n  texts: [{ text: \"ltree\", written: true, catalog: true }],\n  casts: {\n    [pgText.id]: (value) => value,\n  },\n});\n\nconst readLtreeArray: DataTypeReader = (json) => {\n  const expected = \"an array of ltree path strings\";\n  if (!Array.isArray(json)) {\n    return refuseJsonValue(\"ltree/ltree-array\", expected, json);\n  }\n  for (const entry of json) {\n    if (typeof entry !== \"string\") {\n      return refuseJsonValue(\"ltree/ltree-array\", expected, entry);\n    }\n    try {\n      assertValidLtree(entry);\n    } catch {\n      return refuseJsonValue(\"ltree/ltree-array\", expected, entry);\n    }\n  }\n  return json;\n};\n\n/**\n * `sqlDataType` accepts parentheses in a type name and refuses square brackets.\n * PostgreSQL writes this type as `ltree[]`, and `format_type` reports `ltree[]`.\n * Declare the type first, then set that text so a migration and a catalog check use it.\n */\nconst ltreeArrayDeclared = sqlDataType(\"ltree/ltree-array\", {\n  read: readLtreeArray,\n  listCast: {\n    of: [pgText.id],\n    cast: (elements) => [...elements],\n  },\n});\n\nexport const ltreeArrayDataType = {\n  ...ltreeArrayDeclared,\n  sql: {\n    ...ltreeArrayDeclared.sql,\n    texts: [{ text: \"ltree[]\", written: true as const, catalog: true as const }],\n  },\n} as typeof ltreeArrayDeclared;\n\nexport const ltreeDataTypes: readonly DataType[] = [ltreeDataType, ltreeArrayDataType];\n","/**\n * Lightweight structural checks for PostgreSQL `lquery` / `ltxtquery` pattern\n * arguments. These catch empty values, empty path segments, unbalanced\n * operators/parentheses, and obviously illegal syntax before the value is cast\n * in SQL — without inventing framework PN-* error codes.\n *\n * Label bodies intentionally allow Unicode letters/numbers (`\\p{L}` / `\\p{N}`)\n * plus `_` / `-` so locale-dependent labels that Postgres accepts are not\n * rejected here. Full Postgres parsing still happens at the database.\n */\n\n/** Word body chars: locale letters/digits, underscore, hyphen. */\nconst WORD_CHAR = /[\\p{L}\\p{N}_-]/u;\n\nfunction isWordChar(ch: string): boolean {\n  return WORD_CHAR.test(ch);\n}\n\nfunction isDigit(ch: string): boolean {\n  return ch >= \"0\" && ch <= \"9\";\n}\n\nfunction fail(kind: \"lquery\" | \"ltxtquery\", message: string, value: string): never {\n  throw new Error(`${kind} ${message}: \"${value}\"`);\n}\n\n/**\n * Parse an optional `{n}`, `{n,}`, `{,m}`, `{n,m}`, or `{,}` quantifier starting\n * at `i`. Returns the index after the closing `}`, or `i` when no quantifier\n * begins here. Throws on a malformed `{...}`.\n */\nfunction consumeQuantifier(\n  kind: \"lquery\" | \"ltxtquery\",\n  value: string,\n  i: number,\n  allow: boolean,\n): number {\n  if (value[i] !== \"{\") return i;\n  if (!allow) {\n    fail(kind, `syntax error at character ${i + 1}`, value);\n  }\n  let j = i + 1;\n  let low: number | undefined;\n  let high: number | undefined;\n  let sawComma = false;\n\n  const readNumber = (): number | undefined => {\n    if (j >= value.length || !isDigit(value[j]!)) return undefined;\n    const start = j;\n    while (j < value.length && isDigit(value[j]!)) j += 1;\n    return Number(value.slice(start, j));\n  };\n\n  low = readNumber();\n  if (j < value.length && value[j] === \",\") {\n    sawComma = true;\n    j += 1;\n    high = readNumber();\n  }\n  if (j >= value.length || value[j] !== \"}\") {\n    fail(kind, `syntax error at character ${i + 1}`, value);\n  }\n  j += 1;\n\n  // `{}` is invalid; `{,}` (both ends open) is valid in Postgres.\n  if (low === undefined && high === undefined && !sawComma) {\n    fail(kind, `syntax error at character ${i + 1}`, value);\n  }\n  if (low !== undefined && high !== undefined && low > high) {\n    fail(kind, \"syntax error (quantifier low > high)\", value);\n  }\n  return j;\n}\n\n/** Consume `@` / `*` / `%` modifiers that follow a non-star word. */\nfunction consumeModifiers(value: string, i: number): number {\n  while (i < value.length) {\n    const ch = value[i]!;\n    if (ch === \"@\" || ch === \"*\" || ch === \"%\") {\n      i += 1;\n      continue;\n    }\n    break;\n  }\n  return i;\n}\n\nfunction consumeWord(kind: \"lquery\" | \"ltxtquery\", value: string, i: number): number {\n  if (i >= value.length || !isWordChar(value[i]!)) {\n    fail(kind, `syntax error at character ${i + 1}`, value);\n  }\n  let j = i;\n  while (j < value.length && isWordChar(value[j]!)) j += 1;\n  return j;\n}\n\n/**\n * One lquery level: either `*` + optional quantifier, or an optional `!`\n * followed by `word mods? (| word mods?)*` and an optional trailing quantifier.\n */\nfunction consumeLqueryLevel(value: string, i: number): number {\n  if (value[i] === \"*\") {\n    // Star wildcards cannot take `@`/`%` modifiers; only an optional quantifier.\n    return consumeQuantifier(\"lquery\", value, i + 1, true);\n  }\n\n  let j = i;\n  if (value[j] === \"!\") {\n    j += 1;\n  }\n\n  j = consumeWord(\"lquery\", value, j);\n  j = consumeModifiers(value, j);\n\n  while (j < value.length && value[j] === \"|\") {\n    j += 1;\n    j = consumeWord(\"lquery\", value, j);\n    j = consumeModifiers(value, j);\n  }\n\n  return consumeQuantifier(\"lquery\", value, j, true);\n}\n\nexport function assertValidLquery(value: unknown): asserts value is string {\n  if (typeof value !== \"string\") {\n    throw new Error(\"lquery pattern must be a string\");\n  }\n  if (value.length === 0) {\n    throw new Error('lquery pattern must not be empty: \"\"');\n  }\n\n  let i = 0;\n  i = consumeLqueryLevel(value, i);\n  while (i < value.length) {\n    if (value[i] !== \".\") {\n      fail(\"lquery\", `syntax error at character ${i + 1}`, value);\n    }\n    i += 1;\n    if (i >= value.length) {\n      fail(\"lquery\", \"syntax error (trailing '.' / empty label)\", value);\n    }\n    i = consumeLqueryLevel(value, i);\n  }\n}\n\nexport function assertValidLqueryArray(value: unknown): asserts value is readonly string[] {\n  if (!Array.isArray(value)) {\n    throw new Error(\"lquery[] patterns must be a string array\");\n  }\n  for (let index = 0; index < value.length; index += 1) {\n    const entry = value[index];\n    try {\n      assertValidLquery(entry);\n    } catch (error) {\n      const message = error instanceof Error ? error.message : String(error);\n      throw new Error(`lquery[] patterns[${index}]: ${message}`);\n    }\n  }\n}\n\ntype LtxtToken =\n  | { readonly kind: \"word\"; readonly text: string }\n  | { readonly kind: \"and\" }\n  | { readonly kind: \"or\" }\n  | { readonly kind: \"not\" }\n  | { readonly kind: \"lparen\" }\n  | { readonly kind: \"rparen\" };\n\nfunction tokenizeLtxtquery(value: string): LtxtToken[] {\n  const tokens: LtxtToken[] = [];\n  let i = 0;\n  while (i < value.length) {\n    const ch = value[i]!;\n    if (ch === \" \" || ch === \"\\t\" || ch === \"\\n\" || ch === \"\\r\") {\n      i += 1;\n      continue;\n    }\n    if (ch === \"&\") {\n      tokens.push({ kind: \"and\" });\n      i += 1;\n      continue;\n    }\n    if (ch === \"|\") {\n      tokens.push({ kind: \"or\" });\n      i += 1;\n      continue;\n    }\n    if (ch === \"!\") {\n      tokens.push({ kind: \"not\" });\n      i += 1;\n      continue;\n    }\n    if (ch === \"(\") {\n      tokens.push({ kind: \"lparen\" });\n      i += 1;\n      continue;\n    }\n    if (ch === \")\") {\n      tokens.push({ kind: \"rparen\" });\n      i += 1;\n      continue;\n    }\n    if (isWordChar(ch)) {\n      const start = i;\n      i = consumeWord(\"ltxtquery\", value, i);\n      i = consumeModifiers(value, i);\n      tokens.push({ kind: \"word\", text: value.slice(start, i) });\n      continue;\n    }\n    fail(\"ltxtquery\", `syntax error at character ${i + 1}`, value);\n  }\n  return tokens;\n}\n\n/**\n * Recursive-descent check mirroring Postgres ltxtquery operator precedence:\n * OR < AND < NOT < primary (word / parenthesized expr).\n */\nfunction parseLtxtExpr(tokens: readonly LtxtToken[], value: string): void {\n  let pos = 0;\n\n  const peek = (): LtxtToken | undefined => tokens[pos];\n  const take = (): LtxtToken => {\n    const tok = tokens[pos];\n    if (!tok) fail(\"ltxtquery\", \"syntax error (unexpected end)\", value);\n    pos += 1;\n    return tok;\n  };\n\n  const parsePrimary = (): void => {\n    const tok = peek();\n    if (!tok) fail(\"ltxtquery\", \"syntax error (missing operand)\", value);\n    if (tok.kind === \"word\") {\n      take();\n      return;\n    }\n    if (tok.kind === \"lparen\") {\n      take();\n      parseOr();\n      const close = take();\n      if (close.kind !== \"rparen\") {\n        fail(\"ltxtquery\", \"syntax error (expected ')')\", value);\n      }\n      return;\n    }\n    fail(\"ltxtquery\", \"syntax error (missing operand)\", value);\n  };\n\n  const parseFactor = (): void => {\n    while (peek()?.kind === \"not\") take();\n    parsePrimary();\n  };\n\n  const parseAnd = (): void => {\n    parseFactor();\n    while (peek()?.kind === \"and\") {\n      take();\n      parseFactor();\n    }\n  };\n\n  const parseOr = (): void => {\n    parseAnd();\n    while (peek()?.kind === \"or\") {\n      take();\n      parseAnd();\n    }\n  };\n\n  parseOr();\n  if (pos !== tokens.length) {\n    fail(\"ltxtquery\", \"syntax error (unexpected token)\", value);\n  }\n}\n\nexport function assertValidLtxtquery(value: unknown): asserts value is string {\n  if (typeof value !== \"string\") {\n    throw new Error(\"ltxtquery query must be a string\");\n  }\n  if (value.length === 0) {\n    throw new Error('ltxtquery query must not be empty: \"\"');\n  }\n  const tokens = tokenizeLtxtquery(value);\n  if (tokens.length === 0) {\n    fail(\"ltxtquery\", \"syntax error (missing operand)\", value);\n  }\n  parseLtxtExpr(tokens, value);\n}\n\n/**\n * Validate a pattern argument when the caller passed a raw JS value. Expression\n * / ParamRef objects are left alone so dynamic binds still round-trip to\n * Postgres (which remains the authority for those).\n */\nexport function assertPatternArg(\n  castType: \"lquery\" | \"ltxtquery\" | \"lquery[]\",\n  arg: unknown,\n): void {\n  if (arg !== null && typeof arg === \"object\" && !Array.isArray(arg)) {\n    return;\n  }\n  switch (castType) {\n    case \"lquery\":\n      assertValidLquery(arg);\n      return;\n    case \"ltxtquery\":\n      assertValidLtxtquery(arg);\n      return;\n    case \"lquery[]\":\n      assertValidLqueryArray(arg);\n      return;\n  }\n}\n","import {\n  type AnyCodecDescriptor,\n  type CodecCallContext,\n  CodecImpl,\n  type CodecInstanceContext,\n  type ColumnHelperFor,\n  type ColumnHelperForStrict,\n  column,\n  type DataTypeValue,\n} from \"@prisma/orm-framework/components/codec\";\nimport type { ExtractCodecTypes, ProjectionExpr } from \"@prisma/orm-family-sql/relational-core/ast\";\nimport { CastExpr } from \"@prisma/orm-family-sql/relational-core/ast\";\nimport {\n  definePostgresCodecs,\n  PostgresCodecDescriptor,\n} from \"@prisma/orm-target-postgres/target/codec-descriptor\";\nimport { assertValidLtree } from \"./codecs-validation\";\nimport { LTREE_ARRAY_CODEC_ID, LTREE_CODEC_ID } from \"./constants\";\nimport { ltreeArrayDataType, ltreeDataType } from \"./data-types\";\n\nexport { assertValidLtree } from \"./codecs-validation\";\n\nexport class LtreeCodec extends CodecImpl<\n  typeof LTREE_CODEC_ID,\n  readonly [\"equality\", \"order\"],\n  string,\n  string\n> {\n  constructor(descriptor: AnyCodecDescriptor) {\n    super(descriptor, ltreeDataType);\n  }\n\n  async toWire(value: string, _ctx: CodecCallContext): Promise<string> {\n    assertValidLtree(value);\n    return value;\n  }\n\n  async fromWire(wire: string, _ctx: CodecCallContext): Promise<string> {\n    return wire;\n  }\n\n  toDataTypeValue(value: string): DataTypeValue {\n    assertValidLtree(value);\n    return this.dataTypeValueOf(value);\n  }\n\n  fromDataTypeValue(value: DataTypeValue): string {\n    return value.value as string;\n  }\n}\n\nexport class LtreeDescriptor extends PostgresCodecDescriptor<void> {\n  override readonly jsonType = \"string\" as const;\n  protected override jsonProjection(expression: ProjectionExpr): ProjectionExpr {\n    // JSON projections read through fromWire; cast so the wire value is text.\n    return CastExpr.as(expression, \"text\");\n  }\n  override readonly dataType = ltreeDataType.id;\n  override readonly codecId = LTREE_CODEC_ID;\n  override readonly traits = [\"equality\", \"order\"] as const;\n  override readonly paramsSchema = undefined;\n  override renderOutputType(): string {\n    return \"string\";\n  }\n  override factory(): (ctx: CodecInstanceContext) => LtreeCodec {\n    const shared = new LtreeCodec(this);\n    return () => shared;\n  }\n}\n\nexport const ltreeDescriptor = new LtreeDescriptor();\n\nexport const ltree = () => column(ltreeDescriptor.factory(), ltreeDescriptor.codecId, undefined);\n\nltree satisfies ColumnHelperFor<LtreeDescriptor>;\nltree satisfies ColumnHelperForStrict<LtreeDescriptor>;\n\nexport class LtreeArrayCodec extends CodecImpl<\n  typeof LTREE_ARRAY_CODEC_ID,\n  readonly [\"equality\"],\n  readonly string[],\n  readonly string[]\n> {\n  constructor(descriptor: AnyCodecDescriptor) {\n    super(descriptor, ltreeArrayDataType);\n  }\n\n  async toWire(value: readonly string[], _ctx: CodecCallContext): Promise<readonly string[]> {\n    for (const entry of value) {\n      assertValidLtree(entry);\n    }\n    return value;\n  }\n\n  async fromWire(wire: readonly string[], _ctx: CodecCallContext): Promise<readonly string[]> {\n    return wire;\n  }\n\n  toDataTypeValue(value: readonly string[]): DataTypeValue {\n    for (const entry of value) {\n      assertValidLtree(entry);\n    }\n    return this.dataTypeValueOf([...value]);\n  }\n\n  fromDataTypeValue(value: DataTypeValue): readonly string[] {\n    const json = value.value;\n    if (!Array.isArray(json)) {\n      return [];\n    }\n    return json.map((entry) => String(entry));\n  }\n}\n\nexport class LtreeArrayDescriptor extends PostgresCodecDescriptor<void> {\n  override readonly jsonType = \"array\" as const;\n  protected override jsonProjection(expression: ProjectionExpr): ProjectionExpr {\n    // ltree[] already projects as a JSON string array for fromWire.\n    return expression;\n  }\n  override readonly dataType = ltreeArrayDataType.id;\n  override readonly codecId = LTREE_ARRAY_CODEC_ID;\n  override readonly traits = [\"equality\"] as const;\n  override readonly paramsSchema = undefined;\n  override renderOutputType(): string {\n    return \"readonly string[]\";\n  }\n  override factory(): (ctx: CodecInstanceContext) => LtreeArrayCodec {\n    const shared = new LtreeArrayCodec(this);\n    return () => shared;\n  }\n}\n\nexport const ltreeArrayDescriptor = new LtreeArrayDescriptor();\n\nexport const ltreeArray = () =>\n  column(ltreeArrayDescriptor.factory(), ltreeArrayDescriptor.codecId, undefined);\n\nltreeArray satisfies ColumnHelperFor<LtreeArrayDescriptor>;\nltreeArray satisfies ColumnHelperForStrict<LtreeArrayDescriptor>;\n\nconst codecDescriptorMap = {\n  ltree: ltreeDescriptor,\n  ltreeArray: ltreeArrayDescriptor,\n} as const;\n\nexport type CodecTypes = ExtractCodecTypes<typeof codecDescriptorMap>;\n\nexport const codecDescriptors = definePostgresCodecs(Object.values(codecDescriptorMap));\n","import { buildCodecDescriptorRegistry } from \"@prisma/orm-family-sql/relational-core/codec-descriptor-registry\";\nimport type { CodecDescriptorRegistry } from \"@prisma/orm-family-sql/relational-core/query-lane-context\";\nimport { codecDescriptors } from \"./codecs\";\n\nexport const ltreeCodecRegistry: CodecDescriptorRegistry =\n  buildCodecDescriptorRegistry(codecDescriptors);\n","import type { AnyExpression } from \"@prisma/orm-family-sql/relational-core/ast\";\nimport {\n  buildOperation,\n  type CodecExpression,\n  codecOf,\n  type Expression,\n  toExpr,\n} from \"@prisma/orm-family-sql/relational-core/expression\";\nimport type { CodecTypes } from \"../types/codec-types\";\nimport type { QueryOperationTypes } from \"../types/operation-types\";\nimport { ltreeAuthoringTypes } from \"./authoring\";\nimport { LTREE_ARRAY_CODEC_ID, LTREE_CODEC_ID } from \"./constants\";\nimport { ltreeDataTypes } from \"./data-types\";\nimport { assertPatternArg } from \"./pattern-validation\";\nimport { ltreeCodecRegistry } from \"./registry\";\n\ntype CodecTypesBase = Record<string, { readonly input: unknown; readonly output: unknown }>;\n\ntype BoolReturn = Expression<{ readonly codecId: \"pg/bool@1\"; readonly nullable: false }>;\ntype LtreeReturn = Expression<{ readonly codecId: \"pg/ltree@1\"; readonly nullable: false }>;\ntype IntReturn = Expression<{ readonly codecId: \"pg/int4@1\"; readonly nullable: false }>;\ntype TextReturn = Expression<{ readonly codecId: \"pg/text@1\"; readonly nullable: false }>;\n\nconst BOOL_RETURN = { codecId: \"pg/bool@1\", nullable: false } as const;\nconst LTREE_RETURN = { codecId: \"pg/ltree@1\", nullable: false } as const;\nconst INT_RETURN = { codecId: \"pg/int4@1\", nullable: false } as const;\nconst TEXT_RETURN = { codecId: \"pg/text@1\", nullable: false } as const;\nconst TEXT_CODEC_ID = \"pg/text@1\" as const;\nconst INT_CODEC_ID = \"pg/int4@1\" as const;\n\n/**\n * Build a function-style operation whose SQL is `fnName(self, arg0, arg1, ...)`.\n * The template's placeholder count is derived from the actual argument list, so\n * one helper covers fixed-arity functions (`nlevel`, `subltree`), optional-arg\n * overloads (`subpath`, `index`), and the variadic `lca` (see ADR-001). `args`\n * already carries each value through `toExpr` with its codec; `args[0]` is the\n * `self` receiver.\n */\nfunction funcOp<C extends string>(\n  method: string,\n  fnName: string,\n  returns: { readonly codecId: C; readonly nullable: false },\n  args: readonly [AnyExpression, ...AnyExpression[]],\n): Expression<{ readonly codecId: C; readonly nullable: false }> {\n  const placeholders = args.map((_, i) => (i === 0 ? \"{{self}}\" : `{{arg${i - 1}}}`)).join(\", \");\n  return buildOperation({\n    method,\n    args,\n    returns,\n    lowering: {\n      targetFamily: \"sql\",\n      template: `${fnName}(${placeholders})`,\n    },\n  });\n}\n\nexport function ltreeQueryOperations<CT extends CodecTypesBase>(): QueryOperationTypes<CT> {\n  // Hierarchy operators compare two `ltree` values; the user argument shares the\n  // column's `pg/ltree@1` codec. Pattern-match operators take a query/pattern\n  // string (or `string[]`) that is NOT an ltree — it is bound as text and cast\n  // in-template to `lquery` / `lquery[]` / `ltxtquery`. Literal string args get a\n  // lightweight structural check first (see `pattern-validation.ts`) so empty /\n  // obviously illegal patterns fail with a clear pack error instead of an opaque\n  // Postgres cast failure; Expression / ParamRef binds still defer to Postgres.\n  const hierarchyOp = (\n    method: string,\n    operator: string,\n    self: CodecExpression<typeof LTREE_CODEC_ID, boolean, CT>,\n    other: CodecExpression<typeof LTREE_CODEC_ID, boolean, CT>,\n  ): BoolReturn => {\n    const selfCodec = codecOf(self);\n    return buildOperation({\n      method,\n      args: [toExpr(self, selfCodec), toExpr(other, selfCodec)],\n      returns: BOOL_RETURN,\n      lowering: {\n        targetFamily: \"sql\",\n        template: `{{self}} ${operator} {{arg0}}`,\n      },\n    });\n  };\n\n  const patternOp = (\n    method: string,\n    operator: string,\n    castType: \"lquery\" | \"ltxtquery\" | \"lquery[]\",\n    self: CodecExpression<typeof LTREE_CODEC_ID, boolean, CT>,\n    arg: unknown,\n    many = false,\n  ): BoolReturn => {\n    assertPatternArg(castType, arg);\n    const selfCodec = codecOf(self);\n    return buildOperation({\n      method,\n      args: [\n        toExpr(self, selfCodec),\n        toExpr(arg, many ? { codecId: TEXT_CODEC_ID, many: true } : { codecId: TEXT_CODEC_ID }),\n      ],\n      returns: BOOL_RETURN,\n      lowering: {\n        targetFamily: \"sql\",\n        template: `{{self}} ${operator} ({{arg0}})::${castType}`,\n      },\n    });\n  };\n\n  // Concatenation operators produce a new ltree. `concat` joins two ltree paths\n  // (`{{self}} || {{arg0}}`); `concatText`/`prependText` splice a text label onto\n  // the right/left. The text operand binds as `pg/text@1` and is cast in-template\n  // (PG resolves the `||` overload from the cast). `prependText` places `{{self}}`\n  // second because the ltree receiver is the RIGHT operand of `text || ltree`;\n  // `args[0]` is still `self` (the renderer binds by placeholder name, not order).\n  const concatOp = (\n    method: string,\n    template: string,\n    args: readonly [AnyExpression, ...AnyExpression[]],\n  ): LtreeReturn =>\n    buildOperation({\n      method,\n      args,\n      returns: LTREE_RETURN,\n      lowering: { targetFamily: \"sql\", template },\n    });\n\n  // Boolean operators on an `ltree[]` receiver (ADR-007). Same bind/cast rules as\n  // `firstMatchOp`, but the result is `boolean`. These are the operators\n  // `gist__ltree_ops` indexes (`<@`, `~`, `@`, `?`), plus `@>` which PostgreSQL\n  // ships and the opclass does not index.\n  const arrayBoolOp = (\n    method: string,\n    operator: string,\n    self: CodecExpression<typeof LTREE_ARRAY_CODEC_ID, boolean, CT>,\n    arg: unknown,\n    argCodecId: typeof LTREE_CODEC_ID | typeof TEXT_CODEC_ID,\n    castType?: \"lquery\" | \"ltxtquery\" | \"lquery[]\",\n    many = false,\n  ): BoolReturn => {\n    if (castType) assertPatternArg(castType, arg);\n    const template = castType\n      ? `{{self}} ${operator} ({{arg0}})::${castType}`\n      : `{{self}} ${operator} {{arg0}}`;\n    return buildOperation({\n      method,\n      args: [\n        toExpr(self, codecOf(self)),\n        toExpr(arg, many ? { codecId: argCodecId, many: true } : { codecId: argCodecId }),\n      ],\n      returns: BOOL_RETURN,\n      lowering: { targetFamily: \"sql\", template },\n    });\n  };\n\n  // Tier 3 — first-match operators on an `ltree[]` receiver (ADR-003).\n  const firstMatchOp = (\n    method: string,\n    operator: string,\n    self: CodecExpression<typeof LTREE_ARRAY_CODEC_ID, boolean, CT>,\n    arg: unknown,\n    argCodecId: typeof LTREE_CODEC_ID | typeof TEXT_CODEC_ID,\n    castType?: \"lquery\" | \"ltxtquery\",\n  ): LtreeReturn => {\n    if (castType) assertPatternArg(castType, arg);\n    const selfCodec = codecOf(self);\n    const template = castType\n      ? `{{self}} ${operator} ({{arg0}})::${castType}`\n      : `{{self}} ${operator} {{arg0}}`;\n    return buildOperation({\n      method,\n      args: [toExpr(self, selfCodec), toExpr(arg, { codecId: argCodecId })],\n      returns: LTREE_RETURN,\n      lowering: { targetFamily: \"sql\", template },\n    });\n  };\n\n  return {\n    isAncestorOf: {\n      self: { codecId: LTREE_CODEC_ID },\n      impl: (self, other) => hierarchyOp(\"isAncestorOf\", \"@>\", self, other),\n    },\n    isDescendantOf: {\n      self: { codecId: LTREE_CODEC_ID },\n      impl: (self, other) => hierarchyOp(\"isDescendantOf\", \"<@\", self, other),\n    },\n    matchesLquery: {\n      self: { codecId: LTREE_CODEC_ID },\n      impl: (self, pattern) => patternOp(\"matchesLquery\", \"~\", \"lquery\", self, pattern),\n    },\n    matchesLqueryArray: {\n      self: { codecId: LTREE_CODEC_ID },\n      impl: (self, patterns) =>\n        patternOp(\"matchesLqueryArray\", \"?\", \"lquery[]\", self, patterns, true),\n    },\n    matchesLtxtquery: {\n      self: { codecId: LTREE_CODEC_ID },\n      impl: (self, query) => patternOp(\"matchesLtxtquery\", \"@\", \"ltxtquery\", self, query),\n    },\n    nlevel: {\n      self: { codecId: LTREE_CODEC_ID },\n      impl: (self): IntReturn =>\n        funcOp(\"nlevel\", \"nlevel\", INT_RETURN, [toExpr(self, codecOf(self))]),\n    },\n    subltree: {\n      self: { codecId: LTREE_CODEC_ID },\n      impl: (self, start, end): LtreeReturn =>\n        funcOp(\"subltree\", \"subltree\", LTREE_RETURN, [\n          toExpr(self, codecOf(self)),\n          toExpr(start, { codecId: INT_CODEC_ID }),\n          toExpr(end, { codecId: INT_CODEC_ID }),\n        ]),\n    },\n    // `subpath(self, offset, len?)` — `len` omitted lowers to the 2-arg overload.\n    subpath: {\n      self: { codecId: LTREE_CODEC_ID },\n      impl: (self, offset, len): LtreeReturn => {\n        const head: readonly [AnyExpression, AnyExpression] = [\n          toExpr(self, codecOf(self)),\n          toExpr(offset, { codecId: INT_CODEC_ID }),\n        ];\n        return funcOp(\n          \"subpath\",\n          \"subpath\",\n          LTREE_RETURN,\n          len === undefined ? head : [...head, toExpr(len, { codecId: INT_CODEC_ID })],\n        );\n      },\n    },\n    // `index(self, other, offset?)` — `offset` omitted lowers to the 2-arg overload.\n    indexOf: {\n      self: { codecId: LTREE_CODEC_ID },\n      impl: (self, other, offset): IntReturn => {\n        const selfCodec = codecOf(self);\n        const head: readonly [AnyExpression, AnyExpression] = [\n          toExpr(self, selfCodec),\n          toExpr(other, selfCodec),\n        ];\n        return funcOp(\n          \"indexOf\",\n          \"index\",\n          INT_RETURN,\n          offset === undefined ? head : [...head, toExpr(offset, { codecId: INT_CODEC_ID })],\n        );\n      },\n    },\n    // `lca(self, other, ...rest)` — variadic longest-common-ancestor (ADR-001).\n    // PostgreSQL has no single-arg `lca`, so `other` is required (2–8 paths).\n    lca: {\n      self: { codecId: LTREE_CODEC_ID },\n      impl: (self, other, ...rest): LtreeReturn => {\n        const selfCodec = codecOf(self);\n        return funcOp(\"lca\", \"lca\", LTREE_RETURN, [\n          toExpr(self, selfCodec),\n          toExpr(other, selfCodec),\n          ...rest.map((p) => toExpr(p, selfCodec)),\n        ]);\n      },\n    },\n    // Tier 2 — concatenation (`||`).\n    concat: {\n      self: { codecId: LTREE_CODEC_ID },\n      impl: (self, other): LtreeReturn => {\n        const selfCodec = codecOf(self);\n        return concatOp(\"concat\", \"{{self}} || {{arg0}}\", [\n          toExpr(self, selfCodec),\n          toExpr(other, selfCodec),\n        ]);\n      },\n    },\n    concatText: {\n      self: { codecId: LTREE_CODEC_ID },\n      impl: (self, label): LtreeReturn =>\n        concatOp(\"concatText\", \"{{self}} || ({{arg0}})::text\", [\n          toExpr(self, codecOf(self)),\n          toExpr(label, { codecId: TEXT_CODEC_ID }),\n        ]),\n    },\n    // `text || ltree` — the ltree receiver is the right operand (ADR-002).\n    prependText: {\n      self: { codecId: LTREE_CODEC_ID },\n      impl: (self, prefix): LtreeReturn =>\n        concatOp(\"prependText\", \"({{arg0}})::text || {{self}}\", [\n          toExpr(self, codecOf(self)),\n          toExpr(prefix, { codecId: TEXT_CODEC_ID }),\n        ]),\n    },\n    // Tier 2 — conversion.\n    toText: {\n      self: { codecId: LTREE_CODEC_ID },\n      impl: (self): TextReturn =>\n        funcOp(\"toText\", \"ltree2text\", TEXT_RETURN, [toExpr(self, codecOf(self))]),\n    },\n    // `text2ltree(text)` — rooted on `pg/text@1` (the only reachable form of the\n    // free-function `text2ltree`; see ADR-002). Surfaces as `.toLtree()` on text.\n    toLtree: {\n      self: { codecId: TEXT_CODEC_ID },\n      impl: (self): LtreeReturn =>\n        funcOp(\"toLtree\", \"text2ltree\", LTREE_RETURN, [toExpr(self, codecOf(self))]),\n    },\n    // Tier 3 — array first-match operators (ADR-003).\n    firstAncestorOf: {\n      self: { codecId: LTREE_ARRAY_CODEC_ID },\n      impl: (self, other) => firstMatchOp(\"firstAncestorOf\", \"?@>\", self, other, LTREE_CODEC_ID),\n    },\n    firstDescendantOf: {\n      self: { codecId: LTREE_ARRAY_CODEC_ID },\n      impl: (self, other) => firstMatchOp(\"firstDescendantOf\", \"?<@\", self, other, LTREE_CODEC_ID),\n    },\n    firstMatchLquery: {\n      self: { codecId: LTREE_ARRAY_CODEC_ID },\n      impl: (self, pattern) =>\n        firstMatchOp(\"firstMatchLquery\", \"?~\", self, pattern, TEXT_CODEC_ID, \"lquery\"),\n    },\n    firstMatchLtxtquery: {\n      self: { codecId: LTREE_ARRAY_CODEC_ID },\n      impl: (self, query) =>\n        firstMatchOp(\"firstMatchLtxtquery\", \"?@\", self, query, TEXT_CODEC_ID, \"ltxtquery\"),\n    },\n    // Boolean array operators (ADR-007). Distinct names from scalar methods because\n    // the operation registry keys by name only. `containsDescendantOf`,\n    // `matchesAnyLquery`, `matchesAnyLtxtquery`, and `matchesAnyLqueryArray` are\n    // in `gist__ltree_ops`; `containsAncestorOf` is not.\n    containsAncestorOf: {\n      self: { codecId: LTREE_ARRAY_CODEC_ID },\n      impl: (self, other) => arrayBoolOp(\"containsAncestorOf\", \"@>\", self, other, LTREE_CODEC_ID),\n    },\n    containsDescendantOf: {\n      self: { codecId: LTREE_ARRAY_CODEC_ID },\n      impl: (self, other) => arrayBoolOp(\"containsDescendantOf\", \"<@\", self, other, LTREE_CODEC_ID),\n    },\n    matchesAnyLquery: {\n      self: { codecId: LTREE_ARRAY_CODEC_ID },\n      impl: (self, pattern) =>\n        arrayBoolOp(\"matchesAnyLquery\", \"~\", self, pattern, TEXT_CODEC_ID, \"lquery\"),\n    },\n    matchesAnyLqueryArray: {\n      self: { codecId: LTREE_ARRAY_CODEC_ID },\n      impl: (self, patterns) =>\n        arrayBoolOp(\"matchesAnyLqueryArray\", \"?\", self, patterns, TEXT_CODEC_ID, \"lquery[]\", true),\n    },\n    matchesAnyLtxtquery: {\n      self: { codecId: LTREE_ARRAY_CODEC_ID },\n      impl: (self, query) =>\n        arrayBoolOp(\"matchesAnyLtxtquery\", \"@\", self, query, TEXT_CODEC_ID, \"ltxtquery\"),\n    },\n    // `lca(ltree[])` — array-receiver form (ADR-001, ADR-005). Named `lcaAll`\n    // because prisma-next keys operations by name only (`createOperationRegistry`\n    // throws on a duplicate); `lca` is already the variadic scalar method on\n    // `pg/ltree@1`. Declares `nullable: false` for parity with the Tier 3\n    // first-match ops even though PG returns NULL for an empty/NULL `ltree[]`\n    // (see the empty-array integration test) — a family-wide gap, not specific\n    // to `lcaAll`.\n    lcaAll: {\n      self: { codecId: LTREE_ARRAY_CODEC_ID },\n      impl: (self): LtreeReturn =>\n        funcOp(\"lcaAll\", \"lca\", LTREE_RETURN, [toExpr(self, codecOf(self))]),\n    },\n  };\n}\n\nconst ltreePackMetaBase = {\n  kind: \"extension\",\n  id: \"ltree\",\n  familyId: \"sql\",\n  targetId: \"postgres\",\n  version: \"0.1.0\",\n  capabilities: {\n    postgres: {\n      \"ltree.path\": true,\n    },\n  },\n  authoring: {\n    type: ltreeAuthoringTypes,\n  },\n  dataTypes: ltreeDataTypes,\n  types: {\n    codecTypes: {\n      codecDescriptors: Array.from(ltreeCodecRegistry.values()),\n      import: {\n        package: \"prisma-ltree/codec-types\",\n        named: \"CodecTypes\",\n        alias: \"LtreeTypes\",\n      },\n      typeImports: [\n        {\n          package: \"prisma-ltree/codec-types\",\n          named: \"Ltree\",\n          alias: \"Ltree\",\n        },\n      ],\n    },\n    queryOperationTypes: {\n      import: {\n        package: \"prisma-ltree/operation-types\",\n        named: \"QueryOperationTypes\",\n        alias: \"LtreeQueryOperationTypes\",\n      },\n    },\n  },\n} as const;\n\nexport const ltreePackMeta: typeof ltreePackMetaBase & {\n  readonly __codecTypes?: CodecTypes;\n} = ltreePackMetaBase;\n"],"mappings":";;;;;;;;;AAGA,MAAa,sBAAsB,EACjC,OAAO;CACL,OAAO;EACL,MAAM;EACN,UAAU;EACV,QAAQ,EACN,SAAS,eACX;CACF;CACA,YAAY;EACV,MAAM;EACN,UAAU;EACV,QAAQ,EACN,SAAS,qBACX;CACF;AACF,EACF;;;AClBA,MAAM,gBAAgB;AAEtB,SAAgB,iBAAiB,OAAyC;CACxE,IAAI,OAAO,UAAU,UACnB,MAAM,IAAI,MAAM,8BAA8B;CAEhD,IAAI,MAAM,WAAW,GACnB,MAAM,IAAI,MAAM,+BAA+B;CAEjD,MAAM,SAAS,MAAM,MAAM,GAAG;CAC9B,IAAI,OAAO,SAAA,OACT,MAAM,IAAI,MAAM,sCAAsC,OAAO,OAAO,QAAQ,kBAAkB;CAEhG,KAAK,MAAM,SAAS,QAAQ;EAC1B,IAAI,MAAM,WAAW,GACnB,MAAM,IAAI,MAAM,0CAA0C,MAAM,EAAE;EAEpE,IAAI,MAAM,SAAA,KACR,MAAM,IAAI,MACR,uCAAuC,MAAM,OAAO,QAAQ,wBAC9D;EAEF,IAAI,CAAC,cAAc,KAAK,KAAK,GAC3B,MAAM,IAAI,MACR,gBAAgB,MAAM,yEACxB;CAEJ;AACF;;;ACfA,MAAM,aAA6B,SAAS;CAC1C,IAAI,OAAO,SAAS,UAClB,OAAO,gBAAgB,eAAe,wBAAwB,IAAI;CAEpE,IAAI;EACF,iBAAiB,IAAI;CACvB,QAAQ;EACN,OAAO,gBAAgB,eAAe,6BAA6B,IAAI;CACzE;CACA,OAAO;AACT;AAEA,MAAa,gBAAgB,YAAY,eAAe;CACtD,MAAM;CACN,OAAO,CAAC;EAAE,MAAM;EAAS,SAAS;EAAM,SAAS;CAAK,CAAC;CACvD,OAAO,GACJ,OAAO,MAAM,UAAU,MAC1B;AACF,CAAC;AAED,MAAM,kBAAkC,SAAS;CAC/C,MAAM,WAAW;CACjB,IAAI,CAAC,MAAM,QAAQ,IAAI,GACrB,OAAO,gBAAgB,qBAAqB,UAAU,IAAI;CAE5D,KAAK,MAAM,SAAS,MAAM;EACxB,IAAI,OAAO,UAAU,UACnB,OAAO,gBAAgB,qBAAqB,UAAU,KAAK;EAE7D,IAAI;GACF,iBAAiB,KAAK;EACxB,QAAQ;GACN,OAAO,gBAAgB,qBAAqB,UAAU,KAAK;EAC7D;CACF;CACA,OAAO;AACT;;;;;;AAOA,MAAM,qBAAqB,YAAY,qBAAqB;CAC1D,MAAM;CACN,UAAU;EACR,IAAI,CAAC,OAAO,EAAE;EACd,OAAO,aAAa,CAAC,GAAG,QAAQ;CAClC;AACF,CAAC;AAED,MAAa,qBAAqB;CAChC,GAAG;CACH,KAAK;EACH,GAAG,mBAAmB;EACtB,OAAO,CAAC;GAAE,MAAM;GAAW,SAAS;GAAe,SAAS;EAAc,CAAC;CAC7E;AACF;AAEA,MAAa,iBAAsC,CAAC,eAAe,kBAAkB;;;;;;;;;;;;;;AC9DrF,MAAM,YAAY;AAElB,SAAS,WAAW,IAAqB;CACvC,OAAO,UAAU,KAAK,EAAE;AAC1B;AAEA,SAAS,QAAQ,IAAqB;CACpC,OAAO,MAAM,OAAO,MAAM;AAC5B;AAEA,SAAS,KAAK,MAA8B,SAAiB,OAAsB;CACjF,MAAM,IAAI,MAAM,GAAG,KAAK,GAAG,QAAQ,KAAK,MAAM,EAAE;AAClD;;;;;;AAOA,SAAS,kBACP,MACA,OACA,GACA,OACQ;CACR,IAAI,MAAM,OAAO,KAAK,OAAO;CAC7B,IAAI,CAAC,OACH,KAAK,MAAM,6BAA6B,IAAI,KAAK,KAAK;CAExD,IAAI,IAAI,IAAI;CACZ,IAAI;CACJ,IAAI;CACJ,IAAI,WAAW;CAEf,MAAM,mBAAuC;EAC3C,IAAI,KAAK,MAAM,UAAU,CAAC,QAAQ,MAAM,EAAG,GAAG,OAAO,KAAA;EACrD,MAAM,QAAQ;EACd,OAAO,IAAI,MAAM,UAAU,QAAQ,MAAM,EAAG,GAAG,KAAK;EACpD,OAAO,OAAO,MAAM,MAAM,OAAO,CAAC,CAAC;CACrC;CAEA,MAAM,WAAW;CACjB,IAAI,IAAI,MAAM,UAAU,MAAM,OAAO,KAAK;EACxC,WAAW;EACX,KAAK;EACL,OAAO,WAAW;CACpB;CACA,IAAI,KAAK,MAAM,UAAU,MAAM,OAAO,KACpC,KAAK,MAAM,6BAA6B,IAAI,KAAK,KAAK;CAExD,KAAK;CAGL,IAAI,QAAQ,KAAA,KAAa,SAAS,KAAA,KAAa,CAAC,UAC9C,KAAK,MAAM,6BAA6B,IAAI,KAAK,KAAK;CAExD,IAAI,QAAQ,KAAA,KAAa,SAAS,KAAA,KAAa,MAAM,MACnD,KAAK,MAAM,wCAAwC,KAAK;CAE1D,OAAO;AACT;;AAGA,SAAS,iBAAiB,OAAe,GAAmB;CAC1D,OAAO,IAAI,MAAM,QAAQ;EACvB,MAAM,KAAK,MAAM;EACjB,IAAI,OAAO,OAAO,OAAO,OAAO,OAAO,KAAK;GAC1C,KAAK;GACL;EACF;EACA;CACF;CACA,OAAO;AACT;AAEA,SAAS,YAAY,MAA8B,OAAe,GAAmB;CACnF,IAAI,KAAK,MAAM,UAAU,CAAC,WAAW,MAAM,EAAG,GAC5C,KAAK,MAAM,6BAA6B,IAAI,KAAK,KAAK;CAExD,IAAI,IAAI;CACR,OAAO,IAAI,MAAM,UAAU,WAAW,MAAM,EAAG,GAAG,KAAK;CACvD,OAAO;AACT;;;;;AAMA,SAAS,mBAAmB,OAAe,GAAmB;CAC5D,IAAI,MAAM,OAAO,KAEf,OAAO,kBAAkB,UAAU,OAAO,IAAI,GAAG,IAAI;CAGvD,IAAI,IAAI;CACR,IAAI,MAAM,OAAO,KACf,KAAK;CAGP,IAAI,YAAY,UAAU,OAAO,CAAC;CAClC,IAAI,iBAAiB,OAAO,CAAC;CAE7B,OAAO,IAAI,MAAM,UAAU,MAAM,OAAO,KAAK;EAC3C,KAAK;EACL,IAAI,YAAY,UAAU,OAAO,CAAC;EAClC,IAAI,iBAAiB,OAAO,CAAC;CAC/B;CAEA,OAAO,kBAAkB,UAAU,OAAO,GAAG,IAAI;AACnD;AAEA,SAAgB,kBAAkB,OAAyC;CACzE,IAAI,OAAO,UAAU,UACnB,MAAM,IAAI,MAAM,iCAAiC;CAEnD,IAAI,MAAM,WAAW,GACnB,MAAM,IAAI,MAAM,wCAAsC;CAGxD,IAAI,IAAI;CACR,IAAI,mBAAmB,OAAO,CAAC;CAC/B,OAAO,IAAI,MAAM,QAAQ;EACvB,IAAI,MAAM,OAAO,KACf,KAAK,UAAU,6BAA6B,IAAI,KAAK,KAAK;EAE5D,KAAK;EACL,IAAI,KAAK,MAAM,QACb,KAAK,UAAU,6CAA6C,KAAK;EAEnE,IAAI,mBAAmB,OAAO,CAAC;CACjC;AACF;AAEA,SAAgB,uBAAuB,OAAoD;CACzF,IAAI,CAAC,MAAM,QAAQ,KAAK,GACtB,MAAM,IAAI,MAAM,0CAA0C;CAE5D,KAAK,IAAI,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS,GAAG;EACpD,MAAM,QAAQ,MAAM;EACpB,IAAI;GACF,kBAAkB,KAAK;EACzB,SAAS,OAAO;GACd,MAAM,UAAU,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;GACrE,MAAM,IAAI,MAAM,qBAAqB,MAAM,KAAK,SAAS;EAC3D;CACF;AACF;AAUA,SAAS,kBAAkB,OAA4B;CACrD,MAAM,SAAsB,CAAC;CAC7B,IAAI,IAAI;CACR,OAAO,IAAI,MAAM,QAAQ;EACvB,MAAM,KAAK,MAAM;EACjB,IAAI,OAAO,OAAO,OAAO,OAAQ,OAAO,QAAQ,OAAO,MAAM;GAC3D,KAAK;GACL;EACF;EACA,IAAI,OAAO,KAAK;GACd,OAAO,KAAK,EAAE,MAAM,MAAM,CAAC;GAC3B,KAAK;GACL;EACF;EACA,IAAI,OAAO,KAAK;GACd,OAAO,KAAK,EAAE,MAAM,KAAK,CAAC;GAC1B,KAAK;GACL;EACF;EACA,IAAI,OAAO,KAAK;GACd,OAAO,KAAK,EAAE,MAAM,MAAM,CAAC;GAC3B,KAAK;GACL;EACF;EACA,IAAI,OAAO,KAAK;GACd,OAAO,KAAK,EAAE,MAAM,SAAS,CAAC;GAC9B,KAAK;GACL;EACF;EACA,IAAI,OAAO,KAAK;GACd,OAAO,KAAK,EAAE,MAAM,SAAS,CAAC;GAC9B,KAAK;GACL;EACF;EACA,IAAI,WAAW,EAAE,GAAG;GAClB,MAAM,QAAQ;GACd,IAAI,YAAY,aAAa,OAAO,CAAC;GACrC,IAAI,iBAAiB,OAAO,CAAC;GAC7B,OAAO,KAAK;IAAE,MAAM;IAAQ,MAAM,MAAM,MAAM,OAAO,CAAC;GAAE,CAAC;GACzD;EACF;EACA,KAAK,aAAa,6BAA6B,IAAI,KAAK,KAAK;CAC/D;CACA,OAAO;AACT;;;;;AAMA,SAAS,cAAc,QAA8B,OAAqB;CACxE,IAAI,MAAM;CAEV,MAAM,aAAoC,OAAO;CACjD,MAAM,aAAwB;EAC5B,MAAM,MAAM,OAAO;EACnB,IAAI,CAAC,KAAK,KAAK,aAAa,iCAAiC,KAAK;EAClE,OAAO;EACP,OAAO;CACT;CAEA,MAAM,qBAA2B;EAC/B,MAAM,MAAM,KAAK;EACjB,IAAI,CAAC,KAAK,KAAK,aAAa,kCAAkC,KAAK;EACnE,IAAI,IAAI,SAAS,QAAQ;GACvB,KAAK;GACL;EACF;EACA,IAAI,IAAI,SAAS,UAAU;GACzB,KAAK;GACL,QAAQ;GAER,IADc,KACN,EAAE,SAAS,UACjB,KAAK,aAAa,+BAA+B,KAAK;GAExD;EACF;EACA,KAAK,aAAa,kCAAkC,KAAK;CAC3D;CAEA,MAAM,oBAA0B;EAC9B,OAAO,KAAK,GAAG,SAAS,OAAO,KAAK;EACpC,aAAa;CACf;CAEA,MAAM,iBAAuB;EAC3B,YAAY;EACZ,OAAO,KAAK,GAAG,SAAS,OAAO;GAC7B,KAAK;GACL,YAAY;EACd;CACF;CAEA,MAAM,gBAAsB;EAC1B,SAAS;EACT,OAAO,KAAK,GAAG,SAAS,MAAM;GAC5B,KAAK;GACL,SAAS;EACX;CACF;CAEA,QAAQ;CACR,IAAI,QAAQ,OAAO,QACjB,KAAK,aAAa,mCAAmC,KAAK;AAE9D;AAEA,SAAgB,qBAAqB,OAAyC;CAC5E,IAAI,OAAO,UAAU,UACnB,MAAM,IAAI,MAAM,kCAAkC;CAEpD,IAAI,MAAM,WAAW,GACnB,MAAM,IAAI,MAAM,yCAAuC;CAEzD,MAAM,SAAS,kBAAkB,KAAK;CACtC,IAAI,OAAO,WAAW,GACpB,KAAK,aAAa,kCAAkC,KAAK;CAE3D,cAAc,QAAQ,KAAK;AAC7B;;;;;;AAOA,SAAgB,iBACd,UACA,KACM;CACN,IAAI,QAAQ,QAAQ,OAAO,QAAQ,YAAY,CAAC,MAAM,QAAQ,GAAG,GAC/D;CAEF,QAAQ,UAAR;EACE,KAAK;GACH,kBAAkB,GAAG;GACrB;EACF,KAAK;GACH,qBAAqB,GAAG;GACxB;EACF,KAAK;GACH,uBAAuB,GAAG;GAC1B;CACJ;AACF;;;AClSA,IAAa,aAAb,cAAgC,UAK9B;CACA,YAAY,YAAgC;EAC1C,MAAM,YAAY,aAAa;CACjC;CAEA,MAAM,OAAO,OAAe,MAAyC;EACnE,iBAAiB,KAAK;EACtB,OAAO;CACT;CAEA,MAAM,SAAS,MAAc,MAAyC;EACpE,OAAO;CACT;CAEA,gBAAgB,OAA8B;EAC5C,iBAAiB,KAAK;EACtB,OAAO,KAAK,gBAAgB,KAAK;CACnC;CAEA,kBAAkB,OAA8B;EAC9C,OAAO,MAAM;CACf;AACF;AAEA,IAAa,kBAAb,cAAqC,wBAA8B;CACjE,WAA6B;CAC7B,eAAkC,YAA4C;EAE5E,OAAO,SAAS,GAAG,YAAY,MAAM;CACvC;CACA,WAA6B,cAAc;CAC3C,UAA4B;CAC5B,SAA2B,CAAC,YAAY,OAAO;CAC/C,eAAiC,KAAA;CACjC,mBAAoC;EAClC,OAAO;CACT;CACA,UAA8D;EAC5D,MAAM,SAAS,IAAI,WAAW,IAAI;EAClC,aAAa;CACf;AACF;AAEA,MAAa,kBAAkB,IAAI,gBAAgB;AAOnD,IAAa,kBAAb,cAAqC,UAKnC;CACA,YAAY,YAAgC;EAC1C,MAAM,YAAY,kBAAkB;CACtC;CAEA,MAAM,OAAO,OAA0B,MAAoD;EACzF,KAAK,MAAM,SAAS,OAClB,iBAAiB,KAAK;EAExB,OAAO;CACT;CAEA,MAAM,SAAS,MAAyB,MAAoD;EAC1F,OAAO;CACT;CAEA,gBAAgB,OAAyC;EACvD,KAAK,MAAM,SAAS,OAClB,iBAAiB,KAAK;EAExB,OAAO,KAAK,gBAAgB,CAAC,GAAG,KAAK,CAAC;CACxC;CAEA,kBAAkB,OAAyC;EACzD,MAAM,OAAO,MAAM;EACnB,IAAI,CAAC,MAAM,QAAQ,IAAI,GACrB,OAAO,CAAC;EAEV,OAAO,KAAK,KAAK,UAAU,OAAO,KAAK,CAAC;CAC1C;AACF;AAEA,IAAa,uBAAb,cAA0C,wBAA8B;CACtE,WAA6B;CAC7B,eAAkC,YAA4C;EAE5E,OAAO;CACT;CACA,WAA6B,mBAAmB;CAChD,UAA4B;CAC5B,SAA2B,CAAC,UAAU;CACtC,eAAiC,KAAA;CACjC,mBAAoC;EAClC,OAAO;CACT;CACA,UAAmE;EACjE,MAAM,SAAS,IAAI,gBAAgB,IAAI;EACvC,aAAa;CACf;AACF;AAUA,MAAM,qBAAqB;CACzB,OAAO;CACP,YAAY,IAV0B,qBAU1B;AACd;;;AC5IA,MAAa,qBACX,6BD+I8B,qBAAqB,OAAO,OAAO,kBAAkB,CC/ItD,CAAgB;;;ACkB/C,MAAM,cAAc;CAAE,SAAS;CAAa,UAAU;AAAM;AAC5D,MAAM,eAAe;CAAE,SAAS;CAAc,UAAU;AAAM;AAC9D,MAAM,aAAa;CAAE,SAAS;CAAa,UAAU;AAAM;AAC3D,MAAM,cAAc;CAAE,SAAS;CAAa,UAAU;AAAM;AAC5D,MAAM,gBAAgB;AACtB,MAAM,eAAe;;;;;;;;;AAUrB,SAAS,OACP,QACA,QACA,SACA,MAC+D;CAE/D,OAAO,eAAe;EACpB;EACA;EACA;EACA,UAAU;GACR,cAAc;GACd,UAAU,GAAG,OAAO,GAPH,KAAK,KAAK,GAAG,MAAO,MAAM,IAAI,aAAa,QAAQ,IAAI,EAAE,GAAI,EAAE,KAAK,IAOnD,EAAE;EACtC;CACF,CAAC;AACH;AAEA,SAAgB,uBAA2E;CAQzF,MAAM,eACJ,QACA,UACA,MACA,UACe;EACf,MAAM,YAAY,QAAQ,IAAI;EAC9B,OAAO,eAAe;GACpB;GACA,MAAM,CAAC,OAAO,MAAM,SAAS,GAAG,OAAO,OAAO,SAAS,CAAC;GACxD,SAAS;GACT,UAAU;IACR,cAAc;IACd,UAAU,YAAY,SAAS;GACjC;EACF,CAAC;CACH;CAEA,MAAM,aACJ,QACA,UACA,UACA,MACA,KACA,OAAO,UACQ;EACf,iBAAiB,UAAU,GAAG;EAE9B,OAAO,eAAe;GACpB;GACA,MAAM,CACJ,OAAO,MAJO,QAAQ,IAID,CAAC,GACtB,OAAO,KAAK,OAAO;IAAE,SAAS;IAAe,MAAM;GAAK,IAAI,EAAE,SAAS,cAAc,CAAC,CACxF;GACA,SAAS;GACT,UAAU;IACR,cAAc;IACd,UAAU,YAAY,SAAS,eAAe;GAChD;EACF,CAAC;CACH;CAQA,MAAM,YACJ,QACA,UACA,SAEA,eAAe;EACb;EACA;EACA,SAAS;EACT,UAAU;GAAE,cAAc;GAAO;EAAS;CAC5C,CAAC;CAMH,MAAM,eACJ,QACA,UACA,MACA,KACA,YACA,UACA,OAAO,UACQ;EACf,IAAI,UAAU,iBAAiB,UAAU,GAAG;EAC5C,MAAM,WAAW,WACb,YAAY,SAAS,eAAe,aACpC,YAAY,SAAS;EACzB,OAAO,eAAe;GACpB;GACA,MAAM,CACJ,OAAO,MAAM,QAAQ,IAAI,CAAC,GAC1B,OAAO,KAAK,OAAO;IAAE,SAAS;IAAY,MAAM;GAAK,IAAI,EAAE,SAAS,WAAW,CAAC,CAClF;GACA,SAAS;GACT,UAAU;IAAE,cAAc;IAAO;GAAS;EAC5C,CAAC;CACH;CAGA,MAAM,gBACJ,QACA,UACA,MACA,KACA,YACA,aACgB;EAChB,IAAI,UAAU,iBAAiB,UAAU,GAAG;EAC5C,MAAM,YAAY,QAAQ,IAAI;EAC9B,MAAM,WAAW,WACb,YAAY,SAAS,eAAe,aACpC,YAAY,SAAS;EACzB,OAAO,eAAe;GACpB;GACA,MAAM,CAAC,OAAO,MAAM,SAAS,GAAG,OAAO,KAAK,EAAE,SAAS,WAAW,CAAC,CAAC;GACpE,SAAS;GACT,UAAU;IAAE,cAAc;IAAO;GAAS;EAC5C,CAAC;CACH;CAEA,OAAO;EACL,cAAc;GACZ,MAAM,EAAE,SAAS,eAAe;GAChC,OAAO,MAAM,UAAU,YAAY,gBAAgB,MAAM,MAAM,KAAK;EACtE;EACA,gBAAgB;GACd,MAAM,EAAE,SAAS,eAAe;GAChC,OAAO,MAAM,UAAU,YAAY,kBAAkB,MAAM,MAAM,KAAK;EACxE;EACA,eAAe;GACb,MAAM,EAAE,SAAS,eAAe;GAChC,OAAO,MAAM,YAAY,UAAU,iBAAiB,KAAK,UAAU,MAAM,OAAO;EAClF;EACA,oBAAoB;GAClB,MAAM,EAAE,SAAS,eAAe;GAChC,OAAO,MAAM,aACX,UAAU,sBAAsB,KAAK,YAAY,MAAM,UAAU,IAAI;EACzE;EACA,kBAAkB;GAChB,MAAM,EAAE,SAAS,eAAe;GAChC,OAAO,MAAM,UAAU,UAAU,oBAAoB,KAAK,aAAa,MAAM,KAAK;EACpF;EACA,QAAQ;GACN,MAAM,EAAE,SAAS,eAAe;GAChC,OAAO,SACL,OAAO,UAAU,UAAU,YAAY,CAAC,OAAO,MAAM,QAAQ,IAAI,CAAC,CAAC,CAAC;EACxE;EACA,UAAU;GACR,MAAM,EAAE,SAAS,eAAe;GAChC,OAAO,MAAM,OAAO,QAClB,OAAO,YAAY,YAAY,cAAc;IAC3C,OAAO,MAAM,QAAQ,IAAI,CAAC;IAC1B,OAAO,OAAO,EAAE,SAAS,aAAa,CAAC;IACvC,OAAO,KAAK,EAAE,SAAS,aAAa,CAAC;GACvC,CAAC;EACL;EAEA,SAAS;GACP,MAAM,EAAE,SAAS,eAAe;GAChC,OAAO,MAAM,QAAQ,QAAqB;IACxC,MAAM,OAAgD,CACpD,OAAO,MAAM,QAAQ,IAAI,CAAC,GAC1B,OAAO,QAAQ,EAAE,SAAS,aAAa,CAAC,CAC1C;IACA,OAAO,OACL,WACA,WACA,cACA,QAAQ,KAAA,IAAY,OAAO,CAAC,GAAG,MAAM,OAAO,KAAK,EAAE,SAAS,aAAa,CAAC,CAAC,CAC7E;GACF;EACF;EAEA,SAAS;GACP,MAAM,EAAE,SAAS,eAAe;GAChC,OAAO,MAAM,OAAO,WAAsB;IACxC,MAAM,YAAY,QAAQ,IAAI;IAC9B,MAAM,OAAgD,CACpD,OAAO,MAAM,SAAS,GACtB,OAAO,OAAO,SAAS,CACzB;IACA,OAAO,OACL,WACA,SACA,YACA,WAAW,KAAA,IAAY,OAAO,CAAC,GAAG,MAAM,OAAO,QAAQ,EAAE,SAAS,aAAa,CAAC,CAAC,CACnF;GACF;EACF;EAGA,KAAK;GACH,MAAM,EAAE,SAAS,eAAe;GAChC,OAAO,MAAM,OAAO,GAAG,SAAsB;IAC3C,MAAM,YAAY,QAAQ,IAAI;IAC9B,OAAO,OAAO,OAAO,OAAO,cAAc;KACxC,OAAO,MAAM,SAAS;KACtB,OAAO,OAAO,SAAS;KACvB,GAAG,KAAK,KAAK,MAAM,OAAO,GAAG,SAAS,CAAC;IACzC,CAAC;GACH;EACF;EAEA,QAAQ;GACN,MAAM,EAAE,SAAS,eAAe;GAChC,OAAO,MAAM,UAAuB;IAClC,MAAM,YAAY,QAAQ,IAAI;IAC9B,OAAO,SAAS,UAAU,wBAAwB,CAChD,OAAO,MAAM,SAAS,GACtB,OAAO,OAAO,SAAS,CACzB,CAAC;GACH;EACF;EACA,YAAY;GACV,MAAM,EAAE,SAAS,eAAe;GAChC,OAAO,MAAM,UACX,SAAS,cAAc,gCAAgC,CACrD,OAAO,MAAM,QAAQ,IAAI,CAAC,GAC1B,OAAO,OAAO,EAAE,SAAS,cAAc,CAAC,CAC1C,CAAC;EACL;EAEA,aAAa;GACX,MAAM,EAAE,SAAS,eAAe;GAChC,OAAO,MAAM,WACX,SAAS,eAAe,gCAAgC,CACtD,OAAO,MAAM,QAAQ,IAAI,CAAC,GAC1B,OAAO,QAAQ,EAAE,SAAS,cAAc,CAAC,CAC3C,CAAC;EACL;EAEA,QAAQ;GACN,MAAM,EAAE,SAAS,eAAe;GAChC,OAAO,SACL,OAAO,UAAU,cAAc,aAAa,CAAC,OAAO,MAAM,QAAQ,IAAI,CAAC,CAAC,CAAC;EAC7E;EAGA,SAAS;GACP,MAAM,EAAE,SAAS,cAAc;GAC/B,OAAO,SACL,OAAO,WAAW,cAAc,cAAc,CAAC,OAAO,MAAM,QAAQ,IAAI,CAAC,CAAC,CAAC;EAC/E;EAEA,iBAAiB;GACf,MAAM,EAAE,SAAS,qBAAqB;GACtC,OAAO,MAAM,UAAU,aAAa,mBAAmB,OAAO,MAAM,OAAO,cAAc;EAC3F;EACA,mBAAmB;GACjB,MAAM,EAAE,SAAS,qBAAqB;GACtC,OAAO,MAAM,UAAU,aAAa,qBAAqB,OAAO,MAAM,OAAO,cAAc;EAC7F;EACA,kBAAkB;GAChB,MAAM,EAAE,SAAS,qBAAqB;GACtC,OAAO,MAAM,YACX,aAAa,oBAAoB,MAAM,MAAM,SAAS,eAAe,QAAQ;EACjF;EACA,qBAAqB;GACnB,MAAM,EAAE,SAAS,qBAAqB;GACtC,OAAO,MAAM,UACX,aAAa,uBAAuB,MAAM,MAAM,OAAO,eAAe,WAAW;EACrF;EAKA,oBAAoB;GAClB,MAAM,EAAE,SAAS,qBAAqB;GACtC,OAAO,MAAM,UAAU,YAAY,sBAAsB,MAAM,MAAM,OAAO,cAAc;EAC5F;EACA,sBAAsB;GACpB,MAAM,EAAE,SAAS,qBAAqB;GACtC,OAAO,MAAM,UAAU,YAAY,wBAAwB,MAAM,MAAM,OAAO,cAAc;EAC9F;EACA,kBAAkB;GAChB,MAAM,EAAE,SAAS,qBAAqB;GACtC,OAAO,MAAM,YACX,YAAY,oBAAoB,KAAK,MAAM,SAAS,eAAe,QAAQ;EAC/E;EACA,uBAAuB;GACrB,MAAM,EAAE,SAAS,qBAAqB;GACtC,OAAO,MAAM,aACX,YAAY,yBAAyB,KAAK,MAAM,UAAU,eAAe,YAAY,IAAI;EAC7F;EACA,qBAAqB;GACnB,MAAM,EAAE,SAAS,qBAAqB;GACtC,OAAO,MAAM,UACX,YAAY,uBAAuB,KAAK,MAAM,OAAO,eAAe,WAAW;EACnF;EAQA,QAAQ;GACN,MAAM,EAAE,SAAS,qBAAqB;GACtC,OAAO,SACL,OAAO,UAAU,OAAO,cAAc,CAAC,OAAO,MAAM,QAAQ,IAAI,CAAC,CAAC,CAAC;EACvE;CACF;AACF;AA2CA,MAAa,gBAET;CA1CF,MAAM;CACN,IAAI;CACJ,UAAU;CACV,UAAU;CACV,SAAS;CACT,cAAc,EACZ,UAAU,EACR,cAAc,KAChB,EACF;CACA,WAAW,EACT,MAAM,oBACR;CACA,WAAW;CACX,OAAO;EACL,YAAY;GACV,kBAAkB,MAAM,KAAK,mBAAmB,OAAO,CAAC;GACxD,QAAQ;IACN,SAAS;IACT,OAAO;IACP,OAAO;GACT;GACA,aAAa,CACX;IACE,SAAS;IACT,OAAO;IACP,OAAO;GACT,CACF;EACF;EACA,qBAAqB,EACnB,QAAQ;GACN,SAAS;GACT,OAAO;GACP,OAAO;EACT,EACF;CACF;AAKE"}

package/dist/{operation-types-8su4lbK-.d.mts → operation-types-DD-KyBms.d.mts}

@@ -178,6 +178,51 @@ type QueryOperationTypes<CT extends CodecTypesBase> = SqlQueryOperationTypes<CT,
       readonly nullable: false;
     }>;
   };
+  readonly containsAncestorOf: {
+    readonly self: {
+      readonly codecId: "pg/ltree-array@1";
+    };
+    readonly impl: (self: CodecExpression<"pg/ltree-array@1", boolean, CT>, other: CodecExpression<"pg/ltree@1", boolean, CT>) => Expression<{
+      readonly codecId: "pg/bool@1";
+      readonly nullable: false;
+    }>;
+  };
+  readonly containsDescendantOf: {
+    readonly self: {
+      readonly codecId: "pg/ltree-array@1";
+    };
+    readonly impl: (self: CodecExpression<"pg/ltree-array@1", boolean, CT>, other: CodecExpression<"pg/ltree@1", boolean, CT>) => Expression<{
+      readonly codecId: "pg/bool@1";
+      readonly nullable: false;
+    }>;
+  };
+  readonly matchesAnyLquery: {
+    readonly self: {
+      readonly codecId: "pg/ltree-array@1";
+    };
+    readonly impl: (self: CodecExpression<"pg/ltree-array@1", boolean, CT>, pattern: CodecExpression<"pg/text@1", boolean, CT>) => Expression<{
+      readonly codecId: "pg/bool@1";
+      readonly nullable: false;
+    }>;
+  };
+  readonly matchesAnyLqueryArray: {
+    readonly self: {
+      readonly codecId: "pg/ltree-array@1";
+    };
+    readonly impl: (self: CodecExpression<"pg/ltree-array@1", boolean, CT>, patterns: CodecExpression<"pg/text-array@1", boolean, CT>) => Expression<{
+      readonly codecId: "pg/bool@1";
+      readonly nullable: false;
+    }>;
+  };
+  readonly matchesAnyLtxtquery: {
+    readonly self: {
+      readonly codecId: "pg/ltree-array@1";
+    };
+    readonly impl: (self: CodecExpression<"pg/ltree-array@1", boolean, CT>, query: CodecExpression<"pg/text@1", boolean, CT>) => Expression<{
+      readonly codecId: "pg/bool@1";
+      readonly nullable: false;
+    }>;
+  };
   readonly lcaAll: {
     readonly self: {
       readonly codecId: "pg/ltree-array@1";
@@ -190,4 +235,4 @@ type QueryOperationTypes<CT extends CodecTypesBase> = SqlQueryOperationTypes<CT,
 }>;
 //#endregion
 export { QueryOperationTypes as t };
-//# sourceMappingURL=operation-types-8su4lbK-.d.mts.map
+//# sourceMappingURL=operation-types-DD-KyBms.d.mts.map

package/dist/{operation-types-8su4lbK-.d.mts.map → operation-types-DD-KyBms.d.mts.map}

@@ -1 +1 @@
-{"version":3,"file":"operation-types-8su4lbK-.d.mts","names":[],"sources":["../src/types/operation-types.ts"],"mappings":";;;;KAMK,cAAA,GAAiB,MAAM;EAAA,SAAoB,KAAA;EAAA,SAAyB,MAAA;AAAA;AAAA,KAE7D,mBAAA,YAA+B,cAAA,IAAkB,sBAAA,CAC3D,EAAA;EAAA,SAEW,YAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,wBAAuC,EAAA,GAC7C,KAAA,EAAO,eAAA,wBAAuC,EAAA,MAC3C,UAAA;MAAA,SAAsB,OAAA;MAAA,SAA+B,QAAA;IAAA;EAAA;EAAA,SAEnD,cAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,wBAAuC,EAAA,GAC7C,KAAA,EAAO,eAAA,wBAAuC,EAAA,MAC3C,UAAA;MAAA,SAAsB,OAAA;MAAA,SAA+B,QAAA;IAAA;EAAA;EAAA,SAKnD,aAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,wBAAuC,EAAA,GAC7C,OAAA,EAAS,eAAA,uBAAsC,EAAA,MAC5C,UAAA;MAAA,SAAsB,OAAA;MAAA,SAA+B,QAAA;IAAA;EAAA;EAAA,SAEnD,kBAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,wBAAuC,EAAA,GAC7C,QAAA,EAAU,eAAA,6BAA4C,EAAA,MACnD,UAAA;MAAA,SAAsB,OAAA;MAAA,SAA+B,QAAA;IAAA;EAAA;EAAA,SAEnD,gBAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,wBAAuC,EAAA,GAC7C,KAAA,EAAO,eAAA,uBAAsC,EAAA,MAC1C,UAAA;MAAA,SAAsB,OAAA;MAAA,SAA+B,QAAA;IAAA;EAAA;EAAA,SAGnD,MAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,wBAAuC,EAAA,MAC1C,UAAA;MAAA,SAAsB,OAAA;MAAA,SAA+B,QAAA;IAAA;EAAA;EAAA,SAEnD,QAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,wBAAuC,EAAA,GAC7C,KAAA,EAAO,eAAA,uBAAsC,EAAA,GAC7C,GAAA,EAAK,eAAA,uBAAsC,EAAA,MACxC,UAAA;MAAA,SAAsB,OAAA;MAAA,SAAgC,QAAA;IAAA;EAAA;EAAA,SAEpD,OAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,wBAAuC,EAAA,GAC7C,MAAA,EAAQ,eAAA,uBAAsC,EAAA,GAC9C,GAAA,GAAM,eAAA,uBAAsC,EAAA,MACzC,UAAA;MAAA,SAAsB,OAAA;MAAA,SAAgC,QAAA;IAAA;EAAA;EAAA,SAEpD,OAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,wBAAuC,EAAA,GAC7C,KAAA,EAAO,eAAA,wBAAuC,EAAA,GAC9C,MAAA,GAAS,eAAA,uBAAsC,EAAA,MAC5C,UAAA;MAAA,SAAsB,OAAA;MAAA,SAA+B,QAAA;IAAA;EAAA;EAAA,SAKnD,GAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,wBAAuC,EAAA,GAC7C,KAAA,EAAO,eAAA,wBAAuC,EAAA,MAC3C,IAAA,EAAM,aAAA,CAAc,eAAA,wBAAuC,EAAA,OAC3D,UAAA;MAAA,SAAsB,OAAA;MAAA,SAAgC,QAAA;IAAA;EAAA;EAAA,SAIpD,MAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,wBAAuC,EAAA,GAC7C,KAAA,EAAO,eAAA,wBAAuC,EAAA,MAC3C,UAAA;MAAA,SAAsB,OAAA;MAAA,SAAgC,QAAA;IAAA;EAAA;EAAA,SAEpD,UAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,wBAAuC,EAAA,GAC7C,KAAA,EAAO,eAAA,uBAAsC,EAAA,MAC1C,UAAA;MAAA,SAAsB,OAAA;MAAA,SAAgC,QAAA;IAAA;EAAA;EAAA,SAEpD,WAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,wBAAuC,EAAA,GAC7C,MAAA,EAAQ,eAAA,uBAAsC,EAAA,MAC3C,UAAA;MAAA,SAAsB,OAAA;MAAA,SAAgC,QAAA;IAAA;EAAA;EAAA,SAIpD,MAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,wBAAuC,EAAA,MAC1C,UAAA;MAAA,SAAsB,OAAA;MAAA,SAA+B,QAAA;IAAA;EAAA;EAAA,SAEnD,OAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,uBAAsC,EAAA,MACzC,UAAA;MAAA,SAAsB,OAAA;MAAA,SAAgC,QAAA;IAAA;EAAA;EAAA,SAGpD,eAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,8BAA6C,EAAA,GACnD,KAAA,EAAO,eAAA,wBAAuC,EAAA,MAC3C,UAAA;MAAA,SAAsB,OAAA;MAAA,SAAgC,QAAA;IAAA;EAAA;EAAA,SAEpD,iBAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,8BAA6C,EAAA,GACnD,KAAA,EAAO,eAAA,wBAAuC,EAAA,MAC3C,UAAA;MAAA,SAAsB,OAAA;MAAA,SAAgC,QAAA;IAAA;EAAA;EAAA,SAEpD,gBAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,8BAA6C,EAAA,GACnD,OAAA,EAAS,eAAA,uBAAsC,EAAA,MAC5C,UAAA;MAAA,SAAsB,OAAA;MAAA,SAAgC,QAAA;IAAA;EAAA;EAAA,SAEpD,mBAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,8BAA6C,EAAA,GACnD,KAAA,EAAO,eAAA,uBAAsC,EAAA,MAC1C,UAAA;MAAA,SAAsB,OAAA;MAAA,SAAgC,QAAA;IAAA;EAAA;EAAA,SAMpD,MAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,8BAA6C,EAAA,MAChD,UAAA;MAAA,SAAsB,OAAA;MAAA,SAAgC,QAAA;IAAA;EAAA;AAAA"}
+{"version":3,"file":"operation-types-DD-KyBms.d.mts","names":[],"sources":["../src/types/operation-types.ts"],"mappings":";;;;KAMK,cAAA,GAAiB,MAAM;EAAA,SAAoB,KAAA;EAAA,SAAyB,MAAA;AAAA;AAAA,KAE7D,mBAAA,YAA+B,cAAA,IAAkB,sBAAA,CAC3D,EAAA;EAAA,SAEW,YAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,wBAAuC,EAAA,GAC7C,KAAA,EAAO,eAAA,wBAAuC,EAAA,MAC3C,UAAA;MAAA,SAAsB,OAAA;MAAA,SAA+B,QAAA;IAAA;EAAA;EAAA,SAEnD,cAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,wBAAuC,EAAA,GAC7C,KAAA,EAAO,eAAA,wBAAuC,EAAA,MAC3C,UAAA;MAAA,SAAsB,OAAA;MAAA,SAA+B,QAAA;IAAA;EAAA;EAAA,SAKnD,aAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,wBAAuC,EAAA,GAC7C,OAAA,EAAS,eAAA,uBAAsC,EAAA,MAC5C,UAAA;MAAA,SAAsB,OAAA;MAAA,SAA+B,QAAA;IAAA;EAAA;EAAA,SAEnD,kBAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,wBAAuC,EAAA,GAC7C,QAAA,EAAU,eAAA,6BAA4C,EAAA,MACnD,UAAA;MAAA,SAAsB,OAAA;MAAA,SAA+B,QAAA;IAAA;EAAA;EAAA,SAEnD,gBAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,wBAAuC,EAAA,GAC7C,KAAA,EAAO,eAAA,uBAAsC,EAAA,MAC1C,UAAA;MAAA,SAAsB,OAAA;MAAA,SAA+B,QAAA;IAAA;EAAA;EAAA,SAGnD,MAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,wBAAuC,EAAA,MAC1C,UAAA;MAAA,SAAsB,OAAA;MAAA,SAA+B,QAAA;IAAA;EAAA;EAAA,SAEnD,QAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,wBAAuC,EAAA,GAC7C,KAAA,EAAO,eAAA,uBAAsC,EAAA,GAC7C,GAAA,EAAK,eAAA,uBAAsC,EAAA,MACxC,UAAA;MAAA,SAAsB,OAAA;MAAA,SAAgC,QAAA;IAAA;EAAA;EAAA,SAEpD,OAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,wBAAuC,EAAA,GAC7C,MAAA,EAAQ,eAAA,uBAAsC,EAAA,GAC9C,GAAA,GAAM,eAAA,uBAAsC,EAAA,MACzC,UAAA;MAAA,SAAsB,OAAA;MAAA,SAAgC,QAAA;IAAA;EAAA;EAAA,SAEpD,OAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,wBAAuC,EAAA,GAC7C,KAAA,EAAO,eAAA,wBAAuC,EAAA,GAC9C,MAAA,GAAS,eAAA,uBAAsC,EAAA,MAC5C,UAAA;MAAA,SAAsB,OAAA;MAAA,SAA+B,QAAA;IAAA;EAAA;EAAA,SAKnD,GAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,wBAAuC,EAAA,GAC7C,KAAA,EAAO,eAAA,wBAAuC,EAAA,MAC3C,IAAA,EAAM,aAAA,CAAc,eAAA,wBAAuC,EAAA,OAC3D,UAAA;MAAA,SAAsB,OAAA;MAAA,SAAgC,QAAA;IAAA;EAAA;EAAA,SAIpD,MAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,wBAAuC,EAAA,GAC7C,KAAA,EAAO,eAAA,wBAAuC,EAAA,MAC3C,UAAA;MAAA,SAAsB,OAAA;MAAA,SAAgC,QAAA;IAAA;EAAA;EAAA,SAEpD,UAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,wBAAuC,EAAA,GAC7C,KAAA,EAAO,eAAA,uBAAsC,EAAA,MAC1C,UAAA;MAAA,SAAsB,OAAA;MAAA,SAAgC,QAAA;IAAA;EAAA;EAAA,SAEpD,WAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,wBAAuC,EAAA,GAC7C,MAAA,EAAQ,eAAA,uBAAsC,EAAA,MAC3C,UAAA;MAAA,SAAsB,OAAA;MAAA,SAAgC,QAAA;IAAA;EAAA;EAAA,SAIpD,MAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,wBAAuC,EAAA,MAC1C,UAAA;MAAA,SAAsB,OAAA;MAAA,SAA+B,QAAA;IAAA;EAAA;EAAA,SAEnD,OAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,uBAAsC,EAAA,MACzC,UAAA;MAAA,SAAsB,OAAA;MAAA,SAAgC,QAAA;IAAA;EAAA;EAAA,SAGpD,eAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,8BAA6C,EAAA,GACnD,KAAA,EAAO,eAAA,wBAAuC,EAAA,MAC3C,UAAA;MAAA,SAAsB,OAAA;MAAA,SAAgC,QAAA;IAAA;EAAA;EAAA,SAEpD,iBAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,8BAA6C,EAAA,GACnD,KAAA,EAAO,eAAA,wBAAuC,EAAA,MAC3C,UAAA;MAAA,SAAsB,OAAA;MAAA,SAAgC,QAAA;IAAA;EAAA;EAAA,SAEpD,gBAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,8BAA6C,EAAA,GACnD,OAAA,EAAS,eAAA,uBAAsC,EAAA,MAC5C,UAAA;MAAA,SAAsB,OAAA;MAAA,SAAgC,QAAA;IAAA;EAAA;EAAA,SAEpD,mBAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,8BAA6C,EAAA,GACnD,KAAA,EAAO,eAAA,uBAAsC,EAAA,MAC1C,UAAA;MAAA,SAAsB,OAAA;MAAA,SAAgC,QAAA;IAAA;EAAA;EAAA,SAIpD,kBAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,8BAA6C,EAAA,GACnD,KAAA,EAAO,eAAA,wBAAuC,EAAA,MAC3C,UAAA;MAAA,SAAsB,OAAA;MAAA,SAA+B,QAAA;IAAA;EAAA;EAAA,SAEnD,oBAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,8BAA6C,EAAA,GACnD,KAAA,EAAO,eAAA,wBAAuC,EAAA,MAC3C,UAAA;MAAA,SAAsB,OAAA;MAAA,SAA+B,QAAA;IAAA;EAAA;EAAA,SAEnD,gBAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,8BAA6C,EAAA,GACnD,OAAA,EAAS,eAAA,uBAAsC,EAAA,MAC5C,UAAA;MAAA,SAAsB,OAAA;MAAA,SAA+B,QAAA;IAAA;EAAA;EAAA,SAEnD,qBAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,8BAA6C,EAAA,GACnD,QAAA,EAAU,eAAA,6BAA4C,EAAA,MACnD,UAAA;MAAA,SAAsB,OAAA;MAAA,SAA+B,QAAA;IAAA;EAAA;EAAA,SAEnD,mBAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,8BAA6C,EAAA,GACnD,KAAA,EAAO,eAAA,uBAAsC,EAAA,MAC1C,UAAA;MAAA,SAAsB,OAAA;MAAA,SAA+B,QAAA;IAAA;EAAA;EAAA,SAMnD,MAAA;IAAA,SACE,IAAA;MAAA,SAAiB,OAAA;IAAA;IAAA,SACjB,IAAA,GACP,IAAA,EAAM,eAAA,8BAA6C,EAAA,MAChD,UAAA;MAAA,SAAsB,OAAA;MAAA,SAAgC,QAAA;IAAA;EAAA;AAAA"}