@gusto/baerly-storage 0.2.0 → 0.4.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (155) hide show
  1. package/LICENSE +202 -0
  2. package/NOTICE +29 -0
  3. package/README.md +176 -70
  4. package/dist/API.md +213 -139
  5. package/dist/CHANGELOG.md +434 -0
  6. package/dist/RECIPES.md +125 -0
  7. package/dist/THIRD-PARTY-LICENSES.txt +238 -0
  8. package/dist/{app-config-C0Bbw_Z6.d.ts → app-config-DyiFK3_k.d.ts} +55 -11
  9. package/dist/app-config.d.ts +1 -1
  10. package/dist/auth.d.ts +1 -1
  11. package/dist/auth.js +301 -301
  12. package/dist/auth.js.map +1 -1
  13. package/dist/aws4fetch.esm-p7eEzLCs.js +1702 -0
  14. package/dist/aws4fetch.esm-p7eEzLCs.js.map +1 -0
  15. package/dist/baerly.js +35 -15
  16. package/dist/baerly.js.map +1 -1
  17. package/dist/baerly.spec.json +342 -0
  18. package/dist/bytes-BXdamO3L.js.map +1 -1
  19. package/dist/{client-DYZfoZb9.d.ts → client-Fe8CwB73.d.ts} +10 -10
  20. package/dist/client-react.d.ts +3 -3
  21. package/dist/client-react.js +4 -4
  22. package/dist/client-react.js.map +1 -1
  23. package/dist/client.d.ts +4 -4
  24. package/dist/client.js +3 -3
  25. package/dist/client.js.map +1 -1
  26. package/dist/{cloudflare-CINJPKCW.js → cloudflare-DzKBrUlg.js} +178 -2
  27. package/dist/cloudflare-DzKBrUlg.js.map +1 -0
  28. package/dist/cloudflare.d.ts +49 -6
  29. package/dist/cloudflare.js +59 -26
  30. package/dist/cloudflare.js.map +1 -1
  31. package/dist/config-1tv0-Yzm.js +2693 -0
  32. package/dist/config-1tv0-Yzm.js.map +1 -0
  33. package/dist/constants-CfeMWQWk.js +222 -0
  34. package/dist/constants-CfeMWQWk.js.map +1 -0
  35. package/dist/context-DRZ3tZ5l.js.map +1 -1
  36. package/dist/{cost-CQt1YRkA.js → cost-DSMIVqzL.js} +43 -42
  37. package/dist/cost-DSMIVqzL.js.map +1 -0
  38. package/dist/current-json-C6nhPOm1.js +190 -0
  39. package/dist/current-json-C6nhPOm1.js.map +1 -0
  40. package/dist/{db-BM3y2JQw.d.ts → db-DsPkOVEH.d.ts} +26 -108
  41. package/dist/{deploy-CrAbfgCq.js → deploy-DonTr-CV.js} +12 -5
  42. package/dist/deploy-DonTr-CV.js.map +1 -0
  43. package/dist/dev-vite.d.ts +11 -7
  44. package/dist/dev-vite.js +7 -6
  45. package/dist/dev-vite.js.map +1 -1
  46. package/dist/dev.d.ts +1 -1
  47. package/dist/dev.js +1 -1
  48. package/dist/{doctor-Db-hzPmE.js → doctor-DSIyCDg_.js} +14 -136
  49. package/dist/doctor-DSIyCDg_.js.map +1 -0
  50. package/dist/{dump-BYA55NLP.js → dump-Bh5k26VQ.js} +10 -31
  51. package/dist/dump-Bh5k26VQ.js.map +1 -0
  52. package/dist/{errors-DOdL95kK.js → errors-Dfa3p78c.js} +25 -5
  53. package/dist/errors-Dfa3p78c.js.map +1 -0
  54. package/dist/{export-Bhbz90-z.js → export-DtF5tDIM.js} +11 -32
  55. package/dist/{export-Bhbz90-z.js.map → export-DtF5tDIM.js.map} +1 -1
  56. package/dist/{fsck-CPPZWt9p.js → fsck-D_djMO5D.js} +28 -39
  57. package/dist/fsck-D_djMO5D.js.map +1 -0
  58. package/dist/{http-Cw8p6y5b.js → http-DxM9MflO.js} +151 -79
  59. package/dist/http-DxM9MflO.js.map +1 -0
  60. package/dist/http.d.ts +42 -26
  61. package/dist/http.js +3 -2
  62. package/dist/{index-DwDTWPSU.d.ts → index-0rZcMBwy.d.ts} +10 -7
  63. package/dist/{index-C3JAH1Yo.d.ts → index-B6oexfOB.d.ts} +9 -9
  64. package/dist/{index-cUY-36AN.d.ts → index-BNRh23K9.d.ts} +21 -5
  65. package/dist/{index-DSvwEUeF.d.ts → index-BYk9oCNf.d.ts} +240 -202
  66. package/dist/index.d.ts +6 -6
  67. package/dist/index.js +5 -5
  68. package/dist/{indexes-DAu2AkTW.d.ts → indexes-Dn9hbGQG.d.ts} +2 -2
  69. package/dist/{inspect-Bdbzvi-_.js → inspect-6WZ-pC7-.js} +21 -36
  70. package/dist/inspect-6WZ-pC7-.js.map +1 -0
  71. package/dist/key-Di6yyxFu.js +35 -0
  72. package/dist/key-Di6yyxFu.js.map +1 -0
  73. package/dist/{snapshot-SS8USDUF.js → log-tail-D98U1JBo.js} +179 -84
  74. package/dist/log-tail-D98U1JBo.js.map +1 -0
  75. package/dist/{maintenance-ClzBC1Vv.js → maintenance-B4Dki6Ig.js} +438 -176
  76. package/dist/maintenance-B4Dki6Ig.js.map +1 -0
  77. package/dist/{maintenance-BRrThz8V.d.ts → maintenance-B_e0T99L.d.ts} +114 -26
  78. package/dist/{maintenance-BvOv6BMM.js → maintenance-C7coQp4c.js} +217 -94
  79. package/dist/maintenance-C7coQp4c.js.map +1 -0
  80. package/dist/maintenance.d.ts +3 -2
  81. package/dist/maintenance.js +3 -2
  82. package/dist/node.d.ts +176 -68
  83. package/dist/node.js +3 -2
  84. package/dist/{normalize-XWY25_sG.js → normalize-rjnZLwS4.js} +2 -2
  85. package/dist/normalize-rjnZLwS4.js.map +1 -0
  86. package/dist/{observability-CpOiEN0k.js → observability-wzs3-BL_.js} +279 -109
  87. package/dist/observability-wzs3-BL_.js.map +1 -0
  88. package/dist/observability.d.ts +3 -3
  89. package/dist/observability.js +1 -1
  90. package/dist/{plan-DOTl21vq.js → plan-a7PJHBCy.js} +7 -4
  91. package/dist/plan-a7PJHBCy.js.map +1 -0
  92. package/dist/{query-BmiQy328.js → query-rAtXNQQB.js} +1063 -1202
  93. package/dist/query-rAtXNQQB.js.map +1 -0
  94. package/dist/{rebuild-index-DC_nR6wP.js → rebuild-index-BVzQSZlm.js} +10 -32
  95. package/dist/rebuild-index-BVzQSZlm.js.map +1 -0
  96. package/dist/{request-BEF_OvMh.js → request-u0M51mhJ.js} +3 -3
  97. package/dist/{request-BEF_OvMh.js.map → request-u0M51mhJ.js.map} +1 -1
  98. package/dist/restore-R-4rbciV.js +778 -0
  99. package/dist/restore-R-4rbciV.js.map +1 -0
  100. package/dist/runtime-spec-qL3_lTTU.js +391 -0
  101. package/dist/runtime-spec-qL3_lTTU.js.map +1 -0
  102. package/dist/s3-http-B-z8th6O.d.ts +60 -0
  103. package/dist/s3.d.ts +47 -0
  104. package/dist/s3.js +45 -0
  105. package/dist/s3.js.map +1 -0
  106. package/dist/{shared-secret-BJdSwpgw.js → shared-secret-DgEicd3x.js} +13 -5
  107. package/dist/shared-secret-DgEicd3x.js.map +1 -0
  108. package/dist/src-BG20LZs7.js +2271 -0
  109. package/dist/src-BG20LZs7.js.map +1 -0
  110. package/dist/{src-zhEAmmF7.js → src-CYHFDrKz.js} +82 -99
  111. package/dist/src-CYHFDrKz.js.map +1 -0
  112. package/dist/{src-QQ7jDeL2.js → src-DYZ4H1aF.js} +44 -23
  113. package/dist/src-DYZ4H1aF.js.map +1 -0
  114. package/dist/subcommand-DoDA-K7d.js +197 -0
  115. package/dist/subcommand-DoDA-K7d.js.map +1 -0
  116. package/dist/time-DUqvFMHq.js +119 -0
  117. package/dist/time-DUqvFMHq.js.map +1 -0
  118. package/dist/{usage-CLjirdD-.js → usage-DBV1eQHC.js} +7 -22
  119. package/dist/usage-DBV1eQHC.js.map +1 -0
  120. package/dist/{validate-DCq_0DIn.js → validate-DtljsCh1.js} +51 -51
  121. package/dist/{validate-DCq_0DIn.js.map → validate-DtljsCh1.js.map} +1 -1
  122. package/dist/wire-izfGZDvr.js.map +1 -1
  123. package/package.json +77 -42
  124. package/dist/cloudflare-CINJPKCW.js.map +0 -1
  125. package/dist/config-DVfDGyw1.js +0 -278
  126. package/dist/config-DVfDGyw1.js.map +0 -1
  127. package/dist/cost-CQt1YRkA.js.map +0 -1
  128. package/dist/current-json-C-EyJqs0.js +0 -354
  129. package/dist/current-json-C-EyJqs0.js.map +0 -1
  130. package/dist/deploy-CrAbfgCq.js.map +0 -1
  131. package/dist/doctor-Db-hzPmE.js.map +0 -1
  132. package/dist/dump-BYA55NLP.js.map +0 -1
  133. package/dist/errors-DOdL95kK.js.map +0 -1
  134. package/dist/fsck-CPPZWt9p.js.map +0 -1
  135. package/dist/http-Cw8p6y5b.js.map +0 -1
  136. package/dist/inspect-Bdbzvi-_.js.map +0 -1
  137. package/dist/maintenance-BvOv6BMM.js.map +0 -1
  138. package/dist/maintenance-ClzBC1Vv.js.map +0 -1
  139. package/dist/normalize-XWY25_sG.js.map +0 -1
  140. package/dist/observability-CpOiEN0k.js.map +0 -1
  141. package/dist/plan-DOTl21vq.js.map +0 -1
  142. package/dist/query-BmiQy328.js.map +0 -1
  143. package/dist/rebuild-index-DC_nR6wP.js.map +0 -1
  144. package/dist/restore-C6IcmLeA.js +0 -771
  145. package/dist/restore-C6IcmLeA.js.map +0 -1
  146. package/dist/shared-secret-BJdSwpgw.js.map +0 -1
  147. package/dist/snapshot-SS8USDUF.js.map +0 -1
  148. package/dist/src-DU1sCMlr.js +0 -6236
  149. package/dist/src-DU1sCMlr.js.map +0 -1
  150. package/dist/src-QQ7jDeL2.js.map +0 -1
  151. package/dist/src-zhEAmmF7.js.map +0 -1
  152. package/dist/subcommand-DZcHcsYp.js +0 -5122
  153. package/dist/subcommand-DZcHcsYp.js.map +0 -1
  154. package/dist/usage-CLjirdD-.js.map +0 -1
  155. /package/dist/{chunk-EAsCxrDo.js → rolldown-runtime-EAsCxrDo.js} +0 -0
