@chipmobilesdk/rn-notification 0.6.0 → 0.7.0

package/lib/module/reconcile/duplicates.js

@@ -0,0 +1,56 @@
+"use strict";
+
+/**
+ * Duplicate identifier resolution.
+ *
+ * An identifier appearing twice in one desired set means the caller's key
+ * derivation produced two notifications for one identity. That is a bug, not a
+ * preference, so the package refuses rather than silently picking a winner.
+ *
+ * **Every** copy is rejected — no entry wins. Order-independence then follows
+ * for free rather than having to be engineered: there is no "first" or "last"
+ * to depend on.
+ *
+ * The rule applies even to byte-identical duplicates. Treating those as
+ * mergeable would require a deep-equality definition that becomes a contract of
+ * its own, and a repeated identifier is a key-derivation bug either way.
+ */
+
+import { DIAGNOSTIC_CODES } from "../contract/errors.js";
+/**
+ * Splits a desired set into applicable entries and rejections.
+ *
+ * `existingIds` lets the rejection state whether a notification already
+ * scheduled under that identifier was left in place — without it a caller could
+ * reasonably read "rejected" as "cancelled".
+ */
+export function splitDuplicates(desired, existingIds = new Set()) {
+  const counts = new Map();
+  for (const request of desired) {
+    counts.set(request.id, (counts.get(request.id) ?? 0) + 1);
+  }
+  const unique = [];
+  const rejected = [];
+  for (const request of desired) {
+    if ((counts.get(request.id) ?? 0) === 1) {
+      unique.push(request);
+    }
+  }
+
+  // Sorted so the report itself is order-independent, not merely its effect.
+  const repeated = [...counts.entries()].filter(([, count]) => count > 1).sort(([a], [b]) => a < b ? -1 : a > b ? 1 : 0);
+  for (const [id, occurrences] of repeated) {
+    rejected.push({
+      id,
+      code: DIAGNOSTIC_CODES.DUPLICATE_IDENTIFIER,
+      reason: `Identifier appeared ${occurrences} times in one desired set. Every copy was rejected, because the package cannot know which was intended.` + (existingIds.has(id) ? ' Any notification already scheduled under it was left in place — this is a rejection, not a cancellation.' : ''),
+      occurrences,
+      existingLeftInPlace: existingIds.has(id)
+    });
+  }
+  return {
+    unique,
+    rejected
+  };
+}
+//# sourceMappingURL=duplicates.js.map

package/lib/module/reconcile/duplicates.js.map

@@ -0,0 +1 @@
+{"version":3,"names":["DIAGNOSTIC_CODES","splitDuplicates","desired","existingIds","Set","counts","Map","request","set","id","get","unique","rejected","push","repeated","entries","filter","count","sort","a","b","occurrences","code","DUPLICATE_IDENTIFIER","reason","has","existingLeftInPlace"],"sourceRoot":"../../../src","sources":["reconcile/duplicates.ts"],"mappings":";;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAIA,SAASA,gBAAgB,QAAQ,uBAAoB;AASrD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASC,eAAeA,CAC9BC,OAAuC,EACvCC,WAAgC,GAAG,IAAIC,GAAG,CAAC,CAAC,EAC3B;EACjB,MAAMC,MAAM,GAAG,IAAIC,GAAG,CAAiB,CAAC;EACxC,KAAK,MAAMC,OAAO,IAAIL,OAAO,EAAE;IAC9BG,MAAM,CAACG,GAAG,CAACD,OAAO,CAACE,EAAE,EAAE,CAACJ,MAAM,CAACK,GAAG,CAACH,OAAO,CAACE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;EAC1D;EAEA,MAAME,MAA6B,GAAG,EAAE;EACxC,MAAMC,QAAyB,GAAG,EAAE;EAEpC,KAAK,MAAML,OAAO,IAAIL,OAAO,EAAE;IAC9B,IAAI,CAACG,MAAM,CAACK,GAAG,CAACH,OAAO,CAACE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;MACxCE,MAAM,CAACE,IAAI,CAACN,OAAO,CAAC;IACrB;EACD;;EAEA;EACA,MAAMO,QAAQ,GAAG,CAAC,GAAGT,MAAM,CAACU,OAAO,CAAC,CAAC,CAAC,CACpCC,MAAM,CAAC,CAAC,GAAGC,KAAK,CAAC,KAAKA,KAAK,GAAG,CAAC,CAAC,CAChCC,IAAI,CAAC,CAAC,CAACC,CAAC,CAAC,EAAE,CAACC,CAAC,CAAC,KAAMD,CAAC,GAAGC,CAAC,GAAG,CAAC,CAAC,GAAGD,CAAC,GAAGC,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;EAElD,KAAK,MAAM,CAACX,EAAE,EAAEY,WAAW,CAAC,IAAIP,QAAQ,EAAE;IACzCF,QAAQ,CAACC,IAAI,CAAC;MACbJ,EAAE;MACFa,IAAI,EAAEtB,gBAAgB,CAACuB,oBAAoB;MAC3CC,MAAM,EACL,uBAAuBH,WAAW,yGAAyG,IAC1IlB,WAAW,CAACsB,GAAG,CAAChB,EAAE,CAAC,GACjB,2GAA2G,GAC3G,EAAE,CAAC;MACPY,WAAW;MACXK,mBAAmB,EAAEvB,WAAW,CAACsB,GAAG,CAAChB,EAAE;IACxC,CAAC,CAAC;EACH;EAEA,OAAO;IAAEE,MAAM;IAAEC;EAAS,CAAC;AAC5B","ignoreList":[]}

package/lib/module/reconcile/index.js

