@dotbep/core 0.2.9 → 0.2.11

package/dist/index.js

@@ -1,4 +1,4 @@
-import oe from "jszip";
+import re from "jszip";
 import { z as a, ZodError as Ve } from "zod";
 const He = a.enum([
   "appointing-party",
@@ -55,19 +55,19 @@ const He = a.enum([
 }).describe("A company or discipline group participating in the project. Teams group members under an ISO role and can be assigned RACI responsibilities at the workflow level."), pe = nt.refine((s) => !s.representativeEmail || (s.memberEmails ?? []).includes(s.representativeEmail), {
   message: "representativeEmail must be included in memberEmails.",
   path: ["representativeEmail"]
-}), it = a.enum([
+}), ot = a.enum([
   "project",
   "team",
   "discipline",
   "assetType",
   "lbsZone",
   "lbsLocation"
-]), ot = a.discriminatedUnion("type", [
-  a.object({ type: a.literal("field"), token: it, pattern: a.string().optional() }),
+]), it = a.discriminatedUnion("type", [
+  a.object({ type: a.literal("field"), token: ot, pattern: a.string().optional() }),
   a.object({ type: a.literal("sequence"), padding: a.number().int().min(1).optional() })
 ]), he = a.object({
   delimiter: a.string().min(1),
-  segments: a.array(ot).min(1)
+  segments: a.array(it).min(1)
 }).describe("A structured rule for generating deliverable names. Specifies a delimiter and a sequence of segments that are joined to produce consistent, parseable file names.").refine((s) => s.segments.filter((e) => e.type === "sequence").length <= 1, {
   message: "segments can contain at most one sequence.",
   path: ["segments"]
@@ -87,10 +87,10 @@ const He = a.enum([
   type: Qe,
   description: a.string().optional(),
   lbsNodeIds: a.array(a.string()).optional().describe("ref LBSNode.id[]")
-}).describe("A spatial or functional subdivision of the project. LBS nodes form a hierarchy that scopes deliverables to specific spatial or functional areas."), be = rt.refine((s) => !(s.lbsNodeIds ?? []).includes(s.id), {
+}).describe("A spatial or functional subdivision of the project. LBS nodes form a hierarchy that scopes deliverables to specific spatial or functional areas."), we = rt.refine((s) => !(s.lbsNodeIds ?? []).includes(s.id), {
   message: "A node cannot reference itself in lbsNodeIds.",
   path: ["lbsNodeIds"]
-}), we = a.object({
+}), be = a.object({
   id: a.string().min(1).describe("Used in deliverables nomenclature."),
   name: a.string().min(1)
 }).describe("A project discipline used to classify deliverables and information requirements. Represents a technical domain such as structure, architecture, or MEP."), ve = a.object({
@@ -125,8 +125,12 @@ const He = a.enum([
   guideIds: a.array(a.string()).optional().describe("ref Guide.id[]")
 }).describe("A human-performed activity referenced by workflow process nodes. Actions represent what a person in a given role does at a specific step."), L = a.object({
   key: a.string().min(1),
-  type: a.enum(["string", "number", "boolean", "url"]),
-  required: a.boolean()
+  type: a.enum(["string", "number", "boolean"]),
+  required: a.boolean(),
+  label: a.string().min(1).optional(),
+  description: a.string().optional(),
+  validation: a.object({ pattern: a.string().min(1), flags: a.string().optional() }).optional(),
+  options: a.array(a.string().min(1)).optional()
 }), $e = a.object({
   id: a.string().min(1).describe('Human-readable slug, e.g. "status-changed".'),
   name: a.string().min(1),
@@ -200,7 +204,7 @@ const He = a.enum([
 }).refine((s) => s.operator === "exists" || s.value !== void 0, {
   message: 'value is required when operator is not "exists".',
   path: ["value"]
-}), ee = a.object({
+}), te = a.object({
   from: a.string().describe("ref FlowNode key"),
   to: a.string().describe("ref FlowNode key"),
   label: a.string().optional(),
@@ -208,30 +212,30 @@ const He = a.enum([
 }).refine((s) => s.from !== s.to, {
   message: "A flow edge cannot point from a node to itself.",
   path: ["to"]
-}), gt = ee.extend({
+}), gt = te.extend({
   triggerEventId: a.string().min(1).describe("ref FlowEvent.id — the event that fires this transition")
-}), yt = ee.extend({
+}), yt = te.extend({
   guard: ht.describe("Condition evaluated against the instance context to determine which path to take.")
-}), bt = ee, wt = a.union([gt, yt, bt]), vt = a.object({
+}), wt = te, bt = a.union([gt, yt, wt]), vt = a.object({
   direction: et.default("LR"),
   nodes: a.record(a.string(), pt),
-  edges: a.record(a.string(), wt)
+  edges: a.record(a.string(), bt)
 }).superRefine((s, e) => {
-  const t = Object.entries(s.nodes), n = t.filter(([, r]) => r.type === "start").length, i = t.filter(([, r]) => r.type === "end").length;
+  const t = Object.entries(s.nodes), n = t.filter(([, r]) => r.type === "start").length, o = t.filter(([, r]) => r.type === "end").length;
   n !== 1 && e.addIssue({
     code: "custom",
     message: `Diagram must have exactly one start node (found ${n}).`,
     path: ["nodes"]
-  }), i !== 1 && e.addIssue({
+  }), o !== 1 && e.addIssue({
     code: "custom",
-    message: `Diagram must have exactly one end node (found ${i}).`,
+    message: `Diagram must have exactly one end node (found ${o}).`,
     path: ["nodes"]
   });
-  const o = {};
+  const i = {};
   for (const [r, d] of Object.entries(s.edges))
-    o[d.from] ??= [], o[d.from].push({ edgeId: r, toKey: d.to });
+    i[d.from] ??= [], i[d.from].push({ edgeId: r, toKey: d.to });
   for (const [r, d] of t) {
-    const l = o[r] ?? [];
+    const l = i[r] ?? [];
     d.type === "automation" && (l.length !== 1 ? e.addIssue({
       code: "custom",
       message: `automation node must have exactly one outgoing edge (found ${l.length}).`,
@@ -366,8 +370,8 @@ const He = a.enum([
   teams: a.array(pe),
   phases: a.array(ge),
   milestones: a.array(ye),
-  lbs: a.array(be),
-  disciplines: a.array(we),
+  lbs: a.array(we),
+  disciplines: a.array(be),
   extensions: a.array(ve),
   assetTypes: a.array(Ie),
   softwares: a.array(Ee),
@@ -390,15 +394,15 @@ const He = a.enum([
   deliverables: a.array(De),
   notes: a.array(Fe),
   flags: a.array(Ce)
-}), re = a.object({
+}), ae = a.object({
   version: a.string().regex(/^\d+\.\d+$/).describe('Format: "{major}.{minor}" (e.g. "1.0", "2.3").'),
   date: a.iso.datetime(),
   author: a.email().describe("ref Member.email"),
   description: a.string().min(1),
   diff: a.string().nullable().describe("Relative path to inverse diff (RFC 6902). null on v0.0.")
 }), St = a.discriminatedUnion("type", [
-  re.extend({ type: a.literal("patch") }),
-  re.extend({
+  ae.extend({ type: a.literal("patch") }),
+  ae.extend({
     type: a.literal("version"),
     approvedBy: a.array(a.email()).describe("ref Member.email[]")
   })
@@ -418,24 +422,24 @@ function Rt(s, e) {
   return $t;
 }
 function x(s, e, t) {
-  const n = t?.delimiter ?? kt, i = Rt(s, t);
-  return new RegExp(i).test(e) ? e.includes(n) ? `"${e}" contains the naming delimiter "${n}"` : null : `"${e}" does not match naming pattern ${i} for token "${s}"`;
+  const n = t?.delimiter ?? kt, o = Rt(s, t);
+  return new RegExp(o).test(e) ? e.includes(n) ? `"${e}" contains the naming delimiter "${n}"` : null : `"${e}" does not match naming pattern ${o} for token "${s}"`;
 }
 function Tt(s, e) {
-  const t = [], n = (i, o) => {
-    const r = x(i, o, e);
+  const t = [], n = (o, i) => {
+    const r = x(o, i, e);
     r && t.push(r);
   };
   n("project", s.project.code);
-  for (const i of s.teams) n("team", i.id);
-  for (const i of s.disciplines) n("discipline", i.id);
-  for (const i of s.assetTypes) n("assetType", i.id);
-  for (const i of s.lbs) n(i.type === "zone" ? "lbsZone" : "lbsLocation", i.id);
+  for (const o of s.teams) n("team", o.id);
+  for (const o of s.disciplines) n("discipline", o.id);
+  for (const o of s.assetTypes) n("assetType", o.id);
+  for (const o of s.lbs) n(o.type === "zone" ? "lbsZone" : "lbsLocation", o.id);
   return t;
 }
 class jt {
-  constructor(e, t, n, i, o) {
-    this.getItem = e, this.setItem = t, this.schema = n, this.validate = i, this.getBep = o;
+  constructor(e, t, n, o, i) {
+    this.getItem = e, this.setItem = t, this.schema = n, this.validate = o, this.getBep = i;
   }
   getItem;
   setItem;
@@ -495,26 +499,26 @@ const Ze = [
   { entity: "lbs", references: "lbs", inField: "lbsNodeIds", array: !0 }
 ];
 function At(s, e, t) {
-  return Ze.filter((n) => n.references === e).flatMap((n) => t[n.entity].filter((o) => {
-    const r = o[n.inField];
+  return Ze.filter((n) => n.references === e).flatMap((n) => t[n.entity].filter((i) => {
+    const r = i[n.inField];
     return n.array ? Array.isArray(r) && r.includes(s) : r === s;
-  }).map((o) => {
-    const r = o.id ?? o.email ?? "?";
+  }).map((i) => {
+    const r = i.id ?? i.email ?? "?";
     return `${String(n.entity)}["${r}"].${String(n.inField)}`;
   }));
 }
-function ae(s, e, t) {
+function de(s, e, t) {
   return Ze.filter((n) => n.entity === e).flatMap((n) => {
-    const i = s[n.inField];
-    if (i == null || i === "") return [];
-    const o = n.array ? i : [i], r = t[n.references];
-    return o.filter((d) => !r.some((l) => (l.id ?? l.email) === d)).map((d) => `${String(n.references)}["${d}"] not found`);
+    const o = s[n.inField];
+    if (o == null || o === "") return [];
+    const i = n.array ? o : [o], r = t[n.references];
+    return i.filter((d) => !r.some((l) => (l.id ?? l.email) === d)).map((d) => `${String(n.references)}["${d}"] not found`);
   });
 }
 function K(s) {
   return s instanceof Ve ? s.issues.map((e) => (e.path.length ? e.path.join(".") + ": " : "") + e.message).join("; ") : s.message;
 }
-class y {
+class w {
   constructor(e, t, n) {
     this.getItems = e, this.getBep = t, this.config = n, this.idField = n.idField ?? "id";
   }
@@ -530,23 +534,23 @@ class y {
   }
   get(e) {
     const t = [], n = [];
-    for (const i of e) {
-      const o = this.getItems().find((r) => this.getId(r) === i);
-      o ? t.push(o) : n.push({ id: i, error: `Not found: ${i}` });
+    for (const o of e) {
+      const i = this.getItems().find((r) => this.getId(r) === o);
+      i ? t.push(i) : n.push({ id: o, error: `Not found: ${o}` });
     }
     return { succeeded: t, failed: n };
   }
   add(e) {
     const t = [], n = [];
-    for (const i of e) {
-      const o = { ...i };
-      this.config.autoId && !o[this.idField] && (o[this.idField] = globalThis.crypto.randomUUID());
-      const r = String(o[this.idField] ?? "(unknown)");
+    for (const o of e) {
+      const i = { ...o };
+      this.config.autoId && !i[this.idField] && (i[this.idField] = globalThis.crypto.randomUUID());
+      const r = String(i[this.idField] ?? "(unknown)");
       try {
-        const d = this.config.schema.parse(o);
+        const d = this.config.schema.parse(i);
         if (this.getItems().some((u) => this.getId(u) === this.getId(d)))
           throw new Error(`Already exists: ${this.getId(d)}`);
-        const l = ae(d, this.config.key, this.getBep());
+        const l = de(d, this.config.key, this.getBep());
         if (l.length) throw new Error(l.join("; "));
         const c = this.config.validate?.(d, this.getBep()) ?? [];
         if (c.length) throw new Error(c.join("; "));
@@ -559,47 +563,47 @@ class y {
   }
   update(e) {
     const t = [], n = [];
-    for (const i of e) {
-      const o = String(i[this.idField]), r = this.getItems(), d = r.findIndex((c) => this.getId(c) === o);
+    for (const o of e) {
+      const i = String(o[this.idField]), r = this.getItems(), d = r.findIndex((c) => this.getId(c) === i);
       if (d === -1) {
-        n.push({ id: o, error: `Not found: ${o}` });
+        n.push({ id: i, error: `Not found: ${i}` });
         continue;
       }
-      const l = ae(i, this.config.key, this.getBep());
+      const l = de(o, this.config.key, this.getBep());
       if (l.length) {
-        n.push({ id: o, error: l.join("; ") });
+        n.push({ id: i, error: l.join("; ") });
         continue;
       }
       try {
-        const c = this.config.schema.parse({ ...r[d], ...i }), u = this.config.validate?.(c, this.getBep()) ?? [];
+        const c = this.config.schema.parse({ ...r[d], ...o }), u = this.config.validate?.(c, this.getBep()) ?? [];
         if (u.length) throw new Error(u.join("; "));
         r[d] = c, t.push(r[d]);
       } catch (c) {
-        n.push({ id: o, error: K(c) });
+        n.push({ id: i, error: K(c) });
       }
     }
     return { succeeded: t, failed: n };
   }
   remove(e) {
     const t = [], n = [];
-    for (const i of e) {
-      const o = this.getItems(), r = o.findIndex((d) => this.getId(d) === i);
+    for (const o of e) {
+      const i = this.getItems(), r = i.findIndex((d) => this.getId(d) === o);
       if (r === -1) {
-        n.push({ id: i, error: `Not found: ${i}` });
+        n.push({ id: o, error: `Not found: ${o}` });
         continue;
       }
       try {
-        const d = At(i, this.config.key, this.getBep());
+        const d = At(o, this.config.key, this.getBep());
         if (d.length) throw new Error(`Referenced by: ${d.join(", ")}`);
-        this.config.beforeRemove?.(i, this.getBep()), o.splice(r, 1), t.push(i);
+        this.config.beforeRemove?.(o, this.getBep()), i.splice(r, 1), t.push(o);
       } catch (d) {
-        n.push({ id: i, error: K(d) });
+        n.push({ id: o, error: K(d) });
       }
     }
     return { succeeded: t, failed: n };
   }
 }
-class Ot extends y {
+class Ot extends w {
   constructor(e) {
     super(
       () => e().actions,
@@ -609,16 +613,16 @@ class Ot extends y {
         schema: ke,
         autoId: !0,
         beforeRemove: (t, n) => {
-          for (const i of n.workflows)
-            for (const [o, r] of Object.entries(i.diagram.nodes))
+          for (const o of n.workflows)
+            for (const [i, r] of Object.entries(o.diagram.nodes))
               if (r.type === "process" && r.actionId === t)
-                throw new Error(`Referenced by: workflows["${i.id}"].diagram.nodes["${o}"].actionId`);
+                throw new Error(`Referenced by: workflows["${o.id}"].diagram.nodes["${i}"].actionId`);
         }
       }
     );
   }
 }
-class _t extends y {
+class _t extends w {
   constructor(e) {
     super(
       () => e().annexes,
@@ -631,7 +635,7 @@ class _t extends y {
     );
   }
 }
-class Bt extends y {
+class Bt extends w {
   constructor(e) {
     super(
       () => e().effects,
@@ -640,20 +644,20 @@ class Bt extends y {
         key: "effects",
         schema: Re,
         beforeRemove: (t, n) => {
-          for (const i of n.workflows) {
-            for (const [o, r] of Object.entries(i.diagram.nodes))
+          for (const o of n.workflows) {
+            for (const [i, r] of Object.entries(o.diagram.nodes))
               if ((r.type === "process" || r.type === "automation") && r.timeouts?.some((d) => d.effectId === t))
-                throw new Error(`Referenced by: workflows["${i.id}"].diagram.nodes["${o}"].timeouts[].effectId`);
-            for (const [o, r] of Object.entries(i.diagram.edges))
+                throw new Error(`Referenced by: workflows["${o.id}"].diagram.nodes["${i}"].timeouts[].effectId`);
+            for (const [i, r] of Object.entries(o.diagram.edges))
               if (r.effectIds?.includes(t))
-                throw new Error(`Referenced by: workflows["${i.id}"].diagram.edges["${o}"].effectIds`);
+                throw new Error(`Referenced by: workflows["${o.id}"].diagram.edges["${i}"].effectIds`);
           }
         }
       }
     );
   }
 }
-class Mt extends y {
+class Mt extends w {
   constructor(e) {
     super(
       () => e().automations,
@@ -662,16 +666,16 @@ class Mt extends y {
         key: "automations",
         schema: Te,
         beforeRemove: (t, n) => {
-          for (const i of n.workflows)
-            for (const [o, r] of Object.entries(i.diagram.nodes))
+          for (const o of n.workflows)
+            for (const [i, r] of Object.entries(o.diagram.nodes))
               if (r.type === "automation" && r.automationId === t)
-                throw new Error(`Referenced by: workflows["${i.id}"].diagram.nodes["${o}"].automationId`);
+                throw new Error(`Referenced by: workflows["${o.id}"].diagram.nodes["${i}"].automationId`);
         }
       }
     );
   }
 }
-class xt extends y {
+class xt extends w {
   constructor(e) {
     super(
       () => e().env,
@@ -684,7 +688,7 @@ class xt extends y {
     );
   }
 }
-class Pt extends y {
+class Pt extends w {
   constructor(e) {
     super(
       () => e().events,
@@ -693,10 +697,10 @@ class Pt extends y {
         key: "events",
         schema: $e,
         beforeRemove: (t, n) => {
-          for (const i of n.workflows)
-            for (const [o, r] of Object.entries(i.diagram.edges))
+          for (const o of n.workflows)
+            for (const [i, r] of Object.entries(o.diagram.edges))
               if ("triggerEventId" in r && r.triggerEventId === t)
-                throw new Error(`Referenced by: workflows["${i.id}"].diagram.edges["${o}"].trigger`);
+                throw new Error(`Referenced by: workflows["${o.id}"].diagram.edges["${i}"].trigger`);
         }
       }
     );
@@ -709,7 +713,7 @@ function C(s) {
       e.set(n, t.id);
   return e;
 }
-function te(s) {
+function se(s) {
   const e = /* @__PURE__ */ new Set();
   for (const t of s)
     for (const n of t.lbsNodeIds ?? []) e.add(n);
@@ -717,22 +721,22 @@ function te(s) {
 }
 function Je(s, e) {
   if (!s) return { zoneCode: "XXX", locationCode: "XXX" };
-  const t = new Map(e.map((d) => [d.id, d])), n = C(e), i = te(e), o = t.get(s);
-  if (!o) return { zoneCode: "XXX", locationCode: "XXX" };
-  if (i.has(o.id)) return { zoneCode: "ZZZ", locationCode: "ZZZ" };
-  if (o.type === "zone") return { zoneCode: o.id, locationCode: "ZZZ" };
-  let r = n.get(o.id);
+  const t = new Map(e.map((d) => [d.id, d])), n = C(e), o = se(e), i = t.get(s);
+  if (!i) return { zoneCode: "XXX", locationCode: "XXX" };
+  if (o.has(i.id)) return { zoneCode: "ZZZ", locationCode: "ZZZ" };
+  if (i.type === "zone") return { zoneCode: i.id, locationCode: "ZZZ" };
+  let r = n.get(i.id);
   for (; r; ) {
     const d = t.get(r);
     if (!d) break;
-    if (d.type === "zone" && !i.has(d.id))
-      return { zoneCode: d.id, locationCode: o.id };
+    if (d.type === "zone" && !o.has(d.id))
+      return { zoneCode: d.id, locationCode: i.id };
     r = n.get(r);
   }
-  return { zoneCode: "ZZZ", locationCode: o.id };
+  return { zoneCode: "ZZZ", locationCode: i.id };
 }
 function Ft(s) {
-  const e = [], t = new Map(s.map((d) => [d.id, d])), n = te(s);
+  const e = [], t = new Map(s.map((d) => [d.id, d])), n = se(s);
   for (const d of n) {
     const l = t.get(d);
     l && l.type !== "zone" && e.push(`Root node "${d}" must be of type "zone".`);
@@ -741,36 +745,36 @@ function Ft(s) {
     if (d.type === "location")
       for (const l of d.lbsNodeIds ?? [])
         t.get(l)?.type === "zone" && e.push(`Node "${d.id}" (location) cannot have a zone child ("${l}").`);
-  const i = /* @__PURE__ */ new Set(), o = /* @__PURE__ */ new Set();
+  const o = /* @__PURE__ */ new Set(), i = /* @__PURE__ */ new Set();
   function r(d) {
-    if (o.has(d)) return !0;
-    if (i.has(d)) return !1;
-    i.add(d), o.add(d);
+    if (i.has(d)) return !0;
+    if (o.has(d)) return !1;
+    o.add(d), i.add(d);
     for (const l of t.get(d)?.lbsNodeIds ?? [])
       if (r(l))
         return e.push(`Cycle detected in LBS tree at node "${d}".`), !0;
-    return o.delete(d), !1;
+    return i.delete(d), !1;
   }
   for (const d of s)
-    i.has(d.id) || r(d.id);
+    o.has(d.id) || r(d.id);
   return e;
 }
-function W(s) {
+function X(s) {
   const e = /* @__PURE__ */ new Map(), t = /* @__PURE__ */ new Map();
   for (const n of s) {
-    const i = (t.get(n.responsibleId) ?? 0) + 1;
-    t.set(n.responsibleId, i), e.set(n.id, i);
+    const o = (t.get(n.responsibleId) ?? 0) + 1;
+    t.set(n.responsibleId, o), e.set(n.id, o);
   }
   return e;
 }
 const F = "XXX";
-function Ke(s, e, t, n, i) {
-  const { zoneCode: o, locationCode: r } = Je(s.lbsNodeId, n);
-  if (!i) {
+function Ke(s, e, t, n, o) {
+  const { zoneCode: i, locationCode: r } = Je(s.lbsNodeId, n);
+  if (!o) {
     const l = String(t.get(s.id) ?? 0).padStart(3, "0");
-    return [e, s.responsibleId, o, r, s.assetTypeId, s.disciplineId, l].join("-");
+    return [e, s.responsibleId, i, r, s.assetTypeId, s.disciplineId, l].join("-");
   }
-  return i.segments.map((l) => {
+  return o.segments.map((l) => {
     if (l.type === "sequence") {
       const c = l.padding ?? 3;
       return String(t.get(s.id) ?? 0).padStart(c, "0");
@@ -785,17 +789,17 @@ function Ke(s, e, t, n, i) {
       case "assetType":
         return s.assetTypeId || F;
       case "lbsZone":
-        return o;
+        return i;
       case "lbsLocation":
         return r;
     }
-  }).join(i.delimiter);
+  }).join(o.delimiter);
 }
 function qe(s, e, t, n) {
-  const i = W(s);
-  return new Map(s.map((o) => [
-    o.id,
-    Ke(o, e, i, t, n)
+  const o = X(s);
+  return new Map(s.map((i) => [
+    i.id,
+    Ke(i, e, o, t, n)
   ]));
 }
 class Ct {
@@ -805,17 +809,17 @@ class Ct {
   getBep;
   /** Maps every deliverable id to its sequence number within its originator team. */
   buildConsecutivoMap() {
-    return W(this.getBep().deliverables);
+    return X(this.getBep().deliverables);
   }
   /**
    * Returns the nomenclature code for a single deliverable.
    * Returns null if the deliverable id is not found.
    */
   getCode(e) {
-    const t = this.getBep(), n = t.deliverables.find((o) => o.id === e);
+    const t = this.getBep(), n = t.deliverables.find((i) => i.id === e);
     if (!n) return null;
-    const i = W(t.deliverables);
-    return Ke(n, t.project.code, i, t.lbs, t.deliverableNamingConvention);
+    const o = X(t.deliverables);
+    return Ke(n, t.project.code, o, t.lbs, t.deliverableNamingConvention);
   }
   /** Builds the complete map of deliverable.id → nomenclature code. */
   buildCodeMap() {
@@ -823,8 +827,8 @@ class Ct {
     return qe(e.deliverables, e.project.code, e.lbs, e.deliverableNamingConvention);
   }
 }
-class Dt extends y {
-  constructor(e, t, n, i, o) {
+class Dt extends w {
+  constructor(e, t, n, o, i) {
     super(
       () => e().deliverables,
       e,
@@ -833,23 +837,23 @@ class Dt extends y {
         schema: De,
         autoId: !0
       }
-    ), this.getTeams = t, this.getAssetTypes = n, this.getLBSNodes = i, this.getMilestones = o;
+    ), this.getTeams = t, this.getAssetTypes = n, this.getLBSNodes = o, this.getMilestones = i;
   }
   getTeams;
   getAssetTypes;
   getLBSNodes;
   getMilestones;
   listResolved() {
-    const e = this.getBep(), t = qe(e.deliverables, e.project.code, e.lbs), n = new Map(this.getTeams().listResolved().map((l) => [l.id, l])), i = new Map(this.getAssetTypes().listResolved().map((l) => [l.id, l])), o = new Map(this.getLBSNodes().listResolved().map((l) => [l.id, l])), r = new Map(this.getMilestones().listResolved().map((l) => [l.id, l])), d = /* @__PURE__ */ new Map();
+    const e = this.getBep(), t = qe(e.deliverables, e.project.code, e.lbs), n = new Map(this.getTeams().listResolved().map((l) => [l.id, l])), o = new Map(this.getAssetTypes().listResolved().map((l) => [l.id, l])), i = new Map(this.getLBSNodes().listResolved().map((l) => [l.id, l])), r = new Map(this.getMilestones().listResolved().map((l) => [l.id, l])), d = /* @__PURE__ */ new Map();
     for (const l of e.deliverables) {
       const c = r.get(l.milestoneId) ?? null;
       d.set(l.id, {
         ...l,
         nomenclatureCode: t.get(l.id) ?? "",
         effectiveDate: l.dueDate ?? c?.date ?? "",
-        lbsNode: l.lbsNodeId ? o.get(l.lbsNodeId) ?? null : null,
+        lbsNode: l.lbsNodeId ? i.get(l.lbsNodeId) ?? null : null,
         discipline: e.disciplines.find((u) => u.id === l.disciplineId) ?? null,
-        assetType: i.get(l.assetTypeId) ?? null,
+        assetType: o.get(l.assetTypeId) ?? null,
         extensions: (l.extensionIds ?? []).map((u) => e.extensions.find((f) => f.id === u)).filter(Boolean),
         responsible: n.get(l.responsibleId) ?? null,
         milestone: c,
@@ -864,7 +868,7 @@ class Dt extends y {
     return [...d.values()];
   }
 }
-class Lt extends y {
+class Lt extends w {
   constructor(e) {
     super(
       () => e().flags,
@@ -877,7 +881,7 @@ class Lt extends y {
     );
   }
 }
-class Ut extends y {
+class Ut extends w {
   constructor(e, t) {
     super(
       () => e().notes,
@@ -898,7 +902,7 @@ class Ut extends y {
     }));
   }
 }
-class zt extends y {
+class zt extends w {
   constructor(e, t) {
     super(
       () => e().bimUses,
@@ -907,15 +911,15 @@ class zt extends y {
         key: "bimUses",
         schema: Se,
         autoId: !0,
-        validate: (n, i) => {
-          const o = [];
+        validate: (n, o) => {
+          const i = [];
           for (const r of n.objectiveIds ?? [])
-            i.objectives.some((d) => d.id === r) || o.push(`objectives["${r}"] not found`);
+            o.objectives.some((d) => d.id === r) || i.push(`objectives["${r}"] not found`);
           for (const r of n.milestoneIds ?? [])
-            i.milestones.some((d) => d.id === r) || o.push(`milestones["${r}"] not found`);
+            o.milestones.some((d) => d.id === r) || i.push(`milestones["${r}"] not found`);
           for (const r of n.workflowIds ?? [])
-            i.workflows.some((d) => d.id === r) || o.push(`workflows["${r}"] not found`);
-          return o;
+            o.workflows.some((d) => d.id === r) || i.push(`workflows["${r}"] not found`);
+          return i;
         }
       }
     ), this.getWorkflows = t;
@@ -925,32 +929,32 @@ class zt extends y {
     const e = this.getBep(), t = new Map(this.getWorkflows().listResolved().map((n) => [n.id, n]));
     return e.bimUses.map((n) => ({
       ...n,
-      objectives: (n.objectiveIds ?? []).map((i) => e.objectives.find((o) => o.id === i)).filter(Boolean),
-      milestones: (n.milestoneIds ?? []).map((i) => {
-        const o = e.milestones.find((r) => r.id === i);
-        return o ? { ...o, phase: e.phases.find((r) => r.id === o.phaseId) ?? null } : null;
+      objectives: (n.objectiveIds ?? []).map((o) => e.objectives.find((i) => i.id === o)).filter(Boolean),
+      milestones: (n.milestoneIds ?? []).map((o) => {
+        const i = e.milestones.find((r) => r.id === o);
+        return i ? { ...i, phase: e.phases.find((r) => r.id === i.phaseId) ?? null } : null;
       }).filter(Boolean),
-      workflows: (n.workflowIds ?? []).map((i) => t.get(i)).filter(Boolean)
+      workflows: (n.workflowIds ?? []).map((o) => t.get(o)).filter(Boolean)
     }));
   }
 }
-class Zt extends y {
+class Zt extends w {
   constructor(e) {
     super(
       () => e().disciplines,
       e,
       {
         key: "disciplines",
-        schema: we,
+        schema: be,
         validate: (t, n) => {
-          const i = x("discipline", t.id, n.deliverableNamingConvention);
-          return i ? [i] : [];
+          const o = x("discipline", t.id, n.deliverableNamingConvention);
+          return o ? [o] : [];
         }
       }
     );
   }
 }
-class Jt extends y {
+class Jt extends w {
   constructor(e) {
     super(
       () => e().guides,
@@ -966,11 +970,11 @@ class Jt extends y {
     const e = this.getBep();
     return e.guides.map((t) => ({
       ...t,
-      annexes: (t.annexIds ?? []).map((n) => e.annexes.find((i) => i.id === n)).filter(Boolean)
+      annexes: (t.annexIds ?? []).map((n) => e.annexes.find((o) => o.id === n)).filter(Boolean)
     }));
   }
 }
-class Kt extends y {
+class Kt extends w {
   constructor(e) {
     super(
       () => e().lods,
@@ -979,14 +983,14 @@ class Kt extends y {
         key: "lods",
         schema: Me,
         beforeRemove: (t, n) => {
-          for (const i of n.loin)
-            if (i.milestones?.find((r) => r.lodId === t)) throw new Error(`Referenced by: loin["${i.id}"].milestones[lodId=${t}]`);
+          for (const o of n.loin)
+            if (o.milestones?.find((r) => r.lodId === t)) throw new Error(`Referenced by: loin["${o.id}"].milestones[lodId=${t}]`);
         }
       }
     );
   }
 }
-class qt extends y {
+class qt extends w {
   constructor(e) {
     super(
       () => e().lois,
@@ -995,14 +999,14 @@ class qt extends y {
         key: "lois",
         schema: xe,
         beforeRemove: (t, n) => {
-          for (const i of n.loin)
-            if (i.milestones?.find((r) => r.loiId === t)) throw new Error(`Referenced by: loin["${i.id}"].milestones[loiId=${t}]`);
+          for (const o of n.loin)
+            if (o.milestones?.find((r) => r.loiId === t)) throw new Error(`Referenced by: loin["${o.id}"].milestones[loiId=${t}]`);
         }
       }
     );
   }
 }
-class Wt extends y {
+class Wt extends w {
   constructor(e) {
     super(
       () => e().loin,
@@ -1012,62 +1016,62 @@ class Wt extends y {
         schema: Pe,
         autoId: !0,
         validate: (t, n) => {
-          const i = [];
-          for (const o of t.milestones ?? [])
-            n.milestones.some((r) => r.id === o.milestoneId) || i.push(`milestones["${o.milestoneId}"] not found`), n.lods.some((r) => r.id === o.lodId) || i.push(`lods[${o.lodId}] not found`), n.lois.some((r) => r.id === o.loiId) || i.push(`lois[${o.loiId}] not found`);
-          return i;
+          const o = [];
+          for (const i of t.milestones ?? [])
+            n.milestones.some((r) => r.id === i.milestoneId) || o.push(`milestones["${i.milestoneId}"] not found`), n.lods.some((r) => r.id === i.lodId) || o.push(`lods[${i.lodId}] not found`), n.lois.some((r) => r.id === i.loiId) || o.push(`lois[${i.loiId}] not found`);
+          return o;
         }
       }
     );
   }
   addMilestones(e) {
     const t = [], n = [];
-    for (const i of e) {
-      const o = this.getBep().loin.find((c) => c.id === i.loinId);
-      if (!o) {
-        n.push({ loinId: i.loinId, error: `Not found: ${i.loinId}` });
+    for (const o of e) {
+      const i = this.getBep().loin.find((c) => c.id === o.loinId);
+      if (!i) {
+        n.push({ loinId: o.loinId, error: `Not found: ${o.loinId}` });
         continue;
       }
-      const r = i.milestones.find((c) => (o.milestones ?? []).some((u) => u.milestoneId === c.milestoneId));
+      const r = o.milestones.find((c) => (i.milestones ?? []).some((u) => u.milestoneId === c.milestoneId));
       if (r) {
-        n.push({ loinId: i.loinId, error: `Milestone "${r.milestoneId}" already exists. Use updateMilestones to modify it.` });
+        n.push({ loinId: o.loinId, error: `Milestone "${r.milestoneId}" already exists. Use updateMilestones to modify it.` });
         continue;
       }
-      const d = [...o.milestones ?? [], ...i.milestones], l = this.update([{ id: i.loinId, milestones: d }]);
+      const d = [...i.milestones ?? [], ...o.milestones], l = this.update([{ id: o.loinId, milestones: d }]);
       if (l.failed.length > 0) {
-        n.push({ loinId: i.loinId, error: l.failed[0].error });
+        n.push({ loinId: o.loinId, error: l.failed[0].error });
         continue;
       }
-      t.push({ loinId: i.loinId, element: o.element, addedMilestones: i.milestones.map((c) => c.milestoneId) });
+      t.push({ loinId: o.loinId, element: i.element, addedMilestones: o.milestones.map((c) => c.milestoneId) });
     }
     return { succeeded: t, failed: n };
   }
   updateMilestones(e) {
     const t = [], n = [];
-    for (const i of e) {
-      const o = this.getBep().loin.find((f) => f.id === i.loinId);
-      if (!o) {
-        n.push({ loinId: i.loinId, error: `Not found: ${i.loinId}` });
+    for (const o of e) {
+      const i = this.getBep().loin.find((f) => f.id === o.loinId);
+      if (!i) {
+        n.push({ loinId: o.loinId, error: `Not found: ${o.loinId}` });
         continue;
       }
-      const r = i.milestones.find((f) => !(o.milestones ?? []).some((m) => m.milestoneId === f.milestoneId));
+      const r = o.milestones.find((f) => !(i.milestones ?? []).some((m) => m.milestoneId === f.milestoneId));
       if (r) {
-        n.push({ loinId: i.loinId, error: `Milestone "${r.milestoneId}" not found. Use addMilestones to create it.` });
+        n.push({ loinId: o.loinId, error: `Milestone "${r.milestoneId}" not found. Use addMilestones to create it.` });
         continue;
       }
-      const d = new Map(o.milestones.map((f) => [f.milestoneId, { lodId: f.lodId, loiId: f.loiId, idsPath: f.idsPath }])), l = (o.milestones ?? []).map((f) => {
-        const m = i.milestones.find((p) => p.milestoneId === f.milestoneId);
+      const d = new Map(i.milestones.map((f) => [f.milestoneId, { lodId: f.lodId, loiId: f.loiId, idsPath: f.idsPath }])), l = (i.milestones ?? []).map((f) => {
+        const m = o.milestones.find((p) => p.milestoneId === f.milestoneId);
         return m ? { ...f, ...m } : f;
-      }), c = this.update([{ id: i.loinId, milestones: l }]);
+      }), c = this.update([{ id: o.loinId, milestones: l }]);
       if (c.failed.length > 0) {
-        n.push({ loinId: i.loinId, error: c.failed[0].error });
+        n.push({ loinId: o.loinId, error: c.failed[0].error });
         continue;
       }
-      const u = this.getBep().loin.find((f) => f.id === i.loinId);
+      const u = this.getBep().loin.find((f) => f.id === o.loinId);
       t.push({
-        loinId: i.loinId,
-        element: o.element,
-        milestones: i.milestones.map((f) => {
+        loinId: o.loinId,
+        element: i.element,
+        milestones: o.milestones.map((f) => {
           const m = u.milestones.find((g) => g.milestoneId === f.milestoneId), p = d.get(f.milestoneId);
           return { milestoneId: f.milestoneId, before: p, after: { lodId: m.lodId, loiId: m.loiId, idsPath: m.idsPath } };
         })
@@ -1077,18 +1081,18 @@ class Wt extends y {
   }
   removeMilestones(e) {
     const t = [], n = [];
-    for (const i of e) {
-      const o = this.getBep().loin.find((d) => d.id === i.loinId);
-      if (!o) {
-        n.push({ loinId: i.loinId, error: `Not found: ${i.loinId}` });
+    for (const o of e) {
+      const i = this.getBep().loin.find((d) => d.id === o.loinId);
+      if (!i) {
+        n.push({ loinId: o.loinId, error: `Not found: ${o.loinId}` });
         continue;
       }
-      const r = i.milestoneIds.filter((d) => !(o.milestones ?? []).some((l) => l.milestoneId === d));
+      const r = o.milestoneIds.filter((d) => !(i.milestones ?? []).some((l) => l.milestoneId === d));
       if (r.length > 0) {
-        n.push({ loinId: i.loinId, error: `Milestones not found in this LOIN: ${r.join(", ")}` });
+        n.push({ loinId: o.loinId, error: `Milestones not found in this LOIN: ${r.join(", ")}` });
         continue;
       }
-      o.milestones = (o.milestones ?? []).filter((d) => !i.milestoneIds.includes(d.milestoneId)), t.push({ loinId: i.loinId, element: o.element, removedMilestones: i.milestoneIds });
+      i.milestones = (i.milestones ?? []).filter((d) => !o.milestoneIds.includes(d.milestoneId)), t.push({ loinId: o.loinId, element: i.element, removedMilestones: o.milestoneIds });
     }
     return { succeeded: t, failed: n };
   }
@@ -1099,14 +1103,14 @@ class Wt extends y {
       discipline: e.disciplines.find((n) => n.id === t.disciplineId) ?? null,
       milestones: (t.milestones ?? []).map((n) => ({
         ...n,
-        milestone: e.milestones.find((i) => i.id === n.milestoneId) ?? null,
-        lod: e.lods.find((i) => i.id === n.lodId) ?? null,
-        loi: e.lois.find((i) => i.id === n.loiId) ?? null
+        milestone: e.milestones.find((o) => o.id === n.milestoneId) ?? null,
+        lod: e.lods.find((o) => o.id === n.lodId) ?? null,
+        loi: e.lois.find((o) => o.id === n.loiId) ?? null
       }))
     }));
   }
 }
-class Gt extends y {
+class Xt extends w {
   constructor(e) {
     super(
       () => e().assetTypes,
@@ -1115,8 +1119,8 @@ class Gt extends y {
         key: "assetTypes",
         schema: Ie,
         validate: (t, n) => {
-          const i = x("assetType", t.id, n.deliverableNamingConvention);
-          return i ? [i] : [];
+          const o = x("assetType", t.id, n.deliverableNamingConvention);
+          return o ? [o] : [];
         }
       }
     );
@@ -1125,11 +1129,11 @@ class Gt extends y {
     const e = this.getBep();
     return e.assetTypes.map((t) => ({
       ...t,
-      extensions: (t.extensionIds ?? []).map((n) => e.extensions.find((i) => i.id === n)).filter(Boolean)
+      extensions: (t.extensionIds ?? []).map((n) => e.extensions.find((o) => o.id === n)).filter(Boolean)
     }));
   }
 }
-class Xt extends y {
+class Gt extends w {
   constructor(e) {
     super(
       () => e().extensions,
@@ -1141,7 +1145,7 @@ class Xt extends y {
     );
   }
 }
-class Vt extends y {
+class Vt extends w {
   constructor(e) {
     super(
       () => e().roles,
@@ -1151,120 +1155,120 @@ class Vt extends y {
         schema: ue,
         autoId: !0,
         beforeRemove: (t, n) => {
-          const i = ["responsibleRoleIds", "accountableRoleIds", "consultedRoleIds", "informedRoleIds"];
-          for (const o of n.workflows)
-            for (const [r, d] of Object.entries(o.diagram.nodes))
+          const o = ["responsibleRoleIds", "accountableRoleIds", "consultedRoleIds", "informedRoleIds"];
+          for (const i of n.workflows)
+            for (const [r, d] of Object.entries(i.diagram.nodes))
               if (d.type === "process") {
-                for (const l of i)
+                for (const l of o)
                   if (d[l]?.includes(t))
-                    throw new Error(`Referenced by: workflows["${o.id}"].diagram.nodes["${r}"].${l}`);
+                    throw new Error(`Referenced by: workflows["${i.id}"].diagram.nodes["${r}"].${l}`);
               }
         }
       }
     );
   }
 }
-class Ht extends y {
+class Ht extends w {
   constructor(e) {
     super(
       () => e().lbs,
       e,
       {
         key: "lbs",
-        schema: be,
+        schema: we,
         validate: (t, n) => {
-          const i = [], o = t.type === "zone" ? "lbsZone" : "lbsLocation", r = x(o, t.id, n.deliverableNamingConvention);
-          if (r && i.push(r), t.type === "location" && t.lbsNodeIds?.length) {
+          const o = [], i = t.type === "zone" ? "lbsZone" : "lbsLocation", r = x(i, t.id, n.deliverableNamingConvention);
+          if (r && o.push(r), t.type === "location" && t.lbsNodeIds?.length) {
             const d = new Map(n.lbs.map((l) => [l.id, l]));
             for (const l of t.lbsNodeIds ?? [])
-              d.get(l)?.type === "zone" && i.push(`Node "${t.id}" (location) cannot have a zone child ("${l}").`);
+              d.get(l)?.type === "zone" && o.push(`Node "${t.id}" (location) cannot have a zone child ("${l}").`);
           }
-          return i;
+          return o;
         }
       }
     );
   }
   listResolved() {
-    const e = this.getBep(), t = C(e.lbs), n = te(e.lbs), i = new Map(e.lbs.map((o) => [o.id, o]));
-    return e.lbs.map((o) => {
-      const r = t.get(o.id), d = r ? i.get(r) : void 0;
+    const e = this.getBep(), t = C(e.lbs), n = se(e.lbs), o = new Map(e.lbs.map((i) => [i.id, i]));
+    return e.lbs.map((i) => {
+      const r = t.get(i.id), d = r ? o.get(r) : void 0;
       return {
-        ...o,
-        isRoot: n.has(o.id),
+        ...i,
+        isRoot: n.has(i.id),
         parent: d ? { id: d.id, name: d.name, type: d.type } : null,
-        children: (o.lbsNodeIds ?? []).map((l) => i.get(l)).filter(Boolean)
+        children: (i.lbsNodeIds ?? []).map((l) => o.get(l)).filter(Boolean)
       };
     });
   }
   addNodes(e) {
-    const t = this.getBep(), n = [], i = [];
-    for (const o of e) {
-      if (!o.parentId && o.type !== "zone") {
-        i.push({ input: o, error: 'Root nodes (no parentId) must be type "zone".' });
+    const t = this.getBep(), n = [], o = [];
+    for (const i of e) {
+      if (!i.parentId && i.type !== "zone") {
+        o.push({ input: i, error: 'Root nodes (no parentId) must be type "zone".' });
         continue;
       }
-      if (o.parentId && !t.lbs.find((f) => f.id === o.parentId)) {
-        i.push({ input: o, error: `No LBS node found with ID "${o.parentId}".` });
+      if (i.parentId && !t.lbs.find((f) => f.id === i.parentId)) {
+        o.push({ input: i, error: `No LBS node found with ID "${i.parentId}".` });
         continue;
       }
-      const { parentId: r, ...d } = o, l = this.add([d]);
+      const { parentId: r, ...d } = i, l = this.add([d]);
       if (l.failed.length > 0) {
-        i.push({ input: o, error: l.failed[0].error });
+        o.push({ input: i, error: l.failed[0].error });
         continue;
       }
       let c;
-      r && (c = t.lbs.find((f) => f.id === r), c && (c.lbsNodeIds ??= [], c.lbsNodeIds.push(o.id)));
+      r && (c = t.lbs.find((f) => f.id === r), c && (c.lbsNodeIds ??= [], c.lbsNodeIds.push(i.id)));
       const u = this.validateTree();
       if (u.length > 0) {
-        t.lbs.splice(t.lbs.findIndex((f) => f.id === o.id), 1), c?.lbsNodeIds && (c.lbsNodeIds = c.lbsNodeIds.filter((f) => f !== o.id)), i.push({ input: o, error: u.join("; ") });
+        t.lbs.splice(t.lbs.findIndex((f) => f.id === i.id), 1), c?.lbsNodeIds && (c.lbsNodeIds = c.lbsNodeIds.filter((f) => f !== i.id)), o.push({ input: i, error: u.join("; ") });
         continue;
       }
-      n.push({ ...t.lbs.find((f) => f.id === o.id), parentId: r ?? null });
+      n.push({ ...t.lbs.find((f) => f.id === i.id), parentId: r ?? null });
     }
-    return { succeeded: n, failed: i };
+    return { succeeded: n, failed: o };
   }
   updateNodes(e) {
-    const t = this.getBep(), n = [], i = [];
-    for (const o of e) {
-      if (o.parentId && !t.lbs.find((h) => h.id === o.parentId)) {
-        i.push({ id: o.id, error: `No LBS node found with ID "${o.parentId}".` });
+    const t = this.getBep(), n = [], o = [];
+    for (const i of e) {
+      if (i.parentId && !t.lbs.find((h) => h.id === i.parentId)) {
+        o.push({ id: i.id, error: `No LBS node found with ID "${i.parentId}".` });
         continue;
       }
-      if (o.parentId === o.id) {
-        i.push({ id: o.id, error: "A node cannot be its own parent." });
+      if (i.parentId === i.id) {
+        o.push({ id: i.id, error: "A node cannot be its own parent." });
         continue;
       }
-      const r = t.lbs.find((h) => h.id === o.id), d = C(t.lbs).get(o.id) ?? null, { parentId: l, ...c } = o, u = this.update([c]);
+      const r = t.lbs.find((h) => h.id === i.id), d = C(t.lbs).get(i.id) ?? null, { parentId: l, ...c } = i, u = this.update([c]);
       if (u.failed.length > 0) {
-        i.push({ id: o.id, error: u.failed[0].error });
+        o.push({ id: i.id, error: u.failed[0].error });
         continue;
       }
-      const f = { name: r.name, type: r.type, description: r.description, parentId: d }, m = t.lbs.find((h) => h.id === o.id);
+      const f = { name: r.name, type: r.type, description: r.description, parentId: d }, m = t.lbs.find((h) => h.id === i.id);
       if (l !== void 0) {
         for (const h of t.lbs)
-          h.lbsNodeIds?.includes(o.id) && (h.lbsNodeIds = h.lbsNodeIds.filter((b) => b !== o.id));
+          h.lbsNodeIds?.includes(i.id) && (h.lbsNodeIds = h.lbsNodeIds.filter((y) => y !== i.id));
         if (l) {
-          const h = t.lbs.find((b) => b.id === l);
-          h.lbsNodeIds ??= [], h.lbsNodeIds.push(o.id);
+          const h = t.lbs.find((y) => y.id === l);
+          h.lbsNodeIds ??= [], h.lbsNodeIds.push(i.id);
         }
       }
       const p = this.validateTree();
       if (p.length > 0) {
         if (m.name = f.name, m.type = f.type, f.description !== void 0 ? m.description = f.description : delete m.description, l !== void 0) {
           for (const h of t.lbs)
-            h.lbsNodeIds?.includes(o.id) && (h.lbsNodeIds = h.lbsNodeIds.filter((b) => b !== o.id));
+            h.lbsNodeIds?.includes(i.id) && (h.lbsNodeIds = h.lbsNodeIds.filter((y) => y !== i.id));
           if (f.parentId) {
-            const h = t.lbs.find((b) => b.id === f.parentId);
-            h && (h.lbsNodeIds ??= [], h.lbsNodeIds.push(o.id));
+            const h = t.lbs.find((y) => y.id === f.parentId);
+            h && (h.lbsNodeIds ??= [], h.lbsNodeIds.push(i.id));
           }
         }
-        i.push({ id: o.id, error: p.join("; ") });
+        o.push({ id: i.id, error: p.join("; ") });
         continue;
       }
       const g = C(t.lbs).get(m.id) ?? null;
-      n.push({ id: o.id, before: f, after: { name: m.name, type: m.type, description: m.description, parentId: g } });
+      n.push({ id: i.id, before: f, after: { name: m.name, type: m.type, description: m.description, parentId: g } });
     }
-    return { succeeded: n, failed: i };
+    return { succeeded: n, failed: o };
   }
   /** Resolves zone and location codes for nomenclature given a node id. */
   resolveCodes(e) {
@@ -1275,7 +1279,7 @@ class Ht extends y {
     return Ft(this.list());
   }
 }
-class Yt extends y {
+class Yt extends w {
   constructor(e) {
     super(
       () => e().members,
@@ -1290,10 +1294,10 @@ class Yt extends y {
   listResolved() {
     const e = this.getBep();
     return e.members.map((t) => {
-      const n = e.teams.find((i) => (i.memberEmails ?? []).includes(t.email));
+      const n = e.teams.find((o) => (o.memberEmails ?? []).includes(t.email));
       return {
         ...t,
-        role: e.roles.find((i) => i.id === t.roleId) ?? null,
+        role: e.roles.find((o) => o.id === t.roleId) ?? null,
         team: n ? { id: n.id, name: n.name } : null,
         isRepresentative: n?.representativeEmail === t.email
       };
@@ -1301,66 +1305,66 @@ class Yt extends y {
   }
   addToTeam(e) {
     const t = [], n = [];
-    for (const i of e) {
-      const r = this.getBep().teams.find((m) => m.id === i.teamId);
+    for (const o of e) {
+      const r = this.getBep().teams.find((m) => m.id === o.teamId);
       if (!r) {
-        n.push({ input: i, error: `Team not found: ${i.teamId}` });
+        n.push({ input: o, error: `Team not found: ${o.teamId}` });
         continue;
       }
-      const { teamId: d, isRepresentative: l, ...c } = i, u = this.add([c]);
+      const { teamId: d, isRepresentative: l, ...c } = o, u = this.add([c]);
       if (u.failed.length > 0) {
-        n.push({ input: i, error: u.failed[0].error });
+        n.push({ input: o, error: u.failed[0].error });
         continue;
       }
-      r.memberEmails ??= [], r.memberEmails.includes(i.email) || r.memberEmails.push(i.email), l && (r.representativeEmail = i.email);
-      const f = this.listResolved().find((m) => m.email === i.email);
+      r.memberEmails ??= [], r.memberEmails.includes(o.email) || r.memberEmails.push(o.email), l && (r.representativeEmail = o.email);
+      const f = this.listResolved().find((m) => m.email === o.email);
       t.push(f);
     }
     return { succeeded: t, failed: n };
   }
   updateInTeam(e) {
     const t = [], n = [];
-    for (const i of e) {
-      const o = this.getBep(), { teamId: r, isRepresentative: d, ...l } = i;
-      if (r !== void 0 && !o.teams.find((f) => f.id === r)) {
-        n.push({ email: i.email, error: `Team not found: ${r}` });
+    for (const o of e) {
+      const i = this.getBep(), { teamId: r, isRepresentative: d, ...l } = o;
+      if (r !== void 0 && !i.teams.find((f) => f.id === r)) {
+        n.push({ email: o.email, error: `Team not found: ${r}` });
         continue;
       }
       const c = this.update([l]);
       if (c.failed.length > 0) {
-        n.push({ email: i.email, error: c.failed[0].error });
+        n.push({ email: o.email, error: c.failed[0].error });
         continue;
       }
       if (r !== void 0) {
-        const f = o.teams.find((p) => p.id === r), m = o.teams.find((p) => (p.memberEmails ?? []).includes(i.email));
-        m && m.id !== r && (m.memberEmails = (m.memberEmails ?? []).filter((p) => p !== i.email), m.representativeEmail === i.email && (m.representativeEmail = void 0)), f.memberEmails ??= [], f.memberEmails.includes(i.email) || f.memberEmails.push(i.email);
+        const f = i.teams.find((p) => p.id === r), m = i.teams.find((p) => (p.memberEmails ?? []).includes(o.email));
+        m && m.id !== r && (m.memberEmails = (m.memberEmails ?? []).filter((p) => p !== o.email), m.representativeEmail === o.email && (m.representativeEmail = void 0)), f.memberEmails ??= [], f.memberEmails.includes(o.email) || f.memberEmails.push(o.email);
       }
       if (d !== void 0) {
-        const f = o.teams.find((m) => (m.memberEmails ?? []).includes(i.email));
-        f && (f.representativeEmail = d ? i.email : f.representativeEmail === i.email ? void 0 : f.representativeEmail);
+        const f = i.teams.find((m) => (m.memberEmails ?? []).includes(o.email));
+        f && (f.representativeEmail = d ? o.email : f.representativeEmail === o.email ? void 0 : f.representativeEmail);
       }
-      const u = this.listResolved().find((f) => f.email === i.email);
-      t.push({ email: i.email, after: u });
+      const u = this.listResolved().find((f) => f.email === o.email);
+      t.push({ email: o.email, after: u });
     }
     return { succeeded: t, failed: n };
   }
   removeFromBep(e) {
     const t = [], n = [];
-    for (const i of e) {
-      const o = this.getBep(), r = this.listResolved().find((l) => l.email === i);
+    for (const o of e) {
+      const i = this.getBep(), r = this.listResolved().find((l) => l.email === o);
       if (!r) {
-        n.push({ email: i, error: `Not found: ${i}` });
+        n.push({ email: o, error: `Not found: ${o}` });
         continue;
       }
-      for (const l of o.teams)
-        l.memberEmails && (l.memberEmails = l.memberEmails.filter((c) => c !== i)), l.representativeEmail === i && (l.representativeEmail = void 0);
-      const d = this.remove([i]);
+      for (const l of i.teams)
+        l.memberEmails && (l.memberEmails = l.memberEmails.filter((c) => c !== o)), l.representativeEmail === o && (l.representativeEmail = void 0);
+      const d = this.remove([o]);
       if (d.failed.length > 0) {
         if (r.team) {
-          const l = o.teams.find((c) => c.id === r.team.id);
-          l && (l.memberEmails ??= [], l.memberEmails.includes(i) || l.memberEmails.push(i), r.isRepresentative && (l.representativeEmail = i));
+          const l = i.teams.find((c) => c.id === r.team.id);
+          l && (l.memberEmails ??= [], l.memberEmails.includes(o) || l.memberEmails.push(o), r.isRepresentative && (l.representativeEmail = o));
         }
-        n.push({ email: i, error: d.failed[0].error });
+        n.push({ email: o, error: d.failed[0].error });
         continue;
       }
       t.push(r);
@@ -1368,7 +1372,7 @@ class Yt extends y {
     return { succeeded: t, failed: n };
   }
 }
-class Qt extends y {
+class Qt extends w {
   constructor(e) {
     super(
       () => e().milestones,
@@ -1378,8 +1382,8 @@ class Qt extends y {
         schema: ye,
         autoId: !0,
         beforeRemove: (t, n) => {
-          for (const i of n.loin)
-            if (i.milestones?.find((r) => r.milestoneId === t)) throw new Error(`Referenced by: loin["${i.id}"].milestones[milestoneId="${t}"]`);
+          for (const o of n.loin)
+            if (o.milestones?.find((r) => r.milestoneId === t)) throw new Error(`Referenced by: loin["${o.id}"].milestones[milestoneId="${t}"]`);
         }
       }
     );
@@ -1392,7 +1396,7 @@ class Qt extends y {
     }));
   }
 }
-class es extends y {
+class es extends w {
   constructor(e) {
     super(
       () => e().objectives,
@@ -1405,7 +1409,7 @@ class es extends y {
     );
   }
 }
-class ts extends y {
+class ts extends w {
   constructor(e) {
     super(
       () => e().phases,
@@ -1418,7 +1422,7 @@ class ts extends y {
     );
   }
 }
-class ss extends y {
+class ss extends w {
   constructor(e) {
     super(
       () => e().remoteData,
@@ -1431,7 +1435,7 @@ class ss extends y {
     );
   }
 }
-class ns extends y {
+class ns extends w {
   constructor(e) {
     super(
       () => e().resolvers,
@@ -1440,14 +1444,14 @@ class ns extends y {
         key: "resolvers",
         schema: Ue,
         beforeRemove: (t, n) => {
-          const i = n.remoteData.find((o) => o.resolverId === t);
-          if (i) throw new Error(`Referenced by: remoteData["${i.id}"].resolverId`);
+          const o = n.remoteData.find((i) => i.resolverId === t);
+          if (o) throw new Error(`Referenced by: remoteData["${o.id}"].resolverId`);
         }
       }
     );
   }
 }
-class is extends y {
+class os extends w {
   constructor(e, t) {
     super(
       () => e().softwares,
@@ -1467,7 +1471,7 @@ class is extends y {
     }));
   }
 }
-class os extends y {
+class is extends w {
   constructor(e, t) {
     super(
       () => e().standards,
@@ -1484,29 +1488,29 @@ class os extends y {
    */
   add(e) {
     const t = e.map((n) => {
-      const i = `standards/${globalThis.crypto.randomUUID()}.md`;
+      const o = `standards/${globalThis.crypto.randomUUID()}.md`;
       if ("content" in n) {
-        const { content: o, ...r } = n;
-        return this.getZip().file(i, o), { ...r, contentPath: i };
+        const { content: i, ...r } = n;
+        return this.getZip().file(o, i), { ...r, contentPath: o };
       }
-      return this.getZip().file(i, ""), { ...n, contentPath: i };
+      return this.getZip().file(o, ""), { ...n, contentPath: o };
     });
     return super.add(t);
   }
   /** Removes standards and deletes their .md files from the zip. */
   remove(e) {
     const t = new Map(
-      e.map((i) => [i, this.list().find((o) => o.id === i)?.contentPath]).filter((i) => i[1] !== void 0)
+      e.map((o) => [o, this.list().find((i) => i.id === o)?.contentPath]).filter((o) => o[1] !== void 0)
     ), n = super.remove(e);
-    for (const i of n.succeeded) {
-      const o = t.get(i);
-      o && this.getZip().remove(o);
+    for (const o of n.succeeded) {
+      const i = t.get(o);
+      i && this.getZip().remove(i);
     }
     return n;
   }
   /** Returns the markdown text content of the given standard. */
   async getContent(e) {
-    const t = this.list().find((i) => i.id === e);
+    const t = this.list().find((o) => o.id === e);
     if (!t) throw new Error(`Standard not found: ${e}`);
     const n = this.getZip().file(t.contentPath);
     if (!n) throw new Error(`Content file not found: ${t.contentPath}`);
@@ -1514,12 +1518,12 @@ class os extends y {
   }
   /** Writes new markdown text content for the given standard. */
   setContent(e, t) {
-    const n = this.list().find((i) => i.id === e);
+    const n = this.list().find((o) => o.id === e);
     if (!n) throw new Error(`Standard not found: ${e}`);
     this.getZip().file(n.contentPath, t);
   }
 }
-class rs extends y {
+class rs extends w {
   constructor(e, t) {
     super(
       () => e().teams,
@@ -1527,12 +1531,12 @@ class rs extends y {
       {
         key: "teams",
         schema: pe,
-        validate: (n, i) => {
-          const o = [], r = x("team", n.id, i.deliverableNamingConvention);
-          return r && o.push(r), n.representativeEmail && !(n.memberEmails ?? []).includes(n.representativeEmail) && o.push(`representativeEmail "${n.representativeEmail}" is not a member of this team`), o;
+        validate: (n, o) => {
+          const i = [], r = x("team", n.id, o.deliverableNamingConvention);
+          return r && i.push(r), n.representativeEmail && !(n.memberEmails ?? []).includes(n.representativeEmail) && i.push(`representativeEmail "${n.representativeEmail}" is not a member of this team`), i;
         },
-        beforeRemove: (n, i) => {
-          if (i.project.clientId === n)
+        beforeRemove: (n, o) => {
+          if (o.project.clientId === n)
             throw new Error("Referenced by: project.clientId");
         }
       }
@@ -1544,8 +1548,8 @@ class rs extends y {
     return e.teams.map((n) => ({
       ...n,
       representative: t.get(n.representativeEmail ?? "") ?? null,
-      members: (n.memberEmails ?? []).map((i) => t.get(i)).filter(Boolean),
-      disciplines: (n.disciplineIds ?? []).map((i) => e.disciplines.find((o) => o.id === i)).filter(Boolean)
+      members: (n.memberEmails ?? []).map((o) => t.get(o)).filter(Boolean),
+      disciplines: (n.disciplineIds ?? []).map((o) => e.disciplines.find((i) => i.id === o)).filter(Boolean)
     }));
   }
 }
@@ -1567,10 +1571,10 @@ function as(s, e, t) {
     if (c.type === "automation" && !e.automations.some((u) => u.id === c.automationId) && n.push(`automations["${c.automationId}"] not found (node: ${l})`), c.type === "process" && c.workflowId && (c.workflowId === t ? n.push(`node "${l}" references its own workflow — would cause infinite recursion`) : e.workflows.some((u) => u.id === c.workflowId) || n.push(`workflows["${c.workflowId}"] not found (node: ${l})`)), (c.type === "process" || c.type === "automation") && c.timeouts)
       for (const u of c.timeouts)
         e.effects.some((f) => f.id === u.effectId) || n.push(`effects["${u.effectId}"] not found (node: ${l}.timeouts)`);
-  const i = Object.keys(s.nodes), o = new Set(Object.values(s.edges).map((l) => l.to)), r = new Set(Object.values(s.edges).map((l) => l.from));
-  for (const l of i)
-    s.nodes[l].type !== "start" && (o.has(l) || n.push(`node "${l}" is unreachable — no edges point to it`));
-  for (const l of i)
+  const o = Object.keys(s.nodes), i = new Set(Object.values(s.edges).map((l) => l.to)), r = new Set(Object.values(s.edges).map((l) => l.from));
+  for (const l of o)
+    s.nodes[l].type !== "start" && (i.has(l) || n.push(`node "${l}" is unreachable — no edges point to it`));
+  for (const l of o)
     s.nodes[l].type !== "end" && (r.has(l) || n.push(`node "${l}" has no outgoing edges — workflow would get stuck here`));
   const d = {};
   for (const l of Object.keys(s.edges)) {
@@ -1599,7 +1603,7 @@ function as(s, e, t) {
   }
   return n;
 }
-class ds extends y {
+class ds extends w {
   constructor(e, t, n) {
     super(
       () => e().workflows,
@@ -1608,18 +1612,18 @@ class ds extends y {
         key: "workflows",
         schema: Ae,
         autoId: !0,
-        validate: (i, o) => as(i.diagram, o, i.id)
+        validate: (o, i) => as(o.diagram, i, o.id)
       }
     ), this.getMembers = t, this.getTeams = n;
   }
   getMembers;
   getTeams;
   getRaciMatrix() {
-    const e = this.getBep(), t = [], n = /* @__PURE__ */ new Set(), i = this.getMembers().listResolved(), o = this.getTeams().listResolved(), r = (l) => (l ?? []).flatMap((c) => {
+    const e = this.getBep(), t = [], n = /* @__PURE__ */ new Set(), o = this.getMembers().listResolved(), i = this.getTeams().listResolved(), r = (l) => (l ?? []).flatMap((c) => {
       const u = e.roles.find((p) => p.id === c);
       if (!u) return [];
       n.add(c);
-      const f = i.filter((p) => p.role?.id === c), m = o.find((p) => p.members.some((g) => g.role?.id === c)) ?? null;
+      const f = o.filter((p) => p.role?.id === c), m = i.find((p) => p.members.some((g) => g.role?.id === c)) ?? null;
       return [{ role: u, members: f, team: m }];
     });
     for (const l of e.workflows)
@@ -1641,10 +1645,10 @@ class ds extends y {
     return { roles: [...n].map((l) => e.roles.find((c) => c.id === l)).filter(Boolean), rows: t };
   }
   getRaciMatrixForWorkflow(e) {
-    const t = this.getRaciMatrix(), n = t.rows.filter((o) => o.workflow.id === e), i = new Set(
-      n.flatMap((o) => [...o.responsible, ...o.accountable, ...o.consulted, ...o.informed].map((r) => r.role.id))
+    const t = this.getRaciMatrix(), n = t.rows.filter((i) => i.workflow.id === e), o = new Set(
+      n.flatMap((i) => [...i.responsible, ...i.accountable, ...i.consulted, ...i.informed].map((r) => r.role.id))
     );
-    return { roles: t.roles.filter((o) => i.has(o.id)), rows: n };
+    return { roles: t.roles.filter((i) => o.has(i.id)), rows: n };
   }
   getConsolidatedRaciMatrix() {
     const e = this.getRaciMatrix(), t = /* @__PURE__ */ new Map(), n = (r, d) => {
@@ -1667,33 +1671,33 @@ class ds extends y {
         l.responsible = n(l.responsible, r.responsible), l.accountable = n(l.accountable, r.accountable), l.consulted = n(l.consulted, r.consulted), l.informed = n(l.informed, r.informed);
       }
     }
-    const i = [...t.values()], o = new Set(
-      i.flatMap((r) => [...r.responsible, ...r.accountable, ...r.consulted, ...r.informed].map((d) => d.role.id))
+    const o = [...t.values()], i = new Set(
+      o.flatMap((r) => [...r.responsible, ...r.accountable, ...r.consulted, ...r.informed].map((d) => d.role.id))
     );
-    return { roles: e.roles.filter((r) => o.has(r.id)), rows: i };
+    return { roles: e.roles.filter((r) => i.has(r.id)), rows: o };
   }
   listResolved() {
     const e = this.getBep();
     return e.workflows.map((t) => {
       const n = {};
-      for (const [i, o] of Object.entries(t.diagram.nodes)) {
+      for (const [o, i] of Object.entries(t.diagram.nodes)) {
         const r = (d) => ({
           roles: (d ?? []).map((l) => e.roles.find((c) => c.id === l)).filter(Boolean),
           teams: [],
           members: []
         });
-        n[i] = {
-          type: o.type,
-          label: o.type === "decision" ? o.label : void 0,
-          timeouts: o.type === "process" || o.type === "automation" ? o.timeouts : void 0,
-          workflowId: o.type === "process" ? o.workflowId : void 0,
-          blocking: o.type === "process" ? o.blocking : void 0,
-          action: o.type === "process" && o.actionId ? e.actions.find((d) => d.id === o.actionId) ?? null : null,
-          automation: o.type === "automation" ? e.automations.find((d) => d.id === o.automationId) ?? null : null,
-          responsible: r(o.type === "process" ? o.responsibleRoleIds : void 0),
-          accountable: r(o.type === "process" ? o.accountableRoleIds : void 0),
-          consulted: r(o.type === "process" ? o.consultedRoleIds : void 0),
-          informed: r(o.type === "process" ? o.informedRoleIds : void 0)
+        n[o] = {
+          type: i.type,
+          label: i.type === "decision" ? i.label : void 0,
+          timeouts: i.type === "process" || i.type === "automation" ? i.timeouts : void 0,
+          workflowId: i.type === "process" ? i.workflowId : void 0,
+          blocking: i.type === "process" ? i.blocking : void 0,
+          action: i.type === "process" && i.actionId ? e.actions.find((d) => d.id === i.actionId) ?? null : null,
+          automation: i.type === "automation" ? e.automations.find((d) => d.id === i.automationId) ?? null : null,
+          responsible: r(i.type === "process" ? i.responsibleRoleIds : void 0),
+          accountable: r(i.type === "process" ? i.accountableRoleIds : void 0),
+          consulted: r(i.type === "process" ? i.consultedRoleIds : void 0),
+          informed: r(i.type === "process" ? i.informedRoleIds : void 0)
         };
       }
       return {
@@ -1705,10 +1709,10 @@ class ds extends y {
 }
 var ls = /* @__PURE__ */ (function() {
   var s = function(e, t) {
-    return s = Object.setPrototypeOf || { __proto__: [] } instanceof Array && function(n, i) {
-      n.__proto__ = i;
-    } || function(n, i) {
-      for (var o in i) i.hasOwnProperty(o) && (n[o] = i[o]);
+    return s = Object.setPrototypeOf || { __proto__: [] } instanceof Array && function(n, o) {
+      n.__proto__ = o;
+    } || function(n, o) {
+      for (var i in o) o.hasOwnProperty(i) && (n[i] = o[i]);
     }, s(e, t);
   };
   return function(e, t) {
@@ -1722,7 +1726,7 @@ var ls = /* @__PURE__ */ (function() {
 function G(s, e) {
   return cs.call(s, e);
 }
-function X(s) {
+function V(s) {
   if (Array.isArray(s)) {
     for (var e = new Array(s.length), t = 0; t < e.length; t++)
       e[t] = "" + t;
@@ -1731,11 +1735,11 @@ function X(s) {
   if (Object.keys)
     return Object.keys(s);
   var n = [];
-  for (var i in s)
-    G(s, i) && n.push(i);
+  for (var o in s)
+    G(s, o) && n.push(o);
   return n;
 }
-function R(s) {
+function T(s) {
   switch (typeof s) {
     case "object":
       return JSON.parse(JSON.stringify(s));
@@ -1747,7 +1751,7 @@ function R(s) {
       return s;
   }
 }
-function V(s) {
+function H(s) {
   for (var e = 0, t = s.length, n; e < t; ) {
     if (n = s.charCodeAt(e), n >= 48 && n <= 57) {
       e++;
@@ -1763,42 +1767,42 @@ function A(s) {
 function We(s) {
   return s.replace(/~1/g, "/").replace(/~0/g, "~");
 }
-function H(s) {
+function Y(s) {
   if (s === void 0)
     return !0;
   if (s) {
     if (Array.isArray(s)) {
       for (var e = 0, t = s.length; e < t; e++)
-        if (H(s[e]))
+        if (Y(s[e]))
           return !0;
     } else if (typeof s == "object") {
-      for (var n = X(s), i = n.length, o = 0; o < i; o++)
-        if (H(s[n[o]]))
+      for (var n = V(s), o = n.length, i = 0; i < o; i++)
+        if (Y(s[n[i]]))
           return !0;
     }
   }
   return !1;
 }
-function de(s, e) {
+function le(s, e) {
   var t = [s];
   for (var n in e) {
-    var i = typeof e[n] == "object" ? JSON.stringify(e[n], null, 2) : e[n];
-    typeof i < "u" && t.push(n + ": " + i);
+    var o = typeof e[n] == "object" ? JSON.stringify(e[n], null, 2) : e[n];
+    typeof o < "u" && t.push(n + ": " + o);
   }
   return t.join(`
 `);
 }
-var Ge = (
+var Xe = (
   /** @class */
   (function(s) {
     ls(e, s);
-    function e(t, n, i, o, r) {
-      var d = this.constructor, l = s.call(this, de(t, { name: n, index: i, operation: o, tree: r })) || this;
-      return l.name = n, l.index = i, l.operation = o, l.tree = r, Object.setPrototypeOf(l, d.prototype), l.message = de(t, { name: n, index: i, operation: o, tree: r }), l;
+    function e(t, n, o, i, r) {
+      var d = this.constructor, l = s.call(this, le(t, { name: n, index: o, operation: i, tree: r })) || this;
+      return l.name = n, l.index = o, l.operation = i, l.tree = r, Object.setPrototypeOf(l, d.prototype), l.message = le(t, { name: n, index: o, operation: i, tree: r }), l;
     }
     return e;
   })(Error)
-), E = Ge, fs = R, M = {
+), E = Xe, fs = T, M = {
   add: function(s, e, t) {
     return s[e] = this.value, { newDocument: t };
   },
@@ -1812,13 +1816,13 @@ var Ge = (
   },
   move: function(s, e, t) {
     var n = U(t, this.path);
-    n && (n = R(n));
-    var i = O(t, { op: "remove", path: this.from }).removed;
-    return O(t, { op: "add", path: this.path, value: i }), { newDocument: t, removed: n };
+    n && (n = T(n));
+    var o = O(t, { op: "remove", path: this.from }).removed;
+    return O(t, { op: "add", path: this.path, value: o }), { newDocument: t, removed: n };
   },
   copy: function(s, e, t) {
     var n = U(t, this.from);
-    return O(t, { op: "add", path: this.path, value: R(n) }), { newDocument: t };
+    return O(t, { op: "add", path: this.path, value: T(n) }), { newDocument: t };
   },
   test: function(s, e, t) {
     return { newDocument: t, test: P(s[e], this.value) };
@@ -1828,7 +1832,7 @@ var Ge = (
   }
 }, us = {
   add: function(s, e, t) {
-    return V(e) ? s.splice(e, 0, this.value) : s[e] = this.value, { newDocument: t, index: e };
+    return H(e) ? s.splice(e, 0, this.value) : s[e] = this.value, { newDocument: t, index: e };
   },
   remove: function(s, e, t) {
     var n = s.splice(e, 1);
@@ -1849,8 +1853,8 @@ function U(s, e) {
   var t = { op: "_get", path: e };
   return O(s, t), t.value;
 }
-function O(s, e, t, n, i, o) {
-  if (t === void 0 && (t = !1), n === void 0 && (n = !0), i === void 0 && (i = !0), o === void 0 && (o = 0), t && (typeof t == "function" ? t(e, 0, s, e.path) : z(e, 0)), e.path === "") {
+function O(s, e, t, n, o, i) {
+  if (t === void 0 && (t = !1), n === void 0 && (n = !0), o === void 0 && (o = !0), i === void 0 && (i = 0), t && (typeof t == "function" ? t(e, 0, s, e.path) : z(e, 0)), e.path === "") {
     var r = { newDocument: s };
     if (e.op === "add")
       return r.newDocument = e.value, r;
@@ -1860,7 +1864,7 @@ function O(s, e, t, n, i, o) {
       return r.newDocument = U(s, e.from), e.op === "move" && (r.removed = s), r;
     if (e.op === "test") {
       if (r.test = P(s, e.value), r.test === !1)
-        throw new E("Test operation failed", "TEST_OPERATION_FAILED", o, e, s);
+        throw new E("Test operation failed", "TEST_OPERATION_FAILED", i, e, s);
       return r.newDocument = s, r;
     } else {
       if (e.op === "remove")
@@ -1868,49 +1872,49 @@ function O(s, e, t, n, i, o) {
       if (e.op === "_get")
         return e.value = s, r;
       if (t)
-        throw new E("Operation `op` property is not one of operations defined in RFC-6902", "OPERATION_OP_INVALID", o, e, s);
+        throw new E("Operation `op` property is not one of operations defined in RFC-6902", "OPERATION_OP_INVALID", i, e, s);
       return r;
     }
   } else {
-    n || (s = R(s));
+    n || (s = T(s));
     var d = e.path || "", l = d.split("/"), c = s, u = 1, f = l.length, m = void 0, p = void 0, g = void 0;
     for (typeof t == "function" ? g = t : g = z; ; ) {
-      if (p = l[u], p && p.indexOf("~") != -1 && (p = We(p)), i && (p == "__proto__" || p == "prototype" && u > 0 && l[u - 1] == "constructor"))
+      if (p = l[u], p && p.indexOf("~") != -1 && (p = We(p)), o && (p == "__proto__" || p == "prototype" && u > 0 && l[u - 1] == "constructor"))
         throw new TypeError("JSON-Patch: modifying `__proto__` or `constructor/prototype` prop is banned for security reasons, if this was on purpose, please set `banPrototypeModifications` flag false and pass it to this function. More info in fast-json-patch README");
       if (t && m === void 0 && (c[p] === void 0 ? m = l.slice(0, u).join("/") : u == f - 1 && (m = e.path), m !== void 0 && g(e, 0, s, m)), u++, Array.isArray(c)) {
         if (p === "-")
           p = c.length;
         else {
-          if (t && !V(p))
-            throw new E("Expected an unsigned base-10 integer value, making the new referenced value the array element with the zero-based index", "OPERATION_PATH_ILLEGAL_ARRAY_INDEX", o, e, s);
-          V(p) && (p = ~~p);
+          if (t && !H(p))
+            throw new E("Expected an unsigned base-10 integer value, making the new referenced value the array element with the zero-based index", "OPERATION_PATH_ILLEGAL_ARRAY_INDEX", i, e, s);
+          H(p) && (p = ~~p);
         }
         if (u >= f) {
           if (t && e.op === "add" && p > c.length)
-            throw new E("The specified index MUST NOT be greater than the number of elements in the array", "OPERATION_VALUE_OUT_OF_BOUNDS", o, e, s);
+            throw new E("The specified index MUST NOT be greater than the number of elements in the array", "OPERATION_VALUE_OUT_OF_BOUNDS", i, e, s);
           var r = us[e.op].call(e, c, p, s);
           if (r.test === !1)
-            throw new E("Test operation failed", "TEST_OPERATION_FAILED", o, e, s);
+            throw new E("Test operation failed", "TEST_OPERATION_FAILED", i, e, s);
           return r;
         }
       } else if (u >= f) {
         var r = M[e.op].call(e, c, p, s);
         if (r.test === !1)
-          throw new E("Test operation failed", "TEST_OPERATION_FAILED", o, e, s);
+          throw new E("Test operation failed", "TEST_OPERATION_FAILED", i, e, s);
         return r;
       }
       if (c = c[p], t && u < f && (!c || typeof c != "object"))
-        throw new E("Cannot perform operation at the desired path", "OPERATION_PATH_UNRESOLVABLE", o, e, s);
+        throw new E("Cannot perform operation at the desired path", "OPERATION_PATH_UNRESOLVABLE", i, e, s);
     }
   }
 }
-function Z(s, e, t, n, i) {
-  if (n === void 0 && (n = !0), i === void 0 && (i = !0), t && !Array.isArray(e))
+function Z(s, e, t, n, o) {
+  if (n === void 0 && (n = !0), o === void 0 && (o = !0), t && !Array.isArray(e))
     throw new E("Patch sequence must be an array", "SEQUENCE_NOT_AN_ARRAY");
-  n || (s = R(s));
-  for (var o = new Array(e.length), r = 0, d = e.length; r < d; r++)
-    o[r] = O(s, e[r], t, !0, i, r), s = o[r].newDocument;
-  return o.newDocument = s, o;
+  n || (s = T(s));
+  for (var i = new Array(e.length), r = 0, d = e.length; r < d; r++)
+    i[r] = O(s, e[r], t, !0, o, r), s = i[r].newDocument;
+  return i.newDocument = s, i;
 }
 function ms(s, e, t) {
   var n = O(s, e);
@@ -1930,64 +1934,64 @@ function z(s, e, t, n) {
       throw new E("Operation `from` property is not present (applicable in `move` and `copy` operations)", "OPERATION_FROM_REQUIRED", e, s, t);
     if ((s.op === "add" || s.op === "replace" || s.op === "test") && s.value === void 0)
       throw new E("Operation `value` property is not present (applicable in `add`, `replace` and `test` operations)", "OPERATION_VALUE_REQUIRED", e, s, t);
-    if ((s.op === "add" || s.op === "replace" || s.op === "test") && H(s.value))
+    if ((s.op === "add" || s.op === "replace" || s.op === "test") && Y(s.value))
       throw new E("Operation `value` property is not present (applicable in `add`, `replace` and `test` operations)", "OPERATION_VALUE_CANNOT_CONTAIN_UNDEFINED", e, s, t);
     if (t) {
       if (s.op == "add") {
-        var i = s.path.split("/").length, o = n.split("/").length;
-        if (i !== o + 1 && i !== o)
+        var o = s.path.split("/").length, i = n.split("/").length;
+        if (o !== i + 1 && o !== i)
           throw new E("Cannot perform an `add` operation at the desired path", "OPERATION_PATH_CANNOT_ADD", e, s, t);
       } else if (s.op === "replace" || s.op === "remove" || s.op === "_get") {
         if (s.path !== n)
           throw new E("Cannot perform the operation at a path that does not exist", "OPERATION_PATH_UNRESOLVABLE", e, s, t);
       } else if (s.op === "move" || s.op === "copy") {
-        var r = { op: "_get", path: s.from, value: void 0 }, d = Xe([r], t);
+        var r = { op: "_get", path: s.from, value: void 0 }, d = Ge([r], t);
         if (d && d.name === "OPERATION_PATH_UNRESOLVABLE")
           throw new E("Cannot perform the operation from a path that does not exist", "OPERATION_FROM_UNRESOLVABLE", e, s, t);
       }
     }
   } else throw new E("Operation `op` property is not one of operations defined in RFC-6902", "OPERATION_OP_INVALID", e, s, t);
 }
-function Xe(s, e, t) {
+function Ge(s, e, t) {
   try {
     if (!Array.isArray(s))
       throw new E("Patch sequence must be an array", "SEQUENCE_NOT_AN_ARRAY");
     if (e)
-      Z(R(e), R(s), t || !0);
+      Z(T(e), T(s), t || !0);
     else {
       t = t || z;
       for (var n = 0; n < s.length; n++)
         t(s[n], n, e, void 0);
     }
-  } catch (i) {
-    if (i instanceof E)
-      return i;
-    throw i;
+  } catch (o) {
+    if (o instanceof E)
+      return o;
+    throw o;
   }
 }
 function P(s, e) {
   if (s === e)
     return !0;
   if (s && e && typeof s == "object" && typeof e == "object") {
-    var t = Array.isArray(s), n = Array.isArray(e), i, o, r;
+    var t = Array.isArray(s), n = Array.isArray(e), o, i, r;
     if (t && n) {
-      if (o = s.length, o != e.length)
+      if (i = s.length, i != e.length)
         return !1;
-      for (i = o; i-- !== 0; )
-        if (!P(s[i], e[i]))
+      for (o = i; o-- !== 0; )
+        if (!P(s[o], e[o]))
           return !1;
       return !0;
     }
     if (t != n)
       return !1;
     var d = Object.keys(s);
-    if (o = d.length, o !== Object.keys(e).length)
+    if (i = d.length, i !== Object.keys(e).length)
       return !1;
-    for (i = o; i-- !== 0; )
-      if (!e.hasOwnProperty(d[i]))
+    for (o = i; o-- !== 0; )
+      if (!e.hasOwnProperty(d[o]))
         return !1;
-    for (i = o; i-- !== 0; )
-      if (r = d[i], !P(s[r], e[r]))
+    for (o = i; o-- !== 0; )
+      if (r = d[o], !P(s[r], e[r]))
         return !1;
     return !0;
   }
@@ -2002,10 +2006,10 @@ const ps = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   applyReducer: ms,
   deepClone: fs,
   getValueByPointer: U,
-  validate: Xe,
+  validate: Ge,
   validator: z
 }, Symbol.toStringTag, { value: "Module" }));
-var se = /* @__PURE__ */ new WeakMap(), hs = (
+var ne = /* @__PURE__ */ new WeakMap(), hs = (
   /** @class */
   /* @__PURE__ */ (function() {
     function s(e) {
@@ -2023,79 +2027,79 @@ var se = /* @__PURE__ */ new WeakMap(), hs = (
   })()
 );
 function ys(s) {
-  return se.get(s);
+  return ne.get(s);
 }
-function bs(s, e) {
+function ws(s, e) {
   return s.observers.get(e);
 }
-function ws(s, e) {
+function bs(s, e) {
   s.observers.delete(e.callback);
 }
 function vs(s, e) {
   e.unobserve();
 }
 function Is(s, e) {
-  var t = [], n, i = ys(s);
-  if (!i)
-    i = new hs(s), se.set(s, i);
+  var t = [], n, o = ys(s);
+  if (!o)
+    o = new hs(s), ne.set(s, o);
   else {
-    var o = bs(i, e);
-    n = o && o.observer;
+    var i = ws(o, e);
+    n = i && i.observer;
   }
   if (n)
     return n;
-  if (n = {}, i.value = R(s), e) {
+  if (n = {}, o.value = T(s), e) {
     n.callback = e, n.next = null;
     var r = function() {
-      Y(n);
+      Q(n);
     }, d = function() {
       clearTimeout(n.next), n.next = setTimeout(r);
     };
     typeof window < "u" && (window.addEventListener("mouseup", d), window.addEventListener("keyup", d), window.addEventListener("mousedown", d), window.addEventListener("keydown", d), window.addEventListener("change", d));
   }
   return n.patches = t, n.object = s, n.unobserve = function() {
-    Y(n), clearTimeout(n.next), ws(i, n), typeof window < "u" && (window.removeEventListener("mouseup", d), window.removeEventListener("keyup", d), window.removeEventListener("mousedown", d), window.removeEventListener("keydown", d), window.removeEventListener("change", d));
-  }, i.observers.set(e, new gs(e, n)), n;
+    Q(n), clearTimeout(n.next), bs(o, n), typeof window < "u" && (window.removeEventListener("mouseup", d), window.removeEventListener("keyup", d), window.removeEventListener("mousedown", d), window.removeEventListener("keydown", d), window.removeEventListener("change", d));
+  }, o.observers.set(e, new gs(e, n)), n;
 }
-function Y(s, e) {
+function Q(s, e) {
   e === void 0 && (e = !1);
-  var t = se.get(s.object);
-  ne(t.value, s.object, s.patches, "", e), s.patches.length && Z(t.value, s.patches);
+  var t = ne.get(s.object);
+  oe(t.value, s.object, s.patches, "", e), s.patches.length && Z(t.value, s.patches);
   var n = s.patches;
   return n.length > 0 && (s.patches = [], s.callback && s.callback(n)), n;
 }
-function ne(s, e, t, n, i) {
+function oe(s, e, t, n, o) {
   if (e !== s) {
     typeof e.toJSON == "function" && (e = e.toJSON());
-    for (var o = X(e), r = X(s), d = !1, l = r.length - 1; l >= 0; l--) {
+    for (var i = V(e), r = V(s), d = !1, l = r.length - 1; l >= 0; l--) {
       var c = r[l], u = s[c];
       if (G(e, c) && !(e[c] === void 0 && u !== void 0 && Array.isArray(e) === !1)) {
         var f = e[c];
-        typeof u == "object" && u != null && typeof f == "object" && f != null && Array.isArray(u) === Array.isArray(f) ? ne(u, f, t, n + "/" + A(c), i) : u !== f && (i && t.push({ op: "test", path: n + "/" + A(c), value: R(u) }), t.push({ op: "replace", path: n + "/" + A(c), value: R(f) }));
-      } else Array.isArray(s) === Array.isArray(e) ? (i && t.push({ op: "test", path: n + "/" + A(c), value: R(u) }), t.push({ op: "remove", path: n + "/" + A(c) }), d = !0) : (i && t.push({ op: "test", path: n, value: s }), t.push({ op: "replace", path: n, value: e }));
+        typeof u == "object" && u != null && typeof f == "object" && f != null && Array.isArray(u) === Array.isArray(f) ? oe(u, f, t, n + "/" + A(c), o) : u !== f && (o && t.push({ op: "test", path: n + "/" + A(c), value: T(u) }), t.push({ op: "replace", path: n + "/" + A(c), value: T(f) }));
+      } else Array.isArray(s) === Array.isArray(e) ? (o && t.push({ op: "test", path: n + "/" + A(c), value: T(u) }), t.push({ op: "remove", path: n + "/" + A(c) }), d = !0) : (o && t.push({ op: "test", path: n, value: s }), t.push({ op: "replace", path: n, value: e }));
     }
-    if (!(!d && o.length == r.length))
-      for (var l = 0; l < o.length; l++) {
-        var c = o[l];
-        !G(s, c) && e[c] !== void 0 && t.push({ op: "add", path: n + "/" + A(c), value: R(e[c]) });
+    if (!(!d && i.length == r.length))
+      for (var l = 0; l < i.length; l++) {
+        var c = i[l];
+        !G(s, c) && e[c] !== void 0 && t.push({ op: "add", path: n + "/" + A(c), value: T(e[c]) });
       }
   }
 }
-function Q(s, e, t) {
+function ee(s, e, t) {
   t === void 0 && (t = !1);
   var n = [];
-  return ne(s, e, n, "", t), n;
+  return oe(s, e, n, "", t), n;
 }
 const Es = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  compare: Q,
-  generate: Y,
+  compare: ee,
+  generate: Q,
   observe: Is,
   unobserve: vs
 }, Symbol.toStringTag, { value: "Module" }));
 Object.assign({}, ps, Es, {
-  JsonPatchError: Ge,
-  deepClone: R,
+  JsonPatchError: Xe,
+  deepClone: T,
   escapePathComponent: A,
   unescapePathComponent: We
 });
@@ -2131,12 +2135,12 @@ const Ns = [
   I("env", (s) => s.key, (s) => s.key)
 ];
 function Ss(s, e, t, n) {
-  const i = new Map(s.map((r) => [t(r), r])), o = new Map(e.map((r) => [t(r), r]));
+  const o = new Map(s.map((r) => [t(r), r])), i = new Map(e.map((r) => [t(r), r]));
   return {
-    added: e.filter((r) => !i.has(t(r))).map(n),
-    removed: s.filter((r) => !o.has(t(r))).map(n),
+    added: e.filter((r) => !o.has(t(r))).map(n),
+    removed: s.filter((r) => !i.has(t(r))).map(n),
     modified: e.filter((r) => {
-      const d = i.get(t(r));
+      const d = o.get(t(r));
       return d !== void 0 && JSON.stringify(d) !== JSON.stringify(r);
     }).map(n)
   };
@@ -2148,14 +2152,14 @@ function ks(s, e) {
     return JSON.stringify(d) !== JSON.stringify(l);
   }) });
   const n = {};
-  for (const { key: o, getId: r, getLabel: d } of Ns) {
-    const l = e[o] ?? [], c = s[o] ?? [], u = Ss(l, c, r, d);
-    (u.added.length || u.removed.length || u.modified.length) && (n[o] = u);
+  for (const { key: i, getId: r, getLabel: d } of Ns) {
+    const l = e[i] ?? [], c = s[i] ?? [], u = Ss(l, c, r, d);
+    (u.added.length || u.removed.length || u.modified.length) && (n[i] = u);
   }
-  const i = [...t ? ["project"] : [], ...Object.keys(n)];
-  return { project: t, sections: n, changedKeys: i };
+  const o = [...t ? ["project"] : [], ...Object.keys(n)];
+  return { project: t, sections: n, changedKeys: o };
 }
-class k {
+class $ {
   constructor(e, t, n) {
     this.getBep = e, this.setBep = t, this.getZip = n;
   }
@@ -2168,12 +2172,12 @@ class k {
     return { major: t, minor: n };
   }
   static compareVersions(e, t) {
-    const n = k.parseVersion(e), i = k.parseVersion(t);
-    return n.major !== i.major ? n.major - i.major : n.minor - i.minor;
+    const n = $.parseVersion(e), o = $.parseVersion(t);
+    return n.major !== o.major ? n.major - o.major : n.minor - o.minor;
   }
   static bumpVersion(e, t) {
-    const [n, i] = e.split(".").map(Number);
-    return t === "version" ? `${n + 1}.0` : `${n}.${i + 1}`;
+    const [n, o] = e.split(".").map(Number);
+    return t === "version" ? `${n + 1}.0` : `${n}.${o + 1}`;
   }
   // ─── Zip helpers ──────────────────────────────────────────────────────────
   async readChangelog() {
@@ -2191,13 +2195,13 @@ class k {
    */
   async snapshotChangedStandards(e, t) {
     const n = this.getZip();
-    for (const i of e.standards) {
-      const o = n.file(i.contentPath);
-      if (!o) continue;
-      const r = await o.async("string"), d = `changelog/standards/${i.id}/`, l = Object.keys(n.files).filter((u) => u.startsWith(d) && u.endsWith(".md") && u.slice(d.length).startsWith("v")).map((u) => u.slice(d.length + 1, -3));
+    for (const o of e.standards) {
+      const i = n.file(o.contentPath);
+      if (!i) continue;
+      const r = await i.async("string"), d = `changelog/standards/${o.id}/`, l = Object.keys(n.files).filter((u) => u.startsWith(d) && u.endsWith(".md") && u.slice(d.length).startsWith("v")).map((u) => u.slice(d.length + 1, -3));
       let c = null;
       if (l.length > 0) {
-        const u = l.sort((m, p) => k.compareVersions(p, m))[0], f = n.file(`${d}v${u}.md`);
+        const u = l.sort((m, p) => $.compareVersions(p, m))[0], f = n.file(`${d}v${u}.md`);
         f && (c = await f.async("string"));
       }
       c !== r && n.file(`${d}v${t}.md`, r);
@@ -2210,10 +2214,10 @@ class k {
   async snapshotBaseStandards(e) {
     const t = this.getZip();
     for (const n of e.standards) {
-      const i = t.file(n.contentPath);
-      if (!i) continue;
-      const o = await i.async("string");
-      t.file(`baseline/standards/${n.id}.md`, o);
+      const o = t.file(n.contentPath);
+      if (!o) continue;
+      const i = await o.async("string");
+      t.file(`baseline/standards/${n.id}.md`, i);
     }
   }
   /**
@@ -2222,12 +2226,12 @@ class k {
    * Falls back to the current file if no snapshot exists (content never changed).
    */
   async resolveStandardContent(e, t) {
-    const n = this.getZip(), i = `changelog/standards/${e.id}/`, o = Object.keys(n.files).filter((d) => d.startsWith(i) && d.endsWith(".md") && d.slice(i.length).startsWith("v")).map((d) => d.slice(i.length + 1, -3)).filter((d) => k.compareVersions(d, t) <= 0).sort((d, l) => k.compareVersions(l, d));
-    if (o.length === 0) {
+    const n = this.getZip(), o = `changelog/standards/${e.id}/`, i = Object.keys(n.files).filter((d) => d.startsWith(o) && d.endsWith(".md") && d.slice(o.length).startsWith("v")).map((d) => d.slice(o.length + 1, -3)).filter((d) => $.compareVersions(d, t) <= 0).sort((d, l) => $.compareVersions(l, d));
+    if (i.length === 0) {
       const d = n.file(e.contentPath);
       return d ? d.async("string") : null;
     }
-    const r = n.file(`${i}v${o[0]}.md`);
+    const r = n.file(`${o}v${i[0]}.md`);
     return r ? r.async("string") : null;
   }
   // ─── Public API ───────────────────────────────────────────────────────────
@@ -2238,19 +2242,19 @@ class k {
     return (await this.readChangelog())?.versions ?? [];
   }
   async commit(e, t = !1) {
-    const n = this.getZip(), i = this.getBep(), o = await this.readChangelog(), r = await this.readBaseline(), d = (/* @__PURE__ */ new Date()).toISOString();
+    const n = this.getZip(), o = this.getBep(), i = await this.readChangelog(), r = await this.readBaseline(), d = (/* @__PURE__ */ new Date()).toISOString();
     if (!r) throw new Error("No baseline found — create a BEP with Bep.create() or open one with Bep.open()");
     if (e.type === "version") {
-      const g = e.approvedBy.filter((h) => !i.members.some((b) => b.email === h));
+      const g = e.approvedBy.filter((h) => !o.members.some((y) => y.email === h));
       if (g.length) throw new Error(`Members not found: ${g.join(", ")}`);
     }
     if (!t && !await this.hasPendingChanges())
       throw new Error("No pending changes since last commit");
-    const l = o?.current ?? "0.0", c = k.bumpVersion(l, e.type), u = `changelog/v${c}.diff.json`, f = Q(i, r), m = e.type === "patch" ? { version: c, type: "patch", date: d, author: e.author, description: e.description, diff: u } : { version: c, type: "version", date: d, author: e.author, description: e.description, approvedBy: e.approvedBy, diff: u }, p = {
+    const l = i?.current ?? "0.0", c = $.bumpVersion(l, e.type), u = `changelog/v${c}.diff.json`, f = ee(o, r), m = e.type === "patch" ? { version: c, type: "patch", date: d, author: e.author, description: e.description, diff: u } : { version: c, type: "version", date: d, author: e.author, description: e.description, approvedBy: e.approvedBy, diff: u }, p = {
       current: c,
-      versions: [...o?.versions ?? [], m]
+      versions: [...i?.versions ?? [], m]
     };
-    return n.file(u, JSON.stringify(f, null, 2)), await this.snapshotChangedStandards(i, c), n.file("baseline/bep.json", JSON.stringify(i, null, 2)), await this.snapshotBaseStandards(i), n.file("changelog.json", JSON.stringify(p, null, 2)), m;
+    return n.file(u, JSON.stringify(f, null, 2)), await this.snapshotChangedStandards(o, c), n.file("baseline/bep.json", JSON.stringify(o, null, 2)), await this.snapshotBaseStandards(o), n.file("changelog.json", JSON.stringify(p, null, 2)), m;
   }
   /**
    * Reconstructs the BEP state at the given version (read-only).
@@ -2272,28 +2276,28 @@ class k {
       if (!r) throw new Error(`Missing terminus: changelog/v${e}.json`);
       return B(JSON.parse(await r.async("string")));
     }
-    const i = t.versions.filter((r) => k.compareVersions(r.version, e) > 0).sort((r, d) => k.compareVersions(d.version, r.version)), o = JSON.parse(JSON.stringify(this.getBep()));
-    for (const r of i) {
+    const o = t.versions.filter((r) => $.compareVersions(r.version, e) > 0).sort((r, d) => $.compareVersions(d.version, r.version)), i = JSON.parse(JSON.stringify(this.getBep()));
+    for (const r of o) {
       if (!r.diff) break;
       const d = this.getZip().file(r.diff);
       if (!d) throw new Error(`Missing diff file: ${r.diff}`);
       const l = JSON.parse(await d.async("string"));
-      Z(o, l);
+      Z(i, l);
     }
-    return B(o);
+    return B(i);
   }
   /** Returns the RFC 6902 diff and standards summary between two versions. */
   async compare(e, t) {
-    const [n, i, o] = await Promise.all([
+    const [n, o, i] = await Promise.all([
       this.get(e),
       this.get(t),
       this.readChangelog()
-    ]), r = Q(n, i), d = new Set(n.standards.map((h) => h.id)), l = new Set(i.standards.map((h) => h.id)), c = i.standards.filter((h) => !d.has(h.id)).map((h) => ({ id: h.id, name: h.name })), u = n.standards.filter((h) => !l.has(h.id)).map((h) => ({ id: h.id, name: h.name })), m = (o?.versions ?? []).filter((h) => k.compareVersions(h.version, e) > 0 && k.compareVersions(h.version, t) <= 0).map((h) => h.version), p = this.getZip(), g = (await Promise.all(
-      i.standards.filter((h) => d.has(h.id)).map(async (h) => {
-        const b = (await Promise.all(
-          m.map(async ($) => p.file(`changelog/standards/${h.id}/v${$}.md`) !== null ? $ : null)
-        )).filter(($) => $ !== null);
-        return b.length > 0 ? { id: h.id, name: h.name, changedIn: b } : null;
+    ]), r = ee(n, o), d = new Set(n.standards.map((h) => h.id)), l = new Set(o.standards.map((h) => h.id)), c = o.standards.filter((h) => !d.has(h.id)).map((h) => ({ id: h.id, name: h.name })), u = n.standards.filter((h) => !l.has(h.id)).map((h) => ({ id: h.id, name: h.name })), m = (i?.versions ?? []).filter((h) => $.compareVersions(h.version, e) > 0 && $.compareVersions(h.version, t) <= 0).map((h) => h.version), p = this.getZip(), g = (await Promise.all(
+      o.standards.filter((h) => d.has(h.id)).map(async (h) => {
+        const y = (await Promise.all(
+          m.map(async (S) => p.file(`changelog/standards/${h.id}/v${S}.md`) !== null ? S : null)
+        )).filter((S) => S !== null);
+        return y.length > 0 ? { id: h.id, name: h.name, changedIn: y } : null;
       })
     )).filter((h) => h !== null);
     return { diff: r, standards: { added: c, removed: u, contentModified: g } };
@@ -2305,14 +2309,14 @@ class k {
   async discard() {
     const e = this.getZip(), t = await this.readBaseline();
     if (!t) throw new Error("No baseline found — call commit() first");
-    const n = new Set(t.standards.map((i) => i.id));
-    for (const i of this.getBep().standards)
-      n.has(i.id) || e.remove(i.contentPath);
-    for (const i of t.standards) {
-      const o = e.file(`baseline/standards/${i.id}.md`);
-      if (!o) continue;
-      const r = await o.async("string");
-      e.file(i.contentPath, r);
+    const n = new Set(t.standards.map((o) => o.id));
+    for (const o of this.getBep().standards)
+      n.has(o.id) || e.remove(o.contentPath);
+    for (const o of t.standards) {
+      const i = e.file(`baseline/standards/${o.id}.md`);
+      if (!i) continue;
+      const r = await i.async("string");
+      e.file(o.contentPath, r);
     }
     this.setBep(t);
   }
@@ -2321,12 +2325,12 @@ class k {
    * version and immediately commits it as a new version.
    */
   async revert(e, t) {
-    const n = this.getZip(), i = await this.get(e);
-    for (const o of i.standards) {
-      const r = await this.resolveStandardContent(o, e);
-      r !== null && n.file(o.contentPath, r);
+    const n = this.getZip(), o = await this.get(e);
+    for (const i of o.standards) {
+      const r = await this.resolveStandardContent(i, e);
+      r !== null && n.file(i.contentPath, r);
     }
-    return this.setBep(i), this.commit(t);
+    return this.setBep(o), this.commit(t);
   }
   /**
    * Returns a structured diff of the current BEP state vs the last committed baseline.
@@ -2335,17 +2339,17 @@ class k {
   async status() {
     const e = this.getZip(), t = await this.readBaseline();
     if (!t) return { hasPendingChanges: !1, project: null, sections: {}, changedKeys: [], standards: [] };
-    const n = this.getBep(), i = ks(n, t), o = [], r = new Map(t.standards.map((c) => [c.id, c])), d = new Set(n.standards.map((c) => c.id));
+    const n = this.getBep(), o = ks(n, t), i = [], r = new Map(t.standards.map((c) => [c.id, c])), d = new Set(n.standards.map((c) => c.id));
     for (const c of n.standards)
       if (!r.has(c.id))
-        o.push({ id: c.id, name: c.name, status: "added" });
+        i.push({ id: c.id, name: c.name, status: "added" });
       else {
         const u = JSON.stringify(r.get(c.id)) !== JSON.stringify(c), f = e.file(`baseline/standards/${c.id}.md`), m = e.file(c.contentPath), p = f ? await f.async("string") : "", g = m ? await m.async("string") : "";
-        u ? o.push({ id: c.id, name: c.name, status: "modified" }) : p !== g && o.push({ id: c.id, name: c.name, status: "content-modified" });
+        u ? i.push({ id: c.id, name: c.name, status: "modified" }) : p !== g && i.push({ id: c.id, name: c.name, status: "content-modified" });
       }
     for (const c of t.standards)
-      d.has(c.id) || o.push({ id: c.id, name: c.name, status: "removed" });
-    return { hasPendingChanges: i.changedKeys.length > 0 || o.length > 0, standards: o, ...i };
+      d.has(c.id) || i.push({ id: c.id, name: c.name, status: "removed" });
+    return { hasPendingChanges: o.changedKeys.length > 0 || i.length > 0, standards: i, ...o };
   }
   /** Shorthand — true if there are uncommitted changes since the last commit. */
   async hasPendingChanges() {
@@ -2354,18 +2358,18 @@ class k {
   /** Returns all versions sorted ascending, with author/approvedBy resolved to { email, name } objects. */
   async listResolved() {
     const [e, t] = await Promise.all([this.list(), this.current()]), n = this.getBep().members;
-    return e.sort((i, o) => k.compareVersions(i.version, o.version)).map((i) => ({
-      version: i.version,
-      type: i.type,
-      date: i.date,
-      description: i.description,
-      diff: i.diff,
-      isCurrent: i.version === t,
-      author: i.author ? { email: i.author, name: n.find((o) => o.email === i.author)?.name ?? null } : null,
-      ...i.type === "version" ? {
-        approvedBy: i.approvedBy.map((o) => ({
-          email: o,
-          name: n.find((r) => r.email === o)?.name ?? null
+    return e.sort((o, i) => $.compareVersions(o.version, i.version)).map((o) => ({
+      version: o.version,
+      type: o.type,
+      date: o.date,
+      description: o.description,
+      diff: o.diff,
+      isCurrent: o.version === t,
+      author: o.author ? { email: o.author, name: n.find((i) => i.email === o.author)?.name ?? null } : null,
+      ...o.type === "version" ? {
+        approvedBy: o.approvedBy.map((i) => ({
+          email: i,
+          name: n.find((r) => r.email === i)?.name ?? null
         }))
       } : {}
     }));
@@ -2375,8 +2379,8 @@ class k {
    * Returns null if the standard did not exist at that version.
    */
   async getStandardContent(e, t) {
-    const i = (await this.get(t)).standards.find((o) => o.id === e);
-    return i ? this.resolveStandardContent(i, t) : null;
+    const o = (await this.get(t)).standards.find((i) => i.id === e);
+    return o ? this.resolveStandardContent(o, t) : null;
   }
   /**
    * ⚠️ Destructive: resets the BEP to a historical version and permanently
@@ -2385,12 +2389,12 @@ class k {
   async reset(e) {
     const t = this.getZip(), n = await this.readChangelog();
     if (!n) throw new Error("No changelog found");
-    const i = n.versions.find((c) => c.version === e), o = !!this.getZip().file(`changelog/v${e}.json`);
-    if (!i && !o)
+    const o = n.versions.find((c) => c.version === e), i = !!this.getZip().file(`changelog/v${e}.json`);
+    if (!o && !i)
       throw new Error(`Version not found: ${e}`);
     if (e === n.current)
       throw new Error(`Already at version ${e}`);
-    const r = n.versions.filter((c) => k.compareVersions(c.version, e) > 0), d = await this.get(e);
+    const r = n.versions.filter((c) => $.compareVersions(c.version, e) > 0), d = await this.get(e);
     for (const c of d.standards) {
       const u = await this.resolveStandardContent(c, e);
       u !== null && t.file(c.contentPath, u);
@@ -2401,7 +2405,7 @@ class k {
     const l = JSON.stringify(d, null, 2);
     t.file("changelog.json", JSON.stringify({
       current: e,
-      versions: n.versions.filter((c) => k.compareVersions(c.version, e) <= 0)
+      versions: n.versions.filter((c) => $.compareVersions(c.version, e) <= 0)
     }, null, 2)), t.file("bep.json", l), t.file("baseline/bep.json", l), this.setBep(d);
   }
   /**
@@ -2414,20 +2418,20 @@ class k {
     if (!n) throw new Error("No changelog found");
     if (!/^\d+\.0$/.test(e.newBase))
       throw new Error(`newBase must be in X.0 format (e.g. "2.0"), got "${e.newBase}"`);
-    if (k.compareVersions(e.newBase, n.current) <= 0)
+    if ($.compareVersions(e.newBase, n.current) <= 0)
       throw new Error(`newBase "${e.newBase}" must be greater than current version "${n.current}"`);
-    const i = this.getBep(), o = e.approvedBy.filter((d) => !i.members.some((l) => l.email === d));
-    if (o.length) throw new Error(`Members not found: ${o.join(", ")}`);
+    const o = this.getBep(), i = e.approvedBy.filter((d) => !o.members.some((l) => l.email === d));
+    if (i.length) throw new Error(`Members not found: ${i.join(", ")}`);
     for (const d of n.versions)
       d.diff && t.remove(d.diff);
-    Object.keys(t.files).filter((d) => /^changelog\/v[\d.]+\.json$/.test(d)).forEach((d) => t.remove(d)), Object.keys(t.files).filter((d) => d.startsWith("changelog/standards/") && d.endsWith(".md")).forEach((d) => t.remove(d)), t.file(`changelog/v${e.newBase}.json`, JSON.stringify(i, null, 2));
-    for (const d of i.standards) {
+    Object.keys(t.files).filter((d) => /^changelog\/v[\d.]+\.json$/.test(d)).forEach((d) => t.remove(d)), Object.keys(t.files).filter((d) => d.startsWith("changelog/standards/") && d.endsWith(".md")).forEach((d) => t.remove(d)), t.file(`changelog/v${e.newBase}.json`, JSON.stringify(o, null, 2));
+    for (const d of o.standards) {
       const l = t.file(d.contentPath);
       if (!l) continue;
       const c = await l.async("string");
       t.file(`changelog/standards/${d.id}/v${e.newBase}.md`, c);
     }
-    t.file("baseline/bep.json", JSON.stringify(i, null, 2)), await this.snapshotBaseStandards(i);
+    t.file("baseline/bep.json", JSON.stringify(o, null, 2)), await this.snapshotBaseStandards(o);
     const r = {
       version: e.newBase,
       type: "version",
@@ -2477,52 +2481,58 @@ function Rs(s, e) {
   }
 }
 function Ts(s, e, t, n) {
-  const o = s.workflows.find((m) => m.id === t)?.diagram.nodes[e];
-  if (!o || o.type !== "process") return !0;
-  const r = !!(o.responsibleRoleIds?.length || o.responsibleTeamIds?.length || o.responsibleEmails?.length), d = !!(o.accountableRoleIds?.length || o.accountableTeamIds?.length || o.accountableEmails?.length);
+  const i = s.workflows.find((m) => m.id === t)?.diagram.nodes[e];
+  if (!i || i.type !== "process") return !0;
+  const r = !!(i.responsibleRoleIds?.length || i.responsibleTeamIds?.length || i.responsibleEmails?.length), d = !!(i.accountableRoleIds?.length || i.accountableTeamIds?.length || i.accountableEmails?.length);
   if (!r && !d) return !0;
   const c = s.members.find((m) => m.email === n)?.roleId, u = new Set(s.teams.filter((m) => (m.memberEmails ?? []).includes(n)).map((m) => m.id)), f = (m, p, g) => {
     if (g?.includes(n)) return !0;
-    const h = !!m?.length, b = !!p?.length;
-    return b && h ? !!c && m.includes(c) && p.some(($) => u.has($)) : b ? p.some(($) => u.has($)) : h ? !!c && m.includes(c) : !1;
+    const h = !!m?.length, y = !!p?.length;
+    return y && h ? !!c && m.includes(c) && p.some((S) => u.has(S)) : y ? p.some((S) => u.has(S)) : h ? !!c && m.includes(c) : !1;
   };
-  return r && f(o.responsibleRoleIds, o.responsibleTeamIds, o.responsibleEmails) || d && f(o.accountableRoleIds, o.accountableTeamIds, o.accountableEmails);
+  return r && f(i.responsibleRoleIds, i.responsibleTeamIds, i.responsibleEmails) || d && f(i.accountableRoleIds, i.accountableTeamIds, i.accountableEmails);
 }
 const js = { string: "string", number: "number", boolean: "boolean" };
 function As(s, e, t) {
   const n = s.events.find((d) => d.id === e);
   if (!n?.payload?.length) return [];
-  const i = [], o = t ?? {};
+  const o = [], i = t ?? {};
   for (const d of n.payload) {
-    const l = o[d.key];
+    const l = i[d.key];
     if (l == null)
-      d.required && i.push({ field: d.key, reason: "missing" });
+      d.required && o.push({ field: d.key, reason: "missing" });
     else {
       const c = js[d.type];
-      c && typeof l !== c && i.push({ field: d.key, reason: "wrong_type" });
+      if (c && typeof l !== c)
+        o.push({ field: d.key, reason: "wrong_type" });
+      else if (d.type === "string" && d.validation)
+        try {
+          new RegExp(d.validation.pattern, d.validation.flags).test(l) || o.push({ field: d.key, reason: "invalid_format" });
+        } catch {
+        }
     }
   }
   const r = new Set(n.payload.map((d) => d.key));
-  for (const d of Object.keys(o))
-    r.has(d) || i.push({ field: d, reason: "unknown_field" });
-  return i;
+  for (const d of Object.keys(i))
+    r.has(d) || o.push({ field: d, reason: "unknown_field" });
+  return o;
 }
 function Os(s, e) {
   return !(!("triggerEventId" in s) || s.triggerEventId !== e.eventId);
 }
-function _s(s, e, t, n, i) {
-  const o = s.workflows.find((f) => f.id === e);
-  if (!o) return null;
-  const r = Object.keys(o.diagram.nodes).find(
-    (f) => o.diagram.nodes[f].type === "start"
+function _s(s, e, t, n, o) {
+  const i = s.workflows.find((f) => f.id === e);
+  if (!i) return null;
+  const r = Object.keys(i.diagram.nodes).find(
+    (f) => i.diagram.nodes[f].type === "start"
   );
   if (!r) return null;
-  const d = Object.entries(o.diagram.edges).find(([, f]) => f.from === r), l = d?.[1].to ?? r, c = d ? (d[1].effectIds ?? []).map((f) => ({ effectId: f, fromEdgeId: d[0] })) : [], u = (/* @__PURE__ */ new Date()).toISOString();
+  const d = Object.entries(i.diagram.edges).find(([, f]) => f.from === r), l = d?.[1].to ?? r, c = d ? (d[1].effectIds ?? []).map((f) => ({ effectId: f, fromEdgeId: d[0] })) : [], u = (/* @__PURE__ */ new Date()).toISOString();
   return {
     instance: {
       id: globalThis.crypto.randomUUID(),
       workflowId: e,
-      bepVersion: i,
+      bepVersion: o,
       trackedAsset: t,
       currentNodeId: l,
       status: "active",
@@ -2534,14 +2544,14 @@ function _s(s, e, t, n, i) {
     startEffects: c
   };
 }
-function le(s, e, t, n) {
+function W(s, e, t, n) {
   if (e.status !== "active")
     return { ok: !1, error: "INSTANCE_NOT_ACTIVE" };
   if (!n?.skipRaci && !Ts(s, e.currentNodeId, e.workflowId, t.actor))
     return { ok: !1, error: "UNAUTHORIZED" };
-  const i = s.workflows.find((N) => N.id === e.workflowId);
-  if (!i) return { ok: !1, error: "NO_MATCHING_EDGE" };
-  const { nodes: o, edges: r } = i.diagram;
+  const o = s.workflows.find((N) => N.id === e.workflowId);
+  if (!o) return { ok: !1, error: "NO_MATCHING_EDGE" };
+  const { nodes: i, edges: r } = o.diagram;
   let d = e.currentNodeId;
   const l = [], c = [], u = [], f = Object.entries(r).filter(
     ([, N]) => N.from === d && Os(N, t)
@@ -2555,55 +2565,55 @@ function le(s, e, t, n) {
   }
   l.push(ce(m, d, p.to, t)), c.push(...(p.effectIds ?? []).map((N) => ({ effectId: N, fromEdgeId: m }))), u.push({ edgeId: m, fromNodeId: d, toNodeId: p.to }), d = p.to;
   let g = 0;
-  for (; o[d]?.type === "decision"; ) {
+  for (; i[d]?.type === "decision"; ) {
     if (++g > $s) return { ok: !1, error: "DECISION_LOOP" };
     const N = Object.entries(r).filter(([, v]) => v.from !== d || !("guard" in v) ? !1 : Rs(v.guard, t.payload ?? {}));
     if (N.length === 0) break;
-    const [j, w] = N[0];
-    l.push(ce(j, d, w.to, t, !0)), c.push(...(w.effectIds ?? []).map((v) => ({ effectId: v, fromEdgeId: j }))), u.push({ edgeId: j, fromNodeId: d, toNodeId: w.to }), d = w.to;
+    const [j, b] = N[0];
+    l.push(ce(j, d, b.to, t, !0)), c.push(...(b.effectIds ?? []).map((v) => ({ effectId: v, fromEdgeId: j }))), u.push({ edgeId: j, fromNodeId: d, toNodeId: b.to }), d = b.to;
   }
-  const h = o[d], b = h?.type === "end" ? "completed" : "active", $ = {
+  const h = i[d], y = h?.type === "end" ? "completed" : "active", S = {
     ...e,
     currentNodeId: d,
-    status: b,
+    status: y,
     history: [...e.history, ...l],
     updatedAt: (/* @__PURE__ */ new Date()).toISOString()
-  }, T = h?.type === "automation" && h.automationId ? { nodeId: d, automationId: h.automationId } : void 0;
-  return { ok: !0, instance: $, transitionsApplied: u, effectsToFire: c, automationNodePending: T };
+  }, R = h?.type === "automation" && h.automationId ? { nodeId: d, automationId: h.automationId } : void 0;
+  return { ok: !0, instance: S, transitionsApplied: u, effectsToFire: c, automationNodePending: R };
 }
 function Bs(s, e, t) {
-  const n = s.workflows.find((w) => w.id === e.workflowId), { nodes: i, edges: o } = n.diagram, r = i[e.currentNodeId], l = s.members.find((w) => w.email === t)?.roleId, c = new Set(
-    s.teams.filter((w) => (w.memberEmails ?? []).includes(t)).map((w) => w.id)
-  ), u = (w) => (w ?? []).flatMap((v) => {
-    const S = s.roles.find((_) => _.id === v);
-    return S ? [{ id: S.id, name: S.name }] : [];
-  }), f = (w) => (w ?? []).flatMap((v) => {
-    const S = s.teams.find((_) => _.id === v);
-    return S ? [{ id: S.id, name: S.name }] : [];
-  }), m = (w, v, S) => ({
-    roles: u(w),
+  const n = s.workflows.find((b) => b.id === e.workflowId), { nodes: o, edges: i } = n.diagram, r = o[e.currentNodeId], l = s.members.find((b) => b.email === t)?.roleId, c = new Set(
+    s.teams.filter((b) => (b.memberEmails ?? []).includes(t)).map((b) => b.id)
+  ), u = (b) => (b ?? []).flatMap((v) => {
+    const k = s.roles.find((_) => _.id === v);
+    return k ? [{ id: k.id, name: k.name }] : [];
+  }), f = (b) => (b ?? []).flatMap((v) => {
+    const k = s.teams.find((_) => _.id === v);
+    return k ? [{ id: k.id, name: k.name }] : [];
+  }), m = (b, v, k) => ({
+    roles: u(b),
     teams: f(v),
-    emails: S ?? []
-  }), p = (w, v, S) => {
-    if (S?.includes(t)) return !0;
-    const _ = !!w?.length, ie = !!v?.length;
-    return ie && _ ? !!l && w.includes(l) && v.some((J) => c.has(J)) : ie ? v.some((J) => c.has(J)) : _ ? !!l && w.includes(l) : !1;
-  }, g = r.type === "process" ? r : null, h = !!(g?.responsibleRoleIds?.length || g?.responsibleTeamIds?.length || g?.responsibleEmails?.length), b = !!(g?.accountableRoleIds?.length || g?.accountableTeamIds?.length || g?.accountableEmails?.length), $ = !h && !b || h && p(g?.responsibleRoleIds, g?.responsibleTeamIds, g?.responsibleEmails) || b && p(g?.accountableRoleIds, g?.accountableTeamIds, g?.accountableEmails), T = (w) => (s.events.find((v) => v.id === w)?.payload ?? []).map((v) => ({
+    emails: k ?? []
+  }), p = (b, v, k) => {
+    if (k?.includes(t)) return !0;
+    const _ = !!b?.length, ie = !!v?.length;
+    return ie && _ ? !!l && b.includes(l) && v.some((J) => c.has(J)) : ie ? v.some((J) => c.has(J)) : _ ? !!l && b.includes(l) : !1;
+  }, g = r.type === "process" ? r : null, h = !!(g?.responsibleRoleIds?.length || g?.responsibleTeamIds?.length || g?.responsibleEmails?.length), y = !!(g?.accountableRoleIds?.length || g?.accountableTeamIds?.length || g?.accountableEmails?.length), S = !h && !y || h && p(g?.responsibleRoleIds, g?.responsibleTeamIds, g?.responsibleEmails) || y && p(g?.accountableRoleIds, g?.accountableTeamIds, g?.accountableEmails), R = (b) => (s.events.find((v) => v.id === b)?.payload ?? []).map((v) => ({
     key: v.key,
     type: v.type,
     required: v.required
   })), N = [], j = [];
-  for (const [w, v] of Object.entries(o)) {
+  for (const [b, v] of Object.entries(i)) {
     if (v.from !== e.currentNodeId || !("triggerEventId" in v)) continue;
-    const S = v.triggerEventId;
-    $ ? N.push({
-      edgeId: w,
-      label: v.label ?? S,
-      emits: S,
-      requiredPayload: T(S)
+    const k = v.triggerEventId;
+    S ? N.push({
+      edgeId: b,
+      label: v.label ?? k,
+      emits: k,
+      requiredPayload: R(k)
     }) : j.push({
-      edgeId: w,
-      label: v.label ?? S,
+      edgeId: b,
+      label: v.label ?? k,
       reason: "UNAUTHORIZED",
       required: m(
         [...g?.responsibleRoleIds ?? [], ...g?.accountableRoleIds ?? []],
@@ -2629,7 +2639,7 @@ function Bs(s, e, t) {
     isTerminal: r.type === "end"
   };
 }
-function ce(s, e, t, n, i) {
+function ce(s, e, t, n, o) {
   return {
     id: globalThis.crypto.randomUUID(),
     edgeId: s,
@@ -2638,7 +2648,7 @@ function ce(s, e, t, n, i) {
     trigger: n,
     actor: n.actor,
     timestamp: (/* @__PURE__ */ new Date()).toISOString(),
-    ...i ? { auto: !0 } : {}
+    ...o ? { auto: !0 } : {}
   };
 }
 class Ms {
@@ -2672,8 +2682,12 @@ class Ps {
   getBep;
   getHistoricalBep;
   // eslint-disable-next-line @typescript-eslint/no-explicit-any
-  runtime;
+  _runtime;
   storage;
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  get runtime() {
+    return this._runtime;
+  }
   skipRaci = !1;
   transitionListeners = [];
   createdListeners = [];
@@ -2692,7 +2706,7 @@ class Ps {
    * Returns `this` for chaining.
    */
   init(e) {
-    return this.runtime = e.runtime, this.storage = e.storage ?? new Ms(), this.skipRaci = e.events?.skipRaci ?? !1, this;
+    return this._runtime = e.runtime, this.storage = e.storage ?? new Ms(), this.skipRaci = e.events?.skipRaci ?? !1, this;
   }
   // ─── Lifecycle listeners ─────────────────────────────────────────────────────
   /** Fires after every successful emit() — all listeners run concurrently. */
@@ -2719,12 +2733,29 @@ class Ps {
    */
   async createInstance(e, t, n) {
     this._assertInit();
-    const i = this.getBep(), r = _s(i, e, t, n, "unversioned");
+    const o = this.getBep(), r = _s(o, e, t, n, "unversioned");
     if (!r) return null;
     const { instance: d, startEffects: l } = r;
-    for (const c of l)
-      await this._executeEffect(d, c);
-    return await this.storage.saveInstance(d), await this._fire(this.createdListeners, d), d;
+    for (const h of l)
+      await this._executeEffect(d, h);
+    const u = o.workflows.find((h) => h.id === e)?.diagram.nodes[d.currentNodeId];
+    let f = u?.type === "automation" && u.automationId ? { automationId: u.automationId } : void 0, m = d;
+    const p = 10;
+    let g = 0;
+    for (; f && g++ < p; ) {
+      const { automationId: h } = f, { eventId: y, ...S } = await this._executeAutomationNode(m, h), R = W(o, m, {
+        eventId: y,
+        actor: "_system",
+        softwareId: "_system",
+        payload: S
+      });
+      if (!R.ok) break;
+      m = R.instance;
+      for (const N of R.effectsToFire ?? [])
+        await this._executeEffect(m, N);
+      f = R.automationNodePending;
+    }
+    return await this.storage.saveInstance(m), await this._fire(this.createdListeners, m), m;
   }
   /**
    * Emits an event against a workflow instance.
@@ -2741,25 +2772,25 @@ class Ps {
     this._assertInit();
     const n = await this.storage.getInstance(e);
     if (!n) return { ok: !1, error: "NO_MATCHING_EDGE" };
-    const i = await this._resolveBep(n.bepVersion);
-    let o = le(i, n, t, { skipRaci: this.skipRaci });
-    if (!o.ok) return { ok: !1, error: o.error, payloadErrors: o.payloadErrors };
-    const r = [...o.transitionsApplied ?? []], d = [];
-    let l = o.instance;
-    for (const f of o.effectsToFire ?? [])
+    const o = await this._resolveBep(n.bepVersion);
+    let i = W(o, n, t, { skipRaci: this.skipRaci });
+    if (!i.ok) return { ok: !1, error: i.error, payloadErrors: i.payloadErrors };
+    const r = [...i.transitionsApplied ?? []], d = [];
+    let l = i.instance;
+    for (const f of i.effectsToFire ?? [])
       d.push(await this._executeEffect(l, f));
     const c = 10;
     let u = 0;
-    for (; o.automationNodePending && u++ < c; ) {
-      const { automationId: f } = o.automationNodePending, { eventId: m, ...p } = await this._executeAutomationNode(l, f);
-      if (o = le(i, l, {
+    for (; i.automationNodePending && u++ < c; ) {
+      const { automationId: f } = i.automationNodePending, { eventId: m, ...p } = await this._executeAutomationNode(l, f);
+      if (i = W(o, l, {
         eventId: m,
         actor: "_system",
         softwareId: "_system",
         payload: p
-      }), !o.ok) break;
-      l = o.instance, r.push(...o.transitionsApplied ?? []);
-      for (const g of o.effectsToFire ?? [])
+      }), !i.ok) break;
+      l = i.instance, r.push(...i.transitionsApplied ?? []);
+      for (const g of i.effectsToFire ?? [])
         d.push(await this._executeEffect(l, g));
     }
     return await this.storage.saveInstance(l), await this._fire(this.transitionListeners, l, r, d), l.status === "completed" && await this._fire(this.completedListeners, l), {
@@ -2780,11 +2811,11 @@ class Ps {
    */
   async getInstances(e) {
     this._assertInit();
-    const { pendingActionFor: t, ...n } = e ?? {}, i = await this.storage.listInstances(n);
-    if (!t) return i;
-    const o = this.getBep(), r = o.members.find((d) => d.email === t);
-    return r ? i.filter((d) => {
-      const l = o.workflows.find((m) => m.id === d.workflowId);
+    const { pendingActionFor: t, ...n } = e ?? {}, o = await this.storage.listInstances(n);
+    if (!t) return o;
+    const i = this.getBep(), r = i.members.find((d) => d.email === t);
+    return r ? o.filter((d) => {
+      const l = i.workflows.find((m) => m.id === d.workflowId);
       if (!l) return !1;
       const c = l.diagram.nodes[d.currentNodeId];
       if (!c) return !1;
@@ -2803,8 +2834,8 @@ class Ps {
     this._assertInit();
     const n = await this.storage.getInstance(e);
     if (!n) return null;
-    const i = await this._resolveBep(n.bepVersion);
-    return Bs(i, n, t);
+    const o = await this._resolveBep(n.bepVersion);
+    return Bs(o, n, t);
   }
   async deleteInstance(e) {
     this._assertInit(), await this.storage.deleteInstance(e);
@@ -2815,10 +2846,10 @@ class Ps {
    */
   async getRemoteData(e) {
     this._assertInit();
-    const n = this.getBep().remoteData.find((i) => i.id === e);
+    const n = this.getBep().remoteData.find((o) => o.id === e);
     if (!n) throw new Error(`Remote data "${e}" not found in BEP`);
     if (!n.resolverId) throw new Error(`Remote data "${e}" has no resolver assigned`);
-    return this.runtime._runResolver(n.resolverId, n.url);
+    return this._runtime._runResolver(n.resolverId, n.url);
   }
   // ─── Internal ────────────────────────────────────────────────────────────────
   _assertInit() {
@@ -2833,23 +2864,23 @@ class Ps {
   }
   _resolveFromHistory(e, t) {
     for (let n = t.length - 1; n >= 0; n--) {
-      const i = t[n].trigger.payload ?? {};
-      if (e in i) return i[e];
+      const o = t[n].trigger.payload ?? {};
+      if (e in o) return o[e];
     }
   }
   async _executeAutomationNode(e, t) {
-    const o = this.getBep().automations.find((l) => l.id === t)?.payload ?? [], r = Object.fromEntries(o.map((l) => [l.key, this._resolveFromHistory(l.key, e.history)])), d = this.runtime.automations[t];
+    const i = this.getBep().automations.find((l) => l.id === t)?.payload ?? [], r = Object.fromEntries(i.map((l) => [l.key, this._resolveFromHistory(l.key, e.history)])), d = this._runtime.automations[t];
     if (!d) throw new Error(`No handler declared for automation "${t}"`);
     return d(e, r);
   }
   async _executeEffect(e, t) {
-    const o = this.getBep().effects.find((c) => c.id === t.effectId)?.payload ?? [], r = o.filter((c) => c.required && this._resolveFromHistory(c.key, e.history) === void 0).map((c) => c.key);
+    const i = this.getBep().effects.find((c) => c.id === t.effectId)?.payload ?? [], r = i.filter((c) => c.required && this._resolveFromHistory(c.key, e.history) === void 0).map((c) => c.key);
     if (r.length > 0)
       return { effectId: t.effectId, fromEdgeId: t.fromEdgeId, status: "skipped", missingFields: r };
-    const d = this.runtime.effects[t.effectId];
+    const d = this._runtime.effects[t.effectId];
     if (!d)
       return { effectId: t.effectId, fromEdgeId: t.fromEdgeId, status: "skipped" };
-    const l = Object.fromEntries(o.map((c) => [c.key, this._resolveFromHistory(c.key, e.history)]));
+    const l = Object.fromEntries(i.map((c) => [c.key, this._resolveFromHistory(c.key, e.history)]));
     try {
       return await d(e, l), { effectId: t.effectId, fromEdgeId: t.fromEdgeId, status: "executed" };
     } catch (c) {
@@ -2861,14 +2892,14 @@ class Ps {
 function zs(s, e) {
   const t = /* @__PURE__ */ new Map();
   for (const n of s) {
-    const i = [e(n)].flat();
-    for (const o of i)
-      t.has(o) || t.set(o, []), t.get(o).push(n);
+    const o = [e(n)].flat();
+    for (const i of o)
+      t.has(i) || t.set(i, []), t.get(i).push(n);
   }
-  return Array.from(t.entries()).map(([n, i]) => ({ key: n, rows: i }));
+  return Array.from(t.entries()).map(([n, o]) => ({ key: n, rows: o }));
 }
 function Zs(s, e = "responsible", t = {}) {
-  const { topologicalSort: n = !1 } = t, i = (m) => `_${m}`, o = "#444444", r = Object.entries(s.nodes), d = r.find(([, m]) => m.type === "start")?.[0], l = r.find(([, m]) => m.type === "end")?.[0];
+  const { topologicalSort: n = !1 } = t, o = (m) => `_${m}`, i = "#444444", r = Object.entries(s.nodes), d = r.find(([, m]) => m.type === "start")?.[0], l = r.find(([, m]) => m.type === "end")?.[0];
   let c;
   if (n && d) {
     const m = /* @__PURE__ */ new Set(), p = [d], g = [];
@@ -2876,8 +2907,8 @@ function Zs(s, e = "responsible", t = {}) {
       const h = p.shift();
       if (!m.has(h)) {
         m.add(h), g.push(h);
-        for (const b of Object.values(s.edges))
-          b.from === h && !m.has(b.to) && p.push(b.to);
+        for (const y of Object.values(s.edges))
+          y.from === h && !m.has(y.to) && p.push(y.to);
       }
     }
     for (const [h] of r)
@@ -2895,14 +2926,14 @@ function Zs(s, e = "responsible", t = {}) {
   for (const m of c) {
     const p = s.nodes[m];
     if (!p) continue;
-    const g = p.type === "start" || p.type === "end", b = (p.type === "decision" ? p.label ?? m : p.action?.name ?? p.automation?.name ?? "").replace(/"/g, "&quot;"), $ = g || p.type === "decision" ? [] : p[e].roles.map((j) => j.name), T = $.length > 0 ? `"<b>${$.join(" · ")}</b><br/>${b}"` : `"${b || m}"`;
-    g ? u.push(`  ${i(m)}([${b || p.type.toUpperCase()}])`) : p.type === "decision" ? u.push(`  ${i(m)}{${T}}`) : p.type === "automation" ? u.push(`  ${i(m)}[[${T}]]`) : u.push(`  ${i(m)}(${T})`);
-    const N = p[e].roles[0]?.color ?? o;
-    g ? u.push(`  style ${i(m)} fill:#2962FF,stroke:none`) : u.push(`  style ${i(m)} fill:none,stroke:${N},stroke-width:3px`);
+    const g = p.type === "start" || p.type === "end", y = (p.type === "decision" ? p.label ?? m : p.action?.name ?? p.automation?.name ?? "").replace(/"/g, "&quot;"), S = g || p.type === "decision" ? [] : p[e].roles.map((j) => j.name), R = S.length > 0 ? `"<b>${S.join(" · ")}</b><br/>${y}"` : `"${y || m}"`;
+    g ? u.push(`  ${o(m)}([${y || p.type.toUpperCase()}])`) : p.type === "decision" ? u.push(`  ${o(m)}{${R}}`) : p.type === "automation" ? u.push(`  ${o(m)}[[${R}]]`) : u.push(`  ${o(m)}(${R})`);
+    const N = p[e].roles[0]?.color ?? i;
+    g ? u.push(`  style ${o(m)} fill:#2962FF,stroke:none`) : u.push(`  style ${o(m)} fill:none,stroke:${N},stroke-width:3px`);
   }
   const f = n ? c.flatMap((m) => Object.values(s.edges).filter((p) => p.from === m)) : Object.values(s.edges);
   for (const m of f)
-    m.label ? u.push(`  ${i(m.from)} -->|${m.label}| ${i(m.to)}`) : u.push(`  ${i(m.from)} --> ${i(m.to)}`);
+    m.label ? u.push(`  ${o(m.from)} -->|${m.label}| ${o(m.to)}`) : u.push(`  ${o(m.from)} --> ${o(m.to)}`);
   return u.join(`
 `);
 }
@@ -2936,22 +2967,22 @@ class D {
     const n = () => this._data;
     this.project = new jt(
       () => this._data.project,
-      (i) => {
-        this._data.project = i;
+      (o) => {
+        this._data.project = o;
       },
       fe,
-      (i, o) => {
-        const r = [], d = x("project", i.code, o.deliverableNamingConvention);
-        return d && r.push(d), i.clientId && !o.teams.some((l) => l.id === i.clientId) && r.push(`teams["${i.clientId}"] not found`), r;
+      (o, i) => {
+        const r = [], d = x("project", o.code, i.deliverableNamingConvention);
+        return d && r.push(d), o.clientId && !i.teams.some((l) => l.id === o.clientId) && r.push(`teams["${o.clientId}"] not found`), r;
       },
       n
-    ), this.actions = new Ot(n), this.annexes = new _t(n), this.env = new xt(n), this.events = new Pt(n), this.effects = new Bt(n), this.automations = new Mt(n), this.bimUses = new zt(n, () => this.workflows), this.disciplines = new Zt(n), this.guides = new Jt(n), this.lods = new Kt(n), this.lois = new qt(n), this.loin = new Wt(n), this.lbsNodes = new Ht(n), this.assetTypes = new Gt(n), this.extensions = new Xt(n), this.roles = new Vt(n), this.members = new Yt(n), this.milestones = new Qt(n), this.objectives = new es(n), this.phases = new ts(n), this.remoteData = new ss(n), this.resolvers = new ns(n), this.softwares = new is(n, () => this.assetTypes), this.standards = new os(n, () => this._zip), this.teams = new rs(n, () => this.members), this.workflows = new ds(n, () => this.members, () => this.teams), this.deliverables = new Dt(n, () => this.teams, () => this.assetTypes, () => this.lbsNodes, () => this.milestones), this.notes = new Ut(n, () => this.members), this.flags = new Lt(n), this.engine = new Ps(
+    ), this.actions = new Ot(n), this.annexes = new _t(n), this.env = new xt(n), this.events = new Pt(n), this.effects = new Bt(n), this.automations = new Mt(n), this.bimUses = new zt(n, () => this.workflows), this.disciplines = new Zt(n), this.guides = new Jt(n), this.lods = new Kt(n), this.lois = new qt(n), this.loin = new Wt(n), this.lbsNodes = new Ht(n), this.assetTypes = new Xt(n), this.extensions = new Gt(n), this.roles = new Vt(n), this.members = new Yt(n), this.milestones = new Qt(n), this.objectives = new es(n), this.phases = new ts(n), this.remoteData = new ss(n), this.resolvers = new ns(n), this.softwares = new os(n, () => this.assetTypes), this.standards = new is(n, () => this._zip), this.teams = new rs(n, () => this.members), this.workflows = new ds(n, () => this.members, () => this.teams), this.deliverables = new Dt(n, () => this.teams, () => this.assetTypes, () => this.lbsNodes, () => this.milestones), this.notes = new Ut(n, () => this.members), this.flags = new Lt(n), this.engine = new Ps(
       () => this._data,
-      (i) => this.history.get(i)
-    ), this.history = new k(
+      (o) => this.history.get(o)
+    ), this.history = new $(
       n,
-      (i) => {
-        this._data = i;
+      (o) => {
+        this._data = o;
       },
       () => this._zip
     ), this.nomenclature = new Ct(n), this.memory = new q("memory.md", () => this._zip), this.skill = new q("skills/bep-authoring/SKILL.md", () => this._zip), this.icon = new q("icon.svg", () => this._zip);
@@ -3011,10 +3042,10 @@ class D {
    * fully operational after open(). Idempotent — existing files are untouched.
    */
   static async open(e) {
-    const t = await oe.loadAsync(e), n = t.file("bep.json");
+    const t = await re.loadAsync(e), n = t.file("bep.json");
     if (!n) throw new Error("Invalid .bep file: missing bep.json");
-    const i = await n.async("string"), o = B(JSON.parse(i));
-    return await D._initialize(o, t), new D(o, t);
+    const o = await n.async("string"), i = B(JSON.parse(o));
+    return await D._initialize(i, t), new D(i, t);
   }
   /**
    * Ensures all expected files exist in the zip.
@@ -3034,9 +3065,9 @@ class D {
     if (!t.file("baseline/bep.json")) {
       const n = JSON.stringify(e, null, 2);
       t.file("baseline/bep.json", n), t.file("changelog/v0.0.json", n);
-      for (const i of e.standards) {
-        const o = await t.file(i.contentPath).async("string");
-        t.file(`baseline/standards/${i.id}.md`, o), t.file(`changelog/standards/${i.id}/v0.0.md`, o);
+      for (const o of e.standards) {
+        const i = await t.file(o.contentPath).async("string");
+        t.file(`baseline/standards/${o.id}.md`, i), t.file(`changelog/standards/${o.id}/v0.0.md`, i);
       }
     }
   }
@@ -3070,8 +3101,8 @@ class D {
       flags: [],
       env: [],
       automations: []
-    }), n = new oe(), i = JSON.stringify(t, null, 2);
-    return n.file("memory.md", ""), n.file("skills/bep-authoring/SKILL.md", ""), n.file("baseline/bep.json", i), n.file("changelog/v0.0.json", i), new D(t, n);
+    }), n = new re(), o = JSON.stringify(t, null, 2);
+    return n.file("memory.md", ""), n.file("skills/bep-authoring/SKILL.md", ""), n.file("baseline/bep.json", o), n.file("changelog/v0.0.json", o), new D(t, n);
   }
   // ─── Accessors ────────────────────────────────────────────────────────────
   get data() {
@@ -3120,8 +3151,8 @@ ${n.join(`
   /** Returns the names of all resource files for the given skill. */
   listSkillResources(e) {
     const t = `skills/${e}/resources/`, n = [];
-    return this._zip.forEach((i) => {
-      i.startsWith(t) && i !== t && n.push(i.slice(t.length));
+    return this._zip.forEach((o) => {
+      o.startsWith(t) && o !== t && n.push(o.slice(t.length));
     }), n;
   }
   /** Returns the content of a resource file for the given skill, or null if it does not exist. */
@@ -3136,9 +3167,9 @@ ${n.join(`
   /** Removes a skill's SKILL.md and all its resources from the archive. No-op if not found. */
   removeSkill(e) {
     const t = `skills/${e}/`, n = [];
-    this._zip.forEach((i) => {
-      i.startsWith(t) && n.push(i);
-    }), n.forEach((i) => this._zip.remove(i));
+    this._zip.forEach((o) => {
+      o.startsWith(t) && n.push(o);
+    }), n.forEach((o) => this._zip.remove(o));
   }
   /** Removes a single resource file from a skill. No-op if not found. */
   removeSkillResource(e, t) {
@@ -3155,12 +3186,12 @@ ${n.join(`
    * writeFileSync('bep.d.ts', bep.generateRuntimeTypes())
    */
   generateRuntimeTypes() {
-    const e = (f) => f === "url" ? "string" : f, t = (f) => `  /** ${f} */
-`, n = (f) => `{ ${f.map((m) => `${m.key}${m.required ? "" : "?"}: ${e(m.type)}`).join("; ")} }`, i = (f) => !f.payload || f.payload.length === 0 ? "() => void" : `(payload: ${n(f.payload)}) => void`, o = (f) => {
+    const e = (f) => f, t = (f) => `  /** ${f} */
+`, n = (f) => `{ ${f.map((m) => `${m.key}${m.required ? "" : "?"}: ${e(m.type)}`).join("; ")} }`, o = (f) => !f.payload || f.payload.length === 0 ? "() => void" : `(payload: ${n(f.payload)}) => void`, i = (f) => {
       const m = f.payload && f.payload.length > 0 ? `payload: ${n(f.payload)}` : "", p = f.output.length === 0 ? "{ eventId: string }" : `{ eventId: string; ${f.output.map((g) => `${g.key}${g.required ? "" : "?"}: ${e(g.type)}`).join("; ")} }`;
       return `(${m}) => ${p}`;
-    }, r = (f) => f.envKeys.length === 0 ? "(url: string) => unknown" : `(url: string, env: ${`{ ${f.envKeys.map((p) => `${p}: string`).join("; ")} }`}) => unknown`, d = this._data.effects.length ? this._data.effects.map((f) => `${t(f.description)}  '${f.id}': ${i(f)}`).join(`
-`) : "  [key: string]: () => void", l = this._data.automations.length ? this._data.automations.map((f) => `${t(f.description)}  '${f.id}': ${o(f)}`).join(`
+    }, r = (f) => f.envKeys.length === 0 ? "(url: string) => unknown" : `(url: string, env: ${`{ ${f.envKeys.map((p) => `${p}: string`).join("; ")} }`}) => unknown`, d = this._data.effects.length ? this._data.effects.map((f) => `${t(f.description)}  '${f.id}': ${o(f)}`).join(`
+`) : "  [key: string]: () => void", l = this._data.automations.length ? this._data.automations.map((f) => `${t(f.description)}  '${f.id}': ${i(f)}`).join(`
 `) : "  [key: string]: () => { eventId: string }", c = this._data.resolvers.length ? this._data.resolvers.map((f) => `${t(f.description)}  '${f.id}': ${r(f)}`).join(`
 `) : "  [key: string]: (url: string) => unknown", u = this._data.env.length ? this._data.env.map((f) => `${t(f.description)}  ${f.key}: string`).join(`
 `) : "  [key: string]: string";
@@ -3220,10 +3251,10 @@ export {
   Ye as AnnexType,
   _t as Annexes,
   Ie as AssetTypeSchema,
-  Gt as AssetTypes,
+  Xt as AssetTypes,
   Mt as Automations,
   Ls as BEPSchema,
-  re as BEPVersionBase,
+  ae as BEPVersionBase,
   St as BEPVersionSchema,
   Se as BIMUseSchema,
   zt as BIMUses,
@@ -3234,17 +3265,17 @@ export {
   Nt as DeliverableBaseSchema,
   De as DeliverableSchema,
   Dt as Deliverables,
-  we as DisciplineSchema,
+  be as DisciplineSchema,
   Zt as Disciplines,
   ht as EdgeGuardSchema,
   Bt as Effects,
   Ps as Engine,
-  y as Entity,
+  w as Entity,
   xt as Env,
   Le as EnvVarSchema,
   Pt as Events,
   ve as ExtensionSchema,
-  Xt as Extensions,
+  Gt as Extensions,
   Et as FlagBaseSchema,
   st as FlagEntityType,
   Ce as FlagSchema,
@@ -3255,9 +3286,9 @@ export {
   yt as FlowDecisionEdgeSchema,
   ft as FlowDecisionNodeSchema,
   vt as FlowDiagramSchema,
-  bt as FlowDirectEdgeSchema,
+  wt as FlowDirectEdgeSchema,
   et as FlowDirection,
-  wt as FlowEdgeSchema,
+  bt as FlowEdgeSchema,
   Re as FlowEffectSchema,
   ct as FlowEndNodeSchema,
   $e as FlowEventSchema,
@@ -3268,10 +3299,10 @@ export {
   gt as FlowTransitionEdgeSchema,
   _e as GuideSchema,
   Jt as Guides,
-  k as History,
+  $ as History,
   He as ISORole,
   rt as LBSNodeBaseSchema,
-  be as LBSNodeSchema,
+  we as LBSNodeSchema,
   Qe as LBSNodeType,
   Ht as LBSNodes,
   Me as LODSchema,
@@ -3287,8 +3318,8 @@ export {
   ye as MilestoneSchema,
   Qt as Milestones,
   he as NamingConventionSchema,
-  ot as NamingSegmentSchema,
-  it as NamingTokenSchema,
+  it as NamingSegmentSchema,
+  ot as NamingTokenSchema,
   at as NodeTimeoutSchema,
   Ds as NodeType,
   Ct as Nomenclature,
@@ -3308,9 +3339,9 @@ export {
   Js as Runtime,
   jt as Singleton,
   Ee as SoftwareSchema,
-  is as Softwares,
+  os as Softwares,
   Be as StandardSchema,
-  os as Standards,
+  is as Standards,
   nt as TeamBaseSchema,
   pe as TeamSchema,
   rs as Teams,
@@ -3319,13 +3350,13 @@ export {
   ds as Workflows,
   Ns as arrayDefs,
   qe as buildCodeMap,
-  W as buildConsecutivoMap,
+  X as buildConsecutivoMap,
   C as buildParentMap,
   ks as diffBep,
   Ss as diffEntities,
   Zs as flowDiagramToMermaid,
   Ke as getNomenCode,
-  te as getRootIds,
+  se as getRootIds,
   Rt as getTokenPattern,
   zs as groupRaciRows,
   B as normalizeBep,