@uipath/rules-tool 1.204.0 → 1.205.0-preview.258
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +7 -5
- package/dist/DmnFactory-L7MABUC6-98k17dkr.js +46 -0
- package/dist/{KieDmnMarshaller-6TTUU5B4-47q50gk4.js → KieDmnMarshaller-LGE63WDG-3vemswef.js} +2 -2
- package/dist/THIRD-PARTY-NOTICES.md +26 -9
- package/dist/{business-rules-bnr581tz.js → business-rules-pm96sefm.js} +4 -4
- package/dist/{constants-9pa118cj.js → constants-cnn0jfw6.js} +18 -17
- package/dist/{embedded-file-reader-rf2g1kfj.js → embedded-file-reader-z4becc02.js} +2 -2
- package/dist/hitPolicyResult-CGCR73CW-9bmc4nsr.js +36 -0
- package/dist/index-52h8rpew.js +21 -0
- package/dist/index-bhjt1h5c.js +227 -0
- package/dist/{index-2hzp9b97.js → index-cpm94vee.js} +21 -5
- package/dist/index-x9msn1dj.js +85 -0
- package/dist/{index-4c4exdzw.js → index-ybrgtfsg.js} +576 -285
- package/dist/index.js +2 -2
- package/dist/rule-catalog-10fhgevc.js +74 -0
- package/dist/{rules-command-error-20gp2dv9.js → rules-command-error-k6kxwfn7.js} +2 -2
- package/dist/{rules-debug-service-qd3aqcg1.js → rules-debug-service-86e47tv4.js} +19 -13
- package/dist/{rules-init-service-xsh7mx96.js → rules-init-service-3z07e0v8.js} +7 -7
- package/dist/{rules-refresh-service-jgk2kq9d.js → rules-refresh-service-jn6my893.js} +3 -3
- package/dist/{rules-validate-service-mr2fk58k.js → rules-validate-service-hfw8m3dm.js} +7 -7
- package/dist/{tool-pm3ewdxc.js → tool-1pccj6q3.js} +4 -3
- package/dist/{tool-jpwm68hm.js → tool-5zs9eywg.js} +103 -63
- package/dist/tool-86f1xpxn.js +51 -0
- package/dist/{tool-75esv9bk.js → tool-a4r4a9be.js} +17 -7
- package/dist/tool-cfrcyxgm.js +26 -0
- package/dist/{tool-av4mmsef.js → tool-fbmxx07c.js} +2 -2
- package/dist/{tool-2cky8jwp.js → tool-fbxe48wd.js} +1071 -208
- package/dist/tool-fk8rznma.js +827 -0
- package/dist/{tool-mkn83w88.js → tool-gkbr01gc.js} +3 -3
- package/dist/{tool-8h4er38s.js → tool-h7gn1rar.js} +3 -3
- package/dist/{tool-8qy8pkp4.js → tool-t4k013ex.js} +8 -5
- package/dist/tool-tjcg2xje.js +4616 -0
- package/dist/{tool-eymjx05p.js → tool-txp5th7j.js} +760 -3395
- package/dist/{tool-tkcx6png.js → tool-wf2qkrye.js} +25 -5
- package/dist/{tool-wmh645tm.js → tool-yq5jph4h.js} +169 -119
- package/dist/tool-z1ay3csx.js +176 -0
- package/dist/tool.js +2 -2
- package/package.json +2 -2
- package/dist/DmnFactory-VWZOSZHH-jkpbxz3n.js +0 -42
- package/dist/hitPolicyResult-4WDHTX4A-gk103w84.js +0 -33
- package/dist/index-34pj9f36.js +0 -48
- package/dist/index-fs1nd5ap.js +0 -200
- package/dist/index-t4mx1a5e.js +0 -17
- package/dist/rule-catalog-5gzpe93c.js +0 -46
- package/dist/tool-19b4ect0.js +0 -754
- package/dist/tool-4dfpdepw.js +0 -55
- package/dist/tool-m41px07w.js +0 -49
|
@@ -2277,6 +2277,16 @@ class NodeFileSystem {
|
|
|
2277
2277
|
async rename(oldPath, newPath) {
|
|
2278
2278
|
await fs.rename(oldPath, newPath);
|
|
2279
2279
|
}
|
|
2280
|
+
async isSymbolicLink(filePath) {
|
|
2281
|
+
try {
|
|
2282
|
+
return (await fs.lstat(filePath)).isSymbolicLink();
|
|
2283
|
+
} catch (error) {
|
|
2284
|
+
if (this.isEnoent(error) || this.hasErrnoCode(error, "ENOTDIR")) {
|
|
2285
|
+
return false;
|
|
2286
|
+
}
|
|
2287
|
+
throw error;
|
|
2288
|
+
}
|
|
2289
|
+
}
|
|
2280
2290
|
async realpath(filePath) {
|
|
2281
2291
|
try {
|
|
2282
2292
|
return await fs.realpath(filePath);
|
|
@@ -3322,7 +3332,7 @@ function setGlobalLogFilePath(path2) {
|
|
|
3322
3332
|
function getGlobalLogFilePath() {
|
|
3323
3333
|
return logFilePathSlot.get("");
|
|
3324
3334
|
}
|
|
3325
|
-
var DEFAULT_LOG_LEVEL =
|
|
3335
|
+
var DEFAULT_LOG_LEVEL = 2 /* WARN */;
|
|
3326
3336
|
|
|
3327
3337
|
class SimpleLogger {
|
|
3328
3338
|
__brand = "SimpleLogger";
|
|
@@ -3594,7 +3604,9 @@ var ErrorDimensions = {
|
|
|
3594
3604
|
Result: "Result",
|
|
3595
3605
|
ErrorCode: "ErrorCode",
|
|
3596
3606
|
Retry: "Retry",
|
|
3597
|
-
ErrorMessage: "ErrorMessage"
|
|
3607
|
+
ErrorMessage: "ErrorMessage",
|
|
3608
|
+
HttpStatus: "HttpStatus",
|
|
3609
|
+
UpstreamErrorCode: "UpstreamErrorCode"
|
|
3598
3610
|
};
|
|
3599
3611
|
var AuthDimensions = {
|
|
3600
3612
|
AuthenticationMethod: "AuthenticationMethod",
|
|
@@ -4582,7 +4594,9 @@ var CLI_ERROR_CODES = [
|
|
|
4582
4594
|
"timeout",
|
|
4583
4595
|
"server_error",
|
|
4584
4596
|
"method_not_allowed",
|
|
4597
|
+
"not_supported",
|
|
4585
4598
|
"configuration_error",
|
|
4599
|
+
"execution_failed",
|
|
4586
4600
|
"unknown_error"
|
|
4587
4601
|
];
|
|
4588
4602
|
var RETRY_HINTS = [
|
|
@@ -5572,7 +5586,9 @@ var OutputFormatter;
|
|
|
5572
5586
|
[ErrorDimensions.Result]: data.Result,
|
|
5573
5587
|
[ErrorDimensions.ErrorCode]: data.ErrorCode,
|
|
5574
5588
|
[ErrorDimensions.Retry]: data.Retry,
|
|
5575
|
-
[ErrorDimensions.ErrorMessage]: data.Message
|
|
5589
|
+
[ErrorDimensions.ErrorMessage]: data.Message,
|
|
5590
|
+
[ErrorDimensions.HttpStatus]: data.Context?.httpStatus?.toString(),
|
|
5591
|
+
[ErrorDimensions.UpstreamErrorCode]: data.Context?.errorCode
|
|
5576
5592
|
});
|
|
5577
5593
|
}
|
|
5578
5594
|
logOutput(normalizeOutputKeys(envelope), getOutputFormat());
|
|
@@ -6541,6 +6557,10 @@ function installRequestHeaderForwarding(BaseApiClass, patchKey, forward) {
|
|
|
6541
6557
|
function installSdkUserAgentHeader(BaseApiClass, userAgent) {
|
|
6542
6558
|
installRequestHeaderForwarding(BaseApiClass, userAgentPatchKey(userAgent), (headers) => addSdkUserAgentHeader(headers, userAgent));
|
|
6543
6559
|
}
|
|
6560
|
+
// ../common/src/shell-quote.ts
|
|
6561
|
+
function quoteForShell(value) {
|
|
6562
|
+
return `'${value.replace(/'/g, "'\\''")}'`;
|
|
6563
|
+
}
|
|
6544
6564
|
// ../common/src/solution-project-types.ts
|
|
6545
6565
|
var LIBRARY_NOT_A_PROJECT = "A library cannot be a project inside a solution — it is a reusable .nupkg that other projects consume as a NuGet dependency, not a deployable unit. Build and publish it on its own ('uip rpa pack <project-dir> <output-path>', then 'uip or libraries upload --file <nupkg-path>'), and reference it from a project's dependencies. To make the published library part of this solution, add it as a resource instead: 'uip solution resources add --source remote --kind Library --name <library-name>'.";
|
|
6546
6566
|
function unsupportedSolutionProjectType(projectType) {
|
|
@@ -6553,6 +6573,6 @@ function unsupportedSolutionProjectType(projectType) {
|
|
|
6553
6573
|
var shippedKeysSlot = singleton("ShipSucceededDedupeKeys");
|
|
6554
6574
|
// ../common/src/tool-provider.ts
|
|
6555
6575
|
var factorySlot = singleton("PackagerFactoryProvider");
|
|
6556
|
-
export { getFileSystem, catchError, extractErrorMessage, extractErrorMessageSync, logger, RESULTS, Pagination, OutputFormatter, classifiedFailure, Command, Option, processContext, DEFAULT_PAGE_SIZE, isGuid, createHiddenDeprecatedTenantOption, parseLimit, parseOffset, parseBoundedInt, getSdkUserAgentToken, addSdkUserAgentHeader, installSdkUserAgentHeader, unsupportedSolutionProjectType };
|
|
6576
|
+
export { getFileSystem, catchError, extractErrorMessage, extractErrorMessageSync, logger, RESULTS, Pagination, OutputFormatter, classifiedFailure, Command, Option, processContext, DEFAULT_PAGE_SIZE, isGuid, createHiddenDeprecatedTenantOption, parseLimit, parseOffset, parseBoundedInt, getSdkUserAgentToken, addSdkUserAgentHeader, installSdkUserAgentHeader, quoteForShell, unsupportedSolutionProjectType };
|
|
6557
6577
|
|
|
6558
|
-
//# debugId=
|
|
6578
|
+
//# debugId=A738CFC73DE134DD64756E2164756E21
|
|
@@ -1,9 +1,9 @@
|
|
|
1
|
-
import {
|
|
2
|
-
e
|
|
3
|
-
} from "./tool-jd313s2x.js";
|
|
4
1
|
import {
|
|
5
2
|
v4_default
|
|
6
3
|
} from "./tool-qgqscsjc.js";
|
|
4
|
+
import {
|
|
5
|
+
e
|
|
6
|
+
} from "./tool-jd313s2x.js";
|
|
7
7
|
|
|
8
8
|
// ../../node_modules/@lezer/common/dist/index.js
|
|
9
9
|
var DefaultBufferLength = 1024;
|
|
@@ -3842,181 +3842,231 @@ var parser = LRParser.deserialize({
|
|
|
3842
3842
|
tokenPrec: 2660
|
|
3843
3843
|
});
|
|
3844
3844
|
|
|
3845
|
-
// ../../node_modules/@uipath/dmn-editor-utils/dist/chunks/chunk-
|
|
3846
|
-
var
|
|
3847
|
-
var
|
|
3848
|
-
var
|
|
3849
|
-
|
|
3850
|
-
|
|
3851
|
-
|
|
3852
|
-
|
|
3853
|
-
|
|
3845
|
+
// ../../node_modules/@uipath/dmn-editor-utils/dist/chunks/chunk-EXAD3CI5.js
|
|
3846
|
+
var R = parser.configure({ top: "UnaryTests" });
|
|
3847
|
+
var c = (e2, t2) => (t2 === "unaryTests" ? R : parser).parse(e2);
|
|
3848
|
+
var I = new Set(["StringLiteral", "NumericLiteral", "BooleanLiteral", "DateTimeLiteral", "null"]);
|
|
3849
|
+
var oe = (e2) => {
|
|
3850
|
+
let t2 = e2.trim();
|
|
3851
|
+
if (!t2)
|
|
3852
|
+
return false;
|
|
3853
|
+
let i = false;
|
|
3854
|
+
return c(t2, "unaryTests").iterate({ enter(r) {
|
|
3855
|
+
r.from === 0 && r.to === t2.length && I.has(r.name) && (i = true);
|
|
3856
|
+
} }), i;
|
|
3857
|
+
};
|
|
3858
|
+
var ae = (e2, t2) => {
|
|
3859
|
+
let i = false;
|
|
3860
|
+
return c(e2, t2).iterate({ enter(r) {
|
|
3861
|
+
i ||= r.type.isError;
|
|
3862
|
+
} }), i;
|
|
3863
|
+
};
|
|
3864
|
+
var g = (e2) => e2.parent?.name === "FunctionInvocation" && e2.parent.firstChild?.from === e2.from;
|
|
3865
|
+
var P = (e2, t2, i) => {
|
|
3866
|
+
for (let r = e2.parent;r; r = r.parent)
|
|
3867
|
+
if (!(r.name !== "ForExpression" && r.name !== "QuantifiedExpression"))
|
|
3868
|
+
for (let n = r.getChild("InExpressions")?.firstChild;n; n = n.nextSibling) {
|
|
3869
|
+
let s = n.getChild("Name");
|
|
3870
|
+
if (s && e2.from >= n.to && i.slice(s.from, s.to) === t2)
|
|
3854
3871
|
return true;
|
|
3855
3872
|
}
|
|
3856
3873
|
return false;
|
|
3857
3874
|
};
|
|
3858
|
-
var
|
|
3859
|
-
for (let
|
|
3860
|
-
if (
|
|
3861
|
-
for (let n =
|
|
3862
|
-
let
|
|
3863
|
-
if (
|
|
3875
|
+
var C = (e2, t2, i) => {
|
|
3876
|
+
for (let r = e2.parent;r; r = r.parent)
|
|
3877
|
+
if (r.name === "FunctionDefinition")
|
|
3878
|
+
for (let n = r.getChild("FormalParameters")?.firstChild;n; n = n.nextSibling) {
|
|
3879
|
+
let s = n.getChild("ParameterName")?.getChild("Name");
|
|
3880
|
+
if (s && i.slice(s.from, s.to) === t2)
|
|
3864
3881
|
return true;
|
|
3865
3882
|
}
|
|
3866
3883
|
return false;
|
|
3867
3884
|
};
|
|
3868
|
-
var
|
|
3869
|
-
for (let
|
|
3870
|
-
if (
|
|
3871
|
-
for (let n =
|
|
3885
|
+
var _ = (e2, t2, i) => {
|
|
3886
|
+
for (let r = e2.parent;r; r = r.parent)
|
|
3887
|
+
if (r.name === "Context")
|
|
3888
|
+
for (let n = r.firstChild;n; n = n.nextSibling) {
|
|
3872
3889
|
if (n.name !== "ContextEntry" || n.to > e2.from)
|
|
3873
3890
|
continue;
|
|
3874
|
-
let
|
|
3875
|
-
if (
|
|
3891
|
+
let s = n.getChild("Key")?.getChild("Name");
|
|
3892
|
+
if (s && i.slice(s.from, s.to) === t2)
|
|
3876
3893
|
return true;
|
|
3877
3894
|
}
|
|
3878
3895
|
return false;
|
|
3879
3896
|
};
|
|
3880
|
-
var
|
|
3881
|
-
var
|
|
3897
|
+
var M = (e2, t2, i) => P(e2, t2, i) || C(e2, t2, i) || _(e2, t2, i);
|
|
3898
|
+
var A = (e2) => {
|
|
3882
3899
|
for (let t2 = e2.parent;t2; t2 = t2.parent)
|
|
3883
3900
|
if (t2.name === "FilterExpression" && t2.firstChild && e2.from >= t2.firstChild.to)
|
|
3884
3901
|
return true;
|
|
3885
3902
|
return false;
|
|
3886
3903
|
};
|
|
3887
|
-
var
|
|
3888
|
-
(t2
|
|
3904
|
+
var u = (e2, t2, i) => {
|
|
3905
|
+
c(e2, t2).iterate({ enter(n) {
|
|
3889
3906
|
if (n.name !== "VariableName")
|
|
3890
3907
|
return;
|
|
3891
|
-
let
|
|
3892
|
-
|
|
3908
|
+
let s = n.node, o = e2.slice(s.from, s.to);
|
|
3909
|
+
g(s) || M(s, o, e2) || i(s, o);
|
|
3893
3910
|
} });
|
|
3894
3911
|
};
|
|
3895
|
-
var
|
|
3912
|
+
var T = (e2, t2, i) => {
|
|
3896
3913
|
if (!e2 || !e2.includes(t2))
|
|
3897
3914
|
return [];
|
|
3898
|
-
let
|
|
3899
|
-
return
|
|
3900
|
-
|
|
3901
|
-
}),
|
|
3915
|
+
let r = [];
|
|
3916
|
+
return u(e2, i, (n, s) => {
|
|
3917
|
+
s === t2 && r.push({ from: n.from, to: n.to });
|
|
3918
|
+
}), r;
|
|
3902
3919
|
};
|
|
3903
|
-
var
|
|
3904
|
-
|
|
3905
|
-
(t2 === "unaryTests" ? m : parser).parse(e2).iterate({ enter(n) {
|
|
3920
|
+
var w = (e2, t2, i) => {
|
|
3921
|
+
c(e2, t2).iterate({ enter(n) {
|
|
3906
3922
|
if (n.name !== "VariableName")
|
|
3907
3923
|
return;
|
|
3908
|
-
let
|
|
3909
|
-
|
|
3924
|
+
let s = n.node;
|
|
3925
|
+
g(s) && i(s, e2.slice(s.from, s.to));
|
|
3910
3926
|
} });
|
|
3911
3927
|
};
|
|
3912
|
-
var
|
|
3928
|
+
var L = (e2, t2, i) => {
|
|
3913
3929
|
if (!e2 || !e2.includes(t2))
|
|
3914
3930
|
return [];
|
|
3915
|
-
let
|
|
3916
|
-
return
|
|
3917
|
-
|
|
3918
|
-
}),
|
|
3931
|
+
let r = [];
|
|
3932
|
+
return w(e2, i, (n, s) => {
|
|
3933
|
+
s === t2 && r.push({ from: n.from, to: n.to });
|
|
3934
|
+
}), r;
|
|
3919
3935
|
};
|
|
3920
|
-
var
|
|
3921
|
-
let
|
|
3922
|
-
for (let
|
|
3923
|
-
|
|
3924
|
-
return
|
|
3936
|
+
var x = (e2, t2, i) => {
|
|
3937
|
+
let r = "", n = 0;
|
|
3938
|
+
for (let s of t2)
|
|
3939
|
+
r += e2.slice(n, s.from) + i, n = s.to;
|
|
3940
|
+
return r + e2.slice(n);
|
|
3925
3941
|
};
|
|
3926
|
-
var
|
|
3927
|
-
let n =
|
|
3928
|
-
return n.length === 0 ? e2 :
|
|
3942
|
+
var pe = (e2, t2, i, r) => {
|
|
3943
|
+
let n = L(e2, t2, r);
|
|
3944
|
+
return n.length === 0 ? e2 : x(e2, n, i);
|
|
3929
3945
|
};
|
|
3930
|
-
var b = (e2, t2
|
|
3946
|
+
var b = (e2, t2) => {
|
|
3931
3947
|
if (!e2.trim())
|
|
3932
3948
|
return [];
|
|
3933
3949
|
let i = [];
|
|
3934
|
-
return
|
|
3935
|
-
(
|
|
3950
|
+
return u(e2, t2, (r, n) => {
|
|
3951
|
+
i.push({ name: n, path: D(r, e2, true), segments: F(r, e2, false), from: r.from, to: r.to, inFilterPredicate: A(r) });
|
|
3936
3952
|
}), i;
|
|
3937
3953
|
};
|
|
3938
|
-
var
|
|
3939
|
-
let
|
|
3940
|
-
for (;
|
|
3941
|
-
let
|
|
3942
|
-
|
|
3954
|
+
var F = (e2, t2, i) => {
|
|
3955
|
+
let r = [{ name: t2.slice(e2.from, e2.to), from: e2.from, to: e2.to }], n = e2, s = n.parent;
|
|
3956
|
+
for (;s && (s.name === "PathExpression" || i && s.name === "FilterExpression") && s.from === n.from; ) {
|
|
3957
|
+
let o = s.name === "PathExpression" ? s.getChild("PathName") : null;
|
|
3958
|
+
o && r.push({ name: t2.slice(o.from, o.to), from: o.from, to: o.to }), n = s, s = n.parent;
|
|
3943
3959
|
}
|
|
3944
|
-
return
|
|
3960
|
+
return r;
|
|
3945
3961
|
};
|
|
3946
|
-
var
|
|
3962
|
+
var D = (e2, t2, i) => F(e2, t2, i).map((r) => r.name).join(".");
|
|
3963
|
+
var me = (e2, t2, i = false) => {
|
|
3947
3964
|
if (!e2.trim())
|
|
3948
3965
|
return [];
|
|
3949
|
-
let
|
|
3950
|
-
return
|
|
3951
|
-
let
|
|
3952
|
-
|
|
3953
|
-
}),
|
|
3966
|
+
let r = new Set, n = [];
|
|
3967
|
+
return u(e2, t2, (s) => {
|
|
3968
|
+
let o = D(s, e2, i);
|
|
3969
|
+
r.has(o) || (r.add(o), n.push(o));
|
|
3970
|
+
}), n;
|
|
3954
3971
|
};
|
|
3955
|
-
var
|
|
3972
|
+
var h = (e2) => {
|
|
3956
3973
|
let t2 = e2.trim();
|
|
3957
3974
|
if (!t2)
|
|
3958
3975
|
return false;
|
|
3959
|
-
let
|
|
3960
|
-
return
|
|
3976
|
+
let i = T(t2, t2, "expression");
|
|
3977
|
+
return i.length === 1 && i[0].from === 0 && i[0].to === t2.length;
|
|
3961
3978
|
};
|
|
3962
|
-
var
|
|
3963
|
-
let n =
|
|
3964
|
-
return n.length === 0 ? e2 :
|
|
3979
|
+
var ue = (e2, t2, i, r) => {
|
|
3980
|
+
let n = T(e2, t2, r);
|
|
3981
|
+
return n.length === 0 ? e2 : x(e2, n, i);
|
|
3965
3982
|
};
|
|
3966
|
-
var
|
|
3967
|
-
var
|
|
3968
|
-
var
|
|
3969
|
-
var
|
|
3970
|
-
var
|
|
3971
|
-
|
|
3972
|
-
|
|
3973
|
-
|
|
3983
|
+
var a = (e2) => `${e2}_${v4_default()}`;
|
|
3984
|
+
var v = { all: new Set, outsideFilterPredicates: new Set, paths: new Set };
|
|
3985
|
+
var B = new WeakMap;
|
|
3986
|
+
var U = { expression: new WeakMap, unaryTests: new WeakMap };
|
|
3987
|
+
var l = (e2, t2, i = B) => {
|
|
3988
|
+
let r = i.get(e2);
|
|
3989
|
+
if (r)
|
|
3990
|
+
return r;
|
|
3991
|
+
let n = t2(e2);
|
|
3992
|
+
return i.set(e2, n), n;
|
|
3993
|
+
};
|
|
3994
|
+
var p = (e2, t2) => {
|
|
3995
|
+
let i = e2?.trim();
|
|
3996
|
+
if (!i || t2 === "unaryTests" && i === "-")
|
|
3997
|
+
return v;
|
|
3998
|
+
let r = b(i, t2);
|
|
3999
|
+
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)) };
|
|
4000
|
+
};
|
|
4001
|
+
var m = (e2) => {
|
|
4002
|
+
let t2 = new Set, i = new Set, r = new Set;
|
|
4003
|
+
for (let n of e2) {
|
|
4004
|
+
for (let s of n.paths)
|
|
4005
|
+
r.add(s);
|
|
4006
|
+
for (let s of n.all)
|
|
4007
|
+
t2.add(s);
|
|
4008
|
+
for (let s of n.outsideFilterPredicates)
|
|
4009
|
+
i.add(s);
|
|
4010
|
+
}
|
|
4011
|
+
return { all: t2, outsideFilterPredicates: i, paths: r };
|
|
4012
|
+
};
|
|
4013
|
+
var N = (e2, t2) => l(e2, () => p(e2.text, t2), U[t2]);
|
|
4014
|
+
var V = (e2) => l(e2, () => m([p(e2.expressionText, "expression"), p(e2.allowedValues?.text, "unaryTests")]));
|
|
4015
|
+
var k = (e2) => l(e2, () => p(e2.allowedValues?.text, "unaryTests"));
|
|
4016
|
+
var q = (e2) => l(e2, () => m([...e2.inputEntries.map((t2) => N(t2, "unaryTests")), ...e2.outputEntries.map((t2) => N(t2, "expression"))]));
|
|
4017
|
+
var $ = (e2) => l(e2, () => m(e2.map(q)));
|
|
4018
|
+
var S = (e2) => l(e2, () => m([...e2.inputs.map(V), ...e2.outputs.map(k), $(e2.rules)]));
|
|
4019
|
+
var E = (e2) => S(e2).all;
|
|
4020
|
+
var xe = (e2) => S(e2).outsideFilterPredicates;
|
|
4021
|
+
var j = "Annotation";
|
|
4022
|
+
var W = "Decision";
|
|
4023
|
+
var H = "decision1";
|
|
4024
|
+
var z = "UiPath Maestro";
|
|
4025
|
+
var K = () => ({ id: a("definitions"), namespace: `http://uipath.com/dmn/${a("ns")}`, exporter: z });
|
|
4026
|
+
var X = "null";
|
|
4027
|
+
var Re = (e2) => {
|
|
3974
4028
|
let t2 = (e2 ?? "").trim();
|
|
3975
|
-
return t2 === "" || t2 ===
|
|
4029
|
+
return t2 === "" || t2 === X;
|
|
3976
4030
|
};
|
|
3977
|
-
var
|
|
3978
|
-
var
|
|
3979
|
-
var
|
|
3980
|
-
let t2 =
|
|
3981
|
-
return
|
|
4031
|
+
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: [] });
|
|
4032
|
+
var y = "input1";
|
|
4033
|
+
var Ie = (e2) => {
|
|
4034
|
+
let t2 = Y(e2), [i] = t2.decision.decisionTable.inputs;
|
|
4035
|
+
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 }] } } });
|
|
3982
4036
|
};
|
|
3983
|
-
var
|
|
3984
|
-
var
|
|
3985
|
-
var
|
|
3986
|
-
var
|
|
3987
|
-
var
|
|
3988
|
-
let
|
|
3989
|
-
if (!/^[\p{L}_]/u.test(
|
|
3990
|
-
return
|
|
3991
|
-
let n =
|
|
3992
|
-
return
|
|
4037
|
+
var Pe = /[\p{L}\p{N}_]/u;
|
|
4038
|
+
var Q = /^[\p{L}_][\p{L}\p{N}_]*(\s*\.\s*[\p{L}_][\p{L}\p{N}_]*)*$/u;
|
|
4039
|
+
var G = /^[\p{L}_][\p{L}\p{N}_]*$/u;
|
|
4040
|
+
var J = (e2) => G.test(e2.trim()) && h(e2);
|
|
4041
|
+
var Z = (e2, t2) => {
|
|
4042
|
+
let i = `output${t2 + 1}`, r = (e2 ?? "").replace(/[^\p{L}\p{N}_]+(.)?/gu, (s, o) => o ? o.toUpperCase() : "");
|
|
4043
|
+
if (!/^[\p{L}_]/u.test(r))
|
|
4044
|
+
return i;
|
|
4045
|
+
let n = r.charAt(0).toLowerCase() + r.slice(1);
|
|
4046
|
+
return J(n) ? n : i;
|
|
3993
4047
|
};
|
|
3994
|
-
var
|
|
3995
|
-
var
|
|
3996
|
-
var
|
|
4048
|
+
var ee = (e2, t2) => e2.name?.trim() || Z(e2.label, t2);
|
|
4049
|
+
var Ce = (e2) => e2 > 1;
|
|
4050
|
+
var _e = (e2) => e2.trim().split(".").map((t2) => t2.trim()).join(".");
|
|
4051
|
+
var Me = (e2) => {
|
|
3997
4052
|
let t2 = e2.trim();
|
|
3998
|
-
if (!(!t2 || !
|
|
4053
|
+
if (!(!t2 || !Q.test(t2)))
|
|
3999
4054
|
return t2.split(".")[0].trim() || undefined;
|
|
4000
4055
|
};
|
|
4001
|
-
var
|
|
4002
|
-
|
|
4003
|
-
|
|
4004
|
-
|
|
4056
|
+
var te = (e2, t2) => e2?.trim() ? e2 : t2?.trim() ? t2 : "";
|
|
4057
|
+
var ne = (e2) => te(e2.variableName, e2.name);
|
|
4058
|
+
var re = (e2) => {
|
|
4059
|
+
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) => {
|
|
4060
|
+
let s = i(n);
|
|
4061
|
+
return s === n.requirementId ? n : { ...n, requirementId: s };
|
|
4005
4062
|
});
|
|
4006
|
-
return
|
|
4007
|
-
};
|
|
4008
|
-
var $ = (e2) => {
|
|
4009
|
-
let t2 = new Set;
|
|
4010
|
-
for (let o of e2)
|
|
4011
|
-
for (let i of b(o.expressionText, "expression"))
|
|
4012
|
-
t2.add(i.name);
|
|
4013
|
-
return t2;
|
|
4063
|
+
return r.some((n, s) => n !== e2.inputData[s]) ? { ...e2, inputData: r } : e2;
|
|
4014
4064
|
};
|
|
4015
|
-
function
|
|
4016
|
-
let e2 = { id:
|
|
4017
|
-
return { ...e2, name:
|
|
4065
|
+
function ie() {
|
|
4066
|
+
let e2 = { id: a("output"), label: "Output 1", typeRef: "string" };
|
|
4067
|
+
return { ...e2, name: ee(e2, 0) };
|
|
4018
4068
|
}
|
|
4019
4069
|
|
|
4020
|
-
export { trackVariables, parser,
|
|
4070
|
+
export { trackVariables, parser, c, oe, ae, pe, b, me, h, ue, a, E, xe, j, W, z, K, X, Re, Y, Ie, Pe, J, Z, ee, Ce, _e, Me, te, ne, re };
|
|
4021
4071
|
|
|
4022
|
-
//# debugId=
|
|
4072
|
+
//# debugId=FE07DDFECF81EB4A64756E2164756E21
|
|
@@ -0,0 +1,176 @@
|
|
|
1
|
+
import {
|
|
2
|
+
r
|
|
3
|
+
} from "./tool-jd313s2x.js";
|
|
4
|
+
|
|
5
|
+
// ../../node_modules/@uipath/dmn-editor-utils/dist/chunks/chunk-HIWFLOJ4.js
|
|
6
|
+
var x = (e) => e.includes(":") ? e.split(":").pop() ?? e : e;
|
|
7
|
+
var w = new Set(["number", "integer", "long", "double", "decimal"]);
|
|
8
|
+
var $ = (e) => w.has(x(e));
|
|
9
|
+
var R = (e) => $(e) ? "number" : x(e);
|
|
10
|
+
var z = (e) => {
|
|
11
|
+
let n = e.chain[e.chain.length - 1];
|
|
12
|
+
return !e.components && !e.recursive && !!n && !n.allowedValues && !e.baseTypeRef && !e.foreign;
|
|
13
|
+
};
|
|
14
|
+
var S = (e) => !!e?.baseTypeRef && e.baseTypeRef !== "Any" && r.includes(e.baseTypeRef) && !e.isCollection && !e.components && !e.foreign && !e.recursive;
|
|
15
|
+
var _ = ["string", "number", "boolean"];
|
|
16
|
+
var B = (e) => S(e) && _.includes(e?.baseTypeRef ?? "") ? e?.baseTypeRef : undefined;
|
|
17
|
+
var O = (e) => e.chain.filter((n) => n.isCollection).length > 1;
|
|
18
|
+
var U = (e) => {
|
|
19
|
+
if (!(!e?.isCollection || e.components || e.foreign || e.recursive))
|
|
20
|
+
return !O(e) && _.includes(e.baseTypeRef ?? "") ? e.baseTypeRef : undefined;
|
|
21
|
+
};
|
|
22
|
+
var K = (e, n) => {
|
|
23
|
+
let t = e;
|
|
24
|
+
for (let [o, s] of n.entries()) {
|
|
25
|
+
if (!t)
|
|
26
|
+
return {};
|
|
27
|
+
if (t.isCollection)
|
|
28
|
+
return { crosses: "list", crossedAfter: o };
|
|
29
|
+
if (S(t))
|
|
30
|
+
return { crosses: "single", crossedAfter: o };
|
|
31
|
+
t = t.components?.find((r2) => r2.name === s)?.type;
|
|
32
|
+
}
|
|
33
|
+
return t ? { type: t } : {};
|
|
34
|
+
};
|
|
35
|
+
var m = (e) => {
|
|
36
|
+
let n = Object.entries(e ?? {}).flatMap(([t, o]) => t.startsWith("@_xmlns:") && typeof o == "string" ? [[t.slice(8), o]] : []);
|
|
37
|
+
return n.length ? Object.fromEntries(n) : undefined;
|
|
38
|
+
};
|
|
39
|
+
var f = (e, n, t = [], o) => {
|
|
40
|
+
if (Array.isArray(e)) {
|
|
41
|
+
for (let i of e)
|
|
42
|
+
f(i, n, t, o);
|
|
43
|
+
return;
|
|
44
|
+
}
|
|
45
|
+
if (!e || typeof e != "object" || o?.(e))
|
|
46
|
+
return;
|
|
47
|
+
let s = m(e), r2 = s ? [s, ...t] : t;
|
|
48
|
+
for (let [i, a] of Object.entries(e))
|
|
49
|
+
if (i === "@_typeRef" && typeof a == "string")
|
|
50
|
+
n(a, r2);
|
|
51
|
+
else if (i === "typeRef" && typeof a?.__$$text == "string") {
|
|
52
|
+
let p = m(a);
|
|
53
|
+
n(a.__$$text, p ? [p, ...r2] : r2);
|
|
54
|
+
} else
|
|
55
|
+
i !== "dmndi:DMNDI" && f(a, n, r2, o);
|
|
56
|
+
};
|
|
57
|
+
var M = (e, n, t) => {
|
|
58
|
+
let o = { namespace: e["@_namespace"] }, s = new Set;
|
|
59
|
+
return f(n, (i, a) => {
|
|
60
|
+
let { name: p, space: c } = d(i, a, o);
|
|
61
|
+
c === "local" && s.add(p);
|
|
62
|
+
}, I([e]), t), s.size ? [...s].sort((i, a) => i.localeCompare(a)) : undefined;
|
|
63
|
+
};
|
|
64
|
+
var k = (e) => {
|
|
65
|
+
let n = new Map, t = (s, r2) => {
|
|
66
|
+
let i = C.exec(s)?.[1], a = i === undefined ? undefined : y(i, o) ?? y(i, r2);
|
|
67
|
+
i !== undefined && a !== undefined && !n.has(i) && n.set(i, a);
|
|
68
|
+
}, o = I([e]);
|
|
69
|
+
return f([e.itemDefinition, e.drgElement], t, o), n.size ? Object.fromEntries(n) : undefined;
|
|
70
|
+
};
|
|
71
|
+
var A = (e) => {
|
|
72
|
+
let n = new Set, t = (s) => {
|
|
73
|
+
let r2 = s;
|
|
74
|
+
for (let i = 2;n.has(r2); i++)
|
|
75
|
+
r2 = `${s}#${i}`;
|
|
76
|
+
return n.add(r2), r2;
|
|
77
|
+
}, o = (s, r2) => {
|
|
78
|
+
let i = s["@_id"] || t(r2), a = s.itemComponent?.map((l) => o(l, `${i}/${l["@_name"]}`)), p = m(s), c = m(s.typeRef);
|
|
79
|
+
return { id: i, name: s["@_name"] ?? "", isCollection: s["@_isCollection"] === true, typeRef: s.typeRef?.__$$text, allowedValues: s.allowedValues?.text?.__$$text, ...a?.length ? { components: a } : {}, ...p ? { namespaces: p } : {}, ...c ? { typeRefNamespaces: c } : {} };
|
|
80
|
+
};
|
|
81
|
+
return e.itemDefinition?.map((s) => o(s, `itemDefinition/${s["@_name"]}`));
|
|
82
|
+
};
|
|
83
|
+
var Q = (e) => ({ itemDefinitions: A(e), namespace: e["@_namespace"], namespaces: k(e) });
|
|
84
|
+
var j = (e) => ("inputExpression" in e) ? e.inputExpression?.text?.__$$text?.trim() : undefined;
|
|
85
|
+
var q = (e, n) => {
|
|
86
|
+
let t = e.drgElement ?? [], o = new Set(t.flatMap((r2) => {
|
|
87
|
+
if (r2.__$$element !== "inputData")
|
|
88
|
+
return [];
|
|
89
|
+
let i = (r2.variable?.["@_name"]?.trim() || r2["@_name"]?.trim()) ?? "";
|
|
90
|
+
return i ? [i] : [];
|
|
91
|
+
})), s = (r2) => o.has(j(r2) ?? "");
|
|
92
|
+
return M(e, t.filter((r2) => r2 !== n && r2.__$$element !== "inputData"), s);
|
|
93
|
+
};
|
|
94
|
+
var C = /^([\p{L}_][\p{L}\p{N}_.-]*):(.+)$/u;
|
|
95
|
+
var L = /^https?:\/\/www\.omg\.org\/spec\/(?:FEEL\/\d{8}|DMN\/\d{8}\/FEEL)\/?$/;
|
|
96
|
+
var y = (e, n) => n.find((t) => Object.prototype.hasOwnProperty.call(t, e))?.[e];
|
|
97
|
+
var I = (e) => e.flatMap((n) => {
|
|
98
|
+
let t = m(n);
|
|
99
|
+
return t ? [t] : [];
|
|
100
|
+
});
|
|
101
|
+
var F = new Map;
|
|
102
|
+
var b = new WeakMap;
|
|
103
|
+
var N = (e) => {
|
|
104
|
+
if (!e)
|
|
105
|
+
return F;
|
|
106
|
+
let n = b.get(e);
|
|
107
|
+
if (!n) {
|
|
108
|
+
let t = new Map;
|
|
109
|
+
for (let o of e)
|
|
110
|
+
t.has(o.name) || t.set(o.name, o);
|
|
111
|
+
n = t, b.set(e, n);
|
|
112
|
+
}
|
|
113
|
+
return n;
|
|
114
|
+
};
|
|
115
|
+
var d = (e, n, t) => {
|
|
116
|
+
let o = C.exec(e);
|
|
117
|
+
if (!o)
|
|
118
|
+
return { name: e, space: "local" };
|
|
119
|
+
let s = y(o[1], n);
|
|
120
|
+
return s === undefined ? { name: o[2], space: "foreign" } : s === t.namespace ? { name: o[2], space: "local" } : { name: o[2], space: L.test(s) ? "feel" : "foreign" };
|
|
121
|
+
};
|
|
122
|
+
var u = (e) => e.namespaces ? [e.namespaces] : [];
|
|
123
|
+
var g = (e, n) => {
|
|
124
|
+
let t = e.namespaces ? [e.namespaces, ...n] : n;
|
|
125
|
+
return { scope: t, typeRefScope: e.typeRefNamespaces ? [e.typeRefNamespaces, ...t] : t };
|
|
126
|
+
};
|
|
127
|
+
var G = (e, n) => {
|
|
128
|
+
if (n.typeRef === undefined)
|
|
129
|
+
return;
|
|
130
|
+
let { name: t, space: o } = d(n.typeRef, g(n, u(e)).typeRefScope, e);
|
|
131
|
+
return o === "local" ? N(e.itemDefinitions).get(t) : undefined;
|
|
132
|
+
};
|
|
133
|
+
var H = (e, n) => {
|
|
134
|
+
let { name: t, space: o } = d(n, u(e), e);
|
|
135
|
+
return o === "local" ? t : undefined;
|
|
136
|
+
};
|
|
137
|
+
var E = (e, n, t, o = [], s = t) => {
|
|
138
|
+
let r2 = N(e.itemDefinitions);
|
|
139
|
+
for (;; ) {
|
|
140
|
+
let i = o.some((D) => D.isCollection);
|
|
141
|
+
if (n === undefined || o[o.length - 1]?.components?.length)
|
|
142
|
+
return { chain: o, scope: s, isCollection: i };
|
|
143
|
+
let { name: a, space: p } = d(n, t, e);
|
|
144
|
+
if (p === "foreign")
|
|
145
|
+
return { chain: o, scope: s, isCollection: i, foreign: true };
|
|
146
|
+
let c = p === "local" ? r2.get(a) : undefined, l = c ? o.indexOf(c) : -1;
|
|
147
|
+
if (l >= 0 && o.slice(l).some((D) => D.isCollection))
|
|
148
|
+
return { chain: o, scope: s, isCollection: i, recursive: true };
|
|
149
|
+
if (!c || l >= 0)
|
|
150
|
+
return { chain: o, scope: s, isCollection: i, baseTypeRef: R(a) };
|
|
151
|
+
o.push(c), { scope: s, typeRefScope: t } = g(c, u(e)), n = c.typeRef;
|
|
152
|
+
}
|
|
153
|
+
};
|
|
154
|
+
var P = (e, n, t) => {
|
|
155
|
+
let { scope: o, typeRefScope: s } = g(e, n);
|
|
156
|
+
return E(t, e.typeRef, s, [e], o);
|
|
157
|
+
};
|
|
158
|
+
var h = ({ scope: e, ...n }, t, o) => {
|
|
159
|
+
let s = n.chain[n.chain.length - 1];
|
|
160
|
+
if (!s?.components?.length)
|
|
161
|
+
return n;
|
|
162
|
+
if (o.has(s))
|
|
163
|
+
return { ...n, recursive: true };
|
|
164
|
+
let r2 = new Set(o).add(s), i = s.components.map((a) => ({ id: a.id, name: a.name, type: h(P(a, e, t), t, r2) }));
|
|
165
|
+
return { ...n, components: i };
|
|
166
|
+
};
|
|
167
|
+
var v = (e, n, t) => E(e, n, [...t, ...u(e)]);
|
|
168
|
+
var J = (e, n, t = []) => h(v(e, n, t), e, new Set);
|
|
169
|
+
var X = (e, n, t = []) => {
|
|
170
|
+
let { scope: o, ...s } = v(e, n, t);
|
|
171
|
+
return s;
|
|
172
|
+
};
|
|
173
|
+
|
|
174
|
+
export { x, R, z, B, U, K, m, A, Q, j, q, y, I, G, H, J, X };
|
|
175
|
+
|
|
176
|
+
//# debugId=00FEE077F698C1F564756E2164756E21
|
package/dist/tool.js
CHANGED
package/package.json
CHANGED
|
@@ -2,7 +2,7 @@
|
|
|
2
2
|
"name": "@uipath/rules-tool",
|
|
3
3
|
"author": "UiPath",
|
|
4
4
|
"license": "SEE LICENSE IN LICENSE.txt",
|
|
5
|
-
"version": "1.
|
|
5
|
+
"version": "1.205.0-preview.258",
|
|
6
6
|
"description": "Create and manage UiPath Business Rules (DMN) projects.",
|
|
7
7
|
"private": false,
|
|
8
8
|
"repository": {
|
|
@@ -27,5 +27,5 @@
|
|
|
27
27
|
"files": [
|
|
28
28
|
"dist"
|
|
29
29
|
],
|
|
30
|
-
"gitHead": "
|
|
30
|
+
"gitHead": "8f629ee9fa89abf94f197436a60cb3b9620f8b27"
|
|
31
31
|
}
|