@milaboratories/pl-middle-layer 1.35.1 → 1.36.0

package/dist/index.mjs

@@ -45,7 +45,7 @@ export * from "@milaboratories/pl-client";
 import { SynchronizedTreeState as es, treeDumpStats as ao, isPlTreeNodeAccessor as co } from "@milaboratories/pl-tree";
 import { Computable as J, ChangeSource as ir, PollComputablePool as lo, WatchableValue as uo } from "@milaboratories/computable";
 import { randomUUID as be, createHash as Ee } from "node:crypto";
-import { PlTemplateV1 as _, PlTemplateOverrideV1 as we, PlTemplateLibV1 as de, PlTemplateSoftwareV1 as oe, parseTemplate as po } from "@milaboratories/pl-model-backend";
+import { PlTemplateV1 as _, PlTemplateOverrideV1 as we, PlTemplateLibV1 as de, PlTemplateSoftwareV1 as ne, parseTemplate as po } from "@milaboratories/pl-model-backend";
 import { LRUCache as ts } from "lru-cache";
 import { Worker as fo } from "node:worker_threads";
 import rs from "denque";
@@ -401,11 +401,11 @@ const fr = {
   }
 }, Ge = {
   updateCacheKey(s, e, t) {
-    e.update(oe.type.name).update(oe.type.version).update(s.name).update(s.version).update(Re(s.name, t, s.sourceHash));
+    e.update(ne.type.name).update(ne.type.version).update(s.name).update(s.version).update(Re(s.name, t, s.sourceHash));
   },
   render(s, e, t, r) {
-    const o = oe.fromV3Data(s, Re(s.name, r, s.sourceHash)), n = e.createStruct(oe.type, o.data);
-    return e.setKValue(n, oe.metaNameKey, JSON.stringify(o.name)), e.lock(n), n;
+    const o = ne.fromV3Data(s, Re(s.name, r, s.sourceHash)), n = e.createStruct(ne.type, o.data);
+    return e.setKValue(n, ne.metaNameKey, JSON.stringify(o.name)), e.lock(n), n;
   }
 }, ds = {
   updateCacheKey(s, e, t) {
@@ -489,11 +489,11 @@ const hr = {
   }
 }, Je = {
   hash(s, e) {
-    e.update(oe.type.name).update(oe.type.version).update(s.name).update(s.version).update(s.src);
+    e.update(ne.type.name).update(ne.type.version).update(s.name).update(s.version).update(s.src);
   },
   render(s, e, t) {
-    const r = oe.fromV2Data(s), o = e.createStruct(oe.type, r.data);
-    return e.setKValue(o, oe.metaNameKey, JSON.stringify(r.name)), e.lock(o), o;
+    const r = ne.fromV2Data(s), o = e.createStruct(ne.type, r.data);
+    return e.setKValue(o, ne.metaNameKey, JSON.stringify(r.name)), e.lock(o), o;
   }
 }, ps = {
   hash(s, e) {
@@ -848,7 +848,7 @@ function Cn(s, e) {
   const t = { upstreams: /* @__PURE__ */ new Set(), missingReferences: !1 };
   return It(t, s, e), t;
 }
-function ne(s) {
+function ee(s) {
   return {
     *[Symbol.iterator]() {
       for (const e of s.groups) for (const t of e.blocks) yield t;
@@ -888,30 +888,42 @@ class ys {
 function Ft(s) {
   const e = /* @__PURE__ */ new Map();
   let t;
-  for (const { id: r } of ne(s)) {
+  for (const { id: r } of ee(s)) {
     const o = {
       id: r,
       missingReferences: !1
     };
-    e.set(r, o), t === void 0 ? o.upstream = /* @__PURE__ */ new Set() : (o.upstream = /* @__PURE__ */ new Set([t.id]), t.downstream = /* @__PURE__ */ new Set([o.id])), t = o;
+    e.set(r, o), t === void 0 ? o.directUpstream = o.upstream = /* @__PURE__ */ new Set() : (o.directUpstream = o.upstream = /* @__PURE__ */ new Set([t.id]), t.directDownstream = t.downstream = /* @__PURE__ */ new Set([o.id])), t = o;
   }
-  return t !== void 0 && (t.downstream = /* @__PURE__ */ new Set()), new ys(e);
+  return t !== void 0 && (t.directDownstream = t.downstream = /* @__PURE__ */ new Set()), new ys(e);
 }
 function Ze(s, e) {
-  const t = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Set();
-  for (const { id: o } of ne(s)) {
-    const n = e(o);
-    if (n === void 0) continue;
-    const i = Cn(n, r), a = {
-      id: o,
-      missingReferences: i.missingReferences,
-      upstream: i.upstreams,
-      downstream: /* @__PURE__ */ new Set()
+  const t = /* @__PURE__ */ new Map(), r = new ys(t), o = /* @__PURE__ */ new Set();
+  for (const { id: n } of ee(s)) {
+    const i = e(n);
+    if (i === void 0) continue;
+    const a = Cn(i, o), c = r.traverseIds("directDownstream", ...a.upstreams), u = /* @__PURE__ */ new Set();
+    for (const { id: d } of ee(s)) {
+      if (d === n) break;
+      if (c.has(d)) {
+        u.add(d);
+        for (const f of r.traverseIdsExcludingRoots("upstream", d))
+          u.delete(f);
+      }
+    }
+    const l = {
+      id: n,
+      missingReferences: a.missingReferences,
+      upstream: u,
+      directUpstream: a.upstreams,
+      downstream: /* @__PURE__ */ new Set(),
+      // will be populated from downstream blocks
+      directDownstream: /* @__PURE__ */ new Set()
       // will be populated from downstream blocks
     };
-    t.set(o, a), i.upstreams.forEach((c) => t.get(c).downstream.add(o)), r.add(o);
+    t.set(n, l), a.upstreams.forEach((d) => t.get(d).directDownstream.add(n)), u.forEach((d) => t.get(d).downstream.add(n)), o.add(n);
   }
-  return new ys(t);
+  return r;
 }
 function kn(s, e) {
   if (s.size !== e.size) return !1;
@@ -1094,7 +1106,7 @@ class st {
     return this.createJsonFieldValueByContent(JSON.stringify(e));
   }
   getBlock(e) {
-    for (const t of ne(this.struct)) if (t.id === e) return t;
+    for (const t of ee(this.struct)) if (t.id === e) return t;
     throw new Error("block not found");
   }
   setBlockFieldObj(e, t, r) {
@@ -1322,7 +1334,7 @@ class st {
             throw new Error("Can't render blocks not including all upstreams.");
       }
     const n = /* @__PURE__ */ new Set();
-    for (const a of ne(this.structure)) {
+    for (const a of ee(this.structure)) {
       if (!r.has(a.id)) continue;
       let c = this.getBlockInfo(a.id).requireProductionRendering || this.blocksInLimbo.has(a.id);
       if (!c) {
@@ -1460,11 +1472,11 @@ class st {
     const M = await ws(), ge = $t(M.hash), L = d.fields.find(
       (p) => p.name === ge
     );
-    let re;
-    L !== void 0 ? re = Et(L.value) : (re = A.wrapInHolder(e, Vt(e, M.spec)), e.createField(
+    let se;
+    L !== void 0 ? se = Et(L.value) : (se = A.wrapInHolder(e, Vt(e, M.spec)), e.createField(
       U(t, $t(M.hash)),
       "Dynamic",
-      re
+      se
     ));
     const ce = { stagingRefreshTimestamp: x }, z = new Set(T), ie = /* @__PURE__ */ new Map();
     for (const p of B) {
@@ -1487,7 +1499,7 @@ class st {
     const D = /* @__PURE__ */ new Map();
     $.forEach(({ id: p, fields: m }) => D.set(p, new yr(p, m)));
     const W = /* @__PURE__ */ new Set();
-    for (const p of ne(g)) {
+    for (const p of ee(g)) {
       if (!D.has(p.id))
         throw new Error(`Inconsistent project structure: no inputs for ${p.id}`);
       W.add(p.id);
@@ -1509,7 +1521,7 @@ class st {
       z,
       D,
       ie,
-      re
+      se
     );
     return v.fixProblemsAndMigrate(), v;
   }
@@ -1902,7 +1914,7 @@ class Ut {
   }
   static create(e, t, r) {
     const o = e.accessor(t).node(), n = j(o.getKeyValueAsJson(he)), a = Ft(n).traverseIds("upstream", r), c = /* @__PURE__ */ new Map();
-    for (const u of ne(n)) {
+    for (const u of ee(n)) {
       if (!a.has(u.id)) continue;
       const l = br(
         o.traverse({
@@ -1954,7 +1966,7 @@ function Gt(s, e) {
     uiState: (n) => n.accessor(s).node().getKeyValueAsString(kt(e)),
     blockMeta: (n) => {
       const i = n.accessor(s).node(), a = j(i.getKeyValueAsJson(he)), c = /* @__PURE__ */ new Map();
-      for (const u of ne(a)) c.set(u.id, u);
+      for (const u of ee(a)) c.set(u.id, u);
       return c;
     }
   };
@@ -3208,7 +3220,7 @@ function Pi(s, e, t) {
       const o = r.accessor(s).node(), n = j(o.getKeyValueAsJson(xt)), i = j(o.getKeyValueAsJson(Be)), a = j(o.getKeyValueAsJson(je)), c = j(o.getKeyValueAsJson(he)), u = j(
         o.getKeyValueAsJson(rt)
       ), l = /* @__PURE__ */ new Map();
-      for (const { id: L } of ne(c)) {
+      for (const { id: L } of ee(c)) {
         const ce = o.traverse({
           field: G(L, "currentArgs"),
           assertFieldType: "Dynamic",
@@ -3241,7 +3253,7 @@ function Pi(s, e, t) {
         }
         l.set(L, { currentArguments: ce, prod: z });
       }
-      const d = Ze(c, (L) => l.get(L).currentArguments), f = new Set(u.blocksInLimbo), h = [...ne(c)].map(({ id: L, label: re, renderingMode: ce }) => {
+      const d = Ze(c, (L) => l.get(L).currentArguments), f = new Set(u.blocksInLimbo), h = [...ee(c)].map(({ id: L, label: se, renderingMode: ce }) => {
         var S, E, O, C, F;
         const z = j(l.get(L)), ie = j(d.nodes.get(L));
         let Y = "NotCalculated";
@@ -3292,8 +3304,8 @@ function Pi(s, e, t) {
         return {
           projectResourceId: Se(s.rid),
           id: L,
-          label: v ?? re,
-          title: v ?? re,
+          label: v ?? se,
+          title: v ?? se,
           renderingMode: ce,
           stale: ((S = z.prod) == null ? void 0 : S.stale) !== !1 || Y === "Limbo",
           missingReference: ie.missingReferences,
@@ -3426,7 +3438,7 @@ function Fi(s, e, t) {
 function Ai(s, e) {
   return J.make((t) => {
     const r = t.accessor(s).node(), o = j(r.getKeyValueAsJson(he)), n = [];
-    for (const { id: i } of ne(o)) {
+    for (const { id: i } of ee(o)) {
       const a = it(r, i);
       if (a === void 0) continue;
       const c = Object.entries(a.cfg.outputs).map(([, l]) => l).filter((l) => Ci(l)).map((l) => l);
@@ -3911,9 +3923,9 @@ var Ts = {
   rcompareIdentifiers: zi
 };
 const We = ct, { MAX_LENGTH: Pr, MAX_SAFE_INTEGER: qe } = at, { safeRe: Or, safeSrc: $r, t: ze } = Ve, Xi = Mt, { compareIdentifiers: me } = Ts;
-let Yi = class se {
+let Yi = class oe {
   constructor(e, t) {
-    if (t = Xi(t), e instanceof se) {
+    if (t = Xi(t), e instanceof oe) {
       if (e.loose === !!t.loose && e.includePrerelease === !!t.includePrerelease)
         return e;
       e = e.version;
@@ -3949,18 +3961,18 @@ let Yi = class se {
     return this.version;
   }
   compare(e) {
-    if (We("SemVer.compare", this.version, this.options, e), !(e instanceof se)) {
+    if (We("SemVer.compare", this.version, this.options, e), !(e instanceof oe)) {
       if (typeof e == "string" && e === this.version)
         return 0;
-      e = new se(e, this.options);
+      e = new oe(e, this.options);
     }
     return e.version === this.version ? 0 : this.compareMain(e) || this.comparePre(e);
   }
   compareMain(e) {
-    return e instanceof se || (e = new se(e, this.options)), me(this.major, e.major) || me(this.minor, e.minor) || me(this.patch, e.patch);
+    return e instanceof oe || (e = new oe(e, this.options)), me(this.major, e.major) || me(this.minor, e.minor) || me(this.patch, e.patch);
   }
   comparePre(e) {
-    if (e instanceof se || (e = new se(e, this.options)), this.prerelease.length && !e.prerelease.length)
+    if (e instanceof oe || (e = new oe(e, this.options)), this.prerelease.length && !e.prerelease.length)
       return -1;
     if (!this.prerelease.length && e.prerelease.length)
       return 1;
@@ -3981,7 +3993,7 @@ let Yi = class se {
     } while (++t);
   }
   compareBuild(e) {
-    e instanceof se || (e = new se(e, this.options));
+    e instanceof oe || (e = new oe(e, this.options));
     let t = 0;
     do {
       const r = this.build[t], o = e.build[t];
@@ -4123,10 +4135,10 @@ const ya = Ce, wa = (s, e) => {
 };
 var Sa = wa;
 const Tr = q, ba = (s, e, t) => new Tr(s, t).compare(new Tr(e, t));
-var ee = ba;
-const Ra = ee, Ea = (s, e, t) => Ra(e, s, t);
+var te = ba;
+const Ra = te, Ea = (s, e, t) => Ra(e, s, t);
 var Ca = Ea;
-const ka = ee, Pa = (s, e) => ka(s, e, !0);
+const ka = te, Pa = (s, e) => ka(s, e, !0);
 var Oa = Pa;
 const Lr = q, $a = (s, e, t) => {
   const r = new Lr(s, t), o = new Lr(e, t);
@@ -4137,17 +4149,17 @@ const Ia = _t, Fa = (s, e) => s.sort((t, r) => Ia(t, r, e));
 var Aa = Fa;
 const Ta = _t, La = (s, e) => s.sort((t, r) => Ta(r, t, e));
 var Da = La;
-const Na = ee, Ba = (s, e, t) => Na(s, e, t) > 0;
+const Na = te, Ba = (s, e, t) => Na(s, e, t) > 0;
 var lt = Ba;
-const ja = ee, xa = (s, e, t) => ja(s, e, t) < 0;
+const ja = te, xa = (s, e, t) => ja(s, e, t) < 0;
 var Kt = xa;
-const Va = ee, Ua = (s, e, t) => Va(s, e, t) === 0;
+const Va = te, Ua = (s, e, t) => Va(s, e, t) === 0;
 var Ls = Ua;
-const Ga = ee, Ja = (s, e, t) => Ga(s, e, t) !== 0;
+const Ga = te, Ja = (s, e, t) => Ga(s, e, t) !== 0;
 var Ds = Ja;
-const Ma = ee, _a = (s, e, t) => Ma(s, e, t) >= 0;
+const Ma = te, _a = (s, e, t) => Ma(s, e, t) >= 0;
 var Ht = _a;
-const Ka = ee, Ha = (s, e, t) => Ka(s, e, t) <= 0;
+const Ka = te, Ha = (s, e, t) => Ka(s, e, t) <= 0;
 var Wt = Ha;
 const Wa = Ls, qa = Ds, za = lt, Xa = Ht, Ya = Kt, Qa = Wt, Za = (s, e, t, r) => {
   switch (e) {
@@ -4220,7 +4232,7 @@ class oc {
   }
 }
 var nc = oc, gt, Dr;
-function te() {
+function re() {
   if (Dr) return gt;
   Dr = 1;
   const s = /\s+/g;
@@ -4324,7 +4336,7 @@ function te() {
       let C;
       return $(b) ? C = "" : $(S) ? C = `>=${b}.0.0 <${+b + 1}.0.0-0` : $(E) ? C = `>=${b}.${S}.0 <${b}.${+S + 1}.0-0` : O ? (i("replaceTilde pr", O), C = `>=${b}.${S}.${E}-${O} <${b}.${+S + 1}.0-0`) : C = `>=${b}.${S}.${E} <${b}.${+S + 1}.0-0`, i("tilde return", C), C;
     });
-  }, L = (v, p) => v.trim().split(/\s+/).map((m) => re(m, p)).join(" "), re = (v, p) => {
+  }, L = (v, p) => v.trim().split(/\s+/).map((m) => se(m, p)).join(" "), se = (v, p) => {
     i("caret", v, p);
     const m = p.loose ? c[u.CARETLOOSE] : c[u.CARET], y = p.includePrerelease ? "-0" : "";
     return v.replace(m, (b, S, E, O, C) => {
@@ -4401,10 +4413,10 @@ function ut() {
     }
   }
   mt = e;
-  const t = Mt, { safeRe: r, t: o } = Ve, n = Ns, i = ct, a = q, c = te();
+  const t = Mt, { safeRe: r, t: o } = Ve, n = Ns, i = ct, a = q, c = re();
   return mt;
 }
-const ic = te(), ac = (s, e, t) => {
+const ic = re(), ac = (s, e, t) => {
   try {
     e = new ic(e, t);
   } catch {
@@ -4413,9 +4425,9 @@ const ic = te(), ac = (s, e, t) => {
   return e.test(s);
 };
 var dt = ac;
-const cc = te(), lc = (s, e) => new cc(s, e).set.map((t) => t.map((r) => r.value).join(" ").trim().split(" "));
+const cc = re(), lc = (s, e) => new cc(s, e).set.map((t) => t.map((r) => r.value).join(" ").trim().split(" "));
 var uc = lc;
-const dc = q, pc = te(), fc = (s, e, t) => {
+const dc = q, pc = re(), fc = (s, e, t) => {
   let r = null, o = null, n = null;
   try {
     n = new pc(e, t);
@@ -4427,7 +4439,7 @@ const dc = q, pc = te(), fc = (s, e, t) => {
   }), r;
 };
 var hc = fc;
-const gc = q, mc = te(), vc = (s, e, t) => {
+const gc = q, mc = re(), vc = (s, e, t) => {
   let r = null, o = null, n = null;
   try {
     n = new mc(e, t);
@@ -4439,7 +4451,7 @@ const gc = q, mc = te(), vc = (s, e, t) => {
   }), r;
 };
 var yc = vc;
-const vt = q, wc = te(), Br = lt, Sc = (s, e) => {
+const vt = q, wc = re(), Br = lt, Sc = (s, e) => {
   s = new wc(s, e);
   let t = new vt("0.0.0");
   if (s.test(t) || (t = new vt("0.0.0-0"), s.test(t)))
@@ -4468,7 +4480,7 @@ const vt = q, wc = te(), Br = lt, Sc = (s, e) => {
   return t && s.test(t) ? t : null;
 };
 var bc = Sc;
-const Rc = te(), Ec = (s, e) => {
+const Rc = re(), Ec = (s, e) => {
   try {
     return new Rc(s, e).range || "*";
   } catch {
@@ -4476,7 +4488,7 @@ const Rc = te(), Ec = (s, e) => {
   }
 };
 var Cc = Ec;
-const kc = q, Bs = ut(), { ANY: Pc } = Bs, Oc = te(), $c = dt, jr = lt, xr = Kt, Ic = Wt, Fc = Ht, Ac = (s, e, t, r) => {
+const kc = q, Bs = ut(), { ANY: Pc } = Bs, Oc = re(), $c = dt, jr = lt, xr = Kt, Ic = Wt, Fc = Ht, Ac = (s, e, t, r) => {
   s = new kc(s, r), e = new Oc(e, r);
   let o, n, i, a, c;
   switch (t) {
@@ -4508,9 +4520,9 @@ const Tc = qt, Lc = (s, e, t) => Tc(s, e, ">", t);
 var Dc = Lc;
 const Nc = qt, Bc = (s, e, t) => Nc(s, e, "<", t);
 var jc = Bc;
-const Vr = te(), xc = (s, e, t) => (s = new Vr(s, t), e = new Vr(e, t), s.intersects(e, t));
+const Vr = re(), xc = (s, e, t) => (s = new Vr(s, t), e = new Vr(e, t), s.intersects(e, t));
 var Vc = xc;
-const Uc = dt, Gc = ee;
+const Uc = dt, Gc = te;
 var Jc = (s, e, t) => {
   const r = [];
   let o = null, n = null;
@@ -4524,7 +4536,7 @@ var Jc = (s, e, t) => {
   const c = a.join(" || "), u = typeof e.raw == "string" ? e.raw : String(e);
   return c.length < u.length ? c : e;
 };
-const Ur = te(), zt = ut(), { ANY: yt } = zt, Pe = dt, Xt = ee, Mc = (s, e, t = {}) => {
+const Ur = re(), zt = ut(), { ANY: yt } = zt, Pe = dt, Xt = te, Mc = (s, e, t = {}) => {
   if (s === e)
     return !0;
   s = new Ur(s, t), e = new Ur(e, t);
@@ -4606,7 +4618,7 @@ const Ur = te(), zt = ut(), { ANY: yt } = zt, Pe = dt, Xt = ee, Mc = (s, e, t =
   return r < 0 ? s : r > 0 || e.operator === "<" && s.operator === "<=" ? e : s;
 };
 var Hc = Mc;
-const wt = Ve, _r = at, Wc = q, Kr = Ts, qc = Ce, zc = ta, Xc = oa, Yc = ia, Qc = ca, Zc = da, el = ha, tl = va, rl = Sa, sl = ee, ol = Ca, nl = Oa, il = _t, al = Aa, cl = Da, ll = lt, ul = Kt, dl = Ls, pl = Ds, fl = Ht, hl = Wt, gl = Ns, ml = sc, vl = ut(), yl = te(), wl = dt, Sl = uc, bl = hc, Rl = yc, El = bc, Cl = Cc, kl = qt, Pl = Dc, Ol = jc, $l = Vc, Il = Jc, Fl = Hc;
+const wt = Ve, _r = at, Wc = q, Kr = Ts, qc = Ce, zc = ta, Xc = oa, Yc = ia, Qc = ca, Zc = da, el = ha, tl = va, rl = Sa, sl = te, ol = Ca, nl = Oa, il = _t, al = Aa, cl = Da, ll = lt, ul = Kt, dl = Ls, pl = Ds, fl = Ht, hl = Wt, gl = Ns, ml = sc, vl = ut(), yl = re(), wl = dt, Sl = uc, bl = hc, Rl = yc, El = bc, Cl = Cc, kl = qt, Pl = Dc, Ol = jc, $l = Vc, Il = Jc, Fl = Hc;
 var Al = {
   parse: qc,
   valid: zc,