hierarchical-approval 3.0.0 → 3.2.0

package/dist/{instance-BvOyT00S.d.cts → instance-BXHxvTLE.d.cts}

@@ -261,6 +261,16 @@ interface ApprovalLevelInstance {
     escalationDueAt?: Date;
     escalationAfterDays?: number;
     escalationAfterHours?: number;
+    /**
+     * When this level started collecting decisions.
+     *
+     * Escalation rungs are measured from here. Recorded on the level rather than
+     * inferred from the audit trail, because a `level_advanced` entry carries only
+     * the group's lowest level number — so an upper branch of a parallel group had
+     * no entry to find, and its rungs were measured from the previous escalation
+     * instead.
+     */
+    openedAt?: Date;
     /** How many escalation rungs have fired on this level. */
     escalationStep?: number;
     /** When the next reminder for this level is due; cleared when the level closes. */

package/dist/{instance-BvOyT00S.d.ts → instance-BXHxvTLE.d.ts}

@@ -261,6 +261,16 @@ interface ApprovalLevelInstance {
     escalationDueAt?: Date;
     escalationAfterDays?: number;
     escalationAfterHours?: number;
+    /**
+     * When this level started collecting decisions.
+     *
+     * Escalation rungs are measured from here. Recorded on the level rather than
+     * inferred from the audit trail, because a `level_advanced` entry carries only
+     * the group's lowest level number — so an upper branch of a parallel group had
+     * no entry to find, and its rungs were measured from the previous escalation
+     * instead.
+     */
+    openedAt?: Date;
     /** How many escalation rungs have fired on this level. */
     escalationStep?: number;
     /** When the next reminder for this level is due; cleared when the level closes. */

package/dist/nestjs.cjs

@@ -201,6 +201,7 @@ function reviveDates(instance) {
       if (l.escalationDueAt) level.escalationDueAt = new Date(l.escalationDueAt);
       if (l.delegatedUntil) level.delegatedUntil = new Date(l.delegatedUntil);
       if (l.reminderDueAt) level.reminderDueAt = new Date(l.reminderDueAt);
+      if (l.openedAt) level.openedAt = new Date(l.openedAt);
       return level;
     })
   };
@@ -303,9 +304,8 @@ var MemoryAdapter = class {
   }
   async getOverdueInstances(tenantId, asOf, filter = {}) {
     return [...this.instances.values()].filter((i) => {
-      if (i.tenantId !== tenantId || i.status !== "pending") return false;
-      if (filter.documentType && i.documentType !== filter.documentType) return false;
-      if (filter.submittedBy && i.submittedBy !== filter.submittedBy) return false;
+      if (i.tenantId !== tenantId) return false;
+      if (!applyFilter(i, { ...filter, status: "pending" })) return false;
       const hasOverdueEscalation = i.levels.some(
         (l) => l.escalationDueAt != null && new Date(l.escalationDueAt) <= asOf
       );
@@ -4071,6 +4071,7 @@ var ApprovalEngine = class _ApprovalEngine {
       remindersSent: 0
     };
     if (opts.open) {
+      level.openedAt = opts.now;
       level.escalationDueAt = this.levelEscalationDue(opts.now, cfg, opts.firstRung);
       this.scheduleReminder(level, opts.now);
     }
@@ -4113,6 +4114,7 @@ var ApprovalEngine = class _ApprovalEngine {
    * the ladder no worse off than the single-step behaviour it replaces.
    */
   levelOpenedAt(instance, level, fallback) {
+    if (level.openedAt) return new Date(level.openedAt);
     for (let i = instance.auditLog.length - 1; i >= 0; i--) {
       const entry = instance.auditLog[i];
       if (!entry) continue;
@@ -4233,6 +4235,7 @@ var ApprovalEngine = class _ApprovalEngine {
           now
         );
       }
+      lvl.openedAt = now;
       lvl.escalationDueAt = this.levelEscalationDue(now, lvl, firstRung);
       lvl.escalationStep = 0;
       this.scheduleReminder(lvl, now);