@gusto/baerly-storage 0.5.0 → 0.7.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 (215) hide show
  1. package/README.md +47 -124
  2. package/dist/API.md +161 -511
  3. package/dist/CHANGELOG.md +1148 -307
  4. package/dist/RECIPES.md +398 -80
  5. package/dist/THIRD-PARTY-LICENSES.txt +5 -26
  6. package/dist/{app-config-DyiFK3_k.d.ts → app-config-C6qW7m8S.d.ts} +119 -111
  7. package/dist/app-config.d.ts +31 -1
  8. package/dist/app-config.js +1 -2
  9. package/dist/app-config.js.map +1 -1
  10. package/dist/auth.d.ts +33 -28
  11. package/dist/auth.js +549 -985
  12. package/dist/auth.js.map +1 -1
  13. package/dist/baerly.js +130 -138
  14. package/dist/baerly.js.map +1 -1
  15. package/dist/baerly.spec.json +97 -22
  16. package/dist/capacity-warning-header-BlVopyiI.js +16 -0
  17. package/dist/capacity-warning-header-BlVopyiI.js.map +1 -0
  18. package/dist/{client-Fe8CwB73.d.ts → client-CHQTXpef.d.ts} +121 -36
  19. package/dist/client-react.d.ts +67 -20
  20. package/dist/client-react.js +240 -54
  21. package/dist/client-react.js.map +1 -1
  22. package/dist/client.d.ts +5 -4
  23. package/dist/client.js +51 -16
  24. package/dist/client.js.map +1 -1
  25. package/dist/{cloudflare-DzKBrUlg.js → cloudflare-CKHYXccw.js} +504 -124
  26. package/dist/cloudflare-CKHYXccw.js.map +1 -0
  27. package/dist/cloudflare.d.ts +106 -71
  28. package/dist/cloudflare.js +334 -271
  29. package/dist/cloudflare.js.map +1 -1
  30. package/dist/code-resolution-CL_7L0wS.js +22 -0
  31. package/dist/code-resolution-CL_7L0wS.js.map +1 -0
  32. package/dist/collection-api-DbyhLAY8.d.ts +1001 -0
  33. package/dist/config-DEzInG6M.js +4035 -0
  34. package/dist/config-DEzInG6M.js.map +1 -0
  35. package/dist/constants-D3GSH3tc.js +469 -0
  36. package/dist/constants-D3GSH3tc.js.map +1 -0
  37. package/dist/{context-DRZ3tZ5l.js → context-rlpSnHFA.js} +17 -17
  38. package/dist/context-rlpSnHFA.js.map +1 -0
  39. package/dist/cost-B52llVDx.js +330 -0
  40. package/dist/cost-B52llVDx.js.map +1 -0
  41. package/dist/{current-json-C6nhPOm1.js → current-json-CC6lE4Aj.js} +115 -32
  42. package/dist/current-json-CC6lE4Aj.js.map +1 -0
  43. package/dist/db-plFUNTSF.d.ts +130 -0
  44. package/dist/db-read-seams-BSs0m1z1.js +3261 -0
  45. package/dist/db-read-seams-BSs0m1z1.js.map +1 -0
  46. package/dist/{deploy-DonTr-CV.js → deploy-Obj4nE-Z.js} +12 -16
  47. package/dist/deploy-Obj4nE-Z.js.map +1 -0
  48. package/dist/{dev-banner-CWHIk8tH.d.ts → dev-banner-B5AUHmu1.d.ts} +1 -4
  49. package/dist/dev-landing-BI5UdmOb.d.ts +32 -0
  50. package/dist/dev-landing-CD-si4dW.js +50 -0
  51. package/dist/dev-landing-CD-si4dW.js.map +1 -0
  52. package/dist/dev-vite.d.ts +38 -39
  53. package/dist/dev-vite.js +67 -36
  54. package/dist/dev-vite.js.map +1 -1
  55. package/dist/dev.d.ts +3 -2
  56. package/dist/dev.js +2 -1
  57. package/dist/doctor-BA0i-YAN.js +270 -0
  58. package/dist/doctor-BA0i-YAN.js.map +1 -0
  59. package/dist/dump-D1vX8ozg.js +133 -0
  60. package/dist/dump-D1vX8ozg.js.map +1 -0
  61. package/dist/errors-7Rk1HGCE.js +160 -0
  62. package/dist/errors-7Rk1HGCE.js.map +1 -0
  63. package/dist/{validate-DtljsCh1.js → export-BVL2EvYE.js} +409 -19
  64. package/dist/export-BVL2EvYE.js.map +1 -0
  65. package/dist/fsck-BWkPgov4.js +145 -0
  66. package/dist/fsck-BWkPgov4.js.map +1 -0
  67. package/dist/gcs-admin-Dso1HWQj.d.ts +127 -0
  68. package/dist/gcs.d.ts +30 -0
  69. package/dist/gcs.js +1 -0
  70. package/dist/goog4-signer-CeLIABoE.js +331 -0
  71. package/dist/goog4-signer-CeLIABoE.js.map +1 -0
  72. package/dist/{http-DGd5tbNs.js → http-Z5rZyYMX.js} +898 -271
  73. package/dist/http-Z5rZyYMX.js.map +1 -0
  74. package/dist/http-transport-DNUM8kU-.js +1299 -0
  75. package/dist/http-transport-DNUM8kU-.js.map +1 -0
  76. package/dist/http.d.ts +366 -294
  77. package/dist/http.js +2 -2
  78. package/dist/index-JJrIu1pO.d.ts +135 -0
  79. package/dist/index-LEgHN0qJ.d.ts +50 -0
  80. package/dist/{index-CuA9Mi3K.d.ts → index-RiEYj8t0.d.ts} +291 -78
  81. package/dist/index.d.ts +27 -6
  82. package/dist/index.js +3 -5
  83. package/dist/inspect-BTsVYZKd.js +196 -0
  84. package/dist/inspect-BTsVYZKd.js.map +1 -0
  85. package/dist/{key-Di6yyxFu.js → key-C4FPZ9Io.js} +3 -4
  86. package/dist/{key-Di6yyxFu.js.map → key-C4FPZ9Io.js.map} +1 -1
  87. package/dist/ledger-Dj_bGgo0.js +192 -0
  88. package/dist/ledger-Dj_bGgo0.js.map +1 -0
  89. package/dist/legacy-names-DgZBtgOh.js +47 -0
  90. package/dist/legacy-names-DgZBtgOh.js.map +1 -0
  91. package/dist/log-C9W15Dfo.d.ts +94 -0
  92. package/dist/log-tail-DWJbneBF.js +142 -0
  93. package/dist/log-tail-DWJbneBF.js.map +1 -0
  94. package/dist/log-walk-C-vA-WGJ.js +111 -0
  95. package/dist/log-walk-C-vA-WGJ.js.map +1 -0
  96. package/dist/maintenance-Dd-Yakqj.js +1709 -0
  97. package/dist/maintenance-Dd-Yakqj.js.map +1 -0
  98. package/dist/maintenance-DevB6z4e.js +2237 -0
  99. package/dist/maintenance-DevB6z4e.js.map +1 -0
  100. package/dist/maintenance.d.ts +100 -3
  101. package/dist/maintenance.js +1 -3
  102. package/dist/node.d.ts +130 -142
  103. package/dist/node.js +4 -3
  104. package/dist/{observability-BmflLCdF.js → observability-C-ISCCLE.js} +1275 -332
  105. package/dist/observability-C-ISCCLE.js.map +1 -0
  106. package/dist/observability.d.ts +27 -3
  107. package/dist/observability.js +3 -3
  108. package/dist/path-segment-DBXG26PW.js +363 -0
  109. package/dist/path-segment-DBXG26PW.js.map +1 -0
  110. package/dist/{plan-a7PJHBCy.js → plan-BvQbaNMe.js} +19 -11
  111. package/dist/plan-BvQbaNMe.js.map +1 -0
  112. package/dist/request-CRWiTrza.js +272 -0
  113. package/dist/request-CRWiTrza.js.map +1 -0
  114. package/dist/restore-U6Im8V1V.js +1467 -0
  115. package/dist/restore-U6Im8V1V.js.map +1 -0
  116. package/dist/retry-OBtLB2GC.js +126 -0
  117. package/dist/retry-OBtLB2GC.js.map +1 -0
  118. package/dist/rolldown-runtime-D3KUYPsf.js +12 -0
  119. package/dist/{runtime-spec-Dsw2-n8S.js → runtime-spec-B5mg3pHF.js} +189 -28
  120. package/dist/runtime-spec-B5mg3pHF.js.map +1 -0
  121. package/dist/{s3-http-B-z8th6O.d.ts → s3-http-DBC_wiCL.d.ts} +18 -10
  122. package/dist/s3.d.ts +20 -7
  123. package/dist/s3.js +4 -5
  124. package/dist/s3.js.map +1 -1
  125. package/dist/sha256-4FfGQNPw.js +22 -0
  126. package/dist/sha256-4FfGQNPw.js.map +1 -0
  127. package/dist/{shared-secret-DgEicd3x.js → shared-secret-Vkur-8r0.js} +27 -15
  128. package/dist/shared-secret-Vkur-8r0.js.map +1 -0
  129. package/dist/sigv4-sign-5IUflUD_.js +507 -0
  130. package/dist/sigv4-sign-5IUflUD_.js.map +1 -0
  131. package/dist/snapshot-CknzkDM0.js +148 -0
  132. package/dist/snapshot-CknzkDM0.js.map +1 -0
  133. package/dist/{src-BL_JoPTn.js → src-Actga-bO.js} +1004 -378
  134. package/dist/src-Actga-bO.js.map +1 -0
  135. package/dist/src-D0MQfvOp.js +812 -0
  136. package/dist/src-D0MQfvOp.js.map +1 -0
  137. package/dist/src-Dr9uo3dc.js +501 -0
  138. package/dist/src-Dr9uo3dc.js.map +1 -0
  139. package/dist/{subcommand-DoDA-K7d.js → subcommand-BLoF66dG.js} +89 -16
  140. package/dist/subcommand-BLoF66dG.js.map +1 -0
  141. package/dist/{time-DUqvFMHq.js → time-DRxTP9iv.js} +15 -34
  142. package/dist/time-DRxTP9iv.js.map +1 -0
  143. package/dist/types-suVbsEWS.d.ts +116 -0
  144. package/dist/{usage-DBV1eQHC.js → usage-CPzVhrQr.js} +40 -45
  145. package/dist/usage-CPzVhrQr.js.map +1 -0
  146. package/dist/uuid-BuT_c404.js +333 -0
  147. package/dist/uuid-BuT_c404.js.map +1 -0
  148. package/dist/verifier-Bmlmndzo.d.ts +95 -0
  149. package/dist/{wire-izfGZDvr.js → wire-DndvKU-K.js} +2 -3
  150. package/dist/wire-DndvKU-K.js.map +1 -0
  151. package/package.json +96 -69
  152. package/dist/aws4fetch.esm-p7eEzLCs.js +0 -1702
  153. package/dist/aws4fetch.esm-p7eEzLCs.js.map +0 -1
  154. package/dist/bytes-BXdamO3L.js +0 -11
  155. package/dist/bytes-BXdamO3L.js.map +0 -1
  156. package/dist/cloudflare-DzKBrUlg.js.map +0 -1
  157. package/dist/config-1tv0-Yzm.js +0 -2693
  158. package/dist/config-1tv0-Yzm.js.map +0 -1
  159. package/dist/constants-CfeMWQWk.js +0 -222
  160. package/dist/constants-CfeMWQWk.js.map +0 -1
  161. package/dist/context-DRZ3tZ5l.js.map +0 -1
  162. package/dist/cost-DSMIVqzL.js +0 -203
  163. package/dist/cost-DSMIVqzL.js.map +0 -1
  164. package/dist/current-json-C6nhPOm1.js.map +0 -1
  165. package/dist/db-DsPkOVEH.d.ts +0 -254
  166. package/dist/deploy-DonTr-CV.js.map +0 -1
  167. package/dist/doctor-DSIyCDg_.js +0 -346
  168. package/dist/doctor-DSIyCDg_.js.map +0 -1
  169. package/dist/dump-Bh5k26VQ.js +0 -94
  170. package/dist/dump-Bh5k26VQ.js.map +0 -1
  171. package/dist/errors-Dfa3p78c.js +0 -78
  172. package/dist/errors-Dfa3p78c.js.map +0 -1
  173. package/dist/export-DtF5tDIM.js +0 -401
  174. package/dist/export-DtF5tDIM.js.map +0 -1
  175. package/dist/fsck-D_djMO5D.js +0 -279
  176. package/dist/fsck-D_djMO5D.js.map +0 -1
  177. package/dist/http-DGd5tbNs.js.map +0 -1
  178. package/dist/index-0rZcMBwy.d.ts +0 -115
  179. package/dist/index-BNRh23K9.d.ts +0 -162
  180. package/dist/index-BYk9oCNf.d.ts +0 -1112
  181. package/dist/indexes-Dn9hbGQG.d.ts +0 -22
  182. package/dist/inspect-6WZ-pC7-.js +0 -133
  183. package/dist/inspect-6WZ-pC7-.js.map +0 -1
  184. package/dist/log-tail-D98U1JBo.js +0 -522
  185. package/dist/log-tail-D98U1JBo.js.map +0 -1
  186. package/dist/maintenance-B4Dki6Ig.js +0 -2157
  187. package/dist/maintenance-B4Dki6Ig.js.map +0 -1
  188. package/dist/maintenance-B_e0T99L.d.ts +0 -537
  189. package/dist/maintenance-C7coQp4c.js +0 -1418
  190. package/dist/maintenance-C7coQp4c.js.map +0 -1
  191. package/dist/normalize-rjnZLwS4.js +0 -133
  192. package/dist/normalize-rjnZLwS4.js.map +0 -1
  193. package/dist/observability-BmflLCdF.js.map +0 -1
  194. package/dist/plan-a7PJHBCy.js.map +0 -1
  195. package/dist/query-rAtXNQQB.js +0 -1773
  196. package/dist/query-rAtXNQQB.js.map +0 -1
  197. package/dist/rebuild-index-BVzQSZlm.js +0 -81
  198. package/dist/rebuild-index-BVzQSZlm.js.map +0 -1
  199. package/dist/request-u0M51mhJ.js +0 -72
  200. package/dist/request-u0M51mhJ.js.map +0 -1
  201. package/dist/restore-R-4rbciV.js +0 -778
  202. package/dist/restore-R-4rbciV.js.map +0 -1
  203. package/dist/rolldown-runtime-EAsCxrDo.js +0 -14
  204. package/dist/runtime-spec-Dsw2-n8S.js.map +0 -1
  205. package/dist/shared-secret-DgEicd3x.js.map +0 -1
  206. package/dist/src-BL_JoPTn.js.map +0 -1
  207. package/dist/src-CYHFDrKz.js +0 -536
  208. package/dist/src-CYHFDrKz.js.map +0 -1
  209. package/dist/src-DYZ4H1aF.js +0 -392
  210. package/dist/src-DYZ4H1aF.js.map +0 -1
  211. package/dist/subcommand-DoDA-K7d.js.map +0 -1
  212. package/dist/time-DUqvFMHq.js.map +0 -1
  213. package/dist/usage-DBV1eQHC.js.map +0 -1
  214. package/dist/validate-DtljsCh1.js.map +0 -1
  215. package/dist/wire-izfGZDvr.js.map +0 -1
