@uipath/maestro-tool 1.204.0 → 1.205.0-preview.258

package/README.md

@@ -26,9 +26,9 @@ version: that copy runs, and the global one is the fallback.
 | `tidy <input>` | bpmn | Add diagram layout to a compiled `.bpmn` |
 
 ```bash
-uip maestro flow compile Order.flow.ts --output Order.flow
+uip maestro flow compile Order.flow.ts --output-file Order.flow
 uip maestro case check Claims.case.ts --source
-uip maestro bpmn tidy Approval.bpmn --output Approval.tidied.bpmn
+uip maestro bpmn tidy Approval.bpmn --output-file Approval.tidied.bpmn
 ```
 
 Each command's `--help` lists its options and a runnable example.
@@ -130,7 +130,7 @@ Browse, search, and inspect the Maestro BPMN extension registry.
 uip maestro bpmn registry pull
 uip maestro bpmn registry list
 uip maestro bpmn registry search <keyword>
-uip maestro bpmn registry get <extensionType>
+uip maestro bpmn registry get <extension-type>
 ```
 
 ### `maestro bpmn process`

package/dist/{DmnFactory-VWZOSZHH-ggnfcqpa.js → DmnFactory-L7MABUC6-qkvfv1cw.js}

@@ -3844,149 +3844,194 @@ var parser = LRParser.deserialize({
   tokenPrec: 2660
 });
 
-// ../../node_modules/@uipath/dmn-editor-utils/dist/chunks/chunk-FF6TTFJN.js
-var m = parser.configure({ top: "UnaryTests" });
-var f = (e2) => e2.parent?.name === "FunctionInvocation" && e2.parent.firstChild?.from === e2.from;
-var F = (e2, t2, o) => {
-  for (let i = e2.parent;i; i = i.parent)
-    if (!(i.name !== "ForExpression" && i.name !== "QuantifiedExpression"))
-      for (let n = i.getChild("InExpressions")?.firstChild;n; n = n.nextSibling) {
-        let r = n.getChild("Name");
-        if (r && e2.from >= n.to && o.slice(r.from, r.to) === t2)
+// ../../node_modules/@uipath/dmn-editor-utils/dist/chunks/chunk-EXAD3CI5.js
+var R = parser.configure({ top: "UnaryTests" });
+var c = (e2, t2) => (t2 === "unaryTests" ? R : parser).parse(e2);
+var I = new Set(["StringLiteral", "NumericLiteral", "BooleanLiteral", "DateTimeLiteral", "null"]);
+var g = (e2) => e2.parent?.name === "FunctionInvocation" && e2.parent.firstChild?.from === e2.from;
+var P = (e2, t2, i) => {
+  for (let r = e2.parent;r; r = r.parent)
+    if (!(r.name !== "ForExpression" && r.name !== "QuantifiedExpression"))
+      for (let n = r.getChild("InExpressions")?.firstChild;n; n = n.nextSibling) {
+        let s = n.getChild("Name");
+        if (s && e2.from >= n.to && i.slice(s.from, s.to) === t2)
           return true;
       }
   return false;
 };
-var h = (e2, t2, o) => {
-  for (let i = e2.parent;i; i = i.parent)
-    if (i.name === "FunctionDefinition")
-      for (let n = i.getChild("FormalParameters")?.firstChild;n; n = n.nextSibling) {
-        let r = n.getChild("ParameterName")?.getChild("Name");
-        if (r && o.slice(r.from, r.to) === t2)
+var C = (e2, t2, i) => {
+  for (let r = e2.parent;r; r = r.parent)
+    if (r.name === "FunctionDefinition")
+      for (let n = r.getChild("FormalParameters")?.firstChild;n; n = n.nextSibling) {
+        let s = n.getChild("ParameterName")?.getChild("Name");
+        if (s && i.slice(s.from, s.to) === t2)
           return true;
       }
   return false;
 };
-var E = (e2, t2, o) => {
-  for (let i = e2.parent;i; i = i.parent)
-    if (i.name === "Context")
-      for (let n = i.firstChild;n; n = n.nextSibling) {
+var _ = (e2, t2, i) => {
+  for (let r = e2.parent;r; r = r.parent)
+    if (r.name === "Context")
+      for (let n = r.firstChild;n; n = n.nextSibling) {
         if (n.name !== "ContextEntry" || n.to > e2.from)
           continue;
-        let r = n.getChild("Key")?.getChild("Name");
-        if (r && o.slice(r.from, r.to) === t2)
+        let s = n.getChild("Key")?.getChild("Name");
+        if (s && i.slice(s.from, s.to) === t2)
           return true;
       }
   return false;
 };
-var D = (e2, t2, o) => F(e2, t2, o) || h(e2, t2, o) || E(e2, t2, o);
-var d = (e2) => {
+var M = (e2, t2, i) => P(e2, t2, i) || C(e2, t2, i) || _(e2, t2, i);
+var A = (e2) => {
   for (let t2 = e2.parent;t2; t2 = t2.parent)
     if (t2.name === "FilterExpression" && t2.firstChild && e2.from >= t2.firstChild.to)
       return true;
   return false;
 };
-var c = (e2, t2, o) => {
-  (t2 === "unaryTests" ? m : parser).parse(e2).iterate({ enter(n) {
+var u = (e2, t2, i) => {
+  c(e2, t2).iterate({ enter(n) {
     if (n.name !== "VariableName")
       return;
-    let r = n.node, a = e2.slice(r.from, r.to);
-    f(r) || D(r, a, e2) || o(r, a);
+    let s = n.node, o = e2.slice(s.from, s.to);
+    g(s) || M(s, o, e2) || i(s, o);
   } });
 };
-var p = (e2, t2, o, i) => {
+var T = (e2, t2, i) => {
   if (!e2 || !e2.includes(t2))
     return [];
-  let n = [];
-  return c(e2, o, (r, a) => {
-    a === t2 && !(i && d(r)) && n.push({ from: r.from, to: r.to });
-  }), n;
+  let r = [];
+  return u(e2, i, (n, s) => {
+    s === t2 && r.push({ from: n.from, to: n.to });
+  }), r;
 };
-var b = (e2, t2, o = {}) => {
+var b = (e2, t2) => {
   if (!e2.trim())
     return [];
   let i = [];
-  return c(e2, t2, (n, r) => {
-    (o.includeFilterPredicateMembers || !d(n)) && i.push({ name: r, from: n.from, to: n.to });
+  return u(e2, t2, (r, n) => {
+    i.push({ name: n, path: D(r, e2, true), segments: F(r, e2, false), from: r.from, to: r.to, inFilterPredicate: A(r) });
   }), i;
 };
-var x = (e2) => {
+var F = (e2, t2, i) => {
+  let r = [{ name: t2.slice(e2.from, e2.to), from: e2.from, to: e2.to }], n = e2, s = n.parent;
+  for (;s && (s.name === "PathExpression" || i && s.name === "FilterExpression") && s.from === n.from; ) {
+    let o = s.name === "PathExpression" ? s.getChild("PathName") : null;
+    o && r.push({ name: t2.slice(o.from, o.to), from: o.from, to: o.to }), n = s, s = n.parent;
+  }
+  return r;
+};
+var D = (e2, t2, i) => F(e2, t2, i).map((r) => r.name).join(".");
+var h = (e2) => {
   let t2 = e2.trim();
   if (!t2)
     return false;
-  let o = p(t2, t2, "expression", false);
-  return o.length === 1 && o[0].from === 0 && o[0].to === t2.length;
+  let i = T(t2, t2, "expression");
+  return i.length === 1 && i[0].from === 0 && i[0].to === t2.length;
 };
-var s = (e2) => `${e2}_${v4_default()}`;
-var C = "Annotation";
-var _ = "Decision";
-var M = "decision1";
-var A = "UiPath Maestro";
-var O = () => ({ id: s("definitions"), namespace: `http://uipath.com/dmn/${s("ns")}`, exporter: A });
-var S = "null";
-var re = (e2) => {
+var a = (e2) => `${e2}_${v4_default()}`;
+var v = { all: new Set, outsideFilterPredicates: new Set, paths: new Set };
+var B = new WeakMap;
+var U = { expression: new WeakMap, unaryTests: new WeakMap };
+var l = (e2, t2, i = B) => {
+  let r = i.get(e2);
+  if (r)
+    return r;
+  let n = t2(e2);
+  return i.set(e2, n), n;
+};
+var p = (e2, t2) => {
+  let i = e2?.trim();
+  if (!i || t2 === "unaryTests" && i === "-")
+    return v;
+  let r = b(i, t2);
+  return { all: new Set(r.map((n) => n.name)), outsideFilterPredicates: new Set(r.filter((n) => !n.inFilterPredicate).map((n) => n.name)), paths: new Set(r.map((n) => n.path)) };
+};
+var m = (e2) => {
+  let t2 = new Set, i = new Set, r = new Set;
+  for (let n of e2) {
+    for (let s of n.paths)
+      r.add(s);
+    for (let s of n.all)
+      t2.add(s);
+    for (let s of n.outsideFilterPredicates)
+      i.add(s);
+  }
+  return { all: t2, outsideFilterPredicates: i, paths: r };
+};
+var N = (e2, t2) => l(e2, () => p(e2.text, t2), U[t2]);
+var V = (e2) => l(e2, () => m([p(e2.expressionText, "expression"), p(e2.allowedValues?.text, "unaryTests")]));
+var k = (e2) => l(e2, () => p(e2.allowedValues?.text, "unaryTests"));
+var q = (e2) => l(e2, () => m([...e2.inputEntries.map((t2) => N(t2, "unaryTests")), ...e2.outputEntries.map((t2) => N(t2, "expression"))]));
+var $ = (e2) => l(e2, () => m(e2.map(q)));
+var S = (e2) => l(e2, () => m([...e2.inputs.map(V), ...e2.outputs.map(k), $(e2.rules)]));
+var E = (e2) => S(e2).all;
+var j = "Annotation";
+var W = "Decision";
+var H = "decision1";
+var z = "UiPath Maestro";
+var K = () => ({ id: a("definitions"), namespace: `http://uipath.com/dmn/${a("ns")}`, exporter: z });
+var X = "null";
+var Re = (e2) => {
   let t2 = (e2 ?? "").trim();
-  return t2 === "" || t2 === S;
+  return t2 === "" || t2 === X;
 };
-var P = (e2) => ({ ...O(), name: e2, decision: { id: s("decision"), name: M, label: _, variableId: s("variable"), variableTypeRef: "string", decisionTable: { id: s("decisionTable"), hitPolicy: e.First, inputs: [{ id: s("input"), label: "Input 1", expressionId: s("inputExpression"), expressionText: "", typeRef: "string" }], outputs: [V()], annotations: [{ name: C }], rules: [{ id: s("rule"), inputEntries: [{ id: s("inputEntry"), text: "-" }], outputEntries: [{ id: s("outputEntry"), text: "" }], annotationEntries: [""] }] } }, inputData: [] });
-var T = "input1";
-var ie = (e2) => {
-  let t2 = P(e2), [o] = t2.decision.decisionTable.inputs;
-  return q({ ...t2, inputData: [{ id: s("inputData"), variableId: s("variable"), name: T, typeRef: o.typeRef }], decision: { ...t2.decision, decisionTable: { ...t2.decision.decisionTable, inputs: [{ ...o, expressionText: T }] } } });
+var Y = (e2) => ({ ...K(), name: e2, decision: { id: a("decision"), name: H, label: W, variableId: a("variable"), variableTypeRef: "string", decisionTable: { id: a("decisionTable"), hitPolicy: e.First, inputs: [{ id: a("input"), label: "Input 1", expressionId: a("inputExpression"), expressionText: "", typeRef: "string" }], outputs: [ie()], annotations: [{ name: j }], rules: [{ id: a("rule"), inputEntries: [{ id: a("inputEntry"), text: "-" }], outputEntries: [{ id: a("outputEntry"), text: "" }], annotationEntries: [""] }] } }, inputData: [] });
+var y = "input1";
+var Ie = (e2) => {
+  let t2 = Y(e2), [i] = t2.decision.decisionTable.inputs;
+  return re({ ...t2, inputData: [{ id: a("inputData"), variableId: a("variable"), name: y, typeRef: i.typeRef }], decision: { ...t2.decision, decisionTable: { ...t2.decision.decisionTable, inputs: [{ ...i, expressionText: y }] } } });
 };
-var oe = /[\p{L}\p{N}_]/u;
-var L = /^[\p{L}_][\p{L}\p{N}_]*(\s*\.\s*[\p{L}_][\p{L}\p{N}_]*)*$/u;
-var v = /^[\p{L}_][\p{L}\p{N}_]*$/u;
-var w = (e2) => v.test(e2.trim()) && x(e2);
-var U = (e2, t2) => {
-  let o = `output${t2 + 1}`, i = (e2 ?? "").replace(/[^\p{L}\p{N}_]+(.)?/gu, (r, a) => a ? a.toUpperCase() : "");
-  if (!/^[\p{L}_]/u.test(i))
-    return o;
-  let n = i.charAt(0).toLowerCase() + i.slice(1);
-  return w(n) ? n : o;
+var Pe = /[\p{L}\p{N}_]/u;
+var Q = /^[\p{L}_][\p{L}\p{N}_]*(\s*\.\s*[\p{L}_][\p{L}\p{N}_]*)*$/u;
+var G = /^[\p{L}_][\p{L}\p{N}_]*$/u;
+var J = (e2) => G.test(e2.trim()) && h(e2);
+var Z = (e2, t2) => {
+  let i = `output${t2 + 1}`, r = (e2 ?? "").replace(/[^\p{L}\p{N}_]+(.)?/gu, (s, o) => o ? o.toUpperCase() : "");
+  if (!/^[\p{L}_]/u.test(r))
+    return i;
+  let n = r.charAt(0).toLowerCase() + r.slice(1);
+  return J(n) ? n : i;
 };
-var B = (e2, t2) => e2.name?.trim() || U(e2.label, t2);
-var se = (e2) => e2 > 1;
-var ae = (e2) => {
+var ee = (e2, t2) => e2.name?.trim() || Z(e2.label, t2);
+var Ce = (e2) => e2 > 1;
+var _e = (e2) => e2.trim().split(".").map((t2) => t2.trim()).join(".");
+var Me = (e2) => {
   let t2 = e2.trim();
-  if (!(!t2 || !L.test(t2)))
+  if (!(!t2 || !Q.test(t2)))
     return t2.split(".")[0].trim() || undefined;
 };
-var q = (e2) => {
-  let t2 = $(e2.decision.decisionTable.inputs), o = (r) => r.variableName ?? r.name, i = e2.inputData.map((r) => {
-    let a = o(r);
-    return t2.has(a) ? r.requirementId ? r : { ...r, requirementId: s("informationRequirement") } : r.requirementId && !r.requirementFromSource ? { ...r, requirementId: undefined } : r;
+var te = (e2, t2) => e2?.trim() ? e2 : t2?.trim() ? t2 : "";
+var ne = (e2) => te(e2.variableName, e2.name);
+var re = (e2) => {
+  let t2 = E(e2.decision.decisionTable), i = (n) => t2.has(ne(n)) ? n.requirementId ?? a("informationRequirement") : n.requirementFromSource ? n.requirementId : undefined, r = e2.inputData.map((n) => {
+    let s = i(n);
+    return s === n.requirementId ? n : { ...n, requirementId: s };
   });
-  return i.some((r, a) => r !== e2.inputData[a]) ? { ...e2, inputData: i } : e2;
-};
-var $ = (e2) => {
-  let t2 = new Set;
-  for (let o of e2)
-    for (let i of b(o.expressionText, "expression"))
-      t2.add(i.name);
-  return t2;
+  return r.some((n, s) => n !== e2.inputData[s]) ? { ...e2, inputData: r } : e2;
 };
-function V() {
-  let e2 = { id: s("output"), label: "Output 1", typeRef: "string" };
-  return { ...e2, name: B(e2, 0) };
+function ie() {
+  let e2 = { id: a("output"), label: "Output 1", typeRef: "string" };
+  return { ...e2, name: ee(e2, 0) };
 }
 export {
-  C as DEFAULT_ANNOTATION_CLAUSE_NAME,
-  _ as DEFAULT_DECISION_NAME,
-  S as EMPTY_OUTPUT_TEXT,
-  oe as FEEL_NAME_CHAR,
-  A as MAESTRO_EXPORTER,
-  O as createBusinessRuleIdentity,
-  P as createNewBusinessRuleModel,
-  ie as createSeededBusinessRuleModel,
-  q as deriveInputData,
-  ae as expressionRoot,
-  $ as inputExpressionRoots,
-  re as isEmptyOutputText,
-  w as isFeelIdentifier,
-  B as outputArgumentName,
-  U as outputNameFromLabel,
-  se as resultIsKeyedByClause
+  j as DEFAULT_ANNOTATION_CLAUSE_NAME,
+  W as DEFAULT_DECISION_NAME,
+  X as EMPTY_OUTPUT_TEXT,
+  Pe as FEEL_NAME_CHAR,
+  z as MAESTRO_EXPORTER,
+  K as createBusinessRuleIdentity,
+  Y as createNewBusinessRuleModel,
+  Ie as createSeededBusinessRuleModel,
+  Me as expressionRoot,
+  ne as inputDataIdentifier,
+  Re as isEmptyOutputText,
+  J as isFeelIdentifier,
+  _e as normalizeIdentifierPath,
+  ee as outputArgumentName,
+  Z as outputNameFromLabel,
+  re as reconcileInputData,
+  te as resolvedIdentifier,
+  Ce as resultIsKeyedByClause
 };
 
-//# debugId=B9F114C27FBF032464756E2164756E21
+//# debugId=7197E470DC49629464756E2164756E21

package/dist/{KieDmnMarshaller-6TTUU5B4-6apscj68.js → KieDmnMarshaller-LGE63WDG-cybersk4.js}

@@ -10440,7 +10440,7 @@ var $normalizeLineEndings = domParser.normalizeLineEndings;
 var $onErrorStopParsing = domParser.onErrorStopParsing;
 var $onWarningStopParsing = domParser.onWarningStopParsing;
 
-// ../../node_modules/@uipath/dmn-editor-utils/dist/chunks/chunk-CET35QOQ.js
+// ../../node_modules/@uipath/dmn-editor-utils/dist/chunks/chunk-YWHJRFPT.js
 var oe = n((u) => {
   var S = u && u.__assign || function() {
     return S = Object.assign || function(e) {
@@ -11046,7 +11046,7 @@ async function bs(e) {
       return { status: "error", reason: "migration-failed" };
     }
   try {
-    return { status: "ready", document: Ot(r), losses: s };
+    return { status: "ready", document: Ot(r), originalVersion: n2, losses: s };
   } catch (i) {
     return console.error("DMN: the marshaller could not read a well-formed document", i), { status: "error", reason: "invalid-xml" };
   }
@@ -11066,4 +11066,4 @@ export {
   Is as refusalToWriteBack
 };
 
-//# debugId=EA8F71380236FB6564756E2164756E21
+//# debugId=1098B3C889EDB59C64756E2164756E21

package/dist/THIRD-PARTY-NOTICES.md

@@ -5,7 +5,7 @@ compiled into its `dist/` output rather than installed alongside it.
 Their licences and copyright notices are reproduced here in full, as
 those licences require.
 
-89 bundled dependencies:
+91 bundled dependencies:
 
 - @bpmn-io/dmn-migrate@0.5.0 — MIT
 - @bpmn-io/lezer-feel@3.0.1 — MIT
@@ -16,19 +16,21 @@ those licences require.
 - @serverlessworkflow/sdk@1.0.1 — Apache-2.0
 - @uipath/agents-storage-schemas@1.42.0 — SEE LICENSE IN LICENSE.txt
 - @uipath/bpmn-auto-layout@1.0.16 — MIT
-- @uipath/case-schema@0.1147.0 — SEE LICENSE IN LICENSE.txt
-- @uipath/dmn-editor-utils@0.1164.0 — SEE LICENSE IN LICENSE.txt
+- @uipath/case-schema@0.1199.0 — SEE LICENSE IN LICENSE.txt
+- @uipath/dmn-editor-utils@0.1201.7 — SEE LICENSE IN LICENSE.txt
+- @uipath/entity-modeler@1.12.1 — SEE LICENSE IN LICENSE.txt
 - @uipath/flow-converter@0.69.3 — MIT
-- @uipath/flow-core@0.115.4-develop — MIT
 - @uipath/flow-core@0.112.0 — MIT
+- @uipath/flow-core@0.129.1 — MIT
 - @uipath/flow-expression-model@0.11.4 — MIT
-- @uipath/flow-migrations@0.56.2 — MIT
-- @uipath/flow-schema@0.72.2-develop — MIT
+- @uipath/flow-migrations@0.71.1 — MIT
+- @uipath/flow-schema@0.91.0 — MIT
+- @uipath/flow-schema@0.91.0 — MIT
 - @uipath/flow-schema@0.68.0 — MIT
-- @uipath/integration-service-design-time@1.41.2 — SEE LICENSE IN LICENSE.txt
+- @uipath/integration-service-design-time@2.10.0 — SEE LICENSE IN LICENSE.txt
 - @uipath/maestro-layout@0.1154.6 — SEE LICENSE IN LICENSE.txt
 - @uipath/maestro-validation@0.1154.6 — SEE LICENSE IN LICENSE.txt
-- @uipath/resource-builder-sdk@2025.11.0-alpha6004-4107 — ISC
+- @uipath/resource-builder-sdk@2025.11.0-alpha6584-4367 — ISC
 - @uipath/tool-agent@2.0.0 — see below
 - @xmldom/xmldom@0.9.12 — MIT
 - acorn@8.17.0 — MIT
@@ -65,9 +67,9 @@ those licences require.
 - lodash.merge@4.6.2 — MIT
 - lodash.xor@4.5.0 — MIT
 - luxon@3.7.2 — MIT
+- min-dash@5.1.0 — MIT
 - min-dash@3.8.1 — MIT
 - min-dash@4.2.3 — MIT
-- min-dash@5.1.0 — MIT
 - moddle@5.0.4 — MIT
 - moddle@7.2.0 — MIT
 - moddle-xml@9.0.6 — MIT
@@ -83,8 +85,8 @@ those licences require.
 - sax@1.6.1 — BlueOak-1.0.0
 - saxen@8.1.2 — MIT
 - saxen@10.0.0 — MIT
-- semver@7.7.4 — ISC
 - semver@7.8.0 — ISC
+- semver@7.7.4 — ISC
 - semver@7.8.0 — ISC
 - to-json-schema@0.2.5 — MIT
 - tslib@1.14.1 — 0BSD
@@ -512,7 +514,19 @@ applies, with copyright held by the package's authors.
 
 ---
 
-## @uipath/case-schema@0.1147.0
+## @uipath/case-schema@0.1199.0
+
+SPDX: SEE LICENSE IN LICENSE.txt
+
+```
+© 2026 UiPath
+Use of this product is subject (a) to the applicable licensing agreement available: https://www.uipath.com/legal/trust-and-security/legal-terms#content-1 and, (b) for paid products listed here https://licensing.uipath.com/: the licensing agreement agreed between you and UiPath.
+(UiPath means UiPath SRL with headquarters at 4 Vasile Alecsandri Str. and 11 Constantin Daniel Str., Building A, floors 5 and 6, District 1, Bucharest 010639, Romania and UiPath Inc. with principal place of business: One Vanderbilt Avenue, 60th Floor, New York, NY 10017)
+```
+
+---
+
+## @uipath/dmn-editor-utils@0.1201.7
 
 SPDX: SEE LICENSE IN LICENSE.txt
 
@@ -524,7 +538,7 @@ Use of this product is subject (a) to the applicable licensing agreement availab
 
 ---
 
-## @uipath/dmn-editor-utils@0.1164.0
+## @uipath/entity-modeler@1.12.1
 
 SPDX: SEE LICENSE IN LICENSE.txt
 
@@ -546,7 +560,7 @@ applies, with copyright held by the package's authors.
 
 ---
 
-## @uipath/flow-core@0.115.4-develop
+## @uipath/flow-core@0.112.0
 
 SPDX: MIT
 
@@ -556,7 +570,7 @@ applies, with copyright held by the package's authors.
 
 ---
 
-## @uipath/flow-core@0.112.0
+## @uipath/flow-core@0.129.1
 
 SPDX: MIT
 
@@ -584,7 +598,17 @@ applies, with copyright held by the package's authors.
 
 ---
 
-## @uipath/flow-migrations@0.56.2
+## @uipath/flow-migrations@0.71.1
+
+SPDX: MIT
+
+The upstream package ships no licence file here; `MIT` is the
+licence it is distributed under. The canonical text of that licence
+applies, with copyright held by the package's authors.
+
+---
+
+## @uipath/flow-schema@0.91.0
 
 SPDX: MIT
 
@@ -594,7 +618,7 @@ applies, with copyright held by the package's authors.
 
 ---
 
-## @uipath/flow-schema@0.72.2-develop
+## @uipath/flow-schema@0.91.0
 
 SPDX: MIT
 
@@ -614,7 +638,7 @@ applies, with copyright held by the package's authors.
 
 ---
 
-## @uipath/integration-service-design-time@1.41.2
+## @uipath/integration-service-design-time@2.10.0
 
 SPDX: SEE LICENSE IN LICENSE.txt
 
@@ -657,7 +681,7 @@ Use of this product is subject (a) to the applicable licensing agreement availab
 
 ---
 
-## @uipath/resource-builder-sdk@2025.11.0-alpha6004-4107
+## @uipath/resource-builder-sdk@2025.11.0-alpha6584-4367
 
 SPDX: ISC
 
@@ -1843,7 +1867,7 @@ THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLI
 
 ---
 
-## min-dash@3.8.1
+## min-dash@5.1.0
 
 SPDX: MIT
 
@@ -1873,7 +1897,7 @@ THE SOFTWARE.
 
 ---
 
-## min-dash@4.2.3
+## min-dash@3.8.1
 
 SPDX: MIT
 
@@ -1903,7 +1927,7 @@ THE SOFTWARE.
 
 ---
 
-## min-dash@5.1.0
+## min-dash@4.2.3
 
 SPDX: MIT
 
@@ -2624,7 +2648,7 @@ SOFTWARE.
 
 ---
 
-## semver@7.7.4
+## semver@7.8.0
 
 SPDX: ISC
 
@@ -2648,7 +2672,7 @@ IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 
 ---
 
-## semver@7.8.0
+## semver@7.7.4
 
 SPDX: ISC
 

package/dist/{authoring-ed7fgg74.js → authoring-5xyc2bbq.js}

@@ -5,12 +5,14 @@ import {
   registerMergeCommand,
   registerRegistryCommands,
   registerTidyCommand
-} from "./packager-tool-yy101ck2.js";
-import"./packager-tool-ps84n76y.js";
-import"./packager-tool-yv10w46z.js";
-import"./packager-tool-xdxr3ync.js";
+} from "./packager-tool-6tthp3g5.js";
+import"./packager-tool-tgh9btcq.js";
+import"./packager-tool-zgm0r4yp.js";
+import"./packager-tool-6sm17vbx.js";
+import"./packager-tool-hdxtgckw.js";
 import"./packager-tool-yvcrdbgp.js";
-import"./packager-tool-z1qbc0qf.js";
+import"./packager-tool-sm8ertv4.js";
+import"./packager-tool-wv85dhy2.js";
 import"./packager-tool-1yh8g550.js";
 
 // src/commands/authoring.ts
@@ -29,4 +31,4 @@ export {
   registerMaestroRegistryCommands
 };
 
-//# debugId=7A6F5C14BC5F3F6464756E2164756E21
+//# debugId=ED1BB2DB0835A9BD64756E2164756E21

package/dist/{authoring-1qn6m2g3.js → authoring-ehed6df3.js}

@@ -3,12 +3,14 @@ import {
   registerCompileCommand,
   registerDecompileCommand,
   registerMergeCommand
-} from "./packager-tool-yy101ck2.js";
-import"./packager-tool-ps84n76y.js";
-import"./packager-tool-yv10w46z.js";
-import"./packager-tool-xdxr3ync.js";
+} from "./packager-tool-6tthp3g5.js";
+import"./packager-tool-tgh9btcq.js";
+import"./packager-tool-zgm0r4yp.js";
+import"./packager-tool-6sm17vbx.js";
+import"./packager-tool-hdxtgckw.js";
 import"./packager-tool-yvcrdbgp.js";
-import"./packager-tool-z1qbc0qf.js";
+import"./packager-tool-sm8ertv4.js";
+import"./packager-tool-wv85dhy2.js";
 import"./packager-tool-1yh8g550.js";
 
 // ../case-tool/src/commands/authoring.ts
@@ -22,4 +24,4 @@ export {
   registerCaseAuthoringCommands
 };
 
-//# debugId=38735883EC4D8F9564756E2164756E21
+//# debugId=83B813A6CD199A8664756E2164756E21

package/dist/{authoring-ex7mq672.js → authoring-rw21p50g.js}

@@ -3,12 +3,14 @@ import {
   registerCompileCommand,
   registerDecompileCommand,
   registerMergeCommand
-} from "./packager-tool-yy101ck2.js";
-import"./packager-tool-ps84n76y.js";
-import"./packager-tool-yv10w46z.js";
-import"./packager-tool-xdxr3ync.js";
+} from "./packager-tool-6tthp3g5.js";
+import"./packager-tool-tgh9btcq.js";
+import"./packager-tool-zgm0r4yp.js";
+import"./packager-tool-6sm17vbx.js";
+import"./packager-tool-hdxtgckw.js";
 import"./packager-tool-yvcrdbgp.js";
-import"./packager-tool-z1qbc0qf.js";
+import"./packager-tool-sm8ertv4.js";
+import"./packager-tool-wv85dhy2.js";
 import"./packager-tool-1yh8g550.js";
 
 // ../flow-tool/src/commands/authoring.ts
@@ -22,4 +24,4 @@ export {
   registerFlowAuthoringCommands
 };
 
-//# debugId=E419F4CE7AD0EF0E64756E2164756E21
+//# debugId=B47C1BC19C3C49FB64756E2164756E21