@niscorp/tide 0.1.6 → 0.1.7

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/dist/postgres.cjs CHANGED
@@ -13,8 +13,7 @@ var PRIMARY_KEY = {
13
13
  state: "reflexId"
14
14
  };
15
15
  var UNIQUE_BY = {
16
- // `entity` is part of the key. Without it two polls over different tables
17
- // that happened to agree on a cursor value silently ate each other's rows.
16
+ // `entity` is in the key: two polls over different tables can agree on a cursor value.
18
17
  fact: { by: ["kind", "entity", "name", "dedupeKey"], when: "dedupeKey" },
19
18
  run: { by: ["reflexId", "cause"] },
20
19
  task: { by: ["runId", "unit"] },
@@ -66,19 +65,15 @@ zod.z.union([
66
65
  var FactKindSchema = zod.z.enum(["write", "signal", "manual", "run"]);
67
66
  zod.z.object({
68
67
  kind: FactKindSchema,
69
- // write facts
70
68
  entity: zod.z.string().optional().describe("Which table or entity was written."),
71
69
  op: OpSchema.optional().describe('Ops are distinct stimuli \u2014 "only on create" is op: "insert".'),
72
70
  row: zod.z.record(zod.z.string(), zod.z.unknown()).optional().describe("The row, as the write returned it."),
73
- // signal facts
74
71
  name: zod.z.string().optional().describe("Which named intake this arrived on."),
75
72
  payload: zod.z.unknown().optional().describe("The event body \u2014 validated at the HOST boundary before it gets here."),
76
- // run facts (minted by tide when a run settles — the fan-in mechanism)
77
73
  reflex: zod.z.string().optional(),
78
74
  runId: zod.z.string().optional(),
79
75
  occurrence: zod.z.string().optional().describe("The calendar key, when the clock was the cause."),
80
76
  stats: zod.z.object({ total: zod.z.number().int(), done: zod.z.number().int(), failed: zod.z.number().int() }).strict().optional(),
81
- // manual facts (minted by `fire`)
82
77
  target: zod.z.string().optional().describe("The one reflex a manual fact is aimed at."),
83
78
  by: zod.z.string().optional().describe("Who fired it \u2014 recorded on the firing as manual:<who>."),
84
79
  at: zod.z.number().int().describe("Supplied by the caller. Tide reads no clocks."),
@@ -542,7 +537,6 @@ var createTideStore = (pool, options = {}) => {
542
537
  );
543
538
  return result.rows.map((row) => rowToEntity(spec.table, row));
544
539
  },
545
- // The refusal is the database's, decided under the constraint, not a read the caller races.
546
540
  appendIfAbsent: async (table, input) => {
547
541
  await ready;
548
542
  const given = input;
@@ -1 +1 @@
1
- {"version":3,"sources":["../src/types.ts","../src/schemas/trigger.schema.ts","../src/schemas/fact.schema.ts","../src/store/postgres/rows.ts","../src/store/postgres/compile.ts","../src/store/postgres/claim.ts","../src/store/postgres/tables.ts","../src/store/postgres/store.ts"],"names":["z","require","migrateLedger"],"mappings":";;;;;;;;AAuWO,IAAM,WAAA,GAAkE;AAAA,EAC7E,IAAA,EAAM,IAAA;AAAA,EACN,GAAA,EAAK,IAAA;AAAA,EACL,IAAA,EAAM,IAAA;AAAA,EACN,KAAA,EAAO;AACT,CAAA;AAaO,IAAM,SAAA,GAAgD;AAAA;AAAA;AAAA,EAG3D,IAAA,EAAM,EAAE,EAAA,EAAI,CAAC,MAAA,EAAQ,UAAU,MAAA,EAAQ,WAAW,CAAA,EAAG,IAAA,EAAM,WAAA,EAAY;AAAA,EACvE,KAAK,EAAE,EAAA,EAAI,CAAC,UAAA,EAAY,OAAO,CAAA,EAAE;AAAA,EACjC,MAAM,EAAE,EAAA,EAAI,CAAC,OAAA,EAAS,MAAM,CAAA,EAAE;AAAA,EAC9B,KAAA,EAAO,EAAE,EAAA,EAAI,CAAC,UAAU,CAAA;AAC1B,CAAA;ACpXO,IAAM,QAAA,GAAW,CAAC,KAAA,EAAO,KAAA,EAAO,OAAO,KAAA,EAAO,KAAA,EAAO,OAAO,KAAK,CAAA;AAExE,IAAM,IAAA,GAAO,2BAAA;AACb,IAAM,IAAA,GAAO,yCAAA;AAEb,IAAM,cAAA,GAAiB,wDAAA;AAEhB,IAAM,eAAA,GAAkBA,MAAE,IAAA,CAAK,CAAC,OAAO,MAAA,EAAQ,OAAA,EAAS,MAAM,CAAC,CAAA;AAE/D,IAAM,oBAAA,GAAuBA,MACjC,MAAA,CAAO;AAAA,EACN,KAAA,EAAO,eAAA,CAAgB,QAAA,CAAS,6JAAwJ,CAAA;AAAA,EACxL,EAAA,EAAIA,KAAA,CACD,KAAA,CAAM,CAACA,KAAA,CAAE,MAAA,EAAO,CAAE,GAAA,EAAI,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,IAAI,EAAE,CAAA,EAAGA,KAAA,CAAE,IAAA,CAAK,QAAQ,CAAA,EAAGA,KAAA,CAAE,MAAA,EAAO,CAAE,KAAA,CAAM,IAAI,CAAC,CAAC,CAAA,CACjF,QAAA,EAAS,CACT,SAAS,yGAA0F,CAAA;AAAA,EACtG,EAAA,EAAIA,MAAE,MAAA,EAAO,CAAE,MAAM,IAAI,CAAA,CAAE,SAAS,iCAAiC,CAAA;AAAA,EACrE,EAAA,EAAIA,KAAA,CAAE,MAAA,EAAO,CAAE,SAAS,qBAAqB;AAC/C,CAAC,EACA,MAAA,EAAO,CACP,WAAA,CAAY,CAAC,OAAO,GAAA,KAAQ;AAC3B,EAAA,MAAM,IAAA,GAAO,CAAC,OAAA,KAAoB,GAAA,CAAI,QAAA,CAAS,EAAE,IAAA,EAAM,QAAA,EAAU,OAAA,EAAS,IAAA,EAAM,CAAC,IAAI,GAAG,CAAA;AACxF,EAAA,IAAI,MAAM,KAAA,KAAU,KAAA,IAAS,MAAM,EAAA,KAAO,MAAA,OAAgB,6BAA6B,CAAA;AACvF,EAAA,IAAI,KAAA,CAAM,KAAA,KAAU,MAAA,IAAU,EAAE,OAAO,KAAA,CAAM,EAAA,KAAO,QAAA,IAAY,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,KAAM,MAAM,EAAE,CAAA,CAAA;AACjG,IAAA,IAAA,CAAK,mDAAmD,CAAA;AAC1D,EAAA,IAAI,KAAA,CAAM,UAAU,OAAA,IAAW,OAAO,MAAM,EAAA,KAAO,QAAA,OAAe,4CAA4C,CAAA;AAC9G,EAAA,IAAI,KAAA,CAAM,KAAA,KAAU,MAAA,IAAU,EAAE,OAAO,KAAA,CAAM,EAAA,KAAO,QAAA,IAAY,IAAA,CAAK,IAAA,CAAK,KAAA,CAAM,EAAE,CAAA,CAAA;AAChF,IAAA,IAAA,CAAK,sCAAsC,CAAA;AAC/C,CAAC,CAAA,CACA,SAAS,kGAAkG,CAAA;AAEvG,IAAM,eAAA,GAAkBA,MAC5B,MAAA,CAAO;AAAA,EACN,EAAA,EAAIA,MAAE,MAAA,EAAO,CAAE,MAAM,cAAc,CAAA,CAAE,SAAS,iGAAiG,CAAA;AAAA,EAC/I,EAAA,EAAIA,KAAA,CAAE,MAAA,EAAO,CAAE,SAAS,qBAAqB;AAC/C,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,qDAAqD,CAAA;AAE1D,IAAM,qBAAqBA,KAAA,CAC/B,MAAA,CAAO,EAAE,KAAA,EAAOA,MAAE,KAAA,CAAM,CAAC,oBAAA,EAAsB,eAAe,CAAC,CAAA,EAAG,EAClE,MAAA,EAAO,CACP,SAAS,iFAAiF,CAAA;AAEtF,IAAM,WAAWA,KAAA,CAAE,IAAA,CAAK,CAAC,QAAA,EAAU,QAAA,EAAU,QAAQ,CAAC,CAAA;AAEtD,IAAM,kBAAA,GAAqBA,MAC/B,MAAA,CAAO;AAAA,EACN,IAAA,EAAMA,MACH,MAAA,CAAO;AAAA,IACN,MAAA,EAAQA,KAAA,CAAE,MAAA,EAAO,CAAE,SAAS,oDAAoD,CAAA;AAAA,IAChF,EAAA,EAAI,QAAA,CAAS,QAAA,EAAS,CAAE,SAAS,2DAAsD;AAAA,GACxF,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,8EAAyE,CAAA;AAE9E,IAAM,mBAAA,GAAsBA,KAAA,CAChC,MAAA,CAAO,EAAE,IAAA,EAAMA,MAAE,MAAA,CAAO,EAAE,MAAA,EAAQA,KAAA,CAAE,MAAA,EAAO,CAAE,SAAS,0BAA0B,CAAA,EAAG,CAAA,CAAE,MAAA,EAAO,EAAG,CAAA,CAC/F,MAAA,EAAO,CACP,QAAA,CAAS,8DAA8D,CAAA;AAEnE,IAAM,gBAAA,GAAmBA,MAC7B,MAAA,CAAO;AAAA,EACN,IAAA,EAAMA,KAAA,CACH,MAAA,CAAO,EAAE,GAAA,EAAKA,KAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,iFAA6E,CAAA,EAAG,EAClH,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,kEAAkE,CAAA;AAUvE,IAAM,sBAAsBA,KAAA,CAChC,MAAA,CAAO,EAAE,MAAA,EAAQA,MAAE,MAAA,CAAO,EAAE,CAAA,CAAE,QAAO,EAAG,EACxC,MAAA,EAAO,CACP,SAAS,4CAA4C,CAAA;AAE3BA,MAAE,KAAA,CAAM;AAAA,EACnC,kBAAA;AAAA,EACA,kBAAA;AAAA,EACA,mBAAA;AAAA,EACA,gBAAA;AAAA,EACA;AACF,CAAC;AC3FM,IAAM,cAAA,GAAiBA,MAAE,IAAA,CAAK,CAAC,SAAS,QAAA,EAAU,QAAA,EAAU,KAAK,CAAC,CAAA;AAE1CA,MAC5B,MAAA,CAAO;AAAA,EACN,IAAA,EAAM,cAAA;AAAA;AAAA,EAGN,QAAQA,KAAAA,CAAE,MAAA,GAAS,QAAA,EAAS,CAAE,SAAS,oCAAoC,CAAA;AAAA,EAC3E,EAAA,EAAI,QAAA,CAAS,QAAA,EAAS,CAAE,SAAS,mEAA8D,CAAA;AAAA,EAC/F,GAAA,EAAKA,KAAAA,CAAE,MAAA,CAAOA,KAAAA,CAAE,MAAA,EAAO,EAAGA,KAAAA,CAAE,OAAA,EAAS,CAAA,CAAE,QAAA,EAAS,CAAE,SAAS,oCAAoC,CAAA;AAAA;AAAA,EAG/F,MAAMA,KAAAA,CAAE,MAAA,GAAS,QAAA,EAAS,CAAE,SAAS,qCAAqC,CAAA;AAAA,EAC1E,SAASA,KAAAA,CAAE,OAAA,GAAU,QAAA,EAAS,CAAE,SAAS,2EAAsE,CAAA;AAAA;AAAA,EAG/G,MAAA,EAAQA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC5B,KAAA,EAAOA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC3B,YAAYA,KAAAA,CAAE,MAAA,GAAS,QAAA,EAAS,CAAE,SAAS,iDAAiD,CAAA;AAAA,EAC5F,KAAA,EAAOA,KAAAA,CACJ,MAAA,CAAO,EAAE,KAAA,EAAOA,KAAAA,CAAE,MAAA,EAAO,CAAE,GAAA,EAAI,EAAG,IAAA,EAAMA,KAAAA,CAAE,MAAA,GAAS,GAAA,EAAI,EAAG,MAAA,EAAQA,KAAAA,CAAE,MAAA,EAAO,CAAE,GAAA,EAAI,EAAG,CAAA,CACpF,MAAA,EAAO,CACP,QAAA,EAAS;AAAA;AAAA,EAGZ,QAAQA,KAAAA,CAAE,MAAA,GAAS,QAAA,EAAS,CAAE,SAAS,2CAA2C,CAAA;AAAA,EAClF,IAAIA,KAAAA,CAAE,MAAA,GAAS,QAAA,EAAS,CAAE,SAAS,6DAAwD,CAAA;AAAA,EAE3F,IAAIA,KAAAA,CAAE,MAAA,GAAS,GAAA,EAAI,CAAE,SAAS,+CAA+C,CAAA;AAAA,EAC7E,SAAA,EAAWA,MAAE,MAAA,EAAO,CAAE,KAAI,CAAE,QAAA,EAAS,CAAE,QAAA,CAAS,8DAAyD,CAAA;AAAA,EACzG,WAAWA,KAAAA,CAAE,MAAA,GAAS,QAAA,EAAS,CAAE,SAAS,4FAA4F,CAAA;AAAA,EACtI,OAAOA,KAAAA,CAAE,MAAA,GAAS,QAAA,EAAS,CAAE,SAAS,8DAAyD;AACjG,CAAC,EACA,MAAA,EAAO,CAQP,WAAA,CAAY,CAAC,MAAM,GAAA,KAAQ;AAC1B,EAAA,MAAMC,QAAAA,GAAU,CAAC,KAAA,EAA0B,GAAA,KAAgB;AACzD,IAAA,IAAI,IAAA,CAAK,KAAK,CAAA,KAAM,MAAA;AAClB,MAAA,GAAA,CAAI,SAAS,EAAE,IAAA,EAAM,UAAU,OAAA,EAAS,CAAA,EAAA,EAAK,KAAK,IAAI,CAAA,cAAA,EAAiB,OAAO,KAAK,CAAC,aAAQ,GAAG,CAAA,CAAA,EAAI,MAAM,CAAC,KAAK,GAAG,CAAA;AAAA,EACtH,CAAA;AACA,EAAA,MAAM,MAAA,GAAS,CAAC,KAAA,KAA6B;AAC3C,IAAA,IAAI,IAAA,CAAK,KAAK,CAAA,KAAM,MAAA;AAClB,MAAA,GAAA,CAAI,SAAS,EAAE,IAAA,EAAM,QAAA,EAAU,OAAA,EAAS,KAAK,MAAA,CAAO,KAAK,CAAC,CAAA,oBAAA,EAAuB,KAAK,IAAI,CAAA,KAAA,CAAA,EAAS,MAAM,CAAC,KAAK,GAAG,CAAA;AAAA,EACtH,CAAA;AAEA,EAAA,IAAI,IAAA,CAAK,SAAS,OAAA,EAAS;AACzB,IAAAA,QAAAA,CAAQ,UAAU,uCAAuC,CAAA;AACzD,IAAA,MAAA,CAAO,MAAM,CAAA;AACb,IAAA,MAAA,CAAO,QAAQ,CAAA;AACf,IAAA,MAAA,CAAO,OAAO,CAAA;AAAA,EAChB;AACA,EAAA,IAAI,IAAA,CAAK,SAAS,QAAA,EAAU;AAC1B,IAAAA,QAAAA,CAAQ,QAAQ,0CAA0C,CAAA;AAC1D,IAAA,MAAA,CAAO,QAAQ,CAAA;AACf,IAAA,MAAA,CAAO,IAAI,CAAA;AACX,IAAA,MAAA,CAAO,QAAQ,CAAA;AACf,IAAA,MAAA,CAAO,OAAO,CAAA;AAAA,EAChB;AACA,EAAA,IAAI,IAAA,CAAK,SAAS,QAAA,EAAU;AAC1B,IAAAA,QAAAA,CAAQ,UAAU,8CAA8C,CAAA;AAChE,IAAA,MAAA,CAAO,QAAQ,CAAA;AACf,IAAA,MAAA,CAAO,MAAM,CAAA;AACb,IAAA,MAAA,CAAO,OAAO,CAAA;AAAA,EAChB;AACA,EAAA,IAAI,IAAA,CAAK,SAAS,KAAA,EAAO;AACvB,IAAAA,QAAAA,CAAQ,UAAU,yBAAyB,CAAA;AAC3C,IAAAA,QAAAA,CAAQ,SAAS,yBAAyB,CAAA;AAC1C,IAAA,MAAA,CAAO,QAAQ,CAAA;AACf,IAAA,MAAA,CAAO,MAAM,CAAA;AACb,IAAA,MAAA,CAAO,QAAQ,CAAA;AAAA,EACjB;AACF,CAAC;;;ACrFI,IAAM,SAAA,GAAuC;AAAA,EAClD,IAAA,EAAM,WAAA;AAAA,EACN,GAAA,EAAK,UAAA;AAAA,EACL,IAAA,EAAM,WAAA;AAAA,EACN,KAAA,EAAO;AACT,CAAA;AAGA,IAAM,gBAAA,GAA2C,EAAE,EAAA,EAAI,QAAA,EAAS;AAEzD,IAAM,KAAA,GAAQ,CAAC,KAAA,KAA0B,gBAAA,CAAiB,KAAK,CAAA,IAAK,KAAA,CAAM,OAAA,CAAQ,QAAA,EAAU,CAAC,CAAA,KAAM,CAAA,CAAA,EAAI,CAAA,CAAE,WAAA,EAAa,CAAA,CAAE,CAAA;AAE/H,IAAM,KAAA,GAAQ,CAAC,MAAA,KAA2B;AACxC,EAAA,KAAA,MAAW,CAAC,KAAA,EAAO,MAAM,CAAA,IAAK,MAAA,CAAO,OAAA,CAAQ,gBAAgB,CAAA,EAAG,IAAI,MAAA,KAAW,MAAA,EAAQ,OAAO,KAAA;AAC9F,EAAA,OAAO,MAAA,CAAO,QAAQ,WAAA,EAAa,CAAC,MAAM,CAAA,KAAc,CAAA,CAAE,aAAa,CAAA;AACzE,CAAA;AAEA,IAAM,YAAA,mBAAe,IAAI,GAAA,CAAI,CAAC,KAAA,EAAO,SAAA,EAAW,OAAA,EAAS,UAAA,EAAY,KAAA,EAAO,OAAA,EAAS,QAAQ,CAAC,CAAA;AAC9F,IAAM,cAAA,uBAAqB,GAAA,CAAI;AAAA,EAC7B,IAAA;AAAA,EACA,YAAA;AAAA,EACA,cAAA;AAAA,EACA,OAAA;AAAA,EACA,aAAA;AAAA,EACA,QAAA;AAAA,EACA,YAAA;AAAA,EACA,YAAA;AAAA,EACA,eAAA;AAAA,EACA,UAAA;AAAA,EACA,sBAAA;AAAA,EACA,SAAA;AAAA,EACA,UAAA;AAAA,EACA,OAAA;AAAA,EACA,MAAA;AAAA,EACA;AACF,CAAC,CAAA;AAEM,IAAM,QAAA,GAAW,CAAC,MAAA,EAAgB,KAAA,KAA4B;AACnE,EAAA,IAAI,KAAA,KAAU,QAAW,OAAO,IAAA;AAChC,EAAA,IAAI,aAAa,GAAA,CAAI,MAAM,GAAG,OAAO,IAAA,CAAK,UAAU,KAAK,CAAA;AACzD,EAAA,OAAO,KAAA;AACT,CAAA;AAEA,IAAM,UAAA,GAAa,CAAC,MAAA,EAAgB,KAAA,KAA4B;AAC9D,EAAA,IAAI,KAAA,KAAU,MAAM,OAAO,MAAA;AAC3B,EAAA,IAAI,YAAA,CAAa,GAAA,CAAI,MAAM,CAAA,EAAG,OAAO,OAAO,KAAA,KAAU,QAAA,GAAW,IAAA,CAAK,KAAA,CAAM,KAAK,CAAA,GAAI,KAAA;AAGrF,EAAA,IAAI,eAAe,GAAA,CAAI,MAAM,CAAA,EAAG,OAAO,OAAO,KAAK,CAAA;AACnD,EAAA,OAAO,KAAA;AACT,CAAA;AAEA,IAAM,aAAA,GAAgBD,MAAE,MAAA,CAAO;AAAA,EAC7B,EAAA,EAAIA,MAAE,MAAA,EAAO;AAAA,EACb,IAAA,EAAM,cAAA;AAAA,EACN,MAAA,EAAQA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC5B,EAAA,EAAI,SAAS,QAAA,EAAS;AAAA,EACtB,GAAA,EAAKA,KAAAA,CAAE,MAAA,CAAOA,KAAAA,CAAE,MAAA,IAAUA,KAAAA,CAAE,OAAA,EAAS,CAAA,CAAE,QAAA,EAAS;AAAA,EAChD,IAAA,EAAMA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC1B,OAAA,EAASA,KAAAA,CAAE,OAAA,EAAQ,CAAE,QAAA,EAAS;AAAA,EAC9B,MAAA,EAAQA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC5B,KAAA,EAAOA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC3B,UAAA,EAAYA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAChC,OAAOA,KAAAA,CAAE,MAAA,CAAO,EAAE,KAAA,EAAOA,KAAAA,CAAE,QAAO,EAAG,IAAA,EAAMA,KAAAA,CAAE,MAAA,IAAU,MAAA,EAAQA,KAAAA,CAAE,QAAO,EAAG,EAAE,QAAA,EAAS;AAAA,EACtF,MAAA,EAAQA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC5B,EAAA,EAAIA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EACxB,EAAA,EAAIA,MAAE,MAAA,EAAO;AAAA,EACb,SAAA,EAAWA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC/B,SAAA,EAAWA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC/B,KAAA,EAAOA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC3B,KAAA,EAAOA,MAAE,MAAA,EAAO;AAAA,EAChB,WAAA,EAAaA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EACjC,MAAA,EAAQA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC5B,QAAA,EAAUA,KAAAA,CAAE,OAAA,EAAQ,CAAE,QAAA,EAAS;AAAA,EAC/B,EAAA,EAAIA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EACxB,IAAA,EAAMA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC1B,WAAA,EAAaA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA;AAC1B,CAAC,CAAA;AAED,IAAM,YAAA,GAAeA,MAAE,MAAA,CAAO;AAAA,EAC5B,EAAA,EAAIA,MAAE,MAAA,EAAO;AAAA,EACb,QAAA,EAAUA,MAAE,MAAA,EAAO;AAAA,EACnB,OAAA,EAASA,MAAE,MAAA,EAAO;AAAA,EAClB,EAAA,EAAIA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EACxB,KAAA,EAAOA,MAAE,MAAA,EAAO;AAAA,EAChB,UAAA,EAAYA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAChC,SAASA,KAAAA,CAAE,KAAA,CAAMA,MAAE,MAAA,EAAQ,EAAE,QAAA,EAAS;AAAA,EACtC,KAAA,EAAOA,MAAE,IAAA,CAAK,CAAC,WAAW,QAAA,EAAU,SAAA,EAAW,SAAS,CAAC,CAAA;AAAA,EACzD,KAAA,EAAOA,MAAE,MAAA,EAAO;AAAA,EAChB,QAAA,EAAUA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC9B,KAAA,EAAOA,MAAE,MAAA,EAAO;AAAA,EAChB,IAAA,EAAMA,MAAE,MAAA,EAAO;AAAA,EACf,MAAA,EAAQA,MAAE,MAAA,EAAO;AAAA,EACjB,KAAA,EAAOA,MAAE,MAAA,EAAO;AAAA,EAChB,SAAA,EAAWA,MAAE,MAAA,EAAO;AAAA,EACpB,SAAA,EAAWA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC/B,OAAA,EAASA,KAAAA,CAAE,OAAA,EAAQ,CAAE,QAAA,EAAS;AAAA,EAC9B,IAAA,EAAMA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA;AACnB,CAAC,CAAA;AAED,IAAM,aAAA,GAAgBA,MAAE,MAAA,CAAO;AAAA,EAC7B,EAAA,EAAIA,MAAE,MAAA,EAAO;AAAA,EACb,KAAA,EAAOA,MAAE,MAAA,EAAO;AAAA,EAChB,QAAA,EAAUA,MAAE,MAAA,EAAO;AAAA,EACnB,IAAA,EAAMA,MAAE,MAAA,EAAO;AAAA,EACf,KAAA,EAAOA,MAAE,MAAA,EAAO;AAAA,EAChB,GAAA,EAAKA,MAAE,MAAA,CAAOA,KAAAA,CAAE,QAAO,EAAGA,KAAAA,CAAE,SAAS,CAAA;AAAA,EACrC,KAAA,EAAOA,MAAE,MAAA,EAAO;AAAA,EAChB,KAAA,EAAOA,MAAE,IAAA,CAAK,CAAC,WAAW,SAAA,EAAW,UAAA,EAAY,MAAA,EAAQ,QAAQ,CAAC,CAAA;AAAA,EAClE,OAAA,EAASA,MAAE,MAAA,EAAO;AAAA,EAClB,KAAA,EAAOA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC3B,YAAA,EAAcA,MAAE,MAAA,EAAO;AAAA,EACvB,SAAA,EAAWA,MAAE,MAAA,EAAO;AAAA,EACpB,KAAA,EAAOA,KAAAA,CAAE,OAAA,EAAQ,CAAE,QAAA,EAAS;AAAA,EAC5B,MAAA,EAAQA,KAAAA,CAAE,OAAA,EAAQ,CAAE,QAAA,EAAS;AAAA,EAC7B,KAAA,EAAOA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC3B,SAAA,EAAWA,MAAE,MAAA,EAAO;AAAA,EACpB,SAAA,EAAWA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA;AACxB,CAAC,CAAA;AAED,IAAM,cAAA,GAAiBA,MAAE,MAAA,CAAO;AAAA,EAC9B,QAAA,EAAUA,MAAE,MAAA,EAAO;AAAA,EACnB,OAAA,EAASA,MAAE,MAAA,EAAO;AAAA,EAClB,mBAAA,EAAqBA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA;AAClC,CAAC,CAAA;AAED,IAAM,WAAA,GAA8D;AAAA,EAClE,IAAA,EAAM,aAAA;AAAA,EACN,GAAA,EAAK,YAAA;AAAA,EACL,IAAA,EAAM,aAAA;AAAA,EACN,KAAA,EAAO;AACT,CAAA;AAEO,IAAM,WAAA,GAAc,CAAsB,KAAA,EAAU,GAAA,KAAgD;AACzG,EAAA,MAAM,SAAkC,EAAC;AACzC,EAAA,KAAA,MAAW,CAAC,MAAA,EAAQ,KAAK,KAAK,MAAA,CAAO,OAAA,CAAQ,GAAG,CAAA,EAAG;AACjD,IAAA,MAAM,MAAA,GAAS,UAAA,CAAW,MAAA,EAAQ,KAAK,CAAA;AACvC,IAAA,IAAI,WAAW,MAAA,EAAW,MAAA,CAAO,KAAA,CAAM,MAAM,CAAC,CAAA,GAAI,MAAA;AAAA,EACpD;AACA,EAAA,MAAM,IAAA,GAAO,WAAA,CAAY,KAAK,CAAA,CAAE,UAAU,MAAM,CAAA;AAChD,EAAA,IAAI,CAAC,KAAK,OAAA,EAAS;AACjB,IAAA,MAAM,UAAU,IAAA,CAAK,KAAA,CAAM,OAAO,GAAA,CAAI,CAAC,UAAU,CAAA,EAAG,KAAA,CAAM,KAAK,IAAA,CAAK,GAAG,CAAC,CAAA,EAAA,EAAK,KAAA,CAAM,OAAO,CAAA,CAAE,CAAA,CAAE,KAAK,IAAI,CAAA;AACvG,IAAA,MAAM,IAAI,KAAA,CAAM,CAAA,qBAAA,EAAwB,SAAA,CAAU,KAAK,CAAC,CAAA,oBAAA,EAAuB,KAAK,CAAA,EAAA,EAAK,OAAO,CAAA,CAAA,CAAG,CAAA;AAAA,EACrG;AACA,EAAA,OAAO,IAAA,CAAK,IAAA;AACd,CAAA;;;AC9IA,IAAM,WAAA,GAAc;AAAA,EAClB,CAAC,MAAM,GAAG,CAAA;AAAA,EACV,CAAC,MAAM,IAAI,CAAA;AAAA,EACX,CAAC,MAAM,GAAG,CAAA;AAAA,EACV,CAAC,OAAO,IAAI,CAAA;AAAA,EACZ,CAAC,MAAM,GAAG,CAAA;AAAA,EACV,CAAC,OAAO,IAAI;AACd,CAAA;AAEA,IAAM,gBAAA,GAAmBA,MAAE,MAAA,CAAO;AAAA,EAChC,EAAA,EAAIA,KAAAA,CAAE,OAAA,EAAQ,CAAE,QAAA,EAAS;AAAA,EACzB,EAAA,EAAIA,KAAAA,CAAE,OAAA,EAAQ,CAAE,QAAA,EAAS;AAAA,EACzB,EAAA,EAAIA,KAAAA,CAAE,OAAA,EAAQ,CAAE,QAAA,EAAS;AAAA,EACzB,GAAA,EAAKA,KAAAA,CAAE,OAAA,EAAQ,CAAE,QAAA,EAAS;AAAA,EAC1B,EAAA,EAAIA,KAAAA,CAAE,OAAA,EAAQ,CAAE,QAAA,EAAS;AAAA,EACzB,GAAA,EAAKA,KAAAA,CAAE,OAAA,EAAQ,CAAE,QAAA,EAAS;AAAA,EAC1B,EAAA,EAAIA,MAAE,KAAA,CAAMA,KAAAA,CAAE,SAAS,CAAA,CAAE,QAAA,EAAS,CAAE,QAAA,EAAS;AAAA,EAC7C,KAAA,EAAOA,MAAE,KAAA,CAAMA,KAAAA,CAAE,SAAS,CAAA,CAAE,QAAA,EAAS,CAAE,QAAA,EAAS;AAAA,EAChD,MAAA,EAAQA,KAAAA,CAAE,OAAA,EAAQ,CAAE,QAAA;AACtB,CAAC,CAAA;AAED,IAAM,YAAA,GAAe,CAAC,KAAA,EAAe,IAAA,KAAsC;AACzE,EAAA,MAAM,IAAA,GAAO,gBAAA,CAAiB,SAAA,CAAU,IAAI,CAAA;AAC5C,EAAA,IAAI,IAAA,CAAK,OAAA,EAAS,OAAO,IAAA,CAAK,IAAA;AAC9B,EAAA,MAAM,UAAU,IAAA,CAAK,KAAA,CAAM,OAAO,GAAA,CAAI,CAAC,UAAU,CAAA,EAAG,KAAA,CAAM,KAAK,IAAA,CAAK,GAAG,CAAC,CAAA,EAAA,EAAK,KAAA,CAAM,OAAO,CAAA,CAAE,CAAA,CAAE,KAAK,IAAI,CAAA;AACvG,EAAA,MAAM,IAAI,KAAA,CAAM,CAAA,kBAAA,EAAqB,KAAK,CAAA,kDAAA,EAAqD,OAAO,CAAA,CAAA,CAAG,CAAA;AAC3G,CAAA;AAIO,IAAM,YAAA,GAAe,CAAC,KAAA,EAA2B,KAAA,EAAe,QAAQ,EAAA,KAAa;AAC1F,EAAA,MAAM,UAAoB,EAAC;AAC3B,EAAA,MAAM,SAAoB,EAAC;AAC3B,EAAA,MAAM,MAAA,GAAS,KAAA,KAAU,EAAA,GAAK,EAAA,GAAK,GAAG,KAAK,CAAA,CAAA,CAAA;AAC3C,EAAA,MAAM,IAAA,GAAO,CAAC,KAAA,KAA2B;AACvC,IAAA,MAAA,CAAO,KAAK,KAAK,CAAA;AACjB,IAAA,OAAO,CAAA,CAAA,EAAI,KAAA,GAAQ,MAAA,CAAO,MAAA,GAAS,CAAC,CAAA,CAAA;AAAA,EACtC,CAAA;AAEA,EAAA,KAAA,MAAW,CAAC,OAAO,IAAI,CAAA,IAAK,OAAO,OAAA,CAAQ,KAAA,IAAS,EAAE,CAAA,EAAG;AACvD,IAAA,MAAM,SAAS,CAAA,EAAG,MAAM,CAAA,EAAG,KAAA,CAAM,KAAK,CAAC,CAAA,CAAA;AACvC,IAAA,MAAM,IAAA,GAAO,MAAM,KAAK,CAAA;AACxB,IAAA,IAAI,IAAA,KAAS,QAAQ,OAAO,IAAA,KAAS,YAAY,KAAA,CAAM,OAAA,CAAQ,IAAI,CAAA,EAAG;AAGpE,MAAA,OAAA,CAAQ,IAAA,CAAK,IAAA,KAAS,MAAA,GAAY,CAAA,EAAG,MAAM,CAAA,QAAA,CAAA,GAAa,CAAA,EAAG,MAAM,CAAA,GAAA,EAAM,KAAK,QAAA,CAAS,IAAA,EAAM,IAAI,CAAC,CAAC,CAAA,CAAE,CAAA;AACnG,MAAA;AAAA,IACF;AAEA,IAAA,MAAM,UAAA,GAAa,YAAA,CAAa,KAAA,EAAO,IAAI,CAAA;AAC3C,IAAA,KAAA,MAAW,CAAC,EAAA,EAAI,MAAM,CAAA,IAAK,WAAA,EAAa;AACtC,MAAA,MAAM,OAAA,GAAU,WAAW,EAAE,CAAA;AAC7B,MAAA,IAAI,YAAY,MAAA,EAAW;AAG3B,MAAA,OAAA,CAAQ,IAAA,CAAK,EAAA,KAAO,IAAA,GAAO,CAAA,CAAA,EAAI,MAAM,CAAA,YAAA,EAAe,MAAM,CAAA,IAAA,EAAO,IAAA,CAAK,QAAA,CAAS,IAAA,EAAM,OAAO,CAAC,CAAC,CAAA,CAAA,CAAA,GAAM,CAAA,EAAG,MAAM,CAAA,CAAA,EAAI,MAAM,CAAA,CAAA,EAAI,IAAA,CAAK,QAAA,CAAS,IAAA,EAAM,OAAO,CAAC,CAAC,CAAA,CAAE,CAAA;AAAA,IAC5J;AACA,IAAA,IAAI,UAAA,CAAW,OAAO,MAAA,EAAW,OAAA,CAAQ,KAAK,CAAA,EAAG,MAAM,UAAU,IAAA,CAAK,UAAA,CAAW,GAAG,GAAA,CAAI,CAAC,UAAU,QAAA,CAAS,IAAA,EAAM,KAAK,CAAC,CAAC,CAAC,CAAA,CAAA,CAAG,CAAA;AAC7H,IAAA,IAAI,UAAA,CAAW,UAAU,MAAA,EAAW,OAAA,CAAQ,KAAK,CAAA,KAAA,EAAQ,MAAM,UAAU,IAAA,CAAK,UAAA,CAAW,MAAM,GAAA,CAAI,CAAC,UAAU,QAAA,CAAS,IAAA,EAAM,KAAK,CAAC,CAAC,CAAC,CAAA,EAAA,CAAI,CAAA;AACzI,IAAA,IAAI,UAAA,CAAW,MAAA,KAAW,MAAA,EAAW,OAAA,CAAQ,IAAA,CAAK,UAAA,CAAW,MAAA,GAAS,CAAA,EAAG,MAAM,CAAA,QAAA,CAAA,GAAa,CAAA,EAAG,MAAM,CAAA,YAAA,CAAc,CAAA;AAAA,EACrH;AAEA,EAAA,OAAO,EAAE,GAAA,EAAK,OAAA,CAAQ,MAAA,KAAW,CAAA,GAAI,SAAS,OAAA,CAAQ,IAAA,CAAK,OAAO,CAAA,EAAG,MAAA,EAAO;AAC9E,CAAA;AAEO,IAAM,YAAA,GAAe,CAAC,KAAA,EAA6B,KAAA,GAAQ,EAAA,KAAe;AAC/E,EAAA,IAAI,KAAA,KAAU,MAAA,IAAa,KAAA,CAAM,MAAA,KAAW,GAAG,OAAO,EAAA;AACtD,EAAA,MAAM,MAAA,GAAS,KAAA,KAAU,EAAA,GAAK,EAAA,GAAK,GAAG,KAAK,CAAA,CAAA,CAAA;AAC3C,EAAA,OAAO,CAAA,UAAA,EAAa,MAAM,GAAA,CAAI,CAAC,QAAQ,CAAA,EAAG,MAAM,CAAA,EAAG,KAAA,CAAM,GAAA,CAAI,EAAE,CAAC,CAAA,CAAA,EAAI,GAAA,CAAI,QAAQ,MAAA,GAAS,MAAA,GAAS,KAAK,CAAA,CAAE,CAAA,CAAE,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA;AACvH,CAAA;AAEO,IAAM,QAAA,GAAW,CAAI,IAAA,EAAoB,KAAA,KAAqC;AACnF,EAAA,IAAI,KAAA,KAAU,UAAa,KAAA,CAAM,MAAA,KAAW,GAAG,OAAO,CAAC,GAAG,IAAI,CAAA;AAC9D,EAAA,OAAO,CAAC,GAAG,IAAI,EAAE,IAAA,CAAK,CAAC,MAAM,KAAA,KAAU;AACrC,IAAA,KAAA,MAAW,OAAO,KAAA,EAAO;AACvB,MAAA,MAAM,CAAA,GAAa,IAAA,CAAK,GAAA,CAAI,EAAE,CAAA;AAC9B,MAAA,MAAM,CAAA,GAAa,KAAA,CAAM,GAAA,CAAI,EAAE,CAAA;AAC/B,MAAA,MAAM,QAAA,GAAW,OAAO,CAAA,KAAM,QAAA,IAAY,OAAO,CAAA,KAAM,QAAA,GAAW,CAAA,GAAI,CAAA,GAAI,MAAA,CAAO,CAAC,IAAI,MAAA,CAAO,CAAC,IAAI,EAAA,GAAK,MAAA,CAAO,CAAC,CAAA,GAAI,MAAA,CAAO,CAAC,CAAA,GAAI,CAAA,GAAI,CAAA;AACnI,MAAA,IAAI,aAAa,CAAA,EAAG,OAAO,YAAY,GAAA,CAAI,GAAA,KAAQ,SAAS,EAAA,GAAK,CAAA,CAAA;AAAA,IACnE;AACA,IAAA,OAAO,CAAA;AAAA,EACT,CAAC,CAAA;AACH,CAAA;AAEO,IAAM,UAAA,GAAa,CAAC,GAAA,EAAa,KAAA,KAAwB;AAC9D,EAAA,MAAM,cAAwB,EAAC;AAC/B,EAAA,MAAM,SAAoB,EAAC;AAC3B,EAAA,KAAA,MAAW,CAAC,KAAA,EAAO,KAAK,KAAK,MAAA,CAAO,OAAA,CAAQ,GAAG,CAAA,EAAG;AAChD,IAAA,MAAM,MAAA,GAAS,MAAM,KAAK,CAAA;AAC1B,IAAA,IAAI,UAAU,IAAA,IAAQ,OAAO,KAAA,KAAU,QAAA,IAAY,SAAS,KAAA,EAAO;AAGjE,MAAA,WAAA,CAAY,IAAA,CAAK,CAAA,EAAG,MAAM,CAAA,YAAA,EAAe,MAAM,UAAU,MAAA,CAAO,KAAA,CAAM,GAAG,CAAC,CAAA,CAAE,CAAA;AAC5E,MAAA;AAAA,IACF;AACA,IAAA,MAAA,CAAO,IAAA,CAAK,QAAA,CAAS,MAAA,EAAQ,KAAK,CAAC,CAAA;AACnC,IAAA,WAAA,CAAY,IAAA,CAAK,GAAG,MAAM,CAAA,IAAA,EAAO,QAAQ,MAAA,CAAO,MAAA,GAAS,CAAC,CAAA,CAAE,CAAA;AAAA,EAC9D;AACA,EAAA,OAAO,EAAE,GAAA,EAAK,WAAA,CAAY,IAAA,CAAK,IAAI,GAAG,MAAA,EAAO;AAC/C,CAAA;;;AClGO,IAAM,SAAA,GACX,CAAC,EAAE,MAAA,EAAQ,YAAY,KAAA,EAAM,KAC7B,OAA4B,IAAA,KAAuB;AACjD,EAAA,MAAM,KAAA;AACN,EAAA,MAAM,KAAA,GAAQ,SAAA,CAAU,IAAA,CAAK,KAAK,CAAA;AAClC,EAAA,MAAM,KAAA,GAAQ,YAAA,CAAa,IAAA,CAAK,KAAA,EAAO,GAAG,CAAA;AAE1C,EAAA,MAAM,IAAA,GAAM,OAAO,EAAA,EAAY,KAAA,EAAe,KAAA,KAAkB;AAC9D,IAAA,IAAI,KAAA,IAAS,CAAA,EAAG,OAAO,EAAC;AACxB,IAAA,MAAM,KAAA,GAAQ,YAAA,CAAa,EAAE,GAAG,IAAA,CAAK,OAAO,GAAG,KAAA,EAAM,EAAG,CAAA,EAAG,GAAG,CAAA;AAC9D,IAAA,MAAM,MAAM,UAAA,CAAW,IAAA,CAAK,KAAK,KAAA,CAAM,MAAA,CAAO,SAAS,CAAC,CAAA;AACxD,IAAA,MAAM,MAAA,GAAS,MAAM,EAAA,CAAG,KAAA;AAAA,MACtB,CAAA,OAAA,EAAU,KAAK,CAAA,KAAA,EAAQ,GAAA,CAAI,GAAG;AAAA;AAAA,8BAAA,EAEN,KAAK,CAAA,SAAA,EAAY,KAAA,CAAM,GAAG,GAAG,KAAK;AAAA,iBAAA,EAC/C,IAAA,CAAK,KAAA,CAAM,KAAK,CAAC,CAAA;AAAA;AAAA,oBAAA,CAAA;AAAA,MAG5B,CAAC,GAAG,KAAA,CAAM,MAAA,EAAQ,GAAG,IAAI,MAAM;AAAA,KACjC;AAIA,IAAA,OAAO,QAAA,CAAS,MAAA,CAAO,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,KAAQ,WAAA,CAAY,IAAA,CAAK,KAAA,EAAO,GAAG,CAAC,CAAA,EAAG,KAAK,KAAK,CAAA;AAAA,EACpF,CAAA;AAEA,EAAA,IAAI,IAAA,CAAK,WAAW,MAAA,EAAW,OAAO,KAAK,MAAA,EAAQ,EAAC,EAAG,IAAA,CAAK,KAAK,CAAA;AAQjE,EAAA,MAAM,EAAE,MAAA,EAAQ,IAAA,EAAM,IAAA,KAAS,IAAA,CAAK,MAAA;AACpC,EAAA,MAAM,UAAA,GAAa,CAAC,GAAG,IAAI,CAAA;AAE3B,EAAA,MAAM,UAAU,MAAM,IAAA,CAAK,MAAA,EAAQ,EAAE,CAAC,MAAM,GAAG,EAAE,KAAA,EAAO,YAAW,EAAE,EAAG,IAAA,CAAK,KAAA,GAAQ,WAAW,MAAM,CAAA;AAEtG,EAAA,MAAM,SAAA,GAAY,CAAC,KAAA,KACjB,UAAA,CAAW,OAAO,EAAA,KAAO;AACvB,IAAA,MAAM,IAAA,GAAO,MAAM,EAAA,CAAG,KAAA,CAAM,wEAAwE,CAAC,CAAA,KAAA,EAAQ,KAAK,CAAA,CAAA,EAAI,KAAA,CAAM,MAAM,CAAC,CAAA,CAAA,EAAI,KAAK,CAAC,CAAA;AAC7I,IAAA,IAAI,IAAA,CAAK,KAAK,CAAC,CAAA,GAAI,MAAM,CAAA,KAAM,IAAA,SAAa,EAAC;AAC7C,IAAA,MAAM,IAAA,GAAO,YAAA,CAAa,EAAE,GAAG,IAAA,EAAM,CAAC,MAAM,GAAG,KAAA,EAAM,EAAG,CAAA,EAAG,GAAG,CAAA;AAC9D,IAAA,MAAM,KAAA,GAAQ,MAAM,EAAA,CAAG,KAAA,CAAM,CAAA,iBAAA,EAAoB,KAAK,CAAA,SAAA,EAAY,IAAA,CAAK,GAAG,CAAA,QAAA,CAAA,EAAY,IAAA,CAAK,MAAM,CAAA;AACjG,IAAA,IAAI,KAAA,CAAM,IAAA,CAAK,MAAA,GAAS,CAAA,SAAU,EAAC;AACnC,IAAA,OAAO,IAAA,CAAK,IAAI,EAAE,CAAC,MAAM,GAAG,KAAA,IAAS,CAAC,CAAA;AAAA,EACxC,CAAC,CAAA;AAEH,EAAA,KAAA,MAAW,SAAS,UAAA,EAAY;AAC9B,IAAA,IAAI,OAAA,CAAQ,MAAA,IAAU,IAAA,CAAK,KAAA,EAAO;AAClC,IAAA,OAAA,CAAQ,IAAA,CAAK,GAAI,MAAM,SAAA,CAAU,KAAK,CAAE,CAAA;AAAA,EAC1C;AAEA,EAAA,OAAO,OAAA;AACT,CAAA;;;AC7DK,IAAM,WAAA,GAAc,CAAC,WAAA,EAAa,UAAA,EAAY,aAAa,mBAAmB;AAI9E,IAAM,QAAA,GAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAyHxB,IAAM,YAAA,GAAe,CAAC,GAAA,KACpB,GAAA,CACG,MAAM,GAAG,CAAA,CACT,IAAI,CAAC,KAAA,KAAU,MAAM,IAAA,EAAM,EAC3B,MAAA,CAAO,CAAC,UAAU,KAAA,CAAM,KAAA,CAAM,IAAI,CAAA,CAAE,IAAA,CAAK,CAAC,IAAA,KAAS,IAAA,CAAK,MAAK,KAAM,EAAA,IAAM,CAAC,IAAA,CAAK,IAAA,GAAO,UAAA,CAAW,IAAI,CAAC,CAAC,CAAA,CACvG,IAAI,CAAC,GAAA,MAAS,EAAE,IAAA,EAAM,KAAA,EAAO,KAAI,CAAE,CAAA;AAGjC,IAAM,aAAA,GAA0B;AAAA,EACrC,EAAA,EAAI,gBAAA;AAAA,EACJ,UAAA,EAAY;AAAA,IACV,EAAE,WAAA,EAAa,sFAAA,EAAwF,KAAA,EAAO,YAAA,CAAa,QAAQ,CAAA,EAAE;AAAA,IACrI;AAAA,MACE,WAAA,EAAa,6FAAA;AAAA,MACb,KAAA,EAAO;AAAA,QACL,EAAE,IAAA,EAAM,KAAA,EAAO,GAAA,EAAK,0DAAA,EAA2D;AAAA,QAC/E,EAAE,IAAA,EAAM,KAAA,EAAO,GAAA,EAAK,oEAAA;AAAqE;AAC3F;AACF;AAEJ;;;ACzIA,IAAM,yBAAU,CAAA,MAAsC;AACpD,EAAA,IAAI,QAAA,GAAW,CAAA;AACf,EAAA,OAAO,CAAC,KAAA,KAAU;AAChB,IAAA,QAAA,IAAY,CAAA;AACZ,IAAA,OAAO,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,IAAA,CAAK,GAAA,EAAI,CAAE,QAAA,CAAS,EAAE,CAAC,CAAA,CAAA,EAAI,QAAA,CAAS,QAAA,CAAS,EAAE,CAAC,CAAA,CAAA;AAAA,EACrE,CAAA;AACF,CAAA,GAAG;AAMI,IAAM,eAAA,GAAkB,CAAC,IAAA,EAAgB,OAAA,GAA4B,EAAC,KAA4C;AAGvH,EAAA,MAAM,KAAA,GAAuB,OAAA,CAAQ,OAAA,KAAY,KAAA,GAAQ,QAAQ,OAAA,EAAQ,GAAIE,gBAAA,CAAc,IAAA,EAAM,CAAC,aAAa,CAAC,CAAA,CAAE,IAAA,CAAK,MAAM,MAAS,CAAA;AAGtI,EAAA,KAAA,CAAM,KAAA,CAAM,MAAM,MAAS,CAAA;AAE3B,EAAA,MAAM,QAAA,GAAuB,CAAC,EAAA,KAAO;AACnC,IAAA,IAAI,KAAK,WAAA,KAAgB,MAAA;AACvB,MAAA,MAAM,IAAI,MAAM,8HAAyH,CAAA;AAC3I,IAAA,OAAO,IAAA,CAAK,YAAY,EAAE,CAAA;AAAA,EAC5B,CAAA;AAEA,EAAA,MAAM,KAAA,GAAQ,CAAC,MAAA,EAAgB,UAAA,KAAsC;AACnE,IAAA,MAAM,KAAA,GAAmB;AAAA,MACvB,KAAA,EAAO,OAA4B,IAAA,KAAuB;AACxD,QAAA,MAAM,KAAA;AACN,QAAA,MAAM,KAAA,GAAQ,YAAA,CAAa,IAAA,CAAK,KAAA,EAAO,CAAC,CAAA;AACxC,QAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,KAAU,MAAA,GAAY,KAAK,CAAA,OAAA,EAAU,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,KAAK,CAAC,CAAC,CAAA,CAAA;AAC3F,QAAA,MAAM,MAAA,GAAS,MAAM,MAAA,CAAO,KAAA;AAAA,UAC1B,CAAA,cAAA,EAAiB,SAAA,CAAU,IAAA,CAAK,KAAK,CAAC,CAAA,OAAA,EAAU,KAAA,CAAM,GAAG,CAAA,EAAG,YAAA,CAAa,IAAA,CAAK,KAAK,CAAC,GAAG,KAAK,CAAA,CAAA;AAAA,UAC5F,KAAA,CAAM;AAAA,SACR;AACA,QAAA,OAAO,MAAA,CAAO,KAAK,GAAA,CAAI,CAAC,QAAQ,WAAA,CAAY,IAAA,CAAK,KAAA,EAAO,GAAG,CAAC,CAAA;AAAA,MAC9D,CAAA;AAAA;AAAA,MAGA,cAAA,EAAgB,OAA4B,KAAA,EAAU,KAAA,KAAuD;AAC3G,QAAA,MAAM,KAAA;AACN,QAAA,MAAM,KAAA,GAAgB,KAAA;AACtB,QAAA,MAAM,MAAA,GAAiB,WAAA,CAAY,KAAK,CAAA,KAAM,OAAO,EAAE,GAAG,KAAA,EAAO,EAAA,EAAI,KAAA,CAAM,EAAA,IAAM,MAAA,CAAO,KAAK,GAAE,GAAI,KAAA;AACnG,QAAA,MAAM,OAAA,GAAU,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAA,CAAE,MAAA,CAAO,CAAC,GAAG,KAAK,CAAA,KAAM,KAAA,KAAU,MAAS,CAAA;AAChF,QAAA,MAAM,OAAA,GAAU,QAAQ,GAAA,CAAI,CAAC,CAAC,KAAK,CAAA,KAAM,KAAA,CAAM,KAAK,CAAC,CAAA;AACrD,QAAA,MAAM,MAAA,GAAS,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAC,KAAA,EAAO,KAAK,CAAA,KAAM,QAAA,CAAS,KAAA,CAAM,KAAK,CAAA,EAAG,KAAK,CAAC,CAAA;AAE5E,QAAA,MAAM,MAAA,GAAS,UAAU,KAAK,CAAA;AAC9B,QAAA,MAAM,MAAA,GACJ,OAAO,IAAA,KAAS,MAAA,GACZ,IAAI,MAAA,CAAO,EAAA,CAAG,IAAI,CAAC,MAAA,KAAW,MAAM,MAAM,CAAC,EAAE,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA,CAAA,GACvD,CAAA,CAAA,EAAI,OAAO,EAAA,CAAG,GAAA,CAAI,CAAC,MAAA,KAAY,MAAA,KAAW,YAAY,MAAA,KAAW,MAAA,GAAS,YAAY,KAAA,CAAM,MAAM,CAAC,CAAA,IAAA,CAAA,GAAS,KAAA,CAAM,MAAM,CAAE,CAAA,CAAE,KAAK,IAAI,CAAC,WAAW,KAAA,CAAM,MAAA,CAAO,IAAI,CAAC,CAAA,YAAA,CAAA;AAEzK,QAAA,MAAM,MAAA,GAAS,MAAM,MAAA,CAAO,KAAA;AAAA,UAC1B,CAAA,YAAA,EAAe,UAAU,KAAK,CAAC,KAAK,OAAA,CAAQ,IAAA,CAAK,IAAI,CAAC,CAAA,UAAA,EAAa,MAAA,CAAO,IAAI,CAAC,MAAA,EAAQ,UAAU,CAAA,CAAA,EAAI,KAAA,GAAQ,CAAC,CAAA,CAAE,CAAA,CAAE,IAAA,CAAK,IAAI,CAAC,CAAA;AAAA,uBAAA,EAC7G,MAAM,CAAA,uBAAA,CAAA;AAAA,UACrB;AAAA,SACF;AACA,QAAA,MAAM,GAAA,GAAM,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA;AACzB,QAAA,OAAO,GAAA,KAAQ,MAAA,GAAY,MAAA,GAAY,WAAA,CAAY,OAAO,GAAG,CAAA;AAAA,MAC/D,CAAA;AAAA,MAEA,OAAO,SAAA,CAAU,EAAE,MAAA,EAAQ,UAAA,EAAY,OAAO,CAAA;AAAA,MAE9C,GAAA,EAAK,OAA4B,KAAA,EAAU,EAAA,EAAY,QAA8B,GAAA,KAAiC;AACpH,QAAA,MAAM,KAAA;AACN,QAAA,MAAM,GAAA,GAAM,KAAA,CAAM,WAAA,CAAY,KAAK,CAAC,CAAA;AACpC,QAAA,MAAM,KAAA,GAAQ,YAAA,CAAa,MAAA,EAAQ,CAAC,CAAA;AACpC,QAAA,MAAM,QAAQ,UAAA,CAAW,GAAA,EAAK,KAAA,CAAM,MAAA,CAAO,SAAS,CAAC,CAAA;AACrD,QAAA,MAAM,MAAA,GAAS,MAAM,MAAA,CAAO,KAAA;AAAA,UAC1B,CAAA,OAAA,EAAU,SAAA,CAAU,KAAK,CAAC,CAAA,KAAA,EAAQ,KAAA,CAAM,GAAG,CAAA,OAAA,EAAU,GAAG,CAAA,UAAA,EAAa,KAAA,CAAM,GAAG,cAAc,GAAG,CAAA,CAAA;AAAA,UAC/F,CAAC,EAAA,EAAI,GAAG,MAAM,MAAA,EAAQ,GAAG,MAAM,MAAM;AAAA,SACvC;AACA,QAAA,OAAO,MAAA,CAAO,KAAK,MAAA,GAAS,CAAA;AAAA,MAC9B,CAAA;AAAA,MAEA,MAAA,EAAQ,OAA4B,IAAA,KAAwB;AAC1D,QAAA,MAAM,KAAA;AACN,QAAA,MAAM,KAAA,GAAQ,YAAA,CAAa,IAAA,CAAK,KAAA,EAAO,CAAC,CAAA;AAGxC,QAAA,MAAM,MAAA,GAAS,MAAM,MAAA,CAAO,KAAA,CAAM,eAAe,SAAA,CAAU,IAAA,CAAK,KAAK,CAAC,CAAA,OAAA,EAAU,MAAM,GAAG,CAAA,WAAA,EAAc,MAAM,WAAA,CAAY,IAAA,CAAK,KAAK,CAAC,CAAC,CAAA,CAAA,EAAI,KAAA,CAAM,MAAM,CAAA;AACrJ,QAAA,OAAO,OAAO,IAAA,CAAK,MAAA;AAAA,MACrB,CAAA;AAAA,MAEA,QAAA,EAAU,OAAU,EAAA,KAAkD;AACpE,QAAA,MAAM,KAAA;AAEN,QAAA,OAAO,UAAA,CAAW,CAAC,EAAA,KAAO,EAAA,CAAG,KAAA,CAAM,EAAA,EAAI,CAAC,KAAA,KAAU,KAAA,CAAM,EAAE,CAAC,CAAC,CAAC,CAAA;AAAA,MAC/D;AAAA,KACF;AACA,IAAA,OAAO,KAAA;AAAA,EACT,CAAA;AAEA,EAAA,OAAO,EAAE,GAAG,KAAA,CAAM,IAAA,EAAM,QAAQ,GAAG,KAAA,EAAM;AAC3C","file":"postgres.cjs","sourcesContent":["import type { FactInput, Reflex, ReflexInput } from './schemas';\n\nexport type Row = Record<string, unknown>;\n\n// ═══════════════════════════════════════════════════════════════\n// The ledger — four tables, and only two of them grow with events\n//\n// There were seven: fact, delivery, firing, task, attempt, window,\n// watermark. Six of those were vocabulary. A design noun is not a\n// reason for a table; a GUARANTEE is, and each of these carries one:\n//\n// fact durable before anything interprets it, so `ingest` is one\n// write and matching is retryable in the advance\n// run UNIQUE(reflexId, cause) — THE idempotency, one constraint\n// for every trigger kind; atomic fan-out; fan-in counting\n// task UNIQUE(runId, unit) written BEFORE the effect; the lease;\n// the retry counter\n// state where each reflex has got to. One row per reflex, bounded\n// by how many reflexes exist rather than by what happened\n//\n// What went, and where it went:\n// delivery → the run's `cause`; a non-match is an event, not a row\n// attempt → `attempt` and `error` on the task; per-attempt history\n// is the host's log, and nothing read it here\n// window → deleted with coalesce, which nothing used\n// watermark → the clock through-line and the arming baseline are two\n// fields on `state`, not an unbounded key/value table with\n// a growing set of string keys\n// ═══════════════════════════════════════════════════════════════\n\nexport type Fact = FactInput & {\n id: string;\n // WHOSE FACT THIS IS — the `as` of the reflex that minted it, and absent on\n // anything the host ingested itself.\n //\n // Stamped by the engine, never by a handler, for the same reason `depth` is:\n // a handler that could choose its own identity could choose somebody else's.\n // Tide does not know what the string means. It only knows that a fact minted\n // under one identity must not wake a reflex running under another — which is\n // what stops a row selected for one tenant being handed to another tenant's\n // effect. See `reflexMatchesFact`.\n as?: string;\n // Distance from the root stimulus. An effect's emit inherits its\n // task's depth + 1, which is what lets a divergent loop hit a\n // ceiling instead of melting the ledger.\n depth: number;\n // A fact is done once it has been offered to every LOADED reflex —\n // matching is per (fact, reflex), and one fact can wake five.\n deliveredAt?: number;\n parked?: string;\n // A human looked at a parked fact and said \"run it anyway\". Without\n // this the release is a ping-pong: the matcher re-parks on the next\n // tick, because the depth that parked it has not changed and never\n // will. The override is recorded rather than faked by rewriting depth,\n // which would make the ledger lie about causality.\n released?: boolean;\n // THE CHAIN THIS FACT BELONGS TO — the id of the fact that started it,\n // absent on a root (a fact the host ingested, or the first facts of a run\n // nothing caused). Stamped at the door (engine/facts.ts), never by a handler.\n root?: string;\n // On a root only: how many facts its chain has minted beneath it. Depth\n // caps how LONG a chain runs; this caps how WIDE — a reflex that writes two\n // facts per fact it sees doubles each hop, and under a depth ceiling of 24\n // that is 2^24 runs before anything parks.\n descendants?: number;\n};\n\nexport type RunState = 'pending' | 'fanned' | 'settled' | 'skipped';\n\n// One execution of one reflex. Named `run` rather than `firing` because\n// `firing` was also a trigger kind and a fact kind — one word doing three\n// jobs, and the reason `fact: { firing: … }` read as a puzzle.\nexport type Run = {\n id: string;\n reflexId: string;\n version: string;\n // The host identity this ran under, copied from the reflex. Opaque to\n // tide and written down so the ledger is scopeable by an ordinary\n // host-side rule instead of by parsing reflex ids.\n as?: string;\n // 'occurrence:<key>' | 'fact:<id>' | 'run:<id>' | 'manual:<who>' —\n // provenance, and half of the task's idempotency key.\n cause: string;\n occurrence?: string;\n factIds?: readonly string[];\n state: RunState;\n depth: number;\n selected?: number;\n total: number;\n done: number;\n failed: number;\n dueAt: number;\n createdAt: number;\n settledAt?: number;\n // Whether this run's settlement has already been announced as a fact.\n // Separate from `settledAt` because a reopened task RE-settles its run\n // and must not mint a second fan-in fact: the digest watching it already\n // went out. The flag is what lets the recovery verb rewind safely.\n drained?: boolean;\n note?: string;\n};\n\n// How one attempt ended. There is no attempt TABLE — the count and the last\n// error live on the task, and per-attempt history is the host's log, which\n// is where it was already being read from. The distinction still matters to\n// the executor, so it still has a name.\nexport type AttemptOutcome = 'ok' | 'error' | 'timeout';\n\nexport type TaskState = 'pending' | 'claimed' | 'retrying' | 'done' | 'failed';\n\nexport type Task = {\n id: string;\n runId: string;\n reflexId: string;\n // The unit's grain: a row key in `each`, '' for batch and unit-less runs.\n unit: string;\n cause: string;\n // The pinned environment slice. Frozen at fan-out so a retry evaluates\n // against the same data the selection saw, never against moved data.\n env: Row;\n // Stamped from the run at fan-out, not read back from it at execution\n // time. A run swept out from under a long-running chain used to reset\n // the ceiling to 0 — defeating the backstop in exactly the long-running\n // case it exists for. The task carries what the task needs.\n depth: number;\n state: TaskState;\n attempt: number;\n token?: string;\n // THE LEASE, and expiry IS the reclaim. Without one, a process that died\n // between the effect and the record left the task `claimed` forever: its\n // run never settled, never drained, and an `overlap: 'skip'` reflex was\n // blocked for good. No reaper, no heartbeat — a claim whose lease has\n // lapsed is simply claimable again, which the fencing token makes safe.\n //\n // ZERO, not null, when unclaimed. \"Never claimed or lapsed\" is then one\n // comparison rather than a disjunction, which keeps the claim expressible\n // in a query grammar that has no OR — and a grammar with no OR is a\n // grammar every store can implement.\n claimedUntil: number;\n notBefore: number;\n input?: unknown;\n output?: unknown;\n error?: string;\n createdAt: number;\n settledAt?: number;\n};\n\n// Where a reflex has got to. ONE ROW PER REFLEX — bounded by how many\n// reflexes exist, never by how much has happened, which is what separates\n// it from the ledger proper and is why it survived the collapse.\nexport type ReflexState = {\n reflexId: string;\n // Matching starts here. A reflex never retro-fires: history from before\n // it existed is reachable by deliberate backfill, never by accident.\n armedAt: number;\n // The clock's through-line. Derivable from MAX(cause) over the runs, but\n // only while those runs exist — and retention is allowed to delete them.\n materializedThrough?: number;\n};\n\n// ═══════════════════════════════════════════════════════════════\n// The seams — five injection points\n// ═══════════════════════════════════════════════════════════════\n\n// What an effect handler and the select seam receive. `actor` is opaque:\n// tide never learns what a principal is (under moss it is an ActorContext,\n// charter-resolved and engine-enforced).\nexport type TideCtx = {\n reflexId: string;\n runId: string;\n taskId: string;\n // The downstream idempotency key. A payment capture passes this to the\n // provider, which is what makes a fenced-out zombie attempt harmless.\n taskKey: string;\n attempt: number;\n // How deep in a cause chain this task sits. A handler whose side effects\n // re-enter as facts (a write through the host's own DAL, minted back by\n // the bridge) forwards this with the write, so the chain ceiling survives\n // the trip through the database instead of resetting at every hop.\n depth: number;\n now: number;\n actor: unknown;\n // Continue a chain from inside a handler. Buffered — the fact commits\n // with a SUCCESSFUL attempt, so a retry cannot double-mint it — and\n // narrowed to `write` and `signal`, because a handler that could emit\n // `manual` would reach past the arming switch.\n emit: (fact: Omit<FactInput, 'cause'>) => void;\n};\n\nexport type EffectHandler = {\n run: (input: unknown, ctx: TideCtx) => Promise<unknown> | unknown;\n // What this effect writes. Feeds the flow graph and its cycle refusal —\n // an edge is a write meeting a watch. Under moss it is DERIVED from the\n // vex mutation behind the effect, never declared; a handler with no\n // `writes` is a BLIND edge the load report names.\n writes?: readonly string[];\n // Rendered by `preview` in place of running. Nothing else is needed to\n // make a reflex previewable — the executor is the only door out.\n preview?: (input: unknown, ctx: PreviewCtx) => unknown;\n};\n\nexport type PreviewCtx = { reflexId: string; unit: string; now: number; actor: unknown };\n\nexport type EffectRegistry = Record<string, EffectHandler>;\n\nexport type TransformFn = (config: unknown, source: Row) => unknown;\n\nexport type SelectFn = (query: unknown, ctx: SelectCtx) => AsyncIterable<Row> | Iterable<Row> | Promise<Iterable<Row>>;\n\nexport type SelectCtx = { reflexId: string; now: number; actor: unknown; env: Row };\n\nexport type ActorFn = (as: string | undefined) => unknown;\n\n// ═══════════════════════════════════════════════════════════════\n// Config and reports\n// ═══════════════════════════════════════════════════════════════\n\nexport type Retention = Partial<Record<'facts' | 'runs' | 'tasks', number>>;\n\nexport type TideConfig = {\n store: TideStore;\n transform: TransformFn;\n select?: SelectFn;\n effects?: EffectRegistry | ((as: string | undefined) => EffectRegistry);\n actor?: ActorFn;\n // A fact whose cause chain runs deeper than this is PARKED for review\n // rather than fired — the runtime backstop behind the load-time cycle\n // rules, and nearly free because causality is already recorded.\n maxChainDepth?: number;\n // A chain that has minted more facts than this beneath its root has the\n // rest PARKED — the breadth twin of maxChainDepth. Default 10,000.\n maxChainFacts?: number;\n // KEEP A WRITE FACT NOTHING WATCHES? Default true, which is what the ledger\n // means today: `ledger.facts()` is every write the host committed, and\n // `causeChain` walks it — an audit trail that answers \"why did this person\n // get this\" without anybody having predicted the question.\n //\n // A host that mints a fact per committed ROW pays for that trail on the hot\n // path of every write: an INSERT here, awaited, for a fact no loaded reflex\n // could ever match. A host whose ledger is not its audit log sets this false\n // and pays only for the writes something is actually listening to.\n //\n // NOT retroactive and not clever: it drops nothing while no reflexes are\n // loaded (a fact arriving in that window still waits, exactly as matchFacts\n // has always let it), and it ignores enablement, arming and identity — the\n // question it asks is only \"could any loaded reflex ever watch this entity\n // and op\", which is strictly weaker than the matcher.\n storeUnwatchedWrites?: boolean;\n // How many units one fan-out may mint before the run is refused.\n maxFanOut?: number;\n // How long a claim is good for. A task still `claimed` past this is\n // claimable again — the only recovery a died-mid-effect process needs.\n leaseMs?: number;\n onEvent?: (event: TideEvent) => void;\n};\n\nexport type TideEvent =\n | { type: 'run.created'; run: Run }\n | { type: 'run.settled'; run: Run }\n | { type: 'run.skipped'; reflexId: string; reason: string }\n // A fan-out that will be tried again next tick. Not a skip: a transient\n // selection failure must never consume an occurrence.\n | { type: 'run.deferred'; reflexId: string; runId: string; reason: string }\n | { type: 'task.done'; task: Task }\n | { type: 'task.failed'; task: Task }\n | { type: 'task.retrying'; task: Task; nextAt: number }\n // A lease lapsed and the work was taken back. Rare and worth seeing:\n // it means something died holding a task.\n | { type: 'task.reclaimed'; task: Task }\n | { type: 'fact.ingested'; fact: Fact }\n // A fact refused by its dedupeKey. Not a row — a provider retrying a\n // webhook forever would grow the table without bound, which is what the\n // key exists to stop — but not nothing either: without it, a repeat and\n // a chain that silently stopped read the same.\n | { type: 'fact.deduped'; fact: NewFact }\n | { type: 'fact.parked'; fact: Fact; reason: string }\n // The `when` said no, or threw. Not a row — one per (fact, reflex) pair\n // is a table that grows faster than the work does — but not nothing\n // either, because \"why didn't it fire\" deserves an answer.\n | { type: 'fact.unmatched'; fact: Fact; reflexId: string; reason: string };\n\nexport type AdvanceReport = {\n now: number;\n materialized: number;\n skippedOccurrences: number;\n factsMatched: number;\n runsCreated: number;\n tasksCreated: number;\n executed: number;\n succeeded: number;\n failed: number;\n retrying: number;\n reclaimed: number;\n runsSettled: number;\n parked: number;\n};\n\nexport type LoadReport = {\n loaded: number;\n // Guarded cycles are legal — a drip campaign IS a cycle. They are\n // reported so the author sees the loop they built.\n cycles: readonly { reflexIds: readonly string[]; guarded: boolean }[];\n blind: readonly { reflexId: string; effect: string }[];\n warnings: readonly string[];\n};\n\nexport type PreviewUnit = {\n unit: string;\n env: Row;\n input?: unknown;\n render?: unknown;\n error?: string;\n};\n\nexport type PreviewReport = {\n reflexId: string;\n version: string;\n fired: boolean;\n reason?: string;\n cause?: string;\n occurrence?: string;\n effect: string;\n selected: number;\n units: readonly PreviewUnit[];\n};\n\nexport type NewFact = FactInput & { depth: number; as?: string };\n\n// ═══════════════════════════════════════════════════════════════\n// The store contract — six capabilities, not twenty-seven nouns\n//\n// The old port had a method per noun per verb, so `claimTasks`,\n// `drainSettled` and `claimClosedWindows` were three implementations\n// of ONE operation and diverged three ways. Shaped by what the\n// guarantees need instead:\n//\n// transact several writes land together or not at all\n// appendIfAbsent a row exists once, decided by the table's unique\n// key rather than by a read the caller races\n// claim take work exactly once, under a fence\n// cas move a row only from the state you expected\n// query read\n// remove retention; the only thing that shrinks the ledger\n//\n// Structural and driver-free, the way vex's CacheBackend is. Nothing\n// here knows about retry, arming, coalescing or occurrences — the\n// engine holds every opinion, and the store holds none.\n// ═══════════════════════════════════════════════════════════════\n\nexport type TideTables = {\n fact: Fact;\n run: Run;\n task: Task;\n state: ReflexState;\n};\n\nexport type TableName = keyof TideTables;\n\n// The row identity `cas` and `remove` address a single row by.\nexport const PRIMARY_KEY: { [T in TableName]: keyof TideTables[T] & string } = {\n fact: 'id',\n run: 'id',\n task: 'id',\n state: 'reflexId',\n};\n\nexport type UniqueKey<T extends TableName> = {\n by: readonly (keyof TideTables[T] & string)[];\n // The constraint applies only when this column is present — in Postgres,\n // a partial unique index. A fact with no `dedupeKey` is not claiming to\n // be unique and is always appended.\n when?: keyof TideTables[T] & string;\n};\n\n// WHERE THE IDEMPOTENCY LIVES, written down once so every store agrees.\n// These four constraints are the engine's exactly-once promises; they are\n// not an optimisation and a store that omits one is not a tide store.\nexport const UNIQUE_BY: { [T in TableName]: UniqueKey<T> } = {\n // `entity` is part of the key. Without it two polls over different tables\n // that happened to agree on a cursor value silently ate each other's rows.\n fact: { by: ['kind', 'entity', 'name', 'dedupeKey'], when: 'dedupeKey' },\n run: { by: ['reflexId', 'cause'] },\n task: { by: ['runId', 'unit'] },\n state: { by: ['reflexId'] },\n};\n\nexport type Comparison<V> = {\n eq?: V;\n ne?: V;\n lt?: V;\n lte?: V;\n gt?: V;\n gte?: V;\n in?: readonly V[];\n notIn?: readonly V[];\n isNull?: boolean;\n};\n\nexport const COMPARISON_OPS = ['eq', 'ne', 'lt', 'lte', 'gt', 'gte', 'in', 'notIn', 'isNull'] as const;\n\nexport type Where<R> = { [K in keyof R]?: R[K] | Comparison<R[K]> };\n\nexport type Order<R> = readonly { by: keyof R & string; dir?: 'asc' | 'desc' }[];\n\nexport type QuerySpec<T extends TableName = TableName> = {\n table: T;\n where?: Where<TideTables[T]>;\n order?: Order<TideTables[T]>;\n limit?: number;\n};\n\n// A patch, plus the one thing a caller cannot compute without a read it\n// would then race: an increment. `attempt` has to rise AT CLAIM TIME, or a\n// handler that reliably kills the process retries forever.\nexport type Mutation<R> = { [K in keyof R]?: R[K] | { inc: number } };\n\nexport type ClaimSpec<T extends TableName = TableName> = {\n table: T;\n where?: Where<TideTables[T]>;\n order?: Order<TideTables[T]>;\n limit: number;\n // Applied to every claimed row, atomically with the selection.\n set: Mutation<TideTables[T]>;\n // `order: 'serial'`. At most one row per distinct value of `column` may\n // be held at once, counting rows some earlier claim is already holding —\n // so it lives INSIDE the claim rather than as a filter the caller applies\n // first and loses the race on.\n //\n // `only` names exactly the values this applies to, and it is REQUIRED\n // rather than defaulting to \"everything\": a store implementing \"all\n // groups\" has to enumerate the groups first, and an omitted list that\n // silently means \"all of them\" is the kind of default two implementations\n // read two ways. Everything outside it claims freely. Omit `onePer`\n // entirely when nothing is serial.\n onePer?: { column: keyof TideTables[T] & string; held: Where<TideTables[T]>; only: readonly string[] };\n};\n\nexport type RemoveSpec<T extends TableName = TableName> = {\n table: T;\n where?: Where<TideTables[T]>;\n};\n\nexport type TideStore = {\n // Several writes land together or not at all. The engine's two atomic\n // moments — fan-out committing with its run's transition, and an attempt\n // recording with the facts it emitted — are transactions, not conventions.\n transact: <T>(fn: (tx: TideStore) => Promise<T>) => Promise<T>;\n\n // Idempotent on the table's unique key. A duplicate materialization, a\n // replayed webhook, or a second instance's tick collides and gets\n // `undefined` — a refusal, not an error. `id` is minted by the store.\n appendIfAbsent: <T extends TableName>(\n table: T,\n row: Omit<TideTables[T], 'id'> & { id?: string },\n ) => Promise<TideTables[T] | undefined>;\n\n // Take rows exactly once. Selection and mutation are one step, which is\n // the whole promise: two instances ticking at the same moment contend\n // rather than duplicate.\n claim: <T extends TableName>(spec: ClaimSpec<T>) => Promise<readonly TideTables[T][]>;\n\n // Move a row only from the state you expected. The fence: a timed-out\n // attempt finishing late finds its token superseded and is discarded\n // rather than overwriting the live one.\n cas: <T extends TableName>(\n table: T,\n id: string,\n expect: Where<TideTables[T]>,\n set: Mutation<TideTables[T]>,\n ) => Promise<boolean>;\n\n query: <T extends TableName>(spec: QuerySpec<T>) => Promise<readonly TideTables[T][]>;\n\n // Retention, and the only thing that shrinks the ledger. Deleting a run\n // cascades to its tasks: the run and its members are one fact about the\n // world, and half of it is worse than neither.\n remove: <T extends TableName>(spec: RemoveSpec<T>) => Promise<number>;\n};\n\nexport type { Reflex, ReflexInput, FactInput };\n","import { z } from 'zod';\n\n// ═══════════════════════════════════════════════════════════════\n// Triggers — four kinds, closed.\n//\n// Structured on purpose: a reflex is shown to the operator it\n// affects, and `{ every: 'month', on: 1, at: '03:00' }` is\n// reviewable by the person it bills where `0 3 1 * *` is a\n// shibboleth. Cron-string sugar belongs in tooling, never in the\n// stored artifact.\n// ═══════════════════════════════════════════════════════════════\n\nexport const WEEKDAYS = ['mon', 'tue', 'wed', 'thu', 'fri', 'sat', 'sun'] as const;\n\nconst HHMM = /^([01]\\d|2[0-3]):[0-5]\\d$/;\nconst MMDD = /^(0[1-9]|1[0-2])-(0[1-9]|[12]\\d|3[01])$/;\n// Seconds are optional: a one-shot can name the second it fires on.\nconst LOCAL_DATETIME = /^\\d{4}-\\d{2}-\\d{2}T([01]\\d|2[0-3]):[0-5]\\d(:[0-5]\\d)?$/;\n\nexport const ClockUnitSchema = z.enum(['day', 'week', 'month', 'year']);\n\nexport const ClockRecurringSchema = z\n .object({\n every: ClockUnitSchema.describe('The calendar period it repeats on. A repeating clock fires on every such period until the reflex is removed — only for a request that says it repeats.'),\n on: z\n .union([z.number().int().min(1).max(31), z.enum(WEEKDAYS), z.string().regex(MMDD)])\n .optional()\n .describe('week → a weekday; month → 1..31 (clamped to month end); year → \"MM-DD\". Omitted for day.'),\n at: z.string().regex(HHMM).describe('Local wall-clock time, \"HH:MM\".'),\n tz: z.string().describe('IANA timezone name.'),\n })\n .strict()\n .superRefine((clock, ctx) => {\n const fail = (message: string) => ctx.addIssue({ code: 'custom', message, path: ['on'] });\n if (clock.every === 'day' && clock.on !== undefined) fail('a daily clock takes no `on`');\n if (clock.every === 'week' && !(typeof clock.on === 'string' && WEEKDAYS.some((d) => d === clock.on)))\n fail('a weekly clock needs `on` as a weekday (mon..sun)');\n if (clock.every === 'month' && typeof clock.on !== 'number') fail('a monthly clock needs `on` as a day number');\n if (clock.every === 'year' && !(typeof clock.on === 'string' && MMDD.test(clock.on)))\n fail('a yearly clock needs `on` as \"MM-DD\"');\n })\n .describe('Repeats: fires on every day, week, month or year, at a time of day, until the reflex is removed.');\n\nexport const ClockOnceSchema = z\n .object({\n at: z.string().regex(LOCAL_DATETIME).describe('A fixed local date and time, once: \"YYYY-MM-DDTHH:MM\" or, to the second, \"YYYY-MM-DDTHH:MM:SS\".'),\n tz: z.string().describe('IANA timezone name.'),\n })\n .strict()\n .describe('Once: fires at one date and time, then never again.');\n\nexport const ClockTriggerSchema = z\n .object({ clock: z.union([ClockRecurringSchema, ClockOnceSchema]) })\n .strict()\n .describe('Fires on the calendar: once, at a date and time, or repeating at a time of day.');\n\nexport const OpSchema = z.enum(['insert', 'update', 'delete']);\n\nexport const WriteTriggerSchema = z\n .object({\n fact: z\n .object({\n entity: z.string().describe('The table or entity whose writes wake this reflex.'),\n op: OpSchema.optional().describe('Narrow to one op — \"only on create\" is op: \"insert\".'),\n })\n .strict(),\n })\n .strict()\n .describe('Fires when a row of an entity is written — created, changed or deleted.');\n\nexport const SignalTriggerSchema = z\n .object({ fact: z.object({ signal: z.string().describe('A named external intake.') }).strict() })\n .strict()\n .describe('Fires when an event arrives from outside, on a named intake.');\n\nexport const RunTriggerSchema = z\n .object({\n fact: z\n .object({ run: z.string().describe('A reflex id — fires when THAT reflex\\'s run settles. Fan-in and dependency.') })\n .strict(),\n })\n .strict()\n .describe('Fires when another reflex has run: one automation after another.');\n\n// There is NO poll trigger, and the absence is a decision. Polls existed\n// for hosts with no write choke point — run a selection, diff a cursor,\n// mint write facts for the delta. In this stack the host's DAL IS the\n// choke point: every application write becomes a fact at the vex bridge,\n// so a poll could only ever re-discover what was already pushed, one\n// interval late. An external source with no choke point enters through an\n// importer that ingests write facts at the door — the same shape, without\n// a reflex secretly re-querying.\nexport const ManualTriggerSchema = z\n .object({ manual: z.object({}).strict() })\n .strict()\n .describe('Fires only when somebody fires it by hand.');\n\nexport const TriggerSchema = z.union([\n ClockTriggerSchema,\n WriteTriggerSchema,\n SignalTriggerSchema,\n RunTriggerSchema,\n ManualTriggerSchema,\n]);\n\nexport type ClockRecurring = z.infer<typeof ClockRecurringSchema>;\nexport type ClockOnce = z.infer<typeof ClockOnceSchema>;\nexport type Clock = ClockRecurring | ClockOnce;\nexport type Trigger = z.infer<typeof TriggerSchema>;\nexport type Op = z.infer<typeof OpSchema>;\nexport type Weekday = (typeof WEEKDAYS)[number];\n\n// ── narrowing helpers: the union is structural, so every consumer\n// would otherwise re-derive these three checks ───────────────────\n\nexport const clockOf = (trigger: Trigger): Clock | undefined => ('clock' in trigger ? trigger.clock : undefined);\n\nexport const isRecurring = (clock: Clock): clock is ClockRecurring => 'every' in clock;\n\nexport const factOf = (\n trigger: Trigger,\n): { entity?: string; op?: Op; signal?: string; run?: string } | undefined =>\n 'fact' in trigger ? trigger.fact : undefined;\n\nexport const isManual = (trigger: Trigger): boolean => 'manual' in trigger;\n","import { z } from 'zod';\nimport { OpSchema } from './trigger.schema';\n\n// ═══════════════════════════════════════════════════════════════\n// Fact — the public intake contract.\n//\n// Tide's whole ingestion surface. Anything that can produce this\n// shape can drive tide; nothing else about the producer is tide's\n// business. A host that sees its own writes pushes them — the vex\n// bridge is that host. Either way, what arrives is this.\n// ═══════════════════════════════════════════════════════════════\n\nexport const FactKindSchema = z.enum(['write', 'signal', 'manual', 'run']);\n\nexport const FactInputSchema = z\n .object({\n kind: FactKindSchema,\n\n // write facts\n entity: z.string().optional().describe('Which table or entity was written.'),\n op: OpSchema.optional().describe('Ops are distinct stimuli — \"only on create\" is op: \"insert\".'),\n row: z.record(z.string(), z.unknown()).optional().describe('The row, as the write returned it.'),\n\n // signal facts\n name: z.string().optional().describe('Which named intake this arrived on.'),\n payload: z.unknown().optional().describe('The event body — validated at the HOST boundary before it gets here.'),\n\n // run facts (minted by tide when a run settles — the fan-in mechanism)\n reflex: z.string().optional(),\n runId: z.string().optional(),\n occurrence: z.string().optional().describe('The calendar key, when the clock was the cause.'),\n stats: z\n .object({ total: z.number().int(), done: z.number().int(), failed: z.number().int() })\n .strict()\n .optional(),\n\n // manual facts (minted by `fire`)\n target: z.string().optional().describe('The one reflex a manual fact is aimed at.'),\n by: z.string().optional().describe('Who fired it — recorded on the firing as manual:<who>.'),\n\n at: z.number().int().describe('Supplied by the caller. Tide reads no clocks.'),\n notBefore: z.number().int().optional().describe('A delayed fact — timers as data, visible and queryable.'),\n dedupeKey: z.string().optional().describe('Provider event ids. A repeat is refused and announced as fact.deduped; it is not an error.'),\n cause: z.string().optional().describe('Set by tide when an effect emits — the causality chain.'),\n })\n .strict()\n // THE UNION IS ENFORCED, because an unenforced one is worse than none.\n //\n // `{ kind: 'write' }` with no entity used to parse, store, match nothing,\n // get marked delivered, and vanish — the producer had no way to learn its\n // fact was never going to wake anything. Each kind names the fields that\n // make it addressable, and a fact that cannot be addressed is refused at\n // the intake rather than swallowed by the matcher.\n .superRefine((fact, ctx) => {\n const require = (field: keyof typeof fact, why: string) => {\n if (fact[field] === undefined)\n ctx.addIssue({ code: 'custom', message: `a ${fact.kind} fact needs \\`${String(field)}\\` — ${why}`, path: [field] });\n };\n const refuse = (field: keyof typeof fact) => {\n if (fact[field] !== undefined)\n ctx.addIssue({ code: 'custom', message: `\\`${String(field)}\\` is not part of a ${fact.kind} fact`, path: [field] });\n };\n\n if (fact.kind === 'write') {\n require('entity', 'it is what a write trigger matches on');\n refuse('name');\n refuse('target');\n refuse('runId');\n }\n if (fact.kind === 'signal') {\n require('name', 'it is which named intake this arrived on');\n refuse('entity');\n refuse('op');\n refuse('target');\n refuse('runId');\n }\n if (fact.kind === 'manual') {\n require('target', 'a manual fact is aimed at exactly one reflex');\n refuse('entity');\n refuse('name');\n refuse('runId');\n }\n if (fact.kind === 'run') {\n require('reflex', 'it is whose run settled');\n require('runId', 'it is which run settled');\n refuse('entity');\n refuse('name');\n refuse('target');\n }\n });\n\nexport type FactInput = z.infer<typeof FactInputSchema>;\nexport type FactKind = z.infer<typeof FactKindSchema>;\n","import { z } from 'zod';\nimport { FactKindSchema, OpSchema } from '../../schemas';\nimport type { TableName, TideTables } from '../../types';\n\nexport const SQL_TABLE: Record<TableName, string> = {\n fact: 'tide_fact',\n run: 'tide_run',\n task: 'tide_work',\n state: 'tide_reflex_state',\n};\n\n// `as` is an SQL keyword: the one field whose column is named otherwise.\nconst COLUMN_OVERRIDES: Record<string, string> = { as: 'as_who' };\n\nexport const snake = (field: string): string => COLUMN_OVERRIDES[field] ?? field.replace(/[A-Z]/g, (c) => `_${c.toLowerCase()}`);\n\nconst camel = (column: string): string => {\n for (const [field, mapped] of Object.entries(COLUMN_OVERRIDES)) if (mapped === column) return field;\n return column.replace(/_([a-z])/g, (_all, c: string) => c.toUpperCase());\n};\n\nconst JSON_COLUMNS = new Set(['row', 'payload', 'stats', 'fact_ids', 'env', 'input', 'output']);\nconst BIGINT_COLUMNS = new Set([\n 'at',\n 'not_before',\n 'delivered_at',\n 'depth',\n 'descendants',\n 'due_at',\n 'created_at',\n 'settled_at',\n 'claimed_until',\n 'armed_at',\n 'materialized_through',\n 'attempt',\n 'selected',\n 'total',\n 'done',\n 'failed',\n]);\n\nexport const toColumn = (column: string, value: unknown): unknown => {\n if (value === undefined) return null;\n if (JSON_COLUMNS.has(column)) return JSON.stringify(value);\n return value;\n};\n\nconst fromColumn = (column: string, value: unknown): unknown => {\n if (value === null) return undefined;\n if (JSON_COLUMNS.has(column)) return typeof value === 'string' ? JSON.parse(value) : value;\n // `bigint` comes back as a string on some drivers and a number on others.\n // Tide compares these with `<`, so the difference is not cosmetic.\n if (BIGINT_COLUMNS.has(column)) return Number(value);\n return value;\n};\n\nconst FactRowSchema = z.object({\n id: z.string(),\n kind: FactKindSchema,\n entity: z.string().optional(),\n op: OpSchema.optional(),\n row: z.record(z.string(), z.unknown()).optional(),\n name: z.string().optional(),\n payload: z.unknown().optional(),\n reflex: z.string().optional(),\n runId: z.string().optional(),\n occurrence: z.string().optional(),\n stats: z.object({ total: z.number(), done: z.number(), failed: z.number() }).optional(),\n target: z.string().optional(),\n by: z.string().optional(),\n at: z.number(),\n notBefore: z.number().optional(),\n dedupeKey: z.string().optional(),\n cause: z.string().optional(),\n depth: z.number(),\n deliveredAt: z.number().optional(),\n parked: z.string().optional(),\n released: z.boolean().optional(),\n as: z.string().optional(),\n root: z.string().optional(),\n descendants: z.number().optional(),\n});\n\nconst RunRowSchema = z.object({\n id: z.string(),\n reflexId: z.string(),\n version: z.string(),\n as: z.string().optional(),\n cause: z.string(),\n occurrence: z.string().optional(),\n factIds: z.array(z.string()).optional(),\n state: z.enum(['pending', 'fanned', 'settled', 'skipped']),\n depth: z.number(),\n selected: z.number().optional(),\n total: z.number(),\n done: z.number(),\n failed: z.number(),\n dueAt: z.number(),\n createdAt: z.number(),\n settledAt: z.number().optional(),\n drained: z.boolean().optional(),\n note: z.string().optional(),\n});\n\nconst TaskRowSchema = z.object({\n id: z.string(),\n runId: z.string(),\n reflexId: z.string(),\n unit: z.string(),\n cause: z.string(),\n env: z.record(z.string(), z.unknown()),\n depth: z.number(),\n state: z.enum(['pending', 'claimed', 'retrying', 'done', 'failed']),\n attempt: z.number(),\n token: z.string().optional(),\n claimedUntil: z.number(),\n notBefore: z.number(),\n input: z.unknown().optional(),\n output: z.unknown().optional(),\n error: z.string().optional(),\n createdAt: z.number(),\n settledAt: z.number().optional(),\n});\n\nconst StateRowSchema = z.object({\n reflexId: z.string(),\n armedAt: z.number(),\n materializedThrough: z.number().optional(),\n});\n\nconst ROW_SCHEMAS: { [T in TableName]: z.ZodType<TideTables[T]> } = {\n fact: FactRowSchema,\n run: RunRowSchema,\n task: TaskRowSchema,\n state: StateRowSchema,\n};\n\nexport const rowToEntity = <T extends TableName>(table: T, row: Record<string, unknown>): TideTables[T] => {\n const entity: Record<string, unknown> = {};\n for (const [column, value] of Object.entries(row)) {\n const mapped = fromColumn(column, value);\n if (mapped !== undefined) entity[camel(column)] = mapped;\n }\n const read = ROW_SCHEMAS[table].safeParse(entity);\n if (!read.success) {\n const misfits = read.error.issues.map((issue) => `${issue.path.join('.')}: ${issue.message}`).join('; ');\n throw new Error(`tide store: a row of ${SQL_TABLE[table]} does not read as a ${table} (${misfits})`);\n }\n return read.data;\n};\n","import { z } from 'zod';\nimport type { Comparison, Order } from '../../types';\nimport { snake, toColumn } from './rows';\n\nexport type Fields = Readonly<Record<string, unknown>>;\ntype Ordering = readonly { by: string; dir?: 'asc' | 'desc' }[];\n\nconst COMPARATORS = [\n ['eq', '='],\n ['ne', '<>'],\n ['lt', '<'],\n ['lte', '<='],\n ['gt', '>'],\n ['gte', '>='],\n] as const;\n\nconst ComparisonSchema = z.object({\n eq: z.unknown().optional(),\n ne: z.unknown().optional(),\n lt: z.unknown().optional(),\n lte: z.unknown().optional(),\n gt: z.unknown().optional(),\n gte: z.unknown().optional(),\n in: z.array(z.unknown()).readonly().optional(),\n notIn: z.array(z.unknown()).readonly().optional(),\n isNull: z.boolean().optional(),\n}) satisfies z.ZodType<Comparison<unknown>>;\n\nconst comparisonOn = (field: string, test: object): Comparison<unknown> => {\n const read = ComparisonSchema.safeParse(test);\n if (read.success) return read.data;\n const misfits = read.error.issues.map((issue) => `${issue.path.join('.')}: ${issue.message}`).join('; ');\n throw new Error(`tide store: what \"${field}\" is compared with does not read as a comparison (${misfits})`);\n};\n\ntype Bind = { sql: string; params: unknown[] };\n\nexport const compileWhere = (where: Fields | undefined, start: number, alias = ''): Bind => {\n const clauses: string[] = [];\n const params: unknown[] = [];\n const prefix = alias === '' ? '' : `${alias}.`;\n const slot = (value: unknown): string => {\n params.push(value);\n return `$${start + params.length - 1}`;\n };\n\n for (const [field, test] of Object.entries(where ?? {})) {\n const column = `${prefix}${snake(field)}`;\n const bare = snake(field);\n if (test === null || typeof test !== 'object' || Array.isArray(test)) {\n // An equality on `undefined` means IS NULL, which is what the engine\n // means when it filters on a column it just cleared.\n clauses.push(test === undefined ? `${column} IS NULL` : `${column} = ${slot(toColumn(bare, test))}`);\n continue;\n }\n\n const comparison = comparisonOn(field, test);\n for (const [op, symbol] of COMPARATORS) {\n const operand = comparison[op];\n if (operand === undefined) continue;\n // `ne` must be true for a NULL column: a run that has never been\n // drained is not drained, and plain SQL `<>` answers NULL there.\n clauses.push(op === 'ne' ? `(${column} IS NULL OR ${column} <> ${slot(toColumn(bare, operand))})` : `${column} ${symbol} ${slot(toColumn(bare, operand))}`);\n }\n if (comparison.in !== undefined) clauses.push(`${column} = ANY(${slot(comparison.in.map((value) => toColumn(bare, value)))})`);\n if (comparison.notIn !== undefined) clauses.push(`NOT (${column} = ANY(${slot(comparison.notIn.map((value) => toColumn(bare, value)))}))`);\n if (comparison.isNull !== undefined) clauses.push(comparison.isNull ? `${column} IS NULL` : `${column} IS NOT NULL`);\n }\n\n return { sql: clauses.length === 0 ? 'TRUE' : clauses.join(' AND '), params };\n};\n\nexport const compileOrder = (order: Ordering | undefined, alias = ''): string => {\n if (order === undefined || order.length === 0) return '';\n const prefix = alias === '' ? '' : `${alias}.`;\n return ` ORDER BY ${order.map((key) => `${prefix}${snake(key.by)} ${key.dir === 'desc' ? 'DESC' : 'ASC'}`).join(', ')}`;\n};\n\nexport const sortRows = <R>(rows: readonly R[], order: Order<R> | undefined): R[] => {\n if (order === undefined || order.length === 0) return [...rows];\n return [...rows].sort((left, right) => {\n for (const key of order) {\n const a: unknown = left[key.by];\n const b: unknown = right[key.by];\n const compared = typeof a === 'number' && typeof b === 'number' ? a - b : String(a) < String(b) ? -1 : String(a) > String(b) ? 1 : 0;\n if (compared !== 0) return compared * (key.dir === 'desc' ? -1 : 1);\n }\n return 0;\n });\n};\n\nexport const compileSet = (set: Fields, start: number): Bind => {\n const assignments: string[] = [];\n const params: unknown[] = [];\n for (const [field, value] of Object.entries(set)) {\n const column = snake(field);\n if (value !== null && typeof value === 'object' && 'inc' in value) {\n // Column arithmetic, so two settling tasks cannot lose an increment\n // between a read and a write.\n assignments.push(`${column} = coalesce(${column}, 0) + ${Number(value.inc)}`);\n continue;\n }\n params.push(toColumn(column, value));\n assignments.push(`${column} = $${start + params.length - 1}`);\n }\n return { sql: assignments.join(', '), params };\n};\n","import type { ClaimSpec, TableName, TideStore } from '../../types';\nimport { compileOrder, compileSet, compileWhere, sortRows } from './compile';\nimport type { Fields } from './compile';\nimport type { Atomically, Client } from './pool';\nimport { SQL_TABLE, rowToEntity, snake } from './rows';\n\ntype ClaimParts = { client: Client; atomically: Atomically; ready: Promise<void> };\n\nexport const claimOver =\n ({ client, atomically, ready }: ClaimParts): TideStore['claim'] =>\n async <T extends TableName>(spec: ClaimSpec<T>) => {\n await ready;\n const table = SQL_TABLE[spec.table];\n const order = compileOrder(spec.order, 'c');\n\n const take =async (db: Client, extra: Fields, limit: number) => {\n if (limit <= 0) return [];\n const where = compileWhere({ ...spec.where, ...extra }, 1, 'c');\n const set = compileSet(spec.set, where.params.length + 1);\n const result = await db.query(\n `UPDATE ${table} SET ${set.sql}\n WHERE ctid IN (\n SELECT c.ctid FROM ${table} c WHERE ${where.sql}${order}\n LIMIT ${Math.floor(limit)} FOR UPDATE SKIP LOCKED\n )\n RETURNING *`,\n [...where.params, ...set.params],\n );\n // ORDER BY inside the subquery decides which rows are taken, not the order RETURNING hands them\n // back, and the engine runs tasks in the order a claim returns them: re-sorted, a fan-out runs\n // in insertion order here as it does in memory.\n return sortRows(result.rows.map((row) => rowToEntity(spec.table, row)), spec.order);\n };\n\n if (spec.onePer === undefined) return take(client, {}, spec.limit);\n\n // At most one held row per group, counting what an earlier claim already holds. Postgres refuses\n // a window function beside FOR UPDATE, so the restricted groups are claimed one at a time. Asking\n // whether a group is held and then claiming in it are two statements: they run in a transaction\n // behind an advisory lock on the group, because under READ COMMITTED two instances would both be\n // told nothing is held. Whoever does not get the lock leaves the group, as SKIP LOCKED leaves a\n // row.\n const { column, held, only } = spec.onePer;\n const restricted = [...only];\n // Room is reserved for the serial groups before the bulk claim, or a busy parallel reflex starves them.\n const claimed = await take(client, { [column]: { notIn: restricted } }, spec.limit - restricted.length);\n\n const takeOneOf = (group: string) =>\n atomically(async (tx) => {\n const lock = await tx.query('SELECT pg_try_advisory_xact_lock(hashtext($1), hashtext($2)) AS free', [`tide:${table}.${snake(column)}`, group]);\n if (lock.rows[0]?.['free'] !== true) return [];\n const busy = compileWhere({ ...held, [column]: group }, 1, 'c');\n const taken = await tx.query(`SELECT c.id FROM ${table} c WHERE ${busy.sql} LIMIT 1`, busy.params);\n if (taken.rows.length > 0) return [];\n return take(tx, { [column]: group }, 1);\n });\n\n for (const group of restricted) {\n if (claimed.length >= spec.limit) break;\n claimed.push(...(await takeOneOf(group)));\n }\n\n return claimed;\n };\n","import type { Sequence } from '@niscorp/strata';\n\nexport const TIDE_TABLES = ['tide_fact', 'tide_run', 'tide_work', 'tide_reflex_state'] as const;\n\n// Migration 1 of `nisc.moss.tide`: databases have run it, and editing it makes every one of them\n// refuse to boot (strata: EDITED). Change the tables by appending a migration to the sequence.\nexport const TIDE_DDL = `\nCREATE TABLE IF NOT EXISTS tide_fact (\n id text PRIMARY KEY,\n kind text NOT NULL CHECK (kind IN ('write','signal','manual','run')),\n entity text,\n op text CHECK (op IN ('insert','update','delete')),\n row jsonb,\n name text,\n payload jsonb,\n reflex text,\n run_id text,\n occurrence text,\n stats jsonb,\n target text,\n by text,\n at bigint NOT NULL,\n not_before bigint,\n dedupe_key text,\n cause text,\n depth integer NOT NULL DEFAULT 0,\n delivered_at bigint,\n parked text,\n released boolean,\n -- WHOSE FACT THIS IS. The identity of the reflex that minted it, absent on\n -- anything the host ingested. The matcher refuses to hand a fact minted\n -- under one identity to a reflex running under another, which is the only\n -- thing standing between a carried row and somebody else's effect — tide is\n -- the one place a row travels without being read, so no scope policy is\n -- consulted on the way.\n as_who text\n);\n\n-- A PARTIAL index, because a fact with no dedupeKey is not claiming to be\n-- unique: it is a distinct occurrence of something, not a repeat of it.\n-- entity is in the key: without it, two producers over different tables\n-- that agreed on a key value silently ate each other's rows.\nCREATE UNIQUE INDEX IF NOT EXISTS tide_fact_dedupe\n ON tide_fact (kind, coalesce(entity,''), coalesce(name,''), dedupe_key)\n WHERE dedupe_key IS NOT NULL;\n\n-- The matcher's query, every advance.\nCREATE INDEX IF NOT EXISTS tide_fact_due\n ON tide_fact (at) WHERE delivered_at IS NULL AND parked IS NULL;\nCREATE INDEX IF NOT EXISTS tide_fact_swept ON tide_fact (delivered_at);\n\nCREATE TABLE IF NOT EXISTS tide_run (\n id text PRIMARY KEY,\n reflex_id text NOT NULL,\n version text NOT NULL,\n as_who text,\n cause text NOT NULL,\n occurrence text,\n fact_ids jsonb,\n state text NOT NULL CHECK (state IN ('pending','fanned','settled','skipped')),\n depth integer NOT NULL DEFAULT 0,\n selected integer,\n total integer NOT NULL DEFAULT 0,\n done integer NOT NULL DEFAULT 0,\n failed integer NOT NULL DEFAULT 0,\n due_at bigint NOT NULL,\n created_at bigint NOT NULL,\n settled_at bigint,\n drained boolean,\n note text,\n -- THE IDEMPOTENCY. One constraint, every trigger kind: an occurrence\n -- cannot open twice, a replayed fact cannot open twice, and two instances\n -- ticking at the same moment contend instead of duplicating.\n UNIQUE (reflex_id, cause)\n);\n\nCREATE INDEX IF NOT EXISTS tide_run_pending ON tide_run (state, due_at);\nCREATE INDEX IF NOT EXISTS tide_run_ledger ON tide_run (reflex_id, created_at DESC);\nCREATE INDEX IF NOT EXISTS tide_run_swept ON tide_run (settled_at);\n\nCREATE TABLE IF NOT EXISTS tide_work (\n id text PRIMARY KEY,\n -- ON DELETE CASCADE, because a run and its work are one fact about the\n -- world. Sweeping runs and leaving work destroys the UNIQUE(run_id, unit)\n -- row that IS the \"this unit already ran\" record — and a restore then\n -- re-charges the invoice.\n run_id text NOT NULL REFERENCES tide_run(id) ON DELETE CASCADE,\n reflex_id text NOT NULL,\n unit text NOT NULL,\n cause text NOT NULL,\n env jsonb NOT NULL,\n depth integer NOT NULL DEFAULT 0,\n state text NOT NULL CHECK (state IN ('pending','claimed','retrying','done','failed')),\n attempt integer NOT NULL DEFAULT 0,\n token text,\n -- Zero, never null, when unclaimed: \"never claimed or lapsed\" is then one\n -- comparison rather than a disjunction.\n claimed_until bigint NOT NULL DEFAULT 0,\n not_before bigint NOT NULL,\n input jsonb,\n output jsonb,\n error text,\n created_at bigint NOT NULL,\n settled_at bigint,\n UNIQUE (run_id, unit)\n);\n\nCREATE INDEX IF NOT EXISTS tide_work_claimable ON tide_work (state, not_before, claimed_until);\nCREATE INDEX IF NOT EXISTS tide_work_run ON tide_work (run_id);\nCREATE INDEX IF NOT EXISTS tide_work_swept ON tide_work (settled_at);\n\nCREATE TABLE IF NOT EXISTS tide_reflex_state (\n reflex_id text PRIMARY KEY,\n armed_at bigint NOT NULL DEFAULT 0,\n materialized_through bigint\n);\n\n-- Polls are gone (the vex bridge pushes writes — a poll could only\n-- re-discover them late), and their cursor state goes with them. IF EXISTS,\n-- so a store created after the removal is not asked to drop what it never had.\nALTER TABLE tide_reflex_state DROP COLUMN IF EXISTS poll_cursor;\nALTER TABLE tide_reflex_state DROP COLUMN IF EXISTS poll_seen;\nALTER TABLE tide_reflex_state DROP COLUMN IF EXISTS polled_at;\n`;\n\n// Split on every `;`, for migration 1 only: a different split is a different history, and\n// this one's checksum is in every ledger. A new sequence uses strata's `sqlSteps`.\nconst statementsOf = (ddl: string): { kind: 'sql'; sql: string }[] =>\n ddl\n .split(';')\n .map((chunk) => chunk.trim())\n .filter((chunk) => chunk.split('\\n').some((line) => line.trim() !== '' && !line.trim().startsWith('--')))\n .map((sql) => ({ kind: 'sql', sql }));\n\n// The id says `moss` and stays: every ledger that has run this sequence holds its rows under it.\nexport const TIDE_SEQUENCE: Sequence = {\n id: 'nisc.moss.tide',\n migrations: [\n { description: 'The tide store: facts, runs, work and reflex state, converged from any earlier shape', steps: statementsOf(TIDE_DDL) },\n {\n description: 'A fact carries its chain root, and a root counts what its chain minted (tide maxChainFacts)',\n steps: [\n { kind: 'sql', sql: 'ALTER TABLE tide_fact ADD COLUMN IF NOT EXISTS root text' },\n { kind: 'sql', sql: 'ALTER TABLE tide_fact ADD COLUMN IF NOT EXISTS descendants integer' },\n ],\n },\n ],\n};\n","import { migrate as migrateLedger } from '@niscorp/strata/postgres';\nimport { PRIMARY_KEY, UNIQUE_BY } from '../../types';\nimport type { Mutation, QuerySpec, RemoveSpec, TableName, TideStore, TideTables, Where } from '../../types';\nimport { claimOver } from './claim';\nimport { compileOrder, compileSet, compileWhere } from './compile';\nimport type { Fields } from './compile';\nimport type { Atomically, Client, TidePool } from './pool';\nimport { SQL_TABLE, rowToEntity, snake, toColumn } from './rows';\nimport { TIDE_SEQUENCE } from './tables';\n\nconst mintId = ((): ((table: TableName) => string) => {\n let sequence = 0;\n return (table) => {\n sequence += 1;\n return `${table}_${Date.now().toString(36)}_${sequence.toString(36)}`;\n };\n})();\n\nexport type TideStoreOptions = {\n migrate?: boolean;\n};\n\nexport const createTideStore = (pool: TidePool, options: TideStoreOptions = {}): TideStore & { ready: Promise<void> } => {\n // Every method awaits this: on a real pool one that did not would race the DDL and throw `42P01 undefined_table`\n // inside a transaction, which the fan-out would turn into a permanently skipped run.\n const ready: Promise<void> = options.migrate === false ? Promise.resolve() : migrateLedger(pool, [TIDE_SEQUENCE]).then(() => undefined);\n // An unhandled rejection here is process-fatal on Node ≥ 15, and the\n // failure it reports would be a database that is not up yet.\n ready.catch(() => undefined);\n\n const overPool: Atomically = (fn) => {\n if (pool.transaction === undefined)\n throw new Error('tide store: this pool cannot transact — fan-out, attempt recording and a serial claim are transactions, not conventions');\n return pool.transaction(fn);\n };\n\n const build = (client: Client, atomically: Atomically): TideStore => {\n const store: TideStore = {\n query: async <T extends TableName>(spec: QuerySpec<T>) => {\n await ready;\n const where = compileWhere(spec.where, 1);\n const limit = spec.limit === undefined ? '' : ` LIMIT ${Math.max(0, Math.floor(spec.limit))}`;\n const result = await client.query(\n `SELECT * FROM ${SQL_TABLE[spec.table]} WHERE ${where.sql}${compileOrder(spec.order)}${limit}`,\n where.params,\n );\n return result.rows.map((row) => rowToEntity(spec.table, row));\n },\n\n // The refusal is the database's, decided under the constraint, not a read the caller races.\n appendIfAbsent: async <T extends TableName>(table: T, input: Omit<TideTables[T], 'id'> & { id?: string }) => {\n await ready;\n const given: Fields = input;\n const withId: Fields = PRIMARY_KEY[table] === 'id' ? { ...given, id: input.id ?? mintId(table) } : given;\n const entries = Object.entries(withId).filter(([, value]) => value !== undefined);\n const columns = entries.map(([field]) => snake(field));\n const params = entries.map(([field, value]) => toColumn(snake(field), value));\n\n const unique = UNIQUE_BY[table];\n const target =\n unique.when === undefined\n ? `(${unique.by.map((column) => snake(column)).join(', ')})`\n : `(${unique.by.map((column) => (column === 'entity' || column === 'name' ? `coalesce(${snake(column)},'')` : snake(column))).join(', ')}) WHERE ${snake(unique.when)} IS NOT NULL`;\n\n const result = await client.query(\n `INSERT INTO ${SQL_TABLE[table]} (${columns.join(', ')}) VALUES (${params.map((_value, index) => `$${index + 1}`).join(', ')})\n ON CONFLICT ${target} DO NOTHING RETURNING *`,\n params,\n );\n const row = result.rows[0];\n return row === undefined ? undefined : rowToEntity(table, row);\n },\n\n claim: claimOver({ client, atomically, ready }),\n\n cas: async <T extends TableName>(table: T, id: string, expect: Where<TideTables[T]>, set: Mutation<TideTables[T]>) => {\n await ready;\n const key = snake(PRIMARY_KEY[table]);\n const where = compileWhere(expect, 2);\n const patch = compileSet(set, where.params.length + 2);\n const result = await client.query(\n `UPDATE ${SQL_TABLE[table]} SET ${patch.sql} WHERE ${key} = $1 AND ${where.sql} RETURNING ${key}`,\n [id, ...where.params, ...patch.params],\n );\n return result.rows.length > 0;\n },\n\n remove: async <T extends TableName>(spec: RemoveSpec<T>) => {\n await ready;\n const where = compileWhere(spec.where, 1);\n // Work goes with its run through the foreign key, not through a\n // second statement somebody can forget.\n const result = await client.query(`DELETE FROM ${SQL_TABLE[spec.table]} WHERE ${where.sql} RETURNING ${snake(PRIMARY_KEY[spec.table])}`, where.params);\n return result.rows.length;\n },\n\n transact: async <T>(fn: (tx: TideStore) => Promise<T>): Promise<T> => {\n await ready;\n // Steps this store runs as one (`atomically`) run inside this transaction; none opens a second one.\n return atomically((tx) => fn(build(tx, (inner) => inner(tx))));\n },\n };\n return store;\n };\n\n return { ...build(pool, overPool), ready };\n};\n"]}
1
+ {"version":3,"sources":["../src/types.ts","../src/schemas/trigger.schema.ts","../src/schemas/fact.schema.ts","../src/store/postgres/rows.ts","../src/store/postgres/compile.ts","../src/store/postgres/claim.ts","../src/store/postgres/tables.ts","../src/store/postgres/store.ts"],"names":["z","require","migrateLedger"],"mappings":";;;;;;;;AA8LO,IAAM,WAAA,GAAkE;AAAA,EAC7E,IAAA,EAAM,IAAA;AAAA,EACN,GAAA,EAAK,IAAA;AAAA,EACL,IAAA,EAAM,IAAA;AAAA,EACN,KAAA,EAAO;AACT,CAAA;AASO,IAAM,SAAA,GAAgD;AAAA;AAAA,EAE3D,IAAA,EAAM,EAAE,EAAA,EAAI,CAAC,MAAA,EAAQ,UAAU,MAAA,EAAQ,WAAW,CAAA,EAAG,IAAA,EAAM,WAAA,EAAY;AAAA,EACvE,KAAK,EAAE,EAAA,EAAI,CAAC,UAAA,EAAY,OAAO,CAAA,EAAE;AAAA,EACjC,MAAM,EAAE,EAAA,EAAI,CAAC,OAAA,EAAS,MAAM,CAAA,EAAE;AAAA,EAC9B,KAAA,EAAO,EAAE,EAAA,EAAI,CAAC,UAAU,CAAA;AAC1B,CAAA;AChNO,IAAM,QAAA,GAAW,CAAC,KAAA,EAAO,KAAA,EAAO,OAAO,KAAA,EAAO,KAAA,EAAO,OAAO,KAAK,CAAA;AAExE,IAAM,IAAA,GAAO,2BAAA;AACb,IAAM,IAAA,GAAO,yCAAA;AACb,IAAM,cAAA,GAAiB,wDAAA;AAEhB,IAAM,eAAA,GAAkBA,MAAE,IAAA,CAAK,CAAC,OAAO,MAAA,EAAQ,OAAA,EAAS,MAAM,CAAC,CAAA;AAE/D,IAAM,oBAAA,GAAuBA,MACjC,MAAA,CAAO;AAAA,EACN,KAAA,EAAO,eAAA,CAAgB,QAAA,CAAS,6JAAwJ,CAAA;AAAA,EACxL,EAAA,EAAIA,KAAA,CACD,KAAA,CAAM,CAACA,KAAA,CAAE,MAAA,EAAO,CAAE,GAAA,EAAI,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,IAAI,EAAE,CAAA,EAAGA,KAAA,CAAE,IAAA,CAAK,QAAQ,CAAA,EAAGA,KAAA,CAAE,MAAA,EAAO,CAAE,KAAA,CAAM,IAAI,CAAC,CAAC,CAAA,CACjF,QAAA,EAAS,CACT,SAAS,yGAA0F,CAAA;AAAA,EACtG,EAAA,EAAIA,MAAE,MAAA,EAAO,CAAE,MAAM,IAAI,CAAA,CAAE,SAAS,iCAAiC,CAAA;AAAA,EACrE,EAAA,EAAIA,KAAA,CAAE,MAAA,EAAO,CAAE,SAAS,qBAAqB;AAC/C,CAAC,EACA,MAAA,EAAO,CACP,WAAA,CAAY,CAAC,OAAO,GAAA,KAAQ;AAC3B,EAAA,MAAM,IAAA,GAAO,CAAC,OAAA,KAAoB,GAAA,CAAI,QAAA,CAAS,EAAE,IAAA,EAAM,QAAA,EAAU,OAAA,EAAS,IAAA,EAAM,CAAC,IAAI,GAAG,CAAA;AACxF,EAAA,IAAI,MAAM,KAAA,KAAU,KAAA,IAAS,MAAM,EAAA,KAAO,MAAA,OAAgB,6BAA6B,CAAA;AACvF,EAAA,IAAI,KAAA,CAAM,KAAA,KAAU,MAAA,IAAU,EAAE,OAAO,KAAA,CAAM,EAAA,KAAO,QAAA,IAAY,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,KAAM,MAAM,EAAE,CAAA,CAAA;AACjG,IAAA,IAAA,CAAK,mDAAmD,CAAA;AAC1D,EAAA,IAAI,KAAA,CAAM,UAAU,OAAA,IAAW,OAAO,MAAM,EAAA,KAAO,QAAA,OAAe,4CAA4C,CAAA;AAC9G,EAAA,IAAI,KAAA,CAAM,KAAA,KAAU,MAAA,IAAU,EAAE,OAAO,KAAA,CAAM,EAAA,KAAO,QAAA,IAAY,IAAA,CAAK,IAAA,CAAK,KAAA,CAAM,EAAE,CAAA,CAAA;AAChF,IAAA,IAAA,CAAK,sCAAsC,CAAA;AAC/C,CAAC,CAAA,CACA,SAAS,kGAAkG,CAAA;AAEvG,IAAM,eAAA,GAAkBA,MAC5B,MAAA,CAAO;AAAA,EACN,EAAA,EAAIA,MAAE,MAAA,EAAO,CAAE,MAAM,cAAc,CAAA,CAAE,SAAS,iGAAiG,CAAA;AAAA,EAC/I,EAAA,EAAIA,KAAA,CAAE,MAAA,EAAO,CAAE,SAAS,qBAAqB;AAC/C,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,qDAAqD,CAAA;AAE1D,IAAM,qBAAqBA,KAAA,CAC/B,MAAA,CAAO,EAAE,KAAA,EAAOA,MAAE,KAAA,CAAM,CAAC,oBAAA,EAAsB,eAAe,CAAC,CAAA,EAAG,EAClE,MAAA,EAAO,CACP,SAAS,iFAAiF,CAAA;AAEtF,IAAM,WAAWA,KAAA,CAAE,IAAA,CAAK,CAAC,QAAA,EAAU,QAAA,EAAU,QAAQ,CAAC,CAAA;AAEtD,IAAM,kBAAA,GAAqBA,MAC/B,MAAA,CAAO;AAAA,EACN,IAAA,EAAMA,MACH,MAAA,CAAO;AAAA,IACN,MAAA,EAAQA,KAAA,CAAE,MAAA,EAAO,CAAE,SAAS,oDAAoD,CAAA;AAAA,IAChF,EAAA,EAAI,QAAA,CAAS,QAAA,EAAS,CAAE,SAAS,2DAAsD;AAAA,GACxF,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,8EAAyE,CAAA;AAE9E,IAAM,mBAAA,GAAsBA,KAAA,CAChC,MAAA,CAAO,EAAE,IAAA,EAAMA,MAAE,MAAA,CAAO,EAAE,MAAA,EAAQA,KAAA,CAAE,MAAA,EAAO,CAAE,SAAS,0BAA0B,CAAA,EAAG,CAAA,CAAE,MAAA,EAAO,EAAG,CAAA,CAC/F,MAAA,EAAO,CACP,QAAA,CAAS,8DAA8D,CAAA;AAEnE,IAAM,gBAAA,GAAmBA,MAC7B,MAAA,CAAO;AAAA,EACN,IAAA,EAAMA,KAAA,CACH,MAAA,CAAO,EAAE,GAAA,EAAKA,KAAA,CAAE,MAAA,EAAO,CAAE,QAAA,CAAS,iFAA6E,CAAA,EAAG,EAClH,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,kEAAkE,CAAA;AAEvE,IAAM,sBAAsBA,KAAA,CAChC,MAAA,CAAO,EAAE,MAAA,EAAQA,MAAE,MAAA,CAAO,EAAE,CAAA,CAAE,QAAO,EAAG,EACxC,MAAA,EAAO,CACP,SAAS,4CAA4C,CAAA;AAE3BA,MAAE,KAAA,CAAM;AAAA,EACnC,kBAAA;AAAA,EACA,kBAAA;AAAA,EACA,mBAAA;AAAA,EACA,gBAAA;AAAA,EACA;AACF,CAAC;ACjFM,IAAM,cAAA,GAAiBA,MAAE,IAAA,CAAK,CAAC,SAAS,QAAA,EAAU,QAAA,EAAU,KAAK,CAAC,CAAA;AAE1CA,MAC5B,MAAA,CAAO;AAAA,EACN,IAAA,EAAM,cAAA;AAAA,EAEN,QAAQA,KAAAA,CAAE,MAAA,GAAS,QAAA,EAAS,CAAE,SAAS,oCAAoC,CAAA;AAAA,EAC3E,EAAA,EAAI,QAAA,CAAS,QAAA,EAAS,CAAE,SAAS,mEAA8D,CAAA;AAAA,EAC/F,GAAA,EAAKA,KAAAA,CAAE,MAAA,CAAOA,KAAAA,CAAE,MAAA,EAAO,EAAGA,KAAAA,CAAE,OAAA,EAAS,CAAA,CAAE,QAAA,EAAS,CAAE,SAAS,oCAAoC,CAAA;AAAA,EAE/F,MAAMA,KAAAA,CAAE,MAAA,GAAS,QAAA,EAAS,CAAE,SAAS,qCAAqC,CAAA;AAAA,EAC1E,SAASA,KAAAA,CAAE,OAAA,GAAU,QAAA,EAAS,CAAE,SAAS,2EAAsE,CAAA;AAAA,EAE/G,MAAA,EAAQA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC5B,KAAA,EAAOA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC3B,YAAYA,KAAAA,CAAE,MAAA,GAAS,QAAA,EAAS,CAAE,SAAS,iDAAiD,CAAA;AAAA,EAC5F,KAAA,EAAOA,KAAAA,CACJ,MAAA,CAAO,EAAE,KAAA,EAAOA,KAAAA,CAAE,MAAA,EAAO,CAAE,GAAA,EAAI,EAAG,IAAA,EAAMA,KAAAA,CAAE,MAAA,GAAS,GAAA,EAAI,EAAG,MAAA,EAAQA,KAAAA,CAAE,MAAA,EAAO,CAAE,GAAA,EAAI,EAAG,CAAA,CACpF,MAAA,EAAO,CACP,QAAA,EAAS;AAAA,EAEZ,QAAQA,KAAAA,CAAE,MAAA,GAAS,QAAA,EAAS,CAAE,SAAS,2CAA2C,CAAA;AAAA,EAClF,IAAIA,KAAAA,CAAE,MAAA,GAAS,QAAA,EAAS,CAAE,SAAS,6DAAwD,CAAA;AAAA,EAE3F,IAAIA,KAAAA,CAAE,MAAA,GAAS,GAAA,EAAI,CAAE,SAAS,+CAA+C,CAAA;AAAA,EAC7E,SAAA,EAAWA,MAAE,MAAA,EAAO,CAAE,KAAI,CAAE,QAAA,EAAS,CAAE,QAAA,CAAS,8DAAyD,CAAA;AAAA,EACzG,WAAWA,KAAAA,CAAE,MAAA,GAAS,QAAA,EAAS,CAAE,SAAS,4FAA4F,CAAA;AAAA,EACtI,OAAOA,KAAAA,CAAE,MAAA,GAAS,QAAA,EAAS,CAAE,SAAS,8DAAyD;AACjG,CAAC,EACA,MAAA,EAAO,CACP,WAAA,CAAY,CAAC,MAAM,GAAA,KAAQ;AAC1B,EAAA,MAAMC,QAAAA,GAAU,CAAC,KAAA,EAA0B,GAAA,KAAgB;AACzD,IAAA,IAAI,IAAA,CAAK,KAAK,CAAA,KAAM,MAAA;AAClB,MAAA,GAAA,CAAI,SAAS,EAAE,IAAA,EAAM,UAAU,OAAA,EAAS,CAAA,EAAA,EAAK,KAAK,IAAI,CAAA,cAAA,EAAiB,OAAO,KAAK,CAAC,aAAQ,GAAG,CAAA,CAAA,EAAI,MAAM,CAAC,KAAK,GAAG,CAAA;AAAA,EACtH,CAAA;AACA,EAAA,MAAM,MAAA,GAAS,CAAC,KAAA,KAA6B;AAC3C,IAAA,IAAI,IAAA,CAAK,KAAK,CAAA,KAAM,MAAA;AAClB,MAAA,GAAA,CAAI,SAAS,EAAE,IAAA,EAAM,QAAA,EAAU,OAAA,EAAS,KAAK,MAAA,CAAO,KAAK,CAAC,CAAA,oBAAA,EAAuB,KAAK,IAAI,CAAA,KAAA,CAAA,EAAS,MAAM,CAAC,KAAK,GAAG,CAAA;AAAA,EACtH,CAAA;AAEA,EAAA,IAAI,IAAA,CAAK,SAAS,OAAA,EAAS;AACzB,IAAAA,QAAAA,CAAQ,UAAU,uCAAuC,CAAA;AACzD,IAAA,MAAA,CAAO,MAAM,CAAA;AACb,IAAA,MAAA,CAAO,QAAQ,CAAA;AACf,IAAA,MAAA,CAAO,OAAO,CAAA;AAAA,EAChB;AACA,EAAA,IAAI,IAAA,CAAK,SAAS,QAAA,EAAU;AAC1B,IAAAA,QAAAA,CAAQ,QAAQ,0CAA0C,CAAA;AAC1D,IAAA,MAAA,CAAO,QAAQ,CAAA;AACf,IAAA,MAAA,CAAO,IAAI,CAAA;AACX,IAAA,MAAA,CAAO,QAAQ,CAAA;AACf,IAAA,MAAA,CAAO,OAAO,CAAA;AAAA,EAChB;AACA,EAAA,IAAI,IAAA,CAAK,SAAS,QAAA,EAAU;AAC1B,IAAAA,QAAAA,CAAQ,UAAU,8CAA8C,CAAA;AAChE,IAAA,MAAA,CAAO,QAAQ,CAAA;AACf,IAAA,MAAA,CAAO,MAAM,CAAA;AACb,IAAA,MAAA,CAAO,OAAO,CAAA;AAAA,EAChB;AACA,EAAA,IAAI,IAAA,CAAK,SAAS,KAAA,EAAO;AACvB,IAAAA,QAAAA,CAAQ,UAAU,yBAAyB,CAAA;AAC3C,IAAAA,QAAAA,CAAQ,SAAS,yBAAyB,CAAA;AAC1C,IAAA,MAAA,CAAO,QAAQ,CAAA;AACf,IAAA,MAAA,CAAO,MAAM,CAAA;AACb,IAAA,MAAA,CAAO,QAAQ,CAAA;AAAA,EACjB;AACF,CAAC;;;ACjEI,IAAM,SAAA,GAAuC;AAAA,EAClD,IAAA,EAAM,WAAA;AAAA,EACN,GAAA,EAAK,UAAA;AAAA,EACL,IAAA,EAAM,WAAA;AAAA,EACN,KAAA,EAAO;AACT,CAAA;AAGA,IAAM,gBAAA,GAA2C,EAAE,EAAA,EAAI,QAAA,EAAS;AAEzD,IAAM,KAAA,GAAQ,CAAC,KAAA,KAA0B,gBAAA,CAAiB,KAAK,CAAA,IAAK,KAAA,CAAM,OAAA,CAAQ,QAAA,EAAU,CAAC,CAAA,KAAM,CAAA,CAAA,EAAI,CAAA,CAAE,WAAA,EAAa,CAAA,CAAE,CAAA;AAE/H,IAAM,KAAA,GAAQ,CAAC,MAAA,KAA2B;AACxC,EAAA,KAAA,MAAW,CAAC,KAAA,EAAO,MAAM,CAAA,IAAK,MAAA,CAAO,OAAA,CAAQ,gBAAgB,CAAA,EAAG,IAAI,MAAA,KAAW,MAAA,EAAQ,OAAO,KAAA;AAC9F,EAAA,OAAO,MAAA,CAAO,QAAQ,WAAA,EAAa,CAAC,MAAM,CAAA,KAAc,CAAA,CAAE,aAAa,CAAA;AACzE,CAAA;AAEA,IAAM,YAAA,mBAAe,IAAI,GAAA,CAAI,CAAC,KAAA,EAAO,SAAA,EAAW,OAAA,EAAS,UAAA,EAAY,KAAA,EAAO,OAAA,EAAS,QAAQ,CAAC,CAAA;AAC9F,IAAM,cAAA,uBAAqB,GAAA,CAAI;AAAA,EAC7B,IAAA;AAAA,EACA,YAAA;AAAA,EACA,cAAA;AAAA,EACA,OAAA;AAAA,EACA,aAAA;AAAA,EACA,QAAA;AAAA,EACA,YAAA;AAAA,EACA,YAAA;AAAA,EACA,eAAA;AAAA,EACA,UAAA;AAAA,EACA,sBAAA;AAAA,EACA,SAAA;AAAA,EACA,UAAA;AAAA,EACA,OAAA;AAAA,EACA,MAAA;AAAA,EACA;AACF,CAAC,CAAA;AAEM,IAAM,QAAA,GAAW,CAAC,MAAA,EAAgB,KAAA,KAA4B;AACnE,EAAA,IAAI,KAAA,KAAU,QAAW,OAAO,IAAA;AAChC,EAAA,IAAI,aAAa,GAAA,CAAI,MAAM,GAAG,OAAO,IAAA,CAAK,UAAU,KAAK,CAAA;AACzD,EAAA,OAAO,KAAA;AACT,CAAA;AAEA,IAAM,UAAA,GAAa,CAAC,MAAA,EAAgB,KAAA,KAA4B;AAC9D,EAAA,IAAI,KAAA,KAAU,MAAM,OAAO,MAAA;AAC3B,EAAA,IAAI,YAAA,CAAa,GAAA,CAAI,MAAM,CAAA,EAAG,OAAO,OAAO,KAAA,KAAU,QAAA,GAAW,IAAA,CAAK,KAAA,CAAM,KAAK,CAAA,GAAI,KAAA;AAGrF,EAAA,IAAI,eAAe,GAAA,CAAI,MAAM,CAAA,EAAG,OAAO,OAAO,KAAK,CAAA;AACnD,EAAA,OAAO,KAAA;AACT,CAAA;AAEA,IAAM,aAAA,GAAgBD,MAAE,MAAA,CAAO;AAAA,EAC7B,EAAA,EAAIA,MAAE,MAAA,EAAO;AAAA,EACb,IAAA,EAAM,cAAA;AAAA,EACN,MAAA,EAAQA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC5B,EAAA,EAAI,SAAS,QAAA,EAAS;AAAA,EACtB,GAAA,EAAKA,KAAAA,CAAE,MAAA,CAAOA,KAAAA,CAAE,MAAA,IAAUA,KAAAA,CAAE,OAAA,EAAS,CAAA,CAAE,QAAA,EAAS;AAAA,EAChD,IAAA,EAAMA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC1B,OAAA,EAASA,KAAAA,CAAE,OAAA,EAAQ,CAAE,QAAA,EAAS;AAAA,EAC9B,MAAA,EAAQA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC5B,KAAA,EAAOA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC3B,UAAA,EAAYA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAChC,OAAOA,KAAAA,CAAE,MAAA,CAAO,EAAE,KAAA,EAAOA,KAAAA,CAAE,QAAO,EAAG,IAAA,EAAMA,KAAAA,CAAE,MAAA,IAAU,MAAA,EAAQA,KAAAA,CAAE,QAAO,EAAG,EAAE,QAAA,EAAS;AAAA,EACtF,MAAA,EAAQA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC5B,EAAA,EAAIA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EACxB,EAAA,EAAIA,MAAE,MAAA,EAAO;AAAA,EACb,SAAA,EAAWA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC/B,SAAA,EAAWA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC/B,KAAA,EAAOA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC3B,KAAA,EAAOA,MAAE,MAAA,EAAO;AAAA,EAChB,WAAA,EAAaA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EACjC,MAAA,EAAQA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC5B,QAAA,EAAUA,KAAAA,CAAE,OAAA,EAAQ,CAAE,QAAA,EAAS;AAAA,EAC/B,EAAA,EAAIA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EACxB,IAAA,EAAMA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC1B,WAAA,EAAaA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA;AAC1B,CAAC,CAAA;AAED,IAAM,YAAA,GAAeA,MAAE,MAAA,CAAO;AAAA,EAC5B,EAAA,EAAIA,MAAE,MAAA,EAAO;AAAA,EACb,QAAA,EAAUA,MAAE,MAAA,EAAO;AAAA,EACnB,OAAA,EAASA,MAAE,MAAA,EAAO;AAAA,EAClB,EAAA,EAAIA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EACxB,KAAA,EAAOA,MAAE,MAAA,EAAO;AAAA,EAChB,UAAA,EAAYA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAChC,SAASA,KAAAA,CAAE,KAAA,CAAMA,MAAE,MAAA,EAAQ,EAAE,QAAA,EAAS;AAAA,EACtC,KAAA,EAAOA,MAAE,IAAA,CAAK,CAAC,WAAW,QAAA,EAAU,SAAA,EAAW,SAAS,CAAC,CAAA;AAAA,EACzD,KAAA,EAAOA,MAAE,MAAA,EAAO;AAAA,EAChB,QAAA,EAAUA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC9B,KAAA,EAAOA,MAAE,MAAA,EAAO;AAAA,EAChB,IAAA,EAAMA,MAAE,MAAA,EAAO;AAAA,EACf,MAAA,EAAQA,MAAE,MAAA,EAAO;AAAA,EACjB,KAAA,EAAOA,MAAE,MAAA,EAAO;AAAA,EAChB,SAAA,EAAWA,MAAE,MAAA,EAAO;AAAA,EACpB,SAAA,EAAWA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC/B,OAAA,EAASA,KAAAA,CAAE,OAAA,EAAQ,CAAE,QAAA,EAAS;AAAA,EAC9B,IAAA,EAAMA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA;AACnB,CAAC,CAAA;AAED,IAAM,aAAA,GAAgBA,MAAE,MAAA,CAAO;AAAA,EAC7B,EAAA,EAAIA,MAAE,MAAA,EAAO;AAAA,EACb,KAAA,EAAOA,MAAE,MAAA,EAAO;AAAA,EAChB,QAAA,EAAUA,MAAE,MAAA,EAAO;AAAA,EACnB,IAAA,EAAMA,MAAE,MAAA,EAAO;AAAA,EACf,KAAA,EAAOA,MAAE,MAAA,EAAO;AAAA,EAChB,GAAA,EAAKA,MAAE,MAAA,CAAOA,KAAAA,CAAE,QAAO,EAAGA,KAAAA,CAAE,SAAS,CAAA;AAAA,EACrC,KAAA,EAAOA,MAAE,MAAA,EAAO;AAAA,EAChB,KAAA,EAAOA,MAAE,IAAA,CAAK,CAAC,WAAW,SAAA,EAAW,UAAA,EAAY,MAAA,EAAQ,QAAQ,CAAC,CAAA;AAAA,EAClE,OAAA,EAASA,MAAE,MAAA,EAAO;AAAA,EAClB,KAAA,EAAOA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC3B,YAAA,EAAcA,MAAE,MAAA,EAAO;AAAA,EACvB,SAAA,EAAWA,MAAE,MAAA,EAAO;AAAA,EACpB,KAAA,EAAOA,KAAAA,CAAE,OAAA,EAAQ,CAAE,QAAA,EAAS;AAAA,EAC5B,MAAA,EAAQA,KAAAA,CAAE,OAAA,EAAQ,CAAE,QAAA,EAAS;AAAA,EAC7B,KAAA,EAAOA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC3B,SAAA,EAAWA,MAAE,MAAA,EAAO;AAAA,EACpB,SAAA,EAAWA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA;AACxB,CAAC,CAAA;AAED,IAAM,cAAA,GAAiBA,MAAE,MAAA,CAAO;AAAA,EAC9B,QAAA,EAAUA,MAAE,MAAA,EAAO;AAAA,EACnB,OAAA,EAASA,MAAE,MAAA,EAAO;AAAA,EAClB,mBAAA,EAAqBA,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA;AAClC,CAAC,CAAA;AAED,IAAM,WAAA,GAA8D;AAAA,EAClE,IAAA,EAAM,aAAA;AAAA,EACN,GAAA,EAAK,YAAA;AAAA,EACL,IAAA,EAAM,aAAA;AAAA,EACN,KAAA,EAAO;AACT,CAAA;AAEO,IAAM,WAAA,GAAc,CAAsB,KAAA,EAAU,GAAA,KAAgD;AACzG,EAAA,MAAM,SAAkC,EAAC;AACzC,EAAA,KAAA,MAAW,CAAC,MAAA,EAAQ,KAAK,KAAK,MAAA,CAAO,OAAA,CAAQ,GAAG,CAAA,EAAG;AACjD,IAAA,MAAM,MAAA,GAAS,UAAA,CAAW,MAAA,EAAQ,KAAK,CAAA;AACvC,IAAA,IAAI,WAAW,MAAA,EAAW,MAAA,CAAO,KAAA,CAAM,MAAM,CAAC,CAAA,GAAI,MAAA;AAAA,EACpD;AACA,EAAA,MAAM,IAAA,GAAO,WAAA,CAAY,KAAK,CAAA,CAAE,UAAU,MAAM,CAAA;AAChD,EAAA,IAAI,CAAC,KAAK,OAAA,EAAS;AACjB,IAAA,MAAM,UAAU,IAAA,CAAK,KAAA,CAAM,OAAO,GAAA,CAAI,CAAC,UAAU,CAAA,EAAG,KAAA,CAAM,KAAK,IAAA,CAAK,GAAG,CAAC,CAAA,EAAA,EAAK,KAAA,CAAM,OAAO,CAAA,CAAE,CAAA,CAAE,KAAK,IAAI,CAAA;AACvG,IAAA,MAAM,IAAI,KAAA,CAAM,CAAA,qBAAA,EAAwB,SAAA,CAAU,KAAK,CAAC,CAAA,oBAAA,EAAuB,KAAK,CAAA,EAAA,EAAK,OAAO,CAAA,CAAA,CAAG,CAAA;AAAA,EACrG;AACA,EAAA,OAAO,IAAA,CAAK,IAAA;AACd,CAAA;;;AC9IA,IAAM,WAAA,GAAc;AAAA,EAClB,CAAC,MAAM,GAAG,CAAA;AAAA,EACV,CAAC,MAAM,IAAI,CAAA;AAAA,EACX,CAAC,MAAM,GAAG,CAAA;AAAA,EACV,CAAC,OAAO,IAAI,CAAA;AAAA,EACZ,CAAC,MAAM,GAAG,CAAA;AAAA,EACV,CAAC,OAAO,IAAI;AACd,CAAA;AAEA,IAAM,gBAAA,GAAmBA,MAAE,MAAA,CAAO;AAAA,EAChC,EAAA,EAAIA,KAAAA,CAAE,OAAA,EAAQ,CAAE,QAAA,EAAS;AAAA,EACzB,EAAA,EAAIA,KAAAA,CAAE,OAAA,EAAQ,CAAE,QAAA,EAAS;AAAA,EACzB,EAAA,EAAIA,KAAAA,CAAE,OAAA,EAAQ,CAAE,QAAA,EAAS;AAAA,EACzB,GAAA,EAAKA,KAAAA,CAAE,OAAA,EAAQ,CAAE,QAAA,EAAS;AAAA,EAC1B,EAAA,EAAIA,KAAAA,CAAE,OAAA,EAAQ,CAAE,QAAA,EAAS;AAAA,EACzB,GAAA,EAAKA,KAAAA,CAAE,OAAA,EAAQ,CAAE,QAAA,EAAS;AAAA,EAC1B,EAAA,EAAIA,MAAE,KAAA,CAAMA,KAAAA,CAAE,SAAS,CAAA,CAAE,QAAA,EAAS,CAAE,QAAA,EAAS;AAAA,EAC7C,KAAA,EAAOA,MAAE,KAAA,CAAMA,KAAAA,CAAE,SAAS,CAAA,CAAE,QAAA,EAAS,CAAE,QAAA,EAAS;AAAA,EAChD,MAAA,EAAQA,KAAAA,CAAE,OAAA,EAAQ,CAAE,QAAA;AACtB,CAAC,CAAA;AAED,IAAM,YAAA,GAAe,CAAC,KAAA,EAAe,IAAA,KAAsC;AACzE,EAAA,MAAM,IAAA,GAAO,gBAAA,CAAiB,SAAA,CAAU,IAAI,CAAA;AAC5C,EAAA,IAAI,IAAA,CAAK,OAAA,EAAS,OAAO,IAAA,CAAK,IAAA;AAC9B,EAAA,MAAM,UAAU,IAAA,CAAK,KAAA,CAAM,OAAO,GAAA,CAAI,CAAC,UAAU,CAAA,EAAG,KAAA,CAAM,KAAK,IAAA,CAAK,GAAG,CAAC,CAAA,EAAA,EAAK,KAAA,CAAM,OAAO,CAAA,CAAE,CAAA,CAAE,KAAK,IAAI,CAAA;AACvG,EAAA,MAAM,IAAI,KAAA,CAAM,CAAA,kBAAA,EAAqB,KAAK,CAAA,kDAAA,EAAqD,OAAO,CAAA,CAAA,CAAG,CAAA;AAC3G,CAAA;AAIO,IAAM,YAAA,GAAe,CAAC,KAAA,EAA2B,KAAA,EAAe,QAAQ,EAAA,KAAa;AAC1F,EAAA,MAAM,UAAoB,EAAC;AAC3B,EAAA,MAAM,SAAoB,EAAC;AAC3B,EAAA,MAAM,MAAA,GAAS,KAAA,KAAU,EAAA,GAAK,EAAA,GAAK,GAAG,KAAK,CAAA,CAAA,CAAA;AAC3C,EAAA,MAAM,IAAA,GAAO,CAAC,KAAA,KAA2B;AACvC,IAAA,MAAA,CAAO,KAAK,KAAK,CAAA;AACjB,IAAA,OAAO,CAAA,CAAA,EAAI,KAAA,GAAQ,MAAA,CAAO,MAAA,GAAS,CAAC,CAAA,CAAA;AAAA,EACtC,CAAA;AAEA,EAAA,KAAA,MAAW,CAAC,OAAO,IAAI,CAAA,IAAK,OAAO,OAAA,CAAQ,KAAA,IAAS,EAAE,CAAA,EAAG;AACvD,IAAA,MAAM,SAAS,CAAA,EAAG,MAAM,CAAA,EAAG,KAAA,CAAM,KAAK,CAAC,CAAA,CAAA;AACvC,IAAA,MAAM,IAAA,GAAO,MAAM,KAAK,CAAA;AACxB,IAAA,IAAI,IAAA,KAAS,QAAQ,OAAO,IAAA,KAAS,YAAY,KAAA,CAAM,OAAA,CAAQ,IAAI,CAAA,EAAG;AACpE,MAAA,OAAA,CAAQ,IAAA,CAAK,IAAA,KAAS,MAAA,GAAY,CAAA,EAAG,MAAM,CAAA,QAAA,CAAA,GAAa,CAAA,EAAG,MAAM,CAAA,GAAA,EAAM,KAAK,QAAA,CAAS,IAAA,EAAM,IAAI,CAAC,CAAC,CAAA,CAAE,CAAA;AACnG,MAAA;AAAA,IACF;AAEA,IAAA,MAAM,UAAA,GAAa,YAAA,CAAa,KAAA,EAAO,IAAI,CAAA;AAC3C,IAAA,KAAA,MAAW,CAAC,EAAA,EAAI,MAAM,CAAA,IAAK,WAAA,EAAa;AACtC,MAAA,MAAM,OAAA,GAAU,WAAW,EAAE,CAAA;AAC7B,MAAA,IAAI,YAAY,MAAA,EAAW;AAG3B,MAAA,OAAA,CAAQ,IAAA,CAAK,EAAA,KAAO,IAAA,GAAO,CAAA,CAAA,EAAI,MAAM,CAAA,YAAA,EAAe,MAAM,CAAA,IAAA,EAAO,IAAA,CAAK,QAAA,CAAS,IAAA,EAAM,OAAO,CAAC,CAAC,CAAA,CAAA,CAAA,GAAM,CAAA,EAAG,MAAM,CAAA,CAAA,EAAI,MAAM,CAAA,CAAA,EAAI,IAAA,CAAK,QAAA,CAAS,IAAA,EAAM,OAAO,CAAC,CAAC,CAAA,CAAE,CAAA;AAAA,IAC5J;AACA,IAAA,IAAI,UAAA,CAAW,OAAO,MAAA,EAAW,OAAA,CAAQ,KAAK,CAAA,EAAG,MAAM,UAAU,IAAA,CAAK,UAAA,CAAW,GAAG,GAAA,CAAI,CAAC,UAAU,QAAA,CAAS,IAAA,EAAM,KAAK,CAAC,CAAC,CAAC,CAAA,CAAA,CAAG,CAAA;AAC7H,IAAA,IAAI,UAAA,CAAW,UAAU,MAAA,EAAW,OAAA,CAAQ,KAAK,CAAA,KAAA,EAAQ,MAAM,UAAU,IAAA,CAAK,UAAA,CAAW,MAAM,GAAA,CAAI,CAAC,UAAU,QAAA,CAAS,IAAA,EAAM,KAAK,CAAC,CAAC,CAAC,CAAA,EAAA,CAAI,CAAA;AACzI,IAAA,IAAI,UAAA,CAAW,MAAA,KAAW,MAAA,EAAW,OAAA,CAAQ,IAAA,CAAK,UAAA,CAAW,MAAA,GAAS,CAAA,EAAG,MAAM,CAAA,QAAA,CAAA,GAAa,CAAA,EAAG,MAAM,CAAA,YAAA,CAAc,CAAA;AAAA,EACrH;AAEA,EAAA,OAAO,EAAE,GAAA,EAAK,OAAA,CAAQ,MAAA,KAAW,CAAA,GAAI,SAAS,OAAA,CAAQ,IAAA,CAAK,OAAO,CAAA,EAAG,MAAA,EAAO;AAC9E,CAAA;AAEO,IAAM,YAAA,GAAe,CAAC,KAAA,EAA6B,KAAA,GAAQ,EAAA,KAAe;AAC/E,EAAA,IAAI,KAAA,KAAU,MAAA,IAAa,KAAA,CAAM,MAAA,KAAW,GAAG,OAAO,EAAA;AACtD,EAAA,MAAM,MAAA,GAAS,KAAA,KAAU,EAAA,GAAK,EAAA,GAAK,GAAG,KAAK,CAAA,CAAA,CAAA;AAC3C,EAAA,OAAO,CAAA,UAAA,EAAa,MAAM,GAAA,CAAI,CAAC,QAAQ,CAAA,EAAG,MAAM,CAAA,EAAG,KAAA,CAAM,GAAA,CAAI,EAAE,CAAC,CAAA,CAAA,EAAI,GAAA,CAAI,QAAQ,MAAA,GAAS,MAAA,GAAS,KAAK,CAAA,CAAE,CAAA,CAAE,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA;AACvH,CAAA;AAEO,IAAM,QAAA,GAAW,CAAI,IAAA,EAAoB,KAAA,KAAqC;AACnF,EAAA,IAAI,KAAA,KAAU,UAAa,KAAA,CAAM,MAAA,KAAW,GAAG,OAAO,CAAC,GAAG,IAAI,CAAA;AAC9D,EAAA,OAAO,CAAC,GAAG,IAAI,EAAE,IAAA,CAAK,CAAC,MAAM,KAAA,KAAU;AACrC,IAAA,KAAA,MAAW,OAAO,KAAA,EAAO;AACvB,MAAA,MAAM,CAAA,GAAa,IAAA,CAAK,GAAA,CAAI,EAAE,CAAA;AAC9B,MAAA,MAAM,CAAA,GAAa,KAAA,CAAM,GAAA,CAAI,EAAE,CAAA;AAC/B,MAAA,MAAM,QAAA,GAAW,OAAO,CAAA,KAAM,QAAA,IAAY,OAAO,CAAA,KAAM,QAAA,GAAW,CAAA,GAAI,CAAA,GAAI,MAAA,CAAO,CAAC,IAAI,MAAA,CAAO,CAAC,IAAI,EAAA,GAAK,MAAA,CAAO,CAAC,CAAA,GAAI,MAAA,CAAO,CAAC,CAAA,GAAI,CAAA,GAAI,CAAA;AACnI,MAAA,IAAI,aAAa,CAAA,EAAG,OAAO,YAAY,GAAA,CAAI,GAAA,KAAQ,SAAS,EAAA,GAAK,CAAA,CAAA;AAAA,IACnE;AACA,IAAA,OAAO,CAAA;AAAA,EACT,CAAC,CAAA;AACH,CAAA;AAEO,IAAM,UAAA,GAAa,CAAC,GAAA,EAAa,KAAA,KAAwB;AAC9D,EAAA,MAAM,cAAwB,EAAC;AAC/B,EAAA,MAAM,SAAoB,EAAC;AAC3B,EAAA,KAAA,MAAW,CAAC,KAAA,EAAO,KAAK,KAAK,MAAA,CAAO,OAAA,CAAQ,GAAG,CAAA,EAAG;AAChD,IAAA,MAAM,MAAA,GAAS,MAAM,KAAK,CAAA;AAC1B,IAAA,IAAI,UAAU,IAAA,IAAQ,OAAO,KAAA,KAAU,QAAA,IAAY,SAAS,KAAA,EAAO;AACjE,MAAA,WAAA,CAAY,IAAA,CAAK,CAAA,EAAG,MAAM,CAAA,YAAA,EAAe,MAAM,UAAU,MAAA,CAAO,KAAA,CAAM,GAAG,CAAC,CAAA,CAAE,CAAA;AAC5E,MAAA;AAAA,IACF;AACA,IAAA,MAAA,CAAO,IAAA,CAAK,QAAA,CAAS,MAAA,EAAQ,KAAK,CAAC,CAAA;AACnC,IAAA,WAAA,CAAY,IAAA,CAAK,GAAG,MAAM,CAAA,IAAA,EAAO,QAAQ,MAAA,CAAO,MAAA,GAAS,CAAC,CAAA,CAAE,CAAA;AAAA,EAC9D;AACA,EAAA,OAAO,EAAE,GAAA,EAAK,WAAA,CAAY,IAAA,CAAK,IAAI,GAAG,MAAA,EAAO;AAC/C,CAAA;;;AC9FO,IAAM,SAAA,GACX,CAAC,EAAE,MAAA,EAAQ,YAAY,KAAA,EAAM,KAC7B,OAA4B,IAAA,KAAuB;AACjD,EAAA,MAAM,KAAA;AACN,EAAA,MAAM,KAAA,GAAQ,SAAA,CAAU,IAAA,CAAK,KAAK,CAAA;AAClC,EAAA,MAAM,KAAA,GAAQ,YAAA,CAAa,IAAA,CAAK,KAAA,EAAO,GAAG,CAAA;AAE1C,EAAA,MAAM,IAAA,GAAM,OAAO,EAAA,EAAY,KAAA,EAAe,KAAA,KAAkB;AAC9D,IAAA,IAAI,KAAA,IAAS,CAAA,EAAG,OAAO,EAAC;AACxB,IAAA,MAAM,KAAA,GAAQ,YAAA,CAAa,EAAE,GAAG,IAAA,CAAK,OAAO,GAAG,KAAA,EAAM,EAAG,CAAA,EAAG,GAAG,CAAA;AAC9D,IAAA,MAAM,MAAM,UAAA,CAAW,IAAA,CAAK,KAAK,KAAA,CAAM,MAAA,CAAO,SAAS,CAAC,CAAA;AACxD,IAAA,MAAM,MAAA,GAAS,MAAM,EAAA,CAAG,KAAA;AAAA,MACtB,CAAA,OAAA,EAAU,KAAK,CAAA,KAAA,EAAQ,GAAA,CAAI,GAAG;AAAA;AAAA,8BAAA,EAEN,KAAK,CAAA,SAAA,EAAY,KAAA,CAAM,GAAG,GAAG,KAAK;AAAA,iBAAA,EAC/C,IAAA,CAAK,KAAA,CAAM,KAAK,CAAC,CAAA;AAAA;AAAA,oBAAA,CAAA;AAAA,MAG5B,CAAC,GAAG,KAAA,CAAM,MAAA,EAAQ,GAAG,IAAI,MAAM;AAAA,KACjC;AAGA,IAAA,OAAO,QAAA,CAAS,MAAA,CAAO,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,KAAQ,WAAA,CAAY,IAAA,CAAK,KAAA,EAAO,GAAG,CAAC,CAAA,EAAG,KAAK,KAAK,CAAA;AAAA,EACpF,CAAA;AAEA,EAAA,IAAI,IAAA,CAAK,WAAW,MAAA,EAAW,OAAO,KAAK,MAAA,EAAQ,EAAC,EAAG,IAAA,CAAK,KAAK,CAAA;AAMjE,EAAA,MAAM,EAAE,MAAA,EAAQ,IAAA,EAAM,IAAA,KAAS,IAAA,CAAK,MAAA;AACpC,EAAA,MAAM,UAAA,GAAa,CAAC,GAAG,IAAI,CAAA;AAE3B,EAAA,MAAM,UAAU,MAAM,IAAA,CAAK,MAAA,EAAQ,EAAE,CAAC,MAAM,GAAG,EAAE,KAAA,EAAO,YAAW,EAAE,EAAG,IAAA,CAAK,KAAA,GAAQ,WAAW,MAAM,CAAA;AAEtG,EAAA,MAAM,SAAA,GAAY,CAAC,KAAA,KACjB,UAAA,CAAW,OAAO,EAAA,KAAO;AACvB,IAAA,MAAM,IAAA,GAAO,MAAM,EAAA,CAAG,KAAA,CAAM,wEAAwE,CAAC,CAAA,KAAA,EAAQ,KAAK,CAAA,CAAA,EAAI,KAAA,CAAM,MAAM,CAAC,CAAA,CAAA,EAAI,KAAK,CAAC,CAAA;AAC7I,IAAA,IAAI,IAAA,CAAK,KAAK,CAAC,CAAA,GAAI,MAAM,CAAA,KAAM,IAAA,SAAa,EAAC;AAC7C,IAAA,MAAM,IAAA,GAAO,YAAA,CAAa,EAAE,GAAG,IAAA,EAAM,CAAC,MAAM,GAAG,KAAA,EAAM,EAAG,CAAA,EAAG,GAAG,CAAA;AAC9D,IAAA,MAAM,KAAA,GAAQ,MAAM,EAAA,CAAG,KAAA,CAAM,CAAA,iBAAA,EAAoB,KAAK,CAAA,SAAA,EAAY,IAAA,CAAK,GAAG,CAAA,QAAA,CAAA,EAAY,IAAA,CAAK,MAAM,CAAA;AACjG,IAAA,IAAI,KAAA,CAAM,IAAA,CAAK,MAAA,GAAS,CAAA,SAAU,EAAC;AACnC,IAAA,OAAO,IAAA,CAAK,IAAI,EAAE,CAAC,MAAM,GAAG,KAAA,IAAS,CAAC,CAAA;AAAA,EACxC,CAAC,CAAA;AAEH,EAAA,KAAA,MAAW,SAAS,UAAA,EAAY;AAC9B,IAAA,IAAI,OAAA,CAAQ,MAAA,IAAU,IAAA,CAAK,KAAA,EAAO;AAClC,IAAA,OAAA,CAAQ,IAAA,CAAK,GAAI,MAAM,SAAA,CAAU,KAAK,CAAE,CAAA;AAAA,EAC1C;AAEA,EAAA,OAAO,OAAA;AACT,CAAA;;;AC1DK,IAAM,WAAA,GAAc,CAAC,WAAA,EAAa,UAAA,EAAY,aAAa,mBAAmB;AAI9E,IAAM,QAAA,GAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAyHxB,IAAM,YAAA,GAAe,CAAC,GAAA,KACpB,GAAA,CACG,MAAM,GAAG,CAAA,CACT,IAAI,CAAC,KAAA,KAAU,MAAM,IAAA,EAAM,EAC3B,MAAA,CAAO,CAAC,UAAU,KAAA,CAAM,KAAA,CAAM,IAAI,CAAA,CAAE,IAAA,CAAK,CAAC,IAAA,KAAS,IAAA,CAAK,MAAK,KAAM,EAAA,IAAM,CAAC,IAAA,CAAK,IAAA,GAAO,UAAA,CAAW,IAAI,CAAC,CAAC,CAAA,CACvG,IAAI,CAAC,GAAA,MAAS,EAAE,IAAA,EAAM,KAAA,EAAO,KAAI,CAAE,CAAA;AAGjC,IAAM,aAAA,GAA0B;AAAA,EACrC,EAAA,EAAI,gBAAA;AAAA,EACJ,UAAA,EAAY;AAAA,IACV,EAAE,WAAA,EAAa,sFAAA,EAAwF,KAAA,EAAO,YAAA,CAAa,QAAQ,CAAA,EAAE;AAAA,IACrI;AAAA,MACE,WAAA,EAAa,6FAAA;AAAA,MACb,KAAA,EAAO;AAAA,QACL,EAAE,IAAA,EAAM,KAAA,EAAO,GAAA,EAAK,0DAAA,EAA2D;AAAA,QAC/E,EAAE,IAAA,EAAM,KAAA,EAAO,GAAA,EAAK,oEAAA;AAAqE;AAC3F;AACF;AAEJ;;;ACzIA,IAAM,yBAAU,CAAA,MAAsC;AACpD,EAAA,IAAI,QAAA,GAAW,CAAA;AACf,EAAA,OAAO,CAAC,KAAA,KAAU;AAChB,IAAA,QAAA,IAAY,CAAA;AACZ,IAAA,OAAO,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,IAAA,CAAK,GAAA,EAAI,CAAE,QAAA,CAAS,EAAE,CAAC,CAAA,CAAA,EAAI,QAAA,CAAS,QAAA,CAAS,EAAE,CAAC,CAAA,CAAA;AAAA,EACrE,CAAA;AACF,CAAA,GAAG;AAMI,IAAM,eAAA,GAAkB,CAAC,IAAA,EAAgB,OAAA,GAA4B,EAAC,KAA4C;AAEvH,EAAA,MAAM,KAAA,GAAuB,OAAA,CAAQ,OAAA,KAAY,KAAA,GAAQ,QAAQ,OAAA,EAAQ,GAAIE,gBAAA,CAAc,IAAA,EAAM,CAAC,aAAa,CAAC,CAAA,CAAE,IAAA,CAAK,MAAM,MAAS,CAAA;AAGtI,EAAA,KAAA,CAAM,KAAA,CAAM,MAAM,MAAS,CAAA;AAE3B,EAAA,MAAM,QAAA,GAAuB,CAAC,EAAA,KAAO;AACnC,IAAA,IAAI,KAAK,WAAA,KAAgB,MAAA;AACvB,MAAA,MAAM,IAAI,MAAM,8HAAyH,CAAA;AAC3I,IAAA,OAAO,IAAA,CAAK,YAAY,EAAE,CAAA;AAAA,EAC5B,CAAA;AAEA,EAAA,MAAM,KAAA,GAAQ,CAAC,MAAA,EAAgB,UAAA,KAAsC;AACnE,IAAA,MAAM,KAAA,GAAmB;AAAA,MACvB,KAAA,EAAO,OAA4B,IAAA,KAAuB;AACxD,QAAA,MAAM,KAAA;AACN,QAAA,MAAM,KAAA,GAAQ,YAAA,CAAa,IAAA,CAAK,KAAA,EAAO,CAAC,CAAA;AACxC,QAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,KAAU,MAAA,GAAY,KAAK,CAAA,OAAA,EAAU,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,KAAK,CAAC,CAAC,CAAA,CAAA;AAC3F,QAAA,MAAM,MAAA,GAAS,MAAM,MAAA,CAAO,KAAA;AAAA,UAC1B,CAAA,cAAA,EAAiB,SAAA,CAAU,IAAA,CAAK,KAAK,CAAC,CAAA,OAAA,EAAU,KAAA,CAAM,GAAG,CAAA,EAAG,YAAA,CAAa,IAAA,CAAK,KAAK,CAAC,GAAG,KAAK,CAAA,CAAA;AAAA,UAC5F,KAAA,CAAM;AAAA,SACR;AACA,QAAA,OAAO,MAAA,CAAO,KAAK,GAAA,CAAI,CAAC,QAAQ,WAAA,CAAY,IAAA,CAAK,KAAA,EAAO,GAAG,CAAC,CAAA;AAAA,MAC9D,CAAA;AAAA,MAEA,cAAA,EAAgB,OAA4B,KAAA,EAAU,KAAA,KAAuD;AAC3G,QAAA,MAAM,KAAA;AACN,QAAA,MAAM,KAAA,GAAgB,KAAA;AACtB,QAAA,MAAM,MAAA,GAAiB,WAAA,CAAY,KAAK,CAAA,KAAM,OAAO,EAAE,GAAG,KAAA,EAAO,EAAA,EAAI,KAAA,CAAM,EAAA,IAAM,MAAA,CAAO,KAAK,GAAE,GAAI,KAAA;AACnG,QAAA,MAAM,OAAA,GAAU,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAA,CAAE,MAAA,CAAO,CAAC,GAAG,KAAK,CAAA,KAAM,KAAA,KAAU,MAAS,CAAA;AAChF,QAAA,MAAM,OAAA,GAAU,QAAQ,GAAA,CAAI,CAAC,CAAC,KAAK,CAAA,KAAM,KAAA,CAAM,KAAK,CAAC,CAAA;AACrD,QAAA,MAAM,MAAA,GAAS,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAC,KAAA,EAAO,KAAK,CAAA,KAAM,QAAA,CAAS,KAAA,CAAM,KAAK,CAAA,EAAG,KAAK,CAAC,CAAA;AAE5E,QAAA,MAAM,MAAA,GAAS,UAAU,KAAK,CAAA;AAC9B,QAAA,MAAM,MAAA,GACJ,OAAO,IAAA,KAAS,MAAA,GACZ,IAAI,MAAA,CAAO,EAAA,CAAG,IAAI,CAAC,MAAA,KAAW,MAAM,MAAM,CAAC,EAAE,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA,CAAA,GACvD,CAAA,CAAA,EAAI,OAAO,EAAA,CAAG,GAAA,CAAI,CAAC,MAAA,KAAY,MAAA,KAAW,YAAY,MAAA,KAAW,MAAA,GAAS,YAAY,KAAA,CAAM,MAAM,CAAC,CAAA,IAAA,CAAA,GAAS,KAAA,CAAM,MAAM,CAAE,CAAA,CAAE,KAAK,IAAI,CAAC,WAAW,KAAA,CAAM,MAAA,CAAO,IAAI,CAAC,CAAA,YAAA,CAAA;AAEzK,QAAA,MAAM,MAAA,GAAS,MAAM,MAAA,CAAO,KAAA;AAAA,UAC1B,CAAA,YAAA,EAAe,UAAU,KAAK,CAAC,KAAK,OAAA,CAAQ,IAAA,CAAK,IAAI,CAAC,CAAA,UAAA,EAAa,MAAA,CAAO,IAAI,CAAC,MAAA,EAAQ,UAAU,CAAA,CAAA,EAAI,KAAA,GAAQ,CAAC,CAAA,CAAE,CAAA,CAAE,IAAA,CAAK,IAAI,CAAC,CAAA;AAAA,uBAAA,EAC7G,MAAM,CAAA,uBAAA,CAAA;AAAA,UACrB;AAAA,SACF;AACA,QAAA,MAAM,GAAA,GAAM,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA;AACzB,QAAA,OAAO,GAAA,KAAQ,MAAA,GAAY,MAAA,GAAY,WAAA,CAAY,OAAO,GAAG,CAAA;AAAA,MAC/D,CAAA;AAAA,MAEA,OAAO,SAAA,CAAU,EAAE,MAAA,EAAQ,UAAA,EAAY,OAAO,CAAA;AAAA,MAE9C,GAAA,EAAK,OAA4B,KAAA,EAAU,EAAA,EAAY,QAA8B,GAAA,KAAiC;AACpH,QAAA,MAAM,KAAA;AACN,QAAA,MAAM,GAAA,GAAM,KAAA,CAAM,WAAA,CAAY,KAAK,CAAC,CAAA;AACpC,QAAA,MAAM,KAAA,GAAQ,YAAA,CAAa,MAAA,EAAQ,CAAC,CAAA;AACpC,QAAA,MAAM,QAAQ,UAAA,CAAW,GAAA,EAAK,KAAA,CAAM,MAAA,CAAO,SAAS,CAAC,CAAA;AACrD,QAAA,MAAM,MAAA,GAAS,MAAM,MAAA,CAAO,KAAA;AAAA,UAC1B,CAAA,OAAA,EAAU,SAAA,CAAU,KAAK,CAAC,CAAA,KAAA,EAAQ,KAAA,CAAM,GAAG,CAAA,OAAA,EAAU,GAAG,CAAA,UAAA,EAAa,KAAA,CAAM,GAAG,cAAc,GAAG,CAAA,CAAA;AAAA,UAC/F,CAAC,EAAA,EAAI,GAAG,MAAM,MAAA,EAAQ,GAAG,MAAM,MAAM;AAAA,SACvC;AACA,QAAA,OAAO,MAAA,CAAO,KAAK,MAAA,GAAS,CAAA;AAAA,MAC9B,CAAA;AAAA,MAEA,MAAA,EAAQ,OAA4B,IAAA,KAAwB;AAC1D,QAAA,MAAM,KAAA;AACN,QAAA,MAAM,KAAA,GAAQ,YAAA,CAAa,IAAA,CAAK,KAAA,EAAO,CAAC,CAAA;AAExC,QAAA,MAAM,MAAA,GAAS,MAAM,MAAA,CAAO,KAAA,CAAM,eAAe,SAAA,CAAU,IAAA,CAAK,KAAK,CAAC,CAAA,OAAA,EAAU,MAAM,GAAG,CAAA,WAAA,EAAc,MAAM,WAAA,CAAY,IAAA,CAAK,KAAK,CAAC,CAAC,CAAA,CAAA,EAAI,KAAA,CAAM,MAAM,CAAA;AACrJ,QAAA,OAAO,OAAO,IAAA,CAAK,MAAA;AAAA,MACrB,CAAA;AAAA,MAEA,QAAA,EAAU,OAAU,EAAA,KAAkD;AACpE,QAAA,MAAM,KAAA;AACN,QAAA,OAAO,UAAA,CAAW,CAAC,EAAA,KAAO,EAAA,CAAG,KAAA,CAAM,EAAA,EAAI,CAAC,KAAA,KAAU,KAAA,CAAM,EAAE,CAAC,CAAC,CAAC,CAAA;AAAA,MAC/D;AAAA,KACF;AACA,IAAA,OAAO,KAAA;AAAA,EACT,CAAA;AAEA,EAAA,OAAO,EAAE,GAAG,KAAA,CAAM,IAAA,EAAM,QAAQ,GAAG,KAAA,EAAM;AAC3C","file":"postgres.cjs","sourcesContent":["import type { FactInput, Reflex, ReflexInput } from './schemas';\n\nexport type Row = Record<string, unknown>;\n\nexport type Fact = FactInput & {\n id: string;\n as?: string;\n depth: number;\n deliveredAt?: number;\n parked?: string;\n released?: boolean;\n root?: string;\n descendants?: number;\n};\n\nexport type RunState = 'pending' | 'fanned' | 'settled' | 'skipped';\n\nexport type Run = {\n id: string;\n reflexId: string;\n version: string;\n as?: string;\n cause: string;\n occurrence?: string;\n factIds?: readonly string[];\n state: RunState;\n depth: number;\n selected?: number;\n total: number;\n done: number;\n failed: number;\n dueAt: number;\n createdAt: number;\n settledAt?: number;\n // Set when no run fact is owed: the settlement has been emitted as one, or\n // the run was skipped. Apart from `settledAt`: a retried task settles its\n // run again, and that must not emit a second fact.\n drained?: boolean;\n note?: string;\n};\n\nexport type AttemptOutcome = 'ok' | 'error' | 'timeout';\n\nexport type TaskState = 'pending' | 'claimed' | 'retrying' | 'done' | 'failed';\n\nexport type Task = {\n id: string;\n runId: string;\n reflexId: string;\n unit: string;\n cause: string;\n // Frozen at fan-out: a retry evaluates against the data the selection saw.\n env: Row;\n depth: number;\n state: TaskState;\n attempt: number;\n token?: string;\n // Zero, not null, when unclaimed: \"never claimed or lapsed\" is then one\n // comparison, in a query grammar that has no OR.\n claimedUntil: number;\n notBefore: number;\n input?: unknown;\n output?: unknown;\n error?: string;\n createdAt: number;\n settledAt?: number;\n};\n\nexport type ReflexState = {\n reflexId: string;\n armedAt: number;\n materializedThrough?: number;\n};\n\nexport type TideCtx = {\n reflexId: string;\n runId: string;\n taskId: string;\n // The idempotency key a handler passes to an external provider: the same\n // on every attempt of the task.\n taskKey: string;\n attempt: number;\n depth: number;\n now: number;\n actor: unknown;\n emit: (fact: Omit<FactInput, 'cause'>) => void;\n};\n\nexport type EffectHandler = {\n run: (input: unknown, ctx: TideCtx) => Promise<unknown> | unknown;\n writes?: readonly string[];\n preview?: (input: unknown, ctx: PreviewCtx) => unknown;\n};\n\nexport type PreviewCtx = { reflexId: string; unit: string; now: number; actor: unknown };\n\nexport type EffectRegistry = Record<string, EffectHandler>;\n\nexport type TransformFn = (config: unknown, source: Row) => unknown;\n\nexport type SelectFn = (query: unknown, ctx: SelectCtx) => AsyncIterable<Row> | Iterable<Row> | Promise<Iterable<Row>>;\n\nexport type SelectCtx = { reflexId: string; now: number; actor: unknown; env: Row };\n\nexport type ActorFn = (as: string | undefined) => unknown;\n\nexport type Retention = Partial<Record<'facts' | 'runs' | 'tasks', number>>;\n\nexport type TideConfig = {\n store: TideStore;\n transform: TransformFn;\n select?: SelectFn;\n effects?: EffectRegistry | ((as: string | undefined) => EffectRegistry);\n actor?: ActorFn;\n maxChainDepth?: number;\n maxChainFacts?: number;\n storeUnwatchedWrites?: boolean;\n maxFanOut?: number;\n leaseMs?: number;\n onEvent?: (event: TideEvent) => void;\n};\n\nexport type TideEvent =\n | { type: 'run.created'; run: Run }\n | { type: 'run.settled'; run: Run }\n | { type: 'run.skipped'; reflexId: string; reason: string }\n | { type: 'run.deferred'; reflexId: string; runId: string; reason: string }\n | { type: 'task.done'; task: Task }\n | { type: 'task.failed'; task: Task }\n | { type: 'task.retrying'; task: Task; nextAt: number }\n | { type: 'task.reclaimed'; task: Task }\n | { type: 'fact.ingested'; fact: Fact }\n | { type: 'fact.deduped'; fact: NewFact }\n | { type: 'fact.parked'; fact: Fact; reason: string }\n | { type: 'fact.unmatched'; fact: Fact; reflexId: string; reason: string };\n\nexport type AdvanceReport = {\n now: number;\n materialized: number;\n skippedOccurrences: number;\n factsMatched: number;\n runsCreated: number;\n tasksCreated: number;\n executed: number;\n succeeded: number;\n failed: number;\n retrying: number;\n reclaimed: number;\n runsSettled: number;\n parked: number;\n};\n\nexport type LoadReport = {\n loaded: number;\n cycles: readonly { reflexIds: readonly string[]; guarded: boolean }[];\n blind: readonly { reflexId: string; effect: string }[];\n warnings: readonly string[];\n};\n\nexport type PreviewUnit = {\n unit: string;\n env: Row;\n input?: unknown;\n render?: unknown;\n error?: string;\n};\n\nexport type PreviewReport = {\n reflexId: string;\n version: string;\n fired: boolean;\n reason?: string;\n cause?: string;\n occurrence?: string;\n effect: string;\n selected: number;\n units: readonly PreviewUnit[];\n};\n\nexport type NewFact = FactInput & { depth: number; as?: string };\n\nexport type TideTables = {\n fact: Fact;\n run: Run;\n task: Task;\n state: ReflexState;\n};\n\nexport type TableName = keyof TideTables;\n\nexport const PRIMARY_KEY: { [T in TableName]: keyof TideTables[T] & string } = {\n fact: 'id',\n run: 'id',\n task: 'id',\n state: 'reflexId',\n};\n\nexport type UniqueKey<T extends TableName> = {\n by: readonly (keyof TideTables[T] & string)[];\n // The key applies only to rows that have this column set: in Postgres, a\n // partial unique index.\n when?: keyof TideTables[T] & string;\n};\n\nexport const UNIQUE_BY: { [T in TableName]: UniqueKey<T> } = {\n // `entity` is in the key: two polls over different tables can agree on a cursor value.\n fact: { by: ['kind', 'entity', 'name', 'dedupeKey'], when: 'dedupeKey' },\n run: { by: ['reflexId', 'cause'] },\n task: { by: ['runId', 'unit'] },\n state: { by: ['reflexId'] },\n};\n\nexport type Comparison<V> = {\n eq?: V;\n ne?: V;\n lt?: V;\n lte?: V;\n gt?: V;\n gte?: V;\n in?: readonly V[];\n notIn?: readonly V[];\n isNull?: boolean;\n};\n\nexport const COMPARISON_OPS = ['eq', 'ne', 'lt', 'lte', 'gt', 'gte', 'in', 'notIn', 'isNull'] as const;\n\nexport type Where<R> = { [K in keyof R]?: R[K] | Comparison<R[K]> };\n\nexport type Order<R> = readonly { by: keyof R & string; dir?: 'asc' | 'desc' }[];\n\nexport type QuerySpec<T extends TableName = TableName> = {\n table: T;\n where?: Where<TideTables[T]>;\n order?: Order<TideTables[T]>;\n limit?: number;\n};\n\nexport type Mutation<R> = { [K in keyof R]?: R[K] | { inc: number } };\n\nexport type ClaimSpec<T extends TableName = TableName> = {\n table: T;\n where?: Where<TideTables[T]>;\n order?: Order<TideTables[T]>;\n limit: number;\n set: Mutation<TideTables[T]>;\n // At most one row per value of `column` is held at a time, counting rows\n // matching `held` that an earlier claim took. Applies to the values in\n // `only`; every other value claims freely.\n onePer?: { column: keyof TideTables[T] & string; held: Where<TideTables[T]>; only: readonly string[] };\n};\n\nexport type RemoveSpec<T extends TableName = TableName> = {\n table: T;\n where?: Where<TideTables[T]>;\n};\n\nexport type TideStore = {\n transact: <T>(fn: (tx: TideStore) => Promise<T>) => Promise<T>;\n\n appendIfAbsent: <T extends TableName>(\n table: T,\n row: Omit<TideTables[T], 'id'> & { id?: string },\n ) => Promise<TideTables[T] | undefined>;\n\n claim: <T extends TableName>(spec: ClaimSpec<T>) => Promise<readonly TideTables[T][]>;\n\n cas: <T extends TableName>(\n table: T,\n id: string,\n expect: Where<TideTables[T]>,\n set: Mutation<TideTables[T]>,\n ) => Promise<boolean>;\n\n query: <T extends TableName>(spec: QuerySpec<T>) => Promise<readonly TideTables[T][]>;\n\n // Removing a run removes its tasks.\n remove: <T extends TableName>(spec: RemoveSpec<T>) => Promise<number>;\n};\n\nexport type { Reflex, ReflexInput, FactInput };\n","import { z } from 'zod';\n\nexport const WEEKDAYS = ['mon', 'tue', 'wed', 'thu', 'fri', 'sat', 'sun'] as const;\n\nconst HHMM = /^([01]\\d|2[0-3]):[0-5]\\d$/;\nconst MMDD = /^(0[1-9]|1[0-2])-(0[1-9]|[12]\\d|3[01])$/;\nconst LOCAL_DATETIME = /^\\d{4}-\\d{2}-\\d{2}T([01]\\d|2[0-3]):[0-5]\\d(:[0-5]\\d)?$/;\n\nexport const ClockUnitSchema = z.enum(['day', 'week', 'month', 'year']);\n\nexport const ClockRecurringSchema = z\n .object({\n every: ClockUnitSchema.describe('The calendar period it repeats on. A repeating clock fires on every such period until the reflex is removed — only for a request that says it repeats.'),\n on: z\n .union([z.number().int().min(1).max(31), z.enum(WEEKDAYS), z.string().regex(MMDD)])\n .optional()\n .describe('week → a weekday; month → 1..31 (clamped to month end); year → \"MM-DD\". Omitted for day.'),\n at: z.string().regex(HHMM).describe('Local wall-clock time, \"HH:MM\".'),\n tz: z.string().describe('IANA timezone name.'),\n })\n .strict()\n .superRefine((clock, ctx) => {\n const fail = (message: string) => ctx.addIssue({ code: 'custom', message, path: ['on'] });\n if (clock.every === 'day' && clock.on !== undefined) fail('a daily clock takes no `on`');\n if (clock.every === 'week' && !(typeof clock.on === 'string' && WEEKDAYS.some((d) => d === clock.on)))\n fail('a weekly clock needs `on` as a weekday (mon..sun)');\n if (clock.every === 'month' && typeof clock.on !== 'number') fail('a monthly clock needs `on` as a day number');\n if (clock.every === 'year' && !(typeof clock.on === 'string' && MMDD.test(clock.on)))\n fail('a yearly clock needs `on` as \"MM-DD\"');\n })\n .describe('Repeats: fires on every day, week, month or year, at a time of day, until the reflex is removed.');\n\nexport const ClockOnceSchema = z\n .object({\n at: z.string().regex(LOCAL_DATETIME).describe('A fixed local date and time, once: \"YYYY-MM-DDTHH:MM\" or, to the second, \"YYYY-MM-DDTHH:MM:SS\".'),\n tz: z.string().describe('IANA timezone name.'),\n })\n .strict()\n .describe('Once: fires at one date and time, then never again.');\n\nexport const ClockTriggerSchema = z\n .object({ clock: z.union([ClockRecurringSchema, ClockOnceSchema]) })\n .strict()\n .describe('Fires on the calendar: once, at a date and time, or repeating at a time of day.');\n\nexport const OpSchema = z.enum(['insert', 'update', 'delete']);\n\nexport const WriteTriggerSchema = z\n .object({\n fact: z\n .object({\n entity: z.string().describe('The table or entity whose writes wake this reflex.'),\n op: OpSchema.optional().describe('Narrow to one op — \"only on create\" is op: \"insert\".'),\n })\n .strict(),\n })\n .strict()\n .describe('Fires when a row of an entity is written — created, changed or deleted.');\n\nexport const SignalTriggerSchema = z\n .object({ fact: z.object({ signal: z.string().describe('A named external intake.') }).strict() })\n .strict()\n .describe('Fires when an event arrives from outside, on a named intake.');\n\nexport const RunTriggerSchema = z\n .object({\n fact: z\n .object({ run: z.string().describe('A reflex id — fires when THAT reflex\\'s run settles. Fan-in and dependency.') })\n .strict(),\n })\n .strict()\n .describe('Fires when another reflex has run: one automation after another.');\n\nexport const ManualTriggerSchema = z\n .object({ manual: z.object({}).strict() })\n .strict()\n .describe('Fires only when somebody fires it by hand.');\n\nexport const TriggerSchema = z.union([\n ClockTriggerSchema,\n WriteTriggerSchema,\n SignalTriggerSchema,\n RunTriggerSchema,\n ManualTriggerSchema,\n]);\n\nexport type ClockRecurring = z.infer<typeof ClockRecurringSchema>;\nexport type ClockOnce = z.infer<typeof ClockOnceSchema>;\nexport type Clock = ClockRecurring | ClockOnce;\nexport type Trigger = z.infer<typeof TriggerSchema>;\nexport type Op = z.infer<typeof OpSchema>;\nexport type Weekday = (typeof WEEKDAYS)[number];\n\nexport const clockOf = (trigger: Trigger): Clock | undefined => ('clock' in trigger ? trigger.clock : undefined);\n\nexport const isRecurring = (clock: Clock): clock is ClockRecurring => 'every' in clock;\n\nexport const factOf = (\n trigger: Trigger,\n): { entity?: string; op?: Op; signal?: string; run?: string } | undefined =>\n 'fact' in trigger ? trigger.fact : undefined;\n\nexport const isManual = (trigger: Trigger): boolean => 'manual' in trigger;\n","import { z } from 'zod';\nimport { OpSchema } from './trigger.schema';\n\nexport const FactKindSchema = z.enum(['write', 'signal', 'manual', 'run']);\n\nexport const FactInputSchema = z\n .object({\n kind: FactKindSchema,\n\n entity: z.string().optional().describe('Which table or entity was written.'),\n op: OpSchema.optional().describe('Ops are distinct stimuli — \"only on create\" is op: \"insert\".'),\n row: z.record(z.string(), z.unknown()).optional().describe('The row, as the write returned it.'),\n\n name: z.string().optional().describe('Which named intake this arrived on.'),\n payload: z.unknown().optional().describe('The event body — validated at the HOST boundary before it gets here.'),\n\n reflex: z.string().optional(),\n runId: z.string().optional(),\n occurrence: z.string().optional().describe('The calendar key, when the clock was the cause.'),\n stats: z\n .object({ total: z.number().int(), done: z.number().int(), failed: z.number().int() })\n .strict()\n .optional(),\n\n target: z.string().optional().describe('The one reflex a manual fact is aimed at.'),\n by: z.string().optional().describe('Who fired it — recorded on the firing as manual:<who>.'),\n\n at: z.number().int().describe('Supplied by the caller. Tide reads no clocks.'),\n notBefore: z.number().int().optional().describe('A delayed fact — timers as data, visible and queryable.'),\n dedupeKey: z.string().optional().describe('Provider event ids. A repeat is refused and announced as fact.deduped; it is not an error.'),\n cause: z.string().optional().describe('Set by tide when an effect emits — the causality chain.'),\n })\n .strict()\n .superRefine((fact, ctx) => {\n const require = (field: keyof typeof fact, why: string) => {\n if (fact[field] === undefined)\n ctx.addIssue({ code: 'custom', message: `a ${fact.kind} fact needs \\`${String(field)}\\` — ${why}`, path: [field] });\n };\n const refuse = (field: keyof typeof fact) => {\n if (fact[field] !== undefined)\n ctx.addIssue({ code: 'custom', message: `\\`${String(field)}\\` is not part of a ${fact.kind} fact`, path: [field] });\n };\n\n if (fact.kind === 'write') {\n require('entity', 'it is what a write trigger matches on');\n refuse('name');\n refuse('target');\n refuse('runId');\n }\n if (fact.kind === 'signal') {\n require('name', 'it is which named intake this arrived on');\n refuse('entity');\n refuse('op');\n refuse('target');\n refuse('runId');\n }\n if (fact.kind === 'manual') {\n require('target', 'a manual fact is aimed at exactly one reflex');\n refuse('entity');\n refuse('name');\n refuse('runId');\n }\n if (fact.kind === 'run') {\n require('reflex', 'it is whose run settled');\n require('runId', 'it is which run settled');\n refuse('entity');\n refuse('name');\n refuse('target');\n }\n });\n\nexport type FactInput = z.infer<typeof FactInputSchema>;\nexport type FactKind = z.infer<typeof FactKindSchema>;\n","import { z } from 'zod';\nimport { FactKindSchema, OpSchema } from '../../schemas';\nimport type { TableName, TideTables } from '../../types';\n\nexport const SQL_TABLE: Record<TableName, string> = {\n fact: 'tide_fact',\n run: 'tide_run',\n task: 'tide_work',\n state: 'tide_reflex_state',\n};\n\n// `as` is an SQL keyword: the one field whose column is named otherwise.\nconst COLUMN_OVERRIDES: Record<string, string> = { as: 'as_who' };\n\nexport const snake = (field: string): string => COLUMN_OVERRIDES[field] ?? field.replace(/[A-Z]/g, (c) => `_${c.toLowerCase()}`);\n\nconst camel = (column: string): string => {\n for (const [field, mapped] of Object.entries(COLUMN_OVERRIDES)) if (mapped === column) return field;\n return column.replace(/_([a-z])/g, (_all, c: string) => c.toUpperCase());\n};\n\nconst JSON_COLUMNS = new Set(['row', 'payload', 'stats', 'fact_ids', 'env', 'input', 'output']);\nconst BIGINT_COLUMNS = new Set([\n 'at',\n 'not_before',\n 'delivered_at',\n 'depth',\n 'descendants',\n 'due_at',\n 'created_at',\n 'settled_at',\n 'claimed_until',\n 'armed_at',\n 'materialized_through',\n 'attempt',\n 'selected',\n 'total',\n 'done',\n 'failed',\n]);\n\nexport const toColumn = (column: string, value: unknown): unknown => {\n if (value === undefined) return null;\n if (JSON_COLUMNS.has(column)) return JSON.stringify(value);\n return value;\n};\n\nconst fromColumn = (column: string, value: unknown): unknown => {\n if (value === null) return undefined;\n if (JSON_COLUMNS.has(column)) return typeof value === 'string' ? JSON.parse(value) : value;\n // `bigint` comes back as a string from some drivers and a number from\n // others, and the engine compares these with `<`.\n if (BIGINT_COLUMNS.has(column)) return Number(value);\n return value;\n};\n\nconst FactRowSchema = z.object({\n id: z.string(),\n kind: FactKindSchema,\n entity: z.string().optional(),\n op: OpSchema.optional(),\n row: z.record(z.string(), z.unknown()).optional(),\n name: z.string().optional(),\n payload: z.unknown().optional(),\n reflex: z.string().optional(),\n runId: z.string().optional(),\n occurrence: z.string().optional(),\n stats: z.object({ total: z.number(), done: z.number(), failed: z.number() }).optional(),\n target: z.string().optional(),\n by: z.string().optional(),\n at: z.number(),\n notBefore: z.number().optional(),\n dedupeKey: z.string().optional(),\n cause: z.string().optional(),\n depth: z.number(),\n deliveredAt: z.number().optional(),\n parked: z.string().optional(),\n released: z.boolean().optional(),\n as: z.string().optional(),\n root: z.string().optional(),\n descendants: z.number().optional(),\n});\n\nconst RunRowSchema = z.object({\n id: z.string(),\n reflexId: z.string(),\n version: z.string(),\n as: z.string().optional(),\n cause: z.string(),\n occurrence: z.string().optional(),\n factIds: z.array(z.string()).optional(),\n state: z.enum(['pending', 'fanned', 'settled', 'skipped']),\n depth: z.number(),\n selected: z.number().optional(),\n total: z.number(),\n done: z.number(),\n failed: z.number(),\n dueAt: z.number(),\n createdAt: z.number(),\n settledAt: z.number().optional(),\n drained: z.boolean().optional(),\n note: z.string().optional(),\n});\n\nconst TaskRowSchema = z.object({\n id: z.string(),\n runId: z.string(),\n reflexId: z.string(),\n unit: z.string(),\n cause: z.string(),\n env: z.record(z.string(), z.unknown()),\n depth: z.number(),\n state: z.enum(['pending', 'claimed', 'retrying', 'done', 'failed']),\n attempt: z.number(),\n token: z.string().optional(),\n claimedUntil: z.number(),\n notBefore: z.number(),\n input: z.unknown().optional(),\n output: z.unknown().optional(),\n error: z.string().optional(),\n createdAt: z.number(),\n settledAt: z.number().optional(),\n});\n\nconst StateRowSchema = z.object({\n reflexId: z.string(),\n armedAt: z.number(),\n materializedThrough: z.number().optional(),\n});\n\nconst ROW_SCHEMAS: { [T in TableName]: z.ZodType<TideTables[T]> } = {\n fact: FactRowSchema,\n run: RunRowSchema,\n task: TaskRowSchema,\n state: StateRowSchema,\n};\n\nexport const rowToEntity = <T extends TableName>(table: T, row: Record<string, unknown>): TideTables[T] => {\n const entity: Record<string, unknown> = {};\n for (const [column, value] of Object.entries(row)) {\n const mapped = fromColumn(column, value);\n if (mapped !== undefined) entity[camel(column)] = mapped;\n }\n const read = ROW_SCHEMAS[table].safeParse(entity);\n if (!read.success) {\n const misfits = read.error.issues.map((issue) => `${issue.path.join('.')}: ${issue.message}`).join('; ');\n throw new Error(`tide store: a row of ${SQL_TABLE[table]} does not read as a ${table} (${misfits})`);\n }\n return read.data;\n};\n","import { z } from 'zod';\nimport type { Comparison, Order } from '../../types';\nimport { snake, toColumn } from './rows';\n\nexport type Fields = Readonly<Record<string, unknown>>;\ntype Ordering = readonly { by: string; dir?: 'asc' | 'desc' }[];\n\nconst COMPARATORS = [\n ['eq', '='],\n ['ne', '<>'],\n ['lt', '<'],\n ['lte', '<='],\n ['gt', '>'],\n ['gte', '>='],\n] as const;\n\nconst ComparisonSchema = z.object({\n eq: z.unknown().optional(),\n ne: z.unknown().optional(),\n lt: z.unknown().optional(),\n lte: z.unknown().optional(),\n gt: z.unknown().optional(),\n gte: z.unknown().optional(),\n in: z.array(z.unknown()).readonly().optional(),\n notIn: z.array(z.unknown()).readonly().optional(),\n isNull: z.boolean().optional(),\n}) satisfies z.ZodType<Comparison<unknown>>;\n\nconst comparisonOn = (field: string, test: object): Comparison<unknown> => {\n const read = ComparisonSchema.safeParse(test);\n if (read.success) return read.data;\n const misfits = read.error.issues.map((issue) => `${issue.path.join('.')}: ${issue.message}`).join('; ');\n throw new Error(`tide store: what \"${field}\" is compared with does not read as a comparison (${misfits})`);\n};\n\ntype Bind = { sql: string; params: unknown[] };\n\nexport const compileWhere = (where: Fields | undefined, start: number, alias = ''): Bind => {\n const clauses: string[] = [];\n const params: unknown[] = [];\n const prefix = alias === '' ? '' : `${alias}.`;\n const slot = (value: unknown): string => {\n params.push(value);\n return `$${start + params.length - 1}`;\n };\n\n for (const [field, test] of Object.entries(where ?? {})) {\n const column = `${prefix}${snake(field)}`;\n const bare = snake(field);\n if (test === null || typeof test !== 'object' || Array.isArray(test)) {\n clauses.push(test === undefined ? `${column} IS NULL` : `${column} = ${slot(toColumn(bare, test))}`);\n continue;\n }\n\n const comparison = comparisonOn(field, test);\n for (const [op, symbol] of COMPARATORS) {\n const operand = comparison[op];\n if (operand === undefined) continue;\n // `ne` must be true for a NULL column: a run that has never been\n // drained is not drained, and plain SQL `<>` answers NULL there.\n clauses.push(op === 'ne' ? `(${column} IS NULL OR ${column} <> ${slot(toColumn(bare, operand))})` : `${column} ${symbol} ${slot(toColumn(bare, operand))}`);\n }\n if (comparison.in !== undefined) clauses.push(`${column} = ANY(${slot(comparison.in.map((value) => toColumn(bare, value)))})`);\n if (comparison.notIn !== undefined) clauses.push(`NOT (${column} = ANY(${slot(comparison.notIn.map((value) => toColumn(bare, value)))}))`);\n if (comparison.isNull !== undefined) clauses.push(comparison.isNull ? `${column} IS NULL` : `${column} IS NOT NULL`);\n }\n\n return { sql: clauses.length === 0 ? 'TRUE' : clauses.join(' AND '), params };\n};\n\nexport const compileOrder = (order: Ordering | undefined, alias = ''): string => {\n if (order === undefined || order.length === 0) return '';\n const prefix = alias === '' ? '' : `${alias}.`;\n return ` ORDER BY ${order.map((key) => `${prefix}${snake(key.by)} ${key.dir === 'desc' ? 'DESC' : 'ASC'}`).join(', ')}`;\n};\n\nexport const sortRows = <R>(rows: readonly R[], order: Order<R> | undefined): R[] => {\n if (order === undefined || order.length === 0) return [...rows];\n return [...rows].sort((left, right) => {\n for (const key of order) {\n const a: unknown = left[key.by];\n const b: unknown = right[key.by];\n const compared = typeof a === 'number' && typeof b === 'number' ? a - b : String(a) < String(b) ? -1 : String(a) > String(b) ? 1 : 0;\n if (compared !== 0) return compared * (key.dir === 'desc' ? -1 : 1);\n }\n return 0;\n });\n};\n\nexport const compileSet = (set: Fields, start: number): Bind => {\n const assignments: string[] = [];\n const params: unknown[] = [];\n for (const [field, value] of Object.entries(set)) {\n const column = snake(field);\n if (value !== null && typeof value === 'object' && 'inc' in value) {\n assignments.push(`${column} = coalesce(${column}, 0) + ${Number(value.inc)}`);\n continue;\n }\n params.push(toColumn(column, value));\n assignments.push(`${column} = $${start + params.length - 1}`);\n }\n return { sql: assignments.join(', '), params };\n};\n","import type { ClaimSpec, TableName, TideStore } from '../../types';\nimport { compileOrder, compileSet, compileWhere, sortRows } from './compile';\nimport type { Fields } from './compile';\nimport type { Atomically, Client } from './pool';\nimport { SQL_TABLE, rowToEntity, snake } from './rows';\n\ntype ClaimParts = { client: Client; atomically: Atomically; ready: Promise<void> };\n\nexport const claimOver =\n ({ client, atomically, ready }: ClaimParts): TideStore['claim'] =>\n async <T extends TableName>(spec: ClaimSpec<T>) => {\n await ready;\n const table = SQL_TABLE[spec.table];\n const order = compileOrder(spec.order, 'c');\n\n const take =async (db: Client, extra: Fields, limit: number) => {\n if (limit <= 0) return [];\n const where = compileWhere({ ...spec.where, ...extra }, 1, 'c');\n const set = compileSet(spec.set, where.params.length + 1);\n const result = await db.query(\n `UPDATE ${table} SET ${set.sql}\n WHERE ctid IN (\n SELECT c.ctid FROM ${table} c WHERE ${where.sql}${order}\n LIMIT ${Math.floor(limit)} FOR UPDATE SKIP LOCKED\n )\n RETURNING *`,\n [...where.params, ...set.params],\n );\n // ORDER BY inside the subquery decides which rows are taken, not the order RETURNING hands them\n // back, and the engine runs tasks in the order a claim returns them.\n return sortRows(result.rows.map((row) => rowToEntity(spec.table, row)), spec.order);\n };\n\n if (spec.onePer === undefined) return take(client, {}, spec.limit);\n\n // Postgres refuses a window function beside FOR UPDATE, so the restricted groups are claimed one\n // at a time. Asking whether a group is held and then claiming in it are two statements: they run\n // in a transaction behind an advisory lock on the group, because under READ COMMITTED two\n // instances would both be told nothing is held.\n const { column, held, only } = spec.onePer;\n const restricted = [...only];\n // Room is reserved for the serial groups before the bulk claim, or a busy parallel reflex starves them.\n const claimed = await take(client, { [column]: { notIn: restricted } }, spec.limit - restricted.length);\n\n const takeOneOf = (group: string) =>\n atomically(async (tx) => {\n const lock = await tx.query('SELECT pg_try_advisory_xact_lock(hashtext($1), hashtext($2)) AS free', [`tide:${table}.${snake(column)}`, group]);\n if (lock.rows[0]?.['free'] !== true) return [];\n const busy = compileWhere({ ...held, [column]: group }, 1, 'c');\n const taken = await tx.query(`SELECT c.id FROM ${table} c WHERE ${busy.sql} LIMIT 1`, busy.params);\n if (taken.rows.length > 0) return [];\n return take(tx, { [column]: group }, 1);\n });\n\n for (const group of restricted) {\n if (claimed.length >= spec.limit) break;\n claimed.push(...(await takeOneOf(group)));\n }\n\n return claimed;\n };\n","import type { Sequence } from '@niscorp/strata';\n\nexport const TIDE_TABLES = ['tide_fact', 'tide_run', 'tide_work', 'tide_reflex_state'] as const;\n\n// Migration 1 of `nisc.moss.tide`: databases have run it, and editing it makes every one of them\n// refuse to boot (strata: EDITED). Change the tables by appending a migration to the sequence.\nexport const TIDE_DDL = `\nCREATE TABLE IF NOT EXISTS tide_fact (\n id text PRIMARY KEY,\n kind text NOT NULL CHECK (kind IN ('write','signal','manual','run')),\n entity text,\n op text CHECK (op IN ('insert','update','delete')),\n row jsonb,\n name text,\n payload jsonb,\n reflex text,\n run_id text,\n occurrence text,\n stats jsonb,\n target text,\n by text,\n at bigint NOT NULL,\n not_before bigint,\n dedupe_key text,\n cause text,\n depth integer NOT NULL DEFAULT 0,\n delivered_at bigint,\n parked text,\n released boolean,\n -- WHOSE FACT THIS IS. The identity of the reflex that minted it, absent on\n -- anything the host ingested. The matcher refuses to hand a fact minted\n -- under one identity to a reflex running under another, which is the only\n -- thing standing between a carried row and somebody else's effect — tide is\n -- the one place a row travels without being read, so no scope policy is\n -- consulted on the way.\n as_who text\n);\n\n-- A PARTIAL index, because a fact with no dedupeKey is not claiming to be\n-- unique: it is a distinct occurrence of something, not a repeat of it.\n-- entity is in the key: without it, two producers over different tables\n-- that agreed on a key value silently ate each other's rows.\nCREATE UNIQUE INDEX IF NOT EXISTS tide_fact_dedupe\n ON tide_fact (kind, coalesce(entity,''), coalesce(name,''), dedupe_key)\n WHERE dedupe_key IS NOT NULL;\n\n-- The matcher's query, every advance.\nCREATE INDEX IF NOT EXISTS tide_fact_due\n ON tide_fact (at) WHERE delivered_at IS NULL AND parked IS NULL;\nCREATE INDEX IF NOT EXISTS tide_fact_swept ON tide_fact (delivered_at);\n\nCREATE TABLE IF NOT EXISTS tide_run (\n id text PRIMARY KEY,\n reflex_id text NOT NULL,\n version text NOT NULL,\n as_who text,\n cause text NOT NULL,\n occurrence text,\n fact_ids jsonb,\n state text NOT NULL CHECK (state IN ('pending','fanned','settled','skipped')),\n depth integer NOT NULL DEFAULT 0,\n selected integer,\n total integer NOT NULL DEFAULT 0,\n done integer NOT NULL DEFAULT 0,\n failed integer NOT NULL DEFAULT 0,\n due_at bigint NOT NULL,\n created_at bigint NOT NULL,\n settled_at bigint,\n drained boolean,\n note text,\n -- THE IDEMPOTENCY. One constraint, every trigger kind: an occurrence\n -- cannot open twice, a replayed fact cannot open twice, and two instances\n -- ticking at the same moment contend instead of duplicating.\n UNIQUE (reflex_id, cause)\n);\n\nCREATE INDEX IF NOT EXISTS tide_run_pending ON tide_run (state, due_at);\nCREATE INDEX IF NOT EXISTS tide_run_ledger ON tide_run (reflex_id, created_at DESC);\nCREATE INDEX IF NOT EXISTS tide_run_swept ON tide_run (settled_at);\n\nCREATE TABLE IF NOT EXISTS tide_work (\n id text PRIMARY KEY,\n -- ON DELETE CASCADE, because a run and its work are one fact about the\n -- world. Sweeping runs and leaving work destroys the UNIQUE(run_id, unit)\n -- row that IS the \"this unit already ran\" record — and a restore then\n -- re-charges the invoice.\n run_id text NOT NULL REFERENCES tide_run(id) ON DELETE CASCADE,\n reflex_id text NOT NULL,\n unit text NOT NULL,\n cause text NOT NULL,\n env jsonb NOT NULL,\n depth integer NOT NULL DEFAULT 0,\n state text NOT NULL CHECK (state IN ('pending','claimed','retrying','done','failed')),\n attempt integer NOT NULL DEFAULT 0,\n token text,\n -- Zero, never null, when unclaimed: \"never claimed or lapsed\" is then one\n -- comparison rather than a disjunction.\n claimed_until bigint NOT NULL DEFAULT 0,\n not_before bigint NOT NULL,\n input jsonb,\n output jsonb,\n error text,\n created_at bigint NOT NULL,\n settled_at bigint,\n UNIQUE (run_id, unit)\n);\n\nCREATE INDEX IF NOT EXISTS tide_work_claimable ON tide_work (state, not_before, claimed_until);\nCREATE INDEX IF NOT EXISTS tide_work_run ON tide_work (run_id);\nCREATE INDEX IF NOT EXISTS tide_work_swept ON tide_work (settled_at);\n\nCREATE TABLE IF NOT EXISTS tide_reflex_state (\n reflex_id text PRIMARY KEY,\n armed_at bigint NOT NULL DEFAULT 0,\n materialized_through bigint\n);\n\n-- Polls are gone (the vex bridge pushes writes — a poll could only\n-- re-discover them late), and their cursor state goes with them. IF EXISTS,\n-- so a store created after the removal is not asked to drop what it never had.\nALTER TABLE tide_reflex_state DROP COLUMN IF EXISTS poll_cursor;\nALTER TABLE tide_reflex_state DROP COLUMN IF EXISTS poll_seen;\nALTER TABLE tide_reflex_state DROP COLUMN IF EXISTS polled_at;\n`;\n\n// Split on every `;`, for migration 1 only: a different split is a different history, and\n// this one's checksum is in every ledger. A new sequence uses strata's `sqlSteps`.\nconst statementsOf = (ddl: string): { kind: 'sql'; sql: string }[] =>\n ddl\n .split(';')\n .map((chunk) => chunk.trim())\n .filter((chunk) => chunk.split('\\n').some((line) => line.trim() !== '' && !line.trim().startsWith('--')))\n .map((sql) => ({ kind: 'sql', sql }));\n\n// The id says `moss` and stays: every ledger that has run this sequence holds its rows under it.\nexport const TIDE_SEQUENCE: Sequence = {\n id: 'nisc.moss.tide',\n migrations: [\n { description: 'The tide store: facts, runs, work and reflex state, converged from any earlier shape', steps: statementsOf(TIDE_DDL) },\n {\n description: 'A fact carries its chain root, and a root counts what its chain minted (tide maxChainFacts)',\n steps: [\n { kind: 'sql', sql: 'ALTER TABLE tide_fact ADD COLUMN IF NOT EXISTS root text' },\n { kind: 'sql', sql: 'ALTER TABLE tide_fact ADD COLUMN IF NOT EXISTS descendants integer' },\n ],\n },\n ],\n};\n","import { migrate as migrateLedger } from '@niscorp/strata/postgres';\nimport { PRIMARY_KEY, UNIQUE_BY } from '../../types';\nimport type { Mutation, QuerySpec, RemoveSpec, TableName, TideStore, TideTables, Where } from '../../types';\nimport { claimOver } from './claim';\nimport { compileOrder, compileSet, compileWhere } from './compile';\nimport type { Fields } from './compile';\nimport type { Atomically, Client, TidePool } from './pool';\nimport { SQL_TABLE, rowToEntity, snake, toColumn } from './rows';\nimport { TIDE_SEQUENCE } from './tables';\n\nconst mintId = ((): ((table: TableName) => string) => {\n let sequence = 0;\n return (table) => {\n sequence += 1;\n return `${table}_${Date.now().toString(36)}_${sequence.toString(36)}`;\n };\n})();\n\nexport type TideStoreOptions = {\n migrate?: boolean;\n};\n\nexport const createTideStore = (pool: TidePool, options: TideStoreOptions = {}): TideStore & { ready: Promise<void> } => {\n // Every method awaits this: one that did not would race the DDL and throw `42P01 undefined_table`.\n const ready: Promise<void> = options.migrate === false ? Promise.resolve() : migrateLedger(pool, [TIDE_SEQUENCE]).then(() => undefined);\n // An unhandled rejection is process-fatal on Node ≥ 15. Every method that\n // awaits `ready` still rejects with it.\n ready.catch(() => undefined);\n\n const overPool: Atomically = (fn) => {\n if (pool.transaction === undefined)\n throw new Error('tide store: this pool cannot transact — fan-out, attempt recording and a serial claim are transactions, not conventions');\n return pool.transaction(fn);\n };\n\n const build = (client: Client, atomically: Atomically): TideStore => {\n const store: TideStore = {\n query: async <T extends TableName>(spec: QuerySpec<T>) => {\n await ready;\n const where = compileWhere(spec.where, 1);\n const limit = spec.limit === undefined ? '' : ` LIMIT ${Math.max(0, Math.floor(spec.limit))}`;\n const result = await client.query(\n `SELECT * FROM ${SQL_TABLE[spec.table]} WHERE ${where.sql}${compileOrder(spec.order)}${limit}`,\n where.params,\n );\n return result.rows.map((row) => rowToEntity(spec.table, row));\n },\n\n appendIfAbsent: async <T extends TableName>(table: T, input: Omit<TideTables[T], 'id'> & { id?: string }) => {\n await ready;\n const given: Fields = input;\n const withId: Fields = PRIMARY_KEY[table] === 'id' ? { ...given, id: input.id ?? mintId(table) } : given;\n const entries = Object.entries(withId).filter(([, value]) => value !== undefined);\n const columns = entries.map(([field]) => snake(field));\n const params = entries.map(([field, value]) => toColumn(snake(field), value));\n\n const unique = UNIQUE_BY[table];\n const target =\n unique.when === undefined\n ? `(${unique.by.map((column) => snake(column)).join(', ')})`\n : `(${unique.by.map((column) => (column === 'entity' || column === 'name' ? `coalesce(${snake(column)},'')` : snake(column))).join(', ')}) WHERE ${snake(unique.when)} IS NOT NULL`;\n\n const result = await client.query(\n `INSERT INTO ${SQL_TABLE[table]} (${columns.join(', ')}) VALUES (${params.map((_value, index) => `$${index + 1}`).join(', ')})\n ON CONFLICT ${target} DO NOTHING RETURNING *`,\n params,\n );\n const row = result.rows[0];\n return row === undefined ? undefined : rowToEntity(table, row);\n },\n\n claim: claimOver({ client, atomically, ready }),\n\n cas: async <T extends TableName>(table: T, id: string, expect: Where<TideTables[T]>, set: Mutation<TideTables[T]>) => {\n await ready;\n const key = snake(PRIMARY_KEY[table]);\n const where = compileWhere(expect, 2);\n const patch = compileSet(set, where.params.length + 2);\n const result = await client.query(\n `UPDATE ${SQL_TABLE[table]} SET ${patch.sql} WHERE ${key} = $1 AND ${where.sql} RETURNING ${key}`,\n [id, ...where.params, ...patch.params],\n );\n return result.rows.length > 0;\n },\n\n remove: async <T extends TableName>(spec: RemoveSpec<T>) => {\n await ready;\n const where = compileWhere(spec.where, 1);\n // A run's work goes with it through the foreign key (ON DELETE CASCADE).\n const result = await client.query(`DELETE FROM ${SQL_TABLE[spec.table]} WHERE ${where.sql} RETURNING ${snake(PRIMARY_KEY[spec.table])}`, where.params);\n return result.rows.length;\n },\n\n transact: async <T>(fn: (tx: TideStore) => Promise<T>): Promise<T> => {\n await ready;\n return atomically((tx) => fn(build(tx, (inner) => inner(tx))));\n },\n };\n return store;\n };\n\n return { ...build(pool, overPool), ready };\n};\n"]}
package/dist/postgres.js CHANGED
@@ -1,5 +1,5 @@
1
- import { PRIMARY_KEY, UNIQUE_BY } from './chunk-4CUQXWVY.js';
2
- import { FactKindSchema, OpSchema } from './chunk-UEG3UZDG.js';
1
+ import { PRIMARY_KEY, UNIQUE_BY } from './chunk-7KHOAJNL.js';
2
+ import { FactKindSchema, OpSchema } from './chunk-4TXWZFRE.js';
3
3
  import { migrate } from '@niscorp/strata/postgres';
4
4
  import { z } from 'zod';
5
5
 
@@ -422,7 +422,6 @@ var createTideStore = (pool, options = {}) => {
422
422
  );
423
423
  return result.rows.map((row) => rowToEntity(spec.table, row));
424
424
  },
425
- // The refusal is the database's, decided under the constraint, not a read the caller races.
426
425
  appendIfAbsent: async (table, input) => {
427
426
  await ready;
428
427
  const given = input;