@@ -0,0 +1,161 @@
+"use strict";
+
+/**
+ * The reconciliation operation.
+ *
+ * A caller hands over the complete set its data implies; the package works out
+ * what to add, replace, and remove. This is **never** run automatically — only
+ * the caller knows what its data implies, and a package that guessed a desired
+ * set would cancel notifications it does not understand.
+ *
+ * Overlapping calls are serialized rather than run concurrently, because two
+ * passes interleaving their cancels and creates is exactly how duplicates
+ * appear.
+ */
+
+import { DIAGNOSTIC_CODES } from "../contract/errors.js";
+import { anchorMoment } from "../schedule/anchor.js";
+import { resolveMoment } from "../schedule/resolve-moment.js";
+import { validateRequest } from "../schedule/index.js";
+import { isNotificationError } from "../contract/errors.js";
+import { splitDuplicates } from "./duplicates.js";
+import { truncateToCeiling } from "./truncate.js";
+import { createScheduleWriter } from "../schedule/writer.js";
+import { diff } from "./diff.js";
+import { applyInChunks } from "./chunk.js";
+/**
+ * Narrows the device set to the caller's declared domain.
+ *
+ * Everything outside it is invisible to this pass, which is what makes it safe
+ * to cancel strays: a notification from another domain or another library is
+ * never a stray, it simply is not ours.
+ */
+function inDomain(entry, input) {
+  if (entry.pushCreated && input.includePushCreated !== true) return false;
+  return entry.groupTag === input.domain;
+}
+export function createReconciler(deps) {
+  const emit = deps.emit ?? (() => {});
+  const writer = createScheduleWriter(deps.engine);
+  let inFlight = Promise.resolve();
+  const run = async input => {
+    const startedAt = deps.now();
+    const zone = deps.timeZone();
+    const everything = await deps.engine.getPending();
+    const device = everything.filter(entry => inDomain(entry, input));
+    // The ceiling is the platform's, shared with every other domain, every
+    // recurring series and every directly scheduled notification. Budgeting a
+    // domain against the whole of it let two domains and a series overflow iOS's
+    // 64 together while each reported "nothing truncated" (NOT-11).
+    const heldElsewhere = everything.length - device.length;
+    const existingIds = new Set(device.map(entry => entry.id));
+
+    // Duplicates first: a repeated identifier is refused before anything else
+    // looks at it, so no later stage has to decide which copy it meant.
+    const {
+      unique,
+      rejected: duplicateRejections
+    } = splitDuplicates(input.desired, existingIds);
+    const rejected = [...duplicateRejections];
+
+    // Validate and anchor. A rejection here removes one entry; it never fails
+    // the pass, because 499 valid entries should not be lost to one bad one.
+    const valid = [];
+    const resolvedAt = new Map();
+    for (const request of unique) {
+      try {
+        validateRequest(request, deps.resolveTone);
+        const anchored = anchorMoment(request.moment, zone);
+        const resolution = resolveMoment(anchored.resolvedAt, deps.now());
+        resolvedAt.set(request.id, resolution.at);
+        valid.push(request);
+      } catch (error) {
+        rejected.push({
+          id: request.id,
+          code: isNotificationError(error) ? error.code : 'UNKNOWN',
+          reason: error instanceof Error ? error.message : String(error),
+          occurrences: 1,
+          existingLeftInPlace: existingIds.has(request.id)
+        });
+      }
+    }
+
+    // Stop markers occupy real platform capacity, so the ceiling a consumer's
+    // notifications can actually use is smaller than the platform's own.
+    // Hiding that would let the package quietly reduce how many notifications
+    // fit and report a full set as registered when it was not.
+    // One pass: the outstanding stop markers are read once for the capacity and
+    // every operation below, not once per operation (NOT-08).
+    const pass = writer.pass();
+    const {
+      kept,
+      report: truncation
+    } = truncateToCeiling(valid, resolvedAt, Math.max(0, (await pass.capacity()) - heldElsewhere));
+    if (truncation !== undefined) {
+      emit(DIAGNOSTIC_CODES.TRUNCATED_OVER_CEILING, `Desired set exceeded the platform ceiling of ${truncation.ceiling}; ${truncation.droppedCount} furthest-out entries were not registered. They are re-evaluated at the next window refresh.`, {
+        ceiling: truncation.ceiling,
+        dropped: truncation.droppedCount
+      });
+    }
+
+    // Every rejected identifier is protected from cancellation. A rejection
+    // means the package could not tell what the caller intended, and
+    // destroying the existing notification on that basis would be the worst
+    // available answer (FR-028c).
+    const {
+      operations,
+      unchanged
+    } = diff({
+      desired: kept,
+      resolvedAt,
+      device,
+      protectedIds: new Set(rejected.map(entry => entry.id))
+    });
+    const created = [];
+    const replaced = [];
+    const cancelled = [];
+    const approximate = !deps.canScheduleExactly();
+    await applyInChunks(operations, async operation => {
+      if (operation.kind === 'cancel') {
+        await pass.cancel(operation.id);
+        cancelled.push(operation.id);
+        return;
+      }
+      const request = operation.request;
+      const tone = deps.resolveTone(request.tone);
+      await pass.write({
+        request,
+        resolvedAt: operation.resolvedAt,
+        tone,
+        anchoringGeneration: (request.moment.anchoring ?? 'wallClock') === 'absolute' ? undefined : zone,
+        approximate
+      });
+      (operation.kind === 'create' ? created : replaced).push(operation.id);
+    }, {
+      size: deps.chunkSize
+    });
+    return {
+      domain: input.domain,
+      created,
+      replaced,
+      cancelled,
+      unchanged,
+      rejected,
+      truncated: truncation,
+      operationCount: operations.length,
+      durationMs: deps.now() - startedAt
+    };
+  };
+  return {
+    /**
+     * Serialized against itself: a second call waits for the first rather than
+     * interleaving with it.
+     */
+    async reconcile(input) {
+      const next = inFlight.then(() => run(input), () => run(input));
+      inFlight = next.catch(() => undefined);
+      return next;
+    }
+  };
+}
+//# sourceMappingURL=index.js.map

package/lib/module/reconcile/index.js.map