@@ -1 +1 @@
1
- {"version":3,"file":"validate-DCq_0DIn.js","names":[],"sources":["../packages/protocol/src/query/_internals.ts","../packages/protocol/src/query/matches.ts","../packages/protocol/src/query/satisfiable.ts","../packages/protocol/src/query/validate.ts"],"sourcesContent":["/**\n * Shared helpers for the predicate algebras in `./validate.ts`,\n * `./matches.ts`, and `./merge.ts`. These exist as a single module\n * because more than one of those files uses them and duplicating\n * the implementations would drift over time.\n *\n * Only {@link deepEqualDocumentValue} is part of the public surface;\n * the comparator primitives (`compareScalar`, `sameComparableType`,\n * `formatPath`) are internal to the protocol package and imported\n * by `./validate.ts` / `./merge.ts` / `./normalize.ts` directly.\n */\n\nimport type { DocumentValue } from \"../json.ts\";\n\n/** @internal Same primitive type for comparison purposes. */\nexport const sameComparableType = (a: DocumentValue, b: DocumentValue): boolean =>\n (typeof a === \"string\" && typeof b === \"string\") ||\n (typeof a === \"number\" && typeof b === \"number\");\n\n/**\n * @internal Returns negative / zero / positive for a<b / a==b / a>b.\n */\nexport const compareScalar = (a: DocumentValue, b: DocumentValue): number => {\n if (typeof a === \"number\" && typeof b === \"number\") {\n return a - b;\n }\n if (typeof a === \"string\" && typeof b === \"string\") {\n if (a < b) {\n return -1;\n }\n if (a > b) {\n return 1;\n }\n return 0;\n }\n return 0;\n};\n\n/** @internal Render a predicate path for use in error messages. */\nexport const formatPath = (path: ReadonlyArray<string>): string =>\n path.length === 0 ? \"<root>\" : path.map((p) => JSON.stringify(p)).join(\".\");\n\n/**\n * Recursive structural equality for `DocumentValue` values. Lifted to\n * `export` so the filtered-index implication checker (in\n * `@baerly/server`'s query planner) and other callers can reuse the\n * same comparison rule the validator + merger already trust. Two\n * values `a` and `b` are equal iff:\n *\n * - they are reference-equal (covers primitives and object identity);\n * - or they are both non-`null` objects with the same key set, and\n * every value pair is recursively equal.\n *\n * Arrays are out-of-band for `DocumentValue`; this function rejects\n * them implicitly via the same key-set walk (an array reads as an\n * object with numeric-string keys plus a `length` exposure that\n * `Object.keys` happens to skip — defensive callers should still gate\n * with `Array.isArray` first).\n */\nexport const deepEqualDocumentValue = (a: DocumentValue, b: DocumentValue): boolean => {\n if (a === b) {\n return true;\n } // primitives + object identity\n if (typeof a !== \"object\" || typeof b !== \"object\") {\n return false;\n }\n const aKeys = Object.keys(a);\n const bKeys = Object.keys(b);\n if (aKeys.length !== bKeys.length) {\n return false;\n }\n for (const key of aKeys) {\n // Stryker disable next-line ConditionalExpression,BlockStatement: equivalent — a key in aKeys but absent from b makes b[key] undefined, which the `aSub === undefined || bSub === undefined` guard below catches identically; no input observes the difference.\n if (!(key in b)) {\n return false;\n }\n const aSub = (a as Record<string, DocumentValue>)[key];\n const bSub = (b as Record<string, DocumentValue>)[key];\n // Stryker disable next-line LogicalOperator,ConditionalExpression: equivalent — this guard is a redundant fast-path. Whichever way it is mutated (operator `||`→`&&`, or either `=== undefined` operand forced to false), a slot that is undefined still flows into deepEqualDocumentValue below, whose typeof check returns false for `(undefined, defined)`; the only case that reaches `true` is both-undefined, which the surviving sibling operand still catches. No input over 500k randomized DocumentValues observes a difference.\n if (aSub === undefined || bSub === undefined) {\n return false;\n }\n if (!deepEqualDocumentValue(aSub, bSub)) {\n return false;\n }\n }\n return true;\n};\n","/**\n * Wire predicate evaluator. Walks a validated {@link PredicateWire}\n * against a `JSONObject` document and returns `true` iff every\n * clause holds. Multiple clauses across all fields AND together.\n *\n * Pre-condition: `wire` must have been returned by\n * {@link validateWire} (see `./validate.ts`). Passing an\n * un-validated wire is a caller bug; behaviour is undefined.\n *\n * Companion modules: `./validate.ts` (construction-time check),\n * `./merge.ts` (AND-merge), `./wire.ts` (types).\n */\n\nimport type { DocumentValue, JSONObject, JSONValue } from \"../json.ts\";\n\nimport type { PredicateClause, PredicateWire } from \"./wire.ts\";\n\n/**\n * Evaluate a validated wire-form predicate against a `JSONObject`\n * document. Returns `true` iff every clause holds.\n *\n * @example\n * ```ts\n * matchesWire(\n * { clauses: [{ op: \"eq\", field: \"status\", value: \"open\" }] },\n * { status: \"open\", priority: \"p1\" },\n * ); // true\n *\n * matchesWire(\n * { clauses: [{ op: \"in\", field: \"priority\", value: [\"p1\", \"p2\"] }] },\n * { priority: \"p3\" },\n * ); // false\n *\n * matchesWire(\n * {\n * clauses: [\n * { op: \"gte\", field: \"count\", value: 1 },\n * { op: \"lt\", field: \"count\", value: 10 },\n * ],\n * },\n * { count: 5 },\n * ); // true\n * ```\n */\nexport const matchesWire = (wire: PredicateWire, doc: JSONObject): boolean => {\n for (const clause of wire.clauses) {\n const actual = lookupPath(doc, clause.field);\n if (!matchesClause(clause, actual)) {\n return false;\n }\n }\n return true;\n};\n\nconst lookupPath = (doc: JSONObject, field: string): JSONValue | undefined => {\n // Fast path: no dot → top-level lookup. Avoids allocating a split\n // array for the common case.\n // Stryker disable next-line StringLiteral,BlockStatement,ConditionalExpression: fast-path equivalence — for any valid field, the slow split-and-traverse path produces the same result; the fast path is a performance optimisation only\n if (!field.includes(\".\")) {\n return doc[field];\n }\n const segments = field.split(\".\");\n let cursor: JSONValue | undefined = doc;\n for (const segment of segments) {\n if (\n // Stryker disable next-line ConditionalExpression: redundant guard — cursor===undefined is always caught by the typeof check on the next line (typeof undefined!==\"object\" is true); removing this check is observationally equivalent\n cursor === undefined ||\n cursor === null ||\n // Stryker disable next-line ConditionalExpression: redundant guard — for non-object primitives, (primitive as JSONObject)[segment] returns undefined; the next iteration's cursor===undefined check catches it; removing this check produces the same return value\n typeof cursor !== \"object\" ||\n Array.isArray(cursor)\n ) {\n // Traversal hit a primitive, null, missing key, or array\n // before consuming the path. Predicate cannot match.\n return undefined;\n }\n cursor = (cursor as JSONObject)[segment];\n }\n return cursor;\n};\n\nconst matchesClause = (clause: PredicateClause, actual: JSONValue | undefined): boolean => {\n switch (clause.op) {\n case \"eq\": {\n return matchesEq(clause.value as DocumentValue, actual);\n }\n case \"in\": {\n return matchesIn(clause.value as ReadonlyArray<DocumentValue>, actual);\n }\n case \"gt\": {\n return compareGT(actual, clause.value as DocumentValue, false);\n }\n case \"gte\": {\n return compareGT(actual, clause.value as DocumentValue, true);\n }\n case \"lt\": {\n return compareLT(actual, clause.value as DocumentValue, false);\n }\n case \"lte\": {\n return compareLT(actual, clause.value as DocumentValue, true);\n }\n }\n};\n\nconst matchesEq = (expected: DocumentValue, actual: JSONValue | undefined): boolean => {\n if (typeof expected === \"object\") {\n // Nested object equality is a sub-predicate match — open-world:\n // doc may carry extra keys. The object-form normaliser flattens\n // nested sub-predicates to dotted-path clauses on the way in, so\n // the only callers reaching this branch are callback-form\n // `q.eq(\"nested\", { ... })`.\n if (\n // Stryker disable next-line ConditionalExpression: redundant guard — actual===undefined is caught by the typeof check below (typeof undefined!==\"object\" is true); removing this check produces the same false result\n actual === undefined ||\n actual === null ||\n typeof actual !== \"object\" ||\n Array.isArray(actual)\n ) {\n return false;\n }\n for (const subKey of Object.keys(expected)) {\n const subExpected = (expected as Record<string, DocumentValue>)[subKey];\n if (subExpected === undefined) {\n continue;\n }\n const subActual = (actual as JSONObject)[subKey];\n if (!matchesEq(subExpected, subActual)) {\n return false;\n }\n }\n return true;\n }\n return expected === actual;\n};\n\nconst matchesIn = (\n members: ReadonlyArray<DocumentValue>,\n actual: JSONValue | undefined,\n): boolean => {\n for (const m of members) {\n // Stryker disable next-line ConditionalExpression: equivalence — for non-null primitives, matchesEq(m, actual) reduces to `m === actual` (the typeof check fails); routing all members through matchesEq (→true) gives the same result as the two-branch structure\n if (typeof m === \"object\") {\n if (matchesEq(m, actual)) {\n return true;\n }\n } else if (m === actual) {\n return true;\n }\n }\n return false;\n};\n\nconst compareGT = (\n actual: JSONValue | undefined,\n bound: DocumentValue,\n inclusive: boolean,\n): boolean => {\n if (typeof bound === \"string\") {\n return typeof actual === \"string\" && (inclusive ? actual >= bound : actual > bound);\n }\n if (typeof bound === \"number\") {\n return typeof actual === \"number\" && (inclusive ? actual >= bound : actual > bound);\n }\n // Validator forbids boolean / null / object range bounds; defensive miss.\n return false;\n};\n\nconst compareLT = (\n actual: JSONValue | undefined,\n bound: DocumentValue,\n inclusive: boolean,\n): boolean => {\n if (typeof bound === \"string\") {\n return typeof actual === \"string\" && (inclusive ? actual <= bound : actual < bound);\n }\n if (typeof bound === \"number\") {\n return typeof actual === \"number\" && (inclusive ? actual <= bound : actual < bound);\n }\n return false;\n};\n","/**\n * Per-field satisfiability check for a {@link PredicateWire}. Groups\n * clauses by field, then runs the same logic the pre-redesign\n * `assertOpObjectSatisfiable` ran on a single op-object — but\n * generalised across N clauses on the same field (the wire merger\n * concatenates lists without coalescing).\n *\n * Triggers:\n * - Two `eq` clauses on the same field with different values →\n * `InvalidConfig` (the same conflict that pre-redesign\n * `mergePredicates` threw on shared primitive keys).\n * - Range bounds with `lo > hi` (or `lo == hi` with strict on\n * either side) → `UnsatisfiablePredicate`.\n * - `eq` value outside the residual range interval or absent from\n * every `in` set on the same field → `UnsatisfiablePredicate`.\n * - `in` sets that intersect to empty across multiple clauses →\n * `UnsatisfiablePredicate`.\n *\n * Used by both `./validate.ts` (wire-arrival check) and\n * `./merge.ts` (post-merge re-check, kept in lockstep).\n */\n\nimport { BaerlyError } from \"../errors.ts\";\nimport type { DocumentValue } from \"../json.ts\";\n\nimport {\n compareScalar,\n deepEqualDocumentValue,\n formatPath,\n sameComparableType,\n} from \"./_internals.ts\";\nimport type { PredicateClause, PredicateWire } from \"./wire.ts\";\n\ninterface FieldGroup {\n readonly eqs: DocumentValue[];\n readonly ins: ReadonlyArray<DocumentValue>[];\n lo?: { value: DocumentValue; inclusive: boolean };\n hi?: { value: DocumentValue; inclusive: boolean };\n}\n\nconst groupByField = (wire: PredicateWire): Map<string, FieldGroup> => {\n const out = new Map<string, FieldGroup>();\n for (const clause of wire.clauses) {\n let group = out.get(clause.field);\n if (group === undefined) {\n group = { eqs: [], ins: [] };\n out.set(clause.field, group);\n }\n applyClause(group, clause.field, clause);\n }\n return out;\n};\n\nconst applyClause = (group: FieldGroup, field: string, clause: PredicateClause): void => {\n switch (clause.op) {\n case \"eq\": {\n group.eqs.push(clause.value as DocumentValue);\n return;\n }\n case \"in\": {\n group.ins.push(clause.value as ReadonlyArray<DocumentValue>);\n return;\n }\n case \"gt\": {\n tightenLower(group, field, clause.value as DocumentValue, false);\n return;\n }\n case \"gte\": {\n tightenLower(group, field, clause.value as DocumentValue, true);\n return;\n }\n case \"lt\": {\n tightenUpper(group, field, clause.value as DocumentValue, false);\n return;\n }\n case \"lte\": {\n tightenUpper(group, field, clause.value as DocumentValue, true);\n return;\n }\n }\n};\n\nconst tightenLower = (\n group: FieldGroup,\n field: string,\n value: DocumentValue,\n inclusive: boolean,\n): void => {\n if (group.lo === undefined) {\n group.lo = { value, inclusive };\n return;\n }\n if (!sameComparableType(group.lo.value, value)) {\n // Type-incompatible bounds on the same field — the user wrote\n // (say) `q.gt(\"x\", 1).gt(\"x\", \"a\")`. Range matching is type-\n // strict at evaluation time so this is always-miss; surface\n // eagerly as `UnsatisfiablePredicate`.\n throw new BaerlyError(\n \"UnsatisfiablePredicate\",\n `Predicate on field ${formatPath([field])} has type-incompatible lower bounds (${JSON.stringify(group.lo.value)} vs ${JSON.stringify(value)}).`,\n );\n }\n const c = compareScalar(group.lo.value, value);\n // Stryker disable next-line ConditionalExpression: two sub-expression-to-true mutants are\n // equivalent. (1) `inclusive === false → true`: fires when c=0, existing=inclusive,\n // new=inclusive — tighten updates lo to {value, inclusive=true}, identical to the existing\n // {same value, inclusive=true}; no observable change. (2) `group.lo.inclusive === true → true`:\n // fires when c=0, new=exclusive, existing=exclusive — tighten updates lo to {value, false},\n // identical to existing {same value, false}; no observable change.\n if (c < 0 || (c === 0 && inclusive === false && group.lo.inclusive === true)) {\n group.lo = { value, inclusive };\n }\n};\n\nconst tightenUpper = (\n group: FieldGroup,\n field: string,\n value: DocumentValue,\n inclusive: boolean,\n): void => {\n if (group.hi === undefined) {\n group.hi = { value, inclusive };\n return;\n }\n if (!sameComparableType(group.hi.value, value)) {\n throw new BaerlyError(\n \"UnsatisfiablePredicate\",\n `Predicate on field ${formatPath([field])} has type-incompatible upper bounds (${JSON.stringify(group.hi.value)} vs ${JSON.stringify(value)}).`,\n );\n }\n const c = compareScalar(group.hi.value, value);\n // Stryker disable next-line ConditionalExpression: two sub-expression-to-true mutants are\n // equivalent. (1) `inclusive === false → true`: fires when c=0, existing=inclusive,\n // new=inclusive — tighten updates hi to {value, inclusive=true}, same as existing; no change.\n // (2) `group.hi.inclusive === true → true`: fires when c=0, new=exclusive, existing=exclusive —\n // tighten updates hi to {value, false}, same as existing; no observable change.\n if (c > 0 || (c === 0 && inclusive === false && group.hi.inclusive === true)) {\n group.hi = { value, inclusive };\n }\n};\n\nconst intersectInSets = (\n sets: ReadonlyArray<ReadonlyArray<DocumentValue>>,\n): ReadonlyArray<DocumentValue> => {\n // Stryker disable ConditionalExpression,BlockStatement,ArrayDeclaration: dead-code guard\n // — callers only invoke intersectInSets when group.ins.length > 1 (i.e., sets.length >= 2),\n // so sets.length === 0 is unreachable in production. Any mutation here is an equivalent mutant.\n if (sets.length === 0) {\n return [];\n }\n // Stryker restore ConditionalExpression,BlockStatement,ArrayDeclaration\n let acc: ReadonlyArray<DocumentValue> = sets[0]!;\n for (let i = 1; i < sets.length; i++) {\n const next: DocumentValue[] = [];\n for (const a of acc) {\n for (const b of sets[i]!) {\n if (deepEqualDocumentValue(a, b)) {\n next.push(a);\n break;\n }\n }\n }\n acc = next;\n }\n return acc;\n};\n\n/**\n * Check that every per-field clause group on `wire` is jointly\n * satisfiable. Throws `BaerlyError{code:\"UnsatisfiablePredicate\"}`\n * (or `\"InvalidConfig\"` for conflicting `eq` clauses) on the\n * first contradiction. Returns `void` on success.\n */\nexport const assertWireSatisfiable = (wire: PredicateWire): void => {\n const groups = groupByField(wire);\n for (const [field, group] of groups) {\n // Multiple `eq` clauses on the same field must agree.\n // Stryker disable next-line EqualityOperator,ConditionalExpression: equivalent — the inner\n // loop starts at i=1, so with 0 or 1 eqs the loop body never executes regardless of whether\n // we enter the outer if. `>= 1` enters with 1 eq (0 loop iterations); `true` enters with 0\n // eqs (0 loop iterations). Both are observationally identical to `> 1`.\n if (group.eqs.length > 1) {\n for (let i = 1; i < group.eqs.length; i++) {\n if (!deepEqualDocumentValue(group.eqs[0]!, group.eqs[i]!)) {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Conflicting equality clauses on field ${formatPath([field])} (${JSON.stringify(group.eqs[0]!)} vs ${JSON.stringify(group.eqs[i]!)}). Predicate chains must agree on shared equality.`,\n );\n }\n }\n }\n const eq = group.eqs[0];\n // Range interval must be non-empty.\n if (\n group.lo !== undefined &&\n group.hi !== undefined &&\n sameComparableType(group.lo.value, group.hi.value)\n ) {\n const c = compareScalar(group.lo.value, group.hi.value);\n if (c > 0 || (c === 0 && (!group.lo.inclusive || !group.hi.inclusive))) {\n throw new BaerlyError(\n \"UnsatisfiablePredicate\",\n `Predicate on field ${formatPath([field])} has empty interval (lo=${JSON.stringify(group.lo.value)} ${group.lo.inclusive ? \"gte\" : \"gt\"}, hi=${JSON.stringify(group.hi.value)} ${group.hi.inclusive ? \"lte\" : \"lt\"}).`,\n );\n }\n }\n // `eq` outside the residual interval / membership set.\n if (eq !== undefined) {\n if (group.lo !== undefined) {\n if (!sameComparableType(eq, group.lo.value)) {\n throw new BaerlyError(\n \"UnsatisfiablePredicate\",\n `Predicate on field ${formatPath([field])} eq=${JSON.stringify(eq)} (${typeof eq}) is type-incompatible with lower bound ${JSON.stringify(group.lo.value)} (${typeof group.lo.value}); range ops require matching primitive types.`,\n );\n }\n const c = compareScalar(eq, group.lo.value);\n if (c < 0 || (c === 0 && !group.lo.inclusive)) {\n throw new BaerlyError(\n \"UnsatisfiablePredicate\",\n `Predicate on field ${formatPath([field])} eq=${JSON.stringify(eq)} excluded by lower bound ${JSON.stringify(group.lo.value)} (${group.lo.inclusive ? \"gte\" : \"gt\"}).`,\n );\n }\n }\n if (group.hi !== undefined) {\n if (!sameComparableType(eq, group.hi.value)) {\n throw new BaerlyError(\n \"UnsatisfiablePredicate\",\n `Predicate on field ${formatPath([field])} eq=${JSON.stringify(eq)} (${typeof eq}) is type-incompatible with upper bound ${JSON.stringify(group.hi.value)} (${typeof group.hi.value}); range ops require matching primitive types.`,\n );\n }\n const c = compareScalar(eq, group.hi.value);\n if (c > 0 || (c === 0 && !group.hi.inclusive)) {\n throw new BaerlyError(\n \"UnsatisfiablePredicate\",\n `Predicate on field ${formatPath([field])} eq=${JSON.stringify(eq)} excluded by upper bound ${JSON.stringify(group.hi.value)} (${group.hi.inclusive ? \"lte\" : \"lt\"}).`,\n );\n }\n }\n // Stryker disable next-line EqualityOperator,ConditionalExpression: equivalent — the for-of\n // loop over group.ins is a no-op when group.ins is empty, so `>= 0` (always true) and\n // `true` (always enter) produce identical behavior: zero iterations when ins is empty,\n // same iterations as `> 0` when ins is non-empty.\n if (group.ins.length > 0) {\n for (const set of group.ins) {\n let found = false;\n for (const m of set) {\n if (deepEqualDocumentValue(eq, m)) {\n found = true;\n break;\n }\n }\n if (!found) {\n throw new BaerlyError(\n \"UnsatisfiablePredicate\",\n `Predicate on field ${formatPath([field])} eq=${JSON.stringify(eq)} not present in in() set.`,\n );\n }\n }\n }\n }\n // Multiple `in` sets must intersect non-empty.\n // Stryker disable next-line EqualityOperator: equivalent — intersectInSets([single_set])\n // returns that set unchanged; since validateWire rejects empty in-arrays, the single set\n // is always non-empty, so isect.length === 0 is false and no throw occurs. `>= 1` (entering\n // with 1 in-set) behaves identically to `> 1` (skipping for 1 in-set).\n if (group.ins.length > 1) {\n const isect = intersectInSets(group.ins);\n if (isect.length === 0) {\n throw new BaerlyError(\n \"UnsatisfiablePredicate\",\n `Predicate on field ${formatPath([field])} has empty in() intersection across multiple clauses.`,\n );\n }\n }\n }\n};\n","/**\n * Wire predicate validator. Walks a {@link PredicateWire} and throws\n * on a structurally bad clause (`BaerlyError{code:\"InvalidConfig\"}`)\n * or a per-field clause group that contradicts itself\n * (`BaerlyError{code:\"UnsatisfiablePredicate\"}`).\n *\n * The object-form normaliser at `./normalize.ts` enforces shape on\n * the way in (rejecting `$`-keys / non-scalars / null / undefined);\n * the callback builder at `./builder.ts` enforces shape via the\n * type system. This validator is the wire-arrival check: it runs\n * over already-normalised clauses, defending against raw-`fetch`\n * callers who bypass the typed seam and submit arbitrary JSON.\n *\n * Companion modules: `./matches.ts` (evaluator), `./merge.ts`\n * (AND-merge). Shared helpers live in `./_internals.ts`.\n */\n\nimport { BaerlyError } from \"../errors.ts\";\n\nimport { assertWireSatisfiable } from \"./satisfiable.ts\";\nimport type { PredicateClause, PredicateOpName, PredicateWire } from \"./wire.ts\";\n\nconst OP_NAMES: ReadonlyArray<PredicateOpName> = [\"eq\", \"gt\", \"gte\", \"lt\", \"lte\", \"in\"];\nconst RANGE_OPS: ReadonlyArray<PredicateOpName> = [\"gt\", \"gte\", \"lt\", \"lte\"];\n\n/**\n * Validate a normalised predicate wire. Throws\n * `BaerlyError{code:\"InvalidConfig\"}` on a structurally bad clause,\n * or `BaerlyError{code:\"UnsatisfiablePredicate\"}` when a clause\n * group on one field contradicts itself.\n *\n * Returns the wire unchanged on success — callers can thread the\n * validated wire forward.\n *\n * @example\n * ```ts\n * validateWire({ clauses: [{ op: \"eq\", field: \"status\", value: \"open\" }] }); // ok\n * validateWire({ clauses: [{ op: \"in\", field: \"priority\", value: [] }] }); // throws UnsatisfiablePredicate\n * validateWire({ clauses: [{ op: \"eq\", field: \"_id\", value: \"x\" }] }); // throws InvalidConfig (top-level _id)\n * ```\n */\nexport const validateWire = (wire: PredicateWire): PredicateWire => {\n if (\n wire === null ||\n typeof wire !== \"object\" ||\n !Array.isArray((wire as { clauses?: unknown }).clauses)\n ) {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Predicate wire must be an object with a \"clauses\" array.`,\n );\n }\n for (let i = 0; i < wire.clauses.length; i++) {\n validateClause(wire.clauses[i]!, i);\n }\n assertWireSatisfiable(wire);\n return wire;\n};\n\nconst validateClause = (clause: PredicateClause, index: number): void => {\n if (clause === null || typeof clause !== \"object\") {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Predicate clause at index ${index} must be an object — got ${JSON.stringify(clause)}.`,\n );\n }\n const { op, field, value } = clause;\n // Stryker disable next-line ConditionalExpression: `typeof op !== \"string\"` is redundant —\n // OP_NAMES contains only string literals; Array.prototype.includes uses SameValueZero\n // (effectively ===), so any non-string op is already rejected by the `!includes` half.\n // The early string-type check is a readability guard, not an observable branch.\n if (typeof op !== \"string\" || !(OP_NAMES as ReadonlyArray<string>).includes(op)) {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Predicate clause at index ${index} has unsupported op ${JSON.stringify(op)} — supported: ${OP_NAMES.join(\" / \")}.`,\n );\n }\n if (typeof field !== \"string\" || field.length === 0) {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Predicate clause at index ${index} has empty / non-string field.`,\n );\n }\n // Reject `_id` AND any nested `_id.<path>` — `Path<T>` excludes both\n // (`\"_id\" | \\`_id.${string}\\``), so a raw-wire caller (the threat this\n // validator names) must not slip a dotted `_id.x` past a check that\n // only matched the exact root field.\n if (field === \"_id\" || field.startsWith(\"_id.\")) {\n throw new BaerlyError(\n \"InvalidConfig\",\n 'Predicates may not key on \"_id\"; use .get(id) / .update(id, patch) / .replace(id, doc) / .delete(id) instead.',\n );\n }\n if (op === \"in\") {\n if (!Array.isArray(value)) {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Predicate clause at index ${index} (op=\"in\", field=${JSON.stringify(field)}) must carry an array value.`,\n );\n }\n if (value.length === 0) {\n throw new BaerlyError(\n \"UnsatisfiablePredicate\",\n `Predicate clause at index ${index} (op=\"in\", field=${JSON.stringify(field)}) has empty value array — no document can match.`,\n );\n }\n for (let i = 0; i < value.length; i++) {\n validateMemberValue(value[i], field, index, i);\n }\n return;\n }\n if (Array.isArray(value)) {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Predicate clause at index ${index} (op=${JSON.stringify(op)}, field=${JSON.stringify(field)}) must carry a primitive value, got an array — only op=\"in\" accepts arrays.`,\n );\n }\n if ((RANGE_OPS as ReadonlyArray<string>).includes(op)) {\n validateRangeBound(value, field, index);\n return;\n }\n validateScalar(value, field, index);\n};\n\nconst validateMemberValue = (\n value: unknown,\n field: string,\n clauseIndex: number,\n memberIndex: number,\n): void => {\n // Stryker disable next-line ConditionalExpression: `|| value === undefined` is redundant —\n // undefined falls through to `typeof value` = \"undefined\", which is caught by the\n // `t !== \"string\" && t !== \"number\" && t !== \"boolean\"` check below with the same\n // InvalidConfig code. The early check gives a more descriptive \"undefined\" message\n // but no input can distinguish the two code paths via the public error code alone.\n if (value === null || value === undefined) {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Predicate clause at index ${clauseIndex} (op=\"in\", field=${JSON.stringify(field)}) member ${memberIndex} is ${value === null ? \"null\" : \"undefined\"} — members must be string / number / boolean / nested object.`,\n );\n }\n if (Array.isArray(value)) {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Predicate clause at index ${clauseIndex} (op=\"in\", field=${JSON.stringify(field)}) member ${memberIndex} is an array — members must be string / number / boolean / nested object.`,\n );\n }\n const t = typeof value;\n if (t === \"object\") {\n return;\n }\n if (t !== \"string\" && t !== \"number\" && t !== \"boolean\") {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Predicate clause at index ${clauseIndex} (op=\"in\", field=${JSON.stringify(field)}) member ${memberIndex} has unsupported type ${JSON.stringify(t)} — must be string / number / boolean / nested object.`,\n );\n }\n if (t === \"number\" && !Number.isFinite(value as number)) {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Predicate clause at index ${clauseIndex} (op=\"in\", field=${JSON.stringify(field)}) member ${memberIndex} is ${String(value)} — finite numbers only (NaN / Infinity do not round-trip through JSON).`,\n );\n }\n};\n\nconst validateScalar = (value: unknown, field: string, clauseIndex: number): void => {\n // Stryker disable next-line ConditionalExpression: `|| value === undefined` is redundant —\n // undefined falls through to `typeof value` = \"undefined\", caught by the\n // `t !== \"string\" && t !== \"number\" && t !== \"boolean\"` check with the same code.\n if (value === null || value === undefined) {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Predicate clause at index ${clauseIndex} (field=${JSON.stringify(field)}) value is ${value === null ? \"null\" : \"undefined\"} — terminal values must be string / number / boolean / nested object.`,\n );\n }\n const t = typeof value;\n if (t === \"object\") {\n // Equality clauses against nested objects survive only via callback\n // form (the normaliser flattens object-form sub-predicates to\n // dotted-path eq clauses). Keep the structural recursion light —\n // values are sealed from the typed seam.\n return;\n }\n if (t !== \"string\" && t !== \"number\" && t !== \"boolean\") {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Predicate clause at index ${clauseIndex} (field=${JSON.stringify(field)}) value has unsupported type ${JSON.stringify(t)} — must be string / number / boolean / nested object.`,\n );\n }\n if (t === \"number\" && !Number.isFinite(value as number)) {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Predicate clause at index ${clauseIndex} (field=${JSON.stringify(field)}) value is ${String(value)} — finite numbers only (NaN / Infinity do not round-trip through JSON).`,\n );\n }\n};\n\nconst validateRangeBound = (value: unknown, field: string, clauseIndex: number): void => {\n // Stryker disable next-line ConditionalExpression: `|| value === undefined` is redundant —\n // undefined falls through to `typeof value` = \"undefined\", caught by `t !== \"string\" && t !== \"number\"`\n // with the same InvalidConfig code.\n if (value === null || value === undefined) {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Predicate range bound at clause ${clauseIndex} (field=${JSON.stringify(field)}) is ${value === null ? \"null\" : \"undefined\"} — range bounds must be string or finite number.`,\n );\n }\n const t = typeof value;\n if (t === \"boolean\") {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Predicate range bound at clause ${clauseIndex} (field=${JSON.stringify(field)}) is a boolean — range bounds must be string or finite number (booleans are not ordered).`,\n );\n }\n if (t === \"object\") {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Predicate range bound at clause ${clauseIndex} (field=${JSON.stringify(field)}) is a nested object — range bounds must be string or finite number.`,\n );\n }\n if (t !== \"string\" && t !== \"number\") {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Predicate range bound at clause ${clauseIndex} (field=${JSON.stringify(field)}) has unsupported type ${JSON.stringify(t)} — must be string or finite number.`,\n );\n }\n if (t === \"number\" && !Number.isFinite(value as number)) {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Predicate range bound at clause ${clauseIndex} (field=${JSON.stringify(field)}) is ${String(value)} — finite numbers only (NaN / Infinity do not round-trip through JSON).`,\n );\n }\n};\n"],"mappings":";;;AAeA,MAAa,sBAAsB,GAAkB,MAClD,OAAO,MAAM,YAAY,OAAO,MAAM,YACtC,OAAO,MAAM,YAAY,OAAO,MAAM;;;;AAKzC,MAAa,iBAAiB,GAAkB,MAA6B;CAC3E,IAAI,OAAO,MAAM,YAAY,OAAO,MAAM,UACxC,OAAO,IAAI;CAEb,IAAI,OAAO,MAAM,YAAY,OAAO,MAAM,UAAU;EAClD,IAAI,IAAI,GACN,OAAO;EAET,IAAI,IAAI,GACN,OAAO;EAET,OAAO;CACT;CACA,OAAO;AACT;;AAGA,MAAa,cAAc,SACzB,KAAK,WAAW,IAAI,WAAW,KAAK,KAAK,MAAM,KAAK,UAAU,CAAC,CAAC,EAAE,KAAK,GAAG;;;;;;;;;;;;;;;;;;AAmB5E,MAAa,0BAA0B,GAAkB,MAA8B;CACrF,IAAI,MAAM,GACR,OAAO;CAET,IAAI,OAAO,MAAM,YAAY,OAAO,MAAM,UACxC,OAAO;CAET,MAAM,QAAQ,OAAO,KAAK,CAAC;CAC3B,MAAM,QAAQ,OAAO,KAAK,CAAC;CAC3B,IAAI,MAAM,WAAW,MAAM,QACzB,OAAO;CAET,KAAK,MAAM,OAAO,OAAO;EAEvB,IAAI,EAAE,OAAO,IACX,OAAO;EAET,MAAM,OAAQ,EAAoC;EAClD,MAAM,OAAQ,EAAoC;EAElD,IAAI,SAAS,KAAA,KAAa,SAAS,KAAA,GACjC,OAAO;EAET,IAAI,CAAC,uBAAuB,MAAM,IAAI,GACpC,OAAO;CAEX;CACA,OAAO;AACT;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC3CA,MAAa,eAAe,MAAqB,QAA6B;CAC5E,KAAK,MAAM,UAAU,KAAK,SAExB,IAAI,CAAC,cAAc,QADJ,WAAW,KAAK,OAAO,KACN,CAAC,GAC/B,OAAO;CAGX,OAAO;AACT;AAEA,MAAM,cAAc,KAAiB,UAAyC;CAI5E,IAAI,CAAC,MAAM,SAAS,GAAG,GACrB,OAAO,IAAI;CAEb,MAAM,WAAW,MAAM,MAAM,GAAG;CAChC,IAAI,SAAgC;CACpC,KAAK,MAAM,WAAW,UAAU;EAC9B,IAEE,WAAW,KAAA,KACX,WAAW,QAEX,OAAO,WAAW,YAClB,MAAM,QAAQ,MAAM,GAIpB;EAEF,SAAU,OAAsB;CAClC;CACA,OAAO;AACT;AAEA,MAAM,iBAAiB,QAAyB,WAA2C;CACzF,QAAQ,OAAO,IAAf;EACE,KAAK,MACH,OAAO,UAAU,OAAO,OAAwB,MAAM;EAExD,KAAK,MACH,OAAO,UAAU,OAAO,OAAuC,MAAM;EAEvE,KAAK,MACH,OAAO,UAAU,QAAQ,OAAO,OAAwB,KAAK;EAE/D,KAAK,OACH,OAAO,UAAU,QAAQ,OAAO,OAAwB,IAAI;EAE9D,KAAK,MACH,OAAO,UAAU,QAAQ,OAAO,OAAwB,KAAK;EAE/D,KAAK,OACH,OAAO,UAAU,QAAQ,OAAO,OAAwB,IAAI;CAEhE;AACF;AAEA,MAAM,aAAa,UAAyB,WAA2C;CACrF,IAAI,OAAO,aAAa,UAAU;EAMhC,IAEE,WAAW,KAAA,KACX,WAAW,QACX,OAAO,WAAW,YAClB,MAAM,QAAQ,MAAM,GAEpB,OAAO;EAET,KAAK,MAAM,UAAU,OAAO,KAAK,QAAQ,GAAG;GAC1C,MAAM,cAAe,SAA2C;GAChE,IAAI,gBAAgB,KAAA,GAClB;GAEF,MAAM,YAAa,OAAsB;GACzC,IAAI,CAAC,UAAU,aAAa,SAAS,GACnC,OAAO;EAEX;EACA,OAAO;CACT;CACA,OAAO,aAAa;AACtB;AAEA,MAAM,aACJ,SACA,WACY;CACZ,KAAK,MAAM,KAAK,SAEd,IAAI,OAAO,MAAM;MACX,UAAU,GAAG,MAAM,GACrB,OAAO;CAAA,OAEJ,IAAI,MAAM,QACf,OAAO;CAGX,OAAO;AACT;AAEA,MAAM,aACJ,QACA,OACA,cACY;CACZ,IAAI,OAAO,UAAU,UACnB,OAAO,OAAO,WAAW,aAAa,YAAY,UAAU,QAAQ,SAAS;CAE/E,IAAI,OAAO,UAAU,UACnB,OAAO,OAAO,WAAW,aAAa,YAAY,UAAU,QAAQ,SAAS;CAG/E,OAAO;AACT;AAEA,MAAM,aACJ,QACA,OACA,cACY;CACZ,IAAI,OAAO,UAAU,UACnB,OAAO,OAAO,WAAW,aAAa,YAAY,UAAU,QAAQ,SAAS;CAE/E,IAAI,OAAO,UAAU,UACnB,OAAO,OAAO,WAAW,aAAa,YAAY,UAAU,QAAQ,SAAS;CAE/E,OAAO;AACT;;;;;;;;;;;;;;;;;;;;;;;;AC3IA,MAAM,gBAAgB,SAAiD;CACrE,MAAM,sBAAM,IAAI,IAAwB;CACxC,KAAK,MAAM,UAAU,KAAK,SAAS;EACjC,IAAI,QAAQ,IAAI,IAAI,OAAO,KAAK;EAChC,IAAI,UAAU,KAAA,GAAW;GACvB,QAAQ;IAAE,KAAK,CAAC;IAAG,KAAK,CAAC;GAAE;GAC3B,IAAI,IAAI,OAAO,OAAO,KAAK;EAC7B;EACA,YAAY,OAAO,OAAO,OAAO,MAAM;CACzC;CACA,OAAO;AACT;AAEA,MAAM,eAAe,OAAmB,OAAe,WAAkC;CACvF,QAAQ,OAAO,IAAf;EACE,KAAK;GACH,MAAM,IAAI,KAAK,OAAO,KAAsB;GAC5C;EAEF,KAAK;GACH,MAAM,IAAI,KAAK,OAAO,KAAqC;GAC3D;EAEF,KAAK;GACH,aAAa,OAAO,OAAO,OAAO,OAAwB,KAAK;GAC/D;EAEF,KAAK;GACH,aAAa,OAAO,OAAO,OAAO,OAAwB,IAAI;GAC9D;EAEF,KAAK;GACH,aAAa,OAAO,OAAO,OAAO,OAAwB,KAAK;GAC/D;EAEF,KAAK;GACH,aAAa,OAAO,OAAO,OAAO,OAAwB,IAAI;GAC9D;CAEJ;AACF;AAEA,MAAM,gBACJ,OACA,OACA,OACA,cACS;CACT,IAAI,MAAM,OAAO,KAAA,GAAW;EAC1B,MAAM,KAAK;GAAE;GAAO;EAAU;EAC9B;CACF;CACA,IAAI,CAAC,mBAAmB,MAAM,GAAG,OAAO,KAAK,GAK3C,MAAM,IAAI,YACR,0BACA,sBAAsB,WAAW,CAAC,KAAK,CAAC,EAAE,uCAAuC,KAAK,UAAU,MAAM,GAAG,KAAK,EAAE,MAAM,KAAK,UAAU,KAAK,EAAE,GAC9I;CAEF,MAAM,IAAI,cAAc,MAAM,GAAG,OAAO,KAAK;CAO7C,IAAI,IAAI,KAAM,MAAM,KAAK,cAAc,SAAS,MAAM,GAAG,cAAc,MACrE,MAAM,KAAK;EAAE;EAAO;CAAU;AAElC;AAEA,MAAM,gBACJ,OACA,OACA,OACA,cACS;CACT,IAAI,MAAM,OAAO,KAAA,GAAW;EAC1B,MAAM,KAAK;GAAE;GAAO;EAAU;EAC9B;CACF;CACA,IAAI,CAAC,mBAAmB,MAAM,GAAG,OAAO,KAAK,GAC3C,MAAM,IAAI,YACR,0BACA,sBAAsB,WAAW,CAAC,KAAK,CAAC,EAAE,uCAAuC,KAAK,UAAU,MAAM,GAAG,KAAK,EAAE,MAAM,KAAK,UAAU,KAAK,EAAE,GAC9I;CAEF,MAAM,IAAI,cAAc,MAAM,GAAG,OAAO,KAAK;CAM7C,IAAI,IAAI,KAAM,MAAM,KAAK,cAAc,SAAS,MAAM,GAAG,cAAc,MACrE,MAAM,KAAK;EAAE;EAAO;CAAU;AAElC;AAEA,MAAM,mBACJ,SACiC;CAIjC,IAAI,KAAK,WAAW,GAClB,OAAO,CAAC;CAGV,IAAI,MAAoC,KAAK;CAC7C,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;EACpC,MAAM,OAAwB,CAAC;EAC/B,KAAK,MAAM,KAAK,KACd,KAAK,MAAM,KAAK,KAAK,IACnB,IAAI,uBAAuB,GAAG,CAAC,GAAG;GAChC,KAAK,KAAK,CAAC;GACX;EACF;EAGJ,MAAM;CACR;CACA,OAAO;AACT;;;;;;;AAQA,MAAa,yBAAyB,SAA8B;CAClE,MAAM,SAAS,aAAa,IAAI;CAChC,KAAK,MAAM,CAAC,OAAO,UAAU,QAAQ;EAMnC,IAAI,MAAM,IAAI,SAAS;QAChB,IAAI,IAAI,GAAG,IAAI,MAAM,IAAI,QAAQ,KACpC,IAAI,CAAC,uBAAuB,MAAM,IAAI,IAAK,MAAM,IAAI,EAAG,GACtD,MAAM,IAAI,YACR,iBACA,yCAAyC,WAAW,CAAC,KAAK,CAAC,EAAE,IAAI,KAAK,UAAU,MAAM,IAAI,EAAG,EAAE,MAAM,KAAK,UAAU,MAAM,IAAI,EAAG,EAAE,mDACrI;EAAA;EAIN,MAAM,KAAK,MAAM,IAAI;EAErB,IACE,MAAM,OAAO,KAAA,KACb,MAAM,OAAO,KAAA,KACb,mBAAmB,MAAM,GAAG,OAAO,MAAM,GAAG,KAAK,GACjD;GACA,MAAM,IAAI,cAAc,MAAM,GAAG,OAAO,MAAM,GAAG,KAAK;GACtD,IAAI,IAAI,KAAM,MAAM,MAAM,CAAC,MAAM,GAAG,aAAa,CAAC,MAAM,GAAG,YACzD,MAAM,IAAI,YACR,0BACA,sBAAsB,WAAW,CAAC,KAAK,CAAC,EAAE,0BAA0B,KAAK,UAAU,MAAM,GAAG,KAAK,EAAE,GAAG,MAAM,GAAG,YAAY,QAAQ,KAAK,OAAO,KAAK,UAAU,MAAM,GAAG,KAAK,EAAE,GAAG,MAAM,GAAG,YAAY,QAAQ,KAAK,GACrN;EAEJ;EAEA,IAAI,OAAO,KAAA,GAAW;GACpB,IAAI,MAAM,OAAO,KAAA,GAAW;IAC1B,IAAI,CAAC,mBAAmB,IAAI,MAAM,GAAG,KAAK,GACxC,MAAM,IAAI,YACR,0BACA,sBAAsB,WAAW,CAAC,KAAK,CAAC,EAAE,MAAM,KAAK,UAAU,EAAE,EAAE,IAAI,OAAO,GAAG,0CAA0C,KAAK,UAAU,MAAM,GAAG,KAAK,EAAE,IAAI,OAAO,MAAM,GAAG,MAAM,+CACtL;IAEF,MAAM,IAAI,cAAc,IAAI,MAAM,GAAG,KAAK;IAC1C,IAAI,IAAI,KAAM,MAAM,KAAK,CAAC,MAAM,GAAG,WACjC,MAAM,IAAI,YACR,0BACA,sBAAsB,WAAW,CAAC,KAAK,CAAC,EAAE,MAAM,KAAK,UAAU,EAAE,EAAE,2BAA2B,KAAK,UAAU,MAAM,GAAG,KAAK,EAAE,IAAI,MAAM,GAAG,YAAY,QAAQ,KAAK,GACrK;GAEJ;GACA,IAAI,MAAM,OAAO,KAAA,GAAW;IAC1B,IAAI,CAAC,mBAAmB,IAAI,MAAM,GAAG,KAAK,GACxC,MAAM,IAAI,YACR,0BACA,sBAAsB,WAAW,CAAC,KAAK,CAAC,EAAE,MAAM,KAAK,UAAU,EAAE,EAAE,IAAI,OAAO,GAAG,0CAA0C,KAAK,UAAU,MAAM,GAAG,KAAK,EAAE,IAAI,OAAO,MAAM,GAAG,MAAM,+CACtL;IAEF,MAAM,IAAI,cAAc,IAAI,MAAM,GAAG,KAAK;IAC1C,IAAI,IAAI,KAAM,MAAM,KAAK,CAAC,MAAM,GAAG,WACjC,MAAM,IAAI,YACR,0BACA,sBAAsB,WAAW,CAAC,KAAK,CAAC,EAAE,MAAM,KAAK,UAAU,EAAE,EAAE,2BAA2B,KAAK,UAAU,MAAM,GAAG,KAAK,EAAE,IAAI,MAAM,GAAG,YAAY,QAAQ,KAAK,GACrK;GAEJ;GAKA,IAAI,MAAM,IAAI,SAAS,GACrB,KAAK,MAAM,OAAO,MAAM,KAAK;IAC3B,IAAI,QAAQ;IACZ,KAAK,MAAM,KAAK,KACd,IAAI,uBAAuB,IAAI,CAAC,GAAG;KACjC,QAAQ;KACR;IACF;IAEF,IAAI,CAAC,OACH,MAAM,IAAI,YACR,0BACA,sBAAsB,WAAW,CAAC,KAAK,CAAC,EAAE,MAAM,KAAK,UAAU,EAAE,EAAE,0BACrE;GAEJ;EAEJ;EAMA,IAAI,MAAM,IAAI,SAAS;OACP,gBAAgB,MAAM,GAC5B,EAAE,WAAW,GACnB,MAAM,IAAI,YACR,0BACA,sBAAsB,WAAW,CAAC,KAAK,CAAC,EAAE,sDAC5C;EAAA;CAGN;AACF;;;;;;;;;;;;;;;;;;;AC7PA,MAAM,WAA2C;CAAC;CAAM;CAAM;CAAO;CAAM;CAAO;AAAI;AACtF,MAAM,YAA4C;CAAC;CAAM;CAAO;CAAM;AAAK;;;;;;;;;;;;;;;;;AAkB3E,MAAa,gBAAgB,SAAuC;CAClE,IACE,SAAS,QACT,OAAO,SAAS,YAChB,CAAC,MAAM,QAAS,KAA+B,OAAO,GAEtD,MAAM,IAAI,YACR,iBACA,0DACF;CAEF,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,QAAQ,KACvC,eAAe,KAAK,QAAQ,IAAK,CAAC;CAEpC,sBAAsB,IAAI;CAC1B,OAAO;AACT;AAEA,MAAM,kBAAkB,QAAyB,UAAwB;CACvE,IAAI,WAAW,QAAQ,OAAO,WAAW,UACvC,MAAM,IAAI,YACR,iBACA,6BAA6B,MAAM,2BAA2B,KAAK,UAAU,MAAM,EAAE,EACvF;CAEF,MAAM,EAAE,IAAI,OAAO,UAAU;CAK7B,IAAI,OAAO,OAAO,YAAY,CAAE,SAAmC,SAAS,EAAE,GAC5E,MAAM,IAAI,YACR,iBACA,6BAA6B,MAAM,sBAAsB,KAAK,UAAU,EAAE,EAAE,gBAAgB,SAAS,KAAK,KAAK,EAAE,EACnH;CAEF,IAAI,OAAO,UAAU,YAAY,MAAM,WAAW,GAChD,MAAM,IAAI,YACR,iBACA,6BAA6B,MAAM,+BACrC;CAMF,IAAI,UAAU,SAAS,MAAM,WAAW,MAAM,GAC5C,MAAM,IAAI,YACR,iBACA,iHACF;CAEF,IAAI,OAAO,MAAM;EACf,IAAI,CAAC,MAAM,QAAQ,KAAK,GACtB,MAAM,IAAI,YACR,iBACA,6BAA6B,MAAM,mBAAmB,KAAK,UAAU,KAAK,EAAE,6BAC9E;EAEF,IAAI,MAAM,WAAW,GACnB,MAAM,IAAI,YACR,0BACA,6BAA6B,MAAM,mBAAmB,KAAK,UAAU,KAAK,EAAE,iDAC9E;EAEF,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAChC,oBAAoB,MAAM,IAAI,OAAO,OAAO,CAAC;EAE/C;CACF;CACA,IAAI,MAAM,QAAQ,KAAK,GACrB,MAAM,IAAI,YACR,iBACA,6BAA6B,MAAM,OAAO,KAAK,UAAU,EAAE,EAAE,UAAU,KAAK,UAAU,KAAK,EAAE,4EAC/F;CAEF,IAAK,UAAoC,SAAS,EAAE,GAAG;EACrD,mBAAmB,OAAO,OAAO,KAAK;EACtC;CACF;CACA,eAAe,OAAO,OAAO,KAAK;AACpC;AAEA,MAAM,uBACJ,OACA,OACA,aACA,gBACS;CAMT,IAAI,UAAU,QAAQ,UAAU,KAAA,GAC9B,MAAM,IAAI,YACR,iBACA,6BAA6B,YAAY,mBAAmB,KAAK,UAAU,KAAK,EAAE,WAAW,YAAY,MAAM,UAAU,OAAO,SAAS,YAAY,8DACvJ;CAEF,IAAI,MAAM,QAAQ,KAAK,GACrB,MAAM,IAAI,YACR,iBACA,6BAA6B,YAAY,mBAAmB,KAAK,UAAU,KAAK,EAAE,WAAW,YAAY,0EAC3G;CAEF,MAAM,IAAI,OAAO;CACjB,IAAI,MAAM,UACR;CAEF,IAAI,MAAM,YAAY,MAAM,YAAY,MAAM,WAC5C,MAAM,IAAI,YACR,iBACA,6BAA6B,YAAY,mBAAmB,KAAK,UAAU,KAAK,EAAE,WAAW,YAAY,wBAAwB,KAAK,UAAU,CAAC,EAAE,sDACrJ;CAEF,IAAI,MAAM,YAAY,CAAC,OAAO,SAAS,KAAe,GACpD,MAAM,IAAI,YACR,iBACA,6BAA6B,YAAY,mBAAmB,KAAK,UAAU,KAAK,EAAE,WAAW,YAAY,MAAM,OAAO,KAAK,EAAE,wEAC/H;AAEJ;AAEA,MAAM,kBAAkB,OAAgB,OAAe,gBAA8B;CAInF,IAAI,UAAU,QAAQ,UAAU,KAAA,GAC9B,MAAM,IAAI,YACR,iBACA,6BAA6B,YAAY,UAAU,KAAK,UAAU,KAAK,EAAE,aAAa,UAAU,OAAO,SAAS,YAAY,sEAC9H;CAEF,MAAM,IAAI,OAAO;CACjB,IAAI,MAAM,UAKR;CAEF,IAAI,MAAM,YAAY,MAAM,YAAY,MAAM,WAC5C,MAAM,IAAI,YACR,iBACA,6BAA6B,YAAY,UAAU,KAAK,UAAU,KAAK,EAAE,+BAA+B,KAAK,UAAU,CAAC,EAAE,sDAC5H;CAEF,IAAI,MAAM,YAAY,CAAC,OAAO,SAAS,KAAe,GACpD,MAAM,IAAI,YACR,iBACA,6BAA6B,YAAY,UAAU,KAAK,UAAU,KAAK,EAAE,aAAa,OAAO,KAAK,EAAE,wEACtG;AAEJ;AAEA,MAAM,sBAAsB,OAAgB,OAAe,gBAA8B;CAIvF,IAAI,UAAU,QAAQ,UAAU,KAAA,GAC9B,MAAM,IAAI,YACR,iBACA,mCAAmC,YAAY,UAAU,KAAK,UAAU,KAAK,EAAE,OAAO,UAAU,OAAO,SAAS,YAAY,iDAC9H;CAEF,MAAM,IAAI,OAAO;CACjB,IAAI,MAAM,WACR,MAAM,IAAI,YACR,iBACA,mCAAmC,YAAY,UAAU,KAAK,UAAU,KAAK,EAAE,0FACjF;CAEF,IAAI,MAAM,UACR,MAAM,IAAI,YACR,iBACA,mCAAmC,YAAY,UAAU,KAAK,UAAU,KAAK,EAAE,qEACjF;CAEF,IAAI,MAAM,YAAY,MAAM,UAC1B,MAAM,IAAI,YACR,iBACA,mCAAmC,YAAY,UAAU,KAAK,UAAU,KAAK,EAAE,yBAAyB,KAAK,UAAU,CAAC,EAAE,oCAC5H;CAEF,IAAI,MAAM,YAAY,CAAC,OAAO,SAAS,KAAe,GACpD,MAAM,IAAI,YACR,iBACA,mCAAmC,YAAY,UAAU,KAAK,UAAU,KAAK,EAAE,OAAO,OAAO,KAAK,EAAE,wEACtG;AAEJ"}
1
+ {"version":3,"file":"validate-DtljsCh1.js","names":[],"sources":["../packages/protocol/src/query/matches.ts","../packages/protocol/src/query/_internals.ts","../packages/protocol/src/query/satisfiable.ts","../packages/protocol/src/query/validate.ts"],"sourcesContent":["/**\n * Wire predicate evaluator. Walks a validated {@link PredicateWire}\n * against a `JSONObject` document and returns `true` iff every\n * clause holds. Multiple clauses across all fields AND together.\n *\n * Pre-condition: `wire` must have been returned by\n * {@link validateWire} (see `./validate.ts`). Passing an\n * un-validated wire is a caller bug; behaviour is undefined.\n *\n * Companion modules: `./validate.ts` (construction-time check),\n * `./merge.ts` (AND-merge), `./wire.ts` (types).\n */\n\nimport type { DocumentValue, JSONObject, JSONValue } from \"../json.ts\";\n\nimport type { PredicateClause, PredicateWire } from \"./wire.ts\";\n\n/**\n * Evaluate a validated wire-form predicate against a `JSONObject`\n * document. Returns `true` iff every clause holds.\n *\n * @example\n * ```ts\n * matchesWire(\n * { clauses: [{ op: \"eq\", field: \"status\", value: \"open\" }] },\n * { status: \"open\", priority: \"p1\" },\n * ); // true\n *\n * matchesWire(\n * { clauses: [{ op: \"in\", field: \"priority\", value: [\"p1\", \"p2\"] }] },\n * { priority: \"p3\" },\n * ); // false\n *\n * matchesWire(\n * {\n * clauses: [\n * { op: \"gte\", field: \"count\", value: 1 },\n * { op: \"lt\", field: \"count\", value: 10 },\n * ],\n * },\n * { count: 5 },\n * ); // true\n * ```\n */\nexport const matchesWire = (wire: PredicateWire, doc: JSONObject): boolean => {\n for (const clause of wire.clauses) {\n const actual = lookupPath(doc, clause.field);\n if (!matchesClause(clause, actual)) {\n return false;\n }\n }\n return true;\n};\n\nconst lookupPath = (doc: JSONObject, field: string): JSONValue | undefined => {\n // Fast path: no dot → top-level lookup. Avoids allocating a split\n // array for the common case.\n // Stryker disable next-line StringLiteral,BlockStatement,ConditionalExpression: fast-path equivalence — for any valid field, the slow split-and-traverse path produces the same result; the fast path is a performance optimisation only\n if (!field.includes(\".\")) {\n return doc[field];\n }\n const segments = field.split(\".\");\n let cursor: JSONValue | undefined = doc;\n for (const segment of segments) {\n if (\n // Stryker disable next-line ConditionalExpression: redundant guard — cursor===undefined is always caught by the typeof check on the next line (typeof undefined!==\"object\" is true); removing this check is observationally equivalent\n cursor === undefined ||\n cursor === null ||\n // Stryker disable next-line ConditionalExpression: redundant guard — for non-object primitives, (primitive as JSONObject)[segment] returns undefined; the next iteration's cursor===undefined check catches it; removing this check produces the same return value\n typeof cursor !== \"object\" ||\n Array.isArray(cursor)\n ) {\n // Traversal hit a primitive, null, missing key, or array\n // before consuming the path. Predicate cannot match.\n return undefined;\n }\n cursor = (cursor as JSONObject)[segment];\n }\n return cursor;\n};\n\nconst matchesClause = (clause: PredicateClause, actual: JSONValue | undefined): boolean => {\n switch (clause.op) {\n case \"eq\": {\n return matchesEq(clause.value as DocumentValue, actual);\n }\n case \"in\": {\n return matchesIn(clause.value as ReadonlyArray<DocumentValue>, actual);\n }\n case \"gt\": {\n return compareGT(actual, clause.value as DocumentValue, false);\n }\n case \"gte\": {\n return compareGT(actual, clause.value as DocumentValue, true);\n }\n case \"lt\": {\n return compareLT(actual, clause.value as DocumentValue, false);\n }\n case \"lte\": {\n return compareLT(actual, clause.value as DocumentValue, true);\n }\n }\n};\n\nconst matchesEq = (expected: DocumentValue, actual: JSONValue | undefined): boolean => {\n if (typeof expected === \"object\") {\n // Nested object equality is a sub-predicate match — open-world:\n // doc may carry extra keys. The object-form normaliser flattens\n // nested sub-predicates to dotted-path clauses on the way in, so\n // the only callers reaching this branch are callback-form\n // `q.eq(\"nested\", { ... })`.\n if (\n // Stryker disable next-line ConditionalExpression: redundant guard — actual===undefined is caught by the typeof check below (typeof undefined!==\"object\" is true); removing this check produces the same false result\n actual === undefined ||\n actual === null ||\n typeof actual !== \"object\" ||\n Array.isArray(actual)\n ) {\n return false;\n }\n for (const subKey of Object.keys(expected)) {\n const subExpected = (expected as Record<string, DocumentValue>)[subKey];\n if (subExpected === undefined) {\n continue;\n }\n const subActual = (actual as JSONObject)[subKey];\n if (!matchesEq(subExpected, subActual)) {\n return false;\n }\n }\n return true;\n }\n return expected === actual;\n};\n\nconst matchesIn = (\n members: ReadonlyArray<DocumentValue>,\n actual: JSONValue | undefined,\n): boolean => {\n for (const m of members) {\n // Stryker disable next-line ConditionalExpression: equivalence — for non-null primitives, matchesEq(m, actual) reduces to `m === actual` (the typeof check fails); routing all members through matchesEq (→true) gives the same result as the two-branch structure\n if (typeof m === \"object\") {\n if (matchesEq(m, actual)) {\n return true;\n }\n } else if (m === actual) {\n return true;\n }\n }\n return false;\n};\n\nconst compareGT = (\n actual: JSONValue | undefined,\n bound: DocumentValue,\n inclusive: boolean,\n): boolean => {\n if (typeof bound === \"string\") {\n return typeof actual === \"string\" && (inclusive ? actual >= bound : actual > bound);\n }\n if (typeof bound === \"number\") {\n return typeof actual === \"number\" && (inclusive ? actual >= bound : actual > bound);\n }\n // Validator forbids boolean / null / object range bounds; defensive miss.\n return false;\n};\n\nconst compareLT = (\n actual: JSONValue | undefined,\n bound: DocumentValue,\n inclusive: boolean,\n): boolean => {\n if (typeof bound === \"string\") {\n return typeof actual === \"string\" && (inclusive ? actual <= bound : actual < bound);\n }\n if (typeof bound === \"number\") {\n return typeof actual === \"number\" && (inclusive ? actual <= bound : actual < bound);\n }\n return false;\n};\n","/**\n * Shared helpers for the predicate algebras in `./validate.ts`,\n * `./matches.ts`, and `./merge.ts`. These exist as a single module\n * because more than one of those files uses them and duplicating\n * the implementations would drift over time.\n *\n * Only {@link deepEqualDocumentValue} is part of the public surface;\n * the comparator primitives (`compareScalar`, `sameComparableType`,\n * `formatPath`) are internal to the protocol package and imported\n * by `./validate.ts` / `./merge.ts` / `./normalize.ts` directly.\n */\n\nimport type { DocumentValue } from \"../json.ts\";\n\n/** @internal Same primitive type for comparison purposes. */\nexport const sameComparableType = (a: DocumentValue, b: DocumentValue): boolean =>\n (typeof a === \"string\" && typeof b === \"string\") ||\n (typeof a === \"number\" && typeof b === \"number\");\n\n/**\n * @internal Returns negative / zero / positive for a<b / a==b / a>b.\n */\nexport const compareScalar = (a: DocumentValue, b: DocumentValue): number => {\n if (typeof a === \"number\" && typeof b === \"number\") {\n return a - b;\n }\n if (typeof a === \"string\" && typeof b === \"string\") {\n if (a < b) {\n return -1;\n }\n if (a > b) {\n return 1;\n }\n return 0;\n }\n return 0;\n};\n\n/** @internal Render a predicate path for use in error messages. */\nexport const formatPath = (path: ReadonlyArray<string>): string =>\n path.length === 0 ? \"<root>\" : path.map((p) => JSON.stringify(p)).join(\".\");\n\n/**\n * Recursive structural equality for `DocumentValue` values. Lifted to\n * `export` so the filtered-index implication checker (in\n * `@baerly/server`'s query planner) and other callers can reuse the\n * same comparison rule the validator + merger already trust. Two\n * values `a` and `b` are equal iff:\n *\n * - they are reference-equal (covers primitives and object identity);\n * - or they are both non-`null` objects with the same key set, and\n * every value pair is recursively equal.\n *\n * Arrays are out-of-band for `DocumentValue`; this function rejects\n * them implicitly via the same key-set walk (an array reads as an\n * object with numeric-string keys plus a `length` exposure that\n * `Object.keys` happens to skip — defensive callers should still gate\n * with `Array.isArray` first).\n */\nexport const deepEqualDocumentValue = (a: DocumentValue, b: DocumentValue): boolean => {\n if (a === b) {\n return true;\n } // primitives + object identity\n if (typeof a !== \"object\" || typeof b !== \"object\") {\n return false;\n }\n const aKeys = Object.keys(a);\n const bKeys = Object.keys(b);\n if (aKeys.length !== bKeys.length) {\n return false;\n }\n for (const key of aKeys) {\n // Stryker disable next-line ConditionalExpression,BlockStatement: equivalent — a key in aKeys but absent from b makes b[key] undefined, which the `aSub === undefined || bSub === undefined` guard below catches identically; no input observes the difference.\n if (!(key in b)) {\n return false;\n }\n const aSub = (a as Record<string, DocumentValue>)[key];\n const bSub = (b as Record<string, DocumentValue>)[key];\n // Stryker disable next-line LogicalOperator,ConditionalExpression: equivalent — this guard is a redundant fast-path. Whichever way it is mutated (operator `||`→`&&`, or either `=== undefined` operand forced to false), a slot that is undefined still flows into deepEqualDocumentValue below, whose typeof check returns false for `(undefined, defined)`; the only case that reaches `true` is both-undefined, which the surviving sibling operand still catches. No input over 500k randomized DocumentValues observes a difference.\n if (aSub === undefined || bSub === undefined) {\n return false;\n }\n if (!deepEqualDocumentValue(aSub, bSub)) {\n return false;\n }\n }\n return true;\n};\n","/**\n * Per-field satisfiability check for a {@link PredicateWire}. Groups\n * clauses by field, then runs the same logic the pre-redesign\n * `assertOpObjectSatisfiable` ran on a single op-object — but\n * generalised across N clauses on the same field (the wire merger\n * concatenates lists without coalescing).\n *\n * Triggers:\n * - Two `eq` clauses on the same field with different values →\n * `InvalidConfig` (the same conflict that pre-redesign\n * `mergePredicates` threw on shared primitive keys).\n * - Range bounds with `lo > hi` (or `lo == hi` with strict on\n * either side) → `UnsatisfiablePredicate`.\n * - `eq` value outside the residual range interval or absent from\n * every `in` set on the same field → `UnsatisfiablePredicate`.\n * - `in` sets that intersect to empty across multiple clauses →\n * `UnsatisfiablePredicate`.\n *\n * Used by both `./validate.ts` (wire-arrival check) and\n * `./merge.ts` (post-merge re-check, kept in lockstep).\n */\n\nimport { BaerlyError } from \"../errors.ts\";\nimport type { DocumentValue } from \"../json.ts\";\n\nimport {\n compareScalar,\n deepEqualDocumentValue,\n formatPath,\n sameComparableType,\n} from \"./_internals.ts\";\nimport type { PredicateClause, PredicateWire } from \"./wire.ts\";\n\ninterface FieldGroup {\n readonly eqs: DocumentValue[];\n readonly ins: ReadonlyArray<DocumentValue>[];\n lo?: { value: DocumentValue; inclusive: boolean };\n hi?: { value: DocumentValue; inclusive: boolean };\n}\n\nconst groupByField = (wire: PredicateWire): Map<string, FieldGroup> => {\n const out = new Map<string, FieldGroup>();\n for (const clause of wire.clauses) {\n let group = out.get(clause.field);\n if (group === undefined) {\n group = { eqs: [], ins: [] };\n out.set(clause.field, group);\n }\n applyClause(group, clause.field, clause);\n }\n return out;\n};\n\nconst applyClause = (group: FieldGroup, field: string, clause: PredicateClause): void => {\n switch (clause.op) {\n case \"eq\": {\n group.eqs.push(clause.value as DocumentValue);\n return;\n }\n case \"in\": {\n group.ins.push(clause.value as ReadonlyArray<DocumentValue>);\n return;\n }\n case \"gt\": {\n tightenLower(group, field, clause.value as DocumentValue, false);\n return;\n }\n case \"gte\": {\n tightenLower(group, field, clause.value as DocumentValue, true);\n return;\n }\n case \"lt\": {\n tightenUpper(group, field, clause.value as DocumentValue, false);\n return;\n }\n case \"lte\": {\n tightenUpper(group, field, clause.value as DocumentValue, true);\n return;\n }\n }\n};\n\nconst tightenLower = (\n group: FieldGroup,\n field: string,\n value: DocumentValue,\n inclusive: boolean,\n): void => {\n if (group.lo === undefined) {\n group.lo = { value, inclusive };\n return;\n }\n if (!sameComparableType(group.lo.value, value)) {\n // Type-incompatible bounds on the same field — the user wrote\n // (say) `q.gt(\"x\", 1).gt(\"x\", \"a\")`. Range matching is type-\n // strict at evaluation time so this is always-miss; surface\n // eagerly as `UnsatisfiablePredicate`.\n throw new BaerlyError(\n \"UnsatisfiablePredicate\",\n `Predicate on field ${formatPath([field])} has type-incompatible lower bounds (${JSON.stringify(group.lo.value)} vs ${JSON.stringify(value)}).`,\n );\n }\n const c = compareScalar(group.lo.value, value);\n // Stryker disable next-line ConditionalExpression: two sub-expression-to-true mutants are\n // equivalent. (1) `inclusive === false → true`: fires when c=0, existing=inclusive,\n // new=inclusive — tighten updates lo to {value, inclusive=true}, identical to the existing\n // {same value, inclusive=true}; no observable change. (2) `group.lo.inclusive === true → true`:\n // fires when c=0, new=exclusive, existing=exclusive — tighten updates lo to {value, false},\n // identical to existing {same value, false}; no observable change.\n if (c < 0 || (c === 0 && inclusive === false && group.lo.inclusive === true)) {\n group.lo = { value, inclusive };\n }\n};\n\nconst tightenUpper = (\n group: FieldGroup,\n field: string,\n value: DocumentValue,\n inclusive: boolean,\n): void => {\n if (group.hi === undefined) {\n group.hi = { value, inclusive };\n return;\n }\n if (!sameComparableType(group.hi.value, value)) {\n throw new BaerlyError(\n \"UnsatisfiablePredicate\",\n `Predicate on field ${formatPath([field])} has type-incompatible upper bounds (${JSON.stringify(group.hi.value)} vs ${JSON.stringify(value)}).`,\n );\n }\n const c = compareScalar(group.hi.value, value);\n // Stryker disable next-line ConditionalExpression: two sub-expression-to-true mutants are\n // equivalent. (1) `inclusive === false → true`: fires when c=0, existing=inclusive,\n // new=inclusive — tighten updates hi to {value, inclusive=true}, same as existing; no change.\n // (2) `group.hi.inclusive === true → true`: fires when c=0, new=exclusive, existing=exclusive —\n // tighten updates hi to {value, false}, same as existing; no observable change.\n if (c > 0 || (c === 0 && inclusive === false && group.hi.inclusive === true)) {\n group.hi = { value, inclusive };\n }\n};\n\nconst intersectInSets = (\n sets: ReadonlyArray<ReadonlyArray<DocumentValue>>,\n): ReadonlyArray<DocumentValue> => {\n // Stryker disable ConditionalExpression,BlockStatement,ArrayDeclaration: dead-code guard\n // — callers only invoke intersectInSets when group.ins.length > 1 (i.e., sets.length >= 2),\n // so sets.length === 0 is unreachable in production. Any mutation here is an equivalent mutant.\n if (sets.length === 0) {\n return [];\n }\n // Stryker restore ConditionalExpression,BlockStatement,ArrayDeclaration\n let acc: ReadonlyArray<DocumentValue> = sets[0]!;\n for (let i = 1; i < sets.length; i++) {\n const next: DocumentValue[] = [];\n for (const a of acc) {\n for (const b of sets[i]!) {\n if (deepEqualDocumentValue(a, b)) {\n next.push(a);\n break;\n }\n }\n }\n acc = next;\n }\n return acc;\n};\n\n/**\n * Check that every per-field clause group on `wire` is jointly\n * satisfiable. Throws `BaerlyError{code:\"UnsatisfiablePredicate\"}`\n * (or `\"InvalidConfig\"` for conflicting `eq` clauses) on the\n * first contradiction. Returns `void` on success.\n */\nexport const assertWireSatisfiable = (wire: PredicateWire): void => {\n const groups = groupByField(wire);\n for (const [field, group] of groups) {\n // Multiple `eq` clauses on the same field must agree.\n // Stryker disable next-line EqualityOperator,ConditionalExpression: equivalent — the inner\n // loop starts at i=1, so with 0 or 1 eqs the loop body never executes regardless of whether\n // we enter the outer if. `>= 1` enters with 1 eq (0 loop iterations); `true` enters with 0\n // eqs (0 loop iterations). Both are observationally identical to `> 1`.\n if (group.eqs.length > 1) {\n for (let i = 1; i < group.eqs.length; i++) {\n if (!deepEqualDocumentValue(group.eqs[0]!, group.eqs[i]!)) {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Conflicting equality clauses on field ${formatPath([field])} (${JSON.stringify(group.eqs[0]!)} vs ${JSON.stringify(group.eqs[i]!)}). Predicate chains must agree on shared equality.`,\n );\n }\n }\n }\n const eq = group.eqs[0];\n // Range interval must be non-empty.\n if (\n group.lo !== undefined &&\n group.hi !== undefined &&\n sameComparableType(group.lo.value, group.hi.value)\n ) {\n const c = compareScalar(group.lo.value, group.hi.value);\n if (c > 0 || (c === 0 && (!group.lo.inclusive || !group.hi.inclusive))) {\n throw new BaerlyError(\n \"UnsatisfiablePredicate\",\n `Predicate on field ${formatPath([field])} has empty interval (lo=${JSON.stringify(group.lo.value)} ${group.lo.inclusive ? \"gte\" : \"gt\"}, hi=${JSON.stringify(group.hi.value)} ${group.hi.inclusive ? \"lte\" : \"lt\"}).`,\n );\n }\n }\n // `eq` outside the residual interval / membership set.\n if (eq !== undefined) {\n if (group.lo !== undefined) {\n if (!sameComparableType(eq, group.lo.value)) {\n throw new BaerlyError(\n \"UnsatisfiablePredicate\",\n `Predicate on field ${formatPath([field])} eq=${JSON.stringify(eq)} (${typeof eq}) is type-incompatible with lower bound ${JSON.stringify(group.lo.value)} (${typeof group.lo.value}); range ops require matching primitive types.`,\n );\n }\n const c = compareScalar(eq, group.lo.value);\n if (c < 0 || (c === 0 && !group.lo.inclusive)) {\n throw new BaerlyError(\n \"UnsatisfiablePredicate\",\n `Predicate on field ${formatPath([field])} eq=${JSON.stringify(eq)} excluded by lower bound ${JSON.stringify(group.lo.value)} (${group.lo.inclusive ? \"gte\" : \"gt\"}).`,\n );\n }\n }\n if (group.hi !== undefined) {\n if (!sameComparableType(eq, group.hi.value)) {\n throw new BaerlyError(\n \"UnsatisfiablePredicate\",\n `Predicate on field ${formatPath([field])} eq=${JSON.stringify(eq)} (${typeof eq}) is type-incompatible with upper bound ${JSON.stringify(group.hi.value)} (${typeof group.hi.value}); range ops require matching primitive types.`,\n );\n }\n const c = compareScalar(eq, group.hi.value);\n if (c > 0 || (c === 0 && !group.hi.inclusive)) {\n throw new BaerlyError(\n \"UnsatisfiablePredicate\",\n `Predicate on field ${formatPath([field])} eq=${JSON.stringify(eq)} excluded by upper bound ${JSON.stringify(group.hi.value)} (${group.hi.inclusive ? \"lte\" : \"lt\"}).`,\n );\n }\n }\n // Stryker disable next-line EqualityOperator,ConditionalExpression: equivalent — the for-of\n // loop over group.ins is a no-op when group.ins is empty, so `>= 0` (always true) and\n // `true` (always enter) produce identical behavior: zero iterations when ins is empty,\n // same iterations as `> 0` when ins is non-empty.\n if (group.ins.length > 0) {\n for (const set of group.ins) {\n let found = false;\n for (const m of set) {\n if (deepEqualDocumentValue(eq, m)) {\n found = true;\n break;\n }\n }\n if (!found) {\n throw new BaerlyError(\n \"UnsatisfiablePredicate\",\n `Predicate on field ${formatPath([field])} eq=${JSON.stringify(eq)} not present in in() set.`,\n );\n }\n }\n }\n }\n // Multiple `in` sets must intersect non-empty.\n // Stryker disable next-line EqualityOperator: equivalent — intersectInSets([single_set])\n // returns that set unchanged; since validateWire rejects empty in-arrays, the single set\n // is always non-empty, so isect.length === 0 is false and no throw occurs. `>= 1` (entering\n // with 1 in-set) behaves identically to `> 1` (skipping for 1 in-set).\n if (group.ins.length > 1) {\n const isect = intersectInSets(group.ins);\n if (isect.length === 0) {\n throw new BaerlyError(\n \"UnsatisfiablePredicate\",\n `Predicate on field ${formatPath([field])} has empty in() intersection across multiple clauses.`,\n );\n }\n }\n }\n};\n","/**\n * Wire predicate validator. Walks a {@link PredicateWire} and throws\n * on a structurally bad clause (`BaerlyError{code:\"InvalidConfig\"}`)\n * or a per-field clause group that contradicts itself\n * (`BaerlyError{code:\"UnsatisfiablePredicate\"}`).\n *\n * The object-form normaliser at `./normalize.ts` enforces shape on\n * the way in (rejecting `$`-keys / non-scalars / null / undefined);\n * the callback builder at `./builder.ts` enforces shape via the\n * type system. This validator is the wire-arrival check: it runs\n * over already-normalised clauses, defending against raw-`fetch`\n * callers who bypass the typed seam and submit arbitrary JSON.\n *\n * Companion modules: `./matches.ts` (evaluator), `./merge.ts`\n * (AND-merge). Shared helpers live in `./_internals.ts`.\n */\n\nimport { BaerlyError } from \"../errors.ts\";\n\nimport { assertWireSatisfiable } from \"./satisfiable.ts\";\nimport type { PredicateClause, PredicateOpName, PredicateWire } from \"./wire.ts\";\n\nconst OP_NAMES: ReadonlyArray<PredicateOpName> = [\"eq\", \"gt\", \"gte\", \"lt\", \"lte\", \"in\"];\nconst RANGE_OPS: ReadonlyArray<PredicateOpName> = [\"gt\", \"gte\", \"lt\", \"lte\"];\n\n/**\n * Validate a normalised predicate wire. Throws\n * `BaerlyError{code:\"InvalidConfig\"}` on a structurally bad clause,\n * or `BaerlyError{code:\"UnsatisfiablePredicate\"}` when a clause\n * group on one field contradicts itself.\n *\n * Returns the wire unchanged on success — callers can thread the\n * validated wire forward.\n *\n * @example\n * ```ts\n * validateWire({ clauses: [{ op: \"eq\", field: \"status\", value: \"open\" }] }); // ok\n * validateWire({ clauses: [{ op: \"in\", field: \"priority\", value: [] }] }); // throws UnsatisfiablePredicate\n * validateWire({ clauses: [{ op: \"eq\", field: \"_id\", value: \"x\" }] }); // throws InvalidConfig (top-level _id)\n * ```\n */\nexport const validateWire = (wire: PredicateWire): PredicateWire => {\n if (\n wire === null ||\n typeof wire !== \"object\" ||\n !Array.isArray((wire as { clauses?: unknown }).clauses)\n ) {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Predicate wire must be an object with a \"clauses\" array.`,\n );\n }\n for (let i = 0; i < wire.clauses.length; i++) {\n validateClause(wire.clauses[i]!, i);\n }\n assertWireSatisfiable(wire);\n return wire;\n};\n\nconst validateClause = (clause: PredicateClause, index: number): void => {\n if (clause === null || typeof clause !== \"object\") {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Predicate clause at index ${index} must be an object — got ${JSON.stringify(clause)}.`,\n );\n }\n const { op, field, value } = clause;\n // Stryker disable next-line ConditionalExpression: `typeof op !== \"string\"` is redundant —\n // OP_NAMES contains only string literals; Array.prototype.includes uses SameValueZero\n // (effectively ===), so any non-string op is already rejected by the `!includes` half.\n // The early string-type check is a readability guard, not an observable branch.\n if (typeof op !== \"string\" || !(OP_NAMES as ReadonlyArray<string>).includes(op)) {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Predicate clause at index ${index} has unsupported op ${JSON.stringify(op)} — supported: ${OP_NAMES.join(\" / \")}.`,\n );\n }\n if (typeof field !== \"string\" || field.length === 0) {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Predicate clause at index ${index} has empty / non-string field.`,\n );\n }\n // Reject `_id` AND any nested `_id.<path>` — `Path<T>` excludes both\n // (`\"_id\" | \\`_id.${string}\\``), so a raw-wire caller (the threat this\n // validator names) must not slip a dotted `_id.x` past a check that\n // only matched the exact root field.\n if (field === \"_id\" || field.startsWith(\"_id.\")) {\n throw new BaerlyError(\n \"InvalidConfig\",\n 'Predicates may not key on \"_id\"; use .get(id) / .update(id, patch) / .replace(id, doc) / .delete(id) instead.',\n );\n }\n if (op === \"in\") {\n if (!Array.isArray(value)) {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Predicate clause at index ${index} (op=\"in\", field=${JSON.stringify(field)}) must carry an array value.`,\n );\n }\n if (value.length === 0) {\n throw new BaerlyError(\n \"UnsatisfiablePredicate\",\n `Predicate clause at index ${index} (op=\"in\", field=${JSON.stringify(field)}) has empty value array — no document can match.`,\n );\n }\n for (let i = 0; i < value.length; i++) {\n validateMemberValue(value[i], field, index, i);\n }\n return;\n }\n if (Array.isArray(value)) {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Predicate clause at index ${index} (op=${JSON.stringify(op)}, field=${JSON.stringify(field)}) must carry a primitive value, got an array — only op=\"in\" accepts arrays.`,\n );\n }\n if ((RANGE_OPS as ReadonlyArray<string>).includes(op)) {\n validateRangeBound(value, field, index);\n return;\n }\n validateScalar(value, field, index);\n};\n\nconst validateMemberValue = (\n value: unknown,\n field: string,\n clauseIndex: number,\n memberIndex: number,\n): void => {\n // Stryker disable next-line ConditionalExpression: `|| value === undefined` is redundant —\n // undefined falls through to `typeof value` = \"undefined\", which is caught by the\n // `t !== \"string\" && t !== \"number\" && t !== \"boolean\"` check below with the same\n // InvalidConfig code. The early check gives a more descriptive \"undefined\" message\n // but no input can distinguish the two code paths via the public error code alone.\n if (value === null || value === undefined) {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Predicate clause at index ${clauseIndex} (op=\"in\", field=${JSON.stringify(field)}) member ${memberIndex} is ${value === null ? \"null\" : \"undefined\"} — members must be string / number / boolean / nested object.`,\n );\n }\n if (Array.isArray(value)) {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Predicate clause at index ${clauseIndex} (op=\"in\", field=${JSON.stringify(field)}) member ${memberIndex} is an array — members must be string / number / boolean / nested object.`,\n );\n }\n const t = typeof value;\n if (t === \"object\") {\n return;\n }\n if (t !== \"string\" && t !== \"number\" && t !== \"boolean\") {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Predicate clause at index ${clauseIndex} (op=\"in\", field=${JSON.stringify(field)}) member ${memberIndex} has unsupported type ${JSON.stringify(t)} — must be string / number / boolean / nested object.`,\n );\n }\n if (t === \"number\" && !Number.isFinite(value as number)) {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Predicate clause at index ${clauseIndex} (op=\"in\", field=${JSON.stringify(field)}) member ${memberIndex} is ${String(value)} — finite numbers only (NaN / Infinity do not round-trip through JSON).`,\n );\n }\n};\n\nconst validateScalar = (value: unknown, field: string, clauseIndex: number): void => {\n // Stryker disable next-line ConditionalExpression: `|| value === undefined` is redundant —\n // undefined falls through to `typeof value` = \"undefined\", caught by the\n // `t !== \"string\" && t !== \"number\" && t !== \"boolean\"` check with the same code.\n if (value === null || value === undefined) {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Predicate clause at index ${clauseIndex} (field=${JSON.stringify(field)}) value is ${value === null ? \"null\" : \"undefined\"} — terminal values must be string / number / boolean / nested object.`,\n );\n }\n const t = typeof value;\n if (t === \"object\") {\n // Equality clauses against nested objects survive only via callback\n // form (the normaliser flattens object-form sub-predicates to\n // dotted-path eq clauses). Keep the structural recursion light —\n // values are sealed from the typed seam.\n return;\n }\n if (t !== \"string\" && t !== \"number\" && t !== \"boolean\") {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Predicate clause at index ${clauseIndex} (field=${JSON.stringify(field)}) value has unsupported type ${JSON.stringify(t)} — must be string / number / boolean / nested object.`,\n );\n }\n if (t === \"number\" && !Number.isFinite(value as number)) {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Predicate clause at index ${clauseIndex} (field=${JSON.stringify(field)}) value is ${String(value)} — finite numbers only (NaN / Infinity do not round-trip through JSON).`,\n );\n }\n};\n\nconst validateRangeBound = (value: unknown, field: string, clauseIndex: number): void => {\n // Stryker disable next-line ConditionalExpression: `|| value === undefined` is redundant —\n // undefined falls through to `typeof value` = \"undefined\", caught by `t !== \"string\" && t !== \"number\"`\n // with the same InvalidConfig code.\n if (value === null || value === undefined) {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Predicate range bound at clause ${clauseIndex} (field=${JSON.stringify(field)}) is ${value === null ? \"null\" : \"undefined\"} — range bounds must be string or finite number.`,\n );\n }\n const t = typeof value;\n if (t === \"boolean\") {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Predicate range bound at clause ${clauseIndex} (field=${JSON.stringify(field)}) is a boolean — range bounds must be string or finite number (booleans are not ordered).`,\n );\n }\n if (t === \"object\") {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Predicate range bound at clause ${clauseIndex} (field=${JSON.stringify(field)}) is a nested object — range bounds must be string or finite number.`,\n );\n }\n if (t !== \"string\" && t !== \"number\") {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Predicate range bound at clause ${clauseIndex} (field=${JSON.stringify(field)}) has unsupported type ${JSON.stringify(t)} — must be string or finite number.`,\n );\n }\n if (t === \"number\" && !Number.isFinite(value as number)) {\n throw new BaerlyError(\n \"InvalidConfig\",\n `Predicate range bound at clause ${clauseIndex} (field=${JSON.stringify(field)}) is ${String(value)} — finite numbers only (NaN / Infinity do not round-trip through JSON).`,\n );\n }\n};\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4CA,MAAa,eAAe,MAAqB,QAA6B;CAC5E,KAAK,MAAM,UAAU,KAAK,SAExB,IAAI,CAAC,cAAc,QADJ,WAAW,KAAK,OAAO,KACN,CAAC,GAC/B,OAAO;CAGX,OAAO;AACT;AAEA,MAAM,cAAc,KAAiB,UAAyC;CAI5E,IAAI,CAAC,MAAM,SAAS,GAAG,GACrB,OAAO,IAAI;CAEb,MAAM,WAAW,MAAM,MAAM,GAAG;CAChC,IAAI,SAAgC;CACpC,KAAK,MAAM,WAAW,UAAU;EAC9B,IAEE,WAAW,KAAA,KACX,WAAW,QAEX,OAAO,WAAW,YAClB,MAAM,QAAQ,MAAM,GAIpB;EAEF,SAAU,OAAsB;CAClC;CACA,OAAO;AACT;AAEA,MAAM,iBAAiB,QAAyB,WAA2C;CACzF,QAAQ,OAAO,IAAf;EACE,KAAK,MACH,OAAO,UAAU,OAAO,OAAwB,MAAM;EAExD,KAAK,MACH,OAAO,UAAU,OAAO,OAAuC,MAAM;EAEvE,KAAK,MACH,OAAO,UAAU,QAAQ,OAAO,OAAwB,KAAK;EAE/D,KAAK,OACH,OAAO,UAAU,QAAQ,OAAO,OAAwB,IAAI;EAE9D,KAAK,MACH,OAAO,UAAU,QAAQ,OAAO,OAAwB,KAAK;EAE/D,KAAK,OACH,OAAO,UAAU,QAAQ,OAAO,OAAwB,IAAI;CAEhE;AACF;AAEA,MAAM,aAAa,UAAyB,WAA2C;CACrF,IAAI,OAAO,aAAa,UAAU;EAMhC,IAEE,WAAW,KAAA,KACX,WAAW,QACX,OAAO,WAAW,YAClB,MAAM,QAAQ,MAAM,GAEpB,OAAO;EAET,KAAK,MAAM,UAAU,OAAO,KAAK,QAAQ,GAAG;GAC1C,MAAM,cAAe,SAA2C;GAChE,IAAI,gBAAgB,KAAA,GAClB;GAEF,MAAM,YAAa,OAAsB;GACzC,IAAI,CAAC,UAAU,aAAa,SAAS,GACnC,OAAO;EAEX;EACA,OAAO;CACT;CACA,OAAO,aAAa;AACtB;AAEA,MAAM,aACJ,SACA,WACY;CACZ,KAAK,MAAM,KAAK,SAEd,IAAI,OAAO,MAAM;MACX,UAAU,GAAG,MAAM,GACrB,OAAO;CAAA,OAEJ,IAAI,MAAM,QACf,OAAO;CAGX,OAAO;AACT;AAEA,MAAM,aACJ,QACA,OACA,cACY;CACZ,IAAI,OAAO,UAAU,UACnB,OAAO,OAAO,WAAW,aAAa,YAAY,UAAU,QAAQ,SAAS;CAE/E,IAAI,OAAO,UAAU,UACnB,OAAO,OAAO,WAAW,aAAa,YAAY,UAAU,QAAQ,SAAS;CAG/E,OAAO;AACT;AAEA,MAAM,aACJ,QACA,OACA,cACY;CACZ,IAAI,OAAO,UAAU,UACnB,OAAO,OAAO,WAAW,aAAa,YAAY,UAAU,QAAQ,SAAS;CAE/E,IAAI,OAAO,UAAU,UACnB,OAAO,OAAO,WAAW,aAAa,YAAY,UAAU,QAAQ,SAAS;CAE/E,OAAO;AACT;;;;ACpKA,MAAa,sBAAsB,GAAkB,MAClD,OAAO,MAAM,YAAY,OAAO,MAAM,YACtC,OAAO,MAAM,YAAY,OAAO,MAAM;;;;AAKzC,MAAa,iBAAiB,GAAkB,MAA6B;CAC3E,IAAI,OAAO,MAAM,YAAY,OAAO,MAAM,UACxC,OAAO,IAAI;CAEb,IAAI,OAAO,MAAM,YAAY,OAAO,MAAM,UAAU;EAClD,IAAI,IAAI,GACN,OAAO;EAET,IAAI,IAAI,GACN,OAAO;EAET,OAAO;CACT;CACA,OAAO;AACT;;AAGA,MAAa,cAAc,SACzB,KAAK,WAAW,IAAI,WAAW,KAAK,KAAK,MAAM,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG;;;;;;;;;;;;;;;;;;AAmB5E,MAAa,0BAA0B,GAAkB,MAA8B;CACrF,IAAI,MAAM,GACR,OAAO;CAET,IAAI,OAAO,MAAM,YAAY,OAAO,MAAM,UACxC,OAAO;CAET,MAAM,QAAQ,OAAO,KAAK,CAAC;CAC3B,MAAM,QAAQ,OAAO,KAAK,CAAC;CAC3B,IAAI,MAAM,WAAW,MAAM,QACzB,OAAO;CAET,KAAK,MAAM,OAAO,OAAO;EAEvB,IAAI,EAAE,OAAO,IACX,OAAO;EAET,MAAM,OAAQ,EAAoC;EAClD,MAAM,OAAQ,EAAoC;EAElD,IAAI,SAAS,KAAA,KAAa,SAAS,KAAA,GACjC,OAAO;EAET,IAAI,CAAC,uBAAuB,MAAM,IAAI,GACpC,OAAO;CAEX;CACA,OAAO;AACT;;;;;;;;;;;;;;;;;;;;;;;;AC/CA,MAAM,gBAAgB,SAAiD;CACrE,MAAM,sBAAM,IAAI,IAAwB;CACxC,KAAK,MAAM,UAAU,KAAK,SAAS;EACjC,IAAI,QAAQ,IAAI,IAAI,OAAO,KAAK;EAChC,IAAI,UAAU,KAAA,GAAW;GACvB,QAAQ;IAAE,KAAK,CAAC;IAAG,KAAK,CAAC;GAAE;GAC3B,IAAI,IAAI,OAAO,OAAO,KAAK;EAC7B;EACA,YAAY,OAAO,OAAO,OAAO,MAAM;CACzC;CACA,OAAO;AACT;AAEA,MAAM,eAAe,OAAmB,OAAe,WAAkC;CACvF,QAAQ,OAAO,IAAf;EACE,KAAK;GACH,MAAM,IAAI,KAAK,OAAO,KAAsB;GAC5C;EAEF,KAAK;GACH,MAAM,IAAI,KAAK,OAAO,KAAqC;GAC3D;EAEF,KAAK;GACH,aAAa,OAAO,OAAO,OAAO,OAAwB,KAAK;GAC/D;EAEF,KAAK;GACH,aAAa,OAAO,OAAO,OAAO,OAAwB,IAAI;GAC9D;EAEF,KAAK;GACH,aAAa,OAAO,OAAO,OAAO,OAAwB,KAAK;GAC/D;EAEF,KAAK;GACH,aAAa,OAAO,OAAO,OAAO,OAAwB,IAAI;GAC9D;CAEJ;AACF;AAEA,MAAM,gBACJ,OACA,OACA,OACA,cACS;CACT,IAAI,MAAM,OAAO,KAAA,GAAW;EAC1B,MAAM,KAAK;GAAE;GAAO;EAAU;EAC9B;CACF;CACA,IAAI,CAAC,mBAAmB,MAAM,GAAG,OAAO,KAAK,GAK3C,MAAM,IAAI,YACR,0BACA,sBAAsB,WAAW,CAAC,KAAK,CAAC,EAAE,uCAAuC,KAAK,UAAU,MAAM,GAAG,KAAK,EAAE,MAAM,KAAK,UAAU,KAAK,EAAE,GAC9I;CAEF,MAAM,IAAI,cAAc,MAAM,GAAG,OAAO,KAAK;CAO7C,IAAI,IAAI,KAAM,MAAM,KAAK,cAAc,SAAS,MAAM,GAAG,cAAc,MACrE,MAAM,KAAK;EAAE;EAAO;CAAU;AAElC;AAEA,MAAM,gBACJ,OACA,OACA,OACA,cACS;CACT,IAAI,MAAM,OAAO,KAAA,GAAW;EAC1B,MAAM,KAAK;GAAE;GAAO;EAAU;EAC9B;CACF;CACA,IAAI,CAAC,mBAAmB,MAAM,GAAG,OAAO,KAAK,GAC3C,MAAM,IAAI,YACR,0BACA,sBAAsB,WAAW,CAAC,KAAK,CAAC,EAAE,uCAAuC,KAAK,UAAU,MAAM,GAAG,KAAK,EAAE,MAAM,KAAK,UAAU,KAAK,EAAE,GAC9I;CAEF,MAAM,IAAI,cAAc,MAAM,GAAG,OAAO,KAAK;CAM7C,IAAI,IAAI,KAAM,MAAM,KAAK,cAAc,SAAS,MAAM,GAAG,cAAc,MACrE,MAAM,KAAK;EAAE;EAAO;CAAU;AAElC;AAEA,MAAM,mBACJ,SACiC;CAIjC,IAAI,KAAK,WAAW,GAClB,OAAO,CAAC;CAGV,IAAI,MAAoC,KAAK;CAC7C,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;EACpC,MAAM,OAAwB,CAAC;EAC/B,KAAK,MAAM,KAAK,KACd,KAAK,MAAM,KAAK,KAAK,IACnB,IAAI,uBAAuB,GAAG,CAAC,GAAG;GAChC,KAAK,KAAK,CAAC;GACX;EACF;EAGJ,MAAM;CACR;CACA,OAAO;AACT;;;;;;;AAQA,MAAa,yBAAyB,SAA8B;CAClE,MAAM,SAAS,aAAa,IAAI;CAChC,KAAK,MAAM,CAAC,OAAO,UAAU,QAAQ;EAMnC,IAAI,MAAM,IAAI,SAAS;QAChB,IAAI,IAAI,GAAG,IAAI,MAAM,IAAI,QAAQ,KACpC,IAAI,CAAC,uBAAuB,MAAM,IAAI,IAAK,MAAM,IAAI,EAAG,GACtD,MAAM,IAAI,YACR,iBACA,yCAAyC,WAAW,CAAC,KAAK,CAAC,EAAE,IAAI,KAAK,UAAU,MAAM,IAAI,EAAG,EAAE,MAAM,KAAK,UAAU,MAAM,IAAI,EAAG,EAAE,mDACrI;EAAA;EAIN,MAAM,KAAK,MAAM,IAAI;EAErB,IACE,MAAM,OAAO,KAAA,KACb,MAAM,OAAO,KAAA,KACb,mBAAmB,MAAM,GAAG,OAAO,MAAM,GAAG,KAAK,GACjD;GACA,MAAM,IAAI,cAAc,MAAM,GAAG,OAAO,MAAM,GAAG,KAAK;GACtD,IAAI,IAAI,KAAM,MAAM,MAAM,CAAC,MAAM,GAAG,aAAa,CAAC,MAAM,GAAG,YACzD,MAAM,IAAI,YACR,0BACA,sBAAsB,WAAW,CAAC,KAAK,CAAC,EAAE,0BAA0B,KAAK,UAAU,MAAM,GAAG,KAAK,EAAE,GAAG,MAAM,GAAG,YAAY,QAAQ,KAAK,OAAO,KAAK,UAAU,MAAM,GAAG,KAAK,EAAE,GAAG,MAAM,GAAG,YAAY,QAAQ,KAAK,GACrN;EAEJ;EAEA,IAAI,OAAO,KAAA,GAAW;GACpB,IAAI,MAAM,OAAO,KAAA,GAAW;IAC1B,IAAI,CAAC,mBAAmB,IAAI,MAAM,GAAG,KAAK,GACxC,MAAM,IAAI,YACR,0BACA,sBAAsB,WAAW,CAAC,KAAK,CAAC,EAAE,MAAM,KAAK,UAAU,EAAE,EAAE,IAAI,OAAO,GAAG,0CAA0C,KAAK,UAAU,MAAM,GAAG,KAAK,EAAE,IAAI,OAAO,MAAM,GAAG,MAAM,+CACtL;IAEF,MAAM,IAAI,cAAc,IAAI,MAAM,GAAG,KAAK;IAC1C,IAAI,IAAI,KAAM,MAAM,KAAK,CAAC,MAAM,GAAG,WACjC,MAAM,IAAI,YACR,0BACA,sBAAsB,WAAW,CAAC,KAAK,CAAC,EAAE,MAAM,KAAK,UAAU,EAAE,EAAE,2BAA2B,KAAK,UAAU,MAAM,GAAG,KAAK,EAAE,IAAI,MAAM,GAAG,YAAY,QAAQ,KAAK,GACrK;GAEJ;GACA,IAAI,MAAM,OAAO,KAAA,GAAW;IAC1B,IAAI,CAAC,mBAAmB,IAAI,MAAM,GAAG,KAAK,GACxC,MAAM,IAAI,YACR,0BACA,sBAAsB,WAAW,CAAC,KAAK,CAAC,EAAE,MAAM,KAAK,UAAU,EAAE,EAAE,IAAI,OAAO,GAAG,0CAA0C,KAAK,UAAU,MAAM,GAAG,KAAK,EAAE,IAAI,OAAO,MAAM,GAAG,MAAM,+CACtL;IAEF,MAAM,IAAI,cAAc,IAAI,MAAM,GAAG,KAAK;IAC1C,IAAI,IAAI,KAAM,MAAM,KAAK,CAAC,MAAM,GAAG,WACjC,MAAM,IAAI,YACR,0BACA,sBAAsB,WAAW,CAAC,KAAK,CAAC,EAAE,MAAM,KAAK,UAAU,EAAE,EAAE,2BAA2B,KAAK,UAAU,MAAM,GAAG,KAAK,EAAE,IAAI,MAAM,GAAG,YAAY,QAAQ,KAAK,GACrK;GAEJ;GAKA,IAAI,MAAM,IAAI,SAAS,GACrB,KAAK,MAAM,OAAO,MAAM,KAAK;IAC3B,IAAI,QAAQ;IACZ,KAAK,MAAM,KAAK,KACd,IAAI,uBAAuB,IAAI,CAAC,GAAG;KACjC,QAAQ;KACR;IACF;IAEF,IAAI,CAAC,OACH,MAAM,IAAI,YACR,0BACA,sBAAsB,WAAW,CAAC,KAAK,CAAC,EAAE,MAAM,KAAK,UAAU,EAAE,EAAE,0BACrE;GAEJ;EAEJ;EAMA,IAAI,MAAM,IAAI,SAAS;OACP,gBAAgB,MAAM,GAC5B,CAAC,CAAC,WAAW,GACnB,MAAM,IAAI,YACR,0BACA,sBAAsB,WAAW,CAAC,KAAK,CAAC,EAAE,sDAC5C;EAAA;CAGN;AACF;;;;;;;;;;;;;;;;;;;AC7PA,MAAM,WAA2C;CAAC;CAAM;CAAM;CAAO;CAAM;CAAO;AAAI;AACtF,MAAM,YAA4C;CAAC;CAAM;CAAO;CAAM;AAAK;;;;;;;;;;;;;;;;;AAkB3E,MAAa,gBAAgB,SAAuC;CAClE,IACE,SAAS,QACT,OAAO,SAAS,YAChB,CAAC,MAAM,QAAS,KAA+B,OAAO,GAEtD,MAAM,IAAI,YACR,iBACA,0DACF;CAEF,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,QAAQ,KACvC,eAAe,KAAK,QAAQ,IAAK,CAAC;CAEpC,sBAAsB,IAAI;CAC1B,OAAO;AACT;AAEA,MAAM,kBAAkB,QAAyB,UAAwB;CACvE,IAAI,WAAW,QAAQ,OAAO,WAAW,UACvC,MAAM,IAAI,YACR,iBACA,6BAA6B,MAAM,2BAA2B,KAAK,UAAU,MAAM,EAAE,EACvF;CAEF,MAAM,EAAE,IAAI,OAAO,UAAU;CAK7B,IAAI,OAAO,OAAO,YAAY,CAAE,SAAmC,SAAS,EAAE,GAC5E,MAAM,IAAI,YACR,iBACA,6BAA6B,MAAM,sBAAsB,KAAK,UAAU,EAAE,EAAE,gBAAgB,SAAS,KAAK,KAAK,EAAE,EACnH;CAEF,IAAI,OAAO,UAAU,YAAY,MAAM,WAAW,GAChD,MAAM,IAAI,YACR,iBACA,6BAA6B,MAAM,+BACrC;CAMF,IAAI,UAAU,SAAS,MAAM,WAAW,MAAM,GAC5C,MAAM,IAAI,YACR,iBACA,iHACF;CAEF,IAAI,OAAO,MAAM;EACf,IAAI,CAAC,MAAM,QAAQ,KAAK,GACtB,MAAM,IAAI,YACR,iBACA,6BAA6B,MAAM,mBAAmB,KAAK,UAAU,KAAK,EAAE,6BAC9E;EAEF,IAAI,MAAM,WAAW,GACnB,MAAM,IAAI,YACR,0BACA,6BAA6B,MAAM,mBAAmB,KAAK,UAAU,KAAK,EAAE,iDAC9E;EAEF,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAChC,oBAAoB,MAAM,IAAI,OAAO,OAAO,CAAC;EAE/C;CACF;CACA,IAAI,MAAM,QAAQ,KAAK,GACrB,MAAM,IAAI,YACR,iBACA,6BAA6B,MAAM,OAAO,KAAK,UAAU,EAAE,EAAE,UAAU,KAAK,UAAU,KAAK,EAAE,4EAC/F;CAEF,IAAK,UAAoC,SAAS,EAAE,GAAG;EACrD,mBAAmB,OAAO,OAAO,KAAK;EACtC;CACF;CACA,eAAe,OAAO,OAAO,KAAK;AACpC;AAEA,MAAM,uBACJ,OACA,OACA,aACA,gBACS;CAMT,IAAI,UAAU,QAAQ,UAAU,KAAA,GAC9B,MAAM,IAAI,YACR,iBACA,6BAA6B,YAAY,mBAAmB,KAAK,UAAU,KAAK,EAAE,WAAW,YAAY,MAAM,UAAU,OAAO,SAAS,YAAY,8DACvJ;CAEF,IAAI,MAAM,QAAQ,KAAK,GACrB,MAAM,IAAI,YACR,iBACA,6BAA6B,YAAY,mBAAmB,KAAK,UAAU,KAAK,EAAE,WAAW,YAAY,0EAC3G;CAEF,MAAM,IAAI,OAAO;CACjB,IAAI,MAAM,UACR;CAEF,IAAI,MAAM,YAAY,MAAM,YAAY,MAAM,WAC5C,MAAM,IAAI,YACR,iBACA,6BAA6B,YAAY,mBAAmB,KAAK,UAAU,KAAK,EAAE,WAAW,YAAY,wBAAwB,KAAK,UAAU,CAAC,EAAE,sDACrJ;CAEF,IAAI,MAAM,YAAY,CAAC,OAAO,SAAS,KAAe,GACpD,MAAM,IAAI,YACR,iBACA,6BAA6B,YAAY,mBAAmB,KAAK,UAAU,KAAK,EAAE,WAAW,YAAY,MAAM,OAAO,KAAK,EAAE,wEAC/H;AAEJ;AAEA,MAAM,kBAAkB,OAAgB,OAAe,gBAA8B;CAInF,IAAI,UAAU,QAAQ,UAAU,KAAA,GAC9B,MAAM,IAAI,YACR,iBACA,6BAA6B,YAAY,UAAU,KAAK,UAAU,KAAK,EAAE,aAAa,UAAU,OAAO,SAAS,YAAY,sEAC9H;CAEF,MAAM,IAAI,OAAO;CACjB,IAAI,MAAM,UAKR;CAEF,IAAI,MAAM,YAAY,MAAM,YAAY,MAAM,WAC5C,MAAM,IAAI,YACR,iBACA,6BAA6B,YAAY,UAAU,KAAK,UAAU,KAAK,EAAE,+BAA+B,KAAK,UAAU,CAAC,EAAE,sDAC5H;CAEF,IAAI,MAAM,YAAY,CAAC,OAAO,SAAS,KAAe,GACpD,MAAM,IAAI,YACR,iBACA,6BAA6B,YAAY,UAAU,KAAK,UAAU,KAAK,EAAE,aAAa,OAAO,KAAK,EAAE,wEACtG;AAEJ;AAEA,MAAM,sBAAsB,OAAgB,OAAe,gBAA8B;CAIvF,IAAI,UAAU,QAAQ,UAAU,KAAA,GAC9B,MAAM,IAAI,YACR,iBACA,mCAAmC,YAAY,UAAU,KAAK,UAAU,KAAK,EAAE,OAAO,UAAU,OAAO,SAAS,YAAY,iDAC9H;CAEF,MAAM,IAAI,OAAO;CACjB,IAAI,MAAM,WACR,MAAM,IAAI,YACR,iBACA,mCAAmC,YAAY,UAAU,KAAK,UAAU,KAAK,EAAE,0FACjF;CAEF,IAAI,MAAM,UACR,MAAM,IAAI,YACR,iBACA,mCAAmC,YAAY,UAAU,KAAK,UAAU,KAAK,EAAE,qEACjF;CAEF,IAAI,MAAM,YAAY,MAAM,UAC1B,MAAM,IAAI,YACR,iBACA,mCAAmC,YAAY,UAAU,KAAK,UAAU,KAAK,EAAE,yBAAyB,KAAK,UAAU,CAAC,EAAE,oCAC5H;CAEF,IAAI,MAAM,YAAY,CAAC,OAAO,SAAS,KAAe,GACpD,MAAM,IAAI,YACR,iBACA,mCAAmC,YAAY,UAAU,KAAK,UAAU,KAAK,EAAE,OAAO,OAAO,KAAK,EAAE,wEACtG;AAEJ"}
@@ -1 +1 @@
1
- {"version":3,"file":"wire-izfGZDvr.js","names":[],"sources":["../packages/protocol/src/query/wire.ts"],"sourcesContent":["/**\n * Wire-format predicate types. A predicate normalises to a flat list\n * of {@link PredicateClause} records; the server, client, matcher,\n * merger, and validator all consume the wire form. Object-literal\n * (`Predicate<T>`) and callback (`PredicateBuilder<T>`) forms compile\n * to this shape via `./normalize.ts` / `./builder.ts`.\n */\n\nimport type { DocumentValue } from \"../json.ts\";\n\n/**\n * Locked operator vocabulary. Methods on {@link PredicateBuilder}\n * map 1:1 to these names; the validator rejects any other.\n *\n * `eq` — strict equality.\n * `gt` / `gte` / `lt` / `lte` — scalar range. Bounds must be `string`\n * or finite `number`. Type-mismatched actuals are always-miss.\n * `in` — set membership. Empty array → `UnsatisfiablePredicate`.\n */\nexport type PredicateOpName = \"eq\" | \"gt\" | \"gte\" | \"lt\" | \"lte\" | \"in\";\n\n/**\n * One clause in a normalised predicate. `field` is a top-level key\n * or a dotted path. `value` is an array iff `op === \"in\"`.\n *\n * `op: \"eq\"` on a primitive `value` is plain equality. The\n * normaliser flattens nested literal sub-predicates\n * (`{ assignee: { team: \"x\" } }`) to dotted-path `eq` clauses\n * (`{op:\"eq\", field:\"assignee.team\", value:\"x\"}`), so an `eq`\n * value at the wire level is never a nested non-primitive object\n * — only callback-form `q.eq(\"nested\", { ... })` could produce\n * one, and that requires the type system to allow it at the call\n * site.\n */\nexport interface PredicateClause {\n readonly op: PredicateOpName;\n readonly field: string;\n readonly value: DocumentValue | ReadonlyArray<DocumentValue>;\n}\n\n/**\n * Normalised predicate envelope. The wire form is a flat list of\n * clauses; multiple clauses across all fields AND together. The\n * empty wire `{ clauses: [] }` matches every document.\n *\n * Wire mirror on the HTTP surface: `?where=` carries the JSON\n * encoding of this object. See `packages/server/API.md` for the\n * literal example.\n */\nexport interface PredicateWire {\n readonly clauses: ReadonlyArray<PredicateClause>;\n}\n\n/** @internal Empty match-all wire — re-used to avoid re-allocating. */\nexport const EMPTY_PREDICATE_WIRE: PredicateWire = { clauses: [] };\n"],"mappings":";;AAsDA,MAAa,uBAAsC,EAAE,SAAS,CAAC,EAAE"}
1
+ {"version":3,"file":"wire-izfGZDvr.js","names":[],"sources":["../packages/protocol/src/query/wire.ts"],"sourcesContent":["/**\n * Wire-format predicate types. A predicate normalises to a flat list\n * of {@link PredicateClause} records; the server, client, matcher,\n * merger, and validator all consume the wire form. Object-literal\n * (`Predicate<T>`) and callback (`PredicateBuilder<T>`) forms compile\n * to this shape via `./normalize.ts` / `./builder.ts`.\n */\n\nimport type { DocumentValue } from \"../json.ts\";\n\n/**\n * Runtime mirror of {@link PredicateOpName}. The type derives from this\n * tuple so the value is the single source of truth: the spec generator\n * and the drift gate enumerate `PREDICATE_OPS`, and tsgo rejects any\n * member added to the type-union without a matching tuple entry.\n */\nexport const PREDICATE_OPS = [\"eq\", \"gt\", \"gte\", \"lt\", \"lte\", \"in\"] as const;\n\n/**\n * Locked operator vocabulary. Methods on {@link PredicateBuilder}\n * map 1:1 to these names; the validator rejects any other.\n *\n * `eq` — strict equality.\n * `gt` / `gte` / `lt` / `lte` — scalar range. Bounds must be `string`\n * or finite `number`. Type-mismatched actuals are always-miss.\n * `in` — set membership. Empty array → `UnsatisfiablePredicate`.\n */\nexport type PredicateOpName = (typeof PREDICATE_OPS)[number];\n\n/**\n * One clause in a normalised predicate. `field` is a top-level key\n * or a dotted path. `value` is an array iff `op === \"in\"`.\n *\n * `op: \"eq\"` on a primitive `value` is plain equality. The\n * normaliser flattens nested literal sub-predicates\n * (`{ assignee: { team: \"x\" } }`) to dotted-path `eq` clauses\n * (`{op:\"eq\", field:\"assignee.team\", value:\"x\"}`), so an `eq`\n * value at the wire level is never a nested non-primitive object\n * — only callback-form `q.eq(\"nested\", { ... })` could produce\n * one, and that requires the type system to allow it at the call\n * site.\n */\nexport interface PredicateClause {\n readonly op: PredicateOpName;\n readonly field: string;\n readonly value: DocumentValue | ReadonlyArray<DocumentValue>;\n}\n\n/**\n * Normalised predicate envelope. The wire form is a flat list of\n * clauses; multiple clauses across all fields AND together. The\n * empty wire `{ clauses: [] }` matches every document.\n *\n * Wire mirror on the HTTP surface: `?where=` carries the JSON\n * encoding of this object. See `packages/server/API.md` for the\n * literal example.\n */\nexport interface PredicateWire {\n readonly clauses: ReadonlyArray<PredicateClause>;\n}\n\n/** @internal Empty match-all wire — re-used to avoid re-allocating. */\nexport const EMPTY_PREDICATE_WIRE: PredicateWire = { clauses: [] };\n"],"mappings":";;AA8DA,MAAa,uBAAsC,EAAE,SAAS,CAAC,EAAE"}
package/package.json CHANGED
@@ -1,18 +1,22 @@
1
1
  {
2
2
  "name": "@gusto/baerly-storage",
3
- "version": "0.2.0",
4
- "description": "Vendorless document database that runs over any S3-compatible storage API.",
3
+ "version": "0.4.0",
4
+ "description": "Document database for S3 and Cloudflare R2 that runs in your request handler — tiny, LLM-friendly TypeScript API, no database server",
5
5
  "keywords": [
6
+ "append-only-log",
7
+ "aws-s3",
6
8
  "cloudflare-workers",
7
- "database",
9
+ "content-addressable-storage",
8
10
  "document-database",
9
- "edge",
11
+ "edge-computing",
10
12
  "http-api",
13
+ "minio",
14
+ "multi-tenant",
11
15
  "nosql",
16
+ "object-storage",
12
17
  "r2",
13
18
  "s3",
14
19
  "s3-compatible",
15
- "self-hosted",
16
20
  "serverless",
17
21
  "typescript"
18
22
  ],
@@ -20,7 +24,7 @@
20
24
  "bugs": {
21
25
  "url": "https://github.com/Gusto/baerly-storage/issues"
22
26
  },
23
- "license": "MIT",
27
+ "license": "Apache-2.0",
24
28
  "author": "Eric Baer",
25
29
  "repository": {
26
30
  "type": "git",
@@ -30,7 +34,8 @@
30
34
  "baerly": "dist/baerly.js"
31
35
  },
32
36
  "files": [
33
- "dist"
37
+ "dist",
38
+ "NOTICE"
34
39
  ],
35
40
  "type": "module",
36
41
  "sideEffects": false,
@@ -55,6 +60,10 @@
55
60
  "types": "./dist/node.d.ts",
56
61
  "import": "./dist/node.js"
57
62
  },
63
+ "./s3": {
64
+ "types": "./dist/s3.d.ts",
65
+ "import": "./dist/s3.js"
66
+ },
58
67
  "./maintenance": {
59
68
  "types": "./dist/maintenance.d.ts",
60
69
  "import": "./dist/maintenance.js"
@@ -85,47 +94,56 @@
85
94
  }
86
95
  },
