@inixiative/json-rules 1.3.4 → 2.0.3

package/README.md

@@ -451,6 +451,21 @@ Useful exports:
 - `ArrayRule`
 - `DateRule`
 
+Lens & bridges:
+
+- `Lens`, `LensNarrowing`, `MapNarrowing`, `ModelNarrowing`
+- `FieldMapSet`, `Bridge`, `BridgeEndpoint`, `BridgeCardinality`
+- `createLens`, `stitchFieldMaps`, `validateFieldMap`, `validateFieldMapSet`
+- `validateNarrowing`, `projectNarrowing`, `checkRuleAgainstLens`, `applyLens`
+- `buildBridgeDictionary`
+
+Operator catalog (builder-facing):
+
+- `FIELD_OPERATOR_CATALOG`, `DATE_OPERATOR_CATALOG`, `ARRAY_OPERATOR_CATALOG`
+- `FieldKind`, `RuleTarget`, `ValueShape`
+- `NUMERIC_KINDS`, `ORDERABLE_KINDS`, `STRINGY_KINDS`, `EQUATABLE_KINDS`, `ALL_KINDS`
+- `getOperatorsForKind`, `getArrayOperators`, `getValueShape`, `isOperatorSupportedForTarget`
+
 ## Error Handling
 
 The library throws when a rule is structurally invalid, for example:
