prisma-ltree 0.2.1 → 0.2.2

package/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or Derivative
+          Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright 2026 Jason Procka
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/README.md

@@ -207,9 +207,15 @@ const plan = sql
 | `paths.firstDescendantOf(rhs)`     | `ltree[] ?<@ ltree`    |
 | `paths.firstMatchLquery(pattern)`  | `ltree[] ?~ lquery`    |
 | `paths.firstMatchLtxtquery(query)` | `ltree[] ?@ ltxtquery` |
+| `paths.lcaAll()`                   | `lca(ltree[])`         |
 
 Use `ltreeArray()` for `ltree[]` columns that expose these methods.
 
+`lcaAll` is the array form of `lca`. It is not named `lca` because prisma-next
+keys operations by name only and rejects duplicates; scalar columns already
+expose `path.lca(other, ...)` (see ADR-005). Note it returns SQL NULL for an
+empty `ltree[]`, matching the first-match ops' `nullable: false` convention.
+
 ## Types
 
 ```typescript

package/dist/control.mjs

@@ -1,5 +1,5 @@
 import { a as LTREE_ARRAY_CODEC_ID, i as LTREE_SPACE_ID, n as LTREE_BASELINE_MIGRATION_NAME, o as LTREE_CODEC_ID } from "./contract-space-constants-Da9EC668.mjs";
-import { n as ltreeQueryOperations, t as ltreePackMeta } from "./descriptor-meta-B84muAZG.mjs";
+import { n as ltreeQueryOperations, t as ltreePackMeta } from "./descriptor-meta-Ch66mRPL.mjs";
 import { contractSpaceFromJson } from "@prisma-next/migration-tools/spaces";
 //#region migrations/app/20260619T2142_install_ltree/migration.json
 var migration_default = {

package/dist/{descriptor-meta-B84muAZG.mjs → descriptor-meta-Ch66mRPL.mjs}

@@ -296,6 +296,10 @@ function ltreeQueryOperations() {
 		firstMatchLtxtquery: {
 			self: { codecId: LTREE_ARRAY_CODEC_ID },
 			impl: (self, query) => firstMatchOp("firstMatchLtxtquery", "?@", self, query, TEXT_CODEC_ID, "ltxtquery")
+		},
+		lcaAll: {
+			self: { codecId: LTREE_ARRAY_CODEC_ID },
+			impl: (self) => funcOp("lcaAll", "lca", LTREE_RETURN, [toExpr(self, codecOf(self))])
 		}
 	};
 }
@@ -342,4 +346,4 @@ const ltreePackMeta = {
 //#endregion
 export { ltreeQueryOperations as n, ltreeCodecRegistry as r, ltreePackMeta as t };
 
-//# sourceMappingURL=descriptor-meta-B84muAZG.mjs.map
+//# sourceMappingURL=descriptor-meta-Ch66mRPL.mjs.map

package/dist/{descriptor-meta-B84muAZG.mjs.map → descriptor-meta-Ch66mRPL.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"descriptor-meta-B84muAZG.mjs","names":[],"sources":["../src/core/authoring.ts","../src/core/codecs.ts","../src/core/registry.ts","../src/core/descriptor-meta.ts"],"sourcesContent":["import type { AuthoringTypeNamespace } from \"@prisma-next/framework-components/authoring\";\nimport { LTREE_ARRAY_CODEC_ID, LTREE_CODEC_ID } from \"./constants\";\nimport { LTREE_ARRAY_NATIVE_TYPE, LTREE_NATIVE_TYPE } from \"./contract-space-constants\";\n\nexport const ltreeAuthoringTypes = {\n  ltree: {\n    Ltree: {\n      kind: \"typeConstructor\",\n      output: {\n        codecId: LTREE_CODEC_ID,\n        nativeType: LTREE_NATIVE_TYPE,\n      },\n    },\n    LtreeArray: {\n      kind: \"typeConstructor\",\n      output: {\n        codecId: LTREE_ARRAY_CODEC_ID,\n        nativeType: LTREE_ARRAY_NATIVE_TYPE,\n      },\n    },\n  },\n} as const satisfies AuthoringTypeNamespace;\n","import type { JsonValue } from \"@prisma-next/contract/types\";\nimport {\n  type AnyCodecDescriptor,\n  type CodecCallContext,\n  CodecDescriptorImpl,\n  CodecImpl,\n  type CodecInstanceContext,\n  type ColumnHelperFor,\n  type ColumnHelperForStrict,\n  column,\n  voidParamsSchema,\n} from \"@prisma-next/framework-components/codec\";\nimport type { ExtractCodecTypes } from \"@prisma-next/sql-relational-core/ast\";\nimport type { StandardSchemaV1 } from \"@standard-schema/spec\";\nimport {\n  LTREE_ARRAY_CODEC_ID,\n  LTREE_CODEC_ID,\n  LTREE_MAX_LABEL_LENGTH,\n  LTREE_MAX_LABELS,\n} from \"./constants\";\nimport { LTREE_ARRAY_NATIVE_TYPE, LTREE_NATIVE_TYPE } from \"./contract-space-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\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\nconst LTREE_META = { db: { sql: { postgres: { nativeType: LTREE_NATIVE_TYPE } } } } as const;\n\nexport class LtreeDescriptor extends CodecDescriptorImpl<void> {\n  override readonly codecId = LTREE_CODEC_ID;\n  override readonly traits = [\"equality\", \"order\"] as const;\n  override readonly targetTypes = [LTREE_NATIVE_TYPE] as const;\n  override readonly meta = LTREE_META;\n  override readonly paramsSchema: StandardSchemaV1<void> = voidParamsSchema;\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 = () =>\n  column(ltreeDescriptor.factory(), ltreeDescriptor.codecId, undefined, LTREE_NATIVE_TYPE);\n\nltree satisfies ColumnHelperFor<LtreeDescriptor>;\nltree satisfies ColumnHelperForStrict<LtreeDescriptor>;\n\nconst LTREE_ARRAY_META = {\n  db: { sql: { postgres: { nativeType: LTREE_ARRAY_NATIVE_TYPE } } },\n} as const;\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 CodecDescriptorImpl<void> {\n  override readonly codecId = LTREE_ARRAY_CODEC_ID;\n  override readonly traits = [\"equality\"] as const;\n  override readonly targetTypes = [LTREE_ARRAY_NATIVE_TYPE] as const;\n  override readonly meta = LTREE_ARRAY_META;\n  override readonly paramsSchema: StandardSchemaV1<void> = voidParamsSchema;\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(\n    ltreeArrayDescriptor.factory(),\n    ltreeArrayDescriptor.codecId,\n    undefined,\n    LTREE_ARRAY_NATIVE_TYPE,\n  );\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: readonly AnyCodecDescriptor[] = Object.values(codecDescriptorMap);\n","import { buildCodecDescriptorRegistry } from \"@prisma-next/sql-relational-core/codec-descriptor-registry\";\nimport type { CodecDescriptorRegistry } from \"@prisma-next/sql-relational-core/query-lane-context\";\nimport { codecDescriptors } from \"./codecs\";\n\nexport const ltreeCodecRegistry: CodecDescriptorRegistry =\n  buildCodecDescriptorRegistry(codecDescriptors);\n","import type { AnyExpression } from \"@prisma-next/sql-relational-core/ast\";\nimport {\n  buildOperation,\n  type CodecExpression,\n  codecOf,\n  type Expression,\n  toExpr,\n} from \"@prisma-next/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 { LTREE_ARRAY_NATIVE_TYPE, LTREE_NATIVE_TYPE } from \"./contract-space-constants\";\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 TEXT_ARRAY_CODEC_ID = \"pg/text-array@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      strategy: \"function\",\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        strategy: \"function\",\n        template: `{{self}} ${operator} {{arg0}}`,\n      },\n    });\n  };\n\n  const patternOp = (\n    method: string,\n    operator: string,\n    castType: string,\n    argCodecId: typeof TEXT_CODEC_ID | typeof TEXT_ARRAY_CODEC_ID,\n    self: CodecExpression<typeof LTREE_CODEC_ID, boolean, CT>,\n    arg: unknown,\n  ): BoolReturn => {\n    const selfCodec = codecOf(self);\n    return buildOperation({\n      method,\n      args: [toExpr(self, selfCodec), toExpr(arg, { codecId: argCodecId })],\n      returns: BOOL_RETURN,\n      lowering: {\n        targetFamily: \"sql\",\n        strategy: \"function\",\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\", strategy: \"function\", 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\", strategy: \"function\", 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) =>\n        patternOp(\"matchesLquery\", \"~\", \"lquery\", TEXT_CODEC_ID, self, pattern),\n    },\n    matchesLqueryArray: {\n      self: { codecId: LTREE_CODEC_ID },\n      impl: (self, patterns) =>\n        patternOp(\"matchesLqueryArray\", \"?\", \"lquery[]\", TEXT_ARRAY_CODEC_ID, self, patterns),\n    },\n    matchesLtxtquery: {\n      self: { codecId: LTREE_CODEC_ID },\n      impl: (self, query) =>\n        patternOp(\"matchesLtxtquery\", \"@\", \"ltxtquery\", TEXT_CODEC_ID, 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  };\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  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    storage: [\n      {\n        typeId: LTREE_CODEC_ID,\n        familyId: \"sql\",\n        targetId: \"postgres\",\n        nativeType: LTREE_NATIVE_TYPE,\n      },\n      {\n        typeId: LTREE_ARRAY_CODEC_ID,\n        familyId: \"sql\",\n        targetId: \"postgres\",\n        nativeType: LTREE_ARRAY_NATIVE_TYPE,\n      },\n    ],\n  },\n} as const;\n\nexport const ltreePackMeta: typeof ltreePackMetaBase & {\n  readonly __codecTypes?: CodecTypes;\n} = ltreePackMetaBase;\n"],"mappings":";;;;;AAIA,MAAa,sBAAsB,EACjC,OAAO;CACL,OAAO;EACL,MAAM;EACN,QAAQ;GACN,SAAS;GACT,YAAY;EACd;CACF;CACA,YAAY;EACV,MAAM;EACN,QAAQ;GACN,SAAS;GACT,YAAY;EACd;CACF;AACF,EACF;;;ACCA,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,MAAM,aAAa,EAAE,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,YAAY,kBAAkB,EAAE,EAAE,EAAE;AAElF,IAAa,kBAAb,cAAqC,oBAA0B;CAC7D,UAA4B;CAC5B,SAA2B,CAAC,YAAY,OAAO;CAC/C,cAAgC,CAAC,iBAAiB;CAClD,OAAyB;CACzB,eAAyD;CACzD,mBAAoC;EAClC,OAAO;CACT;CACA,UAA8D;EAC5D,MAAM,SAAS,IAAI,WAAW,IAAI;EAClC,aAAa;CACf;AACF;AAEA,MAAa,kBAAkB,IAAI,gBAAgB;AAQnD,MAAM,mBAAmB,EACvB,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,YAAY,wBAAwB,EAAE,EAAE,EACnE;AAEA,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,oBAA0B;CAClE,UAA4B;CAC5B,SAA2B,CAAC,UAAU;CACtC,cAAgC,CAAC,uBAAuB;CACxD,OAAyB;CACzB,eAAyD;CACzD,mBAAoC;EAClC,OAAO;CACT;CACA,UAAmE;EACjE,MAAM,SAAS,IAAI,gBAAgB,IAAI;EACvC,aAAa;CACf;AACF;AAeA,MAAM,qBAAqB;CACzB,OAAO;CACP,YAAY,IAf0B,qBAe1B;AACd;;;ACzKA,MAAa,qBACX,6BD4K6D,OAAO,OAAO,kBC5K9C,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,sBAAsB;AAC5B,MAAM,eAAe;;;;;;;;;AAUrB,SAAS,OACP,QACA,QACA,SACA,MAC+D;CAE/D,OAAO,eAAe;EACpB;EACA;EACA;EACA,UAAU;GACR,cAAc;GACd,UAAU;GACV,UAAU,GAAG,OAAO,GARH,KAAK,KAAK,GAAG,MAAO,MAAM,IAAI,aAAa,QAAQ,IAAI,EAAE,GAAI,EAAE,KAAK,IAQnD,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;IACV,UAAU,YAAY,SAAS;GACjC;EACF,CAAC;CACH;CAEA,MAAM,aACJ,QACA,UACA,UACA,YACA,MACA,QACe;EAEf,OAAO,eAAe;GACpB;GACA,MAAM,CAAC,OAAO,MAHE,QAAQ,IAGI,CAAC,GAAG,OAAO,KAAK,EAAE,SAAS,WAAW,CAAC,CAAC;GACpE,SAAS;GACT,UAAU;IACR,cAAc;IACd,UAAU;IACV,UAAU,YAAY,SAAS,eAAe;GAChD;EACF,CAAC;CACH;CAQA,MAAM,YACJ,QACA,UACA,SAEA,eAAe;EACb;EACA;EACA,SAAS;EACT,UAAU;GAAE,cAAc;GAAO,UAAU;GAAY;EAAS;CAClE,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,UAAU;IAAY;GAAS;EAClE,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,YACX,UAAU,iBAAiB,KAAK,UAAU,eAAe,MAAM,OAAO;EAC1E;EACA,oBAAoB;GAClB,MAAM,EAAE,SAAS,eAAe;GAChC,OAAO,MAAM,aACX,UAAU,sBAAsB,KAAK,YAAY,qBAAqB,MAAM,QAAQ;EACxF;EACA,kBAAkB;GAChB,MAAM,EAAE,SAAS,eAAe;GAChC,OAAO,MAAM,UACX,UAAU,oBAAoB,KAAK,aAAa,eAAe,MAAM,KAAK;EAC9E;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;CACF;AACF;AAwDA,MAAa,gBAET;CAvDF,MAAM;CACN,IAAI;CACJ,UAAU;CACV,UAAU;CACV,SAAS;CACT,cAAc,EACZ,UAAU,EACR,cAAc,KAChB,EACF;CACA,WAAW,EACT,MAAM,oBACR;CACA,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;EACA,SAAS,CACP;GACE,QAAQ;GACR,UAAU;GACV,UAAU;GACV,YAAY;EACd,GACA;GACE,QAAQ;GACR,UAAU;GACV,UAAU;GACV,YAAY;EACd,CACF;CACF;AAKE"}
+{"version":3,"file":"descriptor-meta-Ch66mRPL.mjs","names":[],"sources":["../src/core/authoring.ts","../src/core/codecs.ts","../src/core/registry.ts","../src/core/descriptor-meta.ts"],"sourcesContent":["import type { AuthoringTypeNamespace } from \"@prisma-next/framework-components/authoring\";\nimport { LTREE_ARRAY_CODEC_ID, LTREE_CODEC_ID } from \"./constants\";\nimport { LTREE_ARRAY_NATIVE_TYPE, LTREE_NATIVE_TYPE } from \"./contract-space-constants\";\n\nexport const ltreeAuthoringTypes = {\n  ltree: {\n    Ltree: {\n      kind: \"typeConstructor\",\n      output: {\n        codecId: LTREE_CODEC_ID,\n        nativeType: LTREE_NATIVE_TYPE,\n      },\n    },\n    LtreeArray: {\n      kind: \"typeConstructor\",\n      output: {\n        codecId: LTREE_ARRAY_CODEC_ID,\n        nativeType: LTREE_ARRAY_NATIVE_TYPE,\n      },\n    },\n  },\n} as const satisfies AuthoringTypeNamespace;\n","import type { JsonValue } from \"@prisma-next/contract/types\";\nimport {\n  type AnyCodecDescriptor,\n  type CodecCallContext,\n  CodecDescriptorImpl,\n  CodecImpl,\n  type CodecInstanceContext,\n  type ColumnHelperFor,\n  type ColumnHelperForStrict,\n  column,\n  voidParamsSchema,\n} from \"@prisma-next/framework-components/codec\";\nimport type { ExtractCodecTypes } from \"@prisma-next/sql-relational-core/ast\";\nimport type { StandardSchemaV1 } from \"@standard-schema/spec\";\nimport {\n  LTREE_ARRAY_CODEC_ID,\n  LTREE_CODEC_ID,\n  LTREE_MAX_LABEL_LENGTH,\n  LTREE_MAX_LABELS,\n} from \"./constants\";\nimport { LTREE_ARRAY_NATIVE_TYPE, LTREE_NATIVE_TYPE } from \"./contract-space-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\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\nconst LTREE_META = { db: { sql: { postgres: { nativeType: LTREE_NATIVE_TYPE } } } } as const;\n\nexport class LtreeDescriptor extends CodecDescriptorImpl<void> {\n  override readonly codecId = LTREE_CODEC_ID;\n  override readonly traits = [\"equality\", \"order\"] as const;\n  override readonly targetTypes = [LTREE_NATIVE_TYPE] as const;\n  override readonly meta = LTREE_META;\n  override readonly paramsSchema: StandardSchemaV1<void> = voidParamsSchema;\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 = () =>\n  column(ltreeDescriptor.factory(), ltreeDescriptor.codecId, undefined, LTREE_NATIVE_TYPE);\n\nltree satisfies ColumnHelperFor<LtreeDescriptor>;\nltree satisfies ColumnHelperForStrict<LtreeDescriptor>;\n\nconst LTREE_ARRAY_META = {\n  db: { sql: { postgres: { nativeType: LTREE_ARRAY_NATIVE_TYPE } } },\n} as const;\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 CodecDescriptorImpl<void> {\n  override readonly codecId = LTREE_ARRAY_CODEC_ID;\n  override readonly traits = [\"equality\"] as const;\n  override readonly targetTypes = [LTREE_ARRAY_NATIVE_TYPE] as const;\n  override readonly meta = LTREE_ARRAY_META;\n  override readonly paramsSchema: StandardSchemaV1<void> = voidParamsSchema;\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(\n    ltreeArrayDescriptor.factory(),\n    ltreeArrayDescriptor.codecId,\n    undefined,\n    LTREE_ARRAY_NATIVE_TYPE,\n  );\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: readonly AnyCodecDescriptor[] = Object.values(codecDescriptorMap);\n","import { buildCodecDescriptorRegistry } from \"@prisma-next/sql-relational-core/codec-descriptor-registry\";\nimport type { CodecDescriptorRegistry } from \"@prisma-next/sql-relational-core/query-lane-context\";\nimport { codecDescriptors } from \"./codecs\";\n\nexport const ltreeCodecRegistry: CodecDescriptorRegistry =\n  buildCodecDescriptorRegistry(codecDescriptors);\n","import type { AnyExpression } from \"@prisma-next/sql-relational-core/ast\";\nimport {\n  buildOperation,\n  type CodecExpression,\n  codecOf,\n  type Expression,\n  toExpr,\n} from \"@prisma-next/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 { LTREE_ARRAY_NATIVE_TYPE, LTREE_NATIVE_TYPE } from \"./contract-space-constants\";\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 TEXT_ARRAY_CODEC_ID = \"pg/text-array@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      strategy: \"function\",\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        strategy: \"function\",\n        template: `{{self}} ${operator} {{arg0}}`,\n      },\n    });\n  };\n\n  const patternOp = (\n    method: string,\n    operator: string,\n    castType: string,\n    argCodecId: typeof TEXT_CODEC_ID | typeof TEXT_ARRAY_CODEC_ID,\n    self: CodecExpression<typeof LTREE_CODEC_ID, boolean, CT>,\n    arg: unknown,\n  ): BoolReturn => {\n    const selfCodec = codecOf(self);\n    return buildOperation({\n      method,\n      args: [toExpr(self, selfCodec), toExpr(arg, { codecId: argCodecId })],\n      returns: BOOL_RETURN,\n      lowering: {\n        targetFamily: \"sql\",\n        strategy: \"function\",\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\", strategy: \"function\", 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\", strategy: \"function\", 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) =>\n        patternOp(\"matchesLquery\", \"~\", \"lquery\", TEXT_CODEC_ID, self, pattern),\n    },\n    matchesLqueryArray: {\n      self: { codecId: LTREE_CODEC_ID },\n      impl: (self, patterns) =>\n        patternOp(\"matchesLqueryArray\", \"?\", \"lquery[]\", TEXT_ARRAY_CODEC_ID, self, patterns),\n    },\n    matchesLtxtquery: {\n      self: { codecId: LTREE_CODEC_ID },\n      impl: (self, query) =>\n        patternOp(\"matchesLtxtquery\", \"@\", \"ltxtquery\", TEXT_CODEC_ID, 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  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    storage: [\n      {\n        typeId: LTREE_CODEC_ID,\n        familyId: \"sql\",\n        targetId: \"postgres\",\n        nativeType: LTREE_NATIVE_TYPE,\n      },\n      {\n        typeId: LTREE_ARRAY_CODEC_ID,\n        familyId: \"sql\",\n        targetId: \"postgres\",\n        nativeType: LTREE_ARRAY_NATIVE_TYPE,\n      },\n    ],\n  },\n} as const;\n\nexport const ltreePackMeta: typeof ltreePackMetaBase & {\n  readonly __codecTypes?: CodecTypes;\n} = ltreePackMetaBase;\n"],"mappings":";;;;;AAIA,MAAa,sBAAsB,EACjC,OAAO;CACL,OAAO;EACL,MAAM;EACN,QAAQ;GACN,SAAS;GACT,YAAY;EACd;CACF;CACA,YAAY;EACV,MAAM;EACN,QAAQ;GACN,SAAS;GACT,YAAY;EACd;CACF;AACF,EACF;;;ACCA,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,MAAM,aAAa,EAAE,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,YAAY,kBAAkB,EAAE,EAAE,EAAE;AAElF,IAAa,kBAAb,cAAqC,oBAA0B;CAC7D,UAA4B;CAC5B,SAA2B,CAAC,YAAY,OAAO;CAC/C,cAAgC,CAAC,iBAAiB;CAClD,OAAyB;CACzB,eAAyD;CACzD,mBAAoC;EAClC,OAAO;CACT;CACA,UAA8D;EAC5D,MAAM,SAAS,IAAI,WAAW,IAAI;EAClC,aAAa;CACf;AACF;AAEA,MAAa,kBAAkB,IAAI,gBAAgB;AAQnD,MAAM,mBAAmB,EACvB,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,YAAY,wBAAwB,EAAE,EAAE,EACnE;AAEA,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,oBAA0B;CAClE,UAA4B;CAC5B,SAA2B,CAAC,UAAU;CACtC,cAAgC,CAAC,uBAAuB;CACxD,OAAyB;CACzB,eAAyD;CACzD,mBAAoC;EAClC,OAAO;CACT;CACA,UAAmE;EACjE,MAAM,SAAS,IAAI,gBAAgB,IAAI;EACvC,aAAa;CACf;AACF;AAeA,MAAM,qBAAqB;CACzB,OAAO;CACP,YAAY,IAf0B,qBAe1B;AACd;;;ACzKA,MAAa,qBACX,6BD4K6D,OAAO,OAAO,kBC5K9C,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,sBAAsB;AAC5B,MAAM,eAAe;;;;;;;;;AAUrB,SAAS,OACP,QACA,QACA,SACA,MAC+D;CAE/D,OAAO,eAAe;EACpB;EACA;EACA;EACA,UAAU;GACR,cAAc;GACd,UAAU;GACV,UAAU,GAAG,OAAO,GARH,KAAK,KAAK,GAAG,MAAO,MAAM,IAAI,aAAa,QAAQ,IAAI,EAAE,GAAI,EAAE,KAAK,IAQnD,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;IACV,UAAU,YAAY,SAAS;GACjC;EACF,CAAC;CACH;CAEA,MAAM,aACJ,QACA,UACA,UACA,YACA,MACA,QACe;EAEf,OAAO,eAAe;GACpB;GACA,MAAM,CAAC,OAAO,MAHE,QAAQ,IAGI,CAAC,GAAG,OAAO,KAAK,EAAE,SAAS,WAAW,CAAC,CAAC;GACpE,SAAS;GACT,UAAU;IACR,cAAc;IACd,UAAU;IACV,UAAU,YAAY,SAAS,eAAe;GAChD;EACF,CAAC;CACH;CAQA,MAAM,YACJ,QACA,UACA,SAEA,eAAe;EACb;EACA;EACA,SAAS;EACT,UAAU;GAAE,cAAc;GAAO,UAAU;GAAY;EAAS;CAClE,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,UAAU;IAAY;GAAS;EAClE,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,YACX,UAAU,iBAAiB,KAAK,UAAU,eAAe,MAAM,OAAO;EAC1E;EACA,oBAAoB;GAClB,MAAM,EAAE,SAAS,eAAe;GAChC,OAAO,MAAM,aACX,UAAU,sBAAsB,KAAK,YAAY,qBAAqB,MAAM,QAAQ;EACxF;EACA,kBAAkB;GAChB,MAAM,EAAE,SAAS,eAAe;GAChC,OAAO,MAAM,UACX,UAAU,oBAAoB,KAAK,aAAa,eAAe,MAAM,KAAK;EAC9E;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;AAwDA,MAAa,gBAET;CAvDF,MAAM;CACN,IAAI;CACJ,UAAU;CACV,UAAU;CACV,SAAS;CACT,cAAc,EACZ,UAAU,EACR,cAAc,KAChB,EACF;CACA,WAAW,EACT,MAAM,oBACR;CACA,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;EACA,SAAS,CACP;GACE,QAAQ;GACR,UAAU;GACV,UAAU;GACV,YAAY;EACd,GACA;GACE,QAAQ;GACR,UAAU;GACV,UAAU;GACV,YAAY;EACd,CACF;CACF;AAKE"}

package/dist/{operation-types-CP6jqHAZ.d.mts → operation-types-BFxNrlNL.d.mts}

@@ -178,7 +178,16 @@ type QueryOperationTypes<CT extends CodecTypesBase> = SqlQueryOperationTypes<CT,
       readonly nullable: false;
     }>;
   };
+  readonly lcaAll: {
+    readonly self: {
+      readonly codecId: "pg/ltree-array@1";
+    };
+    readonly impl: (self: CodecExpression<"pg/ltree-array@1", boolean, CT>) => Expression<{
+      readonly codecId: "pg/ltree@1";
+      readonly nullable: false;
+    }>;
+  };
 }>;
 //#endregion
 export { QueryOperationTypes as t };
-//# sourceMappingURL=operation-types-CP6jqHAZ.d.mts.map
+//# sourceMappingURL=operation-types-BFxNrlNL.d.mts.map

package/dist/{operation-types-CP6jqHAZ.d.mts.map → operation-types-BFxNrlNL.d.mts.map}

@@ -1 +1 @@
-{"version":3,"file":"operation-types-CP6jqHAZ.d.mts","names":[],"sources":["../src/types/operation-types.ts"],"mappings":";;;;KAGK,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;AAAA"}
+{"version":3,"file":"operation-types-BFxNrlNL.d.mts","names":[],"sources":["../src/types/operation-types.ts"],"mappings":";;;;KAGK,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"}

package/dist/operation-types.d.mts

@@ -1,2 +1,2 @@
-import { t as QueryOperationTypes } from "./operation-types-CP6jqHAZ.mjs";
+import { t as QueryOperationTypes } from "./operation-types-BFxNrlNL.mjs";
 export type { QueryOperationTypes };

package/dist/pack.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"pack.d.mts","names":[],"sources":["../src/core/descriptor-meta.ts"],"mappings":";;cAiSM,iBAAA;EAAA,SACJ,IAAA;EAAA,SACA,EAAA;EAAA,SACA,QAAA;EAAA,SACA,QAAA;EAAA,SACA,OAAA;EAAA,SACA,YAAA;IAAA,SACE,QAAA;MAAA,SACE,YAAA;IAAA;EAAA;EAAA,SAGJ,SAAA;IAAA,SACE,IAAA;MAAA;;;;;;;;;;;;;;;;;;WAEF,KAAA;IAAA,SACE,UAAA;MAAA,SACE,gBAAA,oDAAgB,eAAA;MAAA,SAChB,MAAA;QAAA,SACE,OAAA;QAAA,SACA,KAAA;QAAA,SACA,KAAA;MAAA;MAAA,SAEF,WAAA;QAAA,SAEI,OAAA;QAAA,SACA,KAAA;QAAA,SACA,KAAA;MAAA;IAAA;IAAA,SAIN,mBAAA;MAAA,SACE,MAAA;QAAA,SACE,OAAA;QAAA,SACA,KAAA;QAAA,SACA,KAAA;MAAA;IAAA;IAAA,SAGJ,OAAA;MAAA,SAEI,MAAA;MAAA,SACA,QAAA;MAAA,SACA,QAAA;MAAA,SACA,UAAA;IAAA;MAAA,SAGA,MAAA;MAAA,SACA,QAAA;MAAA,SACA,QAAA;MAAA,SACA,UAAA;IAAA;EAAA;AAAA;AAAA,cAMK,aAAA,SAAsB,iBAAA;EAAA,SACxB,YAAA,GAAe,UAAU;AAAA"}
+{"version":3,"file":"pack.d.mts","names":[],"sources":["../src/core/descriptor-meta.ts"],"mappings":";;cA6SM,iBAAA;EAAA,SACJ,IAAA;EAAA,SACA,EAAA;EAAA,SACA,QAAA;EAAA,SACA,QAAA;EAAA,SACA,OAAA;EAAA,SACA,YAAA;IAAA,SACE,QAAA;MAAA,SACE,YAAA;IAAA;EAAA;EAAA,SAGJ,SAAA;IAAA,SACE,IAAA;MAAA;;;;;;;;;;;;;;;;;;WAEF,KAAA;IAAA,SACE,UAAA;MAAA,SACE,gBAAA,oDAAgB,eAAA;MAAA,SAChB,MAAA;QAAA,SACE,OAAA;QAAA,SACA,KAAA;QAAA,SACA,KAAA;MAAA;MAAA,SAEF,WAAA;QAAA,SAEI,OAAA;QAAA,SACA,KAAA;QAAA,SACA,KAAA;MAAA;IAAA;IAAA,SAIN,mBAAA;MAAA,SACE,MAAA;QAAA,SACE,OAAA;QAAA,SACA,KAAA;QAAA,SACA,KAAA;MAAA;IAAA;IAAA,SAGJ,OAAA;MAAA,SAEI,MAAA;MAAA,SACA,QAAA;MAAA,SACA,QAAA;MAAA,SACA,UAAA;IAAA;MAAA,SAGA,MAAA;MAAA,SACA,QAAA;MAAA,SACA,QAAA;MAAA,SACA,UAAA;IAAA;EAAA;AAAA;AAAA,cAMK,aAAA,SAAsB,iBAAA;EAAA,SACxB,YAAA,GAAe,UAAU;AAAA"}

package/dist/pack.mjs

@@ -1,2 +1,2 @@
-import { t as ltreePackMeta } from "./descriptor-meta-B84muAZG.mjs";
+import { t as ltreePackMeta } from "./descriptor-meta-Ch66mRPL.mjs";
 export { ltreePackMeta as default };

package/dist/runtime.mjs

@@ -1,4 +1,4 @@
-import { n as ltreeQueryOperations, r as ltreeCodecRegistry, t as ltreePackMeta } from "./descriptor-meta-B84muAZG.mjs";
+import { n as ltreeQueryOperations, r as ltreeCodecRegistry, t as ltreePackMeta } from "./descriptor-meta-Ch66mRPL.mjs";
 //#region src/exports/runtime.ts
 const ltreeRuntimeDescriptor = {
 	kind: "extension",

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "prisma-ltree",
-  "version": "0.2.1",
+  "version": "0.2.2",
   "description": "Prisma Next extension pack for PostgreSQL's ltree hierarchical tree data type.",
   "homepage": "https://prisma-ltree.procka.org",
   "license": "Apache-2.0",

package/src/core/descriptor-meta.ts

@@ -284,6 +284,18 @@ export function ltreeQueryOperations<CT extends CodecTypesBase>(): QueryOperatio
       impl: (self, query) =>
         firstMatchOp("firstMatchLtxtquery", "?@", self, query, TEXT_CODEC_ID, "ltxtquery"),
     },
+    // `lca(ltree[])` — array-receiver form (ADR-001, ADR-005). Named `lcaAll`
+    // because prisma-next keys operations by name only (`createOperationRegistry`
+    // throws on a duplicate); `lca` is already the variadic scalar method on
+    // `pg/ltree@1`. Declares `nullable: false` for parity with the Tier 3
+    // first-match ops even though PG returns NULL for an empty/NULL `ltree[]`
+    // (see the empty-array integration test) — a family-wide gap, not specific
+    // to `lcaAll`.
+    lcaAll: {
+      self: { codecId: LTREE_ARRAY_CODEC_ID },
+      impl: (self): LtreeReturn =>
+        funcOp("lcaAll", "lca", LTREE_RETURN, [toExpr(self, codecOf(self))]),
+    },
   };
 }
 

package/src/types/operation-types.ts

@@ -152,5 +152,15 @@ export type QueryOperationTypes<CT extends CodecTypesBase> = SqlQueryOperationTy
         query: CodecExpression<"pg/text@1", boolean, CT>,
       ) => Expression<{ readonly codecId: "pg/ltree@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
+    // an empty/NULL array — a shared Tier 3 gap, tracked separately).
+    readonly lcaAll: {
+      readonly self: { readonly codecId: "pg/ltree-array@1" };
+      readonly impl: (
+        self: CodecExpression<"pg/ltree-array@1", boolean, CT>,
+      ) => Expression<{ readonly codecId: "pg/ltree@1"; readonly nullable: false }>;
+    };
   }
 >;