87
96
  "publishConfig": {
88
- "access": "restricted"
97
+ "access": "public"
89
98
  },
90
99
  "dependencies": {
91
- "@logtape/logtape": "2.1.1"
100
+ "@logtape/logtape": "2.2.2"
92
101
  },
93
102
  "devDependencies": {
94
- "@cloudflare/vitest-pool-workers": "0.16.10",
95
- "@cloudflare/workers-types": "^4.20260527.1",
103
+ "@arethetypeswrong/cli": "^0.18.4",
104
+ "@changesets/cli": "^2.31.0",
105
+ "@cloudflare/vitest-pool-workers": "0.16.14",
106
+ "@cloudflare/workers-types": "^4.20260630.1",
96
107
  "@fast-check/vitest": "^0.4.1",
97
- "@hono/node-server": "^2.0.4",
108
+ "@hono/node-server": "^2.0.6",
98
109
  "@stryker-mutator/core": "9.6.1",
99
110
  "@stryker-mutator/vitest-runner": "9.6.1",
100
111
  "@testing-library/react": "^16.3.2",
101
- "@types/node": "^25.9.1",
112
+ "@types/node": "^26.0.1",
102
113
  "@types/pg": "^8.20.0",
103
- "@types/react": "^19.2.15",
114
+ "@types/react": "^19.2.17",
104
115
  "@types/react-dom": "^19.2.3",
105
- "@typescript/native-preview": "7.0.0-dev.20260526.1",
106
- "@vitest/coverage-v8": "^4.1.7",
116
+ "@typescript/native-preview": "7.0.0-dev.20260610.1",
117
+ "@vitest/coverage-v8": "^4.1.8",
118
+ "ajv": "^8.20.0",
107
119
  "aws4fetch": "1.0.20",
108
- "esbuild": "^0.28.0",
120
+ "esbuild": "^0.28.1",
109
121
  "execa": "^9.6.1",
110
122
  "fast-check": "^4.8.0",
111
- "happy-dom": "^20.9.0",
112
- "lefthook": "^2.1.8",
113
- "oxfmt": "^0.52.0",
114
- "oxlint": "^1.67.0",
123
+ "happy-dom": "^20.10.6",
124
+ "lefthook": "^2.1.9",
125
+ "mermaid": "^11.15.0",
126
+ "oxfmt": "^0.54.0",
127
+ "oxlint": "^1.69.0",
115
128
  "pg": "^8.21.0",
116
- "react": "^19.2.6",
117
- "react-dom": "^19.2.6",
118
- "rolldown": "^1.0.2",
119
- "rolldown-plugin-dts": "^0.25.1",
120
- "vite": "^8.0.14",
121
- "vitest": "^4.1.7",
129
+ "publint": "^0.3.21",
130
+ "react": "^19.2.7",
131
+ "react-dom": "^19.2.7",
132
+ "remark-cli": "^12.0.1",
133
+ "remark-gfm": "^4.0.1",
134
+ "remark-validate-links": "^13.1.0",
135
+ "rolldown": "^1.1.0",
136
+ "rolldown-plugin-dts": "^0.25.2",
137
+ "rollup-license-plugin": "3.2.1",
138
+ "vite": "^8.1.2",
139
+ "vitest": "^4.1.9",
122
140
  "yaml": "2.9.0",
123
141
  "@baerly/adapter-cloudflare": "0.1.0",
124
142
  "@baerly/adapter-node": "0.1.0",
125
- "@baerly/dev": "0.1.0",
126
143
  "@baerly/client": "0.1.0",
127
- "@baerly/protocol": "0.1.0",
128
- "@baerly/server": "0.1.0"
144
+ "@baerly/dev": "0.1.0",
145
+ "@baerly/server": "0.1.0",
146
+ "@baerly/protocol": "0.1.0"
129
147
  },