@@ -475,6 +490,159 @@ if (!result.ok) {
 assertValidRule(rule, { target: 'toPrisma' });
 ```
 
+## Root-Array Rules in `check()`
+
+When `data` is an array, the rule must be a tree of `all` / `any` whose leaves are **fieldless** `ArrayRule`s (no `field`, `arrayOperator` operates on the array itself).
+
+```ts
+const users = [
+  { industry: 'tech', status: 'active' },
+  { industry: 'finance', status: 'active' },
+  { industry: 'tech', status: 'inactive' },
+];
+
+// "Is there any tech user AND are at least 2 active?"
+check(
+  {
+    all: [
+      { arrayOperator: ArrayOperator.any, condition: { field: 'industry', operator: Operator.equals, value: 'tech' } },
+      { arrayOperator: ArrayOperator.atLeast, count: 2, condition: { field: 'status', operator: Operator.equals, value: 'active' } },
+    ],
+  },
+  users,
+);
+```
+
+`check()` throws if `data` is an array but the rule contains any field-based leaf, or if the rule is a fieldless `ArrayRule` and `data` is not an array. Root-array compilation to Prisma/SQL is not yet implemented — these are `check()`-only.
+
+## Lens & Multi-Source Data
+
+The `Lens` primitive is a schema-aware view layer over one or more `FieldMap`s. It enables rule authoring against multi-source data (e.g. Prisma + an external CRM), with declarative cross-source `Bridge`s and recursive `Narrowing`s for picks/omits/constraints.
+
+### FieldMapSet & Bridges
+
+A `FieldMapSet` groups one or more `FieldMap`s and declares the cross-source edges between them:
+
+```ts
+import { stitchFieldMaps } from '@inixiative/json-rules';
+
+const set = stitchFieldMaps({
+  maps: { prisma: prismaMap, salesforce: salesforceMap },
+  bridges: [
+    {
+      endpoints: [
+        { fieldMap: 'salesforce', model: 'Contact', on: 'id' },
+        { fieldMap: 'prisma',     model: 'FanUser', on: 'crmId' },
+      ],
+      cardinality: 'oneToMany',
+    },
+  ],
+});
+```
+
+`stitchFieldMaps()` injects bridge entries as `kind: 'bridge'` fields on each endpoint model — addressable in rules via `<fieldMap>:<Model>` notation (e.g. `salesforce:Contact.industry`). Each endpoint's `on` is the symmetric join field used at eval time for hydration. Bridge cardinality controls list-vs-single on each side.
+
+### Lens
+
+```ts
+// Lens extends FieldMapSet — maps and bridges live at the top level.
+// Use `createLens` (it stitches bridges internally) instead of constructing by hand.
+import { createLens } from '@inixiative/json-rules';
+
+const lens = createLens({
+  maps: { prisma: prismaMap, salesforce: salesforceMap },
+  bridges,
+  mapName: 'prisma',         // which map in `maps` holds the anchor model
+  model: 'FanUser',          // anchor model
+});
+```
+
+The lens is **schema only** — no data lives on it. Runtime data (rows, foreign tables, FE picker sources) is passed alongside, separately, when you need it.
+
+### LensNarrowing & `constrains`
+
+`LensNarrowing` is a recursive tree that narrows a parent `Lens` (or another `LensNarrowing`). Each narrowing can add picks/omits per model + a lens-level constraint:
+
+```ts
+const narrowing: LensNarrowing = {
+  parent: lens,
+  maps: {
+    prisma: {
+      models: {
+        FanUser: { picks: ['email', 'firstName', 'crmId'] },
+      },
+    },
+  },
+  constrains: { field: 'deletedAt', operator: Operator.isEmpty },
+};
+```
+
+Children can only narrow further — chain rules enforce `picks ⊆ ancestor picks`, no re-picking an ancestor-omitted field. Constraints AND into any rule evaluated against the lens.
+
+### Lens Utilities
+
+| Function | Purpose |
+| --- | --- |
+| `validateNarrowing(narrowing)` | Throws on structural or chain violations (incl. unresolvable constraint paths). Call this before `projectNarrowing`. |
+| `projectNarrowing(lens)` | Returns the effective `FieldMapSet` after applying every narrowing in the chain. Assumes `validateNarrowing` has passed — silently ignores unknown picks/omits otherwise. |
+| `checkRuleAgainstLens(rule, lens)` | Validates a user rule's field paths against the projected surface; returns `{ ok, violations }` |
+| `applyLens(rule, narrowing)` | Returns `{ all: [...chainConstraints, rule] }`; identity if no constraints |
+
+### Evaluating Across Bridges
+
+`path:` refs (used for value comparisons) walk via the same dotted-path mechanism as `field:`. Bridge keys (`'salesforce:Contact'`) are just plain object properties, so `path: 'salesforce:Contact.industry'` works in both `field:` (left side) and `path:` (right side) positions.
+
+**Limitations to know:**
+
+- **1-many bridge arrays are not iterable mid-path.** `field: 'crm:MarketingEvent.campaign'` or `path: 'crm:MarketingEvent.campaign'` returns `undefined` when the bridge value is an array — `lodash.get` can't fan out across array elements. Use a numeric index (`crm:MarketingEvent.0.campaign`) or `arrayOperator` on the `field:` side to iterate.
+- **Bridge keys are plain object properties.** The engine doesn't consult `lens.bridges` at eval time — callers structure `data` correctly using the schema as a guide. Use `buildBridgeDictionary(lens, rawForeign)` to pre-index foreign rows by `on` field, then embed under bridge keys per anchor row.
+
+
+`check()` itself is bridge-unaware — it walks paths via plain property access. The lens primitive is **schema metadata** (what fields exist, what bridges link them, what `on` fields join each side). The caller is responsible for structuring `data` accordingly:
+
+```ts
+const fanUser = { id: 'u1', email: 'a@b.com', crmId: 'c1' };
+const contact = await fetchContact(fanUser.crmId);
+
+// Embed the foreign row under its bridge key
+const data = { ...fanUser, 'salesforce:Contact': contact };
+
+// Rule references the bridge key in the path
+const rule = { field: 'salesforce:Contact.industry', operator: Operator.equals, value: 'tech' };
+check(rule, data);
+```
+
+For **bidirectional traversal**, use JavaScript object references — `check`'s path walker handles circular structures fine because rules are finite trees and only resolve named paths:
+
+```ts
+fanUser['salesforce:Contact'] = contact;
+contact['prisma:FanUser']     = fanUser;   // back-ref
+
+// Rule walks fanUser → contact → fanUser → email
+const rule = { field: 'salesforce:Contact.prisma:FanUser.email', operator: Operator.equals, value: 'a@b.com' };
+check(rule, fanUser);
+```
+
+For **batch evaluation**, build the anchor array yourself (engine supports root-array rules via fieldless arrayOperators):
+
+```ts
+const enriched = fanUsers.map((u) => ({
+  ...u,
+  'salesforce:Contact': contactsByCrmId[u.crmId],
+  'crm:MarketingEvent': eventsByUserId[u.id],
+}));
+
+check(
+  {
+    arrayOperator: ArrayOperator.any,
+    condition: { field: 'salesforce:Contact.industry', operator: Operator.equals, value: 'tech' },
+  },
+  enriched,
+);
+```
+
+The lens schema (with `Bridge.endpoints[*].on`) is what tells the caller how to fetch and index foreign data. The runtime engine just walks the resulting structure.
+
 ## Examples
 
 See [`examples/basic-validation.ts`](./examples/basic-validation.ts), [`examples/array-operations.ts`](./examples/array-operations.ts), [`examples/aggregate-rules.ts`](./examples/aggregate-rules.ts), [`examples/date-operations.ts`](./examples/date-operations.ts), and [`examples/advanced-features.ts`](./examples/advanced-features.ts).

package/dist/index.cjs

@@ -1,4 +1,20 @@
-'use strict';var lodash=require('lodash'),q=require('dayjs'),We=require('dayjs/plugin/isSameOrAfter.js'),je=require('dayjs/plugin/isSameOrBefore.js'),Ue=require('dayjs/plugin/timezone.js'),Ge=require('dayjs/plugin/utc.js'),pg=require('pg');function _interopDefault(e){return e&&e.__esModule?e:{default:e}}var q__default=/*#__PURE__*/_interopDefault(q);var We__default=/*#__PURE__*/_interopDefault(We);var je__default=/*#__PURE__*/_interopDefault(je);var Ue__default=/*#__PURE__*/_interopDefault(Ue);var Ge__default=/*#__PURE__*/_interopDefault(Ge);var i={equals:"equals",notEquals:"notEquals",lessThan:"lessThan",lessThanEquals:"lessThanEquals",greaterThan:"greaterThan",greaterThanEquals:"greaterThanEquals",contains:"contains",notContains:"notContains",in:"in",notIn:"notIn",matches:"matches",notMatches:"notMatches",between:"between",notBetween:"notBetween",isEmpty:"isEmpty",notEmpty:"notEmpty",exists:"exists",notExists:"notExists",startsWith:"startsWith",endsWith:"endsWith"},d={all:"all",any:"any",none:"none",atLeast:"atLeast",atMost:"atMost",exactly:"exactly",empty:"empty",notEmpty:"notEmpty"},c={before:"before",after:"after",onOrBefore:"onOrBefore",onOrAfter:"onOrAfter",between:"between",notBetween:"notBetween",dayIn:"dayIn",dayNotIn:"dayNotIn"};q__default.default.extend(Ge__default.default);q__default.default.extend(Ue__default.default);q__default.default.extend(je__default.default);q__default.default.extend(We__default.default);var re=(e,t,r)=>{let n=lodash.get(t,e.field);if(!n)throw new Error(`${e.field} is null or undefined`);if(!K(n))throw new Error(`${e.field} is not a valid date: ${String(n)}`);let a=q__default.default(n);if(!a.isValid())throw new Error(`${e.field} is not a valid date: ${n}`);let o=p=>e.error||`${e.field} ${p}`,s=Ke(e,t,r,a,n),u=s[0],l=s[1];switch(e.dateOperator){case c.before:return a.isBefore(u)||o(`must be before ${u.format()}`);case c.after:return a.isAfter(u)||o(`must be after ${u.format()}`);case c.onOrBefore:return a.isSameOrBefore(u)||o(`must be on or before ${u.format()}`);case c.onOrAfter:return a.isSameOrAfter(u)||o(`must be on or after ${u.format()}`);case c.between:{if(!l)throw new Error("between operator requires an end date");return a.isSameOrAfter(u)&&a.isSameOrBefore(l)||o(`must be between ${u.format()} and ${l?.format()}`)}case c.notBetween:{if(!l)throw new Error("notBetween operator requires an end date");return a.isBefore(u)||a.isAfter(l)||o(`must not be between ${u.format()} and ${l?.format()}`)}case c.dayIn:{if(!Array.isArray(e.value))throw new Error("dayIn operator requires an array of day names");let p=a.format("dddd").toLowerCase(),f=e.value.map(y=>String(y).toLowerCase());return f.includes(p)||o(`must be on ${f.join(" or ")}`)}case c.dayNotIn:{if(!Array.isArray(e.value))throw new Error("dayNotIn operator requires an array of day names");let p=a.format("dddd").toLowerCase(),f=e.value.map(y=>String(y).toLowerCase());return !f.includes(p)||o(`must not be on ${f.join(" or ")}`)}default:throw new Error("Unknown date operator")}},Ke=(e,t,r,n,a)=>{if([c.between,c.notBetween].includes(e.dateOperator)){if(!Array.isArray(e.value)||e.value.length!==2)throw new Error(`${e.dateOperator} operator requires an array of two dates`);let[u,l]=e.value,p=U(u,a),f=U(l,a);if(!p.isValid())throw new Error(`Invalid start date: ${e.value[0]}`);if(!f.isValid())throw new Error(`Invalid end date: ${e.value[1]}`);let[y,h]=p.isBefore(f)||p.isSame(f)?[p,f]:[f,p];return [y,h]}if([c.before,c.after,c.onOrBefore,c.onOrAfter].includes(e.dateOperator)){let u;if(e.value!==void 0){if(Array.isArray(e.value))throw new Error(`${e.dateOperator} operator requires a single date value`);u=e.value;}else if(e.path)if(e.path.startsWith("$.")){let p=lodash.get(t,e.path.substring(2));u=K(p)?p:void 0;}else {let p=lodash.get(r,e.path);u=K(p)?p:void 0;}else throw new Error("No value or path specified for date comparison");let l=U(u,a);if(!l.isValid())throw new Error(`Invalid comparison date: ${u}`);return [l,void 0]}return [q__default.default(),void 0]},U=(e,t)=>{let r=String(e);if(r.includes("Z")||r.includes("T")&&(r.includes("+")||r.match(/T.*-\d{2}:/)))return q__default.default(e);let a=String(t),o=0;if(a.includes("+")||a.includes("T")&&a.match(/T.*-\d{2}:/)){let u=a.match(/([+-])(\d{2}):(\d{2})/);u&&(o=(u[1]==="+"?1:-1)*(parseInt(u[2],10)*60+parseInt(u[3],10)));}else a.includes("Z")||(o=0);return r.match(/^\d{4}-\d{2}-\d{2}$/)?q__default.default(`${e}T00:00:00`).subtract(o,"minute"):q__default.default(e).subtract(o,"minute")},K=e=>typeof e=="string"||typeof e=="number"||e instanceof Date;var se=(e,t,r)=>{let n=lodash.get(t,e.field),o=![i.isEmpty,i.notEmpty,i.exists,i.notExists].includes(e.operator),s=o?Je(e,t,r):void 0,u=l=>e.error||`${e.field} ${l}${o?` ${JSON.stringify(s)}`:""}`;switch(e.operator){case i.equals:return n===s||u("must equal");case i.notEquals:return n!==s||u("must not equal");case i.lessThan:return L(n,s,"lt")||u("must be less than");case i.lessThanEquals:return L(n,s,"lte")||u("must be less than or equal to");case i.greaterThan:return L(n,s,"gt")||u("must be greater than");case i.greaterThanEquals:return L(n,s,"gte")||u("must be greater than or equal to");case i.in:return Array.isArray(s)&&s.includes(n)||u("must be one of");case i.notIn:return !Array.isArray(s)||!s.includes(n)||u("must not be one of");case i.contains:return oe(n,s)||u("must contain");case i.notContains:return !oe(n,s)||u("must not contain");case i.matches:return ne(n)&&(s instanceof RegExp||typeof s=="string")&&!!n.match(s)||u("must match pattern");case i.notMatches:return !ne(n)||!(s instanceof RegExp||typeof s=="string")||!n.match(s)||u("must not match pattern");case i.between:{let l=ae(s);if(!l)throw new Error("between operator requires an array of two values");if(!T(n))return u("must be between");let p=F(n),[f,y]=l;return p>=f&&p<=y||u("must be between")}case i.notBetween:{let l=ae(s);if(!l)throw new Error("notBetween operator requires an array of two values");if(!T(n))return  true;let p=F(n),[f,y]=l;return p<f||p>y||u("must not be between")}case i.isEmpty:return lodash.isEmpty(n)||u("must be empty");case i.notEmpty:return !lodash.isEmpty(n)||u("must not be empty");case i.exists:return n!==void 0||u("must exist");case i.notExists:return n===void 0||u("must not exist");case i.startsWith:return typeof n=="string"&&typeof s=="string"&&n.startsWith(s)||u("must start with");case i.endsWith:return typeof n=="string"&&typeof s=="string"&&n.endsWith(s)||u("must end with");default:throw new Error("Unknown operator")}},Je=(e,t,r)=>{if(e.value!==void 0)return e.value;if(e.path)return e.path.startsWith("$.")?lodash.get(t,e.path.substring(2)):lodash.get(r,e.path);throw new Error("No value or path specified")},T=e=>typeof e=="string"||typeof e=="number"||e instanceof Date,F=e=>e instanceof Date?e.getTime():e,L=(e,t,r)=>{if(!T(e)||!T(t))return  false;let n=F(e),a=F(t);switch(r){case "lt":return n<a;case "lte":return n<=a;case "gt":return n>a;case "gte":return n>=a}},ne=e=>typeof e=="string",ae=e=>{if(!Array.isArray(e)||e.length!==2)return null;let[t,r]=e;if(!T(t)||!T(r))return null;let n=F(t),a=F(r);return n<=a?[n,a]:[a,n]},oe=(e,t)=>typeof e=="string"?typeof t=="string"&&e.includes(t):Array.isArray(e)?e.includes(t):false;var S=(e,t,r=t)=>typeof e=="boolean"?e:"all"in e?He(e.all,t,r,e.error):"any"in e?Xe(e.any,t,r,e.error):"arrayOperator"in e?er(e,t,r):"dateOperator"in e?re(e,t,r):"aggregate"in e?Ze(e,t,r):"field"in e?se(e,t,r):"if"in e?Ye(e,t,r):false,He=(e,t,r,n)=>{let a=[];for(let o of e){let s=S(o,t,r);s!==true&&(typeof s=="string"?a.push(s):a.push("false"));}return a.length?n||(a.length===1?a[0]:`All conditions must pass: ${a.join(" AND ")}`):true},Xe=(e,t,r,n)=>{let a=[];for(let o of e){let s=S(o,t,r);if(s===true)return  true;typeof s=="string"&&a.push(s);}return n||(a.length===1?a[0]:`At least one condition must pass: ${a.join(" OR ")}`)},Ye=(e,t,r)=>S(e.if,t,r)===true?S(e.then,t,r):e.else?S(e.else,t,r):true,Ze=(e,t,r)=>{let n=lodash.get(t,e.field);if(!Array.isArray(n))throw new Error(`${e.field} must be an array`);let a=e.condition,o=a?n.filter(h=>S(a,h,r)===true):n,{mode:s,field:u}=e.aggregate,l=o.map((h,w)=>{let b=u?lodash.get(h,u):h;if(typeof b!="number"||!Number.isFinite(b)){let v=`${e.field}[${w}]${u?`.${u}`:""}`;throw new Error(`${v} must be a finite number`)}return b}),p;if(s==="sum"?p=l.reduce((h,w)=>h+w,0):p=l.length===0?null:l.reduce((h,w)=>h+w,0)/l.length,p===null)return e.error||`${e.field} ${s} comparison failed (empty array)`;let f;if(e.value!==void 0)f=e.value;else if(e.path)f=e.path.startsWith("$.")?lodash.get(t,e.path.substring(2)):lodash.get(r,e.path);else throw new Error("Aggregate rule requires value or path");let y=h=>e.error||`${e.field} ${s} ${h} ${JSON.stringify(f)}`;switch(e.operator){case i.equals:return p===f||y("must equal");case i.notEquals:return p!==f||y("must not equal");case i.lessThan:return typeof f=="number"&&p<f||y("must be less than");case i.lessThanEquals:return typeof f=="number"&&p<=f||y("must be less than or equal to");case i.greaterThan:return typeof f=="number"&&p>f||y("must be greater than");case i.greaterThanEquals:return typeof f=="number"&&p>=f||y("must be greater than or equal to");case i.between:{if(!Array.isArray(f)||f.length!==2)throw new Error("between requires a two-element array");let[h,w]=f,[b,v]=h<=w?[h,w]:[w,h];return p>=b&&p<=v||y("must be between")}case i.notBetween:{if(!Array.isArray(f)||f.length!==2)throw new Error("notBetween requires a two-element array");let[h,w]=f,[b,v]=h<=w?[h,w]:[w,h];return p<b||p>v||y("must not be between")}default:throw new Error(`Operator '${e.operator}' is not supported for aggregate rules`)}},er=(e,t,r)=>{let n=lodash.get(t,e.field);if(!Array.isArray(n))throw new Error(`${e.field} must be an array`);let a=y=>e.error||`${e.field} ${y}`,o=[d.all,d.any,d.none,d.atLeast,d.atMost,d.exactly],s=[d.atLeast,d.atMost,d.exactly],u=e.condition;if(o.includes(e.arrayOperator)&&!u)throw new Error(`${e.arrayOperator} requires a condition to check against array elements`);let l=e.count;if(s.includes(e.arrayOperator)&&l===void 0)throw new Error(`${e.arrayOperator} requires a count`);let p=0,f=0;if(o.includes(e.arrayOperator)){if(!u)throw new Error(`${e.arrayOperator} requires a condition to check against array elements`);if(!lodash.some(n,lodash.isObject))throw new Error(`${e.field} contains only primitive values. Use 'in' or 'contains' operators instead of array operators for primitive arrays`);let y=n.map(h=>S(u,h,r));p=y.filter(h=>h===true).length,f=y.filter(h=>typeof h=="string").length;}switch(e.arrayOperator){case d.empty:return !n.length||a("must be empty");case d.notEmpty:return !!n.length||a("must not be empty");case d.all:return p===n.length||a(`all elements must match (${f} failed)`);case d.any:return !!p||a("at least one element must match");case d.none:return !p||a(`no elements should match (${p} matched)`);case d.atLeast:if(l===void 0)throw new Error(`${e.arrayOperator} requires a count`);return p>=l||a(`at least ${l} elements must match (${p} matched)`);case d.atMost:if(l===void 0)throw new Error(`${e.arrayOperator} requires a count`);return p<=l||a(`at most ${l} elements must match (${p} matched)`);case d.exactly:if(l===void 0)throw new Error(`${e.arrayOperator} requires a count`);return p===l||a(`exactly ${l} elements must match (${p} matched)`);default:throw new Error("Unknown array operator")}};var V=(e,t,r,n)=>{let a=e[t];if(!a)return null;for(let o of Object.values(a.fields))if(o.kind==="object"&&o.type===r&&(o.fromFields?.length??0)>0&&(o.toFields?.length??0)>0&&(n===void 0||o.relationName===n))return o;return null};var A=(e,t)=>{let r=e.split("."),n=t;for(let a=r.length-1;a>=0;a--)n={[r[a]]:n};return n};var ie,ue=e=>{ie=e;},le=(e,t,r)=>{if(!t?.map||!t?.model||!r)throw new Error("Aggregate rules require a FieldMap and model to generate a Prisma plan. Pass { map, model } options to toPrisma().");if(!e.aggregate.field)throw new Error("Prisma aggregate rules require aggregate.field to specify the numeric field on the related model.");if(e.path)throw new Error("path is not supported for Prisma aggregate rules; use value instead.");return tr(e,t,r)},rr=(e,t,r)=>{let n=e.split("."),a=[],o=r;for(let s=0;s<n.length;s++){let u=n[s],l=t[o]?.fields[u];if(!l||l.kind!=="object")throw new Error(`Field '${u}' is not a relation in model '${o}'. Prisma aggregate rules only support relation fields.`);if(s===n.length-1){if(!l.isList)throw new Error(`Field '${u}' is not a list relation in model '${o}'.`);return {segments:n,intermediateRelations:a,terminalModel:o,terminalEntry:l}}if(l.isList)throw new Error(`Intermediate field '${u}' in path '${e}' is a list relation. Only the final segment can be a list relation for aggregate rules.`);a.push({fieldName:u,entry:l,onModel:o}),o=l.type;}throw new Error(`Field path '${e}' did not terminate at a list relation.`)},tr=(e,t,r)=>{let{map:n,model:a}=t,{intermediateRelations:o,terminalModel:s,terminalEntry:u}=rr(e.field,n,a),l=u.type,p=e.aggregate.field??"",f=n[l]?.fields[p];if(!f)throw new Error(`aggregate.field '${p}' does not exist on model '${l}'.`);if(f.kind!=="scalar")throw new Error(`aggregate.field '${p}' on model '${l}' must be a scalar field, got '${f.kind}'.`);if(f.type==="Json")throw new Error(`aggregate.field '${p}' on model '${l}' is a Json field \u2014 aggregate rules require a numeric scalar.`);let y,h;if(u.fromFields&&u.fromFields.length>0){if(u.fromFields.length>1)throw new Error("Aggregate rules do not support composite FK relations.");y=u.toFields?.[0]??"id",h=u.fromFields[0];}else {let E=V(n,l,s,u.relationName);if(!E)throw new Error(`Cannot determine FK relationship between '${s}' and '${l}'. Ensure the FieldMap contains both sides of the relation.`);if((E.fromFields?.length??0)>1)throw new Error("Aggregate rules do not support composite FK relations.");y=E.fromFields?.[0]??"",h=E.toFields?.[0]??"";}let w=e.condition?ie(e.condition,{...t,model:l},r):{},b=e.aggregate.mode==="sum"?"_sum":"_avg",v={[p]:{[b]:nr(e)}},B={operation:"groupBy",model:l,args:{by:[y],where:w,having:v},extract:y},ee=r.steps.length;r.steps.push(B);let M={__step:ee};if(o.length>0){let E={[h]:{in:M}},Le=o.map(Ve=>Ve.fieldName).join(".");return A(Le,E)}return {[h]:{in:M}}},nr=e=>{let t=e.value;switch(e.operator){case i.equals:return {equals:t};case i.notEquals:return {not:t};case i.lessThan:return {lt:t};case i.lessThanEquals:return {lte:t};case i.greaterThan:return {gt:t};case i.greaterThanEquals:return {gte:t};case i.between:{if(!Array.isArray(t)||t.length!==2)throw new Error("between requires two values");let[r,n]=t,[a,o]=r<=n?[r,n]:[n,r];return {gte:a,lte:o}}case i.notBetween:throw new Error("Operator 'notBetween' is not supported for Prisma aggregate rules.");default:throw new Error(`Operator '${e.operator}' is not supported for Prisma aggregate rules.`)}};var pe=(e,t,r,n)=>{let{map:a,model:o}=t,s=a[o]?.fields[e.field];if(!s||s.kind!=="object")throw new Error(`Field '${e.field}' is not a relation in model '${o}'. Count operators require a relation field.`);if(!s.isList)throw new Error(`Field '${e.field}' is not a list relation in model '${o}'. Count operators only apply to one-to-many or many-to-many relations.`);let u=s.type,l,p;if(s.fromFields&&s.fromFields.length>0){if(s.fromFields.length>1)throw new Error(`Count operators (atLeast/atMost/exactly) do not support composite FK relations ('${o}.${e.field}'). Use prisma.$queryRaw for composite FK count filtering.`);l=s.toFields?.[0]??"id",p=s.fromFields[0];}else {let B=V(a,u,o,s.relationName);if(!B){let M=Object.values(a[u]?.fields??{}).some(E=>E.kind==="object"&&E.type===o&&E.isList&&!E.fromFields?.length);throw new Error(M?`'${o}.${e.field}' is an implicit many-to-many relation. Count operators require an explicit join model with a FK \u2014 convert to an explicit @relation or use prisma.$queryRaw.`:`Cannot determine FK relationship between '${o}' and '${u}'. Ensure the FieldMap contains both sides of the relation.`)}if((B.fromFields?.length??0)>1)throw new Error(`Count operators (atLeast/atMost/exactly) do not support composite FK relations ('${o}.${e.field}'). Use prisma.$queryRaw for composite FK count filtering.`);l=B.fromFields?.[0]??"",p=B.toFields?.[0]??"";}let f=e.condition?n(e.condition,{...t,model:u},r):{},y=e.count??1,h=ar(e.arrayOperator,y,l),w={operation:"groupBy",model:u,args:{by:[l],where:f,having:h},extract:l},b=r.steps.length;r.steps.push(w);let v={__step:b};return {[p]:{in:v}}},ar=(e,t,r)=>{switch(e){case d.atLeast:return {[r]:{_count:{gte:t}}};case d.atMost:return {[r]:{_count:{lte:t}}};case d.exactly:return {[r]:{_count:{equals:t}}};default:throw new Error("unreachable")}};var x,de=e=>{x=e;},fe=(e,t,r)=>{if(e.arrayOperator===d.atLeast||e.arrayOperator===d.atMost||e.arrayOperator===d.exactly){if(t?.map&&t?.model&&r)return pe(e,t,r,x);throw new Error(`ArrayOperator '${e.arrayOperator}' requires a FieldMap and model to generate a multi-step plan. Pass { map, model } options to toPrisma(). Without them, use prisma.$queryRaw for count-based relation filtering.`)}let n=or(e,t,r);return A(e.field,n)},or=(e,t,r)=>{switch(e.arrayOperator){case d.all:if(!e.condition)throw new Error("ArrayOperator 'all' requires a condition");return {every:x(e.condition,t,r)};case d.any:if(!e.condition)throw new Error("ArrayOperator 'any' requires a condition");return {some:x(e.condition,t,r)};case d.none:if(!e.condition)throw new Error("ArrayOperator 'none' requires a condition");return {none:x(e.condition,t,r)};case d.empty:return {none:{}};case d.notEmpty:return {some:{}};default:throw new Error(`Unknown array operator: ${e.arrayOperator}`)}};var ge=(e,t)=>{let r=ur(e,t);return A(e.field,r)},ir=(e,t)=>{if(e.value!==void 0)return e.value;if(e.path){if(e.path.startsWith("$."))throw new Error(`Prisma WHERE has no column-to-column date comparison for path '${e.path}'. Use prisma.$queryRaw for field-to-field filtering.`);if(!t?.context)throw new Error(`options.context is required to resolve date path '${e.path}'. Pass context when calling toPrisma().`);return lodash.get(t.context,e.path)}},ur=(e,t)=>{let r=()=>ir(e,t);switch(e.dateOperator){case c.before:return {lt:r()};case c.after:return {gt:r()};case c.onOrBefore:return {lte:r()};case c.onOrAfter:return {gte:r()};case c.between:{let n=r();if(!Array.isArray(n)||n.length!==2)throw new Error("between date operator requires an array of two values");let[a,o]=me(n);return {gte:a,lte:o}}case c.notBetween:{let n=r();if(!Array.isArray(n)||n.length!==2)throw new Error("notBetween date operator requires an array of two values");let[a,o]=me(n);return {NOT:{gte:a,lte:o}}}case c.dayIn:throw new Error("DateOperator 'dayIn' has no Prisma equivalent. Use prisma.$queryRaw with EXTRACT(DOW FROM ...) for day-of-week filtering.");case c.dayNotIn:throw new Error("DateOperator 'dayNotIn' has no Prisma equivalent. Use prisma.$queryRaw with EXTRACT(DOW FROM ...) for day-of-week filtering.");default:throw new Error(`Unknown date operator: ${e.dateOperator}`)}},me=e=>{let[t,r]=e;return lr(t,r)<=0?[t,r]:[r,t]},lr=(e,t)=>{let r=ce(e),n=ce(t);return r<n?-1:r>n?1:0},ce=e=>e instanceof Date?e.getTime():typeof e=="number"||typeof e=="string"?e:String(e);var ye=(e,t,r)=>{let n=e.split("."),a=r;for(let o=0;o<n.length;o++){let s=t[a];if(!s)return {kind:"fallback"};let u=s.fields[n[o]];if(!u)return {kind:"fallback"};if(u.kind==="scalar"&&u.type==="Json"&&o<n.length-1)return {kind:"json-path",stopIndex:o+1,jsonPath:n.slice(o+1)};if(u.kind==="object"){if(!t[u.type])return {kind:"fallback"};a=u.type;continue}return {kind:"direct"}}return {kind:"direct"}};var he=(e,t)=>{if(e.operator===i.isEmpty)return {OR:[_(e.field,{equals:null},t),_(e.field,{equals:""},t)]};if(e.operator===i.notEmpty)return {AND:[_(e.field,{not:null},t),_(e.field,{not:""},t)]};let r=fr(e,t);return _(e.field,r,t)},dr=(e,t)=>{if(e.value!==void 0)return e.value;if(e.path){if(e.path.startsWith("$."))throw new Error(`Prisma WHERE has no column-to-column comparison for path '${e.path}'. Use prisma.$queryRaw for field-to-field filtering.`);if(!t?.context)throw new Error(`options.context is required to resolve path '${e.path}'. Pass context when calling toPrisma().`);return lodash.get(t.context,e.path)}throw new Error(`Rule for field '${e.field}' has neither value nor path set`)},fr=(e,t)=>{let r=()=>dr(e,t);switch(e.operator){case i.equals:return {equals:r()??null};case i.notEquals:return {not:r()??null};case i.lessThan:return {lt:r()};case i.lessThanEquals:return {lte:r()};case i.greaterThan:return {gt:r()};case i.greaterThanEquals:return {gte:r()};case i.in:return {in:r()};case i.notIn:return {notIn:r()};case i.contains:return {contains:r()};case i.notContains:return {not:{contains:r()}};case i.startsWith:return {startsWith:r()};case i.endsWith:return {endsWith:r()};case i.matches:throw new Error("Operator 'matches' has no Prisma equivalent. Use prisma.$queryRaw for regex filtering.");case i.notMatches:throw new Error("Operator 'notMatches' has no Prisma equivalent. Use prisma.$queryRaw for regex filtering.");case i.between:{let n=r();if(!Array.isArray(n)||n.length!==2)throw new Error("between operator requires an array of two values");let[a,o]=n[0]<=n[1]?n:[n[1],n[0]];return {gte:a,lte:o}}case i.notBetween:{let n=r();if(!Array.isArray(n)||n.length!==2)throw new Error("notBetween operator requires an array of two values");let[a,o]=n[0]<=n[1]?n:[n[1],n[0]];return {NOT:{gte:a,lte:o}}}case i.isEmpty:case i.notEmpty:throw new Error("isEmpty/notEmpty handled at buildFieldRule level");case i.exists:return {not:null};case i.notExists:return {equals:null};default:throw new Error(`Unknown operator: ${e.operator}`)}},_=(e,t,r)=>{if(!r?.map||!r?.model)return A(e,t);let n=ye(e,r.map,r.model),a=e.split(".");switch(n.kind){case "fallback":case "direct":return A(e,t);case "json-path":{let o={path:n.jsonPath,...t},s=a.slice(0,n.stopIndex).join(".");return A(s,o)}}};var D,we=e=>{D=e;},$e=(e,t,r)=>e.all.length===0?{}:{AND:e.all.map(n=>D(n,t,r))},be=(e,t,r)=>e.any.length===0?{AND:[{id:null},{id:{not:null}}]}:{OR:e.any.map(n=>D(n,t,r))},Ee=(e,t,r)=>{let n=D(e.if,t,r),a={NOT:n},o=D(e.then,t,r);if(e.else){let s=D(e.else,t,r);return {AND:[{OR:[a,o]},{OR:[n,s]}]}}return {OR:[a,o]}};var N=(e,t,r)=>{if(typeof e=="boolean"){if(e)return {};throw new Error("Boolean 'false' has no direct Prisma WHERE equivalent. toPrisma is designed for structured Rule conditions.")}if("all"in e)return $e(e,t,r);if("any"in e)return be(e,t,r);if("if"in e)return Ee(e,t,r);if("arrayOperator"in e)return fe(e,t,r);if("dateOperator"in e)return ge(e,t);if("aggregate"in e)return le(e,t,r);if("field"in e)return he(e,t);throw new Error("Unknown condition type")};we(N);de(N);ue(N);var mr=async(e,t)=>{let r=e.steps.filter(o=>o.operation==="groupBy"),n=e.steps.find(o=>o.operation==="where");if(!n)throw new Error("executePrismaQueryPlan: result has no where step");let a=[];for(let o of r){let s=o.model.charAt(0).toLowerCase()+o.model.slice(1),u=t[s];if(!u)throw new Error(`executePrismaQueryPlan: no delegate for model '${o.model}'. Ensure prismaDelegate has a key '${s}'.`);let l=await u[o.operation](o.args);a.push(l.map(p=>p[o.extract]));}return z(n.where,a)},z=(e,t)=>{if(e==null)return e;if(Array.isArray(e))return e.map(r=>z(r,t));if(typeof e=="object"){let r=e;if("__step"in r&&typeof r.__step=="number"){let a=r.__step;if(a>=t.length)throw new Error(`Step ref __step: ${a} out of range (${t.length} steps executed)`);return t[a]}let n={};for(let[a,o]of Object.entries(r))n[a]=z(o,t);return n}return e};var It=(e,t)=>{let r={steps:[]},n=N(e,t,r);return {steps:[...r.steps,{operation:"where",where:n}]}};var g=(e,t)=>(e.params.push(t),`$${++e.paramIndex}`);var I=e=>e.replace(/\\/g,"\\\\").replace(/%/g,"\\%").replace(/_/g,"\\_"),$=e=>{let t=e.split(".");if(t.length===1)return pg.escapeIdentifier(e);let[r,...n]=t;return n.length===0?pg.escapeIdentifier(r):Oe(pg.escapeIdentifier(r),n)},Ae=(e,t)=>{let r=e.split(".");if(r.length===1)return `${pg.escapeIdentifier(t)}.${pg.escapeIdentifier(e)}`;let[n,...a]=r;return Oe(`${pg.escapeIdentifier(t)}.${pg.escapeIdentifier(n)}`,a)},Q=e=>`'${e.replace(/'/g,"''")}'`,Oe=(e,t)=>{if(t.length===0)return e;let r=t.slice(0,-1).map(Q).join("->"),n=Q(t[t.length-1]);return r?`${e}->${r}->>${n}`:`${e}->>${n}`},Re=e=>{let t=e.split(".");if(t.length===1)return pg.escapeIdentifier(e);let[r,...n]=t;return n.length===0?pg.escapeIdentifier(r):cr(pg.escapeIdentifier(r),n)},cr=(e,t)=>{let r=t.map(Q).join("->");return `${e}->${r}`};var qe=(e,t)=>{if(e.condition)throw new Error("Aggregate condition filtering is not yet supported by toSql(). Use check() for in-memory evaluation or toPrisma() for database queries.");let r=yr(e,t);return wr(r,e,t)},yr=(e,t)=>{let r=Re(e.field),{mode:n,field:a}=e.aggregate,o=n==="sum"?"SUM":"AVG",s=t.map?.[t.currentModel??""]?.fields[e.field];if(s?.kind==="object")throw new Error(`Field '${e.field}' is a relation \u2014 toSql() cannot aggregate relation lists. Use toPrisma() instead.`);if(a?.includes("."))throw new Error(`aggregate.field '${a}' contains a nested path \u2014 toSql() only supports flat field names. Use check() for nested paths.`);if(s?.kind==="scalar"&&s?.isList===true){if(a)throw new Error("aggregate.field is not supported for native array types. Use a JSONB column for object arrays.");return `(SELECT ${o==="SUM"?"COALESCE(SUM(elem), 0)":"AVG(elem)"} FROM unnest(${r}) AS elem)`}if(a){let f=`(elem->>'${a}')::numeric`;return `(SELECT ${o==="SUM"?`COALESCE(SUM(${f}), 0)`:`AVG(${f})`} FROM jsonb_array_elements(${r}) AS elem)`}let l="elem::numeric";return `(SELECT ${o==="SUM"?`COALESCE(SUM(${l}), 0)`:`AVG(${l})`} FROM jsonb_array_elements_text(${r}) AS elem)`},hr=(e,t)=>{if(e.value!==void 0)return {type:"value",value:e.value};if(e.path){if(e.path.startsWith("$.")){let r=e.path.substring(2);return {type:"column",sql:t.currentAlias?`${pg.escapeIdentifier(t.currentAlias)}.${pg.escapeIdentifier(r)}`:$(r)}}if(!t.context)throw new Error(`BuilderState.context is required to resolve path '${e.path}'. Pass context in options.`);return {type:"value",value:lodash.get(t.context,e.path)}}throw new Error("Aggregate rule requires value or path")},wr=(e,t,r)=>{let n=hr(t,r),a=n.type==="value"?n.value:void 0,o=n.type==="column"?n.sql:void 0;switch(t.operator){case i.equals:return o?`${e} = ${o}`:a===null?`${e} IS NULL`:`${e} = ${g(r,a)}`;case i.notEquals:return o?`${e} <> ${o}`:a===null?`${e} IS NOT NULL`:`${e} <> ${g(r,a)}`;case i.lessThan:return o?`${e} < ${o}`:`${e} < ${g(r,a)}`;case i.lessThanEquals:return o?`${e} <= ${o}`:`${e} <= ${g(r,a)}`;case i.greaterThan:return o?`${e} > ${o}`:`${e} > ${g(r,a)}`;case i.greaterThanEquals:return o?`${e} >= ${o}`:`${e} >= ${g(r,a)}`;case i.between:{let s=a;if(!Array.isArray(s)||s.length!==2)throw new Error("between requires two values");let[u,l]=s[0]<=s[1]?s:[s[1],s[0]];return `${e} BETWEEN ${g(r,u)} AND ${g(r,l)}`}case i.notBetween:{let s=a;if(!Array.isArray(s)||s.length!==2)throw new Error("notBetween requires two values");let[u,l]=s[0]<=s[1]?s:[s[1],s[0]];return `${e} NOT BETWEEN ${g(r,u)} AND ${g(r,l)}`}default:throw new Error(`Operator '${t.operator}' is not supported for aggregate rules`)}};var ke=(e,t)=>{let r=$(e.field),n=t.map?.[t.currentModel??""]?.fields[e.field],a=n?.kind==="scalar"&&n?.isList===true,o=a?`array_length(${r}, 1)`:`jsonb_array_length(${r})`;switch(e.arrayOperator){case d.empty:return a?`(${r} IS NULL OR ${o} IS NULL)`:`(${r} IS NULL OR ${o} = 0)`;case d.notEmpty:return a?`(${r} IS NOT NULL AND ${o} IS NOT NULL)`:`(${r} IS NOT NULL AND ${o} > 0)`;case d.all:case d.any:case d.none:case d.atLeast:case d.atMost:case d.exactly:throw new Error(`Array operator '${e.arrayOperator}' with conditions is not supported in SQL. Use application-level filtering for complex array operations.`);default:throw new Error(`Unknown array operator: ${e.arrayOperator}`)}};var H=e=>{let t={sunday:0,monday:1,tuesday:2,wednesday:3,thursday:4,friday:5,saturday:6};return e.map(r=>{let n=t[r.toLowerCase()];if(n===void 0)throw new Error(`Unknown day name: ${r}`);return n})};var W=(e,t)=>{if(!t.map||!t.currentModel||!t.currentAlias)return $(e);let r=e.split("."),n=t.currentModel,a=t.currentAlias;for(let o=0;o<r.length;o++){let s=t.map[n];if(!s)return $(e);let u=s.fields[r[o]];if(!u)return $(e);if(u.kind==="object"){let p=`${a}.${r[o]}`,f=t.joinRegistry?.get(p),y;if(f)y=f;else {let h=t.joinCounter;if(!h)return $(e);y=`t${++h.n}`;let w=$r(t.map,n,a,u,y);if(!w)return $(e);t.joins?.push(w),t.joinRegistry?.set(p,y);}n=u.type,a=y;continue}let l=r.slice(o);return Ae(l.join("."),a)}return $(e)},$r=(e,t,r,n,a)=>{let o=n.type,s=e[o]?.dbName??o,u;if(n.fromFields&&n.fromFields.length>0&&n.toFields&&n.toFields.length>0)u=n.fromFields.map((l,p)=>`${pg.escapeIdentifier(a)}.${pg.escapeIdentifier(n.toFields?.[p]??"")} = ${pg.escapeIdentifier(r)}.${pg.escapeIdentifier(l)}`).join(" AND ");else {let l=br(e,o,t,n.relationName);if(!l)return null;u=(l.fromFields??[]).map((p,f)=>`${pg.escapeIdentifier(a)}.${pg.escapeIdentifier(p)} = ${pg.escapeIdentifier(r)}.${pg.escapeIdentifier(l.toFields?.[f]??"")}`).join(" AND ");}return `LEFT JOIN ${pg.escapeIdentifier(s)} AS ${pg.escapeIdentifier(a)} ON ${u}`},br=(e,t,r,n)=>{let a=e[t];if(!a)return null;for(let o of Object.values(a.fields))if(o.kind==="object"&&o.type===r&&(o.fromFields?.length??0)>0&&(o.toFields?.length??0)>0&&(n===void 0||o.relationName===n))return o;return null};var Fe=(e,t)=>{let r=W(e.field,t),n=Or(e,t),a=n.type==="value"?n.value:void 0,o=n.type==="column"?n.sql:void 0;switch(e.dateOperator){case c.before:return o!==void 0?`${r} < ${o}`:`${r} < ${g(t,a)}`;case c.after:return o!==void 0?`${r} > ${o}`:`${r} > ${g(t,a)}`;case c.onOrBefore:return o!==void 0?`${r} <= ${o}`:`${r} <= ${g(t,a)}`;case c.onOrAfter:return o!==void 0?`${r} >= ${o}`:`${r} >= ${g(t,a)}`;case c.between:{let s=a;if(!Array.isArray(s)||s.length!==2)throw new Error("between date operator requires an array of two values");let[u,l]=Be(s);return `${r} BETWEEN ${g(t,u)} AND ${g(t,l)}`}case c.notBetween:{let s=a;if(!Array.isArray(s)||s.length!==2)throw new Error("notBetween date operator requires an array of two values");let[u,l]=Be(s);return `${r} NOT BETWEEN ${g(t,u)} AND ${g(t,l)}`}case c.dayIn:{if(!Array.isArray(e.value))throw new Error("dayIn operator requires an array of day names");let s=H(e.value.map(u=>String(u)));return `EXTRACT(DOW FROM ${r}) = ANY(${g(t,s)})`}case c.dayNotIn:{if(!Array.isArray(e.value))throw new Error("dayNotIn operator requires an array of day names");let s=H(e.value.map(u=>String(u)));return `EXTRACT(DOW FROM ${r}) <> ALL(${g(t,s)})`}default:throw new Error(`Unknown date operator: ${e.dateOperator}`)}},Be=e=>{let[t,r]=e;return Ar(t,r)<=0?[t,r]:[r,t]},Ar=(e,t)=>{let r=Te(e),n=Te(t);return r<n?-1:r>n?1:0},Te=e=>e instanceof Date?e.getTime():typeof e=="number"||typeof e=="string"?e:String(e),Or=(e,t)=>{if(e.value!==void 0)return {type:"value",value:e.value};if(e.path){if(e.path.startsWith("$.")){let r=e.path.substring(2);return {type:"column",sql:t.currentAlias?`${pg.escapeIdentifier(t.currentAlias)}.${pg.escapeIdentifier(r)}`:$(r)}}if(!t.context)throw new Error(`BuilderState.context is required to resolve date path '${e.path}'. Pass context in options when calling toSql().`);return {type:"value",value:lodash.get(t.context,e.path)}}return {type:"value",value:void 0}};var Pe=(e,t)=>{let r=W(e.field,t),n=vr(e,t),a=n.type==="value"?n.value:void 0,o=n.type==="column"?n.sql:void 0;switch(e.operator){case i.equals:return o!==void 0?`${r} = ${o}`:a===null?`${r} IS NULL`:`${r} = ${g(t,a)}`;case i.notEquals:return o!==void 0?`${r} <> ${o}`:a===null?`${r} IS NOT NULL`:`${r} <> ${g(t,a)}`;case i.lessThan:return o!==void 0?`${r} < ${o}`:`${r} < ${g(t,a)}`;case i.lessThanEquals:return o!==void 0?`${r} <= ${o}`:`${r} <= ${g(t,a)}`;case i.greaterThan:return o!==void 0?`${r} > ${o}`:`${r} > ${g(t,a)}`;case i.greaterThanEquals:return o!==void 0?`${r} >= ${o}`:`${r} >= ${g(t,a)}`;case i.in:return !Array.isArray(a)||a.length===0?"FALSE":`${r} = ANY(${g(t,a)})`;case i.notIn:return !Array.isArray(a)||a.length===0?"TRUE":`${r} <> ALL(${g(t,a)})`;case i.contains:return `${r} LIKE ${g(t,`%${I(String(a))}%`)}`;case i.notContains:return `${r} NOT LIKE ${g(t,`%${I(String(a))}%`)}`;case i.startsWith:return `${r} LIKE ${g(t,`${I(String(a))}%`)}`;case i.endsWith:return `${r} LIKE ${g(t,`%${I(String(a))}`)}`;case i.matches:return `${r} ~ ${g(t,a)}`;case i.notMatches:return `${r} !~ ${g(t,a)}`;case i.between:{let s=a;if(!Array.isArray(s)||s.length!==2)throw new Error("between operator requires an array of two values");let[u,l]=s[0]<=s[1]?s:[s[1],s[0]];return `${r} BETWEEN ${g(t,u)} AND ${g(t,l)}`}case i.notBetween:{let s=a;if(!Array.isArray(s)||s.length!==2)throw new Error("notBetween operator requires an array of two values");let[u,l]=s[0]<=s[1]?s:[s[1],s[0]];return `${r} NOT BETWEEN ${g(t,u)} AND ${g(t,l)}`}case i.isEmpty:return `(${r} IS NULL OR ${r} = '')`;case i.notEmpty:return `(${r} IS NOT NULL AND ${r} <> '')`;case i.exists:return `${r} IS NOT NULL`;case i.notExists:return `${r} IS NULL`;default:throw new Error(`Unknown operator: ${e.operator}`)}},vr=(e,t)=>{if(e.value!==void 0)return {type:"value",value:e.value};if(e.path){if(e.path.startsWith("$.")){let r=e.path.substring(2);return {type:"column",sql:t.currentAlias?`${pg.escapeIdentifier(t.currentAlias)}.${pg.escapeIdentifier(r)}`:$(r)}}if(!t.context)throw new Error(`BuilderState.context is required to resolve path '${e.path}'. Pass context in options when calling toSql().`);return {type:"value",value:lodash.get(t.context,e.path)}}return {type:"value",value:void 0}};var P,Ce=e=>{P=e;},xe=(e,t)=>e.all.length===0?"TRUE":`(${e.all.map(n=>P(n,t)).join(" AND ")})`,_e=(e,t)=>e.any.length===0?"FALSE":`(${e.any.map(n=>P(n,t)).join(" OR ")})`,Ne=(e,t)=>{let r=P(e.if,t),n=P(e.then,t),a=e.else?P(e.else,t):"TRUE";return e.else?`((NOT(${r}) OR ${n}) AND (${r} OR ${a}))`:`(NOT(${r}) OR ${n})`};var X=(e,t)=>{if(typeof e=="boolean")return e?"TRUE":"FALSE";if("all"in e)return xe(e,t);if("any"in e)return _e(e,t);if("if"in e)return Ne(e,t);if("arrayOperator"in e)return ke(e,t);if("dateOperator"in e)return Fe(e,t);if("aggregate"in e)return qe(e,t);if("field"in e)return Pe(e,t);throw new Error("Unknown condition type")};Ce(X);var kn=(e,t)=>{let r=!!(t?.map&&t?.model),n=t?.alias??(r?"t0":void 0),a={params:[],paramIndex:0,context:t?.context,map:t?.map,currentModel:t?.model,currentAlias:n,joinCounter:r?{n:0}:void 0,joins:r?[]:void 0,joinRegistry:r?new Map:void 0};return {sql:X(e,a),params:a.params,joins:a.joins??[]}};var qr=new Set(Object.values(i)),kr=new Set(Object.values(d)),Sr=new Set(Object.values(c)),Br=(e,t={})=>{let r={target:t.target??"check",errors:[]};return k(e,"$",r),{ok:r.errors.length===0,errors:r.errors}},Tn=(e,t={})=>{let r=Br(e,t);if(r.ok)return;let n=r.errors.map(a=>`${a.path}: ${a.message}`).join(`
+'use strict';var j=require('dayjs'),qf=require('dayjs/plugin/isSameOrAfter.js'),Lf=require('dayjs/plugin/isSameOrBefore.js'),If=require('dayjs/plugin/timezone.js'),Nf=require('dayjs/plugin/utc.js');function _interopDefault(e){return e&&e.__esModule?e:{default:e}}var j__default=/*#__PURE__*/_interopDefault(j);var qf__default=/*#__PURE__*/_interopDefault(qf);var Lf__default=/*#__PURE__*/_interopDefault(Lf);var If__default=/*#__PURE__*/_interopDefault(If);var Nf__default=/*#__PURE__*/_interopDefault(Nf);var yo=typeof global=="object"&&global&&global.Object===Object&&global,De=yo;var ho=typeof self=="object"&&self&&self.Object===Object&&self,xo=De||ho||Function("return this")(),R=xo;var wo=R.Symbol,C=wo;var qr=Object.prototype,bo=qr.hasOwnProperty,Oo=qr.toString,_e=C?C.toStringTag:void 0;function Ao(e){var r=bo.call(e,_e),t=e[_e];try{e[_e]=void 0;var a=!0;}catch{}var o=Oo.call(e);return a&&(r?e[_e]=t:delete e[_e]),o}var Lr=Ao;var $o=Object.prototype,vo=$o.toString;function Eo(e){return vo.call(e)}var Ir=Eo;var So="[object Null]",Ro="[object Undefined]",Nr=C?C.toStringTag:void 0;function To(e){return e==null?e===void 0?Ro:So:Nr&&Nr in Object(e)?Lr(e):Ir(e)}var P=To;function _o(e){return e!=null&&typeof e=="object"}var B=_o;var ko="[object Symbol]";function Mo(e){return typeof e=="symbol"||B(e)&&P(e)==ko}var fe=Mo;function Fo(e,r){for(var t=-1,a=e==null?0:e.length,o=Array(a);++t<a;)o[t]=r(e[t],t,e);return o}var jr=Fo;var Co=Array.isArray,S=Co;var Wr=C?C.prototype:void 0,Vr=Wr?Wr.toString:void 0;function Ur(e){if(typeof e=="string")return e;if(S(e))return jr(e,Ur)+"";if(fe(e))return Vr?Vr.call(e):"";var r=e+"";return r=="0"&&1/e==-Infinity?"-0":r}var Gr=Ur;function Bo(e){var r=typeof e;return e!=null&&(r=="object"||r=="function")}var D=Bo;function Do(e){return e}var Kr=Do;var qo="[object AsyncFunction]",Lo="[object Function]",Io="[object GeneratorFunction]",No="[object Proxy]";function jo(e){if(!D(e))return  false;var r=P(e);return r==Lo||r==Io||r==qo||r==No}var qe=jo;var Wo=R["__core-js_shared__"],Le=Wo;var zr=(function(){var e=/[^.]+$/.exec(Le&&Le.keys&&Le.keys.IE_PROTO||"");return e?"Symbol(src)_1."+e:""})();function Vo(e){return !!zr&&zr in e}var Hr=Vo;var Uo=Function.prototype,Go=Uo.toString;function Ko(e){if(e!=null){try{return Go.call(e)}catch{}try{return e+""}catch{}}return ""}var I=Ko;var zo=/[\\^$.*+?()[\]{}|]/g,Ho=/^\[object .+?Constructor\]$/,Jo=Function.prototype,Qo=Object.prototype,Yo=Jo.toString,Xo=Qo.hasOwnProperty,Zo=RegExp("^"+Yo.call(Xo).replace(zo,"\\$&").replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g,"$1.*?")+"$");function en(e){if(!D(e)||Hr(e))return  false;var r=qe(e)?Zo:Ho;return r.test(I(e))}var Jr=en;function rn(e,r){return e?.[r]}var Qr=rn;function tn(e,r){var t=Qr(e,r);return Jr(t)?t:void 0}var M=tn;var an=M(R,"WeakMap"),Ie=an;var on=(function(){try{var e=M(Object,"defineProperty");return e({},"",{}),e}catch{}})(),ur=on;var nn=9007199254740991,sn=/^(?:0|[1-9]\d*)$/;function fn(e,r){var t=typeof e;return r=r??nn,!!r&&(t=="number"||t!="symbol"&&sn.test(e))&&e>-1&&e%1==0&&e<r}var le=fn;function ln(e,r,t){r=="__proto__"&&ur?ur(e,r,{configurable:true,enumerable:true,value:t,writable:true}):e[r]=t;}var Yr=ln;function un(e,r){return e===r||e!==e&&r!==r}var ue=un;var pn=9007199254740991;function dn(e){return typeof e=="number"&&e>-1&&e%1==0&&e<=pn}var pe=dn;function mn(e){return e!=null&&pe(e.length)&&!qe(e)}var U=mn;function cn(e,r,t){if(!D(t))return  false;var a=typeof r;return (a=="number"?U(t)&&le(r,t.length):a=="string"&&r in t)?ue(t[r],e):false}var Xr=cn;var gn=Object.prototype;function yn(e){var r=e&&e.constructor,t=typeof r=="function"&&r.prototype||gn;return e===t}var Ne=yn;function hn(e,r){for(var t=-1,a=Array(e);++t<e;)a[t]=r(t);return a}var Zr=hn;var xn="[object Arguments]";function wn(e){return B(e)&&P(e)==xn}var pr=wn;var et=Object.prototype,bn=et.hasOwnProperty,On=et.propertyIsEnumerable,An=pr((function(){return arguments})())?pr:function(e){return B(e)&&bn.call(e,"callee")&&!On.call(e,"callee")},de=An;function $n(){return  false}var rt=$n;var ot=typeof exports=="object"&&exports&&!exports.nodeType&&exports,tt=ot&&typeof module=="object"&&module&&!module.nodeType&&module,vn=tt&&tt.exports===ot,at=vn?R.Buffer:void 0,En=at?at.isBuffer:void 0,Sn=En||rt,ee=Sn;var Rn="[object Arguments]",Tn="[object Array]",_n="[object Boolean]",kn="[object Date]",Mn="[object Error]",Fn="[object Function]",Cn="[object Map]",Pn="[object Number]",Bn="[object Object]",Dn="[object RegExp]",qn="[object Set]",Ln="[object String]",In="[object WeakMap]",Nn="[object ArrayBuffer]",jn="[object DataView]",Wn="[object Float32Array]",Vn="[object Float64Array]",Un="[object Int8Array]",Gn="[object Int16Array]",Kn="[object Int32Array]",zn="[object Uint8Array]",Hn="[object Uint8ClampedArray]",Jn="[object Uint16Array]",Qn="[object Uint32Array]",v={};v[Wn]=v[Vn]=v[Un]=v[Gn]=v[Kn]=v[zn]=v[Hn]=v[Jn]=v[Qn]=true;v[Rn]=v[Tn]=v[Nn]=v[_n]=v[jn]=v[kn]=v[Mn]=v[Fn]=v[Cn]=v[Pn]=v[Bn]=v[Dn]=v[qn]=v[Ln]=v[In]=false;function Yn(e){return B(e)&&pe(e.length)&&!!v[P(e)]}var nt=Yn;function Xn(e){return function(r){return e(r)}}var it=Xn;var st=typeof exports=="object"&&exports&&!exports.nodeType&&exports,ke=st&&typeof module=="object"&&module&&!module.nodeType&&module,Zn=ke&&ke.exports===st,dr=Zn&&De.process,ei=(function(){try{var e=ke&&ke.require&&ke.require("util").types;return e||dr&&dr.binding&&dr.binding("util")}catch{}})(),mr=ei;var ft=mr&&mr.isTypedArray,ri=ft?it(ft):nt,me=ri;var ti=Object.prototype,ai=ti.hasOwnProperty;function oi(e,r){var t=S(e),a=!t&&de(e),o=!t&&!a&&ee(e),n=!t&&!a&&!o&&me(e),i=t||a||o||n,s=i?Zr(e.length,String):[],f=s.length;for(var u in e)(r||ai.call(e,u))&&!(i&&(u=="length"||o&&(u=="offset"||u=="parent")||n&&(u=="buffer"||u=="byteLength"||u=="byteOffset")||le(u,f)))&&s.push(u);return s}var lt=oi;function ni(e,r){return function(t){return e(r(t))}}var ut=ni;var ii=ut(Object.keys,Object),pt=ii;var si=Object.prototype,fi=si.hasOwnProperty;function li(e){if(!Ne(e))return pt(e);var r=[];for(var t in Object(e))fi.call(e,t)&&t!="constructor"&&r.push(t);return r}var je=li;function ui(e){return U(e)?lt(e):je(e)}var ce=ui;var pi=/\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/,di=/^\w*$/;function mi(e,r){if(S(e))return  false;var t=typeof e;return t=="number"||t=="symbol"||t=="boolean"||e==null||fe(e)?true:di.test(e)||!pi.test(e)||r!=null&&e in Object(r)}var ge=mi;var ci=M(Object,"create"),N=ci;function gi(){this.__data__=N?N(null):{},this.size=0;}var dt=gi;function yi(e){var r=this.has(e)&&delete this.__data__[e];return this.size-=r?1:0,r}var mt=yi;var hi="__lodash_hash_undefined__",xi=Object.prototype,wi=xi.hasOwnProperty;function bi(e){var r=this.__data__;if(N){var t=r[e];return t===hi?void 0:t}return wi.call(r,e)?r[e]:void 0}var ct=bi;var Oi=Object.prototype,Ai=Oi.hasOwnProperty;function $i(e){var r=this.__data__;return N?r[e]!==void 0:Ai.call(r,e)}var gt=$i;var vi="__lodash_hash_undefined__";function Ei(e,r){var t=this.__data__;return this.size+=this.has(e)?0:1,t[e]=N&&r===void 0?vi:r,this}var yt=Ei;function ye(e){var r=-1,t=e==null?0:e.length;for(this.clear();++r<t;){var a=e[r];this.set(a[0],a[1]);}}ye.prototype.clear=dt;ye.prototype.delete=mt;ye.prototype.get=ct;ye.prototype.has=gt;ye.prototype.set=yt;var cr=ye;function Si(){this.__data__=[],this.size=0;}var ht=Si;function Ri(e,r){for(var t=e.length;t--;)if(ue(e[t][0],r))return t;return  -1}var G=Ri;var Ti=Array.prototype,_i=Ti.splice;function ki(e){var r=this.__data__,t=G(r,e);if(t<0)return  false;var a=r.length-1;return t==a?r.pop():_i.call(r,t,1),--this.size,true}var xt=ki;function Mi(e){var r=this.__data__,t=G(r,e);return t<0?void 0:r[t][1]}var wt=Mi;function Fi(e){return G(this.__data__,e)>-1}var bt=Fi;function Ci(e,r){var t=this.__data__,a=G(t,e);return a<0?(++this.size,t.push([e,r])):t[a][1]=r,this}var Ot=Ci;function he(e){var r=-1,t=e==null?0:e.length;for(this.clear();++r<t;){var a=e[r];this.set(a[0],a[1]);}}he.prototype.clear=ht;he.prototype.delete=xt;he.prototype.get=wt;he.prototype.has=bt;he.prototype.set=Ot;var K=he;var Pi=M(R,"Map"),z=Pi;function Bi(){this.size=0,this.__data__={hash:new cr,map:new(z||K),string:new cr};}var At=Bi;function Di(e){var r=typeof e;return r=="string"||r=="number"||r=="symbol"||r=="boolean"?e!=="__proto__":e===null}var $t=Di;function qi(e,r){var t=e.__data__;return $t(r)?t[typeof r=="string"?"string":"hash"]:t.map}var H=qi;function Li(e){var r=H(this,e).delete(e);return this.size-=r?1:0,r}var vt=Li;function Ii(e){return H(this,e).get(e)}var Et=Ii;function Ni(e){return H(this,e).has(e)}var St=Ni;function ji(e,r){var t=H(this,e),a=t.size;return t.set(e,r),this.size+=t.size==a?0:1,this}var Rt=ji;function xe(e){var r=-1,t=e==null?0:e.length;for(this.clear();++r<t;){var a=e[r];this.set(a[0],a[1]);}}xe.prototype.clear=At;xe.prototype.delete=vt;xe.prototype.get=Et;xe.prototype.has=St;xe.prototype.set=Rt;var re=xe;var Wi="Expected a function";function gr(e,r){if(typeof e!="function"||r!=null&&typeof r!="function")throw new TypeError(Wi);var t=function(){var a=arguments,o=r?r.apply(this,a):a[0],n=t.cache;if(n.has(o))return n.get(o);var i=e.apply(this,a);return t.cache=n.set(o,i)||n,i};return t.cache=new(gr.Cache||re),t}gr.Cache=re;var Tt=gr;var Vi=500;function Ui(e){var r=Tt(e,function(a){return t.size===Vi&&t.clear(),a}),t=r.cache;return r}var _t=Ui;var Gi=/[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g,Ki=/\\(\\)?/g,zi=_t(function(e){var r=[];return e.charCodeAt(0)===46&&r.push(""),e.replace(Gi,function(t,a,o,n){r.push(o?n.replace(Ki,"$1"):a||t);}),r}),kt=zi;function Hi(e){return e==null?"":Gr(e)}var Mt=Hi;function Ji(e,r){return S(e)?e:ge(e,r)?[e]:kt(Mt(e))}var We=Ji;function Yi(e){if(typeof e=="string"||fe(e))return e;var r=e+"";return r=="0"&&1/e==-Infinity?"-0":r}var J=Yi;function Xi(e,r){r=We(r,e);for(var t=0,a=r.length;e!=null&&t<a;)e=e[J(r[t++])];return t&&t==a?e:void 0}var Ve=Xi;function Zi(e,r,t){var a=e==null?void 0:Ve(e,r);return a===void 0?t:a}var A=Zi;function es(e,r){for(var t=-1,a=r.length,o=e.length;++t<a;)e[o+t]=r[t];return e}var Ft=es;function rs(){this.__data__=new K,this.size=0;}var Ct=rs;function ts(e){var r=this.__data__,t=r.delete(e);return this.size=r.size,t}var Pt=ts;function as(e){return this.__data__.get(e)}var Bt=as;function os(e){return this.__data__.has(e)}var Dt=os;var ns=200;function is(e,r){var t=this.__data__;if(t instanceof K){var a=t.__data__;if(!z||a.length<ns-1)return a.push([e,r]),this.size=++t.size,this;t=this.__data__=new re(a);}return t.set(e,r),this.size=t.size,this}var qt=is;function we(e){var r=this.__data__=new K(e);this.size=r.size;}we.prototype.clear=Ct;we.prototype.delete=Pt;we.prototype.get=Bt;we.prototype.has=Dt;we.prototype.set=qt;var be=we;function ss(e,r){for(var t=-1,a=e==null?0:e.length,o=0,n=[];++t<a;){var i=e[t];r(i,t,e)&&(n[o++]=i);}return n}var Lt=ss;function fs(){return []}var It=fs;var ls=Object.prototype,us=ls.propertyIsEnumerable,Nt=Object.getOwnPropertySymbols,ps=Nt?function(e){return e==null?[]:(e=Object(e),Lt(Nt(e),function(r){return us.call(e,r)}))}:It,jt=ps;function ds(e,r,t){var a=r(e);return S(e)?a:Ft(a,t(e))}var Wt=ds;function ms(e){return Wt(e,ce,jt)}var yr=ms;var cs=M(R,"DataView"),Ue=cs;var gs=M(R,"Promise"),Ge=gs;var ys=M(R,"Set"),Ke=ys;var Vt="[object Map]",hs="[object Object]",Ut="[object Promise]",Gt="[object Set]",Kt="[object WeakMap]",zt="[object DataView]",xs=I(Ue),ws=I(z),bs=I(Ge),Os=I(Ke),As=I(Ie),te=P;(Ue&&te(new Ue(new ArrayBuffer(1)))!=zt||z&&te(new z)!=Vt||Ge&&te(Ge.resolve())!=Ut||Ke&&te(new Ke)!=Gt||Ie&&te(new Ie)!=Kt)&&(te=function(e){var r=P(e),t=r==hs?e.constructor:void 0,a=t?I(t):"";if(a)switch(a){case xs:return zt;case ws:return Vt;case bs:return Ut;case Os:return Gt;case As:return Kt}return r});var Me=te;var $s=R.Uint8Array,hr=$s;var vs="__lodash_hash_undefined__";function Es(e){return this.__data__.set(e,vs),this}var Ht=Es;function Ss(e){return this.__data__.has(e)}var Jt=Ss;function ze(e){var r=-1,t=e==null?0:e.length;for(this.__data__=new re;++r<t;)this.add(e[r]);}ze.prototype.add=ze.prototype.push=Ht;ze.prototype.has=Jt;var Qt=ze;function Rs(e,r){for(var t=-1,a=e==null?0:e.length;++t<a;)if(r(e[t],t,e))return  true;return  false}var He=Rs;function Ts(e,r){return e.has(r)}var Yt=Ts;var _s=1,ks=2;function Ms(e,r,t,a,o,n){var i=t&_s,s=e.length,f=r.length;if(s!=f&&!(i&&f>s))return  false;var u=n.get(e),p=n.get(r);if(u&&p)return u==r&&p==e;var c=-1,d=true,b=t&ks?new Qt:void 0;for(n.set(e,r),n.set(r,e);++c<s;){var x=e[c],O=r[c];if(a)var E=i?a(O,x,c,r,e,n):a(x,O,c,e,r,n);if(E!==void 0){if(E)continue;d=false;break}if(b){if(!He(r,function(T,F){if(!Yt(b,F)&&(x===T||o(x,T,t,a,n)))return b.push(F)})){d=false;break}}else if(!(x===O||o(x,O,t,a,n))){d=false;break}}return n.delete(e),n.delete(r),d}var Je=Ms;function Fs(e){var r=-1,t=Array(e.size);return e.forEach(function(a,o){t[++r]=[o,a];}),t}var Xt=Fs;function Cs(e){var r=-1,t=Array(e.size);return e.forEach(function(a){t[++r]=a;}),t}var Zt=Cs;var Ps=1,Bs=2,Ds="[object Boolean]",qs="[object Date]",Ls="[object Error]",Is="[object Map]",Ns="[object Number]",js="[object RegExp]",Ws="[object Set]",Vs="[object String]",Us="[object Symbol]",Gs="[object ArrayBuffer]",Ks="[object DataView]",ea=C?C.prototype:void 0,xr=ea?ea.valueOf:void 0;function zs(e,r,t,a,o,n,i){switch(t){case Ks:if(e.byteLength!=r.byteLength||e.byteOffset!=r.byteOffset)return  false;e=e.buffer,r=r.buffer;case Gs:return !(e.byteLength!=r.byteLength||!n(new hr(e),new hr(r)));case Ds:case qs:case Ns:return ue(+e,+r);case Ls:return e.name==r.name&&e.message==r.message;case js:case Vs:return e==r+"";case Is:var s=Xt;case Ws:var f=a&Ps;if(s||(s=Zt),e.size!=r.size&&!f)return  false;var u=i.get(e);if(u)return u==r;a|=Bs,i.set(e,r);var p=Je(s(e),s(r),a,o,n,i);return i.delete(e),p;case Us:if(xr)return xr.call(e)==xr.call(r)}return  false}var ra=zs;var Hs=1,Js=Object.prototype,Qs=Js.hasOwnProperty;function Ys(e,r,t,a,o,n){var i=t&Hs,s=yr(e),f=s.length,u=yr(r),p=u.length;if(f!=p&&!i)return  false;for(var c=f;c--;){var d=s[c];if(!(i?d in r:Qs.call(r,d)))return  false}var b=n.get(e),x=n.get(r);if(b&&x)return b==r&&x==e;var O=true;n.set(e,r),n.set(r,e);for(var E=i;++c<f;){d=s[c];var T=e[d],F=r[d];if(a)var k=i?a(F,T,d,r,e,n):a(T,F,d,e,r,n);if(!(k===void 0?T===F||o(T,F,t,a,n):k)){O=false;break}E||(E=d=="constructor");}if(O&&!E){var ie=e.constructor,se=r.constructor;ie!=se&&"constructor"in e&&"constructor"in r&&!(typeof ie=="function"&&ie instanceof ie&&typeof se=="function"&&se instanceof se)&&(O=false);}return n.delete(e),n.delete(r),O}var ta=Ys;var Xs=1,aa="[object Arguments]",oa="[object Array]",Qe="[object Object]",Zs=Object.prototype,na=Zs.hasOwnProperty;function ef(e,r,t,a,o,n){var i=S(e),s=S(r),f=i?oa:Me(e),u=s?oa:Me(r);f=f==aa?Qe:f,u=u==aa?Qe:u;var p=f==Qe,c=u==Qe,d=f==u;if(d&&ee(e)){if(!ee(r))return  false;i=true,p=false;}if(d&&!p)return n||(n=new be),i||me(e)?Je(e,r,t,a,o,n):ra(e,r,f,t,a,o,n);if(!(t&Xs)){var b=p&&na.call(e,"__wrapped__"),x=c&&na.call(r,"__wrapped__");if(b||x){var O=b?e.value():e,E=x?r.value():r;return n||(n=new be),o(O,E,t,a,n)}}return d?(n||(n=new be),ta(e,r,t,a,o,n)):false}var ia=ef;function sa(e,r,t,a,o){return e===r?true:e==null||r==null||!B(e)&&!B(r)?e!==e&&r!==r:ia(e,r,t,a,sa,o)}var Ye=sa;var rf=1,tf=2;function af(e,r,t,a){var o=t.length,n=o,i=!a;if(e==null)return !n;for(e=Object(e);o--;){var s=t[o];if(i&&s[2]?s[1]!==e[s[0]]:!(s[0]in e))return  false}for(;++o<n;){s=t[o];var f=s[0],u=e[f],p=s[1];if(i&&s[2]){if(u===void 0&&!(f in e))return  false}else {var c=new be;if(a)var d=a(u,p,f,e,r,c);if(!(d===void 0?Ye(p,u,rf|tf,a,c):d))return  false}}return  true}var fa=af;function of(e){return e===e&&!D(e)}var Xe=of;function nf(e){for(var r=ce(e),t=r.length;t--;){var a=r[t],o=e[a];r[t]=[a,o,Xe(o)];}return r}var la=nf;function sf(e,r){return function(t){return t==null?false:t[e]===r&&(r!==void 0||e in Object(t))}}var Ze=sf;function ff(e){var r=la(e);return r.length==1&&r[0][2]?Ze(r[0][0],r[0][1]):function(t){return t===e||fa(t,e,r)}}var ua=ff;function lf(e,r){return e!=null&&r in Object(e)}var pa=lf;function uf(e,r,t){r=We(r,e);for(var a=-1,o=r.length,n=false;++a<o;){var i=J(r[a]);if(!(n=e!=null&&t(e,i)))break;e=e[i];}return n||++a!=o?n:(o=e==null?0:e.length,!!o&&pe(o)&&le(i,o)&&(S(e)||de(e)))}var da=uf;function pf(e,r){return e!=null&&da(e,r,pa)}var ma=pf;var df=1,mf=2;function cf(e,r){return ge(e)&&Xe(r)?Ze(J(e),r):function(t){var a=A(t,e);return a===void 0&&a===r?ma(t,e):Ye(r,a,df|mf)}}var ca=cf;function gf(e){return function(r){return r?.[e]}}var ga=gf;function yf(e){return function(r){return Ve(r,e)}}var ya=yf;function hf(e){return ge(e)?ga(J(e)):ya(e)}var ha=hf;function xf(e){return typeof e=="function"?e:e==null?Kr:typeof e=="object"?S(e)?ca(e[0],e[1]):ua(e):ha(e)}var er=xf;function wf(e,r,t,a){for(var o=-1,n=e==null?0:e.length;++o<n;){var i=e[o];r(a,i,t(i),e);}return a}var xa=wf;function bf(e){return function(r,t,a){for(var o=-1,n=Object(r),i=a(r),s=i.length;s--;){var f=i[e?s:++o];if(t(n[f],f,n)===false)break}return r}}var wa=bf;var Of=wa(),ba=Of;function Af(e,r){return e&&ba(e,r,ce)}var Oa=Af;function $f(e,r){return function(t,a){if(t==null)return t;if(!U(t))return e(t,a);for(var o=t.length,n=r?o:-1,i=Object(t);(r?n--:++n<o)&&a(i[n],n,i)!==false;);return t}}var Aa=$f;var vf=Aa(Oa),rr=vf;function Ef(e,r,t,a){return rr(e,function(o,n,i){r(a,o,t(o),i);}),a}var $a=Ef;function Sf(e,r){return function(t,a){var o=S(t)?xa:$a,n=r?r():{};return o(t,e,er(a),n)}}var va=Sf;var Rf=Object.prototype,Tf=Rf.hasOwnProperty,_f=va(function(e,r,t){Tf.call(e,t)?e[t].push(r):Yr(e,t,[r]);}),wr=_f;var kf="[object Map]",Mf="[object Set]",Ff=Object.prototype,Cf=Ff.hasOwnProperty;function Pf(e){if(e==null)return  true;if(U(e)&&(S(e)||typeof e=="string"||typeof e.splice=="function"||ee(e)||me(e)||de(e)))return !e.length;var r=Me(e);if(r==kf||r==Mf)return !e.size;if(Ne(e))return !je(e).length;for(var t in e)if(Cf.call(e,t))return  false;return  true}var tr=Pf;function Bf(e,r){var t;return rr(e,function(a,o,n){return t=r(a,o,n),!t}),!!t}var Ea=Bf;function Df(e,r,t){var a=S(e)?He:Ea;return t&&Xr(e,r,t)&&(r=void 0),a(e,er(r))}var br=Df;var l={equals:"equals",notEquals:"notEquals",lessThan:"lessThan",lessThanEquals:"lessThanEquals",greaterThan:"greaterThan",greaterThanEquals:"greaterThanEquals",contains:"contains",notContains:"notContains",in:"in",notIn:"notIn",matches:"matches",notMatches:"notMatches",between:"between",notBetween:"notBetween",isEmpty:"isEmpty",notEmpty:"notEmpty",exists:"exists",notExists:"notExists",startsWith:"startsWith",endsWith:"endsWith"},m={all:"all",any:"any",none:"none",atLeast:"atLeast",atMost:"atMost",exactly:"exactly",empty:"empty",notEmpty:"notEmpty"},y={before:"before",after:"after",onOrBefore:"onOrBefore",onOrAfter:"onOrAfter",between:"between",notBetween:"notBetween",dayIn:"dayIn",dayNotIn:"dayNotIn"};j__default.default.extend(Nf__default.default);j__default.default.extend(If__default.default);j__default.default.extend(Lf__default.default);j__default.default.extend(qf__default.default);var Sa=(e,r,t)=>{let a=A(r,e.field);if(!a)throw new Error(`${e.field} is null or undefined`);if(!Ar(a))throw new Error(`${e.field} is not a valid date: ${String(a)}`);let o=j__default.default(a);if(!o.isValid())throw new Error(`${e.field} is not a valid date: ${a}`);let n=u=>e.error||`${e.field} ${u}`,i=jf(e,r,t,o,a),s=i[0],f=i[1];switch(e.dateOperator){case y.before:return o.isBefore(s)||n(`must be before ${s.format()}`);case y.after:return o.isAfter(s)||n(`must be after ${s.format()}`);case y.onOrBefore:return o.isSameOrBefore(s)||n(`must be on or before ${s.format()}`);case y.onOrAfter:return o.isSameOrAfter(s)||n(`must be on or after ${s.format()}`);case y.between:{if(!f)throw new Error("between operator requires an end date");return o.isSameOrAfter(s)&&o.isSameOrBefore(f)||n(`must be between ${s.format()} and ${f?.format()}`)}case y.notBetween:{if(!f)throw new Error("notBetween operator requires an end date");return o.isBefore(s)||o.isAfter(f)||n(`must not be between ${s.format()} and ${f?.format()}`)}case y.dayIn:{if(!Array.isArray(e.value))throw new Error("dayIn operator requires an array of day names");let u=o.format("dddd").toLowerCase(),p=e.value.map(c=>String(c).toLowerCase());return p.includes(u)||n(`must be on ${p.join(" or ")}`)}case y.dayNotIn:{if(!Array.isArray(e.value))throw new Error("dayNotIn operator requires an array of day names");let u=o.format("dddd").toLowerCase(),p=e.value.map(c=>String(c).toLowerCase());return !p.includes(u)||n(`must not be on ${p.join(" or ")}`)}default:throw new Error("Unknown date operator")}},jf=(e,r,t,a,o)=>{if([y.between,y.notBetween].includes(e.dateOperator)){if(!Array.isArray(e.value)||e.value.length!==2)throw new Error(`${e.dateOperator} operator requires an array of two dates`);let[s,f]=e.value,u=Or(s,o),p=Or(f,o);if(!u.isValid())throw new Error(`Invalid start date: ${e.value[0]}`);if(!p.isValid())throw new Error(`Invalid end date: ${e.value[1]}`);let[c,d]=u.isBefore(p)||u.isSame(p)?[u,p]:[p,u];return [c,d]}if([y.before,y.after,y.onOrBefore,y.onOrAfter].includes(e.dateOperator)){let s;if(e.value!==void 0){if(Array.isArray(e.value))throw new Error(`${e.dateOperator} operator requires a single date value`);s=e.value;}else if(e.path)if(e.path.startsWith("$.")){let u=A(r,e.path.substring(2));s=Ar(u)?u:void 0;}else {let u=A(t,e.path);s=Ar(u)?u:void 0;}else throw new Error("No value or path specified for date comparison");let f=Or(s,o);if(!f.isValid())throw new Error(`Invalid comparison date: ${s}`);return [f,void 0]}return [j__default.default(),void 0]},Or=(e,r)=>{let t=String(e);if(t.includes("Z")||t.includes("T")&&(t.includes("+")||t.match(/T.*-\d{2}:/)))return j__default.default(e);let o=String(r),n=0;if(o.includes("+")||o.includes("T")&&o.match(/T.*-\d{2}:/)){let s=o.match(/([+-])(\d{2}):(\d{2})/);s&&(n=(s[1]==="+"?1:-1)*(parseInt(s[2],10)*60+parseInt(s[3],10)));}else o.includes("Z")||(n=0);return t.match(/^\d{4}-\d{2}-\d{2}$/)?j__default.default(`${e}T00:00:00`).subtract(n,"minute"):j__default.default(e).subtract(n,"minute")},Ar=e=>typeof e=="string"||typeof e=="number"||e instanceof Date;var ka=(e,r,t)=>{let a=A(r,e.field),n=![l.isEmpty,l.notEmpty,l.exists,l.notExists].includes(e.operator),i=n?Wf(e,r,t):void 0,s=f=>e.error||`${e.field} ${f}${n?` ${JSON.stringify(i)}`:""}`;switch(e.operator){case l.equals:return a===i||s("must equal");case l.notEquals:return a!==i||s("must not equal");case l.lessThan:return ar(a,i,"lt")||s("must be less than");case l.lessThanEquals:return ar(a,i,"lte")||s("must be less than or equal to");case l.greaterThan:return ar(a,i,"gt")||s("must be greater than");case l.greaterThanEquals:return ar(a,i,"gte")||s("must be greater than or equal to");case l.in:return Array.isArray(i)&&i.includes(a)||s("must be one of");case l.notIn:return !Array.isArray(i)||!i.includes(a)||s("must not be one of");case l.contains:return _a(a,i)||s("must contain");case l.notContains:return !_a(a,i)||s("must not contain");case l.matches:return Ra(a)&&(i instanceof RegExp||typeof i=="string")&&!!a.match(i)||s("must match pattern");case l.notMatches:return !Ra(a)||!(i instanceof RegExp||typeof i=="string")||!a.match(i)||s("must not match pattern");case l.between:{let f=Ta(i);if(!f)throw new Error("between operator requires an array of two values");if(!Oe(a))return s("must be between");let u=Ae(a),[p,c]=f;return u>=p&&u<=c||s("must be between")}case l.notBetween:{let f=Ta(i);if(!f)throw new Error("notBetween operator requires an array of two values");if(!Oe(a))return  true;let u=Ae(a),[p,c]=f;return u<p||u>c||s("must not be between")}case l.isEmpty:return tr(a)||s("must be empty");case l.notEmpty:return !tr(a)||s("must not be empty");case l.exists:return a!==void 0||s("must exist");case l.notExists:return a===void 0||s("must not exist");case l.startsWith:return typeof a=="string"&&typeof i=="string"&&a.startsWith(i)||s("must start with");case l.endsWith:return typeof a=="string"&&typeof i=="string"&&a.endsWith(i)||s("must end with");default:throw new Error("Unknown operator")}},Wf=(e,r,t)=>{if(e.value!==void 0)return e.value;if(e.path)return e.path.startsWith("$.")?A(r,e.path.substring(2)):A(t,e.path);throw new Error("No value or path specified")},Oe=e=>typeof e=="string"||typeof e=="number"||e instanceof Date,Ae=e=>e instanceof Date?e.getTime():e,ar=(e,r,t)=>{if(!Oe(e)||!Oe(r))return  false;let a=Ae(e),o=Ae(r);switch(t){case "lt":return a<o;case "lte":return a<=o;case "gt":return a>o;case "gte":return a>=o}},Ra=e=>typeof e=="string",Ta=e=>{if(!Array.isArray(e)||e.length!==2)return null;let[r,t]=e;if(!Oe(r)||!Oe(t))return null;let a=Ae(r),o=Ae(t);return a<=o?[a,o]:[o,a]},_a=(e,r)=>typeof e=="string"?typeof r=="string"&&e.includes(r):Array.isArray(e)?e.includes(r):false;var $r=e=>{if(typeof e!="boolean"){if("all"in e){for(let r of e.all)$r(r);return}if("any"in e){for(let r of e.any)$r(r);return}if(!("arrayOperator"in e&&!("field"in e)))throw new Error("check: when data is an array, every leaf must be a fieldless arrayOperator (composable with all/any)")}},ae=(e,r,t)=>{if(Array.isArray(r)&&$r(e),typeof e=="boolean")return e;let a={...t,context:t?.context??r};return "all"in e?Vf(e.all,r,a,e.error):"any"in e?Uf(e.any,r,a,e.error):"arrayOperator"in e?zf(e,r,a):"dateOperator"in e?Sa(e,r,a.context):"aggregate"in e?Kf(e,r,a):"field"in e?ka(e,r,a.context):"if"in e?Gf(e,r,a):false},Vf=(e,r,t,a)=>{let o=[];for(let n of e){let i=ae(n,r,t);i!==true&&(typeof i=="string"?o.push(i):o.push("false"));}return o.length?a||(o.length===1?o[0]:`All conditions must pass: ${o.join(" AND ")}`):true},Uf=(e,r,t,a)=>{let o=[];for(let n of e){let i=ae(n,r,t);if(i===true)return  true;typeof i=="string"&&o.push(i);}return a||(o.length===1?o[0]:`At least one condition must pass: ${o.join(" OR ")}`)},Gf=(e,r,t)=>ae(e.if,r,t)===true?ae(e.then,r,t):e.else!==void 0?ae(e.else,r,t):true,Kf=(e,r,t)=>{let a=A(r,e.field);if(!Array.isArray(a))throw new Error(`${e.field} must be an array`);let{mode:o,field:n}=e.aggregate;if(o!=="sum"&&o!=="avg")return e.error||`${e.field} aggregate.mode must be 'sum' or 'avg'`;let i=e.condition,f=(i?a.filter(x=>ae(i,x,t)===true):a).map((x,O)=>{let E=n?A(x,n):x;if(typeof E!="number"||!Number.isFinite(E)){let T=`${e.field}[${O}]${n?`.${n}`:""}`;throw new Error(`${T} must be a finite number`)}return E}),u=f.reduce((x,O)=>x+O,0),p=o==="sum"?u:f.length===0?0:u/f.length,c=t.context,d;if(e.value!==void 0)d=e.value;else if(e.path)d=e.path.startsWith("$.")?A(r,e.path.substring(2)):A(c,e.path);else throw new Error("Aggregate rule requires value or path");let b=x=>e.error||`${e.field} ${o} ${x} ${JSON.stringify(d)}`;switch(e.operator){case l.equals:return p===d||b("must equal");case l.notEquals:return p!==d||b("must not equal");case l.lessThan:return typeof d=="number"&&p<d||b("must be less than");case l.lessThanEquals:return typeof d=="number"&&p<=d||b("must be less than or equal to");case l.greaterThan:return typeof d=="number"&&p>d||b("must be greater than");case l.greaterThanEquals:return typeof d=="number"&&p>=d||b("must be greater than or equal to");case l.between:{if(!Array.isArray(d)||d.length!==2)throw new Error("between requires a two-element array");let[x,O]=d,[E,T]=x<=O?[x,O]:[O,x];return p>=E&&p<=T||b("must be between")}case l.notBetween:{if(!Array.isArray(d)||d.length!==2)throw new Error("notBetween requires a two-element array");let[x,O]=d,[E,T]=x<=O?[x,O]:[O,x];return p<E||p>T||b("must not be between")}default:throw new Error(`Operator '${e.operator}' is not supported for aggregate rules`)}},zf=(e,r,t)=>{let a=e.field?A(r,e.field):r;if(!Array.isArray(a))throw new Error(`${e.field||"(root)"} must be an array`);let o=c=>e.error||`${e.field} ${c}`,n=[m.all,m.any,m.none,m.atLeast,m.atMost,m.exactly],i=[m.atLeast,m.atMost,m.exactly],s=e.condition;if(n.includes(e.arrayOperator)&&!s)throw new Error(`${e.arrayOperator} requires a condition to check against array elements`);let f=e.count;if(i.includes(e.arrayOperator)&&f===void 0)throw new Error(`${e.arrayOperator} requires a count`);let u=0,p=0;if(n.includes(e.arrayOperator)){if(!s)throw new Error(`${e.arrayOperator} requires a condition to check against array elements`);if(!br(a,D))return o("contains only primitive values; use 'in' or 'contains' instead of array operators on primitive arrays");let c=a.map(d=>ae(s,d,t));u=c.filter(d=>d===true).length,p=c.filter(d=>typeof d=="string").length;}switch(e.arrayOperator){case m.empty:return !a.length||o("must be empty");case m.notEmpty:return !!a.length||o("must not be empty");case m.all:return u===a.length||o(`all elements must match (${p} failed)`);case m.any:return !!u||o("at least one element must match");case m.none:return !u||o(`no elements should match (${u} matched)`);case m.atLeast:if(f===void 0)throw new Error(`${e.arrayOperator} requires a count`);return u>=f||o(`at least ${f} elements must match (${u} matched)`);case m.atMost:if(f===void 0)throw new Error(`${e.arrayOperator} requires a count`);return u<=f||o(`at most ${f} elements must match (${u} matched)`);case m.exactly:if(f===void 0)throw new Error(`${e.arrayOperator} requires a count`);return u===f||o(`exactly ${f} elements must match (${u} matched)`);default:throw new Error(`Unknown array operator: ${e.arrayOperator}`)}};var Ma=(e,r,t,a)=>{let o={};for(let n of e){let i=n[r];if(i==null)continue;let s=String(i);if(o[s]!==void 0){let f=a==="one"?`endpoint[0] must be the "one" side of a oneToMany bridge \u2014 swap endpoints if '${t}' is the "many" side`:`oneToOne bridges require unique '${r}' on both endpoints`;throw new Error(`buildBridgeDictionary: duplicate '${r}' value '${s}' on '${t}' \u2014 ${f}.`)}o[s]=n;}return o},Hf=(e,r)=>{let t={};for(let a of e.bridges??[]){let[o,n]=a.endpoints,i=`${o.fieldMap}:${o.model}`,s=`${n.fieldMap}:${n.model}`,f=a.cardinality==="oneToMany"?"one":"oneToOne";if(r[i]&&(t[o.fieldMap]??={},t[o.fieldMap][o.model]??={},t[o.fieldMap][o.model][o.on]=Ma(r[i],o.on,i,f)),r[s])if(t[n.fieldMap]??={},t[n.fieldMap][n.model]??={},a.cardinality==="oneToMany"){let u=r[s].filter(p=>p[n.on]!==null&&p[n.on]!==void 0);t[n.fieldMap][n.model][n.on]=wr(u,n.on);}else t[n.fieldMap][n.model][n.on]=Ma(r[s],n.on,s,"oneToOne");}return t};var vr=e=>{let r={maps:structuredClone(e.maps),bridges:e.bridges?structuredClone(e.bridges):void 0};for(let t of e.bridges??[]){let[a,o]=t.endpoints,n=r.maps[a.fieldMap]?.[a.model],i=r.maps[o.fieldMap]?.[o.model];if(!n)throw new Error(`stitchFieldMaps: endpoint '${a.fieldMap}:${a.model}' not found`);if(!i)throw new Error(`stitchFieldMaps: endpoint '${o.fieldMap}:${o.model}' not found`);if(a.fieldMap===o.fieldMap&&a.model===o.model)throw new Error(`stitchFieldMaps: self-bridge '${a.fieldMap}:${a.model}' to itself is not supported`);if(!n.fields[a.on])throw new Error(`stitchFieldMaps: endpoint '${a.fieldMap}:${a.model}' has no field '${a.on}' for join`);if(!i.fields[o.on])throw new Error(`stitchFieldMaps: endpoint '${o.fieldMap}:${o.model}' has no field '${o.on}' for join`);let s=`${a.fieldMap}:${a.model}`,f=`${o.fieldMap}:${o.model}`;if(n.fields[f])throw new Error(`stitchFieldMaps: bridge '${f}' already injected on '${s}'`);if(i.fields[s])throw new Error(`stitchFieldMaps: bridge '${s}' already injected on '${f}'`);let u=t.cardinality==="oneToMany";n.fields[f]={kind:"bridge",type:f,isList:u},i.fields[s]={kind:"bridge",type:s,isList:false};}return r};var Jf=/[.:]/,Fa=e=>{let r=[];for(let[t,a]of Object.entries(e.maps))for(let[o,n]of Object.entries(a))for(let[i,s]of Object.entries(n.fields))s.kind!=="bridge"&&Jf.test(i)&&r.push(`'${t}:${o}.${i}' contains forbidden character . or :`);if(r.length)throw new Error(`validateFieldMapSet:
+${r.join(`
+`)}`)},Qf=(e,r="fieldMap")=>{Fa({maps:{[r]:e}});};var Ca=e=>"model"in e,$e=e=>{let r=new Set,t=e;for(;!Ca(t);){if(r.has(t))throw new Error("cycle detected in narrowing parent chain");r.add(t),t=t.parent;}return t},ve=e=>{let r=[],t=new Set,a=e;for(;!Ca(a);){if(t.has(a))throw new Error("cycle detected in narrowing parent chain");t.add(a),r.unshift(a),a=a.parent;}return r},oe=(e,r)=>{if(e.kind==="object")return {mapName:r,modelName:e.type};if(e.kind==="bridge"){let[t,a]=e.type.includes(":")?e.type.split(":"):[r,e.type];return {mapName:t,modelName:a}}return null},Er=(e,r,t,a)=>{let o=a.split("."),n=r,i=t;for(let s=0;s<o.length;s++){let f=e.maps[n]?.[i];if(!f)return null;let u=f.fields[o[s]];if(!u)return null;if(s===o.length-1)return {entry:u,mapName:n,modelName:i};let p=oe(u,n);if(!p)return null;n=p.mapName,i=p.modelName;}return null};var Yf=(e,r)=>{let t=ve(r),a=[];for(let o of t)o.constrains!==void 0&&a.push(o.constrains);return a.length?{all:[...a,e]}:e};var Pa=(e,r,t,a,o)=>{let n=e[r];if(n){if(o.picks){let i=new Set(o.picks);for(let s of Object.keys(o.relations??{}))i.add(s);for(let s of Object.keys(n.fields))i.has(s)||delete n.fields[s];}if(o.omits)for(let i of o.omits)delete n.fields[i];for(let[i,s]of Object.entries(o.relations??{})){let f=n.fields[i];if(!f)continue;let u=oe(f,t);if(!u)continue;let p=a.maps[u.mapName];p&&Pa(p,u.modelName,u.mapName,a,s);}}},Sr=e=>{let r=$e(e),t={maps:structuredClone(r.maps),bridges:r.bridges?structuredClone(r.bridges):void 0},a=ve(e);for(let o of a)for(let[n,i]of Object.entries(o.maps)){let s=t.maps[n];if(s)for(let[f,u]of Object.entries(i.models))Pa(s,f,n,t,u);}return t.bridges&&(t.bridges=t.bridges.filter(o=>{let[n,i]=o.endpoints,s=`${i.fieldMap}:${i.model}`,f=`${n.fieldMap}:${n.model}`,u=t.maps[n.fieldMap]?.[n.model]?.fields[s]!==void 0,p=t.maps[i.fieldMap]?.[i.model]?.fields[f]!==void 0;return u&&p})),t};var ne=(e,r,t,a,o)=>{if(typeof e=="boolean")return;if("all"in e){for(let s of e.all)ne(s,r,t,a,o);return}if("any"in e){for(let s of e.any)ne(s,r,t,a,o);return}if("if"in e){ne(e.if,r,t,a,o),ne(e.then,r,t,a,o),e.else!==void 0&&ne(e.else,r,t,a,o);return}let n=t,i=a;if("field"in e&&typeof e.field=="string"&&e.field!==""){let s=Er(r,t,a,e.field);if(!s){o.push({path:e.field,reason:"path does not resolve through the narrowed lens"});return}let f=oe(s.entry,s.mapName);f&&(n=f.mapName,i=f.modelName);}if("aggregate"in e&&typeof e.aggregate=="object"&&e.aggregate!==null&&typeof e.aggregate.field=="string"&&e.aggregate.field!==""){let s=e.aggregate.field;Er(r,n,i,s)||o.push({path:s,reason:"aggregate.field does not resolve through the narrowed lens"});}"condition"in e&&e.condition!==void 0&&ne(e.condition,r,n,i,o);},Rr=(e,r)=>{let t=$e(r),a=Sr(r),o=[];return ne(e,a,t.mapName,t.model,o),{ok:o.length===0,violations:o}};var Xf=e=>({...vr({maps:e.maps,bridges:e.bridges}),mapName:e.mapName,model:e.model});var Ba=(e,r,t,a,o,n,i)=>{e.picks&&e.omits&&i.push(`${n}: cannot specify both picks and omits`);for(let s of e.picks??[]){if(!t[s]){i.push(`${n}.picks: field '${s}' not on model`);continue}for(let f of r){if(f.picks&&!f.picks.includes(s)){i.push(`${n}.picks: '${s}' not in ancestor's picks`);break}if(f.omits?.includes(s)){i.push(`${n}.picks: '${s}' was omitted by ancestor`);break}}}for(let s of e.omits??[]){if(!t[s]){i.push(`${n}.omits: field '${s}' not on model`);continue}for(let f of r)if(f.picks&&!f.picks.includes(s)){i.push(`${n}.omits: '${s}' not in ancestor's picks (already invisible)`);break}}for(let[s,f]of Object.entries(e.relations??{})){let u=t[s];if(!u){i.push(`${n}.relations: '${s}' not on model`);continue}if(u.kind!=="object"&&u.kind!=="bridge"){i.push(`${n}.relations: '${s}' is not a relation (kind=${u.kind})`);continue}let p=oe(u,a);if(!p)continue;let c=o.maps[p.mapName]?.[p.modelName]?.fields;if(!c){i.push(`${n}.relations.${s}: target model not found in lens`);continue}let d=r.map(b=>b.relations?.[s]).filter(b=>b!==void 0);Ba(f,d,c,p.mapName,o,`${n}.relations.${s}`,i);}},Zf=e=>{let r=[],t=$e(e),a=ve(e.parent);for(let[o,n]of Object.entries(e.maps)){let i=t.maps[o];if(!i){r.push(`maps.${o}: not in lens`);continue}for(let[s,f]of Object.entries(n.models)){let u=i[s];if(!u){r.push(`maps.${o}.models.${s}: not in fieldMap`);continue}let p=a.map(c=>c.maps[o]?.models[s]).filter(c=>c!==void 0);Ba(f,p,u.fields,o,t,`maps.${o}.models.${s}`,r);}}if(e.constrains!==void 0){let o=Rr(e.constrains,e);for(let n of o.violations)r.push(`constrains: '${n.path}' ${n.reason}`);}if(r.length)throw new Error(`validateNarrowing:
+${r.join(`
+`)}`)};var el={String:"String",Boolean:"Boolean",Int:"Int",BigInt:"BigInt",Float:"Float",Decimal:"Decimal",DateTime:"DateTime",Json:"Json",Bytes:"Bytes",Enum:"Enum"},rl=["Int","Float","Decimal","BigInt"],Ee=["String",...rl,"DateTime"],Q=["String"],or=["String","Boolean","Int","BigInt","Float","Decimal","DateTime","Enum"],Da=Object.values(el),mh={check:"check",toPrisma:"toPrisma",toSql:"toSql"},$=["check","toPrisma","toSql"],Se=["check","toPrisma"],nr=["check","toSql"],ch={none:"none",scalar:"scalar",ordered:"ordered",array:"array",string:"string",pattern:"pattern",range:"range",dateValue:"dateValue",dateRange:"dateRange",dayList:"dayList",count:"count",predicate:"predicate"},q={[l.equals]:{kinds:or,targets:$,valueShape:"scalar"},[l.notEquals]:{kinds:or,targets:$,valueShape:"scalar"},[l.lessThan]:{kinds:Ee,targets:$,valueShape:"ordered"},[l.lessThanEquals]:{kinds:Ee,targets:$,valueShape:"ordered"},[l.greaterThan]:{kinds:Ee,targets:$,valueShape:"ordered"},[l.greaterThanEquals]:{kinds:Ee,targets:$,valueShape:"ordered"},[l.in]:{kinds:or,targets:$,valueShape:"array"},[l.notIn]:{kinds:or,targets:$,valueShape:"array"},[l.contains]:{kinds:Q,targets:$,valueShape:"string"},[l.notContains]:{kinds:Q,targets:$,valueShape:"string"},[l.startsWith]:{kinds:Q,targets:$,valueShape:"string"},[l.endsWith]:{kinds:Q,targets:$,valueShape:"string"},[l.matches]:{kinds:Q,targets:nr,valueShape:"pattern"},[l.notMatches]:{kinds:Q,targets:nr,valueShape:"pattern"},[l.between]:{kinds:Ee,targets:$,valueShape:"range"},[l.notBetween]:{kinds:Ee,targets:$,valueShape:"range"},[l.isEmpty]:{kinds:Q,targets:$,valueShape:"none"},[l.notEmpty]:{kinds:Q,targets:$,valueShape:"none"},[l.exists]:{kinds:Da,targets:$,valueShape:"none"},[l.notExists]:{kinds:Da,targets:$,valueShape:"none"}},Y={[y.before]:{kinds:["DateTime"],targets:$,valueShape:"dateValue"},[y.after]:{kinds:["DateTime"],targets:$,valueShape:"dateValue"},[y.onOrBefore]:{kinds:["DateTime"],targets:$,valueShape:"dateValue"},[y.onOrAfter]:{kinds:["DateTime"],targets:$,valueShape:"dateValue"},[y.between]:{kinds:["DateTime"],targets:$,valueShape:"dateRange"},[y.notBetween]:{kinds:["DateTime"],targets:$,valueShape:"dateRange"},[y.dayIn]:{kinds:["DateTime"],targets:nr,valueShape:"dayList"},[y.dayNotIn]:{kinds:["DateTime"],targets:nr,valueShape:"dayList"}},X={[m.all]:{targets:Se,valueShape:"predicate"},[m.any]:{targets:Se,valueShape:"predicate"},[m.none]:{targets:Se,valueShape:"predicate"},[m.atLeast]:{targets:Se,valueShape:"count"},[m.atMost]:{targets:Se,valueShape:"count"},[m.exactly]:{targets:Se,valueShape:"count"},[m.empty]:{targets:$,valueShape:"none"},[m.notEmpty]:{targets:$,valueShape:"none"}},tl=new Set(["scalar","ordered"]),al=new Set(["range"]),gh=[l.equals,l.notEquals,l.lessThan,l.lessThanEquals,l.greaterThan,l.greaterThanEquals,l.between,l.notBetween],qa=e=>{let r=q[e];return r?tl.has(r.valueShape):false},La=e=>{let r=q[e];return r?al.has(r.valueShape):false},Tr=e=>{if(Object.hasOwn(q,e))return q[e].valueShape;if(Object.hasOwn(Y,e))return Y[e].valueShape;if(Object.hasOwn(X,e))return X[e].valueShape;throw new Error(`Unknown operator: ${e}`)},ir=(e,r)=>Object.hasOwn(q,e)?q[e].targets.includes(r):Object.hasOwn(Y,e)?Y[e].targets.includes(r):Object.hasOwn(X,e)?X[e].targets.includes(r):false,yh=(e,r)=>{let t=Object.keys(q).filter(o=>{let n=q[o];return !(!n.kinds.includes(e)||r&&!n.targets.includes(r))}),a=Object.keys(Y).filter(o=>{let n=Y[o];return !(!n.kinds.includes(e)||r&&!n.targets.includes(r))});return {field:t,date:a}},hh=e=>Object.keys(X).filter(r=>e?X[r].targets.includes(e):true);var sr=(e,r,t,a)=>{let o=e[r];if(!o)return null;for(let n of Object.values(o.fields))if(n.kind==="object"&&n.type===t&&(n.fromFields?.length??0)>0&&(n.toFields?.length??0)>0&&(a===void 0||n.relationName===a))return n;return null};var L=(e,r)=>{let t=e.split("."),a=r;for(let o=t.length-1;o>=0;o--)a={[t[o]]:a};return a};var Ia,Na=e=>{Ia=e;},ja=(e,r,t)=>{if(!r?.map||!r?.model||!t)throw new Error("Aggregate rules require a FieldMap and model to generate a Prisma plan. Pass { map, model } options to toPrisma().");if(!e.aggregate.field)throw new Error("Prisma aggregate rules require aggregate.field to specify the numeric field on the related model.");if(e.path)throw new Error("path is not supported for Prisma aggregate rules; use value instead.");return nl(e,r,t)},ol=(e,r,t)=>{let a=e.split("."),o=[],n=t;for(let i=0;i<a.length;i++){let s=a[i],f=r[n]?.fields[s];if(!f||f.kind!=="object")throw new Error(`Field '${s}' is not a relation in model '${n}'. Prisma aggregate rules only support relation fields.`);if(i===a.length-1){if(!f.isList)throw new Error(`Field '${s}' is not a list relation in model '${n}'.`);return {segments:a,intermediateRelations:o,terminalModel:n,terminalEntry:f}}if(f.isList)throw new Error(`Intermediate field '${s}' in path '${e}' is a list relation. Only the final segment can be a list relation for aggregate rules.`);o.push({fieldName:s,entry:f,onModel:n}),n=f.type;}throw new Error(`Field path '${e}' did not terminate at a list relation.`)},nl=(e,r,t)=>{let{map:a,model:o}=r,{intermediateRelations:n,terminalModel:i,terminalEntry:s}=ol(e.field,a,o),f=s.type,u=e.aggregate.field??"",p=a[f]?.fields[u];if(!p)throw new Error(`aggregate.field '${u}' does not exist on model '${f}'.`);if(p.kind!=="scalar")throw new Error(`aggregate.field '${u}' on model '${f}' must be a scalar field, got '${p.kind}'.`);if(p.type==="Json")throw new Error(`aggregate.field '${u}' on model '${f}' is a Json field \u2014 aggregate rules require a numeric scalar.`);let c,d;if(s.fromFields&&s.fromFields.length>0){if(s.fromFields.length>1)throw new Error("Aggregate rules do not support composite FK relations.");c=s.toFields?.[0]??"id",d=s.fromFields[0];}else {let k=sr(a,f,i,s.relationName);if(!k)throw new Error(`Cannot determine FK relationship between '${i}' and '${f}'. Ensure the FieldMap contains both sides of the relation.`);if((k.fromFields?.length??0)>1)throw new Error("Aggregate rules do not support composite FK relations.");c=k.fromFields?.[0]??"",d=k.toFields?.[0]??"";}let b=e.condition?Ia(e.condition,{...r,model:f},t):{},x=e.aggregate.mode==="sum"?"_sum":"_avg",O={[u]:{[x]:il(e)}},E={operation:"groupBy",model:f,args:{by:[c],where:b,having:O},extract:c},T=t.steps.length;t.steps.push(E);let F={__step:T};if(n.length>0){let k={[d]:{in:F}},ie=n.map(se=>se.fieldName).join(".");return L(ie,k)}return {[d]:{in:F}}},il=e=>{let r=e.value;switch(e.operator){case l.equals:return {equals:r};case l.notEquals:return {not:r};case l.lessThan:return {lt:r};case l.lessThanEquals:return {lte:r};case l.greaterThan:return {gt:r};case l.greaterThanEquals:return {gte:r};case l.between:{if(!Array.isArray(r)||r.length!==2)throw new Error("between requires two values");let[t,a]=r,[o,n]=t<=a?[t,a]:[a,t];return {gte:o,lte:n}}case l.notBetween:throw new Error("Operator 'notBetween' is not supported for Prisma aggregate rules.");default:throw new Error(`Operator '${e.operator}' is not supported for Prisma aggregate rules.`)}};var Wa=(e,r,t,a)=>{let{map:o,model:n}=r;if(!e.field)throw new Error("toPrisma: count-based ArrayRule requires a field path");let i=o[n]?.fields[e.field];if(!i||i.kind!=="object")throw new Error(`Field '${e.field}' is not a relation in model '${n}'. Count operators require a relation field.`);if(!i.isList)throw new Error(`Field '${e.field}' is not a list relation in model '${n}'. Count operators only apply to one-to-many or many-to-many relations.`);let s=i.type,f,u;if(i.fromFields&&i.fromFields.length>0){if(i.fromFields.length>1)throw new Error(`Count operators (atLeast/atMost/exactly) do not support composite FK relations ('${n}.${e.field}'). Use prisma.$queryRaw for composite FK count filtering.`);f=i.toFields?.[0]??"id",u=i.fromFields[0];}else {let E=sr(o,s,n,i.relationName);if(!E){let F=Object.values(o[s]?.fields??{}).some(k=>k.kind==="object"&&k.type===n&&k.isList&&!k.fromFields?.length);throw new Error(F?`'${n}.${e.field}' is an implicit many-to-many relation. Count operators require an explicit join model with a FK \u2014 convert to an explicit @relation or use prisma.$queryRaw.`:`Cannot determine FK relationship between '${n}' and '${s}'. Ensure the FieldMap contains both sides of the relation.`)}if((E.fromFields?.length??0)>1)throw new Error(`Count operators (atLeast/atMost/exactly) do not support composite FK relations ('${n}.${e.field}'). Use prisma.$queryRaw for composite FK count filtering.`);f=E.fromFields?.[0]??"",u=E.toFields?.[0]??"";}let p=e.condition?a(e.condition,{...r,model:s},t):{},c=e.count??1,d=sl(e.arrayOperator,c,f),b={operation:"groupBy",model:s,args:{by:[f],where:p,having:d},extract:f},x=t.steps.length;t.steps.push(b);let O={__step:x};return {[u]:{in:O}}},sl=(e,r,t)=>{switch(e){case m.atLeast:return {[t]:{_count:{gte:r}}};case m.atMost:return {[t]:{_count:{lte:r}}};case m.exactly:return {[t]:{_count:{equals:r}}};default:throw new Error("unreachable")}};var Fe,Va=e=>{Fe=e;},Ua=(e,r,t)=>{if(e.arrayOperator===m.atLeast||e.arrayOperator===m.atMost||e.arrayOperator===m.exactly){if(r?.map&&r?.model&&t)return Wa(e,r,t,Fe);throw new Error(`ArrayOperator '${e.arrayOperator}' requires a FieldMap and model to generate a multi-step plan. Pass { map, model } options to toPrisma(). Without them, use prisma.$queryRaw for count-based relation filtering.`)}if(!e.field)throw new Error("toPrisma: ArrayRule.field is required (fieldless arrayOps are check-only)");let a=ul(e,r,t);return L(e.field,a)},fl=(e,r,t)=>{let a=e.split("."),o=t;for(let n of a){let i=r[o]?.fields[n];if(!i||i.kind!=="object")return null;o=i.type;}return o},ll=(e,r)=>{if(!r?.map||!r?.model||!e.field)return r;let t=fl(e.field,r.map,r.model);return t?{...r,model:t}:r},ul=(e,r,t)=>{let a=ll(e,r);switch(e.arrayOperator){case m.all:if(!e.condition)throw new Error("ArrayOperator 'all' requires a condition");return {every:Fe(e.condition,a,t)};case m.any:if(!e.condition)throw new Error("ArrayOperator 'any' requires a condition");return {some:Fe(e.condition,a,t)};case m.none:if(!e.condition)throw new Error("ArrayOperator 'none' requires a condition");return {none:Fe(e.condition,a,t)};case m.empty:return {none:{}};case m.notEmpty:return {some:{}};default:throw new Error(`Unknown array operator: ${e.arrayOperator}`)}};var za=(e,r)=>{let t=dl(e,r);return L(e.field,t)},pl=(e,r)=>{if(e.value!==void 0)return e.value;if(e.path){if(e.path.startsWith("$."))throw new Error(`Prisma WHERE has no column-to-column date comparison for path '${e.path}'. Use prisma.$queryRaw for field-to-field filtering.`);if(!r?.context)throw new Error(`options.context is required to resolve date path '${e.path}'. Pass context when calling toPrisma().`);return A(r.context,e.path)}},dl=(e,r)=>{let t=()=>pl(e,r);switch(e.dateOperator){case y.before:return {lt:t()};case y.after:return {gt:t()};case y.onOrBefore:return {lte:t()};case y.onOrAfter:return {gte:t()};case y.between:{let a=t();if(!Array.isArray(a)||a.length!==2)throw new Error("between date operator requires an array of two values");let[o,n]=Ga(a);return {gte:o,lte:n}}case y.notBetween:{let a=t();if(!Array.isArray(a)||a.length!==2)throw new Error("notBetween date operator requires an array of two values");let[o,n]=Ga(a);return {NOT:{gte:o,lte:n}}}case y.dayIn:throw new Error("DateOperator 'dayIn' has no Prisma equivalent. Use prisma.$queryRaw with EXTRACT(DOW FROM ...) for day-of-week filtering.");case y.dayNotIn:throw new Error("DateOperator 'dayNotIn' has no Prisma equivalent. Use prisma.$queryRaw with EXTRACT(DOW FROM ...) for day-of-week filtering.");default:throw new Error(`Unknown date operator: ${e.dateOperator}`)}},Ga=e=>{let[r,t]=e;return ml(r,t)<=0?[r,t]:[t,r]},ml=(e,r)=>{let t=Ka(e),a=Ka(r);return t<a?-1:t>a?1:0},Ka=e=>e instanceof Date?e.getTime():typeof e=="number"||typeof e=="string"?e:String(e);var fr=(e,r,t)=>{let a=e.split("."),o=t;for(let n=0;n<a.length;n++){let i=r[o];if(!i)return {kind:"fallback"};let s=i.fields[a[n]];if(!s)return {kind:"fallback"};if(s.kind==="bridge")return {kind:"bridge"};if(s.kind==="scalar"&&s.type==="Json"&&n<a.length-1)return {kind:"json-path",stopIndex:n+1,jsonPath:a.slice(n+1)};if(s.kind==="object"){if(!r[s.type])return {kind:"fallback"};o=s.type;continue}return {kind:"direct"}}return {kind:"direct"}};var Ha=(e,r)=>{if(e.operator===l.isEmpty)return {OR:[Ce(e.field,{equals:null},r),Ce(e.field,{equals:""},r)]};if(e.operator===l.notEmpty)return {AND:[Ce(e.field,{not:null},r),Ce(e.field,{not:""},r)]};let t=gl(e,r);return Ce(e.field,t,r)},cl=(e,r)=>{if(e.value!==void 0)return e.value;if(e.path){if(e.path.startsWith("$."))throw new Error(`Prisma WHERE has no column-to-column comparison for path '${e.path}'. Use prisma.$queryRaw for field-to-field filtering.`);if(!r?.context)throw new Error(`options.context is required to resolve path '${e.path}'. Pass context when calling toPrisma().`);return A(r.context,e.path)}throw new Error(`Rule for field '${e.field}' has neither value nor path set`)},gl=(e,r)=>{let t=()=>cl(e,r);switch(e.operator){case l.equals:return {equals:t()??null};case l.notEquals:return {not:t()??null};case l.lessThan:return {lt:t()};case l.lessThanEquals:return {lte:t()};case l.greaterThan:return {gt:t()};case l.greaterThanEquals:return {gte:t()};case l.in:return {in:t()};case l.notIn:return {notIn:t()};case l.contains:return {contains:t()};case l.notContains:return {not:{contains:t()}};case l.startsWith:return {startsWith:t()};case l.endsWith:return {endsWith:t()};case l.matches:throw new Error("Operator 'matches' has no Prisma equivalent. Use prisma.$queryRaw for regex filtering.");case l.notMatches:throw new Error("Operator 'notMatches' has no Prisma equivalent. Use prisma.$queryRaw for regex filtering.");case l.between:{let a=t();if(!Array.isArray(a)||a.length!==2)throw new Error("between operator requires an array of two values");let[o,n]=a[0]<=a[1]?a:[a[1],a[0]];return {gte:o,lte:n}}case l.notBetween:{let a=t();if(!Array.isArray(a)||a.length!==2)throw new Error("notBetween operator requires an array of two values");let[o,n]=a[0]<=a[1]?a:[a[1],a[0]];return {NOT:{gte:o,lte:n}}}case l.isEmpty:case l.notEmpty:throw new Error("isEmpty/notEmpty handled at buildFieldRule level");case l.exists:return {not:null};case l.notExists:return {equals:null};default:throw new Error(`Unknown operator: ${e.operator}`)}},Ce=(e,r,t)=>{if(!t?.map||!t?.model)return L(e,r);let a=fr(e,t.map,t.model),o=e.split(".");switch(a.kind){case "fallback":case "direct":return L(e,r);case "bridge":return {};case "json-path":{let n={path:a.jsonPath,...r},i=o.slice(0,a.stopIndex).join(".");return L(i,n)}}};var Re,Qa=e=>{Re=e;},yl=(e,r,t)=>{let a=e.split("."),o=t;for(let n of a){let i=r[o]?.fields[n];if(!i||i.kind!=="object")return null;o=i.type;}return o},W=(e,r)=>{if(typeof e=="boolean"||!r?.map||!r?.model)return  false;if("all"in e)return e.all.some(t=>W(t,r));if("any"in e)return e.any.some(t=>W(t,r));if("if"in e)return W(e.if,r)||W(e.then,r)||e.else!==void 0&&W(e.else,r);if("field"in e&&typeof e.field=="string"&&e.field!==""){if(fr(e.field,r.map,r.model).kind==="bridge")return  true;if("condition"in e&&e.condition!==void 0){let a=yl(e.field,r.map,r.model);if(a&&W(e.condition,{...r,model:a}))return  true}}return  false},Ya=(e,r,t)=>e.all.length===0?{}:{AND:e.all.map(a=>Re(a,r,t))},Xa=(e,r,t)=>e.any.length===0?{AND:[{id:null},{id:{not:null}}]}:{OR:e.any.map(a=>Re(a,r,t))},Za=(e,r,t)=>{if(W(e.if,r)||W(e.then,r)||e.else!==void 0&&W(e.else,r))return {};let a=Re(e.if,r,t),o={NOT:a},n=e.then===false?Ja:Re(e.then,r,t);if(e.else!==void 0){let i=e.else===false?Ja:Re(e.else,r,t);return {AND:[{OR:[o,n]},{OR:[a,i]}]}}return {OR:[o,n]}},Ja={AND:[{id:null},{id:{not:null}}]};var Pe=(e,r,t)=>{if(typeof e=="boolean"){if(e)return {};throw new Error("Boolean 'false' has no direct Prisma WHERE equivalent. toPrisma is designed for structured Rule conditions.")}if("all"in e)return Ya(e,r,t);if("any"in e)return Xa(e,r,t);if("if"in e)return Za(e,r,t);if("arrayOperator"in e)return Ua(e,r,t);if("dateOperator"in e)return za(e,r);if("aggregate"in e)return ja(e,r,t);if("field"in e)return Ha(e,r);throw new Error("Unknown condition type")};Qa(Pe);Va(Pe);Na(Pe);var hl=async(e,r)=>{let t=e.steps.filter(n=>n.operation==="groupBy"),a=e.steps.find(n=>n.operation==="where");if(!a)throw new Error("executePrismaQueryPlan: result has no where step");let o=[];for(let n of t){let i=n.model.charAt(0).toLowerCase()+n.model.slice(1),s=r[i];if(!s)throw new Error(`executePrismaQueryPlan: no delegate for model '${n.model}'. Ensure prismaDelegate has a key '${i}'.`);let f=await s[n.operation](n.args);o.push(f.map(u=>u[n.extract]));}return _r(a.where,o)},_r=(e,r)=>{if(e==null)return e;if(Array.isArray(e))return e.map(t=>_r(t,r));if(typeof e=="object"){let t=e;if("__step"in t&&typeof t.__step=="number"){let o=t.__step;if(o>=r.length)throw new Error(`Step ref __step: ${o} out of range (${r.length} steps executed)`);return r[o]}let a={};for(let[o,n]of Object.entries(t))a[o]=_r(n,r);return a}return e};var xl=e=>{if(!e?.map)return e;let r="maps"in e.map;if(r&&!e.mapName)throw new Error("toPrisma: 'map' is a FieldMapSet \u2014 'mapName' is required to resolve which map to use.");if(!r||!e.mapName)return e;let t=e.map.maps[e.mapName];if(!t)throw new Error(`toPrisma: fieldMap set has no entry for '${e.mapName}'`);return {...e,map:t}},Xh=(e,r)=>{let t={steps:[]},a=Pe(e,xl(r),t);return {steps:[...t.steps,{operation:"where",where:a}]}};var w=e=>`"${e.replace(/"/g,'""')}"`;var h=(e,r)=>(e.params.push(r),`$${++e.paramIndex}`);var Be=e=>e.replace(/\\/g,"\\\\").replace(/%/g,"\\%").replace(/_/g,"\\_"),_=e=>{let r=e.split(".");if(r.length===1)return w(e);let[t,...a]=r;return a.length===0?w(t):ro(w(t),a)},eo=(e,r)=>{let t=e.split(".");if(t.length===1)return `${w(r)}.${w(e)}`;let[a,...o]=t;return ro(`${w(r)}.${w(a)}`,o)},kr=e=>`'${e.replace(/'/g,"''")}'`,ro=(e,r)=>{if(r.length===0)return e;let t=r.slice(0,-1).map(kr).join("->"),a=kr(r[r.length-1]);return t?`${e}->${t}->>${a}`:`${e}->>${a}`},to=e=>{let r=e.split(".");if(r.length===1)return w(e);let[t,...a]=r;return a.length===0?w(t):wl(w(t),a)},wl=(e,r)=>{let t=r.map(kr).join("->");return `${e}->${t}`};var ao=(e,r)=>{if(e.condition)throw new Error("Aggregate condition filtering is not yet supported by toSql(). Use check() for in-memory evaluation or toPrisma() for database queries.");let t=bl(e,r);return Al(t,e,r)},bl=(e,r)=>{let t=to(e.field),{mode:a,field:o}=e.aggregate,n=a==="sum"?"SUM":"AVG",i=r.map?.[r.currentModel??""]?.fields[e.field];if(i?.kind==="object")throw new Error(`Field '${e.field}' is a relation \u2014 toSql() cannot aggregate relation lists. Use toPrisma() instead.`);if(o?.includes("."))throw new Error(`aggregate.field '${o}' contains a nested path \u2014 toSql() only supports flat field names. Use check() for nested paths.`);if(i?.kind==="scalar"&&i?.isList===true){if(o)throw new Error("aggregate.field is not supported for native array types. Use a JSONB column for object arrays.");return `(SELECT ${n==="SUM"?"COALESCE(SUM(elem), 0)":"AVG(elem)"} FROM unnest(${t}) AS elem)`}if(o){let p=`(elem->>'${o}')::numeric`;return `(SELECT ${n==="SUM"?`COALESCE(SUM(${p}), 0)`:`AVG(${p})`} FROM jsonb_array_elements(${t}) AS elem)`}let f="elem::numeric";return `(SELECT ${n==="SUM"?`COALESCE(SUM(${f}), 0)`:`AVG(${f})`} FROM jsonb_array_elements_text(${t}) AS elem)`},Ol=(e,r)=>{if(e.value!==void 0)return {type:"value",value:e.value};if(e.path){if(e.path.startsWith("$.")){let t=e.path.substring(2);return {type:"column",sql:r.currentAlias?`${w(r.currentAlias)}.${w(t)}`:_(t)}}if(!r.context)throw new Error(`BuilderState.context is required to resolve path '${e.path}'. Pass context in options.`);return {type:"value",value:A(r.context,e.path)}}throw new Error("Aggregate rule requires value or path")},Al=(e,r,t)=>{let a=Ol(r,t),o=a.type==="value"?a.value:void 0,n=a.type==="column"?a.sql:void 0;switch(r.operator){case l.equals:return n?`${e} = ${n}`:o===null?`${e} IS NULL`:`${e} = ${h(t,o)}`;case l.notEquals:return n?`${e} <> ${n}`:o===null?`${e} IS NOT NULL`:`${e} <> ${h(t,o)}`;case l.lessThan:return n?`${e} < ${n}`:`${e} < ${h(t,o)}`;case l.lessThanEquals:return n?`${e} <= ${n}`:`${e} <= ${h(t,o)}`;case l.greaterThan:return n?`${e} > ${n}`:`${e} > ${h(t,o)}`;case l.greaterThanEquals:return n?`${e} >= ${n}`:`${e} >= ${h(t,o)}`;case l.between:{let i=o;if(!Array.isArray(i)||i.length!==2)throw new Error("between requires two values");let[s,f]=i[0]<=i[1]?i:[i[1],i[0]];return `${e} BETWEEN ${h(t,s)} AND ${h(t,f)}`}case l.notBetween:{let i=o;if(!Array.isArray(i)||i.length!==2)throw new Error("notBetween requires two values");let[s,f]=i[0]<=i[1]?i:[i[1],i[0]];return `${e} NOT BETWEEN ${h(t,s)} AND ${h(t,f)}`}default:throw new Error(`Operator '${r.operator}' is not supported for aggregate rules`)}};var oo=(e,r)=>{if(!e.field)throw new Error("toSql: ArrayRule.field is required (fieldless arrayOps are check-only)");let t=_(e.field),a=r.map?.[r.currentModel??""]?.fields[e.field],o=a?.kind==="scalar"&&a?.isList===true,n=o?`array_length(${t}, 1)`:`jsonb_array_length(${t})`;switch(e.arrayOperator){case m.empty:return o?`(${t} IS NULL OR ${n} IS NULL)`:`(${t} IS NULL OR ${n} = 0)`;case m.notEmpty:return o?`(${t} IS NOT NULL AND ${n} IS NOT NULL)`:`(${t} IS NOT NULL AND ${n} > 0)`;case m.all:case m.any:case m.none:case m.atLeast:case m.atMost:case m.exactly:throw new Error(`Array operator '${e.arrayOperator}' with conditions is not supported in SQL. Use application-level filtering for complex array operations.`);default:throw new Error(`Unknown array operator: ${e.arrayOperator}`)}};var Mr=e=>{let r={sunday:0,monday:1,tuesday:2,wednesday:3,thursday:4,friday:5,saturday:6};return e.map(t=>{let a=r[t.toLowerCase()];if(a===void 0)throw new Error(`Unknown day name: ${t}`);return a})};var lr=(e,r)=>{if(!r.map||!r.currentModel||!r.currentAlias)return _(e);let t=e.split("."),a=r.currentModel,o=r.currentAlias;for(let n=0;n<t.length;n++){let i=r.map[a];if(!i)return _(e);let s=i.fields[t[n]];if(!s)return _(e);if(s.kind==="object"){let u=`${o}.${t[n]}`,p=r.joinRegistry?.get(u),c;if(p)c=p;else {let d=r.joinCounter;if(!d)return _(e);c=`t${++d.n}`;let b=$l(r.map,a,o,s,c);if(!b)return _(e);r.joins?.push(b),r.joinRegistry?.set(u,c);}a=s.type,o=c;continue}let f=t.slice(n);return eo(f.join("."),o)}return _(e)},$l=(e,r,t,a,o)=>{let n=a.type,i=e[n]?.dbName??n,s;if(a.fromFields&&a.fromFields.length>0&&a.toFields&&a.toFields.length>0)s=a.fromFields.map((f,u)=>`${w(o)}.${w(a.toFields?.[u]??"")} = ${w(t)}.${w(f)}`).join(" AND ");else {let f=vl(e,n,r,a.relationName);if(!f)return null;s=(f.fromFields??[]).map((u,p)=>`${w(o)}.${w(u)} = ${w(t)}.${w(f.toFields?.[p]??"")}`).join(" AND ");}return `LEFT JOIN ${w(i)} AS ${w(o)} ON ${s}`},vl=(e,r,t,a)=>{let o=e[r];if(!o)return null;for(let n of Object.values(o.fields))if(n.kind==="object"&&n.type===t&&(n.fromFields?.length??0)>0&&(n.toFields?.length??0)>0&&(a===void 0||n.relationName===a))return n;return null};var so=(e,r)=>{let t=lr(e.field,r),a=Sl(e,r),o=a.type==="value"?a.value:void 0,n=a.type==="column"?a.sql:void 0;switch(e.dateOperator){case y.before:return n!==void 0?`${t} < ${n}`:`${t} < ${h(r,o)}`;case y.after:return n!==void 0?`${t} > ${n}`:`${t} > ${h(r,o)}`;case y.onOrBefore:return n!==void 0?`${t} <= ${n}`:`${t} <= ${h(r,o)}`;case y.onOrAfter:return n!==void 0?`${t} >= ${n}`:`${t} >= ${h(r,o)}`;case y.between:{let i=o;if(!Array.isArray(i)||i.length!==2)throw new Error("between date operator requires an array of two values");let[s,f]=no(i);return `${t} BETWEEN ${h(r,s)} AND ${h(r,f)}`}case y.notBetween:{let i=o;if(!Array.isArray(i)||i.length!==2)throw new Error("notBetween date operator requires an array of two values");let[s,f]=no(i);return `${t} NOT BETWEEN ${h(r,s)} AND ${h(r,f)}`}case y.dayIn:{if(!Array.isArray(e.value))throw new Error("dayIn operator requires an array of day names");let i=Mr(e.value.map(s=>String(s)));return `EXTRACT(DOW FROM ${t}) = ANY(${h(r,i)})`}case y.dayNotIn:{if(!Array.isArray(e.value))throw new Error("dayNotIn operator requires an array of day names");let i=Mr(e.value.map(s=>String(s)));return `EXTRACT(DOW FROM ${t}) <> ALL(${h(r,i)})`}default:throw new Error(`Unknown date operator: ${e.dateOperator}`)}},no=e=>{let[r,t]=e;return El(r,t)<=0?[r,t]:[t,r]},El=(e,r)=>{let t=io(e),a=io(r);return t<a?-1:t>a?1:0},io=e=>e instanceof Date?e.getTime():typeof e=="number"||typeof e=="string"?e:String(e),Sl=(e,r)=>{if(e.value!==void 0)return {type:"value",value:e.value};if(e.path){if(e.path.startsWith("$.")){let t=e.path.substring(2);return {type:"column",sql:r.currentAlias?`${w(r.currentAlias)}.${w(t)}`:_(t)}}if(!r.context)throw new Error(`BuilderState.context is required to resolve date path '${e.path}'. Pass context in options when calling toSql().`);return {type:"value",value:A(r.context,e.path)}}return {type:"value",value:void 0}};var fo=(e,r)=>{let t=lr(e.field,r),a=Rl(e,r),o=a.type==="value"?a.value:void 0,n=a.type==="column"?a.sql:void 0;switch(e.operator){case l.equals:return n!==void 0?`${t} = ${n}`:o===null?`${t} IS NULL`:`${t} = ${h(r,o)}`;case l.notEquals:return n!==void 0?`${t} <> ${n}`:o===null?`${t} IS NOT NULL`:`${t} <> ${h(r,o)}`;case l.lessThan:return n!==void 0?`${t} < ${n}`:`${t} < ${h(r,o)}`;case l.lessThanEquals:return n!==void 0?`${t} <= ${n}`:`${t} <= ${h(r,o)}`;case l.greaterThan:return n!==void 0?`${t} > ${n}`:`${t} > ${h(r,o)}`;case l.greaterThanEquals:return n!==void 0?`${t} >= ${n}`:`${t} >= ${h(r,o)}`;case l.in:return !Array.isArray(o)||o.length===0?"FALSE":`${t} = ANY(${h(r,o)})`;case l.notIn:return !Array.isArray(o)||o.length===0?"TRUE":`${t} <> ALL(${h(r,o)})`;case l.contains:return `${t} LIKE ${h(r,`%${Be(String(o))}%`)}`;case l.notContains:return `${t} NOT LIKE ${h(r,`%${Be(String(o))}%`)}`;case l.startsWith:return `${t} LIKE ${h(r,`${Be(String(o))}%`)}`;case l.endsWith:return `${t} LIKE ${h(r,`%${Be(String(o))}`)}`;case l.matches:return `${t} ~ ${h(r,o)}`;case l.notMatches:return `${t} !~ ${h(r,o)}`;case l.between:{let i=o;if(!Array.isArray(i)||i.length!==2)throw new Error("between operator requires an array of two values");let[s,f]=i[0]<=i[1]?i:[i[1],i[0]];return `${t} BETWEEN ${h(r,s)} AND ${h(r,f)}`}case l.notBetween:{let i=o;if(!Array.isArray(i)||i.length!==2)throw new Error("notBetween operator requires an array of two values");let[s,f]=i[0]<=i[1]?i:[i[1],i[0]];return `${t} NOT BETWEEN ${h(r,s)} AND ${h(r,f)}`}case l.isEmpty:return `(${t} IS NULL OR ${t} = '')`;case l.notEmpty:return `(${t} IS NOT NULL AND ${t} <> '')`;case l.exists:return `${t} IS NOT NULL`;case l.notExists:return `${t} IS NULL`;default:throw new Error(`Unknown operator: ${e.operator}`)}},Rl=(e,r)=>{if(e.value!==void 0)return {type:"value",value:e.value};if(e.path){if(e.path.startsWith("$.")){let t=e.path.substring(2);return {type:"column",sql:r.currentAlias?`${w(r.currentAlias)}.${w(t)}`:_(t)}}if(!r.context)throw new Error(`BuilderState.context is required to resolve path '${e.path}'. Pass context in options when calling toSql().`);return {type:"value",value:A(r.context,e.path)}}return {type:"value",value:void 0}};var Te,lo=e=>{Te=e;},Tl=(e,r,t)=>{let a=e.split("."),o=t;for(let n=0;n<a.length;n++){let i=r[o];if(!i)return  false;let s=i.fields[a[n]];if(!s)return  false;if(s.kind==="bridge")return  true;if(s.kind==="object"){o=s.type;continue}return  false}return  false},_l=(e,r,t)=>{let a=e.split("."),o=t;for(let n of a){let i=r[o]?.fields[n];if(!i||i.kind!=="object")return null;o=i.type;}return o},V=(e,r)=>{if(typeof e=="boolean"||!r.map||!r.currentModel)return  false;if("all"in e)return e.all.some(t=>V(t,r));if("any"in e)return e.any.some(t=>V(t,r));if("if"in e)return V(e.if,r)||V(e.then,r)||e.else!==void 0&&V(e.else,r);if("field"in e&&typeof e.field=="string"&&e.field!==""){if(Tl(e.field,r.map,r.currentModel))return  true;if("condition"in e&&e.condition!==void 0){let t=_l(e.field,r.map,r.currentModel);if(t&&V(e.condition,{...r,currentModel:t}))return  true}}return  false},uo=(e,r)=>e.all.length===0?"TRUE":`(${e.all.map(a=>Te(a,r)).join(" AND ")})`,po=(e,r)=>e.any.length===0?"FALSE":`(${e.any.map(a=>Te(a,r)).join(" OR ")})`,mo=(e,r)=>{if(V(e.if,r)||V(e.then,r)||e.else!==void 0&&V(e.else,r))return "TRUE";let t=Te(e.if,r),a=Te(e.then,r);if(e.else!==void 0){let o=Te(e.else,r);return `((NOT(${t}) OR ${a}) AND (${t} OR ${o}))`}return `(NOT(${t}) OR ${a})`};var kl=(e,r,t)=>{let a=e.split("."),o=t;for(let n=0;n<a.length;n++){let i=r[o];if(!i)return  false;let s=i.fields[a[n]];if(!s)return  false;if(s.kind==="bridge")return  true;if(s.kind==="object"){o=s.type;continue}return  false}return  false},Fr=(e,r)=>{if(typeof e=="boolean")return e?"TRUE":"FALSE";if("field"in e&&typeof e.field=="string"&&r.map&&r.currentModel&&kl(e.field,r.map,r.currentModel))return "TRUE";if("all"in e)return uo(e,r);if("any"in e)return po(e,r);if("if"in e)return mo(e,r);if("arrayOperator"in e)return oo(e,r);if("dateOperator"in e)return so(e,r);if("aggregate"in e)return ao(e,r);if("field"in e)return fo(e,r);throw new Error("Unknown condition type")};lo(Fr);var jx=(e,r)=>{let t=!!(r?.map&&r?.model),a=r?.alias??(t?"t0":void 0),o={params:[],paramIndex:0,context:r?.context,map:r?.map,currentModel:r?.model,currentAlias:a,joinCounter:t?{n:0}:void 0,joins:t?[]:void 0,joinRegistry:t?new Map:void 0};return {sql:Fr(e,o),params:o.params,joins:o.joins??[]}};var Ml=new Set(Object.keys(q)),Fl=new Set(Object.keys(X)),Cl=new Set(Object.keys(Y)),Pl=(e,r={})=>{let t={target:r.target??"check",errors:[]};return Z(e,"$",t),{ok:t.errors.length===0,errors:t.errors}},Gx=(e,r={})=>{let t=Pl(e,r);if(t.ok)return;let a=t.errors.map(o=>`${o.path}: ${o.message}`).join(`
 `);throw new Error(`Invalid rule:
-${n}`)},k=(e,t,r)=>{if(typeof e=="boolean"){r.target==="toPrisma"&&e===false&&m(r,t,"boolean_false_not_supported","Boolean 'false' is not supported by toPrisma()");return}if(!Me(e)){m(r,t,"invalid_condition","Condition must be a boolean or object");return}let n=Tr(e);if(!n){m(r,t,"ambiguous_condition","Condition must be exactly one of: field rule, array rule, date rule, all, any, or if/then[/else]");return}switch(n){case "all":Ie(e.all,`${t}.all`,r);break;case "any":Ie(e.any,`${t}.any`,r);break;case "if":k(e.if,`${t}.if`,r),k(e.then,`${t}.then`,r),"else"in e&&e.else!==void 0&&k(e.else,`${t}.else`,r);break;case "field":Fr(e,t,r);break;case "aggregate":Cr(e,t,r);break;case "array":xr(e,t,r);break;case "date":_r(e,t,r);break}},Tr=e=>{let t=[];"all"in e&&t.push("all"),"any"in e&&t.push("any"),("if"in e||"then"in e||"else"in e)&&t.push("if"),"arrayOperator"in e&&t.push("array"),"dateOperator"in e&&t.push("date"),"aggregate"in e?t.push("aggregate"):"operator"in e&&t.push("field");let r=Array.from(new Set(t));return r.length!==1?null:r[0]},Ie=(e,t,r)=>{if(!Array.isArray(e)){m(r,t,"logical_array_required","Logical operator requires an array of conditions");return}e.forEach((n,a)=>{k(n,`${t}[${a}]`,r);});},Fr=(e,t,r)=>{if(typeof e.field!="string"&&m(r,`${t}.field`,"field_required","Field rule requires a string field"),typeof e.operator!="string"||!qr.has(e.operator)){m(r,`${t}.operator`,"invalid_operator","Unknown field operator");return}let n=e.operator;if(r.target==="toPrisma"&&((n===i.matches||n===i.notMatches)&&"operator"in e&&m(r,`${t}.operator`,"unsupported_prisma_operator",`Operator '${n}' is not supported by toPrisma()`),typeof e.path=="string"&&e.path.startsWith("$.")&&m(r,`${t}.path`,"unsupported_prisma_path",`Path '${e.path}' is not supported by toPrisma()`)),Ir(n)){Nr(e,t,r);return}if(!j(e,t,r)||"path"in e&&typeof e.path=="string")return;let a=e.value;switch(n){case i.lessThan:case i.lessThanEquals:case i.greaterThan:case i.greaterThanEquals:Y(a)||m(r,`${t}.value`,"invalid_ordered_value",`Operator '${n}' requires a string, number, or Date value`);break;case i.in:case i.notIn:Array.isArray(a)||m(r,`${t}.value`,"invalid_membership_value",`Operator '${n}' requires an array value`);break;case i.matches:case i.notMatches:typeof a=="string"||a instanceof RegExp||m(r,`${t}.value`,"invalid_pattern_value",`Operator '${n}' requires a string or RegExp value`);break;case i.startsWith:case i.endsWith:typeof a!="string"&&m(r,`${t}.value`,"invalid_string_value",`Operator '${n}' requires a string value`);break;case i.between:case i.notBetween:Lr(a)||m(r,`${t}.value`,"invalid_range_value",`Operator '${n}' requires a two-item range`);break}},Dr=new Set([i.equals,i.notEquals,i.lessThan,i.lessThanEquals,i.greaterThan,i.greaterThanEquals]),Pr=new Set([i.between,i.notBetween]),Cr=(e,t,r)=>{if(typeof e.field!="string"&&m(r,`${t}.field`,"field_required","Aggregate rule requires a string field"),!Me(e.aggregate)){m(r,`${t}.aggregate`,"invalid_aggregate","aggregate must be an object");return}let n=e.aggregate;n.mode!=="sum"&&n.mode!=="avg"&&m(r,`${t}.aggregate.mode`,"invalid_aggregate_mode","aggregate.mode must be 'sum' or 'avg'"),"field"in n&&n.field!==void 0&&typeof n.field!="string"&&m(r,`${t}.aggregate.field`,"invalid_aggregate_field","aggregate.field must be a string");let a=typeof e.operator=="string"&&Dr.has(e.operator),o=typeof e.operator=="string"&&Pr.has(e.operator);if(!a&&!o){m(r,`${t}.operator`,"invalid_aggregate_operator","Aggregate rules only support: equals, notEquals, lessThan, lessThanEquals, greaterThan, greaterThanEquals, between, notBetween");return}if(r.target==="toPrisma"&&e.operator===i.notBetween&&m(r,`${t}.operator`,"unsupported_prisma_aggregate_operator","Operator 'notBetween' is not supported by toPrisma() for aggregate rules"),r.target==="toPrisma"&&typeof e.path=="string"&&m(r,`${t}.path`,"unsupported_prisma_aggregate_path","path is not supported by toPrisma() for aggregate rules; use value instead"),"condition"in e&&e.condition!==void 0&&(r.target==="toSql"&&m(r,`${t}.condition`,"unsupported_sql_aggregate_condition","Aggregate condition filtering is not supported by toSql(); use check() or toPrisma()"),k(e.condition,`${t}.condition`,r)),!j(e,t,r)||"path"in e&&typeof e.path=="string")return;let s=e.value;o?Vr(s)||m(r,`${t}.value`,"invalid_range_value",`Operator '${e.operator}' requires a two-item numeric range`):typeof s!="number"&&m(r,`${t}.value`,"invalid_aggregate_value","Aggregate rule value must be a number");},xr=(e,t,r)=>{if(typeof e.field!="string"&&m(r,`${t}.field`,"field_required","Array rule requires a string field"),typeof e.arrayOperator!="string"||!kr.has(e.arrayOperator)){m(r,`${t}.arrayOperator`,"invalid_array_operator","Unknown array operator");return}let n=e.arrayOperator;switch(r.target==="toSql"&&Mr(n)&&m(r,`${t}.arrayOperator`,"unsupported_sql_array_operator",`Array operator '${n}' is not supported by toSql()`),n){case d.empty:case d.notEmpty:"condition"in e&&e.condition!==void 0&&m(r,`${t}.condition`,"unexpected_condition",`Array operator '${n}' does not accept condition`),"count"in e&&e.count!==void 0&&m(r,`${t}.count`,"unexpected_count",`Array operator '${n}' does not accept count`);break;case d.all:case d.any:case d.none:!("condition"in e)||e.condition===void 0?m(r,`${t}.condition`,"missing_condition",`Array operator '${n}' requires condition`):k(e.condition,`${t}.condition`,r),"count"in e&&e.count!==void 0&&m(r,`${t}.count`,"unexpected_count",`Array operator '${n}' does not accept count`);break;case d.atLeast:case d.atMost:case d.exactly:r.target!=="toPrisma"&&typeof e.count!="number"?m(r,`${t}.count`,"missing_count",`Array operator '${n}' requires count`):"count"in e&&e.count!==void 0&&typeof e.count!="number"&&m(r,`${t}.count`,"invalid_count","count must be a number"),r.target==="check"&&(!("condition"in e)||e.condition===void 0)?m(r,`${t}.condition`,"missing_condition",`Array operator '${n}' requires condition for check()`):"condition"in e&&e.condition!==void 0&&k(e.condition,`${t}.condition`,r);break}},_r=(e,t,r)=>{if(typeof e.field!="string"&&m(r,`${t}.field`,"field_required","Date rule requires a string field"),typeof e.dateOperator!="string"||!Sr.has(e.dateOperator)){m(r,`${t}.dateOperator`,"invalid_date_operator","Unknown date operator");return}let n=e.dateOperator;switch(r.target==="toPrisma"&&((n===c.dayIn||n===c.dayNotIn)&&"dateOperator"in e&&m(r,`${t}.dateOperator`,"unsupported_prisma_date_operator",`Date operator '${n}' is not supported by toPrisma()`),typeof e.path=="string"&&e.path.startsWith("$.")&&m(r,`${t}.path`,"unsupported_prisma_path",`Path '${e.path}' is not supported by toPrisma()`)),n){case c.dayIn:case c.dayNotIn:(!Array.isArray(e.value)||!e.value.every(a=>typeof a=="string"))&&m(r,`${t}.value`,"invalid_day_list",`Date operator '${n}' requires an array of day names`),"path"in e&&e.path!==void 0&&m(r,`${t}.path`,"unexpected_path",`Date operator '${n}' does not accept path`);return;case c.between:case c.notBetween:if(!j(e,t,r)||"path"in e&&typeof e.path=="string")return;Wr(e.value)||m(r,`${t}.value`,"invalid_date_range",`Date operator '${n}' requires a two-item date range`);return;default:if(!j(e,t,r)||"path"in e&&typeof e.path=="string")return;Z(e.value)||m(r,`${t}.value`,"invalid_date_value",`Date operator '${n}' requires a date-like value`);}},j=(e,t,r)=>{let n="value"in e&&e.value!==void 0,a=typeof e.path=="string";return n&&a?(m(r,t,"ambiguous_value_source","Rule cannot define both value and path"),false):!n&&!a?(m(r,t,"missing_value_source","Rule requires either value or path"),false):true},Nr=(e,t,r)=>{"value"in e&&e.value!==void 0&&m(r,`${t}.value`,"unexpected_value","Rule does not accept value"),"path"in e&&e.path!==void 0&&m(r,`${t}.path`,"unexpected_path","Rule does not accept path");},Ir=e=>e===i.isEmpty||e===i.notEmpty||e===i.exists||e===i.notExists,Mr=e=>e===d.all||e===d.any||e===d.none||e===d.atLeast||e===d.atMost||e===d.exactly,Me=e=>typeof e=="object"&&e!==null&&!Array.isArray(e),Y=e=>typeof e=="string"||typeof e=="number"||e instanceof Date,Lr=e=>Array.isArray(e)&&e.length===2&&Y(e[0])&&Y(e[1]),Vr=e=>Array.isArray(e)&&e.length===2&&typeof e[0]=="number"&&typeof e[1]=="number",Z=e=>typeof e=="string"||typeof e=="number"||e instanceof Date,Wr=e=>Array.isArray(e)&&e.length===2&&Z(e[0])&&Z(e[1]),m=(e,t,r,n)=>{e.errors.push({path:t,code:r,message:n});};exports.ArrayOperator=d;exports.DateOperator=c;exports.Operator=i;exports.assertValidRule=Tn;exports.check=S;exports.executePrismaQueryPlan=mr;exports.toPrisma=It;exports.toSql=kn;exports.validateRule=Br;//# sourceMappingURL=index.cjs.map
+${a}`)},Z=(e,r,t)=>{if(typeof e=="boolean"){t.target==="toPrisma"&&e===false&&g(t,r,"boolean_false_not_supported","Boolean 'false' is not supported by toPrisma()");return}if(!go(e)){g(t,r,"invalid_condition","Condition must be a boolean or object");return}let a=Bl(e);if(!a){g(t,r,"ambiguous_condition","Condition must be exactly one of: field rule, array rule, date rule, all, any, or if/then[/else]");return}switch(a){case "all":co(e.all,`${r}.all`,t);break;case "any":co(e.any,`${r}.any`,t);break;case "if":Z(e.if,`${r}.if`,t),Z(e.then,`${r}.then`,t),"else"in e&&e.else!==void 0&&Z(e.else,`${r}.else`,t);break;case "field":Dl(e,r,t);break;case "aggregate":Ll(e,r,t);break;case "array":Il(e,r,t);break;case "date":Nl(e,r,t);break}},Bl=e=>{let r=[];"all"in e&&r.push("all"),"any"in e&&r.push("any"),("if"in e||"then"in e||"else"in e)&&r.push("if"),"arrayOperator"in e&&r.push("array"),"dateOperator"in e&&r.push("date"),"aggregate"in e?r.push("aggregate"):"operator"in e&&r.push("field");let t=Array.from(new Set(r));return t.length!==1?null:t[0]},co=(e,r,t)=>{if(!Array.isArray(e)){g(t,r,"logical_array_required","Logical operator requires an array of conditions");return}e.forEach((a,o)=>{Z(a,`${r}[${o}]`,t);});},Dl=(e,r,t)=>{if(typeof e.field!="string"&&g(t,`${r}.field`,"field_required","Field rule requires a string field"),typeof e.operator!="string"||!Ml.has(e.operator)){g(t,`${r}.operator`,"invalid_operator","Unknown field operator");return}let a=e.operator;ir(a,t.target)||g(t,`${r}.operator`,`unsupported_${Dr(t.target)}_operator`,`Operator '${a}' is not supported by ${t.target}()`),t.target==="toPrisma"&&typeof e.path=="string"&&e.path.startsWith("$.")&&g(t,`${r}.path`,"unsupported_prisma_path",`Path '${e.path}' is not supported by toPrisma()`);let o=Tr(a);if(o==="none"){jl(e,r,t);return}Br(e,r,t)&&("path"in e&&typeof e.path=="string"||ql(o,e.value,a,`${r}.value`,t));},ql=(e,r,t,a,o)=>{switch(e){case "scalar":case "string":e==="string"&&typeof r!="string"&&g(o,a,"invalid_string_value",`Operator '${t}' requires a string value`);return;case "ordered":Cr(r)||g(o,a,"invalid_ordered_value",`Operator '${t}' requires a string, number, or Date value`);return;case "array":Array.isArray(r)||g(o,a,"invalid_membership_value",`Operator '${t}' requires an array value`);return;case "pattern":typeof r=="string"||r instanceof RegExp||g(o,a,"invalid_pattern_value",`Operator '${t}' requires a string or RegExp value`);return;case "range":Wl(r)||g(o,a,"invalid_range_value",`Operator '${t}' requires a two-item range`);return}},Ll=(e,r,t)=>{if(typeof e.field!="string"&&g(t,`${r}.field`,"field_required","Aggregate rule requires a string field"),!go(e.aggregate)){g(t,`${r}.aggregate`,"invalid_aggregate","aggregate must be an object");return}let a=e.aggregate;a.mode!=="sum"&&a.mode!=="avg"&&g(t,`${r}.aggregate.mode`,"invalid_aggregate_mode","aggregate.mode must be 'sum' or 'avg'"),"field"in a&&a.field!==void 0&&typeof a.field!="string"&&g(t,`${r}.aggregate.field`,"invalid_aggregate_field","aggregate.field must be a string");let o=typeof e.operator=="string"&&qa(e.operator),n=typeof e.operator=="string"&&La(e.operator);if(!o&&!n){g(t,`${r}.operator`,"invalid_aggregate_operator","Aggregate rules only support: equals, notEquals, lessThan, lessThanEquals, greaterThan, greaterThanEquals, between, notBetween");return}if(t.target==="toPrisma"&&e.operator===l.notBetween&&g(t,`${r}.operator`,"unsupported_prisma_aggregate_operator","Operator 'notBetween' is not supported by toPrisma() for aggregate rules"),t.target==="toPrisma"&&typeof e.path=="string"&&g(t,`${r}.path`,"unsupported_prisma_aggregate_path","path is not supported by toPrisma() for aggregate rules; use value instead"),"condition"in e&&e.condition!==void 0&&(t.target==="toSql"&&g(t,`${r}.condition`,"unsupported_sql_aggregate_condition","Aggregate condition filtering is not supported by toSql(); use check() or toPrisma()"),Z(e.condition,`${r}.condition`,t)),!Br(e,r,t)||"path"in e&&typeof e.path=="string")return;let i=e.value;n?Vl(i)||g(t,`${r}.value`,"invalid_range_value",`Operator '${e.operator}' requires a two-item numeric range`):typeof i!="number"&&g(t,`${r}.value`,"invalid_aggregate_value","Aggregate rule value must be a number");},Il=(e,r,t)=>{if(typeof e.field!="string"&&t.target!=="check"&&g(t,`${r}.field`,"field_required","Array rule requires a string field for this target"),typeof e.arrayOperator!="string"||!Fl.has(e.arrayOperator)){g(t,`${r}.arrayOperator`,"invalid_array_operator","Unknown array operator");return}let a=e.arrayOperator;switch(ir(a,t.target)||g(t,`${r}.arrayOperator`,`unsupported_${Dr(t.target)}_array_operator`,`Array operator '${a}' is not supported by ${t.target}()`),a){case m.empty:case m.notEmpty:"condition"in e&&e.condition!==void 0&&g(t,`${r}.condition`,"unexpected_condition",`Array operator '${a}' does not accept condition`),"count"in e&&e.count!==void 0&&g(t,`${r}.count`,"unexpected_count",`Array operator '${a}' does not accept count`);break;case m.all:case m.any:case m.none:!("condition"in e)||e.condition===void 0?g(t,`${r}.condition`,"missing_condition",`Array operator '${a}' requires condition`):Z(e.condition,`${r}.condition`,t),"count"in e&&e.count!==void 0&&g(t,`${r}.count`,"unexpected_count",`Array operator '${a}' does not accept count`);break;case m.atLeast:case m.atMost:case m.exactly:t.target!=="toPrisma"&&typeof e.count!="number"?g(t,`${r}.count`,"missing_count",`Array operator '${a}' requires count`):"count"in e&&e.count!==void 0&&typeof e.count!="number"&&g(t,`${r}.count`,"invalid_count","count must be a number"),t.target==="check"&&(!("condition"in e)||e.condition===void 0)?g(t,`${r}.condition`,"missing_condition",`Array operator '${a}' requires condition for check()`):"condition"in e&&e.condition!==void 0&&Z(e.condition,`${r}.condition`,t);break}},Nl=(e,r,t)=>{if(typeof e.field!="string"&&g(t,`${r}.field`,"field_required","Date rule requires a string field"),typeof e.dateOperator!="string"||!Cl.has(e.dateOperator)){g(t,`${r}.dateOperator`,"invalid_date_operator","Unknown date operator");return}let a=e.dateOperator;ir(a,t.target)||g(t,`${r}.dateOperator`,`unsupported_${Dr(t.target)}_date_operator`,`Date operator '${a}' is not supported by ${t.target}()`),t.target==="toPrisma"&&typeof e.path=="string"&&e.path.startsWith("$.")&&g(t,`${r}.path`,"unsupported_prisma_path",`Path '${e.path}' is not supported by toPrisma()`);let o=Tr(a);if(o==="dayList"){(!Array.isArray(e.value)||!e.value.every(n=>typeof n=="string"))&&g(t,`${r}.value`,"invalid_day_list",`Date operator '${a}' requires an array of day names`),"path"in e&&e.path!==void 0&&g(t,`${r}.path`,"unexpected_path",`Date operator '${a}' does not accept path`);return}if(Br(e,r,t)&&!("path"in e&&typeof e.path=="string")){if(o==="dateRange"){Ul(e.value)||g(t,`${r}.value`,"invalid_date_range",`Date operator '${a}' requires a two-item date range`);return}Pr(e.value)||g(t,`${r}.value`,"invalid_date_value",`Date operator '${a}' requires a date-like value`);}},Br=(e,r,t)=>{let a="value"in e&&e.value!==void 0,o=typeof e.path=="string";return a&&o?(g(t,r,"ambiguous_value_source","Rule cannot define both value and path"),false):!a&&!o?(g(t,r,"missing_value_source","Rule requires either value or path"),false):true},jl=(e,r,t)=>{"value"in e&&e.value!==void 0&&g(t,`${r}.value`,"unexpected_value","Rule does not accept value"),"path"in e&&e.path!==void 0&&g(t,`${r}.path`,"unexpected_path","Rule does not accept path");},Dr=e=>e==="toPrisma"?"prisma":e==="toSql"?"sql":"check",go=e=>typeof e=="object"&&e!==null&&!Array.isArray(e),Cr=e=>typeof e=="string"||typeof e=="number"||e instanceof Date,Wl=e=>Array.isArray(e)&&e.length===2&&Cr(e[0])&&Cr(e[1]),Vl=e=>Array.isArray(e)&&e.length===2&&typeof e[0]=="number"&&typeof e[1]=="number",Pr=e=>typeof e=="string"||typeof e=="number"||e instanceof Date,Ul=e=>Array.isArray(e)&&e.length===2&&Pr(e[0])&&Pr(e[1]),g=(e,r,t,a)=>{e.errors.push({path:r,code:t,message:a});};/*! Bundled license information:
+
+lodash-es/lodash.js:
+  (**
+   * @license
+   * Lodash (Custom Build) <https://lodash.com/>
+   * Build: `lodash modularize exports="es" --repo lodash/lodash#4.18.1 -o ./`
+   * Copyright OpenJS Foundation and other contributors <https://openjsf.org/>
+   * Released under MIT license <https://lodash.com/license>
+   * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>
+   * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
+   *)
+*/exports.AGGREGATE_OPERATORS=gh;exports.ALL_KINDS=Da;exports.ARRAY_OPERATOR_CATALOG=X;exports.ArrayOperator=m;exports.DATE_OPERATOR_CATALOG=Y;exports.DateOperator=y;exports.EQUATABLE_KINDS=or;exports.FIELD_OPERATOR_CATALOG=q;exports.FieldKind=el;exports.NUMERIC_KINDS=rl;exports.ORDERABLE_KINDS=Ee;exports.Operator=l;exports.RuleTarget=mh;exports.STRINGY_KINDS=Q;exports.ValueShape=ch;exports.applyLens=Yf;exports.assertValidRule=Gx;exports.buildBridgeDictionary=Hf;exports.check=ae;exports.checkRuleAgainstLens=Rr;exports.createLens=Xf;exports.executePrismaQueryPlan=hl;exports.getArrayOperators=hh;exports.getOperatorsForKind=yh;exports.getValueShape=Tr;exports.isAggregateRangeOperator=La;exports.isAggregateSingleOperator=qa;exports.isOperatorSupportedForTarget=ir;exports.projectNarrowing=Sr;exports.stitchFieldMaps=vr;exports.toPrisma=Xh;exports.toSql=jx;exports.validateFieldMap=Qf;exports.validateFieldMapSet=Fa;exports.validateNarrowing=Zf;exports.validateRule=Pl;//# sourceMappingURL=index.cjs.map
 //# sourceMappingURL=index.cjs.map