prisma-ltree 0.5.0 → 0.7.0

package/src/core/pattern-validation.ts

@@ -0,0 +1,313 @@
+/**
+ * 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: string): boolean {
+  return WORD_CHAR.test(ch);
+}
+
+function isDigit(ch: string): boolean {
+  return ch >= "0" && ch <= "9";
+}
+
+function fail(kind: "lquery" | "ltxtquery", message: string, value: string): never {
+  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: "lquery" | "ltxtquery",
+  value: string,
+  i: number,
+  allow: boolean,
+): number {
+  if (value[i] !== "{") return i;
+  if (!allow) {
+    fail(kind, `syntax error at character ${i + 1}`, value);
+  }
+  let j = i + 1;
+  let low: number | undefined;
+  let high: number | undefined;
+  let sawComma = false;
+
+  const readNumber = (): number | undefined => {
+    if (j >= value.length || !isDigit(value[j]!)) return undefined;
+    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;
+
+  // `{}` is invalid; `{,}` (both ends open) is valid in Postgres.
+  if (low === undefined && high === undefined && !sawComma) {
+    fail(kind, `syntax error at character ${i + 1}`, value);
+  }
+  if (low !== undefined && high !== undefined && low > high) {
+    fail(kind, "syntax error (quantifier low > high)", value);
+  }
+  return j;
+}
+
+/** Consume `@` / `*` / `%` modifiers that follow a non-star word. */
+function consumeModifiers(value: string, i: number): number {
+  while (i < value.length) {
+    const ch = value[i]!;
+    if (ch === "@" || ch === "*" || ch === "%") {
+      i += 1;
+      continue;
+    }
+    break;
+  }
+  return i;
+}
+
+function consumeWord(kind: "lquery" | "ltxtquery", value: string, i: number): number {
+  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: string, i: number): number {
+  if (value[i] === "*") {
+    // Star wildcards cannot take `@`/`%` modifiers; only an optional quantifier.
+    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);
+}
+
+export function assertValidLquery(value: unknown): asserts value is string {
+  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);
+  }
+}
+
+export function assertValidLqueryArray(value: unknown): asserts value is readonly string[] {
+  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}`);
+    }
+  }
+}
+
+type LtxtToken =
+  | { readonly kind: "word"; readonly text: string }
+  | { readonly kind: "and" }
+  | { readonly kind: "or" }
+  | { readonly kind: "not" }
+  | { readonly kind: "lparen" }
+  | { readonly kind: "rparen" };
+
+function tokenizeLtxtquery(value: string): LtxtToken[] {
+  const tokens: LtxtToken[] = [];
+  let i = 0;
+  while (i < value.length) {
+    const ch = value[i]!;
+    if (ch === " " || ch === "\t" || 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: readonly LtxtToken[], value: string): void {
+  let pos = 0;
+
+  const peek = (): LtxtToken | undefined => tokens[pos];
+  const take = (): LtxtToken => {
+    const tok = tokens[pos];
+    if (!tok) fail("ltxtquery", "syntax error (unexpected end)", value);
+    pos += 1;
+    return tok;
+  };
+
+  const parsePrimary = (): void => {
+    const tok = peek();
+    if (!tok) fail("ltxtquery", "syntax error (missing operand)", value);
+    if (tok.kind === "word") {
+      take();
+      return;
+    }
+    if (tok.kind === "lparen") {
+      take();
+      parseOr();
+      const close = take();
+      if (close.kind !== "rparen") {
+        fail("ltxtquery", "syntax error (expected ')')", value);
+      }
+      return;
+    }
+    fail("ltxtquery", "syntax error (missing operand)", value);
+  };
+
+  const parseFactor = (): void => {
+    while (peek()?.kind === "not") take();
+    parsePrimary();
+  };
+
+  const parseAnd = (): void => {
+    parseFactor();
+    while (peek()?.kind === "and") {
+      take();
+      parseFactor();
+    }
+  };
+
+  const parseOr = (): void => {
+    parseAnd();
+    while (peek()?.kind === "or") {
+      take();
+      parseAnd();
+    }
+  };
+
+  parseOr();
+  if (pos !== tokens.length) {
+    fail("ltxtquery", "syntax error (unexpected token)", value);
+  }
+}
+
+export function assertValidLtxtquery(value: unknown): asserts value is string {
+  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).
+ */
+export function assertPatternArg(
+  castType: "lquery" | "ltxtquery" | "lquery[]",
+  arg: unknown,
+): void {
+  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;
+  }
+}

package/src/exports/control.ts

@@ -7,10 +7,25 @@ import { contractSpaceFromJson } from "@prisma/orm-toolchain/migration-tools/spa
 import type { SqlStorage } from "@prisma/orm-family-sql/contract/types";
 import baselineMetadata from "../../migrations/20260619T2142_install_ltree/migration.json" with { type: "json" };
 import baselineOps from "../../migrations/20260619T2142_install_ltree/ops.json" with { type: "json" };
+import createMetadata from "../../migrations/20261111T1904_create_ltree_extension/migration.json" with { type: "json" };
+import createOps from "../../migrations/20261111T1904_create_ltree_extension/ops.json" with { type: "json" };
+import declareMetadata from "../../migrations/20261111T1905_declare_ltree_extension/migration.json" with { type: "json" };
+import declareOps from "../../migrations/20261111T1905_declare_ltree_extension/ops.json" with { type: "json" };
+import searchPathMetadata from "../../migrations/20261111T1908_find_ltree_on_search_path/migration.json" with { type: "json" };
+import searchPathOps from "../../migrations/20261111T1908_find_ltree_on_search_path/ops.json" with { type: "json" };
+import searchPathInstallMetadata from "../../migrations/20261111T1908_install_ltree_on_search_path/migration.json" with { type: "json" };
+import searchPathInstallOps from "../../migrations/20261111T1908_install_ltree_on_search_path/ops.json" with { type: "json" };
 import headRef from "../../migrations/refs/head.json" with { type: "json" };
 import contractJson from "../contract.json" with { type: "json" };
 import { LTREE_ARRAY_CODEC_ID, LTREE_CODEC_ID } from "../core/constants";
-import { LTREE_SPACE_ID, LTREE_BASELINE_MIGRATION_NAME } from "../core/contract-space-constants";
+import {
+  LTREE_BASELINE_MIGRATION_NAME,
+  LTREE_CREATE_EXTENSION_MIGRATION_NAME,
+  LTREE_DECLARE_EXTENSION_MIGRATION_NAME,
+  LTREE_SEARCH_PATH_INSTALL_MIGRATION_NAME,
+  LTREE_SEARCH_PATH_MIGRATION_NAME,
+  LTREE_SPACE_ID,
+} from "../core/contract-space-constants";
 import { ltreePackMeta, ltreeQueryOperations } from "../core/descriptor-meta";
 
 const ltreeControlPlaneHooks: CodecControlHooks = {
@@ -25,6 +40,26 @@ const ltreeContractSpace = contractSpaceFromJson<Contract<SqlStorage>>({
       metadata: baselineMetadata,
       ops: baselineOps,
     },
+    {
+      dirName: LTREE_DECLARE_EXTENSION_MIGRATION_NAME,
+      metadata: declareMetadata,
+      ops: declareOps,
+    },
+    {
+      dirName: LTREE_CREATE_EXTENSION_MIGRATION_NAME,
+      metadata: createMetadata,
+      ops: createOps,
+    },
+    {
+      dirName: LTREE_SEARCH_PATH_MIGRATION_NAME,
+      metadata: searchPathMetadata,
+      ops: searchPathOps,
+    },
+    {
+      dirName: LTREE_SEARCH_PATH_INSTALL_MIGRATION_NAME,
+      metadata: searchPathInstallMetadata,
+      ops: searchPathInstallOps,
+    },
   ],
   headRef,
 });

package/src/exports/runtime.ts

@@ -1,5 +1,6 @@
 import type { SqlRuntimeExtensionDescriptor } from "@prisma/orm-family-sql/runtime";
 import { ltreePackMeta, ltreeQueryOperations } from "../core/descriptor-meta";
+import { ltreeHierarchyMethods } from "../core/hierarchy-collection-methods";
 import { ltreeCodecRegistry } from "../core/registry";
 
 const ltreeRuntimeDescriptor: SqlRuntimeExtensionDescriptor<"postgres"> = {
@@ -16,6 +17,7 @@ const ltreeRuntimeDescriptor: SqlRuntimeExtensionDescriptor<"postgres"> = {
   },
   codecs: () => Array.from(ltreeCodecRegistry.values()),
   queryOperations: () => ltreeQueryOperations(),
+  collectionMethods: () => [ltreeHierarchyMethods],
   create() {
     return {
       familyId: "sql" as const,
@@ -24,5 +26,6 @@ const ltreeRuntimeDescriptor: SqlRuntimeExtensionDescriptor<"postgres"> = {
   },
 };
 
+export type { LtreeHierarchyMethods } from "../core/hierarchy-collection-methods";
 export { ltreeCodecRegistry };
 export default ltreeRuntimeDescriptor;

package/src/types/operation-types.ts

@@ -155,6 +155,43 @@ export type QueryOperationTypes<CT extends CodecTypesBase> = SqlQueryOperationTy
         query: CodecExpression<"pg/text@1", boolean, CT>,
       ) => Expression<{ readonly codecId: "pg/ltree@1"; readonly nullable: false }>;
     };
+    // Boolean array operators (ADR-007). Names differ from the scalar methods
+    // because the operation registry keys by name only.
+    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 }>;
+    };
     // `lca(ltree[])` — ships as `lcaAll()` (ADR-001, ADR-005); not `lca()`
     // because prisma-next operation names are globally unique across the composed
     // stack. `nullable: false` mirrors the first-match ops (PG can return NULL for

package/dist/codec-types-BJE-5cwk.d.mts.map

@@ -1 +0,0 @@
-{"version":3,"file":"codec-types-BJE-5cwk.d.mts","names":[],"sources":["../src/core/constants.ts","../src/core/codecs.ts","../src/types/codec-types.ts"],"mappings":";;;;;;cAAa,cAAA;AAAA,cAEA,oBAAA;;;cCkDA,UAAA,SAAmB,SAAA,QACvB,cAAA;EAKD,MAAA,CAAO,KAAA,UAAe,IAAA,EAAM,gBAAA,GAAmB,OAAA;EAK/C,MAAA,CAAO,IAAA,UAAc,IAAA,EAAM,gBAAA,GAAmB,OAAA;EAIpD,UAAA,CAAW,KAAA,WAAgB,SAAA;EAK3B,UAAA,CAAW,IAAA,EAAM,SAAA;AAAA;AAAA,cAMN,eAAA,SAAwB,uBAAA;EAAA,UAChB,cAAA,CAAe,UAAA,EAAY,cAAA,GAAiB,cAAA;EAAA,SAI7C,QAAA,mDAAQ,UAAA;EAAA,SACR,OAAA;EAAA,SACA,MAAA;EAAA,SACA,YAAA;EACT,gBAAA;EAGA,OAAA,KAAY,GAAA,EAAK,oBAAA,KAAyB,UAAA;AAAA;AAAA,cAaxC,eAAA,SAAwB,SAAA,QAC5B,oBAAA;EAKD,MAAA,CAAO,KAAA,qBAA0B,IAAA,EAAM,gBAAA,GAAmB,OAAA;EAO1D,MAAA,CAAO,IAAA,qBAAyB,IAAA,EAAM,gBAAA,GAAmB,OAAA;EAI/D,UAAA,CAAW,KAAA,sBAA2B,SAAA;EAOtC,UAAA,CAAW,IAAA,EAAM,SAAA;AAAA;AAAA,cAWN,oBAAA,SAA6B,uBAAA;EAAA,UACrB,cAAA,CAAe,UAAA,EAAY,cAAA,GAAiB,cAAA;EAAA,SAI7C,QAAA,mDAAQ,UAAA;EAAA,SACR,OAAA;EAAA,SACA,MAAA;EAAA,SACA,YAAA;EACT,gBAAA;EAGA,OAAA,KAAY,GAAA,EAAK,oBAAA,KAAyB,eAAA;AAAA;AAAA,cAc/C,kBAAA;EAAA,SACJ,KAAA,EAAK,eAAA;EAAA,SACL,UAAA,EAAU,oBAAA;AAAA;AAAA,KAGA,YAAA,GAAa,iBAAiB,QAAQ,kBAAA;;;KCvKtC,KAAA;EAAA,SAA4B,OAAO;AAAA;AAAA,KAEnC,UAAA;EAAA,SAA4C,YAAY;AAAA;AAAA,KAExD,UAAA,GAAa,YAAc"}

package/dist/descriptor-meta-2In8FI1I.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"descriptor-meta-2In8FI1I.mjs","names":[],"sources":["../src/core/authoring.ts","../src/core/data-types.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","/**\n * Data types this extension owns.\n *\n * `ltree` and `ltree[]` are PostgreSQL types the target does not register.\n * A path's canonical form is its label text. An array's canonical 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 } 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\";\n\nexport const ltreeDataType = sqlDataType(\"ltree/ltree\", {\n  texts: [{ text: \"ltree\", written: true, catalog: true }],\n  casts: {\n    [pgText.id]: (value) => value,\n  },\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  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","import type { JsonValue } from \"@prisma/orm-framework/contract/types\";\nimport {\n  type CodecCallContext,\n  CodecImpl,\n  type CodecInstanceContext,\n  type ColumnHelperFor,\n  type ColumnHelperForStrict,\n  column,\n} from \"@prisma/orm-framework/components/codec\";\nimport type { ExtractCodecTypes, ProjectionExpr } from \"@prisma/orm-family-sql/relational-core/ast\";\nimport {\n  definePostgresCodecs,\n  PostgresCodecDescriptor,\n} from \"@prisma/orm-target-postgres/target/codec-descriptor\";\nimport {\n  LTREE_ARRAY_CODEC_ID,\n  LTREE_CODEC_ID,\n  LTREE_MAX_LABEL_LENGTH,\n  LTREE_MAX_LABELS,\n} from \"./constants\";\nimport { ltreeArrayDataType, ltreeDataType } from \"./data-types\";\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\nexport class LtreeCodec extends CodecImpl<\n  typeof LTREE_CODEC_ID,\n  readonly [\"equality\", \"order\"],\n  string,\n  string\n> {\n  async encode(value: string, _ctx: CodecCallContext): Promise<string> {\n    assertValidLtree(value);\n    return value;\n  }\n\n  async decode(wire: string, _ctx: CodecCallContext): Promise<string> {\n    return wire;\n  }\n\n  encodeJson(value: string): JsonValue {\n    assertValidLtree(value);\n    return value;\n  }\n\n  decodeJson(json: JsonValue): string {\n    assertValidLtree(json);\n    return json;\n  }\n}\n\nexport class LtreeDescriptor extends PostgresCodecDescriptor<void> {\n  protected override jsonProjection(expression: ProjectionExpr): ProjectionExpr {\n    // ltree's text form is already its canonical JSON string.\n    return expression;\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  async encode(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 decode(wire: readonly string[], _ctx: CodecCallContext): Promise<readonly string[]> {\n    return wire;\n  }\n\n  encodeJson(value: readonly string[]): JsonValue {\n    for (const entry of value) {\n      assertValidLtree(entry);\n    }\n    return [...value];\n  }\n\n  decodeJson(json: JsonValue): readonly string[] {\n    if (!Array.isArray(json)) {\n      return [];\n    }\n    return json.map((entry) => {\n      assertValidLtree(entry);\n      return String(entry);\n    });\n  }\n}\n\nexport class LtreeArrayDescriptor extends PostgresCodecDescriptor<void> {\n  protected override jsonProjection(expression: ProjectionExpr): ProjectionExpr {\n    // ltree[] text form projects as a JSON string array already.\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 { 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` (the validated-string-param\n  // approach; verified executable under PGlite).\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: string,\n    self: CodecExpression<typeof LTREE_CODEC_ID, boolean, CT>,\n    arg: unknown,\n    many = false,\n  ): BoolReturn => {\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  // 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?: string,\n  ): LtreeReturn => {\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    // `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;;;ACPA,MAAa,gBAAgB,YAAY,eAAe;CACtD,OAAO,CAAC;EAAE,MAAM;EAAS,SAAS;EAAM,SAAS;CAAK,CAAC;CACvD,OAAO,GACJ,OAAO,MAAM,UAAU,MAC1B;AACF,CAAC;;;;;;AAOD,MAAM,qBAAqB,YAAY,qBAAqB,EAC1D,UAAU;CACR,IAAI,CAAC,OAAO,EAAE;CACd,OAAO,aAAa,CAAC,GAAG,QAAQ;AAClC,EACF,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;;;AClBrF,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;AAEA,IAAa,aAAb,cAAgC,UAK9B;CACA,MAAM,OAAO,OAAe,MAAyC;EACnE,iBAAiB,KAAK;EACtB,OAAO;CACT;CAEA,MAAM,OAAO,MAAc,MAAyC;EAClE,OAAO;CACT;CAEA,WAAW,OAA0B;EACnC,iBAAiB,KAAK;EACtB,OAAO;CACT;CAEA,WAAW,MAAyB;EAClC,iBAAiB,IAAI;EACrB,OAAO;CACT;AACF;AAEA,IAAa,kBAAb,cAAqC,wBAA8B;CACjE,eAAkC,YAA4C;EAE5E,OAAO;CACT;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,MAAM,OAAO,OAA0B,MAAoD;EACzF,KAAK,MAAM,SAAS,OAClB,iBAAiB,KAAK;EAExB,OAAO;CACT;CAEA,MAAM,OAAO,MAAyB,MAAoD;EACxF,OAAO;CACT;CAEA,WAAW,OAAqC;EAC9C,KAAK,MAAM,SAAS,OAClB,iBAAiB,KAAK;EAExB,OAAO,CAAC,GAAG,KAAK;CAClB;CAEA,WAAW,MAAoC;EAC7C,IAAI,CAAC,MAAM,QAAQ,IAAI,GACrB,OAAO,CAAC;EAEV,OAAO,KAAK,KAAK,UAAU;GACzB,iBAAiB,KAAK;GACtB,OAAO,OAAO,KAAK;EACrB,CAAC;CACH;AACF;AAEA,IAAa,uBAAb,cAA0C,wBAA8B;CACtE,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;;;ACnKA,MAAa,qBACX,6BDsK8B,qBAAqB,OAAO,OAAO,kBAAkB,CCtKtD,CAAgB;;;ACiB/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;CAMzF,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;EAEf,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;CAGH,MAAM,gBACJ,QACA,UACA,MACA,KACA,YACA,aACgB;EAChB,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;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"}