@@ -0,0 +1 @@
+{"version":3,"names":["DIAGNOSTIC_CODES","anchorMoment","resolveMoment","validateRequest","isNotificationError","splitDuplicates","truncateToCeiling","createScheduleWriter","diff","applyInChunks","inDomain","entry","input","pushCreated","includePushCreated","groupTag","domain","createReconciler","deps","emit","writer","engine","inFlight","Promise","resolve","run","startedAt","now","zone","timeZone","everything","getPending","device","filter","heldElsewhere","length","existingIds","Set","map","id","unique","rejected","duplicateRejections","desired","valid","resolvedAt","Map","request","resolveTone","anchored","moment","resolution","set","at","push","error","code","reason","Error","message","String","occurrences","existingLeftInPlace","has","pass","kept","report","truncation","Math","max","capacity","undefined","TRUNCATED_OVER_CEILING","ceiling","droppedCount","dropped","operations","unchanged","protectedIds","created","replaced","cancelled","approximate","canScheduleExactly","operation","kind","cancel","tone","write","anchoringGeneration","anchoring","size","chunkSize","truncated","operationCount","durationMs","reconcile","next","then","catch"],"sourceRoot":"../../../src","sources":["reconcile/index.ts"],"mappings":";;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAMA,SAASA,gBAAgB,QAAQ,uBAAoB;AACrD,SAASC,YAAY,QAA6B,uBAAoB;AACtE,SAASC,aAAa,QAAQ,+BAA4B;AAC1D,SAASC,eAAe,QAAQ,sBAAa;AAC7C,SAASC,mBAAmB,QAAQ,uBAAoB;AAExD,SAASC,eAAe,QAAQ,iBAAc;AAC9C,SAASC,iBAAiB,QAAQ,eAAY;AAC9C,SAASC,oBAAoB,QAAQ,uBAAoB;AACzD,SAASC,IAAI,QAAQ,WAAQ;AAC7B,SAASC,aAAa,QAAQ,YAAS;AAavC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,QAAQA,CAACC,KAAmB,EAAEC,KAAqB,EAAW;EACtE,IAAID,KAAK,CAACE,WAAW,IAAID,KAAK,CAACE,kBAAkB,KAAK,IAAI,EAAE,OAAO,KAAK;EACxE,OAAOH,KAAK,CAACI,QAAQ,KAAKH,KAAK,CAACI,MAAM;AACvC;AAEA,OAAO,SAASC,gBAAgBA,CAACC,IAA2B,EAAE;EAC7D,MAAMC,IAAI,GAAGD,IAAI,CAACC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC;EACpC,MAAMC,MAAM,GAAGb,oBAAoB,CAACW,IAAI,CAACG,MAAM,CAAC;EAChD,IAAIC,QAAkC,GAAGC,OAAO,CAACC,OAAO,CAAC,CAAwC;EAEjG,MAAMC,GAAG,GAAG,MAAOb,KAAqB,IAA+B;IACtE,MAAMc,SAAS,GAAGR,IAAI,CAACS,GAAG,CAAC,CAAC;IAC5B,MAAMC,IAAI,GAAGV,IAAI,CAACW,QAAQ,CAAC,CAAC;IAE5B,MAAMC,UAAU,GAAG,MAAMZ,IAAI,CAACG,MAAM,CAACU,UAAU,CAAC,CAAC;IACjD,MAAMC,MAAM,GAAGF,UAAU,CAACG,MAAM,CAACtB,KAAK,IAAID,QAAQ,CAACC,KAAK,EAAEC,KAAK,CAAC,CAAC;IACjE;IACA;IACA;IACA;IACA,MAAMsB,aAAa,GAAGJ,UAAU,CAACK,MAAM,GAAGH,MAAM,CAACG,MAAM;IACvD,MAAMC,WAAW,GAAG,IAAIC,GAAG,CAACL,MAAM,CAACM,GAAG,CAAC3B,KAAK,IAAIA,KAAK,CAAC4B,EAAE,CAAC,CAAC;;IAE1D;IACA;IACA,MAAM;MAAEC,MAAM;MAAEC,QAAQ,EAAEC;IAAoB,CAAC,GAAGrC,eAAe,CAACO,KAAK,CAAC+B,OAAO,EAAEP,WAAW,CAAC;IAC7F,MAAMK,QAAyB,GAAG,CAAC,GAAGC,mBAAmB,CAAC;;IAE1D;IACA;IACA,MAAME,KAA4B,GAAG,EAAE;IACvC,MAAMC,UAAU,GAAG,IAAIC,GAAG,CAAiB,CAAC;IAE5C,KAAK,MAAMC,OAAO,IAAIP,MAAM,EAAE;MAC7B,IAAI;QACHrC,eAAe,CAAC4C,OAAO,EAAE7B,IAAI,CAAC8B,WAAW,CAAC;QAC1C,MAAMC,QAAQ,GAAGhD,YAAY,CAAC8C,OAAO,CAACG,MAAM,EAAEtB,IAAI,CAAC;QACnD,MAAMuB,UAAU,GAAGjD,aAAa,CAAC+C,QAAQ,CAACJ,UAAU,EAAE3B,IAAI,CAACS,GAAG,CAAC,CAAC,CAAC;QACjEkB,UAAU,CAACO,GAAG,CAACL,OAAO,CAACR,EAAE,EAAEY,UAAU,CAACE,EAAE,CAAC;QACzCT,KAAK,CAACU,IAAI,CAACP,OAAO,CAAC;MACpB,CAAC,CAAC,OAAOQ,KAAK,EAAE;QACfd,QAAQ,CAACa,IAAI,CAAC;UACbf,EAAE,EAAEQ,OAAO,CAACR,EAAE;UACdiB,IAAI,EAAEpD,mBAAmB,CAACmD,KAAK,CAAC,GAAGA,KAAK,CAACC,IAAI,GAAG,SAAS;UACzDC,MAAM,EAAEF,KAAK,YAAYG,KAAK,GAAGH,KAAK,CAACI,OAAO,GAAGC,MAAM,CAACL,KAAK,CAAC;UAC9DM,WAAW,EAAE,CAAC;UACdC,mBAAmB,EAAE1B,WAAW,CAAC2B,GAAG,CAAChB,OAAO,CAACR,EAAE;QAChD,CAAC,CAAC;MACH;IACD;;IAEA;IACA;IACA;IACA;IACA;IACA;IACA,MAAMyB,IAAI,GAAG5C,MAAM,CAAC4C,IAAI,CAAC,CAAC;IAC1B,MAAM;MAAEC,IAAI;MAAEC,MAAM,EAAEC;IAAW,CAAC,GAAG7D,iBAAiB,CACrDsC,KAAK,EACLC,UAAU,EACVuB,IAAI,CAACC,GAAG,CAAC,CAAC,EAAE,CAAC,MAAML,IAAI,CAACM,QAAQ,CAAC,CAAC,IAAIpC,aAAa,CACpD,CAAC;IAED,IAAIiC,UAAU,KAAKI,SAAS,EAAE;MAC7BpD,IAAI,CACHnB,gBAAgB,CAACwE,sBAAsB,EACvC,gDAAgDL,UAAU,CAACM,OAAO,KAAKN,UAAU,CAACO,YAAY,8FAA8F,EAC5L;QAAED,OAAO,EAAEN,UAAU,CAACM,OAAO;QAAEE,OAAO,EAAER,UAAU,CAACO;MAAa,CACjE,CAAC;IACF;;IAEA;IACA;IACA;IACA;IACA,MAAM;MAAEE,UAAU;MAAEC;IAAU,CAAC,GAAGrE,IAAI,CAAC;MACtCmC,OAAO,EAAEsB,IAAI;MACbpB,UAAU;MACVb,MAAM;MACN8C,YAAY,EAAE,IAAIzC,GAAG,CAACI,QAAQ,CAACH,GAAG,CAAC3B,KAAK,IAAIA,KAAK,CAAC4B,EAAE,CAAC;IACtD,CAAC,CAAC;IAEF,MAAMwC,OAAiB,GAAG,EAAE;IAC5B,MAAMC,QAAkB,GAAG,EAAE;IAC7B,MAAMC,SAAmB,GAAG,EAAE;IAC9B,MAAMC,WAAW,GAAG,CAAChE,IAAI,CAACiE,kBAAkB,CAAC,CAAC;IAE9C,MAAM1E,aAAa,CAClBmE,UAAU,EACV,MAAMQ,SAAS,IAAI;MAClB,IAAIA,SAAS,CAACC,IAAI,KAAK,QAAQ,EAAE;QAChC,MAAMrB,IAAI,CAACsB,MAAM,CAACF,SAAS,CAAC7C,EAAE,CAAC;QAC/B0C,SAAS,CAAC3B,IAAI,CAAC8B,SAAS,CAAC7C,EAAE,CAAC;QAC5B;MACD;MAEA,MAAMQ,OAAO,GAAGqC,SAAS,CAACrC,OAAQ;MAClC,MAAMwC,IAAI,GAAGrE,IAAI,CAAC8B,WAAW,CAACD,OAAO,CAACwC,IAAI,CAAE;MAC5C,MAAMvB,IAAI,CAACwB,KAAK,CAAC;QAChBzC,OAAO;QACPF,UAAU,EAAEuC,SAAS,CAACvC,UAAW;QACjC0C,IAAI;QACJE,mBAAmB,EAClB,CAAC1C,OAAO,CAACG,MAAM,CAACwC,SAAS,IAAI,WAAW,MAAM,UAAU,GAAGnB,SAAS,GAAG3C,IAAI;QAC5EsD;MACD,CAAC,CAAC;MACF,CAACE,SAAS,CAACC,IAAI,KAAK,QAAQ,GAAGN,OAAO,GAAGC,QAAQ,EAAE1B,IAAI,CAAC8B,SAAS,CAAC7C,EAAE,CAAC;IACtE,CAAC,EACD;MAAEoD,IAAI,EAAEzE,IAAI,CAAC0E;IAAU,CACxB,CAAC;IAED,OAAO;MACN5E,MAAM,EAAEJ,KAAK,CAACI,MAAM;MACpB+D,OAAO;MACPC,QAAQ;MACRC,SAAS;MACTJ,SAAS;MACTpC,QAAQ;MACRoD,SAAS,EAAE1B,UAAU;MACrB2B,cAAc,EAAElB,UAAU,CAACzC,MAAM;MACjC4D,UAAU,EAAE7E,IAAI,CAACS,GAAG,CAAC,CAAC,GAAGD;IAC1B,CAAC;EACF,CAAC;EAED,OAAO;IACN;AACF;AACA;AACA;IACE,MAAMsE,SAASA,CAACpF,KAAqB,EAA4B;MAChE,MAAMqF,IAAI,GAAG3E,QAAQ,CAAC4E,IAAI,CACzB,MAAMzE,GAAG,CAACb,KAAK,CAAC,EAChB,MAAMa,GAAG,CAACb,KAAK,CAChB,CAAC;MACDU,QAAQ,GAAG2E,IAAI,CAACE,KAAK,CAAC,MAAM5B,SAAS,CAA6B;MAClE,OAAO0B,IAAI;IACZ;EACD,CAAC;AACF","ignoreList":[]}

package/lib/module/reconcile/truncate.js