130
148
  "peerDependencies": {
131
149
  "@cloudflare/workers-types": "^4",
@@ -148,7 +166,7 @@
148
166
  },
149
167
  "scripts": {
150
168
  "typecheck": "tsgo --noEmit",
151
- "pretest": "pnpm run build",
169
+ "pretest": "node scripts/build-if-needed.mjs",
152
170
  "test": "vitest run --project=default",
153
171
  "test:agent": "vitest run --project=default --reporter=minimal --silent=passed-only",
154
172
  "test:one": "pnpm run build && vitest run --project=default",
@@ -157,33 +175,45 @@
157
175
  "test:conformance": "CONFORMANCE=1 MINIO=1 vitest run --project=default tests/integration/conformance.test.ts",
158
176
  "test:export-smoke": "EXPORT_SMOKE=1 vitest run --project=default tests/integration/export-smoke.test.ts",
159
177
  "test:export-round-trip": "vitest run --project=default tests/integration/export-round-trip.test.ts",
160
- "build": "rolldown -c && pnpm -r --filter \"./packages/*\" build",
178
+ "build": "rolldown -c && pnpm -r --filter \"./packages/*\" build && node scripts/merge-third-party-licenses.mjs",
161
179
  "baerly": "node dist/baerly.js",
162
180
  "release": "node scripts/publish.mjs",
163
- "format": "oxfmt tests packages",
164
- "format:check": "oxfmt --check tests packages",
181
+ "changeset": "changeset",
182
+ "changeset:version": "changeset version && rm -f packages/create-baerly-storage/CHANGELOG.md",
183
+ "format": "oxfmt .",
184
+ "format:check": "oxfmt --check .",
165
185
  "lint": "oxlint tests packages",
166
186
  "test:randomize": "FC_NUM_RUNS=10000 vitest run --project=default",
167
- "test:fuzz-phase5": "FC_NUM_RUNS=10000 vitest run --project=default tests/integration/phase5-crash-fuzz.test.ts",
187
+ "test:fuzz-maintenance": "FC_NUM_RUNS=10000 vitest run --project=default tests/integration/maintenance-crash-fuzz.test.ts",
168
188
  "test:adapter-cloudflare": "ADAPTER_CLOUDFLARE=1 vitest run --project=cloudflare-pool",
169
189
  "test:http-conformance": "vitest run --project=default tests/integration/http-conformance.test.ts",
170
190
  "test:adapter-node": "MINIO=1 vitest run --project=default packages/adapter-node",
171
191
  "test:adapters": "pnpm test:adapter-cloudflare && pnpm test:adapter-node",
192
+ "test:parity": "vitest run --project=default packages/protocol/src/storage/memory.test.ts packages/dev/src/local-fs.test.ts packages/adapter-node/src/s3-http.conformance.test.ts tests/integration/collection-api.test.ts tests/integration/randomized.test.ts",
172
193
  "test:manual-e2e": "vitest run --project=default manual-e2e/cloudflare/e2e.test.ts manual-e2e/node/e2e.test.ts",
173
194
  "test:mutate": "stryker run",
174
195
  "mutate:survivors": "node scripts/mutation-survivors.mjs",
175
196
  "test:coverage:protocol": "vitest run --config stryker.vitest.config.ts --coverage --coverage.provider=v8 --coverage.include='packages/protocol/src/**/*.ts' --coverage.exclude='**/*.test.ts' --coverage.exclude='**/*.test-d.ts' --coverage.exclude='**/index.ts'",
176
197
  "gate:day-one": "vitest run --project=default tests/integration/day-one-handshake.test.ts",
198
+ "gen:spec": "node scripts/gen-spec.ts",
199
+ "gen:version-matrix": "node scripts/check-version-matrix.ts --write",
177
200
  "bundle-sizes": "node scripts/bundle-sizes.mjs",
178
- "verify": "pnpm run typecheck && pnpm run verify:examples && pnpm run lint && node scripts/add-ts-extensions.mjs --check && node scripts/lint-use-query.mjs && node scripts/lint-package-layers.mjs && pnpm run verify:docs",
179
- "verify:agent": "tsgo --noEmit --pretty false && pnpm run verify:examples && oxlint --format=unix --quiet tests packages && node scripts/add-ts-extensions.mjs --check && node scripts/lint-use-query.mjs && node scripts/lint-package-layers.mjs && pnpm run verify:docs",
180
- "verify:docs": "node scripts/verify-docs.mjs",
201
+ "check:exports": "node scripts/check-exports.mjs",
202
+ "check:publint": "node scripts/check-publint.mjs",
203
+ "verify:package": "node scripts/build-if-needed.mjs && BAERLY_SKIP_BUILD=1 pnpm run check:exports && BAERLY_SKIP_BUILD=1 pnpm run check:publint",
204
+ "verify:rest": "pnpm run verify:examples && pnpm run format:check && node scripts/add-ts-extensions.mjs --check && node scripts/lint-use-query.mjs && node scripts/lint-package-layers.mjs && node scripts/lint-format-coverage.mjs && node scripts/check-spec-drift.ts && node scripts/check-version-matrix.ts",
205
+ "verify:code": "pnpm run typecheck && pnpm run lint && pnpm run verify:rest",
206
+ "verify": "pnpm run verify:code && pnpm run verify:docs",
207
+ "verify:agent": "tsgo --noEmit --pretty false && oxlint --format=unix --quiet tests packages && pnpm run verify:rest && pnpm run verify:docs",
208
+ "verify:spec": "node scripts/check-spec-drift.ts",
209
+ "verify:version-matrix": "node scripts/check-version-matrix.ts",
210
+ "verify:docs": "node scripts/verify-docs.mjs && node scripts/verify-docs-taxonomy.mjs && remark . --quiet --frail --no-stdout && node scripts/verify-mermaid.mjs",
211
+ "verify:doc-taxonomy": "node scripts/verify-docs-taxonomy.mjs",
212
+ "verify:doc-links": "remark . --quiet --frail --no-stdout",
213
+ "verify:mermaid": "node scripts/verify-mermaid.mjs",
181
214
  "verify:examples": "pnpm --filter minimal-cloudflare typecheck && pnpm --filter minimal-node typecheck && pnpm --filter react-cloudflare typecheck && pnpm --filter react-node typecheck",
182
215
  "dev:storage": "docker compose up -d --wait",
183
216
  "dev:storage:stop": "docker compose down",
184
- "verdaccio:reset": "./scripts/verdaccio-reset.sh",
185
- "verdaccio:publish": "node scripts/verdaccio-publish.mjs",
186
- "dlx:bust-cache": "node scripts/dlx-bust-cache.mjs",
187
217
  "worktree:bootstrap": "node scripts/worktree-bootstrap.mjs",
188
218
  "bench:r2": "node --import ./bench/register-hooks.mjs bench/r2-contention.ts",
189
219
  "bench:r2:matrix": "node --import ./bench/register-hooks.mjs bench/r2-contention-matrix.ts",
@@ -191,6 +221,11 @@
191
221
  "bench:load": "node --import ./bench/register-hooks.mjs bench/load-harness/cli.ts",
192
222
  "bench:load:minio": "MINIO=1 node --import ./bench/register-hooks.mjs bench/load-harness/cli.ts --variant=node-minio",
193
223
  "bench:load:matrix": "node --import ./bench/register-hooks.mjs bench/load-harness/matrix.ts",
194
- "bench:lsn-reverse-walk": "node --import ./bench/register-hooks.mjs bench/lsn-reverse-walk.ts"
224
+ "bench:lsn-reverse-walk": "node --import ./bench/register-hooks.mjs bench/lsn-reverse-walk.ts",
225
+ "bench:fold-cost": "node --import ./bench/register-hooks.mjs bench/fold-cost.ts",
226
+ "bench:maintenance-backlog": "node --import ./bench/register-hooks.mjs bench/maintenance-backlog.ts",
227
+ "bench:amortized-write-cost": "node --import ./bench/register-hooks.mjs bench/amortized-write-cost.ts",
228
+ "bench:write-amp-stress": "node --import ./bench/register-hooks.mjs bench/write-amp-stress.ts",
229
+ "bench:collection-fanout": "node --import ./bench/register-hooks.mjs bench/collection-fanout.ts"
195
230
  }
196
231
  }