@@ -0,0 +1 @@
1
+ {"version":3,"file":"export-BVL2EvYE.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","../packages/cli/src/export/ddl.ts","../packages/cli/src/export/rows.ts","../packages/cli/src/export/where.ts","../packages/cli/src/export/plan-sidecar.ts","../packages/cli/src/export.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,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 field.includes(\".\") ? walkPath(doc, field.split(\".\")) : doc[field];\n\n/** Follow a split dotted path from `doc`; `undefined` when it cannot be consumed. */\nconst walkPath = (doc: JSONObject, segments: readonly string[]): JSONValue | undefined => {\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\n/**\n * Compile a validated wire-form predicate into a per-document test that\n * agrees with {@link matchesWire} on every document. Each dotted clause\n * path is split once here rather than once per document, so a filter\n * over n rows pays one split per clause instead of n. Clause order,\n * path walk and clause matchers are {@link matchesWire}'s.\n *\n * Same pre-condition as {@link matchesWire}: `wire` has passed\n * {@link validateWire}.\n *\n * @example\n * ```ts\n * const open = compileWire({ clauses: [{ op: \"eq\", field: \"meta.state\", value: \"open\" }] });\n * docs.filter(open);\n * ```\n */\nexport const compileWire = (wire: PredicateWire): ((doc: JSONObject) => boolean) => {\n const compiled = wire.clauses.map((clause) => ({\n clause,\n field: clause.field,\n segments: clause.field.includes(\".\") ? clause.field.split(\".\") : undefined,\n }));\n return (doc) => {\n for (const { clause, field, segments } of compiled) {\n if (!matchesClause(clause, segments === undefined ? doc[field] : walkPath(doc, segments))) {\n return false;\n }\n }\n return true;\n };\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 comparator helpers for the predicate algebra. `./satisfiable.ts`\n * is the only module that consumes them; none is re-exported from\n * `./index.ts`.\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. Exported so\n * `./satisfiable.ts` and other callers reuse the same comparison rule\n * 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","import { BaerlyError } from \"@baerly/protocol\";\nimport type { ExportPlan } from \"./types.ts\";\n\n/**\n * Emit a `CREATE TABLE` statement for the plan, one line per column,\n * terminated with a semicolon + newline so the output is directly\n * pipeable into `psql` / `sqlite3` / `wrangler d1 execute`.\n *\n * `_id` is the primary key (always first in `plan.columns`).\n *\n * D1 today is sqlite-flavoured: same DDL as `target=sqlite` with a\n * single difference — D1 disallows table names starting with\n * `sqlite_`. We refuse them up front.\n */\nexport const emitCreateTable = (plan: ExportPlan): string => {\n if (plan.columns.length === 0) {\n throw new BaerlyError(\n \"SchemaError\",\n `emitCreateTable: collection ${JSON.stringify(plan.table)} has no observed columns — empty snapshot?`,\n );\n }\n if (plan.target === \"d1\" && plan.table.toLowerCase().startsWith(\"sqlite_\")) {\n throw new BaerlyError(\n \"SchemaError\",\n `emitCreateTable: D1 reserves the sqlite_ table-name prefix (got ${JSON.stringify(plan.table)})`,\n );\n }\n const lines: string[] = [];\n lines.push(`CREATE TABLE ${plan.tableIdentifier} (`);\n const colLines: string[] = [];\n for (const col of plan.columns) {\n const nullClause = col.nullable ? \"\" : \" NOT NULL\";\n const pkClause = col.source === \"_id\" ? \" PRIMARY KEY\" : \"\";\n colLines.push(` ${col.identifier} ${col.sqlType}${nullClause}${pkClause}`);\n }\n lines.push(colLines.join(\",\\n\"));\n lines.push(\");\");\n return lines.join(\"\\n\") + \"\\n\";\n};\n","import type { DocumentValue } from \"@baerly/protocol\";\nimport type { ExportPlan, ExportRow } from \"./types.ts\";\nimport { quoteValue } from \"./sql-escape.ts\";\n\n/**\n * Emit one `INSERT INTO …` statement per row. The emitted SQL is\n * directly pipeable into `psql` / `sqlite3` / `wrangler d1\n * execute`. Per-row statements (not one big VALUES tuple) so a\n * mid-stream failure has bounded blast radius.\n *\n * For columns whose plan has `jsonEncoded: true`, the row's value\n * is JSON-stringified first and then string-quoted. Postgres\n * accepts a literal text JSON in a `jsonb` column. SQLite / D1 see\n * the JSON as plain TEXT.\n *\n * Rows are streamed via the async-iterable protocol so the export\n * never materialises the full SQL output in memory. The caller\n * concatenates the yielded chunks (or pipes them straight to disk\n * / stdout).\n */\nexport async function* emitInsertStatements(\n plan: ExportPlan,\n rows: ReadonlyMap<string, ExportRow>,\n): AsyncIterable<string> {\n const columnList = plan.columns.map((c) => c.identifier).join(\", \");\n // Iterate in `Map` insertion order — stable, and the snapshot\n // body itself sorts by `_id` (compactor.ts: `docs is sorted by\n // _id for deterministic byte output`).\n for (const [id, body] of rows) {\n const values: string[] = [];\n for (const col of plan.columns) {\n const raw: DocumentValue | undefined =\n col.source === \"_id\"\n ? (id as DocumentValue)\n : (body as Record<string, DocumentValue>)[col.source];\n if (raw === undefined) {\n values.push(\"NULL\");\n continue;\n }\n if (col.jsonEncoded) {\n const json = JSON.stringify(raw);\n values.push(quoteValue(json, plan.target));\n } else {\n values.push(quoteValue(raw, plan.target));\n }\n }\n yield `INSERT INTO ${plan.tableIdentifier} (${columnList}) VALUES (${values.join(\", \")});\\n`;\n }\n}\n","/**\n * Wire-predicate → SQL `WHERE` clause translation.\n *\n * Pure function. The translator consumes a validated\n * {@link PredicateWire} — the same shape the read path uses — and\n * an {@link ExportPlan} (from `./plan.ts`), and emits a SQL fragment\n * matched against the plan's columns.\n *\n * Three classes of clause:\n *\n * 1. Flat column, top-level field → direct comparator\n * (`\"status\" = 'open'`, `\"priority\" > 5`).\n * 2. JSON-encoded column → JSON-path operators (Postgres `->`/`->>`\n * chains; SQLite/D1 `json_extract(…, '$.…')`).\n * 3. Unmatchable clause (dotted path against a flat column, or a\n * field naming an unknown column) → `1 = 0` plus a hint the CLI\n * surfaces as a `-- TODO(baerly export):` comment above the\n * emitted statement.\n *\n * Dynamic predicates are invisible at runtime — we see the\n * materialised wire, not the source expression. Callers that know\n * they constructed the wire dynamically can pass\n * `options.dynamicHint` to surface an operator-supplied note.\n */\n\nimport {\n BaerlyError,\n type DocumentValue,\n type PredicateClause,\n type PredicateWire,\n validateWire,\n} from \"@baerly/protocol\";\nimport { quoteValue } from \"./sql-escape.ts\";\nimport type { ColumnPlan, ExportPlan, SqlTarget } from \"./types.ts\";\n\nexport interface WhereTranslation {\n /** SQL fragment without the leading `WHERE`. Empty when no predicate. */\n readonly sql: string;\n /**\n * Hand-edit hints for the operator. One entry per non-matchable\n * clause (§3.6) or per dynamically-constructed sub-clause flagged\n * by the caller. The CLI surfaces these as `-- TODO(baerly export): …`\n * comments above the emitted statement.\n */\n readonly hints: readonly string[];\n}\n\n/**\n * Translate a validated {@link PredicateWire} into a SQL WHERE-clause\n * fragment matched against the plan's columns. The first argument\n * must already have been validated by {@link validateWire} — the\n * function re-validates defensively but the caller's invariant\n * matters for error-message provenance.\n *\n * Pure function. No I/O. Same wire + plan + target → same SQL string.\n *\n * @throws BaerlyError code=\"InvalidConfig\" — wire fails\n * {@link validateWire}; same shape `Query<T>.where` already\n * surfaces.\n */\nexport const translatePredicateWireToSql = (\n wire: PredicateWire,\n plan: ExportPlan,\n options?: { readonly dynamicHint?: string },\n): WhereTranslation => {\n validateWire(wire);\n const hints: string[] = [];\n if (options?.dynamicHint !== undefined && options.dynamicHint.length > 0) {\n hints.push(\n `caller-flagged dynamic predicate: ${options.dynamicHint}. Review the emitted SQL for completeness.`,\n );\n }\n const clauses: string[] = [];\n for (const clause of wire.clauses) {\n clauses.push(...clauseForWire(clause, plan, hints));\n }\n return {\n sql: clauses.length === 0 ? \"\" : clauses.join(\" AND \"),\n hints,\n };\n};\n\nconst clauseForWire = (clause: PredicateClause, plan: ExportPlan, hints: string[]): string[] => {\n const segments = clause.field.includes(\".\") ? clause.field.split(\".\") : [clause.field];\n const head = segments[0];\n if (head === undefined || head.length === 0) {\n throw new BaerlyError(\n \"InvalidConfig\",\n \"translatePredicateWireToSql: empty field path encountered (defensive)\",\n );\n }\n const col = plan.columns.find((c) => c.source === head);\n if (col === undefined) {\n hints.push(\n `predicate field ${JSON.stringify(clause.field)} references a key never observed in the snapshot; this clause cannot match.`,\n );\n return [\"1 = 0\"];\n }\n // §3.2 — flat column, top-level field → direct comparator.\n if (!col.jsonEncoded && segments.length === 1) {\n return [flatColumnClause(col.identifier, clause, plan.target)];\n }\n // §3.6 — flat column, dotted path → unmatchable.\n if (!col.jsonEncoded && segments.length > 1) {\n hints.push(\n `predicate path ${JSON.stringify(clause.field)} addresses a flat column; this clause cannot match. Hand-edit if intended.`,\n );\n return [\"1 = 0\"];\n }\n // §3.3 — JSON column, top-level field.\n if (col.jsonEncoded && segments.length === 1) {\n return [jsonColumnRootClause(col, clause, plan.target)];\n }\n // §3.4 / §3.5 — JSON column, dotted path.\n return [jsonPathClause(col, segments.slice(1), clause, plan.target)];\n};\n\nconst flatColumnClause = (\n identifier: string,\n clause: PredicateClause,\n target: SqlTarget,\n): string => {\n switch (clause.op) {\n case \"eq\": {\n return `${identifier} = ${quoteLeaf(clause.value as DocumentValue, target)}`;\n }\n case \"gt\": {\n return `${identifier} > ${quoteLeaf(clause.value as DocumentValue, target)}`;\n }\n case \"gte\": {\n return `${identifier} >= ${quoteLeaf(clause.value as DocumentValue, target)}`;\n }\n case \"lt\": {\n return `${identifier} < ${quoteLeaf(clause.value as DocumentValue, target)}`;\n }\n case \"lte\": {\n return `${identifier} <= ${quoteLeaf(clause.value as DocumentValue, target)}`;\n }\n case \"in\": {\n return `${identifier} IN (${(clause.value as ReadonlyArray<DocumentValue>)\n .map((v) => quoteLeaf(v, target))\n .join(\", \")})`;\n }\n }\n};\n\nconst jsonColumnRootClause = (\n col: ColumnPlan,\n clause: PredicateClause,\n target: SqlTarget,\n): string => {\n // The root JSON column stores the value as JSON-encoded text;\n // we compare against the JSON encoding of the predicate value.\n // Range and `in` ops on a JSON-encoded root column compare the\n // JSON text lexicographically, which is rarely what the caller\n // wanted — for those, the operator is expected to promote the\n // field into a flat column or hand-edit the emitted SQL.\n if (clause.op === \"eq\") {\n const literal = JSON.stringify(clause.value);\n if (target === \"postgres\") {\n return `${col.identifier}::text = ${quoteValue(literal, target)}`;\n }\n return `${col.identifier} = ${quoteValue(literal, target)}`;\n }\n if (clause.op === \"in\") {\n const literals = (clause.value as ReadonlyArray<DocumentValue>).map((v) =>\n quoteValue(JSON.stringify(v), target),\n );\n if (target === \"postgres\") {\n return `${col.identifier}::text IN (${literals.join(\", \")})`;\n }\n return `${col.identifier} IN (${literals.join(\", \")})`;\n }\n // Range against JSON-encoded root: fall back to a lex compare on\n // the JSON serialisation. Surface a comment via the SQL itself;\n // the operator can hand-edit.\n const comparator = rangeComparator(clause.op);\n const literal = JSON.stringify(clause.value);\n if (target === \"postgres\") {\n return `${col.identifier}::text ${comparator} ${quoteValue(literal, target)}`;\n }\n return `${col.identifier} ${comparator} ${quoteValue(literal, target)}`;\n};\n\nconst jsonPathClause = (\n col: ColumnPlan,\n tail: readonly string[],\n clause: PredicateClause,\n target: SqlTarget,\n): string => {\n const accessor = jsonPathAccessor(col.identifier, tail, target);\n switch (clause.op) {\n case \"eq\": {\n return `${accessor} = ${quoteLeaf(clause.value as DocumentValue, target)}`;\n }\n case \"gt\": {\n return `${accessor} > ${quoteLeaf(clause.value as DocumentValue, target)}`;\n }\n case \"gte\": {\n return `${accessor} >= ${quoteLeaf(clause.value as DocumentValue, target)}`;\n }\n case \"lt\": {\n return `${accessor} < ${quoteLeaf(clause.value as DocumentValue, target)}`;\n }\n case \"lte\": {\n return `${accessor} <= ${quoteLeaf(clause.value as DocumentValue, target)}`;\n }\n case \"in\": {\n return `${accessor} IN (${(clause.value as ReadonlyArray<DocumentValue>)\n .map((v) => quoteLeaf(v, target))\n .join(\", \")})`;\n }\n }\n};\n\nconst rangeComparator = (op: PredicateClause[\"op\"]): string => {\n if (op === \"gt\") {\n return \">\";\n }\n if (op === \"gte\") {\n return \">=\";\n }\n if (op === \"lt\") {\n return \"<\";\n }\n return \"<=\";\n};\n\nconst jsonPathAccessor = (\n identifier: string,\n tail: readonly string[],\n target: SqlTarget,\n): string => {\n if (target === \"postgres\") {\n let expr = identifier;\n for (let i = 0; i < tail.length; i++) {\n const seg = tail[i]!;\n const isLast = i === tail.length - 1;\n const key = `'${seg.replace(/'/g, \"''\")}'`;\n expr = `${expr}${isLast ? \"->>\" : \"->\"}${key}`;\n }\n return expr;\n }\n const jsonPath = `'$.${tail.map((s) => s.replace(/'/g, \"''\")).join(\".\")}'`;\n return `json_extract(${identifier}, ${jsonPath})`;\n};\n\n/**\n * Quote a leaf primitive for use as the right-hand side of a\n * comparison. Booleans branch on target. Nested objects must never\n * reach here — wire `eq` clauses on nested objects can only come\n * from the callback form `q.eq(\"nested\", { ... })`, which the\n * export translator does not support today.\n */\nconst quoteLeaf = (value: DocumentValue, target: SqlTarget): string => {\n if (typeof value === \"object\") {\n throw new BaerlyError(\n \"InvalidConfig\",\n \"translatePredicateWireToSql: nested object reached leaf quoter — callback-form q.eq(field, object) is not supported for SQL export. Hand-edit the emitted SQL.\",\n );\n }\n return quoteValue(value, target);\n};\n","/**\n * Sidecar plan serialisation for `baerly export`.\n *\n * `baerly export --output=foo.sql` writes the inferred {@link ExportPlan}\n * alongside the SQL dump as `foo.sql.plan.json`. The round-trip test\n * (`tests/integration/export-round-trip.test.ts`) consumes the sidecar\n * to coerce SQLite-returned values back to their original JS type\n * (e.g. SQLite stores booleans as 0/1; we restore `true`/`false`).\n *\n * Wire shape (`schemaVersion = 1`):\n *\n * ```json\n * {\n * \"schemaVersion\": 1,\n * \"table\": \"tickets\",\n * \"target\": \"sqlite\",\n * \"columns\": [\n * { \"source\": \"_id\", \"sqlType\": \"TEXT\", \"nullable\": false, \"jsonEncoded\": false },\n * ...\n * ]\n * }\n * ```\n *\n * `identifier` is NOT carried on the wire — we re-derive it via\n * {@link quoteIdentifier} on deserialise. An attacker writing the\n * sidecar should not get SQL-emit control over identifiers.\n *\n * `rowCount` is also not preserved across the sidecar boundary; the\n * deserialised plan reports `0`. This is intentional — consumers that\n * care about row count read the SQL stream itself.\n */\n\nimport { BaerlyError } from \"@baerly/protocol\";\nimport { quoteIdentifier } from \"./sql-escape.ts\";\nimport type { ColumnPlan, ExportPlan, SqlTarget, SqlType } from \"./types.ts\";\n\nconst SIDECAR_SCHEMA_VERSION = 1 as const;\n\nconst VALID_TARGETS: ReadonlySet<string> = new Set([\"postgres\", \"sqlite\", \"d1\"]);\n\nconst VALID_SQL_TYPES: ReadonlySet<string> = new Set([\n \"text\",\n \"boolean\",\n \"integer\",\n \"double precision\",\n \"jsonb\",\n \"TEXT\",\n \"INTEGER\",\n \"REAL\",\n]);\n\n/**\n * Encode an {@link ExportPlan} as the canonical sidecar JSON string.\n *\n * Wire format is pretty-printed (`indent=2`) with a trailing newline\n * so `cat sidecar.plan.json` is human-readable and `diff` works on\n * two sidecars without spurious line-end noise. The on-wire bytes\n * embed the `schemaVersion` discriminator so future shape changes\n * are detectable; `identifier` and `tableIdentifier` are NOT carried\n * (they're re-derived via {@link quoteIdentifier} on deserialise).\n */\nexport const serializeExportPlan = (plan: ExportPlan): string => {\n return (\n JSON.stringify(\n {\n schemaVersion: SIDECAR_SCHEMA_VERSION,\n table: plan.table,\n target: plan.target,\n columns: plan.columns.map((c) => ({\n source: c.source,\n sqlType: c.sqlType,\n nullable: c.nullable,\n jsonEncoded: c.jsonEncoded,\n })),\n },\n null,\n 2,\n ) + \"\\n\"\n );\n};\n\nconst isObject = (value: unknown): value is Record<string, unknown> =>\n value !== null && typeof value === \"object\" && !Array.isArray(value);\n\n/**\n * Parse the sidecar JSON string back into an {@link ExportPlan}.\n *\n * @throws BaerlyError code=\"InvalidConfig\" when the sidecar JSON is\n * malformed, the schema version is unsupported, or any required\n * field is missing / has an unexpected type. Identifiers are\n * re-quoted via {@link quoteIdentifier} rather than copied off the\n * wire — the sidecar cannot smuggle SQL-injection via a\n * pre-quoted identifier.\n */\nexport const deserializeExportPlan = (text: string): ExportPlan => {\n let raw: unknown;\n try {\n raw = JSON.parse(text);\n } catch (error) {\n throw new BaerlyError(\n \"InvalidConfig\",\n `deserializeExportPlan: parse failed: ${(error as Error).message}`,\n );\n }\n if (!isObject(raw)) {\n throw new BaerlyError(\n \"InvalidConfig\",\n \"deserializeExportPlan: top-level value is not an object\",\n );\n }\n if (raw[\"schemaVersion\"] !== SIDECAR_SCHEMA_VERSION) {\n throw new BaerlyError(\n \"InvalidConfig\",\n `deserializeExportPlan: unsupported schemaVersion ${String(raw[\"schemaVersion\"])} (expected ${String(SIDECAR_SCHEMA_VERSION)})`,\n );\n }\n if (typeof raw[\"table\"] !== \"string\" || raw[\"table\"].length === 0) {\n throw new BaerlyError(\"InvalidConfig\", \"deserializeExportPlan: missing or empty table\");\n }\n if (typeof raw[\"target\"] !== \"string\" || !VALID_TARGETS.has(raw[\"target\"])) {\n throw new BaerlyError(\n \"InvalidConfig\",\n `deserializeExportPlan: unknown target ${JSON.stringify(raw[\"target\"])}`,\n );\n }\n if (!Array.isArray(raw[\"columns\"])) {\n throw new BaerlyError(\"InvalidConfig\", \"deserializeExportPlan: columns is not an array\");\n }\n const table = raw[\"table\"];\n const target = raw[\"target\"] as SqlTarget;\n const columns: ColumnPlan[] = [];\n for (const [i, col] of raw[\"columns\"].entries()) {\n if (!isObject(col)) {\n throw new BaerlyError(\n \"InvalidConfig\",\n `deserializeExportPlan: columns[${i}] is not an object`,\n );\n }\n if (typeof col[\"source\"] !== \"string\" || col[\"source\"].length === 0) {\n throw new BaerlyError(\n \"InvalidConfig\",\n `deserializeExportPlan: columns[${i}].source is missing or empty`,\n );\n }\n if (typeof col[\"sqlType\"] !== \"string\" || !VALID_SQL_TYPES.has(col[\"sqlType\"])) {\n throw new BaerlyError(\n \"InvalidConfig\",\n `deserializeExportPlan: columns[${i}].sqlType ${JSON.stringify(col[\"sqlType\"])} is not a recognised SqlType`,\n );\n }\n if (typeof col[\"nullable\"] !== \"boolean\") {\n throw new BaerlyError(\n \"InvalidConfig\",\n `deserializeExportPlan: columns[${i}].nullable is not a boolean`,\n );\n }\n if (typeof col[\"jsonEncoded\"] !== \"boolean\") {\n throw new BaerlyError(\n \"InvalidConfig\",\n `deserializeExportPlan: columns[${i}].jsonEncoded is not a boolean`,\n );\n }\n columns.push({\n source: col[\"source\"],\n identifier: quoteIdentifier(col[\"source\"], target),\n sqlType: col[\"sqlType\"] as SqlType,\n nullable: col[\"nullable\"],\n jsonEncoded: col[\"jsonEncoded\"],\n });\n }\n return {\n table,\n target,\n tableIdentifier: quoteIdentifier(table, target),\n columns,\n // Not preserved across the sidecar boundary — see file JSDoc.\n rowCount: 0,\n };\n};\n","/**\n * `baerly export` — snapshot dump of one collection to SQL.\n *\n * Drives the export modules end-to-end: load the materialised view,\n * infer an `ExportPlan` over the row shape, emit `CREATE TABLE` +\n * `INSERT` statements. When `--where=<json>` is supplied the\n * predicate is translated via `translatePredicateToSql` and applied\n * in-memory through `matches(...)` so the emitted INSERTs already\n * match the filter; the translated WHERE clause is also surfaced as a\n * comment above the inserts so operators can inspect / hand-edit it.\n *\n * The sidecar file (`<output>.plan.json`) carries the `ExportPlan` so\n * a follow-up round-trip ingest can verify the column schema. The\n * sidecar is JSON via `JSON.stringify` — the plan shape is the public\n * contract.\n *\n * Args:\n * --bucket Required. Bucket URI.\n * --app Required (or via baerly.config.ts).\n * --tenant Required (or via baerly.config.ts).\n * --collection Required. Collection name.\n * --target Required. postgres | sqlite | d1.\n * --where Optional. JSON-encoded `Predicate<T>`.\n * --where-comment Optional. Caller hint surfaced as a\n * `-- TODO(baerly export):` comment.\n * --output Optional. Path to write SQL into; default\n * stdout. The sidecar plan is written to\n * `<output>.plan.json` unless `--no-sidecar`.\n * --no-sidecar Skip emitting the sidecar plan file.\n * --json JSON envelope on stdout (or stderr on error).\n *\n * Exit codes:\n * 0 — dump completed.\n * 1 — InvalidConfig (bad args / bucket URI / --where JSON / unknown --target).\n * 2 — Storage / Network error.\n * 3 — Protocol invariant / conflict (Internal / InvalidResponse /\n * WriteConflict / AlreadyExists).\n */\n\nimport { writeFile } from \"node:fs/promises\";\nimport { type ArgsDef } from \"citty\";\nimport { BaerlyError, matchesWire, type PredicateWire, validateWire } from \"@baerly/protocol\";\nimport {\n type ExportPlan,\n type ExportRow,\n type SqlTarget,\n emitCreateTable,\n emitInsertStatements,\n inferPlanForCollection,\n loadMaterialisedView,\n serializeExportPlan,\n translatePredicateWireToSql,\n} from \"./export/index.ts\";\nimport { parseBucketUri } from \"./bucket-uri.ts\";\nimport { emitSuccess } from \"./output.ts\";\nimport {\n APP_ARG,\n assertCollectionArg,\n BUCKET_ARG,\n COLLECTION_ARG,\n defineBaerlySubcommand,\n JSON_ARG,\n TENANT_ARG,\n} from \"./subcommand.ts\";\n\nconst EXPORT_ARGS = {\n bucket: BUCKET_ARG,\n app: APP_ARG,\n tenant: TENANT_ARG,\n collection: COLLECTION_ARG,\n target: {\n type: \"enum\",\n options: [\"postgres\", \"sqlite\", \"d1\"],\n required: true,\n description: \"SQL target: postgres | sqlite | d1.\",\n },\n where: {\n type: \"string\",\n required: false,\n description: \"JSON-encoded PredicateWire ({ clauses: [...] }) filtering the rows to export.\",\n valueHint: \"json\",\n },\n \"where-comment\": {\n type: \"string\",\n required: false,\n description: \"Caller hint surfaced as a -- TODO(baerly export): comment.\",\n valueHint: \"text\",\n },\n output: {\n type: \"string\",\n required: false,\n description: \"Path to write SQL into; default stdout.\",\n valueHint: \"path\",\n },\n sidecar: {\n type: \"boolean\",\n default: true,\n description: \"Emit a <output>.plan.json sidecar (default true; pass --no-sidecar to skip).\",\n },\n json: JSON_ARG,\n} as const satisfies ArgsDef;\n\nconst parseWherePredicate = (raw: string): PredicateWire => {\n let parsed: unknown;\n try {\n parsed = JSON.parse(raw);\n } catch (error) {\n throw new BaerlyError(\n \"InvalidConfig\",\n `baerly export: --where is not valid JSON: ${(error as Error).message}`,\n );\n }\n if (parsed === null || typeof parsed !== \"object\" || Array.isArray(parsed)) {\n throw new BaerlyError(\n \"InvalidConfig\",\n `baerly export: --where must decode to a JSON object (got ${describeNonObject(parsed)})`,\n );\n }\n // Re-validate defensively; the translator will reject too, but\n // surfacing the error here gives a single uniform error path.\n validateWire(parsed as PredicateWire);\n return parsed as PredicateWire;\n};\n\nconst filterRows = (\n rows: ReadonlyMap<string, ExportRow>,\n wire: PredicateWire | null,\n): Map<string, ExportRow> => {\n const filtered = new Map<string, ExportRow>();\n for (const [id, body] of rows) {\n if (wire === null) {\n filtered.set(id, body);\n continue;\n }\n if (matchesWire(wire, body)) {\n filtered.set(id, body);\n }\n }\n return filtered;\n};\n\nconst buildSql = async (\n plan: ExportPlan,\n rows: ReadonlyMap<string, ExportRow>,\n whereClause: string,\n whereHints: readonly string[],\n): Promise<string> => {\n let out = emitCreateTable(plan);\n for (const hint of whereHints) {\n out += `-- TODO(baerly export): ${hint}\\n`;\n }\n if (whereClause.length > 0) {\n out += `-- WHERE clause for review: ${whereClause}\\n`;\n }\n for await (const chunk of emitInsertStatements(plan, rows)) {\n out += chunk;\n }\n return out;\n};\n\nconst bundle = defineBaerlySubcommand({\n name: \"export\",\n meta: {\n description: \"Snapshot dump of one collection to SQL.\",\n },\n args: EXPORT_ARGS,\n handler: async (args, ctx) => {\n const target: SqlTarget = args.target;\n const { app, tenant } = await ctx.resolveAppTenant({ app: args.app, tenant: args.tenant });\n assertCollectionArg(args.collection, \"baerly export\");\n const bucket = await parseBucketUri(args.bucket);\n const currentJsonKey = `${bucket.keyPrefix}app/${app}/tenant/${tenant}/manifests/${args.collection}/current.json`;\n const view = await loadMaterialisedView({\n storage: bucket.storage,\n currentJsonKey,\n collection: args.collection,\n });\n if (view === null) {\n throw new BaerlyError(\n \"InvalidConfig\",\n `baerly export: collection ${JSON.stringify(args.collection)} is not provisioned (no current.json at ${currentJsonKey})`,\n );\n }\n const plan = inferPlanForCollection({\n rows: view,\n target,\n table: args.collection,\n });\n\n let wire: PredicateWire | null = null;\n let whereClause = \"\";\n let whereHints: readonly string[] = [];\n if (typeof args.where === \"string\" && args.where.length > 0) {\n wire = parseWherePredicate(args.where);\n const translation = translatePredicateWireToSql(\n wire,\n plan,\n typeof args[\"where-comment\"] === \"string\" && args[\"where-comment\"].length > 0\n ? { dynamicHint: args[\"where-comment\"] }\n : undefined,\n );\n whereClause = translation.sql;\n whereHints = translation.hints;\n } else if (typeof args[\"where-comment\"] === \"string\" && args[\"where-comment\"].length > 0) {\n // Bare --where-comment with no predicate still surfaces the operator's\n // note so reviewers see the intent.\n whereHints = [\n `caller-flagged dynamic predicate: ${args[\"where-comment\"]}. No predicate supplied; emitted INSERTs cover the full collection.`,\n ];\n }\n\n const filtered = filterRows(view, wire);\n const sql = await buildSql(plan, filtered, whereClause, whereHints);\n\n const outputPath = args.output;\n if (typeof outputPath === \"string\" && outputPath.length > 0) {\n await writeFile(outputPath, sql, \"utf8\");\n if (args.sidecar !== false) {\n await writeFile(`${outputPath}.plan.json`, serializeExportPlan(plan), \"utf8\");\n }\n } else {\n process.stdout.write(sql);\n }\n\n emitSuccess({\n command: \"export\",\n status: \"ok\",\n collection: args.collection,\n target,\n rows: filtered.size,\n hints: whereHints,\n ...(typeof outputPath === \"string\" && outputPath.length > 0 && { output: outputPath }),\n });\n return 0;\n },\n});\n\n/** citty `defineCommand` block for `baerly export`. */\nexport const exportCmd = bundle.cmd;\n\n/**\n * Programmatic entry used by tests. Bypasses citty's `run` wrapper\n * (which would call `process.exit` and kill vitest) and returns the\n * integer exit code directly.\n */\nexport const runExport = bundle.run;\n\n// Build a human-readable label for the \"expected JSON object\" error.\n// `null`, arrays, and the bare `undefined` need to be disambiguated\n// from `typeof`'s default \"object\".\nconst describeNonObject = (v: unknown): string => {\n if (v === null) {\n return \"null\";\n }\n if (Array.isArray(v)) {\n return \"array\";\n }\n return typeof v;\n};\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4CA,MAAa,eAAe,MAAqB,QAA6B;CAC5E,KAAK,MAAM,UAAU,KAAK,SAAS;EACjC,MAAM,SAAS,WAAW,KAAK,OAAO,KAAK;EAC3C,IAAI,CAAC,cAAc,QAAQ,MAAM,GAC/B,OAAO;CAEX;CACA,OAAO;AACT;AAEA,MAAM,cAAc,KAAiB,UAInC,MAAM,SAAS,GAAG,IAAI,SAAS,KAAK,MAAM,MAAM,GAAG,CAAC,IAAI,IAAI;;AAG9D,MAAM,YAAY,KAAiB,aAAuD;CACxF,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;AAkCA,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,UACX;MAAA,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;;;AC1MA,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;;;;;;;;;;;;;;;;;AAkB5E,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;;;;;;;;;;;;;;;;;;;;;;;ACxCA,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,GAChB;QAAA,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,GACP;OAAA,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;;;;;;;;;;;;;AC1NA,MAAa,mBAAmB,SAA6B;CAC3D,IAAI,KAAK,QAAQ,WAAW,GAC1B,MAAM,IAAI,YACR,eACA,+BAA+B,KAAK,UAAU,KAAK,KAAK,EAAE,2CAC5D;CAEF,IAAI,KAAK,WAAW,QAAQ,KAAK,MAAM,YAAY,CAAC,CAAC,WAAW,SAAS,GACvE,MAAM,IAAI,YACR,eACA,mEAAmE,KAAK,UAAU,KAAK,KAAK,EAAE,EAChG;CAEF,MAAM,QAAkB,CAAC;CACzB,MAAM,KAAK,gBAAgB,KAAK,gBAAgB,GAAG;CACnD,MAAM,WAAqB,CAAC;CAC5B,KAAK,MAAM,OAAO,KAAK,SAAS;EAC9B,MAAM,aAAa,IAAI,WAAW,KAAK;EACvC,MAAM,WAAW,IAAI,WAAW,QAAQ,iBAAiB;EACzD,SAAS,KAAK,KAAK,IAAI,WAAW,GAAG,IAAI,UAAU,aAAa,UAAU;CAC5E;CACA,MAAM,KAAK,SAAS,KAAK,KAAK,CAAC;CAC/B,MAAM,KAAK,IAAI;CACf,OAAO,MAAM,KAAK,IAAI,IAAI;AAC5B;;;;;;;;;;;;;;;;;;AClBA,gBAAuB,qBACrB,MACA,MACuB;CACvB,MAAM,aAAa,KAAK,QAAQ,KAAK,MAAM,EAAE,UAAU,CAAC,CAAC,KAAK,IAAI;CAIlE,KAAK,MAAM,CAAC,IAAI,SAAS,MAAM;EAC7B,MAAM,SAAmB,CAAC;EAC1B,KAAK,MAAM,OAAO,KAAK,SAAS;GAC9B,MAAM,MACJ,IAAI,WAAW,QACV,KACA,KAAuC,IAAI;GAClD,IAAI,QAAQ,KAAA,GAAW;IACrB,OAAO,KAAK,MAAM;IAClB;GACF;GACA,IAAI,IAAI,aAAa;IACnB,MAAM,OAAO,KAAK,UAAU,GAAG;IAC/B,OAAO,KAAK,WAAW,MAAM,KAAK,MAAM,CAAC;GAC3C,OACE,OAAO,KAAK,WAAW,KAAK,KAAK,MAAM,CAAC;EAE5C;EACA,MAAM,eAAe,KAAK,gBAAgB,IAAI,WAAW,YAAY,OAAO,KAAK,IAAI,EAAE;CACzF;AACF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACYA,MAAa,+BACX,MACA,MACA,YACqB;CACrB,aAAa,IAAI;CACjB,MAAM,QAAkB,CAAC;CACzB,IAAI,SAAS,gBAAgB,KAAA,KAAa,QAAQ,YAAY,SAAS,GACrE,MAAM,KACJ,qCAAqC,QAAQ,YAAY,2CAC3D;CAEF,MAAM,UAAoB,CAAC;CAC3B,KAAK,MAAM,UAAU,KAAK,SACxB,QAAQ,KAAK,GAAG,cAAc,QAAQ,MAAM,KAAK,CAAC;CAEpD,OAAO;EACL,KAAK,QAAQ,WAAW,IAAI,KAAK,QAAQ,KAAK,OAAO;EACrD;CACF;AACF;AAEA,MAAM,iBAAiB,QAAyB,MAAkB,UAA8B;CAC9F,MAAM,WAAW,OAAO,MAAM,SAAS,GAAG,IAAI,OAAO,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,KAAK;CACrF,MAAM,OAAO,SAAS;CACtB,IAAI,SAAS,KAAA,KAAa,KAAK,WAAW,GACxC,MAAM,IAAI,YACR,iBACA,uEACF;CAEF,MAAM,MAAM,KAAK,QAAQ,MAAM,MAAM,EAAE,WAAW,IAAI;CACtD,IAAI,QAAQ,KAAA,GAAW;EACrB,MAAM,KACJ,mBAAmB,KAAK,UAAU,OAAO,KAAK,EAAE,4EAClD;EACA,OAAO,CAAC,OAAO;CACjB;CAEA,IAAI,CAAC,IAAI,eAAe,SAAS,WAAW,GAC1C,OAAO,CAAC,iBAAiB,IAAI,YAAY,QAAQ,KAAK,MAAM,CAAC;CAG/D,IAAI,CAAC,IAAI,eAAe,SAAS,SAAS,GAAG;EAC3C,MAAM,KACJ,kBAAkB,KAAK,UAAU,OAAO,KAAK,EAAE,2EACjD;EACA,OAAO,CAAC,OAAO;CACjB;CAEA,IAAI,IAAI,eAAe,SAAS,WAAW,GACzC,OAAO,CAAC,qBAAqB,KAAK,QAAQ,KAAK,MAAM,CAAC;CAGxD,OAAO,CAAC,eAAe,KAAK,SAAS,MAAM,CAAC,GAAG,QAAQ,KAAK,MAAM,CAAC;AACrE;AAEA,MAAM,oBACJ,YACA,QACA,WACW;CACX,QAAQ,OAAO,IAAf;EACE,KAAK,MACH,OAAO,GAAG,WAAW,KAAK,UAAU,OAAO,OAAwB,MAAM;EAE3E,KAAK,MACH,OAAO,GAAG,WAAW,KAAK,UAAU,OAAO,OAAwB,MAAM;EAE3E,KAAK,OACH,OAAO,GAAG,WAAW,MAAM,UAAU,OAAO,OAAwB,MAAM;EAE5E,KAAK,MACH,OAAO,GAAG,WAAW,KAAK,UAAU,OAAO,OAAwB,MAAM;EAE3E,KAAK,OACH,OAAO,GAAG,WAAW,MAAM,UAAU,OAAO,OAAwB,MAAM;EAE5E,KAAK,MACH,OAAO,GAAG,WAAW,OAAQ,OAAO,MACjC,KAAK,MAAM,UAAU,GAAG,MAAM,CAAC,CAAC,CAChC,KAAK,IAAI,EAAE;CAElB;AACF;AAEA,MAAM,wBACJ,KACA,QACA,WACW;CAOX,IAAI,OAAO,OAAO,MAAM;EACtB,MAAM,UAAU,KAAK,UAAU,OAAO,KAAK;EAC3C,IAAI,WAAW,YACb,OAAO,GAAG,IAAI,WAAW,WAAW,WAAW,SAAS,MAAM;EAEhE,OAAO,GAAG,IAAI,WAAW,KAAK,WAAW,SAAS,MAAM;CAC1D;CACA,IAAI,OAAO,OAAO,MAAM;EACtB,MAAM,WAAY,OAAO,MAAuC,KAAK,MACnE,WAAW,KAAK,UAAU,CAAC,GAAG,MAAM,CACtC;EACA,IAAI,WAAW,YACb,OAAO,GAAG,IAAI,WAAW,aAAa,SAAS,KAAK,IAAI,EAAE;EAE5D,OAAO,GAAG,IAAI,WAAW,OAAO,SAAS,KAAK,IAAI,EAAE;CACtD;CAIA,MAAM,aAAa,gBAAgB,OAAO,EAAE;CAC5C,MAAM,UAAU,KAAK,UAAU,OAAO,KAAK;CAC3C,IAAI,WAAW,YACb,OAAO,GAAG,IAAI,WAAW,SAAS,WAAW,GAAG,WAAW,SAAS,MAAM;CAE5E,OAAO,GAAG,IAAI,WAAW,GAAG,WAAW,GAAG,WAAW,SAAS,MAAM;AACtE;AAEA,MAAM,kBACJ,KACA,MACA,QACA,WACW;CACX,MAAM,WAAW,iBAAiB,IAAI,YAAY,MAAM,MAAM;CAC9D,QAAQ,OAAO,IAAf;EACE,KAAK,MACH,OAAO,GAAG,SAAS,KAAK,UAAU,OAAO,OAAwB,MAAM;EAEzE,KAAK,MACH,OAAO,GAAG,SAAS,KAAK,UAAU,OAAO,OAAwB,MAAM;EAEzE,KAAK,OACH,OAAO,GAAG,SAAS,MAAM,UAAU,OAAO,OAAwB,MAAM;EAE1E,KAAK,MACH,OAAO,GAAG,SAAS,KAAK,UAAU,OAAO,OAAwB,MAAM;EAEzE,KAAK,OACH,OAAO,GAAG,SAAS,MAAM,UAAU,OAAO,OAAwB,MAAM;EAE1E,KAAK,MACH,OAAO,GAAG,SAAS,OAAQ,OAAO,MAC/B,KAAK,MAAM,UAAU,GAAG,MAAM,CAAC,CAAC,CAChC,KAAK,IAAI,EAAE;CAElB;AACF;AAEA,MAAM,mBAAmB,OAAsC;CAC7D,IAAI,OAAO,MACT,OAAO;CAET,IAAI,OAAO,OACT,OAAO;CAET,IAAI,OAAO,MACT,OAAO;CAET,OAAO;AACT;AAEA,MAAM,oBACJ,YACA,MACA,WACW;CACX,IAAI,WAAW,YAAY;EACzB,IAAI,OAAO;EACX,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;GACpC,MAAM,MAAM,KAAK;GACjB,MAAM,SAAS,MAAM,KAAK,SAAS;GACnC,MAAM,MAAM,IAAI,IAAI,QAAQ,MAAM,IAAI,EAAE;GACxC,OAAO,GAAG,OAAO,SAAS,QAAQ,OAAO;EAC3C;EACA,OAAO;CACT;CAEA,OAAO,gBAAgB,WAAW,IAAI,MADf,KAAK,KAAK,MAAM,EAAE,QAAQ,MAAM,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,GACzB;AACjD;;;;;;;;AASA,MAAM,aAAa,OAAsB,WAA8B;CACrE,IAAI,OAAO,UAAU,UACnB,MAAM,IAAI,YACR,iBACA,gKACF;CAEF,OAAO,WAAW,OAAO,MAAM;AACjC;;AClOA,MAAM,yBAAyB;;;;;;;;;;;AAyB/B,MAAa,uBAAuB,SAA6B;CAC/D,OACE,KAAK,UACH;EACE,eAAe;EACf,OAAO,KAAK;EACZ,QAAQ,KAAK;EACb,SAAS,KAAK,QAAQ,KAAK,OAAO;GAChC,QAAQ,EAAE;GACV,SAAS,EAAE;GACX,UAAU,EAAE;GACZ,aAAa,EAAE;EACjB,EAAE;CACJ,GACA,MACA,CACF,IAAI;AAER;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACdA,MAAM,cAAc;CAClB,QAAQ;CACR,KAAK;CACL,QAAQ;CACR,YAAY;CACZ,QAAQ;EACN,MAAM;EACN,SAAS;GAAC;GAAY;GAAU;EAAI;EACpC,UAAU;EACV,aAAa;CACf;CACA,OAAO;EACL,MAAM;EACN,UAAU;EACV,aAAa;EACb,WAAW;CACb;CACA,iBAAiB;EACf,MAAM;EACN,UAAU;EACV,aAAa;EACb,WAAW;CACb;CACA,QAAQ;EACN,MAAM;EACN,UAAU;EACV,aAAa;EACb,WAAW;CACb;CACA,SAAS;EACP,MAAM;EACN,SAAS;EACT,aAAa;CACf;CACA,MAAM;AACR;AAEA,MAAM,uBAAuB,QAA+B;CAC1D,IAAI;CACJ,IAAI;EACF,SAAS,KAAK,MAAM,GAAG;CACzB,SAAS,OAAO;EACd,MAAM,IAAI,YACR,iBACA,6CAA8C,MAAgB,SAChE;CACF;CACA,IAAI,WAAW,QAAQ,OAAO,WAAW,YAAY,MAAM,QAAQ,MAAM,GACvE,MAAM,IAAI,YACR,iBACA,4DAA4D,kBAAkB,MAAM,EAAE,EACxF;CAIF,aAAa,MAAuB;CACpC,OAAO;AACT;AAEA,MAAM,cACJ,MACA,SAC2B;CAC3B,MAAM,2BAAW,IAAI,IAAuB;CAC5C,KAAK,MAAM,CAAC,IAAI,SAAS,MAAM;EAC7B,IAAI,SAAS,MAAM;GACjB,SAAS,IAAI,IAAI,IAAI;GACrB;EACF;EACA,IAAI,YAAY,MAAM,IAAI,GACxB,SAAS,IAAI,IAAI,IAAI;CAEzB;CACA,OAAO;AACT;AAEA,MAAM,WAAW,OACf,MACA,MACA,aACA,eACoB;CACpB,IAAI,MAAM,gBAAgB,IAAI;CAC9B,KAAK,MAAM,QAAQ,YACjB,OAAO,2BAA2B,KAAK;CAEzC,IAAI,YAAY,SAAS,GACvB,OAAO,+BAA+B,YAAY;CAEpD,WAAW,MAAM,SAAS,qBAAqB,MAAM,IAAI,GACvD,OAAO;CAET,OAAO;AACT;AAEA,MAAM,SAAS,uBAAuB;CACpC,MAAM;CACN,MAAM,EACJ,aAAa,0CACf;CACA,MAAM;CACN,SAAS,OAAO,MAAM,QAAQ;EAC5B,MAAM,SAAoB,KAAK;EAC/B,MAAM,EAAE,KAAK,WAAW,MAAM,IAAI,iBAAiB;GAAE,KAAK,KAAK;GAAK,QAAQ,KAAK;EAAO,CAAC;EACzF,oBAAoB,KAAK,YAAY,eAAe;EACpD,MAAM,SAAS,MAAM,eAAe,KAAK,MAAM;EAC/C,MAAM,iBAAiB,GAAG,OAAO,UAAU,MAAM,IAAI,UAAU,OAAO,aAAa,KAAK,WAAW;EACnG,MAAM,OAAO,MAAM,qBAAqB;GACtC,SAAS,OAAO;GAChB;GACA,YAAY,KAAK;EACnB,CAAC;EACD,IAAI,SAAS,MACX,MAAM,IAAI,YACR,iBACA,6BAA6B,KAAK,UAAU,KAAK,UAAU,EAAE,0CAA0C,eAAe,EACxH;EAEF,MAAM,OAAO,uBAAuB;GAClC,MAAM;GACN;GACA,OAAO,KAAK;EACd,CAAC;EAED,IAAI,OAA6B;EACjC,IAAI,cAAc;EAClB,IAAI,aAAgC,CAAC;EACrC,IAAI,OAAO,KAAK,UAAU,YAAY,KAAK,MAAM,SAAS,GAAG;GAC3D,OAAO,oBAAoB,KAAK,KAAK;GACrC,MAAM,cAAc,4BAClB,MACA,MACA,OAAO,KAAK,qBAAqB,YAAY,KAAK,gBAAgB,CAAC,SAAS,IACxE,EAAE,aAAa,KAAK,iBAAiB,IACrC,KAAA,CACN;GACA,cAAc,YAAY;GAC1B,aAAa,YAAY;EAC3B,OAAO,IAAI,OAAO,KAAK,qBAAqB,YAAY,KAAK,gBAAgB,CAAC,SAAS,GAGrF,aAAa,CACX,qCAAqC,KAAK,iBAAiB,oEAC7D;EAGF,MAAM,WAAW,WAAW,MAAM,IAAI;EACtC,MAAM,MAAM,MAAM,SAAS,MAAM,UAAU,aAAa,UAAU;EAElE,MAAM,aAAa,KAAK;EACxB,IAAI,OAAO,eAAe,YAAY,WAAW,SAAS,GAAG;GAC3D,MAAM,UAAU,YAAY,KAAK,MAAM;GACvC,IAAI,KAAK,YAAY,OACnB,MAAM,UAAU,GAAG,WAAW,aAAa,oBAAoB,IAAI,GAAG,MAAM;EAEhF,OACE,QAAQ,OAAO,MAAM,GAAG;EAG1B,YAAY;GACV,SAAS;GACT,QAAQ;GACR,YAAY,KAAK;GACjB;GACA,MAAM,SAAS;GACf,OAAO;GACP,GAAI,OAAO,eAAe,YAAY,WAAW,SAAS,KAAK,EAAE,QAAQ,WAAW;EACtF,CAAC;EACD,OAAO;CACT;AACF,CAAC;;AAGD,MAAa,YAAY,OAAO;AAOP,OAAO;AAKhC,MAAM,qBAAqB,MAAuB;CAChD,IAAI,MAAM,MACR,OAAO;CAET,IAAI,MAAM,QAAQ,CAAC,GACjB,OAAO;CAET,OAAO,OAAO;AAChB"}
@@ -0,0 +1,145 @@
1
+ import { a as isJsonMode, r as emitSuccess, s as BaerlyError } from "./baerly.js";
2
+ import { c as readCurrentJson } from "./current-json-CC6lE4Aj.js";
3
+ import { n as loadSnapshotAsMap } from "./snapshot-CknzkDM0.js";
4
+ import { n as parseBucketUri } from "./config-DEzInG6M.js";
5
+ import { a as illFormedNames, i as LEGACY_NAME_MIGRATION, n as LEGACY_ILL_FORMED_ID_MIGRATION, o as legacyIdReport, r as LEGACY_ILL_FORMED_NAME_MIGRATION, s as nonNfcNames } from "./legacy-names-DgZBtgOh.js";
6
+ import { a as TENANT_ARG, c as defineBaerlySubcommand, i as JSON_ARG, n as BUCKET_ARG, o as assertCollectionArg, r as COLLECTION_ARG, t as APP_ARG } from "./subcommand-BLoF66dG.js";
7
+ // src/admin/fsck.ts
8
+ const FSCK_ARGS = {
9
+ bucket: BUCKET_ARG,
10
+ app: APP_ARG,
11
+ tenant: TENANT_ARG,
12
+ collection: COLLECTION_ARG,
13
+ json: JSON_ARG
14
+ };
15
+ /** Severities that count toward the exit-4 "findings present" status. */
16
+ const isFindingSeverity = (s) => s === "finding" || s === "warning";
17
+ const listKeys = async (storage, prefix) => {
18
+ const out = [];
19
+ for await (const entry of storage.list(prefix)) out.push(entry.key);
20
+ return out.toSorted();
21
+ };
22
+ const statusLine = (label, ok, detail) => ` ${label.padEnd(22)}${ok ? "ok" : "error"} ${detail}`.trimEnd();
23
+ const renderSnapshotLog = (collection, findings, context) => {
24
+ const lines = [];
25
+ lines.push(`baerly admin fsck ${collection}`);
26
+ const [from, toExcl] = context.logRange;
27
+ const byCheck = /* @__PURE__ */ new Map();
28
+ for (const f of findings) {
29
+ const arr = byCheck.get(f.check) ?? [];
30
+ arr.push(f);
31
+ byCheck.set(f.check, arr);
32
+ }
33
+ lines.push(statusLine("current.json:", (byCheck.get("current.json") ?? []).length === 0, ""));
34
+ lines.push(statusLine("snapshot hash:", (byCheck.get("snapshot") ?? []).length === 0, context.snapshotKey === null ? "(no snapshot yet)" : `(sha256 verified)`));
35
+ lines.push(statusLine(`log range [${from},${toExcl}):`, (byCheck.get("log") ?? []).length === 0, `(${context.logEntriesPresent}/${toExcl - from} entries present)`));
36
+ lines.push(` status: ${findings.some(isFindingFinding) ? "findings" : "ok"}`);
37
+ for (const f of findings) lines.push(` ${f.check}: ${f.message}${f.key !== void 0 ? ` (key=${f.key})` : ""}`);
38
+ return lines.join("\n") + "\n";
39
+ };
40
+ const isFindingFinding = (f) => isFindingSeverity(f.severity);
41
+ const bundle = defineBaerlySubcommand({
42
+ name: "admin.fsck",
43
+ meta: { description: "Read-only consistency walk for one collection." },
44
+ args: FSCK_ARGS,
45
+ handler: async (args, ctx) => {
46
+ const { app, tenant } = await ctx.resolveAppTenant({
47
+ app: args.app,
48
+ tenant: args.tenant
49
+ });
50
+ assertCollectionArg(args.collection, "baerly admin fsck");
51
+ const names = {
52
+ app,
53
+ tenant,
54
+ collection: args.collection
55
+ };
56
+ const bucket = await parseBucketUri(args.bucket);
57
+ const collectionPrefix = `${bucket.keyPrefix}app/${app}/tenant/${tenant}/manifests/${args.collection}`;
58
+ const currentJsonKey = `${collectionPrefix}/current.json`;
59
+ const findings = [...nonNfcNames(names).map((role) => ({
60
+ severity: "warning",
61
+ check: "names",
62
+ message: `${role} name ${JSON.stringify(names[role])} is not NFC: ${LEGACY_NAME_MIGRATION}`
63
+ })), ...illFormedNames(names).map((role) => ({
64
+ severity: "warning",
65
+ check: "names",
66
+ message: `${role} name ${JSON.stringify(names[role])} has an unpaired UTF-16 surrogate: ${LEGACY_ILL_FORMED_NAME_MIGRATION}`
67
+ }))];
68
+ const read = await readCurrentJson(bucket.storage, currentJsonKey);
69
+ if (read === null) throw new BaerlyError("InvalidConfig", `baerly admin fsck: current.json not found at ${currentJsonKey}`);
70
+ const cur = read.json;
71
+ const logFrom = cur.log_seq_start ?? 0;
72
+ const snapshotKey = cur.snapshot;
73
+ if (snapshotKey !== null) try {
74
+ const docs = await loadSnapshotAsMap(bucket.storage, snapshotKey, args.collection);
75
+ const { ill_formed_ids: illFormedIds } = legacyIdReport(docs.keys());
76
+ if (illFormedIds.length > 0) findings.push({
77
+ severity: "warning",
78
+ check: "ids",
79
+ message: `${illFormedIds.length} snapshot _id(s) with an unpaired UTF-16 surrogate ${JSON.stringify(illFormedIds)}: ${LEGACY_ILL_FORMED_ID_MIGRATION}`,
80
+ key: snapshotKey
81
+ });
82
+ } catch (error) {
83
+ if (error instanceof BaerlyError && (error.code === "Internal" || error.code === "InvalidResponse")) findings.push({
84
+ severity: "finding",
85
+ check: "snapshot",
86
+ message: error.message,
87
+ key: snapshotKey
88
+ });
89
+ else throw error;
90
+ }
91
+ const logPrefix = `${collectionPrefix}/log/`;
92
+ const presentKeys = await listKeys(bucket.storage, logPrefix);
93
+ const presentSeqs = /* @__PURE__ */ new Set();
94
+ let maxSeq = logFrom - 1;
95
+ for (const key of presentKeys) {
96
+ const tail = key.slice(logPrefix.length);
97
+ const match = /^(\d+)\.json$/.exec(tail);
98
+ if (match === null) continue;
99
+ const seq = Number.parseInt(match[1], 10);
100
+ if (Number.isFinite(seq)) {
101
+ presentSeqs.add(seq);
102
+ if (seq > maxSeq) maxSeq = seq;
103
+ }
104
+ }
105
+ const logToExcl = Math.max(cur.tail_hint, maxSeq + 1);
106
+ let logEntriesPresent = 0;
107
+ for (let s = logFrom; s < logToExcl; s++) if (presentSeqs.has(s)) logEntriesPresent++;
108
+ else findings.push({
109
+ severity: "finding",
110
+ check: "log",
111
+ message: `missing log entry at seq ${s} inside [log_seq_start, tail)`,
112
+ key: `${logPrefix}${s}.json`
113
+ });
114
+ if (isJsonMode()) emitSuccess({
115
+ command: "admin.fsck",
116
+ status: findings.some(isFindingFinding) ? "findings" : "ok",
117
+ collection: args.collection,
118
+ current_json_key: currentJsonKey,
119
+ snapshot: snapshotKey,
120
+ log_range: {
121
+ from: logFrom,
122
+ to_excl: logToExcl,
123
+ present: logEntriesPresent
124
+ },
125
+ findings: findings.map((f) => ({
126
+ severity: f.severity,
127
+ check: f.check,
128
+ message: f.message,
129
+ ...f.key !== void 0 && { key: f.key }
130
+ }))
131
+ });
132
+ else process.stdout.write(renderSnapshotLog(args.collection, findings, {
133
+ logRange: [logFrom, logToExcl],
134
+ logEntriesPresent,
135
+ snapshotKey
136
+ }));
137
+ return findings.some(isFindingFinding) ? 4 : 0;
138
+ }
139
+ });
140
+ /** citty `defineCommand` block for `baerly admin fsck`. */
141
+ const fsckCmd = bundle.cmd;
142
+ bundle.run;
143
+ export { fsckCmd };
144
+
145
+ //# sourceMappingURL=fsck-BWkPgov4.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"fsck-BWkPgov4.js","names":[],"sources":["../packages/cli/src/admin/fsck.ts"],"sourcesContent":["/**\n * `baerly admin fsck` — consistency walk for one collection.\n *\n * Read-only checks against the snapshot + log tail.\n * 1. `current.json` exists at the expected key and parses.\n * 2. When `current.snapshot !== null`, the snapshot body's\n * SHA-256 matches the hash embedded in the filename\n * (delegated to `loadSnapshotAsMap`).\n * 3. The live log range has no holes. The upper bound is derived\n * from a single LIST of `log/` plus `current.json.tail_hint`\n * (max(highest present seq + 1, tail_hint)), and every seq from\n * `log_seq_start` up to that tail must be present.\n * This is a presence/hole check by key, NOT a per-entry decode:\n * fsck does not GET and parse each `log/<seq>.json`, so it does\n * not assert every entry is well-formed JSON or carries the locked\n * `op`/`collection`/`doc_id` fields. A full decode walk is\n * intentionally omitted to keep the op count O(LIST pages); the\n * read path validates entry shape at fold time.\n * 4. Migration preflight: the app, tenant, and collection names are\n * NFC and hold no unpaired UTF-16 surrogate, and no `_id` in the\n * snapshot holds one. `_id`s committed since the last fold live\n * only in the log, which fsck does not decode; `admin dump --json`\n * reports every live `_id`.\n *\n * fsck never reads or writes the legacy `index/` prefix: writers before\n * 0.7 left index markers there, but no read consults them, so they cannot\n * drift into a wrong answer. It also has no repair mode.\n *\n * Exit codes:\n * 0 — all checks pass.\n * 1 — InvalidConfig (bad bucket URI, missing args, unknown flag).\n * 2 — Storage / Network error during the walk.\n * 3 — Protocol invariant violation surfaced by the kernel\n * (Internal / InvalidResponse) — distinguished from exit 4\n * so CI can wire fsck as a regression gate.\n * 4 — One or more findings (orphan / hole / hash-mismatch /\n * a non-NFC or ill-formed app, tenant, or collection name / an\n * ill-formed snapshot `_id`). Unique to this command; the other\n * `baerly admin` subcommands reserve 0–3.\n */\n\nimport { type ArgsDef } from \"citty\";\nimport { BaerlyError, readCurrentJson, type Storage } from \"@baerly/protocol\";\nimport { loadSnapshotAsMap } from \"@baerly/server/_internal/kernel\";\nimport { parseBucketUri } from \"../bucket-uri.ts\";\nimport {\n illFormedNames,\n LEGACY_ILL_FORMED_ID_MIGRATION,\n LEGACY_ILL_FORMED_NAME_MIGRATION,\n LEGACY_NAME_MIGRATION,\n legacyIdReport,\n nonNfcNames,\n} from \"../legacy-names.ts\";\nimport { emitSuccess, isJsonMode } from \"../output.ts\";\nimport {\n APP_ARG,\n assertCollectionArg,\n BUCKET_ARG,\n COLLECTION_ARG,\n defineBaerlySubcommand,\n JSON_ARG,\n TENANT_ARG,\n} from \"../subcommand.ts\";\n\nconst FSCK_ARGS = {\n bucket: BUCKET_ARG,\n app: APP_ARG,\n tenant: TENANT_ARG,\n collection: COLLECTION_ARG,\n json: JSON_ARG,\n} as const satisfies ArgsDef;\n\ntype Severity = \"ok\" | \"info\" | \"warning\" | \"finding\";\ninterface Finding {\n readonly severity: Severity;\n readonly check: string;\n readonly message: string;\n readonly key?: string;\n}\n\n/** Severities that count toward the exit-4 \"findings present\" status. */\nconst isFindingSeverity = (s: Severity): boolean => s === \"finding\" || s === \"warning\";\n\nconst listKeys = async (storage: Storage, prefix: string): Promise<string[]> => {\n const out: string[] = [];\n for await (const entry of storage.list(prefix)) {\n out.push(entry.key);\n }\n return out.toSorted();\n};\n\nconst statusLine = (label: string, ok: boolean, detail: string): string =>\n ` ${label.padEnd(22)}${ok ? \"ok\" : \"error\"} ${detail}`.trimEnd();\n\nconst renderSnapshotLog = (\n collection: string,\n findings: readonly Finding[],\n context: {\n readonly logRange: readonly [number, number];\n readonly logEntriesPresent: number;\n readonly snapshotKey: string | null;\n },\n): string => {\n const lines: string[] = [];\n lines.push(`baerly admin fsck ${collection}`);\n const [from, toExcl] = context.logRange;\n const byCheck = new Map<string, Finding[]>();\n for (const f of findings) {\n const arr = byCheck.get(f.check) ?? [];\n arr.push(f);\n byCheck.set(f.check, arr);\n }\n lines.push(statusLine(\"current.json:\", (byCheck.get(\"current.json\") ?? []).length === 0, \"\"));\n lines.push(\n statusLine(\n \"snapshot hash:\",\n (byCheck.get(\"snapshot\") ?? []).length === 0,\n context.snapshotKey === null ? \"(no snapshot yet)\" : `(sha256 verified)`,\n ),\n );\n lines.push(\n statusLine(\n `log range [${from},${toExcl}):`,\n (byCheck.get(\"log\") ?? []).length === 0,\n `(${context.logEntriesPresent}/${toExcl - from} entries present)`,\n ),\n );\n lines.push(` status: ${findings.some(isFindingFinding) ? \"findings\" : \"ok\"}`);\n for (const f of findings) {\n lines.push(` ${f.check}: ${f.message}${f.key !== undefined ? ` (key=${f.key})` : \"\"}`);\n }\n return lines.join(\"\\n\") + \"\\n\";\n};\n\nconst isFindingFinding = (f: Finding): boolean => isFindingSeverity(f.severity);\n\nconst bundle = defineBaerlySubcommand({\n name: \"admin.fsck\",\n meta: {\n description: \"Read-only consistency walk for one collection.\",\n },\n args: FSCK_ARGS,\n handler: async (args, ctx) => {\n const { app, tenant } = await ctx.resolveAppTenant({ app: args.app, tenant: args.tenant });\n assertCollectionArg(args.collection, \"baerly admin fsck\");\n const names = { app, tenant, collection: args.collection };\n const bucket = await parseBucketUri(args.bucket);\n const collectionPrefix = `${bucket.keyPrefix}app/${app}/tenant/${tenant}/manifests/${args.collection}`;\n const currentJsonKey = `${collectionPrefix}/current.json`;\n\n // Migration preflight: a legacy non-NFC or ill-formed name is\n // readable here but refused by the SDK and by every writing verb.\n const findings: Finding[] = [\n ...nonNfcNames(names).map((role) => ({\n severity: \"warning\" as const,\n check: \"names\",\n message: `${role} name ${JSON.stringify(names[role])} is not NFC: ${LEGACY_NAME_MIGRATION}`,\n })),\n ...illFormedNames(names).map((role) => ({\n severity: \"warning\" as const,\n check: \"names\",\n message: `${role} name ${JSON.stringify(names[role])} has an unpaired UTF-16 surrogate: ${LEGACY_ILL_FORMED_NAME_MIGRATION}`,\n })),\n ];\n\n // ── current.json + snapshot + log walks. ───────────────────────\n const read = await readCurrentJson(bucket.storage, currentJsonKey);\n if (read === null) {\n throw new BaerlyError(\n \"InvalidConfig\",\n `baerly admin fsck: current.json not found at ${currentJsonKey}`,\n );\n }\n const cur = read.json;\n const logFrom = cur.log_seq_start ?? 0;\n const snapshotKey = cur.snapshot;\n\n // ── Snapshot hash verifies (loadSnapshotAsMap throws on mismatch). ──\n if (snapshotKey !== null) {\n try {\n const docs = await loadSnapshotAsMap(bucket.storage, snapshotKey, args.collection);\n // Preflight over the rows fsck already holds; tail `_id`s need\n // a log decode, which `admin dump` does.\n const { ill_formed_ids: illFormedIds } = legacyIdReport(docs.keys());\n if (illFormedIds.length > 0) {\n findings.push({\n severity: \"warning\",\n check: \"ids\",\n message: `${illFormedIds.length} snapshot _id(s) with an unpaired UTF-16 surrogate ${JSON.stringify(illFormedIds)}: ${LEGACY_ILL_FORMED_ID_MIGRATION}`,\n key: snapshotKey,\n });\n }\n } catch (error) {\n if (\n error instanceof BaerlyError &&\n (error.code === \"Internal\" || error.code === \"InvalidResponse\")\n ) {\n findings.push({\n severity: \"finding\",\n check: \"snapshot\",\n message: error.message,\n key: snapshotKey,\n });\n } else {\n throw error;\n }\n }\n }\n\n // ── Log range [from, tail) has no holes (presence check only). ──\n // LIST the log/ prefix and derive the upper bound from both listed\n // keys and `tail_hint`: under single-write commit `tail_hint` is\n // normally a lower bound, but fsck must also catch an over-claimed\n // hint whose `[log_seq_start, tail_hint)` range is not actually\n // present. Use a single LIST so the op count is O(pages).\n const logPrefix = `${collectionPrefix}/log/`;\n const presentKeys = await listKeys(bucket.storage, logPrefix);\n const presentSeqs = new Set<number>();\n let maxSeq = logFrom - 1;\n for (const key of presentKeys) {\n const tail = key.slice(logPrefix.length);\n const match = /^(\\d+)\\.json$/.exec(tail);\n if (match === null) {\n continue;\n }\n const seq = Number.parseInt(match[1]!, 10);\n if (Number.isFinite(seq)) {\n presentSeqs.add(seq);\n if (seq > maxSeq) {\n maxSeq = seq;\n }\n }\n }\n const logToExcl = Math.max(cur.tail_hint, maxSeq + 1);\n let logEntriesPresent = 0;\n for (let s = logFrom; s < logToExcl; s++) {\n if (presentSeqs.has(s)) {\n logEntriesPresent++;\n } else {\n findings.push({\n severity: \"finding\",\n check: \"log\",\n message: `missing log entry at seq ${s} inside [log_seq_start, tail)`,\n key: `${logPrefix}${s}.json`,\n });\n }\n }\n\n if (isJsonMode()) {\n emitSuccess({\n command: \"admin.fsck\",\n status: findings.some(isFindingFinding) ? \"findings\" : \"ok\",\n collection: args.collection,\n current_json_key: currentJsonKey,\n snapshot: snapshotKey,\n log_range: { from: logFrom, to_excl: logToExcl, present: logEntriesPresent },\n findings: findings.map((f) => ({\n severity: f.severity,\n check: f.check,\n message: f.message,\n ...(f.key !== undefined && { key: f.key }),\n })),\n });\n } else {\n process.stdout.write(\n renderSnapshotLog(args.collection, findings, {\n logRange: [logFrom, logToExcl],\n logEntriesPresent,\n snapshotKey,\n }),\n );\n }\n return findings.some(isFindingFinding) ? 4 : 0;\n },\n});\n\n/** citty `defineCommand` block for `baerly admin fsck`. */\nexport const fsckCmd = bundle.cmd;\n\n/**\n * Programmatic entry used by tests. Bypasses citty's `run` wrapper\n * (which would call `process.exit` and kill vitest) and returns the\n * integer exit code directly.\n */\nexport const runFsck = bundle.run;\n"],"mappings":";;;;;;;AAgEA,MAAM,YAAY;CAChB,QAAQ;CACR,KAAK;CACL,QAAQ;CACR,YAAY;CACZ,MAAM;AACR;;AAWA,MAAM,qBAAqB,MAAyB,MAAM,aAAa,MAAM;AAE7E,MAAM,WAAW,OAAO,SAAkB,WAAsC;CAC9E,MAAM,MAAgB,CAAC;CACvB,WAAW,MAAM,SAAS,QAAQ,KAAK,MAAM,GAC3C,IAAI,KAAK,MAAM,GAAG;CAEpB,OAAO,IAAI,SAAS;AACtB;AAEA,MAAM,cAAc,OAAe,IAAa,WAC9C,KAAK,MAAM,OAAO,EAAE,IAAI,KAAK,OAAO,QAAQ,GAAG,SAAS,QAAQ;AAElE,MAAM,qBACJ,YACA,UACA,YAKW;CACX,MAAM,QAAkB,CAAC;CACzB,MAAM,KAAK,qBAAqB,YAAY;CAC5C,MAAM,CAAC,MAAM,UAAU,QAAQ;CAC/B,MAAM,0BAAU,IAAI,IAAuB;CAC3C,KAAK,MAAM,KAAK,UAAU;EACxB,MAAM,MAAM,QAAQ,IAAI,EAAE,KAAK,KAAK,CAAC;EACrC,IAAI,KAAK,CAAC;EACV,QAAQ,IAAI,EAAE,OAAO,GAAG;CAC1B;CACA,MAAM,KAAK,WAAW,kBAAkB,QAAQ,IAAI,cAAc,KAAK,CAAC,EAAA,CAAG,WAAW,GAAG,EAAE,CAAC;CAC5F,MAAM,KACJ,WACE,mBACC,QAAQ,IAAI,UAAU,KAAK,CAAC,EAAA,CAAG,WAAW,GAC3C,QAAQ,gBAAgB,OAAO,sBAAsB,mBACvD,CACF;CACA,MAAM,KACJ,WACE,cAAc,KAAK,GAAG,OAAO,MAC5B,QAAQ,IAAI,KAAK,KAAK,CAAC,EAAA,CAAG,WAAW,GACtC,IAAI,QAAQ,kBAAkB,GAAG,SAAS,KAAK,kBACjD,CACF;CACA,MAAM,KAAK,2BAA2B,SAAS,KAAK,gBAAgB,IAAI,aAAa,MAAM;CAC3F,KAAK,MAAM,KAAK,UACd,MAAM,KAAK,KAAK,EAAE,MAAM,IAAI,EAAE,UAAU,EAAE,QAAQ,KAAA,IAAY,SAAS,EAAE,IAAI,KAAK,IAAI;CAExF,OAAO,MAAM,KAAK,IAAI,IAAI;AAC5B;AAEA,MAAM,oBAAoB,MAAwB,kBAAkB,EAAE,QAAQ;AAE9E,MAAM,SAAS,uBAAuB;CACpC,MAAM;CACN,MAAM,EACJ,aAAa,iDACf;CACA,MAAM;CACN,SAAS,OAAO,MAAM,QAAQ;EAC5B,MAAM,EAAE,KAAK,WAAW,MAAM,IAAI,iBAAiB;GAAE,KAAK,KAAK;GAAK,QAAQ,KAAK;EAAO,CAAC;EACzF,oBAAoB,KAAK,YAAY,mBAAmB;EACxD,MAAM,QAAQ;GAAE;GAAK;GAAQ,YAAY,KAAK;EAAW;EACzD,MAAM,SAAS,MAAM,eAAe,KAAK,MAAM;EAC/C,MAAM,mBAAmB,GAAG,OAAO,UAAU,MAAM,IAAI,UAAU,OAAO,aAAa,KAAK;EAC1F,MAAM,iBAAiB,GAAG,iBAAiB;EAI3C,MAAM,WAAsB,CAC1B,GAAG,YAAY,KAAK,CAAC,CAAC,KAAK,UAAU;GACnC,UAAU;GACV,OAAO;GACP,SAAS,GAAG,KAAK,QAAQ,KAAK,UAAU,MAAM,KAAK,EAAE,eAAe;EACtE,EAAE,GACF,GAAG,eAAe,KAAK,CAAC,CAAC,KAAK,UAAU;GACtC,UAAU;GACV,OAAO;GACP,SAAS,GAAG,KAAK,QAAQ,KAAK,UAAU,MAAM,KAAK,EAAE,qCAAqC;EAC5F,EAAE,CACJ;EAGA,MAAM,OAAO,MAAM,gBAAgB,OAAO,SAAS,cAAc;EACjE,IAAI,SAAS,MACX,MAAM,IAAI,YACR,iBACA,gDAAgD,gBAClD;EAEF,MAAM,MAAM,KAAK;EACjB,MAAM,UAAU,IAAI,iBAAiB;EACrC,MAAM,cAAc,IAAI;EAGxB,IAAI,gBAAgB,MAClB,IAAI;GACF,MAAM,OAAO,MAAM,kBAAkB,OAAO,SAAS,aAAa,KAAK,UAAU;GAGjF,MAAM,EAAE,gBAAgB,iBAAiB,eAAe,KAAK,KAAK,CAAC;GACnE,IAAI,aAAa,SAAS,GACxB,SAAS,KAAK;IACZ,UAAU;IACV,OAAO;IACP,SAAS,GAAG,aAAa,OAAO,qDAAqD,KAAK,UAAU,YAAY,EAAE,IAAI;IACtH,KAAK;GACP,CAAC;EAEL,SAAS,OAAO;GACd,IACE,iBAAiB,gBAChB,MAAM,SAAS,cAAc,MAAM,SAAS,oBAE7C,SAAS,KAAK;IACZ,UAAU;IACV,OAAO;IACP,SAAS,MAAM;IACf,KAAK;GACP,CAAC;QAED,MAAM;EAEV;EASF,MAAM,YAAY,GAAG,iBAAiB;EACtC,MAAM,cAAc,MAAM,SAAS,OAAO,SAAS,SAAS;EAC5D,MAAM,8BAAc,IAAI,IAAY;EACpC,IAAI,SAAS,UAAU;EACvB,KAAK,MAAM,OAAO,aAAa;GAC7B,MAAM,OAAO,IAAI,MAAM,UAAU,MAAM;GACvC,MAAM,QAAQ,gBAAgB,KAAK,IAAI;GACvC,IAAI,UAAU,MACZ;GAEF,MAAM,MAAM,OAAO,SAAS,MAAM,IAAK,EAAE;GACzC,IAAI,OAAO,SAAS,GAAG,GAAG;IACxB,YAAY,IAAI,GAAG;IACnB,IAAI,MAAM,QACR,SAAS;GAEb;EACF;EACA,MAAM,YAAY,KAAK,IAAI,IAAI,WAAW,SAAS,CAAC;EACpD,IAAI,oBAAoB;EACxB,KAAK,IAAI,IAAI,SAAS,IAAI,WAAW,KACnC,IAAI,YAAY,IAAI,CAAC,GACnB;OAEA,SAAS,KAAK;GACZ,UAAU;GACV,OAAO;GACP,SAAS,4BAA4B,EAAE;GACvC,KAAK,GAAG,YAAY,EAAE;EACxB,CAAC;EAIL,IAAI,WAAW,GACb,YAAY;GACV,SAAS;GACT,QAAQ,SAAS,KAAK,gBAAgB,IAAI,aAAa;GACvD,YAAY,KAAK;GACjB,kBAAkB;GAClB,UAAU;GACV,WAAW;IAAE,MAAM;IAAS,SAAS;IAAW,SAAS;GAAkB;GAC3E,UAAU,SAAS,KAAK,OAAO;IAC7B,UAAU,EAAE;IACZ,OAAO,EAAE;IACT,SAAS,EAAE;IACX,GAAI,EAAE,QAAQ,KAAA,KAAa,EAAE,KAAK,EAAE,IAAI;GAC1C,EAAE;EACJ,CAAC;OAED,QAAQ,OAAO,MACb,kBAAkB,KAAK,YAAY,UAAU;GAC3C,UAAU,CAAC,SAAS,SAAS;GAC7B;GACA;EACF,CAAC,CACH;EAEF,OAAO,SAAS,KAAK,gBAAgB,IAAI,IAAI;CAC/C;AACF,CAAC;;AAGD,MAAa,UAAU,OAAO;AAOP,OAAO"}
@@ -0,0 +1,127 @@
1
+ import { a as StoragePutOptions, i as StorageListEntry, n as StorageGetOptions, o as StoragePutResult, r as StorageGetResult, t as Storage } from "./types-suVbsEWS.js";
2
+ /** Default GCS native XML API endpoint. */
3
+ declare const DEFAULT_GCS_ENDPOINT = "https://storage.googleapis.com";
4
+ /**
5
+ * Construction-time options for {@link GcsHttpStorage}. Everything is
6
+ * optional except `bucket`; `endpoint` defaults to the GCS native XML
7
+ * API host. `sign` is injected — `gcsStorage` wires in the
8
+ * GOOG4-HMAC-SHA256 signer ({@link goog4Signer}); unit tests pass a
9
+ * passthrough.
10
+ */
11
+ interface GcsHttpStorageOptions {
12
+ /** GCS endpoint. Defaults to `https://storage.googleapis.com`. */
13
+ endpoint?: string;
14
+ /** GCS bucket name. */
15
+ bucket: string;
16
+ /** `fetch` implementation. Defaults to `globalThis.fetch.bind(globalThis)`. */
17
+ fetch?: typeof fetch;
18
+ /** Signs requests before send. GOOG4-HMAC-SHA256 in production. */
19
+ sign?: (req: Request) => Promise<Request>;
20
+ /**
21
+ * Retries after the first attempt, for throttled and transient failures
22
+ * alike (and per `list` page). Default `STORAGE_RETRY_MAX_ATTEMPTS - 1`
23
+ * (2, so 3 attempts in total); `0` sends each request once. Must be a
24
+ * non-negative integer; any other value makes each request reject with
25
+ * `InvalidConfig` before it is sent.
26
+ */
27
+ retries?: number;
28
+ /**
29
+ * Backoff base in ms, overriding both default bases (50 ms after a
30
+ * transient failure, 1 s after a throttle). Full jitter applies either
31
+ * way. Omit for the default policy.
32
+ */
33
+ backoffMs?: number;
34
+ }
35
+ /**
36
+ * `Storage` impl that speaks the GCS native XML API and drives GCS's own
37
+ * `x-goog-if-generation-match` conditional writes. Unlike GCS's S3-interop
38
+ * endpoint (which treats `If-Match`/`If-None-Match` as read-scoped and can
39
+ * never linearize the log), the native API returns 412 on any precondition
40
+ * miss and the object `generation` in `x-goog-generation`. That generation
41
+ * is carried verbatim in the opaque `Storage` etag.
42
+ *
43
+ * Authentication is plugged in via `sign` (GOOG4-HMAC-SHA256); this class
44
+ * does no signing itself.
45
+ */
46
+ declare class GcsHttpStorage implements Storage {
47
+ #private;
48
+ constructor(options: GcsHttpStorageOptions);
49
+ get(key: string, opts?: StorageGetOptions): Promise<StorageGetResult | null>;
50
+ put(key: string, body: Uint8Array, opts?: StoragePutOptions): Promise<StoragePutResult>;
51
+ delete(key: string, opts?: {
52
+ signal?: AbortSignal;
53
+ }): Promise<void>;
54
+ list(prefix: string, opts?: {
55
+ startAfter?: string;
56
+ maxKeys?: number;
57
+ signal?: AbortSignal;
58
+ }): AsyncIterable<StorageListEntry>;
59
+ }
60
+ /**
61
+ * Temporary or static AWS-shaped credentials. Field shape matches
62
+ * `@smithy/types`' `AwsCredentialIdentity` so callers can pass
63
+ * `@aws-sdk/credential-providers` output directly (e.g.
64
+ * `fromTokenFile()`) without an adapter.
65
+ *
66
+ * `expiration` is the absolute time at which `accessKeyId` /
67
+ * `secretAccessKey` / `sessionToken` stop being valid. When present,
68
+ * the signing layer re-resolves credentials some buffer before that
69
+ * time. When absent, credentials are treated as static.
70
+ */
71
+ type Credentials = {
72
+ readonly accessKeyId: string;
73
+ readonly secretAccessKey: string;
74
+ readonly sessionToken?: string;
75
+ readonly expiration?: Date;
76
+ };
77
+ /**
78
+ * Async credential resolver. Called by the signing layer on demand —
79
+ * once on first sign, then again when cached `expiration` is within
80
+ * the refresh buffer. Closure is the natural place to keep retry /
81
+ * fallback / fan-out logic; the signing layer only cares about the
82
+ * resolved shape.
83
+ *
84
+ * **Refresh is driven by `Credentials.expiration`.** If your provider
85
+ * returns no `expiration`, the signer will call this function
86
+ * **exactly once** for the lifetime of the storage handle and reuse
87
+ * those credentials forever. That's the right default for genuinely
88
+ * static creds (e.g. `process.env`), but it's a footgun if you're
89
+ * resolving rotating credentials and forgot to set `expiration` —
90
+ * the first 1 h works, then every request 403s with no retry. Set
91
+ * `expiration` on every refresh-eligible resolve.
92
+ *
93
+ * Implementations should be safe to call concurrently — the signing
94
+ * layer single-flights refresh, but tests and chained providers may
95
+ * call this in parallel.
96
+ */
97
+ type CredentialsProvider = () => Promise<Credentials>;
98
+ /**
99
+ * Result of {@link gcsVersioningStatus}. `inconclusive` carries a
100
+ * human-readable `reason` (an `HTTP <status>` string, or a thrown
101
+ * error's message) so a diagnostic caller can explain why the probe
102
+ * couldn't decide without re-deriving it.
103
+ */
104
+ type GcsVersioningStatus = {
105
+ readonly kind: "enabled";
106
+ } | {
107
+ readonly kind: "disabled";
108
+ } | {
109
+ readonly kind: "inconclusive";
110
+ readonly reason: string;
111
+ };
112
+ /**
113
+ * Read a GCS bucket's Object Versioning setting over the native XML API
114
+ * (`GET <endpoint>/<bucket>?versioning`), signed with GOOG4-HMAC-SHA256.
115
+ * Never throws — a non-2xx response or a network error resolves to
116
+ * `{ kind: "inconclusive", reason }`, so callers (e.g. `baerly doctor`)
117
+ * can degrade gracefully instead of aborting.
118
+ */
119
+ declare function gcsVersioningStatus(opts: {
120
+ bucket: string;
121
+ credentials: Credentials | CredentialsProvider;
122
+ /** Defaults to the native GCS host. */
123
+ endpoint?: string;
124
+ /** Injected in tests; defaults to global fetch. */
125
+ fetch?: typeof fetch;
126
+ }): Promise<GcsVersioningStatus>;
127
+ export { DEFAULT_GCS_ENDPOINT as a, CredentialsProvider as i, gcsVersioningStatus as n, GcsHttpStorage as o, Credentials as r, GcsHttpStorageOptions as s, GcsVersioningStatus as t };
package/dist/gcs.d.ts ADDED
@@ -0,0 +1,30 @@
1
+ /**
2
+ * Curated GCS-over-HTTP storage entry (`@gusto/baerly-storage/gcs`).
3
+ *
4
+ * The GCS family barrel: `GcsHttpStorage` + its GOOG4-HMAC-SHA256
5
+ * signer, mirroring how `@gusto/baerly-storage/s3` pairs
6
+ * `S3HttpStorage` with `sigV4Signer`. Import from here rather than the
7
+ * broad `/node` barrel (which drags `node:http`) when you only need
8
+ * the GCS `Storage` impl and its signer.
9
+ *
10
+ * Node-only in v1. GCS's native XML API + generation-based conditional
11
+ * writes are the supported path only under Node; unlike `/s3`, this
12
+ * subpath is NOT declared a Worker target and is not covered by the
13
+ * `s3-worker-safe` bundling probe. (Its closure happens to carry no
14
+ * `node:` builtins — it pulls only `@rgrove/parse-xml` + WebCrypto —
15
+ * but Worker portability is unclaimed and unverified for v1.)
16
+ */
17
+ import { a as DEFAULT_GCS_ENDPOINT, i as CredentialsProvider, o as GcsHttpStorage, r as Credentials, s as GcsHttpStorageOptions, t as GcsVersioningStatus } from "./gcs-admin-Dso1HWQj.js";
18
+ /**
19
+ * Inputs for {@link goog4Signer}. Named for parity with
20
+ * `SigV4SignerOptions` so both signer families read the same on the
21
+ * curated `/s3` + `/gcs` subpaths.
22
+ */
23
+ interface Goog4SignerOptions {
24
+ /** GCS HMAC interoperability credentials (static) or an async resolver. */
25
+ credentials: Credentials | CredentialsProvider;
26
+ /** Clock seam for deterministic tests; defaults to `Date.now`. */
27
+ now?: () => number;
28
+ }
29
+ export declare function goog4Signer(opts: Goog4SignerOptions): (req: Request) => Promise<Request>;
30
+ export { DEFAULT_GCS_ENDPOINT, GcsHttpStorage, type GcsHttpStorageOptions, type GcsVersioningStatus, type Goog4SignerOptions };
package/dist/gcs.js ADDED
@@ -0,0 +1 @@
1
+ export { r as DEFAULT_GCS_ENDPOINT, i as GcsHttpStorage, t as goog4Signer } from "./goog4-signer-CeLIABoE.js";