@@ -0,0 +1,46 @@
+"use strict";
+
+/**
+ * Platform-ceiling truncation.
+ *
+ * iOS keeps only the 64 soonest pending notifications and silently discards the
+ * rest. The package computes the same cut deliberately, so the outcome is
+ * reported rather than discovered as missing notifications.
+ *
+ * Soonest-first is the only rule that degrades gracefully: dropped entries are
+ * not lost, they are simply not yet registered, and each window refresh
+ * registers those that have moved into range.
+ */
+
+/**
+ * Keeps the `ceiling` soonest entries.
+ *
+ * Ties on the delivery instant are broken by identifier so the cut is
+ * deterministic — otherwise two runs over the same data could drop different
+ * entries and the idempotence guarantee would not hold.
+ */
+export function truncateToCeiling(desired, resolvedAt, ceiling) {
+  if (desired.length <= ceiling) {
+    return {
+      kept: desired
+    };
+  }
+  const ordered = [...desired].sort((a, b) => {
+    const aAt = resolvedAt.get(a.id) ?? a.moment.at;
+    const bAt = resolvedAt.get(b.id) ?? b.moment.at;
+    if (aAt !== bAt) return aAt - bAt;
+    return a.id < b.id ? -1 : a.id > b.id ? 1 : 0;
+  });
+  const kept = ordered.slice(0, ceiling);
+  const dropped = ordered.slice(ceiling);
+  return {
+    kept,
+    report: {
+      ceiling,
+      droppedCount: dropped.length,
+      droppedIds: dropped.map(entry => entry.id),
+      reEvaluatedOnNextRefresh: true
+    }
+  };
+}
+//# sourceMappingURL=truncate.js.map

package/lib/module/reconcile/truncate.js.map

@@ -0,0 +1 @@
+{"version":3,"names":["truncateToCeiling","desired","resolvedAt","ceiling","length","kept","ordered","sort","a","b","aAt","get","id","moment","at","bAt","slice","dropped","report","droppedCount","droppedIds","map","entry","reEvaluatedOnNextRefresh"],"sourceRoot":"../../../src","sources":["reconcile/truncate.ts"],"mappings":";;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAUA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASA,iBAAiBA,CAChCC,OAAuC,EACvCC,UAAuC,EACvCC,OAAe,EACK;EACpB,IAAIF,OAAO,CAACG,MAAM,IAAID,OAAO,EAAE;IAC9B,OAAO;MAAEE,IAAI,EAAEJ;IAAQ,CAAC;EACzB;EAEA,MAAMK,OAAO,GAAG,CAAC,GAAGL,OAAO,CAAC,CAACM,IAAI,CAAC,CAACC,CAAC,EAAEC,CAAC,KAAK;IAC3C,MAAMC,GAAG,GAAGR,UAAU,CAACS,GAAG,CAACH,CAAC,CAACI,EAAE,CAAC,IAAIJ,CAAC,CAACK,MAAM,CAACC,EAAE;IAC/C,MAAMC,GAAG,GAAGb,UAAU,CAACS,GAAG,CAACF,CAAC,CAACG,EAAE,CAAC,IAAIH,CAAC,CAACI,MAAM,CAACC,EAAE;IAC/C,IAAIJ,GAAG,KAAKK,GAAG,EAAE,OAAOL,GAAG,GAAGK,GAAG;IACjC,OAAOP,CAAC,CAACI,EAAE,GAAGH,CAAC,CAACG,EAAE,GAAG,CAAC,CAAC,GAAGJ,CAAC,CAACI,EAAE,GAAGH,CAAC,CAACG,EAAE,GAAG,CAAC,GAAG,CAAC;EAC9C,CAAC,CAAC;EAEF,MAAMP,IAAI,GAAGC,OAAO,CAACU,KAAK,CAAC,CAAC,EAAEb,OAAO,CAAC;EACtC,MAAMc,OAAO,GAAGX,OAAO,CAACU,KAAK,CAACb,OAAO,CAAC;EAEtC,OAAO;IACNE,IAAI;IACJa,MAAM,EAAE;MACPf,OAAO;MACPgB,YAAY,EAAEF,OAAO,CAACb,MAAM;MAC5BgB,UAAU,EAAEH,OAAO,CAACI,GAAG,CAACC,KAAK,IAAIA,KAAK,CAACV,EAAE,CAAC;MAC1CW,wBAAwB,EAAE;IAC3B;EACD,CAAC;AACF","ignoreList":[]}

package/lib/module/recurrence/clock-guard.js

@@ -0,0 +1,60 @@
+"use strict";
+
+/**
+ * Clock-discontinuity bounding.
+ *
+ * A device clock moved backwards makes past occurrences look future again. Left
+ * alone, the next expansion would re-register every occurrence the user already
+ * received, and moving the clock forward again would fire them all at once.
+ *
+ * The guard is deliberately blunt: occurrences at or before the last horizon the
+ * series already expanded through are never re-emitted. The package would
+ * rather lose an occurrence after a manual clock change than deliver a burst of
+ * notifications for events that already happened.
+ */
+
+/** A jump larger than this is treated as a clock change rather than ordinary drift. */
+export const CLOCK_DISCONTINUITY_THRESHOLD_MS = 60 * 60 * 1000;
+/**
+ * Drops occurrences that a clock discontinuity would otherwise resurrect.
+ *
+ * Forward jumps are detected and reported but not filtered: an occurrence that
+ * became due because time genuinely passed is legitimate, and the platform's
+ * own delivery is the right place for it to be resolved.
+ */
+export function guardAgainstClockChange(input) {
+  const {
+    occurrences,
+    previousHorizon,
+    now,
+    previousNow
+  } = input;
+  let discontinuity = 'none';
+  if (previousNow !== undefined) {
+    const delta = now - previousNow;
+    if (delta < -CLOCK_DISCONTINUITY_THRESHOLD_MS) {
+      discontinuity = 'backwards';
+    } else if (delta > CLOCK_DISCONTINUITY_THRESHOLD_MS * 24) {
+      discontinuity = 'forwards';
+    }
+  }
+  if (previousHorizon === undefined) {
+    return {
+      occurrences,
+      suppressed: 0,
+      discontinuity
+    };
+  }
+
+  // Anything at or before the previously-expanded horizon was already handled
+  // once. Re-emitting it would mean delivering a notification for an event the
+  // user has already seen.
+  const kept = occurrences.filter(occurrence => occurrence.at > previousHorizon || occurrence.at > now);
+  const alreadyHandled = occurrences.filter(occurrence => occurrence.at <= previousHorizon && occurrence.at <= now);
+  return {
+    occurrences: kept,
+    suppressed: alreadyHandled.length,
+    discontinuity
+  };
+}
+//# sourceMappingURL=clock-guard.js.map

package/lib/module/recurrence/clock-guard.js.map

