@niscorp/prism 0.3.0 → 0.3.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/CHANGELOG.md +16 -0
- package/DOCS.md +4 -2
- package/README.md +10 -2
- package/dist/agent.cjs +7 -9
- package/dist/agent.cjs.map +1 -1
- package/dist/agent.js +5 -7
- package/dist/agent.js.map +1 -1
- package/dist/{chunk-66YSI4PX.cjs → chunk-6PD7M2F3.cjs} +2 -19
- package/dist/chunk-6PD7M2F3.cjs.map +1 -0
- package/dist/{chunk-BKXCULZV.js → chunk-GK4CIKKT.js} +3 -10
- package/dist/chunk-GK4CIKKT.js.map +1 -0
- package/dist/{chunk-OLZQK2ZF.cjs → chunk-OWKINPR5.cjs} +5 -12
- package/dist/chunk-OWKINPR5.cjs.map +1 -0
- package/dist/{chunk-7VMFSXBM.js → chunk-WKS4OCKN.js} +2 -19
- package/dist/chunk-WKS4OCKN.js.map +1 -0
- package/dist/examples/index.cjs.map +1 -1
- package/dist/examples/index.js.map +1 -1
- package/dist/index.cjs +262 -265
- package/dist/index.cjs.map +1 -1
- package/dist/index.js +6 -9
- package/dist/index.js.map +1 -1
- package/dist/migrations/index.cjs +4 -21
- package/dist/migrations/index.cjs.map +1 -1
- package/dist/migrations/index.js +3 -20
- package/dist/migrations/index.js.map +1 -1
- package/package.json +7 -7
- package/dist/chunk-66YSI4PX.cjs.map +0 -1
- package/dist/chunk-7VMFSXBM.js.map +0 -1
- package/dist/chunk-BKXCULZV.js.map +0 -1
- package/dist/chunk-OLZQK2ZF.cjs.map +0 -1
package/CHANGELOG.md
CHANGED
|
@@ -1,5 +1,21 @@
|
|
|
1
1
|
# @niscorp/prism
|
|
2
2
|
|
|
3
|
+
## 0.3.1
|
|
4
|
+
|
|
5
|
+
### Patch Changes
|
|
6
|
+
|
|
7
|
+
- f55fcbe: DOCS.md and the README state seven facts about the API that were written only in source comments.
|
|
8
|
+
|
|
9
|
+
DOCS.md: a negative index in a `$ref` path is refused, the generated JSON Schema does not carry the `$ref` path rule, and `maxValues` counts a value each time it appears. README: an example's `id` is unique and in kebab-case, an example of several operators has no `op`, which ops `MAPPING_OPS` leaves out, and that the mapping agent's `data` is the config itself.
|
|
10
|
+
|
|
11
|
+
No behaviour changed.
|
|
12
|
+
|
|
13
|
+
**What to change:** nothing.
|
|
14
|
+
|
|
15
|
+
- 89adcc3: The optimizer no longer keeps a local `isPlainObject` that only called `isJsonObject`; its three uses call `isJsonObject`. Prism's own `isPlainObject` means an object with no `$` key, and the local one of the same name meant any JSON object. No behaviour changed.
|
|
16
|
+
|
|
17
|
+
**What to change:** nothing.
|
|
18
|
+
|
|
3
19
|
## 0.3.0
|
|
4
20
|
|
|
5
21
|
### Minor Changes
|
package/DOCS.md
CHANGED
|
@@ -44,7 +44,7 @@ If `$.user.nickname` doesn't exist, the result is `{ "name": "Alice" }` — no e
|
|
|
44
44
|
|
|
45
45
|
### `$ref` — Read from source
|
|
46
46
|
|
|
47
|
-
Resolves a path against the source data. A path is keys and indexes: `.key` and `[index]`. The rest of JSONPath — a wildcard `[*]`, a filter `[?(…)]`, a slice, a quoted key, `..` — is refused when the config is checked (`E_SCHEMA`, "Not a path Prism reads"); for every item of a list use `$map` or `$pluck`.
|
|
47
|
+
Resolves a path against the source data. A path is keys and indexes: `.key` and `[index]`. The rest of JSONPath — a wildcard `[*]`, a filter `[?(…)]`, a slice, a negative index, a quoted key, `..` — is refused when the config is checked (`E_SCHEMA`, "Not a path Prism reads"); for every item of a list use `$map` or `$pluck`. The JSON Schema from `getConfigJsonSchema`, `getNodeJsonSchema` and `getProfileJsonSchema` does not carry this rule: its pattern for `$ref` is `^\$(\..*)?$`, so a path can pass the JSON Schema and still be refused by `validate`.
|
|
48
48
|
|
|
49
49
|
```json
|
|
50
50
|
{ "$ref": "$.user.name" }
|
|
@@ -812,7 +812,9 @@ third argument: a `Partial<Limits>`, merged over `DEFAULT_LIMITS`:
|
|
|
812
812
|
| `maxStringLength` | `1_000_000` | Characters in any one string a node produces |
|
|
813
813
|
| `maxValues` | `1_000_000` | Values (scalars, array items, object fields) in a `$reduce` accumulator, a `$with` binding, or the result |
|
|
814
814
|
|
|
815
|
-
Past any of them the evaluation throws `E_BUDGET`.
|
|
815
|
+
Past any of them the evaluation throws `E_BUDGET`. `maxValues` counts a value
|
|
816
|
+
each time it appears, as it would be serialized: a `$reduce` whose body is
|
|
817
|
+
`[{ "$var": "acc" }, { "$var": "acc" }]` doubles its count with every item.
|
|
816
818
|
|
|
817
819
|
## Error Codes
|
|
818
820
|
|
package/README.md
CHANGED
|
@@ -107,6 +107,9 @@ form that does not need the config object to be the same one.
|
|
|
107
107
|
`@niscorp/prism/examples` is the reference as data: one example for each
|
|
108
108
|
operator, named by the operator — a config, the source it is given, and what
|
|
109
109
|
comes out — then a few configs of several operators working together.
|
|
110
|
+
Each `id` is unique across the set and in kebab-case (`sort-by` for `$sortBy`),
|
|
111
|
+
so an address can be built on it. An example of several operators working
|
|
112
|
+
together has no `op`.
|
|
110
113
|
|
|
111
114
|
```typescript
|
|
112
115
|
import { evaluate } from '@niscorp/prism';
|
|
@@ -130,9 +133,14 @@ own. So whatever shows them — a documentation page, an agent reading
|
|
|
130
133
|
`getProfileJsonSchema(ops, target?)` is the config JSON Schema documenting only
|
|
131
134
|
the ops you name — derived from the full schema, never restated. `MAPPING_OPS`
|
|
132
135
|
is the set a mapping uses (rows into a shape), about 28% less prompt than the
|
|
133
|
-
whole grammar; the mapping agent is documented with it.
|
|
134
|
-
|
|
136
|
+
whole grammar; the mapping agent is documented with it. That agent's `data` is
|
|
137
|
+
the Prism config itself, and its `reasoning` is one sentence on the mapping. A
|
|
138
|
+
profile narrows what a prompt teaches, never what Prism accepts: validation is always the full
|
|
135
139
|
`ConfigSchema`, and a config using an op outside the profile is still valid.
|
|
140
|
+
`MAPPING_OPS` leaves out the transform ops (`$has`, `$renameKeys`, `$update`,
|
|
141
|
+
`$assert`, `$walk`) and `$fill`, `$replace`, `$keyBy`, `$entriesOf`,
|
|
142
|
+
`$fromEntries`, `$keys`, `$values`, `$type`, `$flatten`, `$flatMap`, `$match`,
|
|
143
|
+
`$drop`, `$dateAdd`, `$startsWith` and `$endsWith`.
|
|
136
144
|
|
|
137
145
|
## Transform ops and the grammar
|
|
138
146
|
|
package/dist/agent.cjs
CHANGED
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
'use strict';
|
|
2
2
|
|
|
3
|
-
var
|
|
4
|
-
var
|
|
3
|
+
var chunkOWKINPR5_cjs = require('./chunk-OWKINPR5.cjs');
|
|
4
|
+
var chunk6PD7M2F3_cjs = require('./chunk-6PD7M2F3.cjs');
|
|
5
5
|
var zod = require('zod');
|
|
6
6
|
var cortex = require('@niscorp/cortex');
|
|
7
7
|
|
|
@@ -21,17 +21,15 @@ Worked example (illustrative only \u2014 read the schema for op details):
|
|
|
21
21
|
INPUT { "sampleInput": { "first": "Ada", "last": "Lovelace" }, "targetShape": { "fullName": "" } }
|
|
22
22
|
data { "fullName": { "$interpolate": { "template": "{{f}} {{l}}", "values": { "f": { "$ref": "$.first" }, "l": { "$ref": "$.last" } } } } }`;
|
|
23
23
|
var OUTPUT_DOC = `OUTPUT SCHEMA \u2014 your output MUST validate against this JSON Schema:
|
|
24
|
-
${JSON.stringify(
|
|
24
|
+
${JSON.stringify(chunkOWKINPR5_cjs.getProfileJsonSchema(chunkOWKINPR5_cjs.MAPPING_OPS, "draft-7"))}`;
|
|
25
25
|
var mappingAgent = cortex.defineAgent({
|
|
26
26
|
id: "prism.mapping",
|
|
27
27
|
description: "Generates a Prism transformation config from a sample input row and a target shape.",
|
|
28
28
|
instructions: INSTRUCTIONS,
|
|
29
|
-
// Validated against the
|
|
30
|
-
//
|
|
31
|
-
//
|
|
32
|
-
|
|
33
|
-
// so the finish protocol's "OUTPUT SCHEMA" still names it.
|
|
34
|
-
output: { schema: chunk66YSI4PX_cjs.ConfigSchema, doc: OUTPUT_DOC }
|
|
29
|
+
// Validated against the full grammar, documented with the mapping profile:
|
|
30
|
+
// a config using an op outside the profile is still accepted. The doc keeps
|
|
31
|
+
// cortex's own heading, "OUTPUT SCHEMA", which its finish protocol names.
|
|
32
|
+
output: { schema: chunk6PD7M2F3_cjs.ConfigSchema, doc: OUTPUT_DOC }
|
|
35
33
|
});
|
|
36
34
|
|
|
37
35
|
exports.MappingAgentInputSchema = MappingAgentInputSchema;
|
package/dist/agent.cjs.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"sources":["../src/agent/mapping-agent.ts"],"names":["z","getProfileJsonSchema","MAPPING_OPS","defineAgent","ConfigSchema"],"mappings":";;;;;;;
|
|
1
|
+
{"version":3,"sources":["../src/agent/mapping-agent.ts"],"names":["z","getProfileJsonSchema","MAPPING_OPS","defineAgent","ConfigSchema"],"mappings":";;;;;;;AAOO,IAAM,uBAAA,GAA0BA,MAAE,MAAA,CAAO;AAAA,EAC9C,WAAA,EAAaA,KAAA,CACV,MAAA,CAAOA,KAAA,CAAE,MAAA,EAAO,EAAGA,KAAA,CAAE,OAAA,EAAS,CAAA,CAC9B,QAAA,CAAS,qFAAqF,CAAA;AAAA,EACjG,WAAA,EAAaA,KAAA,CACV,OAAA,EAAQ,CACR,QAAA;AAAA,IACC;AAAA,GACF;AAAA,EACF,iBAAA,EAAmBA,KAAA,CAChB,MAAA,CAAOA,KAAA,CAAE,MAAA,EAAO,EAAGA,KAAA,CAAE,MAAA,EAAQ,CAAA,CAC7B,QAAA,EAAS,CACT,SAAS,sFAAsF,CAAA;AAAA,EAClG,OAAOA,KAAA,CACJ,MAAA,GACA,QAAA,EAAS,CACT,SAAS,8DAA8D;AAC5E,CAAC;AAMD,IAAM,YAAA,GAAe,CAAA;;AAAA;;AAAA;AAAA;AAAA,6IAAA,CAAA;AAQrB,IAAM,UAAA,GAAa,CAAA;AAAA,EAAwE,KAAK,SAAA,CAAUC,sCAAA,CAAqBC,6BAAA,EAAa,SAAS,CAAC,CAAC,CAAA,CAAA;AAEhJ,IAAM,eAAwCC,kBAAA,CAAoB;AAAA,EACvE,EAAA,EAAI,eAAA;AAAA,EACJ,WAAA,EAAa,qFAAA;AAAA,EACb,YAAA,EAAc,YAAA;AAAA;AAAA;AAAA;AAAA,EAId,MAAA,EAAQ,EAAE,MAAA,EAAQC,8BAAA,EAAc,KAAK,UAAA;AACvC,CAAC","file":"agent.cjs","sourcesContent":["import { z } from 'zod';\nimport { defineAgent, type AgentDefinition } from '@niscorp/cortex';\n\nimport { ConfigSchema, type Config } from '../schemas';\nimport { MAPPING_OPS } from '../schemas/profiles';\nimport { getProfileJsonSchema } from '../engine/documentation';\n\nexport const MappingAgentInputSchema = z.object({\n sampleInput: z\n .record(z.string(), z.unknown())\n .describe('A representative input row. The transformation will run against rows of this shape.'),\n targetShape: z\n .unknown()\n .describe(\n 'A JSON example of the desired output shape. Field values are placeholders; the agent infers the structure from this example.',\n ),\n fieldDescriptions: z\n .record(z.string(), z.string())\n .optional()\n .describe('Optional human-readable descriptions for fields the agent might not infer correctly.'),\n notes: z\n .string()\n .optional()\n .describe('Free-form additional context (data quirks, semantics, etc.).'),\n});\n\nexport type MappingAgentInput = z.infer<typeof MappingAgentInputSchema>;\n\nexport type MappingAgentOutput = Config;\n\nconst INSTRUCTIONS = `You are the Prism mapping agent. Given a sample input row and a target output shape, produce a Prism Config that maps rows of the input shape into the target shape.\n\nYour envelope's \\`data\\` is the Prism Config; \\`reasoning\\` is a one-sentence explanation of the mapping. The config must validate against the OUTPUT SCHEMA below (every constraint, format rule and example is in the schema's field descriptions).\n\nWorked example (illustrative only — read the schema for op details):\nINPUT { \"sampleInput\": { \"first\": \"Ada\", \"last\": \"Lovelace\" }, \"targetShape\": { \"fullName\": \"\" } }\ndata { \"fullName\": { \"$interpolate\": { \"template\": \"{{f}} {{l}}\", \"values\": { \"f\": { \"$ref\": \"$.first\" }, \"l\": { \"$ref\": \"$.last\" } } } } }`;\n\nconst OUTPUT_DOC = `OUTPUT SCHEMA — your output MUST validate against this JSON Schema:\\n${JSON.stringify(getProfileJsonSchema(MAPPING_OPS, 'draft-7'))}`;\n\nexport const mappingAgent: AgentDefinition<Config> = defineAgent<Config>({\n id: 'prism.mapping',\n description: 'Generates a Prism transformation config from a sample input row and a target shape.',\n instructions: INSTRUCTIONS,\n // Validated against the full grammar, documented with the mapping profile:\n // a config using an op outside the profile is still accepted. The doc keeps\n // cortex's own heading, \"OUTPUT SCHEMA\", which its finish protocol names.\n output: { schema: ConfigSchema, doc: OUTPUT_DOC },\n});\n"]}
|
package/dist/agent.js
CHANGED
|
@@ -1,5 +1,5 @@
|
|
|
1
|
-
import { getProfileJsonSchema, MAPPING_OPS } from './chunk-
|
|
2
|
-
import { ConfigSchema } from './chunk-
|
|
1
|
+
import { getProfileJsonSchema, MAPPING_OPS } from './chunk-GK4CIKKT.js';
|
|
2
|
+
import { ConfigSchema } from './chunk-WKS4OCKN.js';
|
|
3
3
|
import { z } from 'zod';
|
|
4
4
|
import { defineAgent } from '@niscorp/cortex';
|
|
5
5
|
|
|
@@ -24,11 +24,9 @@ var mappingAgent = defineAgent({
|
|
|
24
24
|
id: "prism.mapping",
|
|
25
25
|
description: "Generates a Prism transformation config from a sample input row and a target shape.",
|
|
26
26
|
instructions: INSTRUCTIONS,
|
|
27
|
-
// Validated against the
|
|
28
|
-
//
|
|
29
|
-
//
|
|
30
|
-
// (schemas/profiles.ts). The heading is cortex's own (context/schema-doc.ts),
|
|
31
|
-
// so the finish protocol's "OUTPUT SCHEMA" still names it.
|
|
27
|
+
// Validated against the full grammar, documented with the mapping profile:
|
|
28
|
+
// a config using an op outside the profile is still accepted. The doc keeps
|
|
29
|
+
// cortex's own heading, "OUTPUT SCHEMA", which its finish protocol names.
|
|
32
30
|
output: { schema: ConfigSchema, doc: OUTPUT_DOC }
|
|
33
31
|
});
|
|
34
32
|
|
package/dist/agent.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"sources":["../src/agent/mapping-agent.ts"],"names":[],"mappings":";;;;;
|
|
1
|
+
{"version":3,"sources":["../src/agent/mapping-agent.ts"],"names":[],"mappings":";;;;;AAOO,IAAM,uBAAA,GAA0B,EAAE,MAAA,CAAO;AAAA,EAC9C,WAAA,EAAa,CAAA,CACV,MAAA,CAAO,CAAA,CAAE,MAAA,EAAO,EAAG,CAAA,CAAE,OAAA,EAAS,CAAA,CAC9B,QAAA,CAAS,qFAAqF,CAAA;AAAA,EACjG,WAAA,EAAa,CAAA,CACV,OAAA,EAAQ,CACR,QAAA;AAAA,IACC;AAAA,GACF;AAAA,EACF,iBAAA,EAAmB,CAAA,CAChB,MAAA,CAAO,CAAA,CAAE,MAAA,EAAO,EAAG,CAAA,CAAE,MAAA,EAAQ,CAAA,CAC7B,QAAA,EAAS,CACT,SAAS,sFAAsF,CAAA;AAAA,EAClG,OAAO,CAAA,CACJ,MAAA,GACA,QAAA,EAAS,CACT,SAAS,8DAA8D;AAC5E,CAAC;AAMD,IAAM,YAAA,GAAe,CAAA;;AAAA;;AAAA;AAAA;AAAA,6IAAA,CAAA;AAQrB,IAAM,UAAA,GAAa,CAAA;AAAA,EAAwE,KAAK,SAAA,CAAU,oBAAA,CAAqB,WAAA,EAAa,SAAS,CAAC,CAAC,CAAA,CAAA;AAEhJ,IAAM,eAAwC,WAAA,CAAoB;AAAA,EACvE,EAAA,EAAI,eAAA;AAAA,EACJ,WAAA,EAAa,qFAAA;AAAA,EACb,YAAA,EAAc,YAAA;AAAA;AAAA;AAAA;AAAA,EAId,MAAA,EAAQ,EAAE,MAAA,EAAQ,YAAA,EAAc,KAAK,UAAA;AACvC,CAAC","file":"agent.js","sourcesContent":["import { z } from 'zod';\nimport { defineAgent, type AgentDefinition } from '@niscorp/cortex';\n\nimport { ConfigSchema, type Config } from '../schemas';\nimport { MAPPING_OPS } from '../schemas/profiles';\nimport { getProfileJsonSchema } from '../engine/documentation';\n\nexport const MappingAgentInputSchema = z.object({\n sampleInput: z\n .record(z.string(), z.unknown())\n .describe('A representative input row. The transformation will run against rows of this shape.'),\n targetShape: z\n .unknown()\n .describe(\n 'A JSON example of the desired output shape. Field values are placeholders; the agent infers the structure from this example.',\n ),\n fieldDescriptions: z\n .record(z.string(), z.string())\n .optional()\n .describe('Optional human-readable descriptions for fields the agent might not infer correctly.'),\n notes: z\n .string()\n .optional()\n .describe('Free-form additional context (data quirks, semantics, etc.).'),\n});\n\nexport type MappingAgentInput = z.infer<typeof MappingAgentInputSchema>;\n\nexport type MappingAgentOutput = Config;\n\nconst INSTRUCTIONS = `You are the Prism mapping agent. Given a sample input row and a target output shape, produce a Prism Config that maps rows of the input shape into the target shape.\n\nYour envelope's \\`data\\` is the Prism Config; \\`reasoning\\` is a one-sentence explanation of the mapping. The config must validate against the OUTPUT SCHEMA below (every constraint, format rule and example is in the schema's field descriptions).\n\nWorked example (illustrative only — read the schema for op details):\nINPUT { \"sampleInput\": { \"first\": \"Ada\", \"last\": \"Lovelace\" }, \"targetShape\": { \"fullName\": \"\" } }\ndata { \"fullName\": { \"$interpolate\": { \"template\": \"{{f}} {{l}}\", \"values\": { \"f\": { \"$ref\": \"$.first\" }, \"l\": { \"$ref\": \"$.last\" } } } } }`;\n\nconst OUTPUT_DOC = `OUTPUT SCHEMA — your output MUST validate against this JSON Schema:\\n${JSON.stringify(getProfileJsonSchema(MAPPING_OPS, 'draft-7'))}`;\n\nexport const mappingAgent: AgentDefinition<Config> = defineAgent<Config>({\n id: 'prism.mapping',\n description: 'Generates a Prism transformation config from a sample input row and a target shape.',\n instructions: INSTRUCTIONS,\n // Validated against the full grammar, documented with the mapping profile:\n // a config using an op outside the profile is still accepted. The doc keeps\n // cortex's own heading, \"OUTPUT SCHEMA\", which its finish protocol names.\n output: { schema: ConfigSchema, doc: OUTPUT_DOC },\n});\n"]}
|
|
@@ -11,9 +11,7 @@ var ErrorCode = {
|
|
|
11
11
|
DATE_INVALID: "E_DATE_INVALID",
|
|
12
12
|
VAR_NOT_FOUND: "E_VAR_NOT_FOUND",
|
|
13
13
|
NODE_SHAPE: "E_NODE_SHAPE",
|
|
14
|
-
// A config's own `$assert` refused its input.
|
|
15
14
|
ASSERT: "E_ASSERT",
|
|
16
|
-
// An evaluation past its budget (engine/budget.ts).
|
|
17
15
|
BUDGET: "E_BUDGET"
|
|
18
16
|
};
|
|
19
17
|
var PrismError = class extends Error {
|
|
@@ -753,13 +751,11 @@ var NodeUnion = zod.z.core.$constructor("PrismNodeUnion", (inst, def) => {
|
|
|
753
751
|
});
|
|
754
752
|
var NodeSchema = zod.z.lazy(
|
|
755
753
|
() => new NodeUnion({ type: "union", options: [
|
|
756
|
-
// Core
|
|
757
754
|
RefNodeSchema,
|
|
758
755
|
ConstNodeSchema,
|
|
759
756
|
VarNodeSchema,
|
|
760
757
|
GetNodeSchema,
|
|
761
758
|
WithNodeSchema,
|
|
762
|
-
// Array
|
|
763
759
|
MapNodeSchema,
|
|
764
760
|
FilterNodeSchema,
|
|
765
761
|
ReduceNodeSchema,
|
|
@@ -767,7 +763,6 @@ var NodeSchema = zod.z.lazy(
|
|
|
767
763
|
FlattenNodeSchema,
|
|
768
764
|
UniqueNodeSchema,
|
|
769
765
|
SortByNodeSchema,
|
|
770
|
-
// Math
|
|
771
766
|
AddNodeSchema,
|
|
772
767
|
SubNodeSchema,
|
|
773
768
|
MulNodeSchema,
|
|
@@ -775,7 +770,6 @@ var NodeSchema = zod.z.lazy(
|
|
|
775
770
|
ModNodeSchema,
|
|
776
771
|
RoundNodeSchema,
|
|
777
772
|
ToNumberNodeSchema,
|
|
778
|
-
// String
|
|
779
773
|
FillNodeSchema,
|
|
780
774
|
JoinNodeSchema,
|
|
781
775
|
ToStringNodeSchema,
|
|
@@ -785,7 +779,6 @@ var NodeSchema = zod.z.lazy(
|
|
|
785
779
|
UpperNodeSchema,
|
|
786
780
|
SplitNodeSchema,
|
|
787
781
|
ReplaceNodeSchema,
|
|
788
|
-
// Predicates
|
|
789
782
|
EqNodeSchema,
|
|
790
783
|
NeqNodeSchema,
|
|
791
784
|
GtNodeSchema,
|
|
@@ -796,18 +789,15 @@ var NodeSchema = zod.z.lazy(
|
|
|
796
789
|
StartsWithNodeSchema,
|
|
797
790
|
EndsWithNodeSchema,
|
|
798
791
|
ContainsNodeSchema,
|
|
799
|
-
// Logic
|
|
800
792
|
NotNodeSchema,
|
|
801
793
|
AndNodeSchema,
|
|
802
794
|
OrNodeSchema,
|
|
803
|
-
// Structure
|
|
804
795
|
MergeNodeSchema,
|
|
805
796
|
CoalesceNodeSchema,
|
|
806
797
|
CaseNodeSchema,
|
|
807
798
|
EntriesOfNodeSchema,
|
|
808
799
|
KeyByNodeSchema,
|
|
809
800
|
GroupByNodeSchema,
|
|
810
|
-
// Object
|
|
811
801
|
KeysNodeSchema,
|
|
812
802
|
ValuesNodeSchema,
|
|
813
803
|
FromEntriesNodeSchema,
|
|
@@ -815,15 +805,12 @@ var NodeSchema = zod.z.lazy(
|
|
|
815
805
|
OmitNodeSchema,
|
|
816
806
|
TypeNodeSchema,
|
|
817
807
|
LengthNodeSchema,
|
|
818
|
-
// Time
|
|
819
808
|
DateNodeSchema,
|
|
820
809
|
DateAddNodeSchema,
|
|
821
810
|
DateDiffNodeSchema,
|
|
822
|
-
// Locale-aware formatting
|
|
823
811
|
LocaleDateNodeSchema,
|
|
824
812
|
LocaleMoneyNodeSchema,
|
|
825
813
|
LocaleNumberNodeSchema,
|
|
826
|
-
// Sugar
|
|
827
814
|
SumNodeSchema,
|
|
828
815
|
AvgNodeSchema,
|
|
829
816
|
CountNodeSchema,
|
|
@@ -834,17 +821,13 @@ var NodeSchema = zod.z.lazy(
|
|
|
834
821
|
DropNodeSchema,
|
|
835
822
|
MatchNodeSchema,
|
|
836
823
|
FlatMapNodeSchema,
|
|
837
|
-
// Transform (rewriting a document)
|
|
838
824
|
HasNodeSchema,
|
|
839
825
|
RenameKeysNodeSchema,
|
|
840
826
|
UpdateNodeSchema,
|
|
841
827
|
AssertNodeSchema,
|
|
842
828
|
WalkNodeSchema,
|
|
843
|
-
// Primitives
|
|
844
829
|
JsonPrimitiveSchema,
|
|
845
|
-
// Arrays of nodes
|
|
846
830
|
NodeArraySchema,
|
|
847
|
-
// Plain objects (no `$` keys, recursive values)
|
|
848
831
|
TemplateSchema
|
|
849
832
|
] }).describe("A Prism node: an op, a plain JSON value, an array of nodes, or a plain object template.")
|
|
850
833
|
);
|
|
@@ -951,5 +934,5 @@ exports.isWalkNode = isWalkNode;
|
|
|
951
934
|
exports.isWithNode = isWithNode;
|
|
952
935
|
exports.parseJsonPath = parseJsonPath;
|
|
953
936
|
exports.parseJsonPathCached = parseJsonPathCached;
|
|
954
|
-
//# sourceMappingURL=chunk-
|
|
955
|
-
//# sourceMappingURL=chunk-
|
|
937
|
+
//# sourceMappingURL=chunk-6PD7M2F3.cjs.map
|
|
938
|
+
//# sourceMappingURL=chunk-6PD7M2F3.cjs.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"sources":["../src/errors.ts","../src/schemas/json.schema.ts","../src/schemas/guards.ts","../src/utils/jsonpath.ts","../src/schemas/ops/core.schema.ts","../src/schemas/ops/array.schema.ts","../src/schemas/ops/math.schema.ts","../src/schemas/ops/string.schema.ts","../src/schemas/ops/predicate.schema.ts","../src/schemas/ops/logic.schema.ts","../src/schemas/ops/structure.schema.ts","../src/schemas/ops/object.schema.ts","../src/schemas/ops/time.schema.ts","../src/schemas/ops/intl.schema.ts","../src/schemas/ops/sugar.schema.ts","../src/schemas/ops/transform.schema.ts","../src/schemas/node.schema.ts","../src/schemas/config.schema.ts"],"names":["z","_NodeSchema","setNodeSchema","node","pairOf"],"mappings":";;;;;AAAO,IAAM,SAAA,GAAY;AAAA,EACvB,MAAA,EAAQ,UAAA;AAAA,EACR,YAAA,EAAc,gBAAA;AAAA,EACd,IAAA,EAAM,QAAA;AAAA,EACN,gBAAA,EAAkB,oBAAA;AAAA,EAClB,YAAA,EAAc,gBAAA;AAAA,EACd,aAAA,EAAe,iBAAA;AAAA,EACf,UAAA,EAAY,cAAA;AAAA,EACZ,MAAA,EAAQ,UAAA;AAAA,EACR,MAAA,EAAQ;AACV;AAUO,IAAM,UAAA,GAAN,cAAyB,KAAA,CAAM;AAAA,EAC3B,IAAA;AAAA,EACA,OAAA;AAAA,EAET,WAAA,CAAY,OAAA,EAAiB,IAAA,EAAiB,OAAA,EAA6B;AACzE,IAAA,KAAA,CAAM,OAAO,CAAA;AACb,IAAA,IAAA,CAAK,IAAA,GAAO,YAAA;AACZ,IAAA,IAAA,CAAK,IAAA,GAAO,IAAA;AACZ,IAAA,IAAA,CAAK,OAAA,GAAU,OAAA;AAAA,EACjB;AACF;AC5BO,IAAM,sBAAsBA,KAAA,CAChC,KAAA,CAAM,CAACA,KAAA,CAAE,MAAA,IAAUA,KAAA,CAAE,MAAA,IAAUA,KAAA,CAAE,OAAA,IAAWA,KAAA,CAAE,IAAA,EAAM,CAAC,CAAA,CACrD,SAAS,kDAAkD,CAAA;AAEvD,IAAM,kBAETA,KAAA,CAAE,IAAA;AAAA,EAAK,MACTA,KAAA,CAAE,KAAA,CAAM,CAAC,mBAAA,EAAqBA,MAAE,KAAA,CAAM,eAAe,CAAA,EAAGA,KAAA,CAAE,OAAOA,KAAA,CAAE,MAAA,EAAO,EAAG,eAAe,CAAC,CAAC;AAChG,CAAA,CAAE,SAAS,6CAA6C,CAAA;AAExBA,MAC7B,MAAA,CAAOA,KAAA,CAAE,QAAO,EAAG,eAAe,CAAA,CAClC,QAAA,CAAS,gDAAgD;;;ACI5D,IAAM,MAAA,GAAS,CAAC,KAAA,EAAgB,GAAA,KAC9B,OAAO,KAAA,KAAU,QAAA,IAAY,KAAA,KAAU,IAAA,IAAQ,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK,KAAK,GAAA,IAAO,KAAA;AAE1E,IAAM,YAAA,GAAe,CAAC,KAAA,KAC3B,OAAO,KAAA,KAAU,QAAA,IAAY,KAAA,KAAU,IAAA,IAAQ,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK;AAE9D,IAAM,WAAA,GAAc,CAAC,KAAA,KAC1B,KAAA,CAAM,QAAQ,KAAK;AAEd,IAAM,SAAA,GAAY,CAAC,CAAA,KAA6B,MAAA,CAAO,GAAG,MAAM;AAChE,IAAM,WAAA,GAAc,CAAC,CAAA,KAA+B,MAAA,CAAO,GAAG,QAAQ;AACtE,IAAM,SAAA,GAAY,CAAC,CAAA,KAA6B,MAAA,CAAO,GAAG,MAAM;AAChE,IAAM,SAAA,GAAY,CAAC,CAAA,KAA6B,MAAA,CAAO,GAAG,MAAM;AAChE,IAAM,UAAA,GAAa,CAAC,CAAA,KAA8B,MAAA,CAAO,GAAG,OAAO;AAEnE,IAAM,SAAA,GAAY,CAAC,CAAA,KAA6B,MAAA,CAAO,GAAG,MAAM;AAChE,IAAM,YAAA,GAAe,CAAC,CAAA,KAAgC,MAAA,CAAO,GAAG,SAAS;AACzE,IAAM,YAAA,GAAe,CAAC,CAAA,KAAgC,MAAA,CAAO,GAAG,SAAS;AACzE,IAAM,WAAA,GAAc,CAAC,CAAA,KAA+B,MAAA,CAAO,GAAG,QAAQ;AACtE,IAAM,aAAA,GAAgB,CAAC,CAAA,KAAiC,MAAA,CAAO,GAAG,UAAU;AAC5E,IAAM,YAAA,GAAe,CAAC,CAAA,KAAgC,MAAA,CAAO,GAAG,SAAS;AACzE,IAAM,YAAA,GAAe,CAAC,CAAA,KAAgC,MAAA,CAAO,GAAG,SAAS;AAEzE,IAAM,SAAA,GAAY,CAAC,CAAA,KAA6B,MAAA,CAAO,GAAG,MAAM;AAChE,IAAM,SAAA,GAAY,CAAC,CAAA,KAA6B,MAAA,CAAO,GAAG,MAAM;AAChE,IAAM,SAAA,GAAY,CAAC,CAAA,KAA6B,MAAA,CAAO,GAAG,MAAM;AAChE,IAAM,SAAA,GAAY,CAAC,CAAA,KAA6B,MAAA,CAAO,GAAG,MAAM;AAChE,IAAM,WAAA,GAAc,CAAC,CAAA,KAA+B,MAAA,CAAO,GAAG,QAAQ;AACtE,IAAM,SAAA,GAAY,CAAC,CAAA,KAA6B,MAAA,CAAO,GAAG,MAAM;AAChE,IAAM,cAAA,GAAiB,CAAC,CAAA,KAAkC,MAAA,CAAO,GAAG,WAAW;AAE/E,IAAM,UAAA,GAAa,CAAC,CAAA,KAA8B,MAAA,CAAO,GAAG,OAAO;AACnE,IAAM,cAAA,GAAiB,CAAC,CAAA,KAAkC,MAAA,CAAO,GAAG,WAAW;AAC/E,IAAM,iBAAA,GAAoB,CAAC,CAAA,KAAqC,MAAA,CAAO,GAAG,cAAc;AACxF,IAAM,UAAA,GAAa,CAAC,CAAA,KAA8B,MAAA,CAAO,GAAG,OAAO;AACnE,IAAM,UAAA,GAAa,CAAC,CAAA,KAA8B,MAAA,CAAO,GAAG,OAAO;AACnE,IAAM,WAAA,GAAc,CAAC,CAAA,KAA+B,MAAA,CAAO,GAAG,QAAQ;AACtE,IAAM,WAAA,GAAc,CAAC,CAAA,KAA+B,MAAA,CAAO,GAAG,QAAQ;AACtE,IAAM,WAAA,GAAc,CAAC,CAAA,KAA+B,MAAA,CAAO,GAAG,QAAQ;AACtE,IAAM,aAAA,GAAgB,CAAC,CAAA,KAAiC,MAAA,CAAO,GAAG,UAAU;AAE5E,IAAM,QAAA,GAAW,CAAC,CAAA,KAA4B,MAAA,CAAO,GAAG,KAAK;AAC7D,IAAM,SAAA,GAAY,CAAC,CAAA,KAA6B,MAAA,CAAO,GAAG,MAAM;AAChE,IAAM,QAAA,GAAW,CAAC,CAAA,KAA4B,MAAA,CAAO,GAAG,KAAK;AAC7D,IAAM,SAAA,GAAY,CAAC,CAAA,KAA6B,MAAA,CAAO,GAAG,MAAM;AAChE,IAAM,QAAA,GAAW,CAAC,CAAA,KAA4B,MAAA,CAAO,GAAG,KAAK;AAC7D,IAAM,SAAA,GAAY,CAAC,CAAA,KAA6B,MAAA,CAAO,GAAG,MAAM;AAChE,IAAM,WAAA,GAAc,CAAC,CAAA,KAA+B,MAAA,CAAO,GAAG,QAAQ;AACtE,IAAM,gBAAA,GAAmB,CAAC,CAAA,KAAoC,MAAA,CAAO,GAAG,aAAa;AACrF,IAAM,cAAA,GAAiB,CAAC,CAAA,KAAkC,MAAA,CAAO,GAAG,WAAW;AAC/E,IAAM,cAAA,GAAiB,CAAC,CAAA,KAAkC,MAAA,CAAO,GAAG,WAAW;AAE/E,IAAM,SAAA,GAAY,CAAC,CAAA,KAA6B,MAAA,CAAO,GAAG,MAAM;AAChE,IAAM,SAAA,GAAY,CAAC,CAAA,KAA6B,MAAA,CAAO,GAAG,MAAM;AAChE,IAAM,QAAA,GAAW,CAAC,CAAA,KAA4B,MAAA,CAAO,GAAG,KAAK;AAE7D,IAAM,WAAA,GAAc,CAAC,CAAA,KAA+B,MAAA,CAAO,GAAG,QAAQ;AACtE,IAAM,cAAA,GAAiB,CAAC,CAAA,KAAkC,MAAA,CAAO,GAAG,WAAW;AAC/E,IAAM,UAAA,GAAa,CAAC,CAAA,KAA8B,MAAA,CAAO,GAAG,OAAO;AACnE,IAAM,eAAA,GAAkB,CAAC,CAAA,KAAmC,MAAA,CAAO,GAAG,YAAY;AAClF,IAAM,WAAA,GAAc,CAAC,CAAA,KAA+B,MAAA,CAAO,GAAG,QAAQ;AACtE,IAAM,aAAA,GAAgB,CAAC,CAAA,KAAiC,MAAA,CAAO,GAAG,UAAU;AAE5E,IAAM,UAAA,GAAa,CAAC,CAAA,KAA8B,MAAA,CAAO,GAAG,OAAO;AACnE,IAAM,YAAA,GAAe,CAAC,CAAA,KAAgC,MAAA,CAAO,GAAG,SAAS;AACzE,IAAM,iBAAA,GAAoB,CAAC,CAAA,KAAqC,MAAA,CAAO,GAAG,cAAc;AACxF,IAAM,UAAA,GAAa,CAAC,CAAA,KAA8B,MAAA,CAAO,GAAG,OAAO;AACnE,IAAM,UAAA,GAAa,CAAC,CAAA,KAA8B,MAAA,CAAO,GAAG,OAAO;AACnE,IAAM,SAAA,GAAY,CAAC,CAAA,KAA6B,MAAA,CAAO,GAAG,MAAM;AAChE,IAAM,gBAAA,GAAmB,CAAC,CAAA,KAAoC,MAAA,CAAO,GAAG,aAAa;AACrF,IAAM,YAAA,GAAe,CAAC,CAAA,KAAgC,MAAA,CAAO,GAAG,SAAS;AACzE,IAAM,YAAA,GAAe,CAAC,CAAA,KAAgC,MAAA,CAAO,GAAG,SAAS;AACzE,IAAM,UAAA,GAAa,CAAC,CAAA,KAA8B,MAAA,CAAO,GAAG,OAAO;AACnE,IAAM,UAAA,GAAa,CAAC,CAAA,KAA8B,MAAA,CAAO,GAAG,OAAO;AACnE,IAAM,YAAA,GAAe,CAAC,CAAA,KAAgC,MAAA,CAAO,GAAG,SAAS;AAEzE,IAAM,UAAA,GAAa,CAAC,CAAA,KAA8B,MAAA,CAAO,GAAG,OAAO;AACnE,IAAM,aAAA,GAAgB,CAAC,CAAA,KAAiC,MAAA,CAAO,GAAG,UAAU;AAC5E,IAAM,cAAA,GAAiB,CAAC,CAAA,KAAkC,MAAA,CAAO,GAAG,WAAW;AAE/E,IAAM,gBAAA,GAAmB,CAAC,CAAA,KAAoC,MAAA,CAAO,GAAG,aAAa;AACrF,IAAM,iBAAA,GAAoB,CAAC,CAAA,KAAqC,MAAA,CAAO,GAAG,cAAc;AACxF,IAAM,kBAAA,GAAqB,CAAC,CAAA,KAAsC,MAAA,CAAO,GAAG,eAAe;AAE3F,IAAM,SAAA,GAAY,CAAC,CAAA,KAA6B,MAAA,CAAO,GAAG,MAAM;AAChE,IAAM,SAAA,GAAY,CAAC,CAAA,KAA6B,MAAA,CAAO,GAAG,MAAM;AAChE,IAAM,WAAA,GAAc,CAAC,CAAA,KAA+B,MAAA,CAAO,GAAG,QAAQ;AACtE,IAAM,SAAA,GAAY,CAAC,CAAA,KAA6B,MAAA,CAAO,GAAG,MAAM;AAChE,IAAM,SAAA,GAAY,CAAC,CAAA,KAA6B,MAAA,CAAO,GAAG,MAAM;AAChE,IAAM,WAAA,GAAc,CAAC,CAAA,KAA+B,MAAA,CAAO,GAAG,QAAQ;AACtE,IAAM,UAAA,GAAa,CAAC,CAAA,KAA8B,MAAA,CAAO,GAAG,OAAO;AACnE,IAAM,UAAA,GAAa,CAAC,CAAA,KAA8B,MAAA,CAAO,GAAG,OAAO;AACnE,IAAM,WAAA,GAAc,CAAC,CAAA,KAA+B,MAAA,CAAO,GAAG,QAAQ;AACtE,IAAM,aAAA,GAAgB,CAAC,CAAA,KAAiC,MAAA,CAAO,GAAG,UAAU;AAE5E,IAAM,gBAAgB,CAAC,KAAA,KAC5B,YAAA,CAAa,KAAK,KAAK,CAAC,MAAA,CAAO,IAAA,CAAK,KAAK,EAAE,IAAA,CAAK,CAAC,MAAM,CAAA,CAAE,UAAA,CAAW,GAAG,CAAC;;;AC1GnE,IAAM,WAAA,GAAc,CAAC,IAAA,KAC1B,CAAA,yBAAA,EAA4B,IAAI,CAAA,qGAAA,CAAA;AAElC,IAAM,MAAA,GAAS,CAAC,IAAA,KAAwB;AACtC,EAAA,MAAM,IAAI,UAAA,CAAW,WAAA,CAAY,IAAI,CAAA,EAAG,SAAA,CAAU,MAAA,EAAQ,EAAE,EAAA,EAAI,MAAA,EAAQ,IAAA,EAAM,CAAA;AAChF,CAAA;AAEO,IAAM,cAAA,GAAiB,CAAC,IAAA,KAA0B;AACvD,EAAA,IAAI,CAAC,IAAA,CAAK,QAAA,CAAS,GAAG,CAAA,IAAK,CAAC,IAAA,CAAK,QAAA,CAAS,IAAI,CAAA,EAAG,OAAO,IAAA;AACxD,EAAA,IAAI;AACF,IAAA,aAAA,CAAc,IAAI,CAAA;AAClB,IAAA,OAAO,IAAA;AAAA,EACT,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,KAAA;AAAA,EACT;AACF,CAAA;AAEO,IAAM,aAAA,GAAgB,CAAC,IAAA,KAAoC;AAChE,EAAA,IAAI,CAAC,IAAA,CAAK,UAAA,CAAW,IAAI,CAAA,SAAU,EAAC;AAEpC,EAAA,MAAM,WAA8B,EAAC;AACrC,EAAA,IAAI,MAAA,GAAS,CAAA;AACb,EAAA,IAAI,UAAA,GAAa,EAAA;AAEjB,EAAA,MAAM,UAAU,MAAY;AAC1B,IAAA,IAAI,UAAA,CAAW,SAAS,CAAA,EAAG;AACzB,MAAA,QAAA,CAAS,KAAK,EAAE,IAAA,EAAM,KAAA,EAAO,GAAA,EAAK,YAAY,CAAA;AAC9C,MAAA,UAAA,GAAa,EAAA;AAAA,IACf;AAAA,EACF,CAAA;AAEA,EAAA,OAAO,MAAA,GAAS,KAAK,MAAA,EAAQ;AAC3B,IAAA,MAAM,IAAA,GAAO,KAAK,MAAM,CAAA;AAExB,IAAA,IAAI,SAAS,GAAA,EAAK;AAChB,MAAA,IAAI,KAAK,MAAA,GAAS,CAAC,CAAA,KAAM,GAAA,SAAY,IAAI,CAAA;AACzC,MAAA,OAAA,EAAQ;AACR,MAAA,MAAA,EAAA;AACA,MAAA;AAAA,IACF;AAEA,IAAA,IAAI,SAAS,GAAA,EAAK;AAChB,MAAA,OAAA,EAAQ;AACR,MAAA,MAAA,EAAA;AACA,MAAA,IAAI,MAAA,GAAS,EAAA;AACb,MAAA,OAAO,SAAS,IAAA,CAAK,MAAA,IAAU,IAAA,CAAK,MAAM,MAAM,GAAA,EAAK;AACnD,QAAA,MAAA,IAAU,KAAK,MAAM,CAAA;AACrB,QAAA,MAAA,EAAA;AAAA,MACF;AACA,MAAA,IAAI,IAAA,CAAK,MAAM,CAAA,KAAM,GAAA,SAAY,IAAI,CAAA;AACrC,MAAA,MAAA,EAAA;AACA,MAAA,MAAM,KAAA,GAAQ,OAAO,MAAM,CAAA;AAC3B,MAAA,IAAI,MAAA,CAAO,IAAA,EAAK,KAAM,EAAA,IAAM,CAAC,MAAA,CAAO,SAAA,CAAU,KAAK,CAAA,IAAK,KAAA,GAAQ,CAAA,EAAG,MAAA,CAAO,IAAI,CAAA;AAC9E,MAAA,QAAA,CAAS,IAAA,CAAK,EAAE,IAAA,EAAM,OAAA,EAAS,OAAO,CAAA;AACtC,MAAA;AAAA,IACF;AAEA,IAAA,UAAA,IAAc,IAAA;AACd,IAAA,MAAA,EAAA;AAAA,EACF;AAEA,EAAA,OAAA,EAAQ;AACR,EAAA,OAAO,QAAA;AACT;AAEA,IAAM,KAAA,uBAAY,GAAA,EAA+B;AAE1C,IAAM,mBAAA,GAAsB,CAAC,IAAA,KAAoC;AACtE,EAAA,MAAM,MAAA,GAAS,KAAA,CAAM,GAAA,CAAI,IAAI,CAAA;AAC7B,EAAA,IAAI,QAAQ,OAAO,MAAA;AACnB,EAAA,MAAM,MAAA,GAAS,cAAc,IAAI,CAAA;AACjC,EAAA,KAAA,CAAM,GAAA,CAAI,MAAM,MAAM,CAAA;AACtB,EAAA,OAAO,MAAA;AACT;AAEO,IAAM,SAAA,GAAY,CAAC,IAAA,EAAiB,QAAA,KAAuD;AAChG,EAAA,IAAI,OAAA,GAAiC,IAAA;AAErC,EAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC9B,IAAA,IAAI,OAAA,CAAQ,SAAS,KAAA,EAAO;AAC1B,MAAA,IAAI,CAAC,YAAA,CAAa,OAAO,CAAA,EAAG,OAAO,MAAA;AACnC,MAAA,OAAA,GAAU,OAAA,CAAQ,QAAQ,GAAG,CAAA;AAAA,IAC/B,CAAA,MAAO;AACL,MAAA,IAAI,CAAC,WAAA,CAAY,OAAO,CAAA,EAAG,OAAO,MAAA;AAClC,MAAA,OAAA,GAAU,OAAA,CAAQ,QAAQ,KAAK,CAAA;AAAA,IACjC;AAAA,EACF;AAEA,EAAA,OAAO,OAAA;AACT;;;AC5FA,IAAI,WAAA,GAA4BA,MAAE,GAAA,EAAI;AAC/B,IAAM,aAAA,GAAgB,CAAC,MAAA,KAA+B;AAC3D,EAAA,WAAA,GAAc,MAAA;AAChB,CAAA;AACA,IAAM,OAAO,MAAoB,WAAA;AAE1B,IAAM,aAAA,GAAgBA,MAC1B,MAAA,CAAO;AAAA,EACN,IAAA,EAAMA,MACH,MAAA,EAAO,CACP,MAAM,aAAa,CAAA,CAGnB,MAAA,CAAO,cAAA,EAAgB,EAAE,KAAA,EAAO,CAAC,KAAA,KAAU,WAAA,CAAY,OAAO,KAAA,CAAM,KAAK,CAAC,CAAA,EAAG,CAAA,CAC7E,QAAA,CAAS,oNAAoN;AAClO,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,4JAA4J,CAAA;AAIjK,IAAM,eAAA,GAAkBA,MAC5B,MAAA,CAAO;AAAA,EACN,MAAA,EAAQ,eAAA,CAAgB,QAAA,CAAS,iCAAiC;AACpE,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,wCAAwC,CAAA;AAI7C,IAAM,aAAA,GAAgBA,MAC1B,MAAA,CAAO;AAAA,EACN,IAAA,EAAMA,MAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,SAAS,mEAAmE;AACtG,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,6LAAwL,CAAA;AAI7L,IAAM,aAAA,GAAgBA,MAC1B,MAAA,CAAO;AAAA,EACN,IAAA,EAAMA,MACH,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAK,IAAI,CAAA,CAAE,SAAS,gCAAgC,CAAA;AAAA,IAC5D,IAAA,EAAMA,MACH,KAAA,CAAMA,KAAAA,CAAE,MAAM,CAACA,KAAAA,CAAE,MAAA,EAAO,EAAGA,KAAAA,CAAE,MAAA,IAAUA,KAAAA,CAAE,IAAA,CAAK,IAAI,CAAC,CAAC,CAAC,EACrD,GAAA,CAAI,CAAC,CAAA,CACL,QAAA,CAAS,mEAAmE,CAAA;AAAA,IAC/E,QAAA,EAAUA,MAAE,IAAA,CAAK,IAAI,EAAE,QAAA,EAAS,CAAE,SAAS,sCAAsC;AAAA,GAClF,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,sOAAsO,CAAA;AAI3O,IAAM,cAAA,GAAiBA,MAC3B,MAAA,CAAO;AAAA,EACN,KAAA,EAAOA,MACJ,MAAA,CAAO;AAAA,IACN,GAAA,EAAKA,KAAAA,CACF,MAAA,CAAOA,KAAAA,CAAE,MAAA,EAAO,EAAGA,KAAAA,CAAE,IAAA,CAAK,IAAI,CAAC,CAAA,CAC/B,QAAA,CAAS,uEAAkE,CAAA;AAAA,IAC9E,OAAOA,KAAAA,CAAE,IAAA,CAAK,IAAI,CAAA,CAAE,SAAS,4DAA4D;AAAA,GAC1F,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,8EAA8E,CAAA;ACxE1F,IAAIC,YAAAA,GAA4BD,MAAE,GAAA,EAAI;AAC/B,IAAME,cAAAA,GAAgB,CAAC,MAAA,KAA+B;AAC3D,EAAAD,YAAAA,GAAc,MAAA;AAChB,CAAA;AACA,IAAME,QAAO,MAAoBF,YAAAA;AAE1B,IAAM,aAAA,GAAgBD,MAC1B,MAAA,CAAO;AAAA,EACN,IAAA,EAAMA,MACH,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,wBAAwB,CAAA;AAAA,IACpD,EAAA,EAAIH,MAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,SAAS,wCAAwC,CAAA;AAAA,IACvE,MAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,wCAAwC;AAAA,GACrE,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,+CAA+C,CAAA;AAIpD,IAAM,gBAAA,GAAmBH,MAC7B,MAAA,CAAO;AAAA,EACN,OAAA,EAASA,MACN,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,kBAAkB,CAAA;AAAA,IAC9C,EAAA,EAAIH,MAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,SAAS,wCAAwC,CAAA;AAAA,IACvE,MAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,6CAAwC;AAAA,GACrE,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,8DAA8D,CAAA;AAInE,IAAM,gBAAA,GAAmBH,MAC7B,MAAA,CAAO;AAAA,EACN,OAAA,EAASA,MACN,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,kBAAkB,CAAA;AAAA,IAC9C,EAAA,EAAIH,MAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,SAAS,wCAAwC,CAAA;AAAA,IACvE,GAAA,EAAKA,KAAAA,CAAE,MAAA,EAAO,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,QAAA,EAAS,CAAE,OAAA,CAAQ,KAAK,CAAA,CAAE,SAAS,4CAA4C,CAAA;AAAA,IACtG,MAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,4BAA4B,CAAA;AAAA,IACxD,MAAMH,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,mFAAmF;AAAA,GAChH,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,yDAAyD,CAAA;AAI9D,IAAM,eAAA,GAAkBH,MAC5B,MAAA,CAAO;AAAA,EACN,MAAA,EAAQA,MACL,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,2BAA2B,CAAA;AAAA,IACvD,KAAA,EAAOH,MAAE,MAAA,EAAO,CAAE,KAAI,CAAE,QAAA,EAAS,CAAE,QAAA,CAAS,sCAAsC,CAAA;AAAA,IAClF,GAAA,EAAKA,MAAE,MAAA,EAAO,CAAE,KAAI,CAAE,QAAA,EAAS,CAAE,QAAA,CAAS,yCAAyC;AAAA,GACpF,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,gDAAgD,CAAA;AAIrD,IAAM,iBAAA,GAAoBA,MAC9B,MAAA,CAAO;AAAA,EACN,UAAUA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,uCAAuC;AACzE,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,sCAAsC,CAAA;AAI3C,IAAM,gBAAA,GAAmBH,MAC7B,MAAA,CAAO;AAAA,EACN,SAASA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,uBAAuB;AACxD,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,qEAAqE,CAAA;AAI1E,IAAM,gBAAA,GAAmBH,MAC7B,MAAA,CAAO;AAAA,EACN,OAAA,EAASA,MACN,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,gBAAgB,CAAA;AAAA,IAC5C,EAAA,EAAIH,MAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,SAAS,wCAAwC,CAAA;AAAA,IACvE,IAAIA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,qCAAqC,CAAA;AAAA,IAC/D,GAAA,EAAKH,KAAAA,CAAE,IAAA,CAAK,CAAC,OAAO,MAAM,CAAC,CAAA,CAAE,QAAA,EAAS,CAAE,OAAA,CAAQ,KAAK,CAAA,CAAE,SAAS,iCAAiC;AAAA,GAClG,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,kCAAkC,CAAA;AClG9C,IAAIC,YAAAA,GAA4BD,MAAE,GAAA,EAAI;AAC/B,IAAME,cAAAA,GAAgB,CAAC,MAAA,KAA+B;AAC3D,EAAAD,YAAAA,GAAc,MAAA;AAChB,CAAA;AACA,IAAME,QAAO,MAAoBF,YAAAA;AAEjC,IAAM,SAAS,CAAC,IAAA,KACdD,KAAAA,CAAE,KAAA,CAAM,CAACA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,EAAGH,MAAE,IAAA,CAAKG,KAAI,CAAC,CAAC,CAAA,CAAE,SAAS,IAAI,CAAA;AAE9C,IAAM,aAAA,GAAgBH,KAAAA,CAC1B,MAAA,CAAO,EAAE,IAAA,EAAM,MAAA,CAAO,8BAA8B,CAAA,EAAG,CAAA,CACvD,MAAA,EAAO,CACP,SAAS,kBAAkB,CAAA;AAGvB,IAAM,aAAA,GAAgBA,KAAAA,CAC1B,MAAA,CAAO,EAAE,IAAA,EAAM,MAAA,CAAO,2CAA2C,CAAA,EAAG,CAAA,CACpE,MAAA,EAAO,CACP,SAAS,oCAAoC,CAAA;AAGzC,IAAM,aAAA,GAAgBA,KAAAA,CAC1B,MAAA,CAAO,EAAE,IAAA,EAAM,MAAA,CAAO,mCAAmC,CAAA,EAAG,CAAA,CAC5D,MAAA,EAAO,CACP,SAAS,uBAAuB,CAAA;AAG5B,IAAM,aAAA,GAAgBA,KAAAA,CAC1B,MAAA,CAAO,EAAE,IAAA,EAAM,MAAA,CAAO,qEAAqE,CAAA,EAAG,CAAA,CAC9F,MAAA,EAAO,CACP,SAAS,2EAA2E,CAAA;AAGhF,IAAM,aAAA,GAAgBA,KAAAA,CAC1B,MAAA,CAAO,EAAE,IAAA,EAAM,MAAA,CAAO,oFAAoF,CAAA,EAAG,CAAA,CAC7G,MAAA,EAAO,CACP,SAAS,0NAA0N,CAAA;AAG/N,IAAM,eAAA,GAAkBA,MAC5B,MAAA,CAAO;AAAA,EACN,MAAA,EAAQA,MACL,MAAA,CAAO;AAAA,IACN,OAAOA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,yBAAyB,CAAA;AAAA,IACtD,MAAA,EAAQH,KAAAA,CAAE,MAAA,EAAO,CAAE,KAAI,CAAE,WAAA,EAAY,CAAE,QAAA,EAAS,CAAE,OAAA,CAAQ,CAAC,CAAA,CAAE,SAAS,6BAA6B,CAAA;AAAA,IACnG,IAAA,EAAMA,KAAAA,CAAE,IAAA,CAAK,CAAC,SAAA,EAAW,OAAA,EAAS,MAAM,CAAC,CAAA,CAAE,QAAA,EAAS,CAAE,QAAA,CAAS,uGAAuG;AAAA,GACvK,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,mGAAmG,CAAA;AAGxG,IAAM,kBAAA,GAAqBA,MAC/B,MAAA,CAAO;AAAA,EACN,SAAA,EAAWA,MACR,MAAA,CAAO;AAAA,IACN,OAAOA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,8EAA8E,CAAA;AAAA,IAC3G,QAAA,EAAUH,MAAE,IAAA,CAAKG,KAAI,EAAE,QAAA,EAAS,CAAE,SAAS,+FAA+F;AAAA,GAC3I,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,6LAA6L,CAAA;AC/DzM,IAAIF,YAAAA,GAA4BD,MAAE,GAAA,EAAI;AAC/B,IAAME,cAAAA,GAAgB,CAAC,MAAA,KAA+B;AAC3D,EAAAD,YAAAA,GAAc,MAAA;AAChB,CAAA;AACA,IAAME,QAAO,MAAoBF,YAAAA;AAE1B,IAAM,cAAA,GAAiBD,MAC3B,MAAA,CAAO;AAAA,EACN,KAAA,EAAOA,MACJ,MAAA,CAAO;AAAA,IACN,OAAOA,KAAAA,CACJ,IAAA,CAAKG,KAAI,CAAA,CACT,SAAS,0IAAqI,CAAA;AAAA,IACjJ,GAAA,EAAKH,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,GAAW,OAAA,CAAQ,EAAE,CAAA,CAAE,QAAA,CAAS,uCAAuC;AAAA,GACxF,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,8DAA8D,CAAA;AAGnE,IAAM,qBAAqBA,KAAAA,CAC/B,MAAA,CAAO,EAAE,SAAA,EAAWA,MAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,QAAA,CAAS,kCAAkC,CAAA,EAAG,EAC/E,MAAA,EAAO,CACP,SAAS,+CAA+C,CAAA;AAGpD,IAAM,qBAAA,GAAwBH,MAClC,MAAA,CAAO;AAAA,EACN,YAAA,EAAcA,MACX,MAAA,CAAO;AAAA,IACN,QAAA,EAAUA,KAAAA,CAAE,MAAA,EAAO,CAAE,SAAS,qCAAqC,CAAA;AAAA,IACnE,QAAQA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,iDAAiD;AAAA,GAChF,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,wEAAwE,CAAA;AAG7E,IAAM,cAAA,GAAiBH,MAC3B,MAAA,CAAO;AAAA,EACN,OAAOA,KAAAA,CACJ,IAAA,CAAKG,KAAI,CAAA,CACT,SAAS,mHAA8G;AAC5H,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,qGAAgG,CAAA;AAGrG,IAAM,iBAAiBH,KAAAA,CAC3B,MAAA,CAAO,EAAE,KAAA,EAAOA,MAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,QAAA,CAAS,iCAAiC,CAAA,EAAG,EAC1E,MAAA,EAAO,CACP,SAAS,qDAAqD,CAAA;AAG1D,IAAM,kBAAkBH,KAAAA,CAC5B,MAAA,CAAO,EAAE,MAAA,EAAQA,MAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,QAAA,CAAS,sBAAsB,CAAA,EAAG,EAChE,MAAA,EAAO,CACP,SAAS,gCAAgC,CAAA;AAGrC,IAAM,kBAAkBH,KAAAA,CAC5B,MAAA,CAAO,EAAE,MAAA,EAAQA,MAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,QAAA,CAAS,sBAAsB,CAAA,EAAG,EAChE,MAAA,EAAO,CACP,SAAS,gCAAgC,CAAA;AAGrC,IAAM,eAAA,GAAkBH,MAC5B,MAAA,CAAO;AAAA,EACN,MAAA,EAAQA,MACL,MAAA,CAAO;AAAA,IACN,OAAOA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,kBAAkB,CAAA;AAAA,IAC/C,GAAA,EAAKH,KAAAA,CAAE,MAAA,EAAO,CAAE,SAAS,wBAAwB;AAAA,GAClD,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,4CAA4C,CAAA;AAGjD,IAAM,iBAAA,GAAoBA,MAC9B,MAAA,CAAO;AAAA,EACN,QAAA,EAAUA,MACP,MAAA,CAAO;AAAA,IACN,OAAOA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,sBAAsB,CAAA;AAAA,IACnD,MAAA,EAAQH,KAAAA,CAAE,MAAA,EAAO,CAAE,SAAS,oBAAoB,CAAA;AAAA,IAChD,WAAA,EAAaA,KAAAA,CAAE,MAAA,EAAO,CAAE,SAAS,qBAAqB,CAAA;AAAA,IACtD,KAAKA,KAAAA,CAAE,OAAA,GAAU,QAAA,EAAS,CAAE,SAAS,0DAA0D;AAAA,GAChG,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,oFAAoF,CAAA;AC7FhG,IAAIC,YAAAA,GAA4BD,MAAE,GAAA,EAAI;AAC/B,IAAME,cAAAA,GAAgB,CAAC,MAAA,KAA+B;AAC3D,EAAAD,YAAAA,GAAc,MAAA;AAChB,CAAA;AACA,IAAME,QAAO,MAAoBF,YAAAA;AAEjC,IAAMG,UAAS,CAAC,IAAA,KACdJ,KAAAA,CAAE,KAAA,CAAM,CAACA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,EAAGH,MAAE,IAAA,CAAKG,KAAI,CAAC,CAAC,CAAA,CAAE,SAAS,IAAI,CAAA;AAE9C,IAAM,YAAA,GAAeH,KAAAA,CACzB,MAAA,CAAO,EAAE,GAAA,EAAKI,OAAAA,CAAO,0CAA0C,CAAA,EAAG,CAAA,CAClE,MAAA,EAAO,CACP,SAAS,yEAAyE,CAAA;AAG9E,IAAM,aAAA,GAAgBJ,KAAAA,CAC1B,MAAA,CAAO,EAAE,IAAA,EAAMI,OAAAA,CAAO,uCAAuC,CAAA,EAAG,CAAA,CAChE,MAAA,EAAO,CACP,SAAS,oDAAoD,CAAA;AAGzD,IAAM,YAAA,GAAeJ,KAAAA,CACzB,MAAA,CAAO,EAAE,GAAA,EAAKI,OAAAA,CAAO,kEAAkE,CAAA,EAAG,CAAA,CAC1F,MAAA,EAAO,CACP,SAAS,iDAAiD,CAAA;AAGtD,IAAM,aAAA,GAAgBJ,KAAAA,CAC1B,MAAA,CAAO,EAAE,IAAA,EAAMI,OAAAA,CAAO,8CAA8C,CAAA,EAAG,CAAA,CACvE,MAAA,EAAO,CACP,SAAS,mCAAmC,CAAA;AAGxC,IAAM,YAAA,GAAeJ,KAAAA,CACzB,MAAA,CAAO,EAAE,GAAA,EAAKI,OAAAA,CAAO,6CAA6C,CAAA,EAAG,CAAA,CACrE,MAAA,EAAO,CACP,SAAS,uBAAuB,CAAA;AAG5B,IAAM,aAAA,GAAgBJ,KAAAA,CAC1B,MAAA,CAAO,EAAE,IAAA,EAAMI,OAAAA,CAAO,8CAA8C,CAAA,EAAG,CAAA,CACvE,MAAA,EAAO,CACP,SAAS,gCAAgC,CAAA;AAGrC,IAAM,kBAAkBJ,KAAAA,CAC5B,MAAA,CAAO,EAAE,MAAA,EAAQA,MAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,QAAA,CAAS,kDAAkD,CAAA,EAAG,EAC5F,MAAA,EAAO,CACP,SAAS,4EAA4E,CAAA;AAGjF,IAAM,oBAAA,GAAuBH,MACjC,MAAA,CAAO;AAAA,EACN,WAAA,EAAaA,MACV,MAAA,CAAO;AAAA,IACN,OAAOA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,kBAAkB,CAAA;AAAA,IAC/C,QAAQH,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,kBAAkB;AAAA,GACjD,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,4CAA4C,CAAA;AAGjD,IAAM,kBAAA,GAAqBH,MAC/B,MAAA,CAAO;AAAA,EACN,SAAA,EAAWA,MACR,MAAA,CAAO;AAAA,IACN,OAAOA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,kBAAkB,CAAA;AAAA,IAC/C,QAAQH,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,kBAAkB;AAAA,GACjD,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,0CAA0C,CAAA;AAG/C,IAAM,kBAAA,GAAqBH,MAC/B,MAAA,CAAO;AAAA,EACN,SAAA,EAAWA,MACR,MAAA,CAAO;AAAA,IACN,OAAOA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,sBAAsB,CAAA;AAAA,IACnD,QAAQH,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,oBAAoB;AAAA,GACnD,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,uDAAuD,CAAA;ACvFnE,IAAIF,YAAAA,GAA4BD,MAAE,GAAA,EAAI;AAC/B,IAAME,cAAAA,GAAgB,CAAC,MAAA,KAA+B;AAC3D,EAAAD,YAAAA,GAAc,MAAA;AAChB,CAAA;AACA,IAAME,QAAO,MAAoBF,YAAAA;AAE1B,IAAM,gBAAgBD,KAAAA,CAC1B,MAAA,CAAO,EAAE,IAAA,EAAMA,MAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,QAAA,CAAS,2DAAiD,CAAA,EAAG,EACzF,MAAA,EAAO,CACP,SAAS,2CAA2C,CAAA;AAGhD,IAAM,aAAA,GAAgBH,MAC1B,MAAA,CAAO;AAAA,EACN,IAAA,EAAMA,KAAAA,CACH,KAAA,CAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAC,CAAA,CAClB,GAAA,CAAI,CAAC,CAAA,CACL,QAAA,CAAS,oEAAoE;AAClF,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,4BAA4B,CAAA;AAGjC,IAAM,YAAA,GAAeH,MACzB,MAAA,CAAO;AAAA,EACN,GAAA,EAAKA,KAAAA,CACF,KAAA,CAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAC,CAAA,CAClB,GAAA,CAAI,CAAC,CAAA,CACL,QAAA,CAAS,mEAAmE;AACjF,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,2BAA2B,CAAA;AC/BvC,IAAIF,YAAAA,GAA4BD,MAAE,GAAA,EAAI;AAC/B,IAAME,cAAAA,GAAgB,CAAC,MAAA,KAA+B;AAC3D,EAAAD,YAAAA,GAAc,MAAA;AAChB,CAAA;AACA,IAAME,QAAO,MAAoBF,YAAAA;AAE1B,IAAM,eAAA,GAAkBD,MAC5B,MAAA,CAAO;AAAA,EACN,MAAA,EAAQA,KAAAA,CACL,KAAA,CAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAC,CAAA,CAClB,GAAA,CAAI,CAAC,CAAA,CACL,QAAA,CAAS,uDAAuD;AACrE,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,sEAAsE,CAAA;AAG3E,IAAM,kBAAA,GAAqBH,MAC/B,MAAA,CAAO;AAAA,EACN,SAAA,EAAWA,KAAAA,CACR,KAAA,CAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAC,CAAA,CAClB,GAAA,CAAI,CAAC,CAAA,CACL,QAAA,CAAS,+DAA+D;AAC7E,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,iDAAiD,CAAA;AAGtD,IAAM,cAAA,GAAiBH,MAC3B,MAAA,CAAO;AAAA,EACN,KAAA,EAAOA,MACJ,MAAA,CAAO;AAAA,IACN,UAAUA,KAAAA,CACP,KAAA;AAAA,MACCA,MAAE,MAAA,CAAO;AAAA,QACP,MAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,wBAAwB,CAAA;AAAA,QACpD,MAAMH,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,yCAAyC;AAAA,OACtE,EAAE,MAAA;AAAO,KACZ,CACC,GAAA,CAAI,CAAC,CAAA,CACL,SAAS,qCAAqC,CAAA;AAAA,IACjD,IAAA,EAAMH,MAAE,IAAA,CAAKG,KAAI,EAAE,QAAA,EAAS,CAAE,SAAS,qDAAqD;AAAA,GAC7F,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,kFAAkF,CAAA;AAGvF,IAAM,sBAAsBH,KAAAA,CAChC,MAAA,CAAO,EAAE,UAAA,EAAYA,MAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,QAAA,CAAS,8CAA8C,CAAA,EAAG,EAC5F,MAAA,EAAO,CACP,SAAS,sDAAsD,CAAA;AAG3D,IAAM,eAAA,GAAkBH,MAC5B,MAAA,CAAO;AAAA,EACN,MAAA,EAAQA,MACL,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,iBAAiB,CAAA;AAAA,IAC7C,EAAA,EAAIH,MAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,SAAS,wCAAwC,CAAA;AAAA,IACvE,KAAKA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,yDAAyD;AAAA,GACrF,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,8FAA8F,CAAA;AAGnG,IAAM,iBAAA,GAAoBH,MAC9B,MAAA,CAAO;AAAA,EACN,QAAA,EAAUA,MACP,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,iBAAiB,CAAA;AAAA,IAC7C,EAAA,EAAIH,MAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,SAAS,wCAAwC,CAAA;AAAA,IACvE,KAAKA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,sCAAsC;AAAA,GAClE,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,gEAAgE,CAAA;AChF5E,IAAIF,YAAAA,GAA4BD,MAAE,GAAA,EAAI;AAC/B,IAAME,cAAAA,GAAgB,CAAC,MAAA,KAA+B;AAC3D,EAAAD,YAAAA,GAAc,MAAA;AAChB,CAAA;AACA,IAAME,QAAO,MAAoBF,YAAAA;AAE1B,IAAM,iBAAiBD,KAAAA,CAC3B,MAAA,CAAO,EAAE,KAAA,EAAOA,MAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,QAAA,CAAS,8BAA8B,CAAA,EAAG,EACvE,MAAA,EAAO,CACP,SAAS,iDAAiD,CAAA;AAGtD,IAAM,mBAAmBH,KAAAA,CAC7B,MAAA,CAAO,EAAE,OAAA,EAASA,MAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,QAAA,CAAS,gCAAgC,CAAA,EAAG,EAC3E,MAAA,EAAO,CACP,SAAS,6CAA6C,CAAA;AAGlD,IAAM,qBAAA,GAAwBH,MAClC,MAAA,CAAO;AAAA,EACN,cAAcA,KAAAA,CACX,IAAA,CAAKG,KAAI,CAAA,CACT,SAAS,sDAAsD;AACpE,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,gDAAgD,CAAA;AAGrD,IAAM,cAAA,GAAiBH,MAC3B,MAAA,CAAO;AAAA,EACN,KAAA,EAAOA,MACJ,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,gBAAgB,CAAA;AAAA,IAC5C,IAAA,EAAMH,KAAAA,CAAE,KAAA,CAAMA,KAAAA,CAAE,MAAA,EAAQ,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,QAAA,CAAS,eAAe;AAAA,GAC1D,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,yDAAyD,CAAA;AAG9D,IAAM,cAAA,GAAiBA,MAC3B,MAAA,CAAO;AAAA,EACN,KAAA,EAAOA,MACJ,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,gBAAgB,CAAA;AAAA,IAC5C,IAAA,EAAMH,KAAAA,CAAE,KAAA,CAAMA,KAAAA,CAAE,MAAA,EAAQ,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,QAAA,CAAS,iBAAiB;AAAA,GAC5D,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,wDAAwD,CAAA;AAG7D,IAAM,iBAAiBA,KAAAA,CAC3B,MAAA,CAAO,EAAE,KAAA,EAAOA,MAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,QAAA,CAAS,2BAA2B,CAAA,EAAG,EACpE,MAAA,EAAO,CACP,SAAS,4FAA4F,CAAA;AAGjG,IAAM,mBAAmBH,KAAAA,CAC7B,MAAA,CAAO,EAAE,OAAA,EAASA,MAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,QAAA,CAAS,6BAA6B,CAAA,EAAG,EACxE,MAAA,EAAO,CACP,SAAS,0CAA0C,CAAA;AC/DtD,IAAIF,YAAAA,GAA4BD,MAAE,GAAA,EAAI;AAC/B,IAAME,cAAAA,GAAgB,CAAC,MAAA,KAA+B;AAC3D,EAAAD,YAAAA,GAAc,MAAA;AAChB,CAAA;AACA,IAAME,QAAO,MAAoBF,YAAAA;AAEjC,IAAM,QAAA,GAAWD,KAAAA,CACd,IAAA,CAAK,CAAC,MAAA,EAAQ,OAAA,EAAS,KAAA,EAAO,MAAA,EAAQ,QAAA,EAAU,QAAQ,CAAC,CAAA,CACzD,SAAS,gCAAgC,CAAA;AAErC,IAAM,cAAA,GAAiBA,MAC3B,MAAA,CAAO;AAAA,EACN,KAAA,EAAOA,MACJ,MAAA,CAAO;AAAA,IACN,OAAOA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,uCAAuC,CAAA;AAAA,IACpE,QAAQH,KAAAA,CAAE,MAAA,GAAS,QAAA,EAAS,CAAE,SAAS,yDAAyD,CAAA;AAAA,IAChG,GAAA,EAAKA,KAAAA,CAAE,OAAA,EAAQ,CAAE,QAAA,GAAW,OAAA,CAAQ,KAAK,CAAA,CAAE,QAAA,CAAS,gCAAgC;AAAA,GACrF,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,sBAAsB,CAAA;AAG3B,IAAM,iBAAA,GAAoBA,MAC9B,MAAA,CAAO;AAAA,EACN,QAAA,EAAUA,MACP,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,sCAAsC,CAAA;AAAA,IAClE,MAAA,EAAQH,KAAAA,CAAE,MAAA,EAAO,CAAE,SAAS,kCAAkC,CAAA;AAAA,IAC9D,IAAA,EAAM;AAAA,GACP,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,+CAA+C,CAAA;AAGpD,IAAM,kBAAA,GAAqBA,MAC/B,MAAA,CAAO;AAAA,EACN,SAAA,EAAWA,MACR,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,aAAa,CAAA;AAAA,IACzC,IAAIH,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,WAAW,CAAA;AAAA,IACrC,IAAA,EAAM;AAAA,GACP,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,2DAA2D,CAAA;ACjDvE,IAAIF,aAAAA,GAA4BD,MAAE,GAAA,EAAI;AAC/B,IAAME,eAAAA,GAAgB,CAAC,MAAA,KAA+B;AAC3D,EAAAD,aAAAA,GAAc,MAAA;AAChB,CAAA;AACA,IAAME,SAAO,MAAoBF,aAAAA;AAEjC,IAAM,cAAcD,KAAAA,CACjB,IAAA,CAAKG,MAAI,CAAA,CACT,SAAS,2HAAsH,CAAA;AAElI,IAAM,aAAA,GAAgBH,MACnB,IAAA,CAAKG,MAAI,EACT,QAAA,EAAS,CACT,SAAS,+DAA+D,CAAA;AAE3E,IAAM,SAAA,GAAYH,MAAE,IAAA,CAAK,CAAC,QAAQ,MAAA,EAAQ,QAAA,EAAU,OAAO,CAAC,CAAA;AAErD,IAAM,qBAAA,GAAwBA,MAClC,MAAA,CAAO;AAAA,EACN,SAAA,EAAW,SAAA,CAAU,QAAA,EAAS,CAAE,SAAS,8EAA8E,CAAA;AAAA,EACvH,SAAA,EAAW,SAAA,CAAU,QAAA,EAAS,CAAE,SAAS,8EAA8E,CAAA;AAAA,EACvH,OAAA,EAASA,MAAE,IAAA,CAAK,CAAC,QAAQ,OAAA,EAAS,QAAQ,CAAC,CAAA,CAAE,QAAA,EAAS;AAAA,EACtD,IAAA,EAAMA,MAAE,IAAA,CAAK,CAAC,WAAW,SAAS,CAAC,EAAE,QAAA,EAAS;AAAA,EAC9C,KAAA,EAAOA,KAAAA,CAAE,IAAA,CAAK,CAAC,SAAA,EAAW,SAAA,EAAW,MAAA,EAAQ,OAAA,EAAS,QAAQ,CAAC,CAAA,CAAE,QAAA,EAAS;AAAA,EAC1E,GAAA,EAAKA,MAAE,IAAA,CAAK,CAAC,WAAW,SAAS,CAAC,EAAE,QAAA,EAAS;AAAA,EAC7C,IAAA,EAAMA,MAAE,IAAA,CAAK,CAAC,WAAW,SAAS,CAAC,EAAE,QAAA,EAAS;AAAA,EAC9C,MAAA,EAAQA,MAAE,IAAA,CAAK,CAAC,WAAW,SAAS,CAAC,EAAE,QAAA,EAAS;AAAA,EAChD,MAAA,EAAQA,MAAE,IAAA,CAAK,CAAC,WAAW,SAAS,CAAC,EAAE,QAAA,EAAS;AAAA,EAChD,QAAQA,KAAAA,CAAE,OAAA,GAAU,QAAA,EAAS,CAAE,SAAS,8GAA0G,CAAA;AAAA,EAClJ,UAAUA,KAAAA,CACP,MAAA,GACA,QAAA,EAAS,CACT,SAAS,sIAAsI;AACpJ,CAAC,EACA,MAAA,EAAO;AAIH,IAAM,oBAAA,GAAuBA,MACjC,MAAA,CAAO;AAAA,EACN,WAAA,EAAaA,MACV,MAAA,CAAO;AAAA,IACN,OAAOA,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,sDAAsD,CAAA;AAAA,IACnF,MAAA,EAAQ,WAAA;AAAA,IACR,OAAA,EAAS,qBAAA,CAAsB,QAAA,EAAS,CAAE,SAAS,sCAAsC,CAAA;AAAA,IACzF,QAAA,EAAU;AAAA,GACX,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,4EAA4E,CAAA;AAGjF,IAAM,qBAAA,GAAwBH,MAClC,MAAA,CAAO;AAAA,EACN,YAAA,EAAcA,MACX,MAAA,CAAO;AAAA,IACN,OAAOA,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,+DAA+D,CAAA;AAAA,IAC5F,UAAUH,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,4FAAuF,CAAA;AAAA,IACvH,MAAA,EAAQ,WAAA;AAAA,IACR,UAAA,EAAYH,KAAAA,CACT,OAAA,EAAQ,CACR,UAAS,CACT,QAAA;AAAA,MACC;AAAA,KACF;AAAA,IACF,MAAA,EAAQA,KAAAA,CAAE,MAAA,EAAO,CAAE,KAAI,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,IAAI,EAAE,CAAA,CAAE,QAAA,EAAS,CAAE,SAAS,sEAAuE,CAAA;AAAA,IACnI,QAAA,EAAU;AAAA,GACX,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,kFAAkF,CAAA;AAGvF,IAAM,sBAAA,GAAyBA,MACnC,MAAA,CAAO;AAAA,EACN,aAAA,EAAeA,MACZ,MAAA,CAAO;AAAA,IACN,OAAOA,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,uBAAuB,CAAA;AAAA,IACpD,MAAA,EAAQ,WAAA;AAAA,IACR,KAAA,EAAOH,KAAAA,CAAE,IAAA,CAAK,CAAC,SAAA,EAAW,SAAS,CAAC,CAAA,CAAE,QAAA,EAAS,CAAE,QAAA,CAAS,0EAAqE,CAAA;AAAA,IAC/H,MAAA,EAAQA,KAAAA,CAAE,MAAA,EAAO,CAAE,KAAI,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,IAAI,EAAE,CAAA,CAAE,QAAA,EAAS,CAAE,SAAS,qDAAsD,CAAA;AAAA,IAClH,SAAA,EAAWA,KAAAA,CAAE,MAAA,EAAO,CAAE,KAAI,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,IAAI,EAAE,CAAA,CAAE,QAAA,EAAS,CAAE,SAAS,0EAAqE,CAAA;AAAA,IACpI,SAASA,KAAAA,CAAE,OAAA,GAAU,QAAA,EAAS,CAAE,SAAS,oFAA+E,CAAA;AAAA,IACxH,QAAA,EAAU;AAAA,GACX,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,wDAAwD,CAAA;AC1FpE,IAAIC,aAAAA,GAA4BD,MAAE,GAAA,EAAI;AAC/B,IAAME,eAAAA,GAAgB,CAAC,MAAA,KAA+B;AAC3D,EAAAD,aAAAA,GAAc,MAAA;AAChB,CAAA;AACA,IAAME,SAAO,MAAoBF,aAAAA;AAEjC,IAAM,WAAW,CAAC,IAAA,KAChBD,KAAAA,CAAE,MAAA,CAAO,EAAE,IAAA,EAAMA,KAAAA,CAAE,IAAA,CAAKG,MAAI,EAAE,QAAA,CAAS,IAAI,CAAA,EAAG,EAAE,MAAA,EAAO;AAElD,IAAM,aAAA,GAAgBH,KAAAA,CAC1B,MAAA,CAAO,EAAE,IAAA,EAAM,QAAA,CAAS,0BAA0B,CAAA,EAAG,CAAA,CACrD,MAAA,EAAO,CACP,SAAS,kEAAkE,CAAA;AAGvE,IAAM,aAAA,GAAgBA,KAAAA,CAC1B,MAAA,CAAO,EAAE,IAAA,EAAM,QAAA,CAAS,8BAA8B,CAAA,EAAG,CAAA,CACzD,MAAA,EAAO,CACP,SAAS,0EAA0E,CAAA;AAG/E,IAAM,eAAA,GAAkBA,KAAAA,CAC5B,MAAA,CAAO,EAAE,MAAA,EAAQ,QAAA,CAAS,6BAA6B,CAAA,EAAG,CAAA,CAC1D,MAAA,EAAO,CACP,SAAS,yDAAyD,CAAA;AAG9D,IAAM,aAAA,GAAgBA,KAAAA,CAC1B,MAAA,CAAO,EAAE,IAAA,EAAM,QAAA,CAAS,mCAAmC,CAAA,EAAG,CAAA,CAC9D,MAAA,EAAO,CACP,SAAS,mEAAmE,CAAA;AAGxE,IAAM,aAAA,GAAgBA,KAAAA,CAC1B,MAAA,CAAO,EAAE,IAAA,EAAM,QAAA,CAAS,mCAAmC,CAAA,EAAG,CAAA,CAC9D,MAAA,EAAO,CACP,SAAS,mEAAmE,CAAA;AAGxE,IAAM,eAAA,GAAkBA,MAC5B,MAAA,CAAO;AAAA,EACN,MAAA,EAAQA,MACL,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,mCAAmC,CAAA;AAAA,IAC/D,GAAA,EAAKH,MAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,SAAS,kCAAkC;AAAA,GACnE,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,2EAA2E,CAAA;AAGhF,IAAM,cAAA,GAAiBA,MAC3B,MAAA,CAAO;AAAA,EACN,KAAA,EAAOA,MACJ,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,qBAAqB,CAAA;AAAA,IACjD,KAAA,EAAOH,MAAE,MAAA,EAAO,CAAE,KAAI,CAAE,WAAA,EAAY,CAAE,QAAA,CAAS,4CAA4C;AAAA,GAC5F,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,mDAAmD,CAAA;AAGxD,IAAM,cAAA,GAAiBA,MAC3B,MAAA,CAAO;AAAA,EACN,KAAA,EAAOA,MACJ,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,qBAAqB,CAAA;AAAA,IACjD,KAAA,EAAOH,MAAE,MAAA,EAAO,CAAE,KAAI,CAAE,WAAA,EAAY,CAAE,QAAA,CAAS,4CAA4C;AAAA,GAC5F,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,mDAAmD,CAAA;AAGxD,IAAM,eAAA,GAAkBA,MAC5B,MAAA,CAAO;AAAA,EACN,MAAA,EAAQA,MACL,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,yBAAyB,CAAA;AAAA,IACrD,EAAA,EAAIH,MAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,SAAS,wCAAwC,CAAA;AAAA,IACvE,QAAQA,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,wCAAwC;AAAA,GACvE,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,6EAA6E,CAAA;AAGlF,IAAM,iBAAA,GAAoBH,MAC9B,MAAA,CAAO;AAAA,EACN,QAAA,EAAUA,MACP,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,yBAAyB,CAAA;AAAA,IACrD,EAAA,EAAIH,MAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,SAAS,wCAAwC,CAAA;AAAA,IACvE,MAAMA,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,oDAAoD;AAAA,GACjF,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,iEAAiE,CAAA;ACvG7E,IAAIF,aAAAA,GAA4BD,MAAE,GAAA,EAAI;AAC/B,IAAME,eAAAA,GAAgB,CAAC,MAAA,KAA+B;AAC3D,EAAAD,aAAAA,GAAc,MAAA;AAChB,CAAA;AACA,IAAME,SAAO,MAAoBF,aAAAA;AAEjC,IAAM,UAAA,GAAaD,MAChB,KAAA,CAAMA,KAAAA,CAAE,MAAM,CAACA,KAAAA,CAAE,MAAA,EAAO,EAAGA,KAAAA,CAAE,MAAA,GAAS,GAAA,EAAI,CAAE,WAAA,EAAa,CAAC,CAAC,EAC3D,GAAA,CAAI,CAAC,CAAA,CACL,QAAA,CAAS,2EAA2E,CAAA;AAEhF,IAAM,aAAA,GAAgBA,MAC1B,MAAA,CAAO;AAAA,EACN,IAAA,EAAMA,MACH,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,yBAAyB,CAAA;AAAA,IACrD,IAAA,EAAM;AAAA,GACP,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,wGAAmG,CAAA;AAGxG,IAAM,oBAAA,GAAuBH,MACjC,MAAA,CAAO;AAAA,EACN,WAAA,EAAaA,MACV,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,kCAAkC,CAAA;AAAA,IAC9D,GAAA,EAAKH,KAAAA,CAAE,MAAA,CAAOA,KAAAA,CAAE,MAAA,EAAO,EAAGA,KAAAA,CAAE,MAAA,EAAQ,CAAA,CAAE,QAAA,CAAS,2FAAsF;AAAA,GACtI,EACA,MAAA;AACL,CAAC,CAAA,CACA,QAAO,CACP,QAAA;AAAA,EACC;AAEF,CAAA;AAGK,IAAM,gBAAA,GAAmBA,MAC7B,MAAA,CAAO;AAAA,EACN,OAAA,EAASA,MACN,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,0CAA0C,CAAA;AAAA,IACtE,IAAA,EAAM,UAAA;AAAA,IACN,OAAOH,KAAAA,CACJ,IAAA,CAAKG,MAAI,CAAA,CACT,SAAS,gGAAgG,CAAA;AAAA,IAC5G,EAAA,EAAIH,KAAAA,CAAE,MAAA,EAAO,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,QAAA,EAAS,CAAE,QAAA,CAAS,sEAAsE;AAAA,GACjH,EACA,MAAA;AACL,CAAC,CAAA,CACA,QAAO,CACP,QAAA;AAAA,EACC;AAEF,CAAA;AAGK,IAAM,gBAAA,GAAmBA,MAC7B,MAAA,CAAO;AAAA,EACN,OAAA,EAASA,MACN,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,iBAAiB,CAAA;AAAA,IAC7C,OAAA,EAASH,MAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,SAAS,4DAAuD,CAAA;AAAA,IAC3F,OAAOA,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,6BAA6B;AAAA,GAC3D,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,0IAA0I,CAAA;AAG/I,IAAM,cAAA,GAAiBH,MAC3B,MAAA,CAAO;AAAA,EACN,KAAA,EAAOA,MACJ,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,4CAAuC,CAAA;AAAA,IACnE,EAAA,EAAIH,MAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,SAAS,6CAA6C,CAAA;AAAA,IAC5E,OAAOA,KAAAA,CACJ,KAAA;AAAA,MACCA,MACG,MAAA,CAAO;AAAA,QACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,oEAAoE,CAAA;AAAA,QAChG,MAAMH,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,yBAA0B;AAAA,OACvD,EACA,MAAA;AAAO,KACZ,CACC,GAAA,CAAI,CAAC,CAAA,CACL,SAAS,kEAAkE,CAAA;AAAA,IAC9E,KAAA,EAAOH,MACJ,IAAA,CAAK,CAAC,QAAQ,KAAK,CAAC,CAAA,CACpB,QAAA,EAAS,CACT,QAAA;AAAA,MACC;AAAA;AAEF,GACH,EACA,MAAA;AACL,CAAC,CAAA,CACA,QAAO,CACP,QAAA;AAAA,EACC;AAEF,CAAA;;;AC/CK,IAAM,OAAA,GAAU;AAAA,EACrB,MAAA;AAAA,EAAQ,QAAA;AAAA,EAAU,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,OAAA;AAAA,EAClC,MAAA;AAAA,EAAQ,SAAA;AAAA,EAAW,SAAA;AAAA,EAAW,QAAA;AAAA,EAAU,UAAA;AAAA,EAAY,SAAA;AAAA,EAAW,SAAA;AAAA,EAC/D,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,QAAA;AAAA,EAAU,WAAA;AAAA,EAClD,OAAA;AAAA,EAAS,OAAA;AAAA,EAAS,WAAA;AAAA,EAAa,cAAA;AAAA,EAAgB,OAAA;AAAA,EAAS,QAAA;AAAA,EAAU,QAAA;AAAA,EAAU,QAAA;AAAA,EAAU,UAAA;AAAA,EACtF,KAAA;AAAA,EAAO,MAAA;AAAA,EAAQ,KAAA;AAAA,EAAO,MAAA;AAAA,EAAQ,KAAA;AAAA,EAAO,MAAA;AAAA,EAAQ,QAAA;AAAA,EAAU,aAAA;AAAA,EAAe,WAAA;AAAA,EAAa,WAAA;AAAA,EACnF,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,KAAA;AAAA,EAChB,QAAA;AAAA,EAAU,WAAA;AAAA,EAAa,OAAA;AAAA,EAAS,YAAA;AAAA,EAAc,QAAA;AAAA,EAAU,UAAA;AAAA,EACxD,OAAA;AAAA,EAAS,SAAA;AAAA,EAAW,cAAA;AAAA,EAAgB,OAAA;AAAA,EAAS,OAAA;AAAA,EAAS,OAAA;AAAA,EAAS,SAAA;AAAA,EAC/D,OAAA;AAAA,EAAS,UAAA;AAAA,EAAY,WAAA;AAAA,EACrB,aAAA;AAAA,EAAe,cAAA;AAAA,EAAgB,eAAA;AAAA,EAC/B,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,QAAA;AAAA,EAAU,MAAA;AAAA,EAAQ,MAAA;AAAA,EAClC,QAAA;AAAA,EAAU,OAAA;AAAA,EAAS,OAAA;AAAA,EAAS,QAAA;AAAA,EAAU,UAAA;AAAA,EACtC,MAAA;AAAA,EAAQ,aAAA;AAAA,EAAe,SAAA;AAAA,EAAW,SAAA;AAAA,EAAW;AAC/C;AAEO,IAAM,mBAAA,GAAsB;AAKnC,IAAM,YAAA,GAAe,SAAA;AAErB,IAAM,OAAA,GAAU,CAAC,GAAA,KAA0B,OAAA,CAAQ,KAAK,CAAC,EAAA,KAAO,OAAO,GAAG,CAAA;AAE1E,IAAM,qBAAqB,CAAC,GAAA,KAC1B,OAAA,CAAQ,GAAG,IACP,6DAAA,GACA,8FAAA;AAEN,IAAM,oBAAA,GAAuB,CAAC,GAAA,KAA0C;AACtE,EAAA,MAAM,IAAA,GAAO,IAAI,mBAAmB,CAAA;AACpC,EAAA,IAAI,IAAA,KAAS,QAAW,OAAO,IAAA;AAC/B,EAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,IAAI,GAAG,OAAO,KAAA;AACjC,EAAA,OAAO,IAAA,CAAK,MAAM,CAAC,CAAA,KAAM,OAAO,CAAA,KAAM,QAAA,IAAY,CAAA,CAAE,MAAA,GAAS,CAAC,CAAA;AAChE,CAAA;AAEA,IAAM,kBAAkBA,KAAAA,CAAE,KAAA,CAAMA,MAAE,IAAA,CAAK,MAAM,UAAU,CAAC,CAAA;AAMxD,IAAM,cAAA,GAAiBA,KAAAA,CACpB,MAAA,CAAOA,KAAAA,CAAE,QAAO,CAAE,KAAA,CAAM,YAAA,EAAc,EAAE,KAAA,EAAO,CAAC,KAAA,KAAU,kBAAA,CAAmB,MAAM,KAAK,CAAA,EAAG,CAAA,EAAGA,KAAAA,CAAE,IAAA,CAAK,MAAM,UAAU,CAAC,CAAA,CACtH,MAAA,CAAO,CAAC,CAAA,KAAM,qBAAqB,CAAC,CAAA,EAAG,EAAE,OAAA,EAAS,gEAAgE,CAAA;AASrH,IAAM,WAAA,GAAc,CAAC,OAAA,KAAoD;AACvE,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAoB;AACxC,EAAA,KAAA,MAAW,UAAU,OAAA,EAAS;AAC5B,IAAA,MAAM,EAAE,GAAA,EAAI,GAAI,MAAA,CAAO,IAAA;AACvB,IAAA,MAAM,IAAA,GAAO,OAAA,IAAW,GAAA,IAAO,OAAO,IAAI,KAAA,KAAU,QAAA,IAAY,GAAA,CAAI,KAAA,KAAU,OAAO,MAAA,CAAO,IAAA,CAAK,GAAA,CAAI,KAAK,IAAI,EAAC;AAC/G,IAAA,MAAM,CAAC,GAAG,CAAA,GAAI,IAAA;AACd,IAAA,IAAI,IAAA,CAAK,MAAA,KAAW,CAAA,IAAK,GAAA,KAAQ,MAAA,IAAa,OAAA,CAAQ,GAAG,CAAA,EAAG,OAAA,CAAQ,GAAA,CAAI,GAAA,EAAK,MAAM,CAAA;AAAA,EACrF;AACA,EAAA,OAAO,OAAA;AACT,CAAA;AAEA,IAAM,QAAA,GAAW,CAAC,KAAA,EAAgB,GAAA,KAAiD;AACjF,EAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,OAAO,KAAA,KAAU,UAAU,OAAO,mBAAA;AACxD,EAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG,OAAO,eAAA;AACjC,EAAA,MAAM,KAAA,GAAiB,MAAA,CAAO,cAAA,CAAe,KAAK,CAAA;AAClD,EAAA,IAAI,KAAA,KAAU,MAAA,CAAO,SAAA,IAAa,KAAA,KAAU,MAAM,OAAO,MAAA;AACzD,EAAA,IAAI,EAAA;AACJ,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,KAAA,MAAW,OAAO,KAAA,EAAO;AACvB,IAAA,KAAA,IAAS,CAAA;AACT,IAAA,IAAI,GAAA,CAAI,UAAA,CAAW,GAAG,CAAA,EAAG,EAAA,GAAK,GAAA;AAAA,EAChC;AACA,EAAA,IAAI,EAAA,KAAO,QAAW,OAAO,cAAA;AAC7B,EAAA,OAAO,KAAA,KAAU,CAAA,GAAI,GAAA,CAAI,GAAA,CAAI,EAAE,CAAA,GAAI,MAAA;AACrC,CAAA;AAEA,IAAM,KAAA,uBAAY,OAAA,EAAgB;AAClC,IAAM,OAAA,uBAAc,OAAA,EAAgB;AAEpC,IAAM,YAAYA,KAAAA,CAAE,IAAA,CAAK,aAAyB,gBAAA,EAAkB,CAAC,MAAM,GAAA,KAAQ;AACjF,EAAAA,KAAAA,CAAE,QAAA,CAAS,IAAA,CAAK,IAAA,EAAM,GAAG,CAAA;AACzB,EAAA,MAAM,GAAA,GAAM,WAAA,CAAY,GAAA,CAAI,OAAO,CAAA;AACnC,EAAA,MAAM,IAAA,GAAO,KAAK,IAAA,CAAK,KAAA;AACvB,EAAA,IAAA,CAAK,IAAA,CAAK,KAAA,GAAQ,CAAC,OAAA,EAAS,GAAA,KAAQ;AAClC,IAAA,IAAI,GAAA,CAAI,KAAA,KAAU,KAAA,IAAS,OAAA,CAAQ,GAAA,CAAI,GAAG,CAAA,EAAG,OAAO,IAAA,CAAK,OAAA,EAAS,GAAG,CAAA;AACrE,IAAA,MAAM,MAAA,GAAS,QAAA,CAAS,OAAA,CAAQ,KAAA,EAAO,GAAG,CAAA;AAE1C,IAAA,IAAI,KAAA,CAAM,GAAA,CAAI,GAAG,CAAA,EAAG;AAClB,MAAA,IAAI,WAAW,MAAA,EAAW,OAAO,OAAO,IAAA,CAAK,GAAA,CAAI,SAAS,GAAG,CAAA;AAC7D,MAAA,OAAA,CAAQ,MAAA,CAAO,KAAK,EAAE,IAAA,EAAM,UAAU,KAAA,EAAO,OAAA,CAAQ,KAAA,EAAO,IAAA,EAAM,CAAA;AAClE,MAAA,OAAO,OAAA;AAAA,IACT;AACA,IAAA,IAAI,WAAW,MAAA,EAAW;AAGxB,MAAA,MAAM,GAAA,GAAM,EAAE,KAAA,EAAO,KAAA,EAAgB,GAAI,GAAA,CAAI,OAAA,KAAY,MAAA,GAAY,EAAC,GAAI,EAAE,OAAA,EAAS,GAAA,CAAI,SAAQ,EAAG;AACpG,MAAA,KAAA,CAAM,IAAI,GAAG,CAAA;AACb,MAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,IAAA,CAAK,GAAA,CAAI,EAAE,KAAA,EAAO,OAAA,CAAQ,KAAA,EAAO,MAAA,EAAQ,EAAC,EAAE,EAAG,GAAG,CAAA;AACvE,MAAA,IAAI,EAAE,KAAA,YAAiB,OAAA,CAAA,IAAY,MAAM,MAAA,CAAO,MAAA,KAAW,GAAG,OAAO,KAAA;AAAA,IACvE;AACA,IAAA,OAAA,CAAQ,IAAI,GAAG,CAAA;AACf,IAAA,IAAI;AACF,MAAA,OAAO,IAAA,CAAK,SAAS,GAAG,CAAA;AAAA,IAC1B,CAAA,SAAE;AACA,MAAA,OAAA,CAAQ,OAAO,GAAG,CAAA;AAAA,IACpB;AAAA,EACF,CAAA;AACF,CAAC,CAAA;AAEM,IAAM,aAAiCA,KAAAA,CAAE,IAAA;AAAA,EAC9C,MACE,IAAI,SAAA,CAAU,EAAE,IAAA,EAAM,SAAS,OAAA,EAAS;AAAA,IACtC,aAAA;AAAA,IAAe,eAAA;AAAA,IAAiB,aAAA;AAAA,IAAe,aAAA;AAAA,IAAe,cAAA;AAAA,IAC9D,aAAA;AAAA,IAAe,gBAAA;AAAA,IAAkB,gBAAA;AAAA,IAAkB,eAAA;AAAA,IACnD,iBAAA;AAAA,IAAmB,gBAAA;AAAA,IAAkB,gBAAA;AAAA,IACrC,aAAA;AAAA,IAAe,aAAA;AAAA,IAAe,aAAA;AAAA,IAAe,aAAA;AAAA,IAAe,aAAA;AAAA,IAAe,eAAA;AAAA,IAAiB,kBAAA;AAAA,IAC5F,cAAA;AAAA,IAAgB,cAAA;AAAA,IAAgB,kBAAA;AAAA,IAAoB,qBAAA;AAAA,IAAuB,cAAA;AAAA,IAC3E,eAAA;AAAA,IAAiB,eAAA;AAAA,IAAiB,eAAA;AAAA,IAAiB,iBAAA;AAAA,IACnD,YAAA;AAAA,IAAc,aAAA;AAAA,IAAe,YAAA;AAAA,IAAc,aAAA;AAAA,IAC3C,YAAA;AAAA,IAAc,aAAA;AAAA,IAAe,eAAA;AAAA,IAC7B,oBAAA;AAAA,IAAsB,kBAAA;AAAA,IAAoB,kBAAA;AAAA,IAC1C,aAAA;AAAA,IAAe,aAAA;AAAA,IAAe,YAAA;AAAA,IAC9B,eAAA;AAAA,IAAiB,kBAAA;AAAA,IAAoB,cAAA;AAAA,IAAgB,mBAAA;AAAA,IACrD,eAAA;AAAA,IAAiB,iBAAA;AAAA,IACjB,cAAA;AAAA,IAAgB,gBAAA;AAAA,IAAkB,qBAAA;AAAA,IAClC,cAAA;AAAA,IAAgB,cAAA;AAAA,IAAgB,cAAA;AAAA,IAAgB,gBAAA;AAAA,IAChD,cAAA;AAAA,IAAgB,iBAAA;AAAA,IAAmB,kBAAA;AAAA,IACnC,oBAAA;AAAA,IAAsB,qBAAA;AAAA,IAAuB,sBAAA;AAAA,IAC7C,aAAA;AAAA,IAAe,aAAA;AAAA,IAAe,eAAA;AAAA,IAAiB,aAAA;AAAA,IAAe,aAAA;AAAA,IAC9D,eAAA;AAAA,IAAiB,cAAA;AAAA,IAAgB,cAAA;AAAA,IAAgB,eAAA;AAAA,IAAiB,iBAAA;AAAA,IAClE,aAAA;AAAA,IAAe,oBAAA;AAAA,IAAsB,gBAAA;AAAA,IAAkB,gBAAA;AAAA,IAAkB,cAAA;AAAA,IACzE,mBAAA;AAAA,IACA,eAAA;AAAA,IACA;AAAA,GACF,EAAG,CAAA,CAAE,QAAA,CAAS,yFAAyF;AAC3G;AAEA,aAAA,CAAY,UAAU,CAAA;AACtBE,cAAAA,CAAa,UAAU,CAAA;AACvBA,cAAAA,CAAY,UAAU,CAAA;AACtBA,cAAAA,CAAc,UAAU,CAAA;AACxBA,cAAAA,CAAiB,UAAU,CAAA;AAC3BA,cAAAA,CAAa,UAAU,CAAA;AACvBA,cAAAA,CAAiB,UAAU,CAAA;AAC3BA,cAAAA,CAAc,UAAU,CAAA;AACxBA,cAAAA,CAAY,UAAU,CAAA;AACtBA,eAAAA,CAAY,UAAU,CAAA;AACtBA,eAAAA,CAAa,UAAU,CAAA;AACvBA,eAAAA,CAAiB,UAAU,CAAA;AChNpB,IAAM,eAAe,UAAA,CAAW,QAAA;AAAA,EACrC;AACF","file":"chunk-6PD7M2F3.cjs","sourcesContent":["export const ErrorCode = {\n SCHEMA: 'E_SCHEMA',\n MISSING_PATH: 'E_MISSING_PATH',\n TYPE: 'E_TYPE',\n DIVISION_BY_ZERO: 'E_DIVISION_BY_ZERO',\n DATE_INVALID: 'E_DATE_INVALID',\n VAR_NOT_FOUND: 'E_VAR_NOT_FOUND',\n NODE_SHAPE: 'E_NODE_SHAPE',\n ASSERT: 'E_ASSERT',\n BUDGET: 'E_BUDGET',\n} as const;\n\nexport type ErrorCode = (typeof ErrorCode)[keyof typeof ErrorCode];\n\nexport type PrismErrorContext = {\n op?: string;\n path?: string;\n details?: Record<string, unknown>;\n};\n\nexport class PrismError extends Error {\n readonly code: ErrorCode;\n readonly context: PrismErrorContext | undefined;\n\n constructor(message: string, code: ErrorCode, context?: PrismErrorContext) {\n super(message);\n this.name = 'PrismError';\n this.code = code;\n this.context = context;\n }\n}\n","import { z } from 'zod';\n\nexport const JsonPrimitiveSchema = z\n .union([z.string(), z.number(), z.boolean(), z.null()])\n .describe('JSON primitive: string | number | boolean | null');\n\nexport const JsonValueSchema: z.ZodType<\n string | number | boolean | null | unknown[] | Record<string, unknown>\n> = z.lazy(() =>\n z.union([JsonPrimitiveSchema, z.array(JsonValueSchema), z.record(z.string(), JsonValueSchema)]),\n).describe('Any JSON value: primitive, array, or object');\n\nexport const JsonObjectSchema = z\n .record(z.string(), JsonValueSchema)\n .describe('JSON object mapping string keys to JSON values');\n","import type { JsonObject, JsonValue } from '../types';\nimport type { RefNode } from './ops/core.schema';\nimport type { ConstNode, VarNode, GetNode, WithNode } from './ops/core.schema';\nimport type { MapNode, FilterNode, ReduceNode, SliceNode, FlattenNode, UniqueNode, SortByNode } from './ops/array.schema';\nimport type { AddNode, SubNode, MulNode, DivNode, ModNode, RoundNode, ToNumberNode } from './ops/math.schema';\nimport type { FillNode, JoinNode, ToStringNode, InterpolateNode, TrimNode, LowerNode, UpperNode, SplitNode, ReplaceNode } from './ops/string.schema';\nimport type { EqNode, NeqNode, GtNode, GteNode, LtNode, LteNode, EmptyNode, StartsWithNode, EndsWithNode, ContainsNode } from './ops/predicate.schema';\nimport type { NotNode, AndNode, OrNode } from './ops/logic.schema';\nimport type { MergeNode, CoalesceNode, CaseNode, EntriesOfNode, KeyByNode, GroupByNode } from './ops/structure.schema';\nimport type { KeysNode, ValuesNode, FromEntriesNode, PickNode, OmitNode, TypeNode, LengthNode } from './ops/object.schema';\nimport type { DateNode, DateAddNode, DateDiffNode } from './ops/time.schema';\nimport type { LocaleDateNode, LocaleMoneyNode, LocaleNumberNode } from './ops/intl.schema';\nimport type { HasNode, RenameKeysNode, UpdateNode, AssertNode, WalkNode } from './ops/transform.schema';\nimport type {\n SumNode, AvgNode, CountNode, MinNode, MaxNode,\n PluckNode, TakeNode, DropNode, MatchNode, FlatMapNode,\n} from './ops/sugar.schema';\n\nconst hasKey = (value: unknown, key: string): value is Record<string, unknown> =>\n typeof value === 'object' && value !== null && !Array.isArray(value) && key in value;\n\nexport const isJsonObject = (value: unknown): value is JsonObject =>\n typeof value === 'object' && value !== null && !Array.isArray(value);\n\nexport const isJsonArray = (value: unknown): value is JsonValue[] =>\n Array.isArray(value);\n\nexport const isRefNode = (v: unknown): v is RefNode => hasKey(v, '$ref');\nexport const isConstNode = (v: unknown): v is ConstNode => hasKey(v, '$const');\nexport const isVarNode = (v: unknown): v is VarNode => hasKey(v, '$var');\nexport const isGetNode = (v: unknown): v is GetNode => hasKey(v, '$get');\nexport const isWithNode = (v: unknown): v is WithNode => hasKey(v, '$with');\n\nexport const isMapNode = (v: unknown): v is MapNode => hasKey(v, '$map');\nexport const isFilterNode = (v: unknown): v is FilterNode => hasKey(v, '$filter');\nexport const isReduceNode = (v: unknown): v is ReduceNode => hasKey(v, '$reduce');\nexport const isSliceNode = (v: unknown): v is SliceNode => hasKey(v, '$slice');\nexport const isFlattenNode = (v: unknown): v is FlattenNode => hasKey(v, '$flatten');\nexport const isUniqueNode = (v: unknown): v is UniqueNode => hasKey(v, '$unique');\nexport const isSortByNode = (v: unknown): v is SortByNode => hasKey(v, '$sortBy');\n\nexport const isAddNode = (v: unknown): v is AddNode => hasKey(v, '$add');\nexport const isSubNode = (v: unknown): v is SubNode => hasKey(v, '$sub');\nexport const isMulNode = (v: unknown): v is MulNode => hasKey(v, '$mul');\nexport const isDivNode = (v: unknown): v is DivNode => hasKey(v, '$div');\nexport const isRoundNode = (v: unknown): v is RoundNode => hasKey(v, '$round');\nexport const isModNode = (v: unknown): v is ModNode => hasKey(v, '$mod');\nexport const isToNumberNode = (v: unknown): v is ToNumberNode => hasKey(v, '$toNumber');\n\nexport const isJoinNode = (v: unknown): v is JoinNode => hasKey(v, '$join');\nexport const isToStringNode = (v: unknown): v is ToStringNode => hasKey(v, '$toString');\nexport const isInterpolateNode = (v: unknown): v is InterpolateNode => hasKey(v, '$interpolate');\nexport const isFillNode = (v: unknown): v is FillNode => hasKey(v, '$fill');\nexport const isTrimNode = (v: unknown): v is TrimNode => hasKey(v, '$trim');\nexport const isLowerNode = (v: unknown): v is LowerNode => hasKey(v, '$lower');\nexport const isUpperNode = (v: unknown): v is UpperNode => hasKey(v, '$upper');\nexport const isSplitNode = (v: unknown): v is SplitNode => hasKey(v, '$split');\nexport const isReplaceNode = (v: unknown): v is ReplaceNode => hasKey(v, '$replace');\n\nexport const isEqNode = (v: unknown): v is EqNode => hasKey(v, '$eq');\nexport const isNeqNode = (v: unknown): v is NeqNode => hasKey(v, '$neq');\nexport const isGtNode = (v: unknown): v is GtNode => hasKey(v, '$gt');\nexport const isGteNode = (v: unknown): v is GteNode => hasKey(v, '$gte');\nexport const isLtNode = (v: unknown): v is LtNode => hasKey(v, '$lt');\nexport const isLteNode = (v: unknown): v is LteNode => hasKey(v, '$lte');\nexport const isEmptyNode = (v: unknown): v is EmptyNode => hasKey(v, '$empty');\nexport const isStartsWithNode = (v: unknown): v is StartsWithNode => hasKey(v, '$startsWith');\nexport const isEndsWithNode = (v: unknown): v is EndsWithNode => hasKey(v, '$endsWith');\nexport const isContainsNode = (v: unknown): v is ContainsNode => hasKey(v, '$contains');\n\nexport const isNotNode = (v: unknown): v is NotNode => hasKey(v, '$not');\nexport const isAndNode = (v: unknown): v is AndNode => hasKey(v, '$and');\nexport const isOrNode = (v: unknown): v is OrNode => hasKey(v, '$or');\n\nexport const isMergeNode = (v: unknown): v is MergeNode => hasKey(v, '$merge');\nexport const isCoalesceNode = (v: unknown): v is CoalesceNode => hasKey(v, '$coalesce');\nexport const isCaseNode = (v: unknown): v is CaseNode => hasKey(v, '$case');\nexport const isEntriesOfNode = (v: unknown): v is EntriesOfNode => hasKey(v, '$entriesOf');\nexport const isKeyByNode = (v: unknown): v is KeyByNode => hasKey(v, '$keyBy');\nexport const isGroupByNode = (v: unknown): v is GroupByNode => hasKey(v, '$groupBy');\n\nexport const isKeysNode = (v: unknown): v is KeysNode => hasKey(v, '$keys');\nexport const isValuesNode = (v: unknown): v is ValuesNode => hasKey(v, '$values');\nexport const isFromEntriesNode = (v: unknown): v is FromEntriesNode => hasKey(v, '$fromEntries');\nexport const isPickNode = (v: unknown): v is PickNode => hasKey(v, '$pick');\nexport const isOmitNode = (v: unknown): v is OmitNode => hasKey(v, '$omit');\nexport const isHasNode = (v: unknown): v is HasNode => hasKey(v, '$has');\nexport const isRenameKeysNode = (v: unknown): v is RenameKeysNode => hasKey(v, '$renameKeys');\nexport const isUpdateNode = (v: unknown): v is UpdateNode => hasKey(v, '$update');\nexport const isAssertNode = (v: unknown): v is AssertNode => hasKey(v, '$assert');\nexport const isWalkNode = (v: unknown): v is WalkNode => hasKey(v, '$walk');\nexport const isTypeNode = (v: unknown): v is TypeNode => hasKey(v, '$type');\nexport const isLengthNode = (v: unknown): v is LengthNode => hasKey(v, '$length');\n\nexport const isDateNode = (v: unknown): v is DateNode => hasKey(v, '$date');\nexport const isDateAddNode = (v: unknown): v is DateAddNode => hasKey(v, '$dateAdd');\nexport const isDateDiffNode = (v: unknown): v is DateDiffNode => hasKey(v, '$dateDiff');\n\nexport const isLocaleDateNode = (v: unknown): v is LocaleDateNode => hasKey(v, '$localeDate');\nexport const isLocaleMoneyNode = (v: unknown): v is LocaleMoneyNode => hasKey(v, '$localeMoney');\nexport const isLocaleNumberNode = (v: unknown): v is LocaleNumberNode => hasKey(v, '$localeNumber');\n\nexport const isSumNode = (v: unknown): v is SumNode => hasKey(v, '$sum');\nexport const isAvgNode = (v: unknown): v is AvgNode => hasKey(v, '$avg');\nexport const isCountNode = (v: unknown): v is CountNode => hasKey(v, '$count');\nexport const isMinNode = (v: unknown): v is MinNode => hasKey(v, '$min');\nexport const isMaxNode = (v: unknown): v is MaxNode => hasKey(v, '$max');\nexport const isPluckNode = (v: unknown): v is PluckNode => hasKey(v, '$pluck');\nexport const isTakeNode = (v: unknown): v is TakeNode => hasKey(v, '$take');\nexport const isDropNode = (v: unknown): v is DropNode => hasKey(v, '$drop');\nexport const isMatchNode = (v: unknown): v is MatchNode => hasKey(v, '$match');\nexport const isFlatMapNode = (v: unknown): v is FlatMapNode => hasKey(v, '$flatMap');\n\nexport const isPlainObject = (value: unknown): value is Record<string, unknown> =>\n isJsonObject(value) && !Object.keys(value).some((k) => k.startsWith('$'));\n","import type { JsonValue } from '../types';\nimport { isJsonArray, isJsonObject } from '../schemas/guards';\nimport { PrismError, ErrorCode } from '../errors';\n\nexport type JsonPathSegment =\n | { type: 'key'; key: string }\n | { type: 'index'; index: number };\n\nexport const pathRefusal = (path: string): string =>\n `Not a path Prism reads: \"${path}\". A path is keys and indexes only, as in $.rows[0].sku; for every item of a list use $map or $pluck.`;\n\nconst refuse = (path: string): never => {\n throw new PrismError(pathRefusal(path), ErrorCode.SCHEMA, { op: '$ref', path });\n};\n\nexport const isReadablePath = (path: string): boolean => {\n if (!path.includes('[') && !path.includes('..')) return true;\n try {\n parseJsonPath(path);\n return true;\n } catch {\n return false;\n }\n};\n\nexport const parseJsonPath = (path: string): JsonPathSegment[] => {\n if (!path.startsWith('$.')) return [];\n\n const segments: JsonPathSegment[] = [];\n let cursor = 2;\n let currentKey = '';\n\n const pushKey = (): void => {\n if (currentKey.length > 0) {\n segments.push({ type: 'key', key: currentKey });\n currentKey = '';\n }\n };\n\n while (cursor < path.length) {\n const char = path[cursor]!;\n\n if (char === '.') {\n if (path[cursor - 1] === '.') refuse(path);\n pushKey();\n cursor++;\n continue;\n }\n\n if (char === '[') {\n pushKey();\n cursor++;\n let numBuf = '';\n while (cursor < path.length && path[cursor] !== ']') {\n numBuf += path[cursor];\n cursor++;\n }\n if (path[cursor] !== ']') refuse(path);\n cursor++;\n const index = Number(numBuf);\n if (numBuf.trim() === '' || !Number.isInteger(index) || index < 0) refuse(path);\n segments.push({ type: 'index', index });\n continue;\n }\n\n currentKey += char;\n cursor++;\n }\n\n pushKey();\n return segments;\n};\n\nconst cache = new Map<string, JsonPathSegment[]>();\n\nexport const parseJsonPathCached = (path: string): JsonPathSegment[] => {\n const cached = cache.get(path);\n if (cached) return cached;\n const parsed = parseJsonPath(path);\n cache.set(path, parsed);\n return parsed;\n};\n\nexport const getByPath = (root: JsonValue, segments: JsonPathSegment[]): JsonValue | undefined => {\n let current: JsonValue | undefined = root;\n\n for (const segment of segments) {\n if (segment.type === 'key') {\n if (!isJsonObject(current)) return undefined;\n current = current[segment.key];\n } else {\n if (!isJsonArray(current)) return undefined;\n current = current[segment.index];\n }\n }\n\n return current;\n};\n","import { z } from 'zod';\n\nimport { JsonValueSchema } from '../json.schema';\nimport { isReadablePath, pathRefusal } from '../../utils/jsonpath';\n\nlet _NodeSchema: z.ZodTypeAny = z.any();\nexport const setNodeSchema = (schema: z.ZodTypeAny): void => {\n _NodeSchema = schema;\n};\nconst node = (): z.ZodTypeAny => _NodeSchema;\n\nexport const RefNodeSchema = z\n .object({\n $ref: z\n .string()\n .regex(/^\\$(\\..*)?$/)\n // A refinement, not a tighter pattern: the pattern is the published JSON\n // Schema, and what the parser reads is the parser's to say.\n .refine(isReadablePath, { error: (issue) => pathRefusal(String(issue.input)) })\n .describe('JSONPath from the source root: \"$\" is the whole source; \"$.user.name\", \"$.items[0].sku\" reach into it. Only reads from source data, not variables. For variables use $var, for navigating into variables use $get.'),\n })\n .strict()\n .describe('Read a value from the source data by static JSONPath. Use $ref for source access, $var for variables, $get for navigating into variables or dynamic paths.');\n\nexport type RefNode = z.infer<typeof RefNodeSchema>;\n\nexport const ConstNodeSchema = z\n .object({\n $const: JsonValueSchema.describe('Any JSON value to return as-is.'),\n })\n .strict()\n .describe('Return a literal JSON value unchanged.');\n\nexport type ConstNode = z.infer<typeof ConstNodeSchema>;\n\nexport const VarNodeSchema = z\n .object({\n $var: z.string().min(1).describe('Variable name bound by $with, $map, $filter, $reduce, or $sortBy.'),\n })\n .strict()\n .describe('Read a scoped variable by name. Variables are created by $with (let bindings), $map/$filter/$reduce/$sortBy (loop element). Returns the whole variable — use $get to navigate into it.');\n\nexport type VarNode = z.infer<typeof VarNodeSchema>;\n\nexport const GetNodeSchema = z\n .object({\n $get: z\n .object({\n from: z.lazy(node).describe('Source value to navigate into.'),\n path: z\n .array(z.union([z.string(), z.number(), z.lazy(node)]))\n .min(1)\n .describe('Path segments: string keys, numeric indices, or node expressions.'),\n fallback: z.lazy(node).optional().describe('Fallback value when path is missing.'),\n })\n .strict(),\n })\n .strict()\n .describe('Navigate into a value by path. Use to access fields on variables: {$get: {from: {$var: \"item\"}, path: [\"name\"]}}. Also supports dynamic path segments (nodes as segments) and fallback values. Prefer $ref for simple source access.');\n\nexport type GetNode = z.infer<typeof GetNodeSchema>;\n\nexport const WithNodeSchema = z\n .object({\n $with: z\n .object({\n let: z\n .record(z.string(), z.lazy(node))\n .describe('Variable bindings: name → expression evaluated in current scope.'),\n value: z.lazy(node).describe('Expression evaluated with the declared variables in scope.'),\n })\n .strict(),\n })\n .strict()\n .describe('Bind variables in a scoped block: { $with: { let: { x: ... }, value: ... } }');\n\nexport type WithNode = z.infer<typeof WithNodeSchema>;\n","import { z } from 'zod';\n\nlet _NodeSchema: z.ZodTypeAny = z.any();\nexport const setNodeSchema = (schema: z.ZodTypeAny): void => {\n _NodeSchema = schema;\n};\nconst node = (): z.ZodTypeAny => _NodeSchema;\n\nexport const MapNodeSchema = z\n .object({\n $map: z\n .object({\n over: z.lazy(node).describe('Array to iterate over.'),\n as: z.string().min(1).describe('Variable name for the current element.'),\n body: z.lazy(node).describe('Expression evaluated for each element.'),\n })\n .strict(),\n })\n .strict()\n .describe('Map over an array, transforming each element.');\n\nexport type MapNode = z.infer<typeof MapNodeSchema>;\n\nexport const FilterNodeSchema = z\n .object({\n $filter: z\n .object({\n over: z.lazy(node).describe('Array to filter.'),\n as: z.string().min(1).describe('Variable name for the current element.'),\n when: z.lazy(node).describe('Condition — keeps element when truthy.'),\n })\n .strict(),\n })\n .strict()\n .describe('Filter an array, keeping elements where condition is truthy.');\n\nexport type FilterNode = z.infer<typeof FilterNodeSchema>;\n\nexport const ReduceNodeSchema = z\n .object({\n $reduce: z\n .object({\n over: z.lazy(node).describe('Array to reduce.'),\n as: z.string().min(1).describe('Variable name for the current element.'),\n acc: z.string().min(1).optional().default('acc').describe('Accumulator variable name. Default: \"acc\".'),\n init: z.lazy(node).describe('Initial accumulator value.'),\n body: z.lazy(node).describe('Expression evaluated for each element with both element and accumulator in scope.'),\n })\n .strict(),\n })\n .strict()\n .describe('Reduce an array to a single value using an accumulator.');\n\nexport type ReduceNode = z.infer<typeof ReduceNodeSchema>;\n\nexport const SliceNodeSchema = z\n .object({\n $slice: z\n .object({\n from: z.lazy(node).describe('Array or string to slice.'),\n start: z.number().int().optional().describe('Start index (inclusive). Default: 0.'),\n end: z.number().int().optional().describe('End index (exclusive). Default: length.'),\n })\n .strict(),\n })\n .strict()\n .describe('Slice an array or string by start/end indices.');\n\nexport type SliceNode = z.infer<typeof SliceNodeSchema>;\n\nexport const FlattenNodeSchema = z\n .object({\n $flatten: z.lazy(node).describe('Array of arrays to flatten one level.'),\n })\n .strict()\n .describe('Flatten a nested array by one level.');\n\nexport type FlattenNode = z.infer<typeof FlattenNodeSchema>;\n\nexport const UniqueNodeSchema = z\n .object({\n $unique: z.lazy(node).describe('Array to deduplicate.'),\n })\n .strict()\n .describe('Remove duplicate values from an array (compared by JSON.stringify).');\n\nexport type UniqueNode = z.infer<typeof UniqueNodeSchema>;\n\nexport const SortByNodeSchema = z\n .object({\n $sortBy: z\n .object({\n over: z.lazy(node).describe('Array to sort.'),\n as: z.string().min(1).describe('Variable name for the current element.'),\n by: z.lazy(node).describe('Expression to compute the sort key.'),\n dir: z.enum(['asc', 'desc']).optional().default('asc').describe('Sort direction. Default: \"asc\".'),\n })\n .strict(),\n })\n .strict()\n .describe('Sort an array by a computed key.');\n\nexport type SortByNode = z.infer<typeof SortByNodeSchema>;\n","import { z } from 'zod';\n\nlet _NodeSchema: z.ZodTypeAny = z.any();\nexport const setNodeSchema = (schema: z.ZodTypeAny): void => {\n _NodeSchema = schema;\n};\nconst node = (): z.ZodTypeAny => _NodeSchema;\n\nconst pairOf = (desc: string) =>\n z.tuple([z.lazy(node), z.lazy(node)]).describe(desc);\n\nexport const AddNodeSchema = z\n .object({ $add: pairOf('Two numeric operands to add.') })\n .strict()\n .describe('Add two numbers.');\nexport type AddNode = z.infer<typeof AddNodeSchema>;\n\nexport const SubNodeSchema = z\n .object({ $sub: pairOf('Two numeric operands to subtract (a - b).') })\n .strict()\n .describe('Subtract second number from first.');\nexport type SubNode = z.infer<typeof SubNodeSchema>;\n\nexport const MulNodeSchema = z\n .object({ $mul: pairOf('Two numeric operands to multiply.') })\n .strict()\n .describe('Multiply two numbers.');\nexport type MulNode = z.infer<typeof MulNodeSchema>;\n\nexport const DivNodeSchema = z\n .object({ $div: pairOf('Two numeric operands to divide (a / b). Throws on division by zero.') })\n .strict()\n .describe('Divide first number by second. Throws E_DIVISION_BY_ZERO if divisor is 0.');\nexport type DivNode = z.infer<typeof DivNodeSchema>;\n\nexport const ModNodeSchema = z\n .object({ $mod: pairOf('Two numeric operands: the remainder of a divided by b. Throws on division by zero.') })\n .strict()\n .describe('The remainder of the first number divided by the second, with the sign of the second: for a positive divisor n it is always from 0 up to n, also for a negative first number. Throws E_DIVISION_BY_ZERO if divisor is 0.');\nexport type ModNode = z.infer<typeof ModNodeSchema>;\n\nexport const RoundNodeSchema = z\n .object({\n $round: z\n .object({\n value: z.lazy(node).describe('Numeric value to round.'),\n digits: z.number().int().nonnegative().optional().default(0).describe('Decimal places. Default: 0.'),\n mode: z.enum(['nearest', 'floor', 'ceil']).optional().describe('Which way to round: \"nearest\" (the default), \"floor\" (down, toward negative infinity) or \"ceil\" (up).'),\n })\n .strict(),\n })\n .strict()\n .describe('Round a number to N decimal places: to the nearest, or down (\"floor\") or up (\"ceil\") with `mode`.');\nexport type RoundNode = z.infer<typeof RoundNodeSchema>;\n\nexport const ToNumberNodeSchema = z\n .object({\n $toNumber: z\n .object({\n value: z.lazy(node).describe('A number, or text that is a number written in digits: \"42\", \"-3.5\", \" 1e3 \".'),\n fallback: z.lazy(node).optional().describe('What to answer when the value is not a number and not such text. Without it that is an error.'),\n })\n .strict(),\n })\n .strict()\n .describe('A number from a number or from numeric text, as data from a form, a CSV or an API often has it. Anything else (other text, true, null, an object) throws E_TYPE unless `fallback` is given.');\nexport type ToNumberNode = z.infer<typeof ToNumberNodeSchema>;\n","import { z } from 'zod';\n\nlet _NodeSchema: z.ZodTypeAny = z.any();\nexport const setNodeSchema = (schema: z.ZodTypeAny): void => {\n _NodeSchema = schema;\n};\nconst node = (): z.ZodTypeAny => _NodeSchema;\n\nexport const JoinNodeSchema = z\n .object({\n $join: z\n .object({\n parts: z\n .lazy(node)\n .describe('Values to concatenate (coerced to string): a literal list of nodes, or any node that evaluates to an array — a mapped list, a $var.'),\n sep: z.string().optional().default('').describe('Separator between parts. Default: \"\".'),\n })\n .strict(),\n })\n .strict()\n .describe('Concatenate values into a string with an optional separator.');\nexport type JoinNode = z.infer<typeof JoinNodeSchema>;\n\nexport const ToStringNodeSchema = z\n .object({ $toString: z.lazy(node).describe('Value to stringify via String().') })\n .strict()\n .describe('Convert a value to its string representation.');\nexport type ToStringNode = z.infer<typeof ToStringNodeSchema>;\n\nexport const InterpolateNodeSchema = z\n .object({\n $interpolate: z\n .object({\n template: z.string().describe('Template with {{key}} placeholders.'),\n values: z.lazy(node).describe('Object whose keys replace {{key}} placeholders.'),\n })\n .strict(),\n })\n .strict()\n .describe('Replace {{key}} placeholders in a template with values from an object.');\nexport type InterpolateNode = z.infer<typeof InterpolateNodeSchema>;\n\nexport const FillNodeSchema = z\n .object({\n $fill: z\n .lazy(node)\n .describe('A pattern value `{ phrase, slots }` — filled with its own slots, source language. Non-patterns pass through.'),\n })\n .strict()\n .describe('Fill a counted phrase: `{ phrase: \"{n} of {total}\", slots: { n: 1, total: 12 } }` → \"1 of 12\".');\nexport type FillNode = z.infer<typeof FillNodeSchema>;\n\nexport const TrimNodeSchema = z\n .object({ $trim: z.lazy(node).describe('String to trim whitespace from.') })\n .strict()\n .describe('Trim leading and trailing whitespace from a string.');\nexport type TrimNode = z.infer<typeof TrimNodeSchema>;\n\nexport const LowerNodeSchema = z\n .object({ $lower: z.lazy(node).describe('String to lowercase.') })\n .strict()\n .describe('Convert a string to lowercase.');\nexport type LowerNode = z.infer<typeof LowerNodeSchema>;\n\nexport const UpperNodeSchema = z\n .object({ $upper: z.lazy(node).describe('String to uppercase.') })\n .strict()\n .describe('Convert a string to uppercase.');\nexport type UpperNode = z.infer<typeof UpperNodeSchema>;\n\nexport const SplitNodeSchema = z\n .object({\n $split: z\n .object({\n value: z.lazy(node).describe('String to split.'),\n sep: z.string().describe('Separator to split on.'),\n })\n .strict(),\n })\n .strict()\n .describe('Split a string into an array by separator.');\nexport type SplitNode = z.infer<typeof SplitNodeSchema>;\n\nexport const ReplaceNodeSchema = z\n .object({\n $replace: z\n .object({\n value: z.lazy(node).describe('String to search in.'),\n search: z.string().describe('Substring to find.'),\n replacement: z.string().describe('Replacement string.'),\n all: z.boolean().optional().describe('true replaces every occurrence. Default: only the first.'),\n })\n .strict(),\n })\n .strict()\n .describe('Replace the first occurrence of a substring, or every occurrence with `all: true`.');\nexport type ReplaceNode = z.infer<typeof ReplaceNodeSchema>;\n","import { z } from 'zod';\n\nlet _NodeSchema: z.ZodTypeAny = z.any();\nexport const setNodeSchema = (schema: z.ZodTypeAny): void => {\n _NodeSchema = schema;\n};\nconst node = (): z.ZodTypeAny => _NodeSchema;\n\nconst pairOf = (desc: string) =>\n z.tuple([z.lazy(node), z.lazy(node)]).describe(desc);\n\nexport const EqNodeSchema = z\n .object({ $eq: pairOf('Two values to compare for deep equality.') })\n .strict()\n .describe('Deep equality comparison (JSON.stringify-based). Returns true or false.');\nexport type EqNode = z.infer<typeof EqNodeSchema>;\n\nexport const NeqNodeSchema = z\n .object({ $neq: pairOf('Two values to compare for inequality.') })\n .strict()\n .describe('Deep inequality comparison. Returns true or false.');\nexport type NeqNode = z.infer<typeof NeqNodeSchema>;\n\nexport const GtNodeSchema = z\n .object({ $gt: pairOf('Two values: returns true if first > second (numbers or strings).') })\n .strict()\n .describe('Greater than comparison for numbers or strings.');\nexport type GtNode = z.infer<typeof GtNodeSchema>;\n\nexport const GteNodeSchema = z\n .object({ $gte: pairOf('Two values: returns true if first >= second.') })\n .strict()\n .describe('Greater than or equal comparison.');\nexport type GteNode = z.infer<typeof GteNodeSchema>;\n\nexport const LtNodeSchema = z\n .object({ $lt: pairOf('Two values: returns true if first < second.') })\n .strict()\n .describe('Less than comparison.');\nexport type LtNode = z.infer<typeof LtNodeSchema>;\n\nexport const LteNodeSchema = z\n .object({ $lte: pairOf('Two values: returns true if first <= second.') })\n .strict()\n .describe('Less than or equal comparison.');\nexport type LteNode = z.infer<typeof LteNodeSchema>;\n\nexport const EmptyNodeSchema = z\n .object({ $empty: z.lazy(node).describe('Value to check for emptiness (null, \"\", [], {}).') })\n .strict()\n .describe('Returns true if value is null, empty string, empty array, or empty object.');\nexport type EmptyNode = z.infer<typeof EmptyNodeSchema>;\n\nexport const StartsWithNodeSchema = z\n .object({\n $startsWith: z\n .object({\n value: z.lazy(node).describe('String to check.'),\n prefix: z.lazy(node).describe('Expected prefix.'),\n })\n .strict(),\n })\n .strict()\n .describe('Returns true if string starts with prefix.');\nexport type StartsWithNode = z.infer<typeof StartsWithNodeSchema>;\n\nexport const EndsWithNodeSchema = z\n .object({\n $endsWith: z\n .object({\n value: z.lazy(node).describe('String to check.'),\n suffix: z.lazy(node).describe('Expected suffix.'),\n })\n .strict(),\n })\n .strict()\n .describe('Returns true if string ends with suffix.');\nexport type EndsWithNode = z.infer<typeof EndsWithNodeSchema>;\n\nexport const ContainsNodeSchema = z\n .object({\n $contains: z\n .object({\n value: z.lazy(node).describe('String to search in.'),\n search: z.lazy(node).describe('Substring to find.'),\n })\n .strict(),\n })\n .strict()\n .describe('Returns true if string contains the search substring.');\nexport type ContainsNode = z.infer<typeof ContainsNodeSchema>;\n","import { z } from 'zod';\n\nlet _NodeSchema: z.ZodTypeAny = z.any();\nexport const setNodeSchema = (schema: z.ZodTypeAny): void => {\n _NodeSchema = schema;\n};\nconst node = (): z.ZodTypeAny => _NodeSchema;\n\nexport const NotNodeSchema = z\n .object({ $not: z.lazy(node).describe('Value to negate (truthy → false, falsy → true).') })\n .strict()\n .describe('Boolean negation of a truthy/falsy value.');\nexport type NotNode = z.infer<typeof NotNodeSchema>;\n\nexport const AndNodeSchema = z\n .object({\n $and: z\n .array(z.lazy(node))\n .min(1)\n .describe('Values to AND. Short-circuits: returns last truthy or first falsy.'),\n })\n .strict()\n .describe('Short-circuit logical AND.');\nexport type AndNode = z.infer<typeof AndNodeSchema>;\n\nexport const OrNodeSchema = z\n .object({\n $or: z\n .array(z.lazy(node))\n .min(1)\n .describe('Values to OR. Short-circuits: returns first truthy or last falsy.'),\n })\n .strict()\n .describe('Short-circuit logical OR.');\nexport type OrNode = z.infer<typeof OrNodeSchema>;\n","import { z } from 'zod';\n\nlet _NodeSchema: z.ZodTypeAny = z.any();\nexport const setNodeSchema = (schema: z.ZodTypeAny): void => {\n _NodeSchema = schema;\n};\nconst node = (): z.ZodTypeAny => _NodeSchema;\n\nexport const MergeNodeSchema = z\n .object({\n $merge: z\n .array(z.lazy(node))\n .min(1)\n .describe('Objects to shallow-merge (left to right, later wins).'),\n })\n .strict()\n .describe('Shallow merge multiple objects. Later values overwrite earlier ones.');\nexport type MergeNode = z.infer<typeof MergeNodeSchema>;\n\nexport const CoalesceNodeSchema = z\n .object({\n $coalesce: z\n .array(z.lazy(node))\n .min(1)\n .describe('Values to try in order. Returns first non-null/non-undefined.'),\n })\n .strict()\n .describe('Return the first non-null, non-undefined value.');\nexport type CoalesceNode = z.infer<typeof CoalesceNodeSchema>;\n\nexport const CaseNodeSchema = z\n .object({\n $case: z\n .object({\n branches: z\n .array(\n z.object({\n when: z.lazy(node).describe('Condition to evaluate.'),\n then: z.lazy(node).describe('Value to return if condition is truthy.'),\n }).strict(),\n )\n .min(1)\n .describe('Ordered list of when/then branches.'),\n else: z.lazy(node).optional().describe('Fallback value if no branch matches. Default: null.'),\n })\n .strict(),\n })\n .strict()\n .describe('Conditional branching: evaluates branches in order, returns first match or else.');\nexport type CaseNode = z.infer<typeof CaseNodeSchema>;\n\nexport const EntriesOfNodeSchema = z\n .object({ $entriesOf: z.lazy(node).describe('Object to convert to [key, value][] entries.') })\n .strict()\n .describe('Convert an object to an array of [key, value] pairs.');\nexport type EntriesOfNode = z.infer<typeof EntriesOfNodeSchema>;\n\nexport const KeyByNodeSchema = z\n .object({\n $keyBy: z\n .object({\n over: z.lazy(node).describe('Array to group.'),\n as: z.string().min(1).describe('Variable name for the current element.'),\n key: z.lazy(node).describe('Expression to compute the key (last wins on collision).'),\n })\n .strict(),\n })\n .strict()\n .describe('Convert an array to an object keyed by a computed value. Last element wins on key collision.');\nexport type KeyByNode = z.infer<typeof KeyByNodeSchema>;\n\nexport const GroupByNodeSchema = z\n .object({\n $groupBy: z\n .object({\n over: z.lazy(node).describe('Array to group.'),\n as: z.string().min(1).describe('Variable name for the current element.'),\n key: z.lazy(node).describe('Expression to compute the group key.'),\n })\n .strict(),\n })\n .strict()\n .describe('Group array elements into an object of arrays by computed key.');\nexport type GroupByNode = z.infer<typeof GroupByNodeSchema>;\n","import { z } from 'zod';\n\nlet _NodeSchema: z.ZodTypeAny = z.any();\nexport const setNodeSchema = (schema: z.ZodTypeAny): void => {\n _NodeSchema = schema;\n};\nconst node = (): z.ZodTypeAny => _NodeSchema;\n\nexport const KeysNodeSchema = z\n .object({ $keys: z.lazy(node).describe('Object to extract keys from.') })\n .strict()\n .describe('Return the keys of an object as a string array.');\nexport type KeysNode = z.infer<typeof KeysNodeSchema>;\n\nexport const ValuesNodeSchema = z\n .object({ $values: z.lazy(node).describe('Object to extract values from.') })\n .strict()\n .describe('Return the values of an object as an array.');\nexport type ValuesNode = z.infer<typeof ValuesNodeSchema>;\n\nexport const FromEntriesNodeSchema = z\n .object({\n $fromEntries: z\n .lazy(node)\n .describe('Array of [key, value] pairs to convert to an object.'),\n })\n .strict()\n .describe('Convert [key, value][] entries into an object.');\nexport type FromEntriesNode = z.infer<typeof FromEntriesNodeSchema>;\n\nexport const PickNodeSchema = z\n .object({\n $pick: z\n .object({\n from: z.lazy(node).describe('Source object.'),\n keys: z.array(z.string()).min(1).describe('Keys to keep.'),\n })\n .strict(),\n })\n .strict()\n .describe('Pick specific keys from an object, discarding the rest.');\nexport type PickNode = z.infer<typeof PickNodeSchema>;\n\nexport const OmitNodeSchema = z\n .object({\n $omit: z\n .object({\n from: z.lazy(node).describe('Source object.'),\n keys: z.array(z.string()).min(1).describe('Keys to remove.'),\n })\n .strict(),\n })\n .strict()\n .describe('Remove specific keys from an object, keeping the rest.');\nexport type OmitNode = z.infer<typeof OmitNodeSchema>;\n\nexport const TypeNodeSchema = z\n .object({ $type: z.lazy(node).describe('Value to get the type of.') })\n .strict()\n .describe('Returns the type as a string: \"string\", \"number\", \"boolean\", \"null\", \"array\", or \"object\".');\nexport type TypeNode = z.infer<typeof TypeNodeSchema>;\n\nexport const LengthNodeSchema = z\n .object({ $length: z.lazy(node).describe('Array or string to measure.') })\n .strict()\n .describe('Return the length of an array or string.');\nexport type LengthNode = z.infer<typeof LengthNodeSchema>;\n","import { z } from 'zod';\n\nlet _NodeSchema: z.ZodTypeAny = z.any();\nexport const setNodeSchema = (schema: z.ZodTypeAny): void => {\n _NodeSchema = schema;\n};\nconst node = (): z.ZodTypeAny => _NodeSchema;\n\nconst TimeUnit = z\n .enum(['year', 'month', 'day', 'hour', 'minute', 'second'])\n .describe('Time unit for date arithmetic.');\n\nexport const DateNodeSchema = z\n .object({\n $date: z\n .object({\n value: z.lazy(node).describe('Date value (ISO string or timestamp).'),\n format: z.string().optional().describe('Output format string (dayjs format). Default: ISO 8601.'),\n utc: z.boolean().optional().default(false).describe('Format in UTC. Default: false.'),\n })\n .strict(),\n })\n .strict()\n .describe('Format a date value.');\nexport type DateNode = z.infer<typeof DateNodeSchema>;\n\nexport const DateAddNodeSchema = z\n .object({\n $dateAdd: z\n .object({\n date: z.lazy(node).describe('Base date (ISO string or timestamp).'),\n amount: z.number().describe('Amount to add (can be negative).'),\n unit: TimeUnit,\n })\n .strict(),\n })\n .strict()\n .describe('Add a duration to a date. Returns ISO string.');\nexport type DateAddNode = z.infer<typeof DateAddNodeSchema>;\n\nexport const DateDiffNodeSchema = z\n .object({\n $dateDiff: z\n .object({\n from: z.lazy(node).describe('Start date.'),\n to: z.lazy(node).describe('End date.'),\n unit: TimeUnit,\n })\n .strict(),\n })\n .strict()\n .describe('Calculate difference between two dates. Returns a number.');\nexport type DateDiffNode = z.infer<typeof DateDiffNodeSchema>;\n","import { z } from 'zod';\n\nlet _NodeSchema: z.ZodTypeAny = z.any();\nexport const setNodeSchema = (schema: z.ZodTypeAny): void => {\n _NodeSchema = schema;\n};\nconst node = (): z.ZodTypeAny => _NodeSchema;\n\nconst localeField = z\n .lazy(node)\n .describe('BCP-47 locale tag (\"de-AT\", \"en-GB\"). Required — a default renders plausible nonsense for everybody it is wrong for.');\n\nconst fallbackField = z\n .lazy(node)\n .optional()\n .describe('Rendered when the value is null/undefined/empty. Default: \"\".');\n\nconst DateStyle = z.enum(['full', 'long', 'medium', 'short']);\n\nexport const IntlDateOptionsSchema = z\n .object({\n dateStyle: DateStyle.optional().describe('Whole-date preset. Mutually exclusive with the field-by-field options below.'),\n timeStyle: DateStyle.optional().describe('Whole-time preset. Mutually exclusive with the field-by-field options below.'),\n weekday: z.enum(['long', 'short', 'narrow']).optional(),\n year: z.enum(['numeric', '2-digit']).optional(),\n month: z.enum(['numeric', '2-digit', 'long', 'short', 'narrow']).optional(),\n day: z.enum(['numeric', '2-digit']).optional(),\n hour: z.enum(['numeric', '2-digit']).optional(),\n minute: z.enum(['numeric', '2-digit']).optional(),\n second: z.enum(['numeric', '2-digit']).optional(),\n hour12: z.boolean().optional().describe('Force 12/24-hour. Omit to take the locale\\'s own convention — which is the point of asking for a locale.'),\n timeZone: z\n .string()\n .optional()\n .describe('IANA zone. Omit and a DATE-only value (\"2026-03-14\") is read as UTC, which is what stops it rendering as the 13th west of Greenwich.'),\n })\n .strict();\n\nexport type IntlDateOptions = z.infer<typeof IntlDateOptionsSchema>;\n\nexport const LocaleDateNodeSchema = z\n .object({\n $localeDate: z\n .object({\n value: z.lazy(node).describe('ISO string, DATE-only string, or epoch milliseconds.'),\n locale: localeField,\n options: IntlDateOptionsSchema.optional().describe('Defaults to { dateStyle: \"medium\" }.'),\n fallback: fallbackField,\n })\n .strict(),\n })\n .strict()\n .describe('Format a date for a human reading in a given locale (Intl.DateTimeFormat).');\nexport type LocaleDateNode = z.infer<typeof LocaleDateNodeSchema>;\n\nexport const LocaleMoneyNodeSchema = z\n .object({\n $localeMoney: z\n .object({\n value: z.lazy(node).describe('The amount. Minor units (cents) unless `minorUnits` is false.'),\n currency: z.lazy(node).describe('ISO-4217 code — \"EUR\", \"CHF\". Required: an amount without one is a number, not money.'),\n locale: localeField,\n minorUnits: z\n .boolean()\n .optional()\n .describe(\n 'Value is in the currency\\'s minor unit. Default true. The divisor comes from the CURRENCY, not a hardcoded 100 — JPY has no minor unit and dividing it would be a hundredfold error.',\n ),\n digits: z.number().int().min(0).max(20).optional().describe('Fraction digits. Default: the currency\\'s own (2 for EUR, 0 for JPY).'),\n fallback: fallbackField,\n })\n .strict(),\n })\n .strict()\n .describe('Format an amount as money in a given locale (Intl.NumberFormat, style currency).');\nexport type LocaleMoneyNode = z.infer<typeof LocaleMoneyNodeSchema>;\n\nexport const LocaleNumberNodeSchema = z\n .object({\n $localeNumber: z\n .object({\n value: z.lazy(node).describe('The number to format.'),\n locale: localeField,\n style: z.enum(['decimal', 'percent']).optional().describe('Default \"decimal\". \"percent\" multiplies by 100 — pass 0.42, not 42.'),\n digits: z.number().int().min(0).max(20).optional().describe('Maximum fraction digits. Default: the locale\\'s own.'),\n minDigits: z.number().int().min(0).max(20).optional().describe('Minimum fraction digits — for a column that should not ragged-edge.'),\n compact: z.boolean().optional().describe('Short form — \"1.2K\", \"1,2 Tsd.\". For a headline figure, never for money owed.'),\n fallback: fallbackField,\n })\n .strict(),\n })\n .strict()\n .describe('Format a number in a given locale (Intl.NumberFormat).');\nexport type LocaleNumberNode = z.infer<typeof LocaleNumberNodeSchema>;\n","import { z } from 'zod';\n\nlet _NodeSchema: z.ZodTypeAny = z.any();\nexport const setNodeSchema = (schema: z.ZodTypeAny): void => {\n _NodeSchema = schema;\n};\nconst node = (): z.ZodTypeAny => _NodeSchema;\n\nconst overOnly = (desc: string) =>\n z.object({ over: z.lazy(node).describe(desc) }).strict();\n\nexport const SumNodeSchema = z\n .object({ $sum: overOnly('Array of numbers to sum.') })\n .strict()\n .describe('Sugar: sum all elements in an array. Desugars to $reduce + $add.');\nexport type SumNode = z.infer<typeof SumNodeSchema>;\n\nexport const AvgNodeSchema = z\n .object({ $avg: overOnly('Array of numbers to average.') })\n .strict()\n .describe('Sugar: average all elements in an array. Desugars to $div($sum, $count).');\nexport type AvgNode = z.infer<typeof AvgNodeSchema>;\n\nexport const CountNodeSchema = z\n .object({ $count: overOnly('Array to count elements of.') })\n .strict()\n .describe('Sugar: count elements in an array. Desugars to $reduce.');\nexport type CountNode = z.infer<typeof CountNodeSchema>;\n\nexport const MinNodeSchema = z\n .object({ $min: overOnly('Array of numbers to find minimum.') })\n .strict()\n .describe('Sugar: find minimum value in an array. Desugars to $reduce + $lt.');\nexport type MinNode = z.infer<typeof MinNodeSchema>;\n\nexport const MaxNodeSchema = z\n .object({ $max: overOnly('Array of numbers to find maximum.') })\n .strict()\n .describe('Sugar: find maximum value in an array. Desugars to $reduce + $gt.');\nexport type MaxNode = z.infer<typeof MaxNodeSchema>;\n\nexport const PluckNodeSchema = z\n .object({\n $pluck: z\n .object({\n over: z.lazy(node).describe('Array of objects to extract from.'),\n key: z.string().min(1).describe('Key to extract from each object.'),\n })\n .strict(),\n })\n .strict()\n .describe('Sugar: extract a single field from each element. Desugars to $map + $get.');\nexport type PluckNode = z.infer<typeof PluckNodeSchema>;\n\nexport const TakeNodeSchema = z\n .object({\n $take: z\n .object({\n from: z.lazy(node).describe('Array to take from.'),\n count: z.number().int().nonnegative().describe('Number of elements to take from the start.'),\n })\n .strict(),\n })\n .strict()\n .describe('Sugar: take first N elements. Desugars to $slice.');\nexport type TakeNode = z.infer<typeof TakeNodeSchema>;\n\nexport const DropNodeSchema = z\n .object({\n $drop: z\n .object({\n from: z.lazy(node).describe('Array to drop from.'),\n count: z.number().int().nonnegative().describe('Number of elements to skip from the start.'),\n })\n .strict(),\n })\n .strict()\n .describe('Sugar: skip first N elements. Desugars to $slice.');\nexport type DropNode = z.infer<typeof DropNodeSchema>;\n\nexport const MatchNodeSchema = z\n .object({\n $match: z\n .object({\n over: z.lazy(node).describe('Array to search within.'),\n as: z.string().min(1).describe('Variable name for the current element.'),\n search: z.lazy(node).describe('String to search for (uses $contains).'),\n })\n .strict(),\n })\n .strict()\n .describe('Sugar: filter array by string containment. Desugars to $filter + $contains.');\nexport type MatchNode = z.infer<typeof MatchNodeSchema>;\n\nexport const FlatMapNodeSchema = z\n .object({\n $flatMap: z\n .object({\n over: z.lazy(node).describe('Array to flat-map over.'),\n as: z.string().min(1).describe('Variable name for the current element.'),\n body: z.lazy(node).describe('Expression that returns an array for each element.'),\n })\n .strict(),\n })\n .strict()\n .describe('Sugar: map then flatten one level. Desugars to $map + $flatten.');\nexport type FlatMapNode = z.infer<typeof FlatMapNodeSchema>;\n","import { z } from 'zod';\n\nlet _NodeSchema: z.ZodTypeAny = z.any();\nexport const setNodeSchema = (schema: z.ZodTypeAny): void => {\n _NodeSchema = schema;\n};\nconst node = (): z.ZodTypeAny => _NodeSchema;\n\nconst PathSchema = z\n .array(z.union([z.string(), z.number().int().nonnegative()]))\n .min(1)\n .describe('Literal path segments: object keys (strings) and array indexes (numbers).');\n\nexport const HasNodeSchema = z\n .object({\n $has: z\n .object({\n from: z.lazy(node).describe('The value to look into.'),\n path: PathSchema,\n })\n .strict(),\n })\n .strict()\n .describe('True when the whole path exists — a key present with a null value counts; a missing one does not.');\nexport type HasNode = z.infer<typeof HasNodeSchema>;\n\nexport const RenameKeysNodeSchema = z\n .object({\n $renameKeys: z\n .object({\n from: z.lazy(node).describe('The object whose keys to rename.'),\n map: z.record(z.string(), z.string()).describe('Old key → new key. Keys not listed, and listed keys that are absent, are left alone.'),\n })\n .strict(),\n })\n .strict()\n .describe(\n 'The object with keys renamed IN PLACE — each renamed key keeps its position. If a new name is already a key of the object, that ' +\n 'entry is replaced by the renamed one.',\n );\nexport type RenameKeysNode = z.infer<typeof RenameKeysNodeSchema>;\n\nexport const UpdateNodeSchema = z\n .object({\n $update: z\n .object({\n from: z.lazy(node).describe('The value to copy with one path changed.'),\n path: PathSchema,\n value: z\n .lazy(node)\n .describe('The new value at `path`. The value currently there (null when absent) is bound as `$var` `as`.'),\n as: z.string().min(1).optional().describe('The variable name the current value is bound to (default \"current\").'),\n })\n .strict(),\n })\n .strict()\n .describe(\n 'A copy of `from` with the value at `path` replaced and everything else identical. Missing objects along a string path are created; ' +\n 'an index that does not exist is an error.',\n );\nexport type UpdateNode = z.infer<typeof UpdateNodeSchema>;\n\nexport const AssertNodeSchema = z\n .object({\n $assert: z\n .object({\n when: z.lazy(node).describe('Must be truthy.'),\n message: z.string().min(1).describe('What went wrong, for a person — the whole error text.'),\n value: z.lazy(node).describe('Returned when `when` holds.'),\n })\n .strict(),\n })\n .strict()\n .describe('Fail with `message` (E_ASSERT) unless `when` is truthy; otherwise evaluate to `value`. How a migration refuses a shape it cannot handle.');\nexport type AssertNode = z.infer<typeof AssertNodeSchema>;\n\nexport const WalkNodeSchema = z\n .object({\n $walk: z\n .object({\n over: z.lazy(node).describe('The tree to rewrite — any JSON value.'),\n as: z.string().min(1).describe('The variable each visited node is bound to.'),\n rules: z\n .array(\n z\n .object({\n when: z.lazy(node).describe('Evaluated with the node bound to `as`; the first truthy rule wins.'),\n then: z.lazy(node).describe('The node\\'s replacement.'),\n })\n .strict(),\n )\n .min(1)\n .describe('Tried in order at every node. No rule matches: the node is kept.'),\n order: z\n .enum(['post', 'pre'])\n .optional()\n .describe(\n 'post (default): a node\\'s children are rewritten first, and its rules see the rewritten children. pre: rules see the node as ' +\n 'it was, then the walk descends into whatever they returned.',\n ),\n })\n .strict(),\n })\n .strict()\n .describe(\n 'Rewrite every node of a tree — objects, arrays and leaves, at any depth — by rules. Structural: it always terminates, and a ' +\n 'replacement is never walked again at its own level.',\n );\nexport type WalkNode = z.infer<typeof WalkNodeSchema>;\n","import { z } from 'zod';\n\nimport { JsonPrimitiveSchema } from './json.schema';\n\nimport {\n RefNodeSchema, ConstNodeSchema, VarNodeSchema, GetNodeSchema, WithNodeSchema,\n setNodeSchema as setCoreNode,\n} from './ops/core.schema';\nimport {\n MapNodeSchema, FilterNodeSchema, ReduceNodeSchema, SliceNodeSchema,\n FlattenNodeSchema, UniqueNodeSchema, SortByNodeSchema,\n setNodeSchema as setArrayNode,\n} from './ops/array.schema';\nimport {\n AddNodeSchema, SubNodeSchema, MulNodeSchema, DivNodeSchema, ModNodeSchema, RoundNodeSchema, ToNumberNodeSchema,\n setNodeSchema as setMathNode,\n} from './ops/math.schema';\nimport {\n FillNodeSchema, JoinNodeSchema, ToStringNodeSchema, InterpolateNodeSchema, TrimNodeSchema,\n LowerNodeSchema, UpperNodeSchema, SplitNodeSchema, ReplaceNodeSchema,\n setNodeSchema as setStringNode,\n} from './ops/string.schema';\nimport {\n EqNodeSchema, NeqNodeSchema, GtNodeSchema, GteNodeSchema,\n LtNodeSchema, LteNodeSchema, EmptyNodeSchema,\n StartsWithNodeSchema, EndsWithNodeSchema, ContainsNodeSchema,\n setNodeSchema as setPredicateNode,\n} from './ops/predicate.schema';\nimport {\n NotNodeSchema, AndNodeSchema, OrNodeSchema,\n setNodeSchema as setLogicNode,\n} from './ops/logic.schema';\nimport {\n MergeNodeSchema, CoalesceNodeSchema, CaseNodeSchema, EntriesOfNodeSchema,\n KeyByNodeSchema, GroupByNodeSchema,\n setNodeSchema as setStructureNode,\n} from './ops/structure.schema';\nimport {\n KeysNodeSchema, ValuesNodeSchema, FromEntriesNodeSchema,\n PickNodeSchema, OmitNodeSchema, TypeNodeSchema, LengthNodeSchema,\n setNodeSchema as setObjectNode,\n} from './ops/object.schema';\nimport {\n DateNodeSchema, DateAddNodeSchema, DateDiffNodeSchema,\n setNodeSchema as setTimeNode,\n} from './ops/time.schema';\nimport {\n LocaleDateNodeSchema, LocaleMoneyNodeSchema, LocaleNumberNodeSchema,\n setNodeSchema as setIntlNode,\n} from './ops/intl.schema';\nimport {\n SumNodeSchema, AvgNodeSchema, CountNodeSchema, MinNodeSchema, MaxNodeSchema,\n PluckNodeSchema, TakeNodeSchema, DropNodeSchema, MatchNodeSchema, FlatMapNodeSchema,\n setNodeSchema as setSugarNode,\n} from './ops/sugar.schema';\nimport {\n HasNodeSchema, RenameKeysNodeSchema, UpdateNodeSchema, AssertNodeSchema, WalkNodeSchema,\n setNodeSchema as setTransformNode,\n} from './ops/transform.schema';\n\nexport const OP_KEYS = [\n '$ref', '$const', '$var', '$get', '$with',\n '$map', '$filter', '$reduce', '$slice', '$flatten', '$unique', '$sortBy',\n '$add', '$sub', '$mul', '$div', '$mod', '$round', '$toNumber',\n '$fill', '$join', '$toString', '$interpolate', '$trim', '$lower', '$upper', '$split', '$replace',\n '$eq', '$neq', '$gt', '$gte', '$lt', '$lte', '$empty', '$startsWith', '$endsWith', '$contains',\n '$not', '$and', '$or',\n '$merge', '$coalesce', '$case', '$entriesOf', '$keyBy', '$groupBy',\n '$keys', '$values', '$fromEntries', '$pick', '$omit', '$type', '$length',\n '$date', '$dateAdd', '$dateDiff',\n '$localeDate', '$localeMoney', '$localeNumber',\n '$sum', '$avg', '$count', '$min', '$max',\n '$pluck', '$take', '$drop', '$match', '$flatMap',\n '$has', '$renameKeys', '$update', '$assert', '$walk',\n] as const;\n\nexport const OPTIONAL_FIELDS_KEY = '__optional';\n\n// Every `$` key is refused, not only the names of ops that exist: the\n// evaluator's `isPlainObject` reads a template the same way, and a new op never\n// takes a key a stored template was using.\nconst TEMPLATE_KEY = /^(?!\\$)/;\n\nconst isOpKey = (key: unknown): boolean => OP_KEYS.some((op) => op === key);\n\nconst templateKeyRefusal = (key: unknown): string =>\n isOpKey(key)\n ? 'An op name cannot be a plain object key. Use the op itself.'\n : 'Not a Prism op. A key that starts with \"$\" names an op; data with such a key goes in $const.';\n\nconst hasValidOptionalMeta = (obj: Record<string, unknown>): boolean => {\n const meta = obj[OPTIONAL_FIELDS_KEY];\n if (meta === undefined) return true;\n if (!Array.isArray(meta)) return false;\n return meta.every((f) => typeof f === 'string' && f.length > 0);\n};\n\nconst NodeArraySchema = z.array(z.lazy(() => NodeSchema));\n\n// The `$` rule is in the key schema, not a refinement: a refinement leaves this\n// branch structurally matched, and zod then reports its complaint instead of\n// the union's. A key pattern is also plain JSON Schema (`propertyNames`), which\n// the grammar snapshot and agent prompts read.\nconst TemplateSchema = z\n .record(z.string().regex(TEMPLATE_KEY, { error: (issue) => templateKeyRefusal(issue.input) }), z.lazy(() => NodeSchema))\n .refine((o) => hasValidOptionalMeta(o), { message: '__optional must be an array of non-empty field name strings.' });\n\n// zod tries a union's members in order and builds every failure's issues on\n// the way, so the one member a value can be, by its keys, is tried first. Two\n// passes, never a fallback at each node: that would walk a failing subtree\n// twice at every level above it. zod's discriminated union does not fit: it\n// dispatches on one key's value, and ops differ by which key is there.\ntype Member = z.core.$ZodType;\n\nconst opMembersOf = (options: readonly Member[]): Map<string, Member> => {\n const members = new Map<string, Member>();\n for (const option of options) {\n const { def } = option._zod;\n const keys = 'shape' in def && typeof def.shape === 'object' && def.shape !== null ? Object.keys(def.shape) : [];\n const [key] = keys;\n if (keys.length === 1 && key !== undefined && isOpKey(key)) members.set(key, option);\n }\n return members;\n};\n\nconst memberOf = (value: unknown, ops: Map<string, Member>): Member | undefined => {\n if (value === null || typeof value !== 'object') return JsonPrimitiveSchema;\n if (Array.isArray(value)) return NodeArraySchema;\n const proto: unknown = Object.getPrototypeOf(value);\n if (proto !== Object.prototype && proto !== null) return undefined;\n let op: string | undefined;\n let count = 0;\n for (const key in value) {\n count += 1;\n if (key.startsWith('$')) op = key;\n }\n if (op === undefined) return TemplateSchema;\n return count === 1 ? ops.get(op) : undefined;\n};\n\nconst quick = new WeakSet<object>();\nconst walking = new WeakSet<object>();\n\nconst NodeUnion = z.core.$constructor<z.ZodUnion>('PrismNodeUnion', (inst, def) => {\n z.ZodUnion.init(inst, def);\n const ops = opMembersOf(def.options);\n const walk = inst._zod.parse;\n inst._zod.parse = (payload, ctx) => {\n if (ctx.async !== false || walking.has(ctx)) return walk(payload, ctx);\n const member = memberOf(payload.value, ops);\n // Inside a quick pass: a failure is only a no, the walk will say why.\n if (quick.has(ctx)) {\n if (member !== undefined) return member._zod.run(payload, ctx);\n payload.issues.push({ code: 'custom', input: payload.value, inst });\n return payload;\n }\n if (member !== undefined) {\n // A context of its own: zod keeps what a parse has answered on the\n // context, and the walk must not be handed the quick pass's answers.\n const own = { async: false as const, ...(ctx.jitless === undefined ? {} : { jitless: ctx.jitless }) };\n quick.add(own);\n const tried = member._zod.run({ value: payload.value, issues: [] }, own);\n if (!(tried instanceof Promise) && tried.issues.length === 0) return tried;\n }\n walking.add(ctx);\n try {\n return walk(payload, ctx);\n } finally {\n walking.delete(ctx);\n }\n };\n});\n\nexport const NodeSchema: z.ZodType<unknown> = z.lazy(\n (): z.ZodTypeAny =>\n new NodeUnion({ type: 'union', options: [\n RefNodeSchema, ConstNodeSchema, VarNodeSchema, GetNodeSchema, WithNodeSchema,\n MapNodeSchema, FilterNodeSchema, ReduceNodeSchema, SliceNodeSchema,\n FlattenNodeSchema, UniqueNodeSchema, SortByNodeSchema,\n AddNodeSchema, SubNodeSchema, MulNodeSchema, DivNodeSchema, ModNodeSchema, RoundNodeSchema, ToNumberNodeSchema,\n FillNodeSchema, JoinNodeSchema, ToStringNodeSchema, InterpolateNodeSchema, TrimNodeSchema,\n LowerNodeSchema, UpperNodeSchema, SplitNodeSchema, ReplaceNodeSchema,\n EqNodeSchema, NeqNodeSchema, GtNodeSchema, GteNodeSchema,\n LtNodeSchema, LteNodeSchema, EmptyNodeSchema,\n StartsWithNodeSchema, EndsWithNodeSchema, ContainsNodeSchema,\n NotNodeSchema, AndNodeSchema, OrNodeSchema,\n MergeNodeSchema, CoalesceNodeSchema, CaseNodeSchema, EntriesOfNodeSchema,\n KeyByNodeSchema, GroupByNodeSchema,\n KeysNodeSchema, ValuesNodeSchema, FromEntriesNodeSchema,\n PickNodeSchema, OmitNodeSchema, TypeNodeSchema, LengthNodeSchema,\n DateNodeSchema, DateAddNodeSchema, DateDiffNodeSchema,\n LocaleDateNodeSchema, LocaleMoneyNodeSchema, LocaleNumberNodeSchema,\n SumNodeSchema, AvgNodeSchema, CountNodeSchema, MinNodeSchema, MaxNodeSchema,\n PluckNodeSchema, TakeNodeSchema, DropNodeSchema, MatchNodeSchema, FlatMapNodeSchema,\n HasNodeSchema, RenameKeysNodeSchema, UpdateNodeSchema, AssertNodeSchema, WalkNodeSchema,\n JsonPrimitiveSchema,\n NodeArraySchema,\n TemplateSchema,\n ] }).describe('A Prism node: an op, a plain JSON value, an array of nodes, or a plain object template.'),\n);\n\nsetCoreNode(NodeSchema);\nsetArrayNode(NodeSchema);\nsetMathNode(NodeSchema);\nsetStringNode(NodeSchema);\nsetPredicateNode(NodeSchema);\nsetLogicNode(NodeSchema);\nsetStructureNode(NodeSchema);\nsetObjectNode(NodeSchema);\nsetTimeNode(NodeSchema);\nsetIntlNode(NodeSchema);\nsetSugarNode(NodeSchema);\nsetTransformNode(NodeSchema);\n","import { z } from 'zod';\n\nimport { NodeSchema } from './node.schema';\n\nexport const ConfigSchema = NodeSchema.describe(\n 'A Prism config: the top-level transformation definition. Can be any valid node.',\n);\n\nexport type Config = z.infer<typeof ConfigSchema>;\n"]}
|
|
@@ -1,4 +1,4 @@
|
|
|
1
|
-
import { NodeSchema, ConfigSchema } from './chunk-
|
|
1
|
+
import { NodeSchema, ConfigSchema } from './chunk-WKS4OCKN.js';
|
|
2
2
|
import { z } from 'zod';
|
|
3
3
|
|
|
4
4
|
var getNodeJsonSchema = (target = "draft-2020-12") => z.toJSONSchema(NodeSchema, { target });
|
|
@@ -75,13 +75,11 @@ var narrowConfigJsonSchema = (full, ops) => {
|
|
|
75
75
|
|
|
76
76
|
// src/schemas/profiles.ts
|
|
77
77
|
var MAPPING_OPS = [
|
|
78
|
-
// reading the source
|
|
79
78
|
"$ref",
|
|
80
79
|
"$const",
|
|
81
80
|
"$var",
|
|
82
81
|
"$get",
|
|
83
82
|
"$with",
|
|
84
|
-
// arrays
|
|
85
83
|
"$map",
|
|
86
84
|
"$filter",
|
|
87
85
|
"$reduce",
|
|
@@ -90,7 +88,6 @@ var MAPPING_OPS = [
|
|
|
90
88
|
"$sortBy",
|
|
91
89
|
"$take",
|
|
92
90
|
"$pluck",
|
|
93
|
-
// numbers and aggregates
|
|
94
91
|
"$add",
|
|
95
92
|
"$sub",
|
|
96
93
|
"$mul",
|
|
@@ -103,7 +100,6 @@ var MAPPING_OPS = [
|
|
|
103
100
|
"$count",
|
|
104
101
|
"$min",
|
|
105
102
|
"$max",
|
|
106
|
-
// strings
|
|
107
103
|
"$join",
|
|
108
104
|
"$toString",
|
|
109
105
|
"$interpolate",
|
|
@@ -111,7 +107,6 @@ var MAPPING_OPS = [
|
|
|
111
107
|
"$lower",
|
|
112
108
|
"$upper",
|
|
113
109
|
"$split",
|
|
114
|
-
// conditions
|
|
115
110
|
"$eq",
|
|
116
111
|
"$neq",
|
|
117
112
|
"$gt",
|
|
@@ -123,7 +118,6 @@ var MAPPING_OPS = [
|
|
|
123
118
|
"$not",
|
|
124
119
|
"$and",
|
|
125
120
|
"$or",
|
|
126
|
-
// structure
|
|
127
121
|
"$merge",
|
|
128
122
|
"$coalesce",
|
|
129
123
|
"$case",
|
|
@@ -131,7 +125,6 @@ var MAPPING_OPS = [
|
|
|
131
125
|
"$pick",
|
|
132
126
|
"$omit",
|
|
133
127
|
"$length",
|
|
134
|
-
// dates and locale formatting
|
|
135
128
|
"$date",
|
|
136
129
|
"$dateDiff",
|
|
137
130
|
"$localeDate",
|
|
@@ -140,5 +133,5 @@ var MAPPING_OPS = [
|
|
|
140
133
|
];
|
|
141
134
|
|
|
142
135
|
export { MAPPING_OPS, getConfigJsonSchema, getNodeJsonSchema, getProfileJsonSchema };
|
|
143
|
-
//# sourceMappingURL=chunk-
|
|
144
|
-
//# sourceMappingURL=chunk-
|
|
136
|
+
//# sourceMappingURL=chunk-GK4CIKKT.js.map
|
|
137
|
+
//# sourceMappingURL=chunk-GK4CIKKT.js.map
|