@uipath/case-tool 1.205.0-preview.281 → 1.206.0-preview.282

package/dist/{packager-tool-b098y4a2.js → packager-tool-wbksf242.js}

@@ -44,25 +44,25 @@ var x;
 var i;
 var hMap = function(cd, mb, r) {
   var s = cd.length;
-  var i2 = 0;
+  var i = 0;
   var l = new u16(mb);
-  for (;i2 < s; ++i2) {
-    if (cd[i2])
-      ++l[cd[i2] - 1];
+  for (;i < s; ++i) {
+    if (cd[i])
+      ++l[cd[i] - 1];
   }
   var le = new u16(mb);
-  for (i2 = 1;i2 < mb; ++i2) {
-    le[i2] = le[i2 - 1] + l[i2 - 1] << 1;
+  for (i = 1;i < mb; ++i) {
+    le[i] = le[i - 1] + l[i - 1] << 1;
   }
   var co;
   if (r) {
     co = new u16(1 << mb);
     var rvb = 15 - mb;
-    for (i2 = 0;i2 < s; ++i2) {
-      if (cd[i2]) {
-        var sv = i2 << 4 | cd[i2];
-        var r_1 = mb - cd[i2];
-        var v = le[cd[i2] - 1]++ << r_1;
+    for (i = 0;i < s; ++i) {
+      if (cd[i]) {
+        var sv = i << 4 | cd[i];
+        var r_1 = mb - cd[i];
+        var v = le[cd[i] - 1]++ << r_1;
         for (var m = v | (1 << r_1) - 1;v <= m; ++v) {
           co[rev[v] >> rvb] = sv;
         }
@@ -70,9 +70,9 @@ var hMap = function(cd, mb, r) {
     }
   } else {
     co = new u16(s);
-    for (i2 = 0;i2 < s; ++i2) {
-      if (cd[i2]) {
-        co[i2] = rev[le[cd[i2] - 1]++] >> 15 - cd[i2];
+    for (i = 0;i < s; ++i) {
+      if (cd[i]) {
+        co[i] = rev[le[cd[i] - 1]++] >> 15 - cd[i];
       }
     }
   }
@@ -147,9 +147,9 @@ var wbits16 = function(d, p, v) {
 };
 var hTree = function(d, mb) {
   var t = [];
-  for (var i2 = 0;i2 < d.length; ++i2) {
-    if (d[i2])
-      t.push({ s: i2, f: d[i2] });
+  for (var i = 0;i < d.length; ++i) {
+    if (d[i])
+      t.push({ s: i, f: d[i] });
   }
   var s = t.length;
   var t2 = t.slice();
@@ -164,28 +164,28 @@ var hTree = function(d, mb) {
     return a.f - b.f;
   });
   t.push({ s: -1, f: 25001 });
-  var l = t[0], r = t[1], i0 = 0, i1 = 1, i22 = 2;
+  var l = t[0], r = t[1], i0 = 0, i1 = 1, i2 = 2;
   t[0] = { s: -1, f: l.f + r.f, l, r };
   while (i1 != s - 1) {
-    l = t[t[i0].f < t[i22].f ? i0++ : i22++];
-    r = t[i0 != i1 && t[i0].f < t[i22].f ? i0++ : i22++];
+    l = t[t[i0].f < t[i2].f ? i0++ : i2++];
+    r = t[i0 != i1 && t[i0].f < t[i2].f ? i0++ : i2++];
     t[i1++] = { s: -1, f: l.f + r.f, l, r };
   }
   var maxSym = t2[0].s;
-  for (var i2 = 1;i2 < s; ++i2) {
-    if (t2[i2].s > maxSym)
-      maxSym = t2[i2].s;
+  for (var i = 1;i < s; ++i) {
+    if (t2[i].s > maxSym)
+      maxSym = t2[i].s;
   }
   var tr = new u16(maxSym + 1);
   var mbt = ln(t[i1 - 1], tr, 0);
   if (mbt > mb) {
-    var i2 = 0, dt = 0;
+    var i = 0, dt = 0;
     var lft = mbt - mb, cst = 1 << lft;
     t2.sort(function(a, b) {
       return tr[b.s] - tr[a.s] || a.f - b.f;
     });
-    for (;i2 < s; ++i2) {
-      var i2_1 = t2[i2].s;
+    for (;i < s; ++i) {
+      var i2_1 = t2[i].s;
       if (tr[i2_1] > mb) {
         dt += cst - (1 << mbt - tr[i2_1]);
         tr[i2_1] = mb;
@@ -194,14 +194,14 @@ var hTree = function(d, mb) {
     }
     dt >>= lft;
     while (dt > 0) {
-      var i2_2 = t2[i2].s;
+      var i2_2 = t2[i].s;
       if (tr[i2_2] < mb)
         dt -= 1 << mb - tr[i2_2]++ - 1;
       else
-        ++i2;
+        ++i;
     }
-    for (;i2 >= 0 && dt; --i2) {
-      var i2_3 = t2[i2].s;
+    for (;i >= 0 && dt; --i) {
+      var i2_3 = t2[i].s;
       if (tr[i2_3] == mb) {
         --tr[i2_3];
         ++dt;
@@ -223,8 +223,8 @@ var lc = function(c) {
   var w = function(v) {
     cl[cli++] = v;
   };
-  for (var i2 = 1;i2 <= s; ++i2) {
-    if (c[i2] == cln && i2 != s)
+  for (var i = 1;i <= s; ++i) {
+    if (c[i] == cln && i != s)
       ++cls;
     else {
       if (!cln && cls > 2) {
@@ -244,15 +244,15 @@ var lc = function(c) {
       while (cls--)
         w(cln);
       cls = 1;
-      cln = c[i2];
+      cln = c[i];
     }
   }
   return { c: cl.subarray(0, cli), n: s };
 };
 var clen = function(cf, cl) {
   var l = 0;
-  for (var i2 = 0;i2 < cl.length; ++i2)
-    l += cf[i2] * cl[i2];
+  for (var i = 0;i < cl.length; ++i)
+    l += cf[i] * cl[i];
   return l;
 };
 var wfblk = function(out, pos, dat) {
@@ -262,23 +262,23 @@ var wfblk = function(out, pos, dat) {
   out[o + 1] = s >> 8;
   out[o + 2] = out[o] ^ 255;
   out[o + 3] = out[o + 1] ^ 255;
-  for (var i2 = 0;i2 < s; ++i2)
-    out[o + i2 + 4] = dat[i2];
+  for (var i = 0;i < s; ++i)
+    out[o + i + 4] = dat[i];
   return (o + 4 + s) * 8;
 };
 var wblk = function(dat, out, final, syms, lf, df, eb, li, bs, bl, p) {
   wbits(out, p++, final);
   ++lf[256];
-  var _a2 = hTree(lf, 15), dlt = _a2.t, mlb = _a2.l;
-  var _b2 = hTree(df, 15), ddt = _b2.t, mdb = _b2.l;
-  var _c = lc(dlt), lclt = _c.c, nlc = _c.n;
-  var _d = lc(ddt), lcdt = _d.c, ndc = _d.n;
+  var _a = hTree(lf, 15), { t: dlt, l: mlb } = _a;
+  var _b = hTree(df, 15), { t: ddt, l: mdb } = _b;
+  var _c = lc(dlt), { c: lclt, n: nlc } = _c;
+  var _d = lc(ddt), { c: lcdt, n: ndc } = _d;
   var lcfreq = new u16(19);
-  for (var i2 = 0;i2 < lclt.length; ++i2)
-    ++lcfreq[lclt[i2] & 31];
-  for (var i2 = 0;i2 < lcdt.length; ++i2)
-    ++lcfreq[lcdt[i2] & 31];
-  var _e = hTree(lcfreq, 7), lct = _e.t, mlcb = _e.l;
+  for (var i = 0;i < lclt.length; ++i)
+    ++lcfreq[lclt[i] & 31];
+  for (var i = 0;i < lcdt.length; ++i)
+    ++lcfreq[lcdt[i] & 31];
+  var _e = hTree(lcfreq, 7), { t: lct, l: mlcb } = _e;
   var nlcc = 19;
   for (;nlcc > 4 && !lct[clim[nlcc - 1]]; --nlcc)
     ;
@@ -296,24 +296,24 @@ var wblk = function(dat, out, final, syms, lf, df, eb, li, bs, bl, p) {
     wbits(out, p + 5, ndc - 1);
     wbits(out, p + 10, nlcc - 4);
     p += 14;
-    for (var i2 = 0;i2 < nlcc; ++i2)
-      wbits(out, p + 3 * i2, lct[clim[i2]]);
+    for (var i = 0;i < nlcc; ++i)
+      wbits(out, p + 3 * i, lct[clim[i]]);
     p += 3 * nlcc;
     var lcts = [lclt, lcdt];
     for (var it = 0;it < 2; ++it) {
       var clct = lcts[it];
-      for (var i2 = 0;i2 < clct.length; ++i2) {
-        var len = clct[i2] & 31;
+      for (var i = 0;i < clct.length; ++i) {
+        var len = clct[i] & 31;
         wbits(out, p, llm[len]), p += lct[len];
         if (len > 15)
-          wbits(out, p, clct[i2] >> 5 & 127), p += clct[i2] >> 12;
+          wbits(out, p, clct[i] >> 5 & 127), p += clct[i] >> 12;
       }
     }
   } else {
     lm = flm, ll = flt, dm = fdm, dl = fdt;
   }
-  for (var i2 = 0;i2 < li; ++i2) {
-    var sym = syms[i2];
+  for (var i = 0;i < li; ++i) {
+    var sym = syms[i];
     if (sym > 255) {
       var len = sym >> 18 & 31;
       wbits16(out, p, lm[len + 257]), p += ll[len + 257];
@@ -346,36 +346,36 @@ var dflt = function(dat, lvl, plvl, pre, post, st) {
     var msk_1 = (1 << plvl) - 1;
     var prev = st.p || new u16(32768), head = st.h || new u16(msk_1 + 1);
     var bs1_1 = Math.ceil(plvl / 3), bs2_1 = 2 * bs1_1;
-    var hsh = function(i3) {
-      return (dat[i3] ^ dat[i3 + 1] << bs1_1 ^ dat[i3 + 2] << bs2_1) & msk_1;
+    var hsh = function(i) {
+      return (dat[i] ^ dat[i + 1] << bs1_1 ^ dat[i + 2] << bs2_1) & msk_1;
     };
     var syms = new i32(25000);
     var lf = new u16(288), df = new u16(32);
-    var lc_1 = 0, eb = 0, i2 = st.i || 0, li = 0, wi = st.w || 0, bs = 0;
-    for (;i2 + 2 < s; ++i2) {
-      var hv = hsh(i2);
-      var imod = i2 & 32767, pimod = head[hv];
+    var lc_1 = 0, eb = 0, i = st.i || 0, li = 0, wi = st.w || 0, bs = 0;
+    for (;i + 2 < s; ++i) {
+      var hv = hsh(i);
+      var imod = i & 32767, pimod = head[hv];
       prev[imod] = pimod;
       head[hv] = imod;
-      if (wi <= i2) {
-        var rem = s - i2;
+      if (wi <= i) {
+        var rem = s - i;
         if ((lc_1 > 7000 || li > 24576) && (rem > 423 || !lst)) {
-          pos = wblk(dat, w, 0, syms, lf, df, eb, li, bs, i2 - bs, pos);
-          li = lc_1 = eb = 0, bs = i2;
+          pos = wblk(dat, w, 0, syms, lf, df, eb, li, bs, i - bs, pos);
+          li = lc_1 = eb = 0, bs = i;
           for (var j = 0;j < 286; ++j)
             lf[j] = 0;
           for (var j = 0;j < 30; ++j)
             df[j] = 0;
         }
         var l = 2, d = 0, ch_1 = c, dif = imod - pimod & 32767;
-        if (rem > 2 && hv == hsh(i2 - dif)) {
+        if (rem > 2 && hv == hsh(i - dif)) {
           var maxn = Math.min(n, rem) - 1;
-          var maxd = Math.min(32767, i2);
+          var maxd = Math.min(32767, i);
           var ml = Math.min(258, rem);
           while (dif <= maxd && --ch_1 && imod != pimod) {
-            if (dat[i2 + l] == dat[i2 + l - dif]) {
+            if (dat[i + l] == dat[i + l - dif]) {
               var nl = 0;
-              for (;nl < ml && dat[i2 + nl] == dat[i2 + nl - dif]; ++nl)
+              for (;nl < ml && dat[i + nl] == dat[i + nl - dif]; ++nl)
                 ;
               if (nl > l) {
                 l = nl, d = dif;
@@ -384,7 +384,7 @@ var dflt = function(dat, lvl, plvl, pre, post, st) {
                 var mmd = Math.min(dif, nl - 2);
                 var md = 0;
                 for (var j = 0;j < mmd; ++j) {
-                  var ti = i2 - dif + j & 32767;
+                  var ti = i - dif + j & 32767;
                   var pti = prev[ti];
                   var cd = ti - pti & 32767;
                   if (cd > md)
@@ -402,32 +402,32 @@ var dflt = function(dat, lvl, plvl, pre, post, st) {
           eb += fleb[lin] + fdeb[din];
           ++lf[257 + lin];
           ++df[din];
-          wi = i2 + l;
+          wi = i + l;
           ++lc_1;
         } else {
-          syms[li++] = dat[i2];
-          ++lf[dat[i2]];
+          syms[li++] = dat[i];
+          ++lf[dat[i]];
         }
       }
     }
-    for (i2 = Math.max(i2, wi);i2 < s; ++i2) {
-      syms[li++] = dat[i2];
-      ++lf[dat[i2]];
+    for (i = Math.max(i, wi);i < s; ++i) {
+      syms[li++] = dat[i];
+      ++lf[dat[i]];
     }
-    pos = wblk(dat, w, lst, syms, lf, df, eb, li, bs, i2 - bs, pos);
+    pos = wblk(dat, w, lst, syms, lf, df, eb, li, bs, i - bs, pos);
     if (!lst) {
       st.r = pos & 7 | w[pos / 8 | 0] << 3;
       pos -= 7;
-      st.h = head, st.p = prev, st.i = i2, st.w = wi;
+      st.h = head, st.p = prev, st.i = i, st.w = wi;
     }
   } else {
-    for (var i2 = st.w || 0;i2 < s + lst; i2 += 65535) {
-      var e = i2 + 65535;
+    for (var i = st.w || 0;i < s + lst; i += 65535) {
+      var e = i + 65535;
       if (e >= s) {
         w[pos / 8 | 0] = lst;
         e = s;
       }
-      pos = wfblk(w, pos + 1, dat.subarray(i2, e));
+      pos = wfblk(w, pos + 1, dat.subarray(i, e));
     }
     st.i = s;
   }
@@ -435,11 +435,11 @@ var dflt = function(dat, lvl, plvl, pre, post, st) {
 };
 var crct = /* @__PURE__ */ function() {
   var t = new Int32Array(256);
-  for (var i2 = 0;i2 < 256; ++i2) {
-    var c = i2, k = 9;
+  for (var i = 0;i < 256; ++i) {
+    var c = i, k = 9;
     while (--k)
       c = (c & 1 && -306674912) ^ c >>> 1;
-    t[i2] = c;
+    t[i] = c;
   }
   return t;
 }();
@@ -448,8 +448,8 @@ var crc = function() {
   return {
     p: function(d) {
       var cr = c;
-      for (var i2 = 0;i2 < d.length; ++i2)
-        cr = crct[cr & 255 ^ d[i2]] ^ cr >>> 8;
+      for (var i = 0;i < d.length; ++i)
+        cr = crct[cr & 255 ^ d[i]] ^ cr >>> 8;
       c = cr;
     },
     d: function() {
@@ -509,8 +509,8 @@ try {
 function strToU8(str, latin1) {
   if (latin1) {
     var ar_1 = new u8(str.length);
-    for (var i2 = 0;i2 < str.length; ++i2)
-      ar_1[i2] = str.charCodeAt(i2);
+    for (var i = 0;i < str.length; ++i)
+      ar_1[i] = str.charCodeAt(i);
     return ar_1;
   }
   if (te)
@@ -521,19 +521,19 @@ function strToU8(str, latin1) {
   var w = function(v) {
     ar[ai++] = v;
   };
-  for (var i2 = 0;i2 < l; ++i2) {
+  for (var i = 0;i < l; ++i) {
     if (ai + 5 > ar.length) {
-      var n = new u8(ai + 8 + (l - i2 << 1));
+      var n = new u8(ai + 8 + (l - i << 1));
       n.set(ar);
       ar = n;
     }
-    var c = str.charCodeAt(i2);
+    var c = str.charCodeAt(i);
     if (c < 128 || latin1)
       w(c);
     else if (c < 2048)
       w(192 | c >> 6), w(128 | c & 63);
     else if (c > 55295 && c < 57344)
-      c = 65536 + (c & 1023 << 10) | str.charCodeAt(++i2) & 1023, w(240 | c >> 18), w(128 | c >> 12 & 63), w(128 | c >> 6 & 63), w(128 | c & 63);
+      c = 65536 + (c & 1023 << 10) | str.charCodeAt(++i) & 1023, w(240 | c >> 18), w(128 | c >> 12 & 63), w(128 | c >> 6 & 63), w(128 | c & 63);
     else
       w(224 | c >> 12), w(128 | c >> 6 & 63), w(128 | c & 63);
   }
@@ -552,7 +552,7 @@ var exfl = function(ex) {
   return le;
 };
 var wzh = function(d, b, f, fn, u, c, ce, co) {
-  var fl2 = fn.length, ex = f.extra, col = co && co.length;
+  var fl = fn.length, ex = f.extra, col = co && co.length;
   var exl = exfl(ex);
   wbytes(d, b, ce != null ? 33639248 : 67324752), b += 4;
   if (ce != null)
@@ -569,7 +569,7 @@ var wzh = function(d, b, f, fn, u, c, ce, co) {
     wbytes(d, b + 4, c < 0 ? -c - 2 : c);
     wbytes(d, b + 8, f.size);
   }
-  wbytes(d, b + 12, fl2);
+  wbytes(d, b + 12, fl);
   wbytes(d, b + 14, exl), b += 16;
   if (ce != null) {
     wbytes(d, b, col);
@@ -577,7 +577,7 @@ var wzh = function(d, b, f, fn, u, c, ce, co) {
     wbytes(d, b + 10, ce), b += 14;
   }
   d.set(fn, b);
-  b += fl2;
+  b += fl;
   if (exl) {
     for (var k in ex) {
       var exf = ex[k], l = exf.length;
@@ -606,7 +606,7 @@ function zipSync(data, opts) {
   var o = 0;
   var tot = 0;
   for (var fn in r) {
-    var _a2 = r[fn], file = _a2[0], p = _a2[1];
+    var _a = r[fn], file = _a[0], p = _a[1];
     var compression = p.level == 0 ? 0 : 8;
     var f = strToU8(fn), s = f.length;
     var com = p.comment, m = com && strToU8(com), ms = m && m.length;
@@ -630,8 +630,8 @@ function zipSync(data, opts) {
     tot += 76 + 2 * (s + exl) + (ms || 0) + l;
   }
   var out = new u8(tot + 22), oe = o, cdl = tot - o;
-  for (var i2 = 0;i2 < files.length; ++i2) {
-    var f = files[i2];
+  for (var i = 0;i < files.length; ++i) {
+    var f = files[i];
     wzh(out, f.o, f, f.f, f.u, f.c.length);
     var badd = 30 + f.f.length + exfl(f.extra);
     out.set(f.c, f.o + badd);
@@ -643,4 +643,4 @@ function zipSync(data, opts) {
 
 export { zipSync };
 
-//# debugId=9B62AE9587D4B1F764756E2164756E21
+//# debugId=C706B64834B0ECBE64756E2164756E21

package/dist/{packager-tool-2sn7d8fd.js → packager-tool-x74mmjkw.js}

@@ -1,23 +1,19 @@
-import {
-  __require
-} from "./packager-tool-1yh8g550.js";
-
 // src/services/trigger-entry-point-id.ts
 var CURRENT_TRIGGER = "uipath.case.trigger";
 var asRow = (value) => typeof value === "object" && value !== null && !Array.isArray(value) ? value : undefined;
-var currentTriggers = (plan) => {
+var currentTriggers2 = (plan) => {
   const nodes = asRow(plan)?.nodes;
   if (!Array.isArray(nodes))
     return [];
   return nodes.map(asRow).filter((node) => node !== undefined && node.type === CURRENT_TRIGGER && typeof node.id === "string");
 };
-var entryPointIdOf = (node) => {
+var entryPointIdOf2 = (node) => {
   const value = asRow(asRow(node.data)?.inputs)?.entryPointId;
   return typeof value === "string" && value !== "" ? value : undefined;
 };
-var stampEntryPointIds = (plan, ids) => {
+var stampEntryPointIds2 = (plan, ids) => {
   let written = 0;
-  for (const node of currentTriggers(plan)) {
+  for (const node of currentTriggers2(plan)) {
     const id = ids.get(node.id);
     if (id === undefined)
       continue;
@@ -28,14 +24,14 @@ var stampEntryPointIds = (plan, ids) => {
   }
   return written;
 };
-var stampFromEntryPointsBeside = async (plan, out) => {
-  const { readEntryPointIds } = await import("./case-event-trigger-bindings-g9ftnm4x.js");
+var stampFromEntryPointsBeside2 = async (plan, out) => {
+  const { readEntryPointIds } = await import("./case-event-trigger-bindings-qbs8ywf5.js");
   const read = await readEntryPointIds(out);
   if ("error" in read)
     return { error: read.error };
-  return { written: stampEntryPointIds(plan, read.ids) };
+  return { written: stampEntryPointIds2(plan, read.ids) };
 };
 
-export { currentTriggers, entryPointIdOf, stampEntryPointIds, stampFromEntryPointsBeside };
+export { currentTriggers2, entryPointIdOf2, stampEntryPointIds2, stampFromEntryPointsBeside2 };
 
-//# debugId=1BC8BEF53D4171A164756E2164756E21
+//# debugId=A1B9444C8071B39D64756E2164756E21

package/dist/{packager-tool-7hw344bt.js → packager-tool-xb16e3tz.js}

@@ -1,5 +1,5 @@
 // ../maestro-sdk/src/registry/filter-engine.ts
-function filterNodes(nodes, parsedFilters) {
+function filterNodes2(nodes, parsedFilters) {
   if (!parsedFilters.filters || parsedFilters.filters.length === 0) {
     return nodes;
   }
@@ -70,10 +70,10 @@ function getFieldValue(node, field) {
       return node[field];
   }
 }
-function searchWithFilters(nodes, keyword, filters) {
+function searchWithFilters2(nodes, keyword, filters) {
   let results = nodes;
   if (filters && filters.filters.length > 0) {
-    results = filterNodes(results, filters);
+    results = filterNodes2(results, filters);
   }
   if (keyword && keyword.trim() !== "") {
     const lowerKeyword = keyword.toLowerCase();
@@ -102,6 +102,6 @@ function searchWithFilters(nodes, keyword, filters) {
   return results;
 }
 
-export { filterNodes, searchWithFilters };
+export { filterNodes2, searchWithFilters2 };
 
-//# debugId=625152056CCA62E564756E2164756E21
+//# debugId=A8C2AA775C3F632764756E2164756E21

package/dist/{packager-tool-a17g0pj1.js → packager-tool-xd1wbvay.js}

@@ -1,6 +1,6 @@
 import {
-  CONNECTOR_TASK_TYPES
-} from "./packager-tool-93mdeqay.js";
+  CONNECTOR_CALL_TASK_TYPES
+} from "./packager-tool-7x1tmb8a.js";
 
 // src/services/connector-task-shape.ts
 var DESIGNER_CONTEXT_ORDER = [
@@ -12,11 +12,13 @@ var DESIGNER_CONTEXT_ORDER = [
   "path",
   "objectName",
   "operation",
+  "eventMode",
+  "executionType",
   "metadata"
 ];
 var asRows = (value) => Array.isArray(value) ? value.filter((one) => typeof one === "object" && one !== null) : [];
-var designerConnectorShape = (task) => {
-  if (!CONNECTOR_TASK_TYPES.has(String(task.type ?? "")))
+var designerConnectorShape2 = (task) => {
+  if (typeof task.type !== "string" || !CONNECTOR_CALL_TASK_TYPES.has(task.type))
     return;
   const data = task.data;
   if (typeof data !== "object" || data === null)
@@ -40,7 +42,7 @@ var designerConnectorShape = (task) => {
   if (body.bindings === undefined)
     body.bindings = [];
 };
-var designerShapeConnectorTasks = (plan, only = () => true) => {
+var designerShapeConnectorTasks2 = (plan, only = () => true) => {
   for (const node of asRows(plan.nodes)) {
     const data = node.data;
     if (typeof data !== "object" || data === null)
@@ -51,12 +53,12 @@ var designerShapeConnectorTasks = (plan, only = () => true) => {
     for (const lane of lanes) {
       for (const task of asRows(lane)) {
         if (only(task))
-          designerConnectorShape(task);
+          designerConnectorShape2(task);
       }
     }
   }
 };
 
-export { DESIGNER_CONTEXT_ORDER, designerConnectorShape, designerShapeConnectorTasks };
+export { designerConnectorShape2, designerShapeConnectorTasks2 };
 
-//# debugId=FBEE1D86BF4F9C0364756E2164756E21
+//# debugId=F2E2B9A7331C95A064756E2164756E21

package/dist/{packager-tool-1yfw674x.js → packager-tool-xehhk3c3.js}

@@ -35,7 +35,7 @@ var canonicalEntry = (value) => {
 var canonicalList = (value) => Array.isArray(value) ? value.map(canonicalEntry) : [];
 var pick = (shape, lower, upper) => shape[lower] ?? shape[upper];
 var hasShapeArrays = (value) => Array.isArray(pick(value, "context", "Context")) || Array.isArray(pick(value, "inputs", "Inputs")) || Array.isArray(pick(value, "outputs", "Outputs"));
-var readCaseShape = (document) => {
+var readCaseShape2 = (document) => {
   const data = asRecord(document.Data) ?? asRecord(document.data);
   const candidates = [
     asRecord(data?.CaseShape),
@@ -53,13 +53,13 @@ var readCaseShape = (document) => {
     outputs: canonicalList(pick(shape, "outputs", "Outputs"))
   };
 };
-var readSpecFolderKey = (document) => {
+var readSpecFolderKey2 = (document) => {
   const data = asRecord(document.Data) ?? asRecord(document.data);
   const connection = asRecord(data?.Connection) ?? asRecord(data?.connection);
   const key = connection?.FolderKey ?? connection?.folderKey;
   return typeof key === "string" && key !== "" ? key : undefined;
 };
-var readIoRows = (document) => {
+var readIoRows2 = (document) => {
   const data = asRecord(document.Data) ?? asRecord(document.data) ?? document;
   const inputs = pick(data, "inputs", "Inputs");
   const outputs = pick(data, "outputs", "Outputs");
@@ -72,7 +72,12 @@ var readIoRows = (document) => {
     ...typeof version === "string" && { version }
   };
 };
+var readResourceBindings2 = (document) => {
+  const data = asRecord(document.Data) ?? asRecord(document.data);
+  const value = data?.ResourceBindings ?? data?.resourceBindings ?? document.ResourceBindings ?? document.resourceBindings;
+  return Array.isArray(value) ? value.filter((entry) => asRecord(entry) !== undefined && Array.isArray(entry.rows)) : [];
+};
 
-export { readCaseShape, readSpecFolderKey, readIoRows };
+export { readCaseShape2, readSpecFolderKey2, readIoRows2, readResourceBindings2 };
 
-//# debugId=F25BE2C9DB54B39864756E2164756E21
+//# debugId=C8E5D15F6C1D1ECF64756E2164756E21