@@ -0,0 +1 @@
+{"version":3,"names":["CLOCK_DISCONTINUITY_THRESHOLD_MS","guardAgainstClockChange","input","occurrences","previousHorizon","now","previousNow","discontinuity","undefined","delta","suppressed","kept","filter","occurrence","at","alreadyHandled","length"],"sourceRoot":"../../../src","sources":["recurrence/clock-guard.ts"],"mappings":";;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAIA;AACA,OAAO,MAAMA,gCAAgC,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI;AAiB9D;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASC,uBAAuBA,CAACC,KAAsB,EAAoB;EACjF,MAAM;IAAEC,WAAW;IAAEC,eAAe;IAAEC,GAAG;IAAEC;EAAY,CAAC,GAAGJ,KAAK;EAEhE,IAAIK,aAAgD,GAAG,MAAM;EAC7D,IAAID,WAAW,KAAKE,SAAS,EAAE;IAC9B,MAAMC,KAAK,GAAGJ,GAAG,GAAGC,WAAW;IAC/B,IAAIG,KAAK,GAAG,CAACT,gCAAgC,EAAE;MAC9CO,aAAa,GAAG,WAAW;IAC5B,CAAC,MAAM,IAAIE,KAAK,GAAGT,gCAAgC,GAAG,EAAE,EAAE;MACzDO,aAAa,GAAG,UAAU;IAC3B;EACD;EAEA,IAAIH,eAAe,KAAKI,SAAS,EAAE;IAClC,OAAO;MAAEL,WAAW;MAAEO,UAAU,EAAE,CAAC;MAAEH;IAAc,CAAC;EACrD;;EAEA;EACA;EACA;EACA,MAAMI,IAAI,GAAGR,WAAW,CAACS,MAAM,CAC9BC,UAAU,IAAIA,UAAU,CAACC,EAAE,GAAGV,eAAe,IAAIS,UAAU,CAACC,EAAE,GAAGT,GAClE,CAAC;EACD,MAAMU,cAAc,GAAGZ,WAAW,CAACS,MAAM,CACxCC,UAAU,IAAIA,UAAU,CAACC,EAAE,IAAIV,eAAe,IAAIS,UAAU,CAACC,EAAE,IAAIT,GACpE,CAAC;EAED,OAAO;IACNF,WAAW,EAAEQ,IAAI;IACjBD,UAAU,EAAEK,cAAc,CAACC,MAAM;IACjCT;EACD,CAAC;AACF","ignoreList":[]}

package/lib/module/recurrence/expand.js

@@ -0,0 +1,248 @@
+"use strict";
+
+/**
+ * Recurrence expansion.
+ *
+ * Written first-party rather than delegated to an RFC 5545 library, because the
+ * daylight-saving rules here are specified behaviour (FR-008) rather than a
+ * dependency's opinion, and because expansion must be provable with no device.
+ *
+ * Determinism is the hard requirement: the same rule, anchoring mode, zone, and
+ * evaluation moment must produce exactly the same occurrences in the same order
+ * on every run and on both platforms. Without that, reconciliation could not be
+ * idempotent over a recurring series.
+ */
+
+import { DIAGNOSTIC_CODES, NotificationError } from "../contract/errors.js";
+import { instantForParts, partsInZone } from "../schedule/anchor.js";
+const pad = (value, width) => String(value).padStart(width, '0');
+
+/**
+ * The calendar slot of an occurrence: the date and clock time the rule asked
+ * for, in the frame the series is anchored in. Fixed-width, so comparing two
+ * keys as strings compares them in time.
+ */
+export function occurrenceKey(parts) {
+  return `${pad(parts.year, 4)}${pad(parts.month, 2)}${pad(parts.day, 2)}T${pad(parts.hour, 2)}${pad(parts.minute, 2)}`;
+}
+
+/**
+ * Occurrence identity.
+ *
+ * Derived from the series and the calendar slot, not the instant. Re-expanding
+ * the same series produces the same identifiers, which is what lets a refresh
+ * recognize an occurrence it already scheduled. Until 0.4.0 the instant was
+ * used, so after a time-zone change re-anchoring kept the old identifier while
+ * the window refresh derived a new one, and the occurrence was scheduled twice.
+ */
+export function occurrenceId(seriesId, slot) {
+  return `${seriesId}#${typeof slot === 'string' ? slot : occurrenceKey(slot)}`;
+}
+const MS_PER_DAY = 24 * 60 * 60 * 1000;
+function validatePattern(pattern) {
+  const {
+    hour,
+    minute
+  } = pattern;
+  if (!Number.isInteger(hour) || hour < 0 || hour > 23) {
+    throw new NotificationError(DIAGNOSTIC_CODES.INVALID_RECURRENCE, 'Recurrence hour must be an integer from 0 to 23.', {
+      hour
+    });
+  }
+  if (!Number.isInteger(minute) || minute < 0 || minute > 59) {
+    throw new NotificationError(DIAGNOSTIC_CODES.INVALID_RECURRENCE, 'Recurrence minute must be an integer from 0 to 59.', {
+      minute
+    });
+  }
+  const interval = pattern.interval ?? 1;
+  if (!Number.isInteger(interval) || interval < 1) {
+    throw new NotificationError(DIAGNOSTIC_CODES.INVALID_RECURRENCE, 'Recurrence interval must be a positive integer.', {
+      interval
+    });
+  }
+  if (pattern.kind === 'weekly') {
+    if (pattern.weekdays.length === 0) {
+      throw new NotificationError(DIAGNOSTIC_CODES.INVALID_RECURRENCE, 'A weekly recurrence must name at least one weekday.');
+    }
+    for (const day of pattern.weekdays) {
+      if (!Number.isInteger(day) || day < 0 || day > 6) {
+        throw new NotificationError(DIAGNOSTIC_CODES.INVALID_RECURRENCE, 'Weekdays must be integers from 0 (Sunday) to 6 (Saturday).', {
+          day
+        });
+      }
+    }
+  }
+  if (pattern.kind === 'monthlyByDay') {
+    if (!Number.isInteger(pattern.dayOfMonth) || pattern.dayOfMonth < 1 || pattern.dayOfMonth > 31) {
+      throw new NotificationError(DIAGNOSTIC_CODES.INVALID_RECURRENCE, 'Day of month must be an integer from 1 to 31.', {
+        dayOfMonth: pattern.dayOfMonth
+      });
+    }
+  }
+}
+
+/** Calendar date in the anchoring zone, carrying the pattern's clock time. */
+function partsFor(date, pattern) {
+  return {
+    year: date.year,
+    month: date.month,
+    day: date.day,
+    hour: pattern.hour,
+    minute: pattern.minute,
+    second: 0
+  };
+}
+function addDays(parts, days) {
+  const shifted = new Date(Date.UTC(parts.year, parts.month - 1, parts.day) + days * MS_PER_DAY);
+  return {
+    year: shifted.getUTCFullYear(),
+    month: shifted.getUTCMonth() + 1,
+    day: shifted.getUTCDate(),
+    hour: parts.hour,
+    minute: parts.minute,
+    second: 0
+  };
+}
+function weekdayOf(parts) {
+  return new Date(Date.UTC(parts.year, parts.month - 1, parts.day)).getUTCDay();
+}
+function daysInMonth(year, month) {
+  return new Date(Date.UTC(year, month, 0)).getUTCDate();
+}
+/**
+ * Expands a rule inside the lookahead window.
+ *
+ * Bounded by both a duration and a count, because either alone fails: a
+ * duration alone lets a frequent series exhaust the platform ceiling, and a
+ * count alone leaves an annual series scheduled a decade out.
+ */
+export function expand(input) {
+  const {
+    rule,
+    from,
+    lookahead,
+    timeZone
+  } = input;
+  validatePattern(rule.pattern);
+  const anchoring = rule.anchoring ?? 'wallClock';
+  const horizon = from + lookahead.days * MS_PER_DAY;
+  const start = Math.max(rule.startAt ?? from, from);
+  const {
+    lastEmittedKey
+  } = input;
+  const occurrences = [];
+  let cursor = partsFor(partsInZone(start, timeZone), rule.pattern);
+  // Position of the next not-yet-counted occurrence, for count-limited rules.
+  let index = input.alreadyEmitted ?? 0;
+  let exhausted = false;
+
+  // Bounded independently of the emit conditions so a pattern that matches
+  // nothing (e.g. day 31 in February) can never spin forever.
+  const maxIterations = lookahead.days * 2 + 400;
+  for (let iteration = 0; iteration < maxIterations; iteration += 1) {
+    if (occurrences.length >= lookahead.occurrencesPerSeries) break;
+    const candidate = nextCandidate(cursor, rule.pattern, iteration === 0);
+    if (candidate === undefined) break;
+    cursor = candidate;
+    const at = anchoring === 'absolute' ? Date.UTC(cursor.year, cursor.month - 1, cursor.day, cursor.hour, cursor.minute, 0) : instantForParts(cursor, timeZone);
+    if (at > horizon) break;
+    if (at > start) {
+      if (rule.end.kind === 'untilDate' && at > rule.end.until) {
+        exhausted = true;
+        break;
+      }
+      const key = occurrenceKey(cursor);
+      const previouslyEmitted = lastEmittedKey !== undefined && key <= lastEmittedKey;
+      if (!previouslyEmitted && rule.end.kind === 'count' && index >= rule.end.count) {
+        exhausted = true;
+        break;
+      }
+      occurrences.push({
+        id: occurrenceId(rule.id, key),
+        key,
+        seriesId: rule.id,
+        at,
+        anchoring,
+        previouslyEmitted
+      });
+      if (!previouslyEmitted) index += 1;
+    }
+    cursor = advance(cursor, rule.pattern);
+  }
+  return {
+    occurrences,
+    expandedThrough: horizon,
+    exhausted
+  };
+}
+
+/** Moves the cursor onto the first date the pattern actually matches. */
+function nextCandidate(cursor, pattern, isFirst) {
+  if (pattern.kind === 'daily') return cursor;
+  if (pattern.kind === 'weekly') {
+    const wanted = new Set(pattern.weekdays);
+    let candidate = cursor;
+    for (let step = 0; step < 14; step += 1) {
+      if (wanted.has(weekdayOf(candidate))) return candidate;
+      candidate = addDays(candidate, 1);
+    }
+    return undefined;
+  }
+  const monthly = pattern;
+  let candidate = cursor;
+  // Months shorter than the requested day are skipped rather than clamped: a
+  // caller asking for the 31st means the 31st, and inventing the 28th would be
+  // the package deciding something it was not asked to decide.
+  for (let step = 0; step < 48; step += 1) {
+    if (daysInMonth(candidate.year, candidate.month) >= monthly.dayOfMonth) {
+      const onDay = {
+        ...candidate,
+        day: monthly.dayOfMonth
+      };
+      if (isFirst || onDay.day >= candidate.day || step > 0) return onDay;
+    }
+    candidate = firstOfNextMonth(candidate);
+  }
+  return undefined;
+}
+function firstOfNextMonth(parts) {
+  const month = parts.month === 12 ? 1 : parts.month + 1;
+  const year = parts.month === 12 ? parts.year + 1 : parts.year;
+  return {
+    ...parts,
+    year,
+    month,
+    day: 1
+  };
+}
+
+/** Steps the cursor past the occurrence just produced. */
+function advance(cursor, pattern) {
+  const interval = pattern.interval ?? 1;
+  if (pattern.kind === 'daily') {
+    return addDays(cursor, pattern.interval ?? 1);
+  }
+  if (pattern.kind === 'weekly') {
+    const wanted = [...new Set(pattern.weekdays)].sort((a, b) => a - b);
+    const current = weekdayOf(cursor);
+    const next = wanted.find(day => day > current);
+
+    // Wrapping into a new week is where the interval applies — stepping day by
+    // day within the week would multiply the interval by the weekday count.
+    return next === undefined ? addDays(cursor, 7 * interval - current + wanted[0]) : addDays(cursor, next - current);
+  }
+  const monthly = pattern;
+  let year = cursor.year;
+  let month = cursor.month + interval;
+  while (month > 12) {
+    month -= 12;
+    year += 1;
+  }
+  return {
+    ...cursor,
+    year,
+    month,
+    day: Math.min(monthly.dayOfMonth, daysInMonth(year, month))
+  };
+}
+//# sourceMappingURL=expand.js.map

package/lib/module/recurrence/expand.js.map

@@ -0,0 +1 @@
+{"version":3,"names":["DIAGNOSTIC_CODES","NotificationError","instantForParts","partsInZone","pad","value","width","String","padStart","occurrenceKey","parts","year","month","day","hour","minute","occurrenceId","seriesId","slot","MS_PER_DAY","validatePattern","pattern","Number","isInteger","INVALID_RECURRENCE","interval","kind","weekdays","length","dayOfMonth","partsFor","date","second","addDays","days","shifted","Date","UTC","getUTCFullYear","getUTCMonth","getUTCDate","weekdayOf","getUTCDay","daysInMonth","expand","input","rule","from","lookahead","timeZone","anchoring","horizon","start","Math","max","startAt","lastEmittedKey","occurrences","cursor","index","alreadyEmitted","exhausted","maxIterations","iteration","occurrencesPerSeries","candidate","nextCandidate","undefined","at","end","until","key","previouslyEmitted","count","push","id","advance","expandedThrough","isFirst","wanted","Set","step","has","monthly","onDay","firstOfNextMonth","sort","a","b","current","next","find","min"],"sourceRoot":"../../../src","sources":["recurrence/expand.ts"],"mappings":";;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAYA,SAASA,gBAAgB,EAAEC,iBAAiB,QAAQ,uBAAoB;AACxE,SAASC,eAAe,EAAEC,WAAW,QAA6B,uBAAoB;AActF,MAAMC,GAAG,GAAGA,CAACC,KAAa,EAAEC,KAAa,KAAKC,MAAM,CAACF,KAAK,CAAC,CAACG,QAAQ,CAACF,KAAK,EAAE,GAAG,CAAC;;AAEhF;AACA;AACA;AACA;AACA;AACA,OAAO,SAASG,aAAaA,CAACC,KAAqB,EAAU;EAC5D,OAAO,GAAGN,GAAG,CAACM,KAAK,CAACC,IAAI,EAAE,CAAC,CAAC,GAAGP,GAAG,CAACM,KAAK,CAACE,KAAK,EAAE,CAAC,CAAC,GAAGR,GAAG,CAACM,KAAK,CAACG,GAAG,EAAE,CAAC,CAAC,IAAIT,GAAG,CAACM,KAAK,CAACI,IAAI,EAAE,CAAC,CAAC,GAAGV,GAAG,CAACM,KAAK,CAACK,MAAM,EAAE,CAAC,CAAC,EAAE;AACtH;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASC,YAAYA,CAACC,QAAgB,EAAEC,IAA6B,EAAU;EACrF,OAAO,GAAGD,QAAQ,IAAI,OAAOC,IAAI,KAAK,QAAQ,GAAGA,IAAI,GAAGT,aAAa,CAACS,IAAI,CAAC,EAAE;AAC9E;AAEA,MAAMC,UAAU,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI;AAEtC,SAASC,eAAeA,CAACC,OAA0B,EAAQ;EAC1D,MAAM;IAAEP,IAAI;IAAEC;EAAO,CAAC,GAAGM,OAAO;EAEhC,IAAI,CAACC,MAAM,CAACC,SAAS,CAACT,IAAI,CAAC,IAAIA,IAAI,GAAG,CAAC,IAAIA,IAAI,GAAG,EAAE,EAAE;IACrD,MAAM,IAAIb,iBAAiB,CAC1BD,gBAAgB,CAACwB,kBAAkB,EACnC,kDAAkD,EAClD;MAAEV;IAAK,CACR,CAAC;EACF;EACA,IAAI,CAACQ,MAAM,CAACC,SAAS,CAACR,MAAM,CAAC,IAAIA,MAAM,GAAG,CAAC,IAAIA,MAAM,GAAG,EAAE,EAAE;IAC3D,MAAM,IAAId,iBAAiB,CAC1BD,gBAAgB,CAACwB,kBAAkB,EACnC,oDAAoD,EACpD;MAAET;IAAO,CACV,CAAC;EACF;EAEA,MAAMU,QAAQ,GAAGJ,OAAO,CAACI,QAAQ,IAAI,CAAC;EACtC,IAAI,CAACH,MAAM,CAACC,SAAS,CAACE,QAAQ,CAAC,IAAIA,QAAQ,GAAG,CAAC,EAAE;IAChD,MAAM,IAAIxB,iBAAiB,CAC1BD,gBAAgB,CAACwB,kBAAkB,EACnC,iDAAiD,EACjD;MAAEC;IAAS,CACZ,CAAC;EACF;EAEA,IAAIJ,OAAO,CAACK,IAAI,KAAK,QAAQ,EAAE;IAC9B,IAAIL,OAAO,CAACM,QAAQ,CAACC,MAAM,KAAK,CAAC,EAAE;MAClC,MAAM,IAAI3B,iBAAiB,CAC1BD,gBAAgB,CAACwB,kBAAkB,EACnC,qDACD,CAAC;IACF;IACA,KAAK,MAAMX,GAAG,IAAIQ,OAAO,CAACM,QAAQ,EAAE;MACnC,IAAI,CAACL,MAAM,CAACC,SAAS,CAACV,GAAG,CAAC,IAAIA,GAAG,GAAG,CAAC,IAAIA,GAAG,GAAG,CAAC,EAAE;QACjD,MAAM,IAAIZ,iBAAiB,CAC1BD,gBAAgB,CAACwB,kBAAkB,EACnC,4DAA4D,EAC5D;UAAEX;QAAI,CACP,CAAC;MACF;IACD;EACD;EAEA,IAAIQ,OAAO,CAACK,IAAI,KAAK,cAAc,EAAE;IACpC,IACC,CAACJ,MAAM,CAACC,SAAS,CAACF,OAAO,CAACQ,UAAU,CAAC,IACrCR,OAAO,CAACQ,UAAU,GAAG,CAAC,IACtBR,OAAO,CAACQ,UAAU,GAAG,EAAE,EACtB;MACD,MAAM,IAAI5B,iBAAiB,CAC1BD,gBAAgB,CAACwB,kBAAkB,EACnC,+CAA+C,EAC/C;QAAEK,UAAU,EAAER,OAAO,CAACQ;MAAW,CAClC,CAAC;IACF;EACD;AACD;;AAEA;AACA,SAASC,QAAQA,CAChBC,IAAkD,EAClDV,OAA0B,EACT;EACjB,OAAO;IACNV,IAAI,EAAEoB,IAAI,CAACpB,IAAI;IACfC,KAAK,EAAEmB,IAAI,CAACnB,KAAK;IACjBC,GAAG,EAAEkB,IAAI,CAAClB,GAAG;IACbC,IAAI,EAAEO,OAAO,CAACP,IAAI;IAClBC,MAAM,EAAEM,OAAO,CAACN,MAAM;IACtBiB,MAAM,EAAE;EACT,CAAC;AACF;AAEA,SAASC,OAAOA,CAACvB,KAAqB,EAAEwB,IAAY,EAAkB;EACrE,MAAMC,OAAO,GAAG,IAAIC,IAAI,CAACA,IAAI,CAACC,GAAG,CAAC3B,KAAK,CAACC,IAAI,EAAED,KAAK,CAACE,KAAK,GAAG,CAAC,EAAEF,KAAK,CAACG,GAAG,CAAC,GAAGqB,IAAI,GAAGf,UAAU,CAAC;EAC9F,OAAO;IACNR,IAAI,EAAEwB,OAAO,CAACG,cAAc,CAAC,CAAC;IAC9B1B,KAAK,EAAEuB,OAAO,CAACI,WAAW,CAAC,CAAC,GAAG,CAAC;IAChC1B,GAAG,EAAEsB,OAAO,CAACK,UAAU,CAAC,CAAC;IACzB1B,IAAI,EAAEJ,KAAK,CAACI,IAAI;IAChBC,MAAM,EAAEL,KAAK,CAACK,MAAM;IACpBiB,MAAM,EAAE;EACT,CAAC;AACF;AAEA,SAASS,SAASA,CAAC/B,KAAqB,EAAW;EAClD,OAAO,IAAI0B,IAAI,CAACA,IAAI,CAACC,GAAG,CAAC3B,KAAK,CAACC,IAAI,EAAED,KAAK,CAACE,KAAK,GAAG,CAAC,EAAEF,KAAK,CAACG,GAAG,CAAC,CAAC,CAAC6B,SAAS,CAAC,CAAC;AAC9E;AAEA,SAASC,WAAWA,CAAChC,IAAY,EAAEC,KAAa,EAAU;EACzD,OAAO,IAAIwB,IAAI,CAACA,IAAI,CAACC,GAAG,CAAC1B,IAAI,EAAEC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC4B,UAAU,CAAC,CAAC;AACvD;AA4BA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASI,MAAMA,CAACC,KAAkB,EAAgB;EACxD,MAAM;IAAEC,IAAI;IAAEC,IAAI;IAAEC,SAAS;IAAEC;EAAS,CAAC,GAAGJ,KAAK;EACjDzB,eAAe,CAAC0B,IAAI,CAACzB,OAAO,CAAC;EAE7B,MAAM6B,SAAS,GAAGJ,IAAI,CAACI,SAAS,IAAI,WAAW;EAC/C,MAAMC,OAAO,GAAGJ,IAAI,GAAGC,SAAS,CAACd,IAAI,GAAGf,UAAU;EAClD,MAAMiC,KAAK,GAAGC,IAAI,CAACC,GAAG,CAACR,IAAI,CAACS,OAAO,IAAIR,IAAI,EAAEA,IAAI,CAAC;EAClD,MAAM;IAAES;EAAe,CAAC,GAAGX,KAAK;EAEhC,MAAMY,WAAyB,GAAG,EAAE;EACpC,IAAIC,MAAM,GAAG5B,QAAQ,CAAC3B,WAAW,CAACiD,KAAK,EAAEH,QAAQ,CAAC,EAAEH,IAAI,CAACzB,OAAO,CAAC;EACjE;EACA,IAAIsC,KAAK,GAAGd,KAAK,CAACe,cAAc,IAAI,CAAC;EACrC,IAAIC,SAAS,GAAG,KAAK;;EAErB;EACA;EACA,MAAMC,aAAa,GAAGd,SAAS,CAACd,IAAI,GAAG,CAAC,GAAG,GAAG;EAE9C,KAAK,IAAI6B,SAAS,GAAG,CAAC,EAAEA,SAAS,GAAGD,aAAa,EAAEC,SAAS,IAAI,CAAC,EAAE;IAClE,IAAIN,WAAW,CAAC7B,MAAM,IAAIoB,SAAS,CAACgB,oBAAoB,EAAE;IAE1D,MAAMC,SAAS,GAAGC,aAAa,CAACR,MAAM,EAAEZ,IAAI,CAACzB,OAAO,EAAE0C,SAAS,KAAK,CAAC,CAAC;IACtE,IAAIE,SAAS,KAAKE,SAAS,EAAE;IAC7BT,MAAM,GAAGO,SAAS;IAElB,MAAMG,EAAE,GACPlB,SAAS,KAAK,UAAU,GACrBd,IAAI,CAACC,GAAG,CAACqB,MAAM,CAAC/C,IAAI,EAAE+C,MAAM,CAAC9C,KAAK,GAAG,CAAC,EAAE8C,MAAM,CAAC7C,GAAG,EAAE6C,MAAM,CAAC5C,IAAI,EAAE4C,MAAM,CAAC3C,MAAM,EAAE,CAAC,CAAC,GAClFb,eAAe,CAACwD,MAAM,EAAET,QAAQ,CAAC;IAErC,IAAImB,EAAE,GAAGjB,OAAO,EAAE;IAElB,IAAIiB,EAAE,GAAGhB,KAAK,EAAE;MACf,IAAIN,IAAI,CAACuB,GAAG,CAAC3C,IAAI,KAAK,WAAW,IAAI0C,EAAE,GAAGtB,IAAI,CAACuB,GAAG,CAACC,KAAK,EAAE;QACzDT,SAAS,GAAG,IAAI;QAChB;MACD;MACA,MAAMU,GAAG,GAAG9D,aAAa,CAACiD,MAAM,CAAC;MACjC,MAAMc,iBAAiB,GAAGhB,cAAc,KAAKW,SAAS,IAAII,GAAG,IAAIf,cAAc;MAC/E,IAAI,CAACgB,iBAAiB,IAAI1B,IAAI,CAACuB,GAAG,CAAC3C,IAAI,KAAK,OAAO,IAAIiC,KAAK,IAAIb,IAAI,CAACuB,GAAG,CAACI,KAAK,EAAE;QAC/EZ,SAAS,GAAG,IAAI;QAChB;MACD;MAEAJ,WAAW,CAACiB,IAAI,CAAC;QAChBC,EAAE,EAAE3D,YAAY,CAAC8B,IAAI,CAAC6B,EAAE,EAAEJ,GAAG,CAAC;QAC9BA,GAAG;QACHtD,QAAQ,EAAE6B,IAAI,CAAC6B,EAAE;QACjBP,EAAE;QACFlB,SAAS;QACTsB;MACD,CAAC,CAAC;MACF,IAAI,CAACA,iBAAiB,EAAEb,KAAK,IAAI,CAAC;IACnC;IAEAD,MAAM,GAAGkB,OAAO,CAAClB,MAAM,EAAEZ,IAAI,CAACzB,OAAO,CAAC;EACvC;EAEA,OAAO;IACNoC,WAAW;IACXoB,eAAe,EAAE1B,OAAO;IACxBU;EACD,CAAC;AACF;;AAEA;AACA,SAASK,aAAaA,CACrBR,MAAsB,EACtBrC,OAA0B,EAC1ByD,OAAgB,EACa;EAC7B,IAAIzD,OAAO,CAACK,IAAI,KAAK,OAAO,EAAE,OAAOgC,MAAM;EAE3C,IAAIrC,OAAO,CAACK,IAAI,KAAK,QAAQ,EAAE;IAC9B,MAAMqD,MAAM,GAAG,IAAIC,GAAG,CAAE3D,OAAO,CAAmBM,QAAQ,CAAC;IAC3D,IAAIsC,SAAS,GAAGP,MAAM;IACtB,KAAK,IAAIuB,IAAI,GAAG,CAAC,EAAEA,IAAI,GAAG,EAAE,EAAEA,IAAI,IAAI,CAAC,EAAE;MACxC,IAAIF,MAAM,CAACG,GAAG,CAACzC,SAAS,CAACwB,SAAS,CAAC,CAAC,EAAE,OAAOA,SAAS;MACtDA,SAAS,GAAGhC,OAAO,CAACgC,SAAS,EAAE,CAAC,CAAC;IAClC;IACA,OAAOE,SAAS;EACjB;EAEA,MAAMgB,OAAO,GAAG9D,OAA8B;EAC9C,IAAI4C,SAAS,GAAGP,MAAM;EACtB;EACA;EACA;EACA,KAAK,IAAIuB,IAAI,GAAG,CAAC,EAAEA,IAAI,GAAG,EAAE,EAAEA,IAAI,IAAI,CAAC,EAAE;IACxC,IAAItC,WAAW,CAACsB,SAAS,CAACtD,IAAI,EAAEsD,SAAS,CAACrD,KAAK,CAAC,IAAIuE,OAAO,CAACtD,UAAU,EAAE;MACvE,MAAMuD,KAAK,GAAG;QAAE,GAAGnB,SAAS;QAAEpD,GAAG,EAAEsE,OAAO,CAACtD;MAAW,CAAC;MACvD,IAAIiD,OAAO,IAAIM,KAAK,CAACvE,GAAG,IAAIoD,SAAS,CAACpD,GAAG,IAAIoE,IAAI,GAAG,CAAC,EAAE,OAAOG,KAAK;IACpE;IACAnB,SAAS,GAAGoB,gBAAgB,CAACpB,SAAS,CAAC;EACxC;EACA,OAAOE,SAAS;AACjB;AAEA,SAASkB,gBAAgBA,CAAC3E,KAAqB,EAAkB;EAChE,MAAME,KAAK,GAAGF,KAAK,CAACE,KAAK,KAAK,EAAE,GAAG,CAAC,GAAGF,KAAK,CAACE,KAAK,GAAG,CAAC;EACtD,MAAMD,IAAI,GAAGD,KAAK,CAACE,KAAK,KAAK,EAAE,GAAGF,KAAK,CAACC,IAAI,GAAG,CAAC,GAAGD,KAAK,CAACC,IAAI;EAC7D,OAAO;IAAE,GAAGD,KAAK;IAAEC,IAAI;IAAEC,KAAK;IAAEC,GAAG,EAAE;EAAE,CAAC;AACzC;;AAEA;AACA,SAAS+D,OAAOA,CAAClB,MAAsB,EAAErC,OAA0B,EAAkB;EACpF,MAAMI,QAAQ,GAAGJ,OAAO,CAACI,QAAQ,IAAI,CAAC;EAEtC,IAAIJ,OAAO,CAACK,IAAI,KAAK,OAAO,EAAE;IAC7B,OAAOO,OAAO,CAACyB,MAAM,EAAGrC,OAAO,CAAkBI,QAAQ,IAAI,CAAC,CAAC;EAChE;EAEA,IAAIJ,OAAO,CAACK,IAAI,KAAK,QAAQ,EAAE;IAC9B,MAAMqD,MAAM,GAAG,CAAC,GAAG,IAAIC,GAAG,CAAE3D,OAAO,CAAmBM,QAAQ,CAAC,CAAC,CAAC2D,IAAI,CAAC,CAACC,CAAC,EAAEC,CAAC,KAAKD,CAAC,GAAGC,CAAC,CAAC;IACtF,MAAMC,OAAO,GAAGhD,SAAS,CAACiB,MAAM,CAAC;IACjC,MAAMgC,IAAI,GAAGX,MAAM,CAACY,IAAI,CAAC9E,GAAG,IAAIA,GAAG,GAAG4E,OAAO,CAAC;;IAE9C;IACA;IACA,OAAOC,IAAI,KAAKvB,SAAS,GACtBlC,OAAO,CAACyB,MAAM,EAAE,CAAC,GAAGjC,QAAQ,GAAGgE,OAAO,GAAGV,MAAM,CAAC,CAAC,CAAC,CAAC,GACnD9C,OAAO,CAACyB,MAAM,EAAEgC,IAAI,GAAGD,OAAO,CAAC;EACnC;EAEA,MAAMN,OAAO,GAAG9D,OAA8B;EAC9C,IAAIV,IAAI,GAAG+C,MAAM,CAAC/C,IAAI;EACtB,IAAIC,KAAK,GAAG8C,MAAM,CAAC9C,KAAK,GAAGa,QAAQ;EACnC,OAAOb,KAAK,GAAG,EAAE,EAAE;IAClBA,KAAK,IAAI,EAAE;IACXD,IAAI,IAAI,CAAC;EACV;EACA,OAAO;IAAE,GAAG+C,MAAM;IAAE/C,IAAI;IAAEC,KAAK;IAAEC,GAAG,EAAEwC,IAAI,CAACuC,GAAG,CAACT,OAAO,CAACtD,UAAU,EAAEc,WAAW,CAAChC,IAAI,EAAEC,KAAK,CAAC;EAAE,CAAC;AAC/F","ignoreList":[]}