@uipath/rules-tool 1.204.0-preview.249 → 1.204.0-preview.254

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.
Files changed (154) hide show
  1. package/dist/DmnFactory-VWZOSZHH-jkpbxz3n.js +42 -0
  2. package/dist/DmnModelTypes-ATR7FVKZ-jp35cecy.js +18 -0
  3. package/dist/KieDmnMarshaller-6TTUU5B4-47q50gk4.js +20 -0
  4. package/dist/THIRD-PARTY-NOTICES.md +1085 -0
  5. package/dist/business-rules-bnr581tz.js +26 -0
  6. package/dist/{constants-za5vbzp8.js → constants-9pa118cj.js} +17 -10
  7. package/dist/{embedded-file-reader-wmsg31a8.js → embedded-file-reader-rf2g1kfj.js} +4 -1
  8. package/dist/first-party-service-sd8yaf73.js +27 -0
  9. package/dist/hitPolicyResult-4WDHTX4A-gk103w84.js +33 -0
  10. package/dist/index-2hzp9b97.js +116 -0
  11. package/dist/index-34pj9f36.js +48 -0
  12. package/dist/{index-zdwhfpt1.js → index-4c4exdzw.js} +370 -406
  13. package/dist/index-dqa169gp.js +25 -0
  14. package/dist/{index-we6zjs66.js → index-fs1nd5ap.js} +40 -4
  15. package/dist/{index-nzr4mx5p.js → index-sby22td6.js} +22 -2
  16. package/dist/{index-7wc0g78k.js → index-t4mx1a5e.js} +5 -2
  17. package/dist/index.js +9 -8
  18. package/dist/{jmespath-ab6tdc42.js → jmespath-231m3hyn.js} +1 -1
  19. package/dist/{js-yaml-a2bk27p6.js → js-yaml-88tdqrtd.js} +3 -1
  20. package/dist/rule-catalog-5gzpe93c.js +46 -0
  21. package/dist/rules-command-error-20gp2dv9.js +14 -0
  22. package/dist/{rules-debug-service-h1ahd6p3.js → rules-debug-service-yvh448xp.js} +36 -35
  23. package/dist/{rules-init-service-y678kjje.js → rules-init-service-ewahc0vh.js} +16 -12
  24. package/dist/{rules-refresh-service-btn64j8j.js → rules-refresh-service-jgk2kq9d.js} +14 -13
  25. package/dist/{rules-validate-service-sppr4x13.js → rules-validate-service-mr2fk58k.js} +13 -10
  26. package/dist/{tool-97x3zjcm.js → tool-19b4ect0.js} +158 -113
  27. package/dist/{tool-epsr41wx.js → tool-1de529jm.js} +3 -12
  28. package/dist/{tool-7xmarr97.js → tool-2cky8jwp.js} +2578 -1777
  29. package/dist/{tool-x67kek1m.js → tool-2qj74g14.js} +12 -652
  30. package/dist/{tool-0bthsb3x.js → tool-4dfpdepw.js} +15 -15
  31. package/dist/tool-53w8skv5.js +262 -0
  32. package/dist/tool-7haj67tr.js +19 -0
  33. package/dist/{tool-e1mmqsjr.js → tool-8h4er38s.js} +411 -396
  34. package/dist/{tool-2trg1fpx.js → tool-8qy8pkp4.js} +8 -8
  35. package/dist/tool-av4mmsef.js +73 -0
  36. package/dist/{tool-6sqt4zrx.js → tool-cgmy94zt.js} +32 -29
  37. package/dist/{tool-8j9f6ns5.js → tool-eymjx05p.js} +11 -11
  38. package/dist/{tool-mm1x18d6.js → tool-gdtpsdn7.js} +28 -223
  39. package/dist/tool-m41px07w.js +49 -0
  40. package/dist/{tool-k2s349kn.js → tool-mkn83w88.js} +17 -14
  41. package/dist/tool-pm3ewdxc.js +1115 -0
  42. package/dist/{tool-6rp0gx98.js → tool-tkcx6png.js} +107 -127
  43. package/dist/{tool-1dycs173.js → tool-wmh645tm.js} +202 -194
  44. package/dist/tool.js +8 -7
  45. package/package.json +2 -15
  46. package/dist/DmnFactory-SG3RP3T3-cr8e7mxz.js +0 -8
  47. package/dist/DmnFactory-VWZOSZHH-azx0zqcn.js +0 -8
  48. package/dist/DmnModelTypes-ATR7FVKZ-vkv7n0jn.js +0 -8
  49. package/dist/KieDmnMarshaller-6TTUU5B4-rsxhvw7a.js +0 -8
  50. package/dist/business-rules-d51977r1.js +0 -25
  51. package/dist/business-rules-dekge24t.js +0 -23
  52. package/dist/business-rules-ew76mbwg.js +0 -25
  53. package/dist/business-rules-jmwx05k2.js +0 -25
  54. package/dist/business-rules-zpzqxyce.js +0 -26
  55. package/dist/constants-4r8pfr16.js +0 -22
  56. package/dist/embedded-file-reader-0228j82a.js +0 -111
  57. package/dist/first-party-service-1qa6cp4d.js +0 -8
  58. package/dist/first-party-service-28dkctkz.js +0 -8
  59. package/dist/first-party-service-4fsz3cnj.js +0 -8
  60. package/dist/first-party-service-ahcc6xc6.js +0 -8
  61. package/dist/first-party-service-y1ccmsvp.js +0 -8
  62. package/dist/first-party-service-zpr1q3nd.js +0 -8
  63. package/dist/hitPolicyResult-4WDHTX4A-dbtkgpqp.js +0 -12
  64. package/dist/index-2zxy6zgp.js +0 -23
  65. package/dist/index-3nx77wfh.js +0 -23
  66. package/dist/index-43zg1wqe.js +0 -19621
  67. package/dist/index-47jera73.js +0 -23
  68. package/dist/index-70jn7cz1.js +0 -19631
  69. package/dist/index-8kb5kc5y.js +0 -24
  70. package/dist/index-97yad7ms.js +0 -8
  71. package/dist/index-dfn83hxf.js +0 -14
  72. package/dist/index-e301h23h.js +0 -24
  73. package/dist/index-frd259yv.js +0 -24
  74. package/dist/index-gc7cw2jh.js +0 -23
  75. package/dist/index-gya2v502.js +0 -8
  76. package/dist/index-hb3gk1wf.js +0 -24
  77. package/dist/index-nsnfdqd5.js +0 -24
  78. package/dist/index-vffktc0w.js +0 -166
  79. package/dist/index-xymrydfw.js +0 -3095
  80. package/dist/index-z2qk2qn6.js +0 -24
  81. package/dist/index-zecwgvg7.js +0 -23
  82. package/dist/rule-catalog-a5w86qns.js +0 -43
  83. package/dist/rule-catalog-etpf962f.js +0 -69
  84. package/dist/rule-catalog-q5cr17hf.js +0 -58
  85. package/dist/rule-catalog-vc98yg4n.js +0 -43
  86. package/dist/rule-catalog-z3h66kh5.js +0 -56
  87. package/dist/rules-command-error-10qmb5w7.js +0 -13
  88. package/dist/rules-command-error-5bdv4bcx.js +0 -13
  89. package/dist/rules-command-error-cmssf0w4.js +0 -13
  90. package/dist/rules-command-error-fsm3b1mv.js +0 -13
  91. package/dist/rules-debug-service-5rcdh3pj.js +0 -192
  92. package/dist/rules-debug-service-8q7mkd0r.js +0 -199
  93. package/dist/rules-debug-service-b9j29ejz.js +0 -192
  94. package/dist/rules-debug-service-v3jr3r1n.js +0 -192
  95. package/dist/rules-init-service-3c2yfa7p.js +0 -687
  96. package/dist/rules-init-service-3wgd9cqp.js +0 -100
  97. package/dist/rules-init-service-8fqytxq0.js +0 -685
  98. package/dist/rules-init-service-pspt7sje.js +0 -100
  99. package/dist/rules-init-service-sbtzw93j.js +0 -102
  100. package/dist/rules-init-service-x7paqa63.js +0 -687
  101. package/dist/rules-init-service-y7qzmxx0.js +0 -102
  102. package/dist/rules-refresh-service-4xxj6ex6.js +0 -65
  103. package/dist/rules-refresh-service-ba5jk1y9.js +0 -65
  104. package/dist/rules-refresh-service-qkmphj53.js +0 -65
  105. package/dist/rules-validate-service-dmgnfne7.js +0 -60
  106. package/dist/rules-validate-service-hk2d006t.js +0 -60
  107. package/dist/rules-validate-service-xp05n2d9.js +0 -60
  108. package/dist/tool-1pkqxwwd.js +0 -17472
  109. package/dist/tool-24mr6g8c.js +0 -1556
  110. package/dist/tool-39fmkx2d.js +0 -611
  111. package/dist/tool-3e2q1x2y.js +0 -6578
  112. package/dist/tool-3j0747gg.js +0 -17077
  113. package/dist/tool-4z7zcq4z.js +0 -6058
  114. package/dist/tool-56smnjrh.js +0 -73
  115. package/dist/tool-5qygptrc.js +0 -6171
  116. package/dist/tool-5xx6x8pe.js +0 -6596
  117. package/dist/tool-7fkrd618.js +0 -1556
  118. package/dist/tool-89xzeteg.js +0 -361
  119. package/dist/tool-911s9czz.js +0 -570
  120. package/dist/tool-9bz2x04j.js +0 -40
  121. package/dist/tool-akh7nnqs.js +0 -704
  122. package/dist/tool-axfzew45.js +0 -1555
  123. package/dist/tool-b71jq9pt.js +0 -389
  124. package/dist/tool-bfj846v8.js +0 -141
  125. package/dist/tool-bvmc017m.js +0 -96
  126. package/dist/tool-bykz5ryf.js +0 -454
  127. package/dist/tool-c76qb8ap.js +0 -17052
  128. package/dist/tool-ca15515v.js +0 -570
  129. package/dist/tool-f9qs255w.js +0 -70
  130. package/dist/tool-ga79rety.js +0 -389
  131. package/dist/tool-gb547mcn.js +0 -141
  132. package/dist/tool-gta9rr4h.js +0 -68
  133. package/dist/tool-h2dfnxdq.js +0 -6486
  134. package/dist/tool-hg6vr5y9.js +0 -3769
  135. package/dist/tool-hgvnm4vh.js +0 -1843
  136. package/dist/tool-hjbf9aay.js +0 -571
  137. package/dist/tool-k5jm64n3.js +0 -5650
  138. package/dist/tool-ketztpgf.js +0 -73
  139. package/dist/tool-n1d88ryb.js +0 -6396
  140. package/dist/tool-nmqpwh9m.js +0 -6166
  141. package/dist/tool-pb80pswx.js +0 -73
  142. package/dist/tool-pcsgwpfw.js +0 -40
  143. package/dist/tool-q3c1bjyb.js +0 -454
  144. package/dist/tool-rwp1skmf.js +0 -40
  145. package/dist/tool-s3fbt22r.js +0 -454
  146. package/dist/tool-tmbst1r8.js +0 -68
  147. package/dist/tool-v6w109p0.js +0 -455
  148. package/dist/tool-w2js05qv.js +0 -389
  149. package/dist/tool-x89947ah.js +0 -17052
  150. package/dist/tool-xhksjdka.js +0 -4005
  151. package/dist/tool-yv3t4gg5.js +0 -108
  152. package/dist/tool-zbyb1ttx.js +0 -5650
  153. /package/dist/{tool-fbqnqf9k.js → tool-jd313s2x.js} +0 -0
  154. /package/dist/{tool-vyx8fpft.js → tool-qgqscsjc.js} +0 -0
@@ -1,85 +1,46 @@
1
1
  import {
2
- trackVariables,
3
- parser,
4
- b,
5
- x,
6
- w,
7
- B
8
- } from "./tool-1dycs173.js";
2
+ c,
3
+ g
4
+ } from "./tool-m41px07w.js";
5
+ import {
6
+ $,
7
+ R as R2,
8
+ Yt,
9
+ _,
10
+ tt
11
+ } from "./tool-19b4ect0.js";
9
12
  import {
10
13
  bs
11
- } from "./tool-e1mmqsjr.js";
14
+ } from "./tool-8h4er38s.js";
12
15
  import {
13
- R,
14
- _,
15
- $,
16
- tt,
17
- Yt
18
- } from "./tool-97x3zjcm.js";
16
+ B,
17
+ b,
18
+ parser,
19
+ trackVariables,
20
+ w,
21
+ x
22
+ } from "./tool-wmh645tm.js";
19
23
  import {
20
- s2,
21
- y,
22
- R2,
23
- h,
24
24
  A,
25
- p,
26
- b2,
27
- O,
28
25
  I,
29
- m2,
26
+ M,
27
+ O,
30
28
  P,
31
- M
32
- } from "./tool-0bthsb3x.js";
29
+ R,
30
+ b as b2,
31
+ h,
32
+ m,
33
+ p,
34
+ s,
35
+ y
36
+ } from "./tool-4dfpdepw.js";
33
37
  import {
34
38
  e,
35
39
  r
36
- } from "./tool-fbqnqf9k.js";
37
-
38
- // ../../node_modules/@uipath/dmn-editor-utils/dist/chunks/chunk-RAUOUCZL.js
39
- var u = String.raw`\"`;
40
- var o = (e) => e.length >= 2 && e.startsWith('"') && e.endsWith('"');
41
- var d = (e) => {
42
- if (!o(e))
43
- return e;
44
- try {
45
- let n = JSON.parse(e);
46
- return typeof n == "string" ? n : e;
47
- } catch {
48
- return e.slice(1, -1).replaceAll(u, '"');
49
- }
50
- };
51
- var l = (e) => {
52
- let n = [], s = "", t = false;
53
- for (let r = 0;r < e.length; r += 1) {
54
- let i = e[r];
55
- if (t && i === "\\" && r + 1 < e.length) {
56
- s += i + e[r + 1], r += 1;
57
- continue;
58
- }
59
- if (i === '"' && (t = !t), i === "," && !t) {
60
- n.push(s), s = "";
61
- continue;
62
- }
63
- s += i;
64
- }
65
- return n.push(s), n;
66
- };
67
- var c = (e) => l(e).map((n) => n.trim()).filter((n) => n.length > 0).map(d);
68
- var g = (e, n) => {
69
- let s = l(e.text).map((t) => t.trim()).filter(Boolean);
70
- if (s.length === 0)
71
- return false;
72
- switch (n ?? "string") {
73
- case "string":
74
- return s.every(o);
75
- case "number":
76
- return s.every((t) => /^-?(?:0|[1-9]\d*)(?:\.\d+)?(?:[eE][+-]?\d+)?$/.test(t));
77
- case "boolean":
78
- return s.every((t) => t === "true" || t === "false");
79
- default:
80
- return false;
81
- }
82
- };
40
+ } from "./tool-jd313s2x.js";
41
+ import"./tool-qgqscsjc.js";
42
+ import"./tool-7haj67tr.js";
43
+ import"./tool-1de529jm.js";
83
44
 
84
45
  // ../../node_modules/@bpmn-io/feel-analyzer/dist/index.js
85
46
  function stripBackticks(text) {
@@ -217,7 +178,7 @@ function buildNestedEntries(variables, pathParts) {
217
178
  }
218
179
  function sortEntries(variable) {
219
180
  if (variable.entries) {
220
- variable.entries.sort((a, b) => a.name.localeCompare(b.name));
181
+ variable.entries.sort((a, b3) => a.name.localeCompare(b3.name));
221
182
  for (const entry of variable.entries) {
222
183
  sortEntries(entry);
223
184
  }
@@ -230,20 +191,20 @@ function extractInputNames(node, source, builtinNames) {
230
191
  function isExternal(name, filterCtx) {
231
192
  return !isInScope(name, localScopes) && !builtinNames.has(name) && !(filterCtx !== "none" && name === "item");
232
193
  }
233
- const collectInputs = (node, filterCtx = "none") => {
234
- const { name: nodeName } = node;
235
- if (node.type.isError) {
194
+ const collectInputs = (node2, filterCtx = "none") => {
195
+ const { name: nodeName } = node2;
196
+ if (node2.type.isError) {
236
197
  return;
237
198
  }
238
199
  if (nodeName === "FunctionInvocation") {
239
- const funcNameNode = node.getChild("VariableName");
200
+ const funcNameNode = node2.getChild("VariableName");
240
201
  if (funcNameNode) {
241
202
  const funcName = nodeText(funcNameNode, source);
242
203
  if (isExternal(funcName, filterCtx)) {
243
204
  inputs.add(funcName);
244
205
  }
245
206
  }
246
- forEachChild(node, (child) => {
207
+ forEachChild(node2, (child) => {
247
208
  if (child.name !== "VariableName" && child.name !== "(" && child.name !== ")") {
248
209
  collectInputs(child, filterCtx);
249
210
  }
@@ -251,30 +212,30 @@ function extractInputNames(node, source, builtinNames) {
251
212
  return;
252
213
  }
253
214
  if (nodeName === "PathExpression") {
254
- const filterBase = getFilterBase(node);
255
- if (hasContextBase(node)) {
256
- forEachChild(node, (child) => collectInputs(child, filterCtx));
215
+ const filterBase = getFilterBase(node2);
216
+ if (hasContextBase(node2)) {
217
+ forEachChild(node2, (child) => collectInputs(child, filterCtx));
257
218
  } else if (filterBase) {
258
219
  collectInputs(filterBase, filterCtx);
259
220
  } else {
260
- const pathParts = collectPathParts(node, source);
221
+ const pathParts = collectPathParts(node2, source);
261
222
  if (pathParts.length > 0 && isExternal(pathParts[0], filterCtx)) {
262
223
  inputs.add(pathParts.join("."));
263
224
  }
264
225
  }
265
226
  return;
266
227
  }
267
- if (nodeName === "VariableName" && node.parent?.name !== "PathExpression" && node.parent?.name !== "FunctionInvocation") {
268
- const varName = nodeText(node, source);
228
+ if (nodeName === "VariableName" && node2.parent?.name !== "PathExpression" && node2.parent?.name !== "FunctionInvocation") {
229
+ const varName = nodeText(node2, source);
269
230
  const isImplicitFilterProp = filterCtx === "variable-list" && varName !== "item";
270
231
  if (isExternal(varName, filterCtx) && !isImplicitFilterProp) {
271
232
  inputs.add(varName);
272
233
  }
273
234
  return;
274
235
  }
275
- if (nodeName === "Context" && node.parent?.name !== "List") {
236
+ if (nodeName === "Context" && node2.parent?.name !== "List") {
276
237
  withScope(localScopes, [], (scope) => {
277
- forEachChild(node, (child) => {
238
+ forEachChild(node2, (child) => {
278
239
  if (child.name === "ContextEntry") {
279
240
  forEachChild(child, (entryChild) => {
280
241
  if (entryChild.name !== "Key")
@@ -291,7 +252,7 @@ function extractInputNames(node, source, builtinNames) {
291
252
  if (nodeName === "FilterExpression") {
292
253
  let newFilterCtx = "none";
293
254
  const scopeNames = ["item"];
294
- const listNode = node.getChild("List");
255
+ const listNode = node2.getChild("List");
295
256
  if (listNode) {
296
257
  forEachChild(listNode, (child) => {
297
258
  if (child.name === "Context") {
@@ -300,7 +261,7 @@ function extractInputNames(node, source, builtinNames) {
300
261
  });
301
262
  newFilterCtx = "list-literal";
302
263
  } else {
303
- forEachChild(node, (child) => {
264
+ forEachChild(node2, (child) => {
304
265
  if (child.name === "VariableName") {
305
266
  collectInputs(child, "none");
306
267
  newFilterCtx = "variable-list";
@@ -308,7 +269,7 @@ function extractInputNames(node, source, builtinNames) {
308
269
  });
309
270
  }
310
271
  withScope(localScopes, scopeNames, () => {
311
- forEachChild(node, (child) => {
272
+ forEachChild(node2, (child) => {
312
273
  if (child.name === "Comparison" || child.name === "Expression") {
313
274
  collectInputs(child, newFilterCtx);
314
275
  }
@@ -317,8 +278,8 @@ function extractInputNames(node, source, builtinNames) {
317
278
  return;
318
279
  }
319
280
  if (nodeName === "ForExpression" || nodeName === "QuantifiedExpression") {
320
- const iterVars = collectIterationVariables(node, source);
321
- const inExp = node.getChild("InExpressions");
281
+ const iterVars = collectIterationVariables(node2, source);
282
+ const inExp = node2.getChild("InExpressions");
322
283
  if (inExp) {
323
284
  forEachChild(inExp, (child) => {
324
285
  if (child.name === "InExpression") {
@@ -331,7 +292,7 @@ function extractInputNames(node, source, builtinNames) {
331
292
  });
332
293
  }
333
294
  withScope(localScopes, iterVars, () => {
334
- forEachChild(node, (child) => {
295
+ forEachChild(node2, (child) => {
335
296
  if (!ITERATION_KEYWORDS$1.has(child.name)) {
336
297
  collectInputs(child, "none");
337
298
  }
@@ -340,15 +301,15 @@ function extractInputNames(node, source, builtinNames) {
340
301
  return;
341
302
  }
342
303
  if (nodeName === "FunctionDefinition") {
343
- const params = collectFunctionParameters(node, source);
304
+ const params = collectFunctionParameters(node2, source);
344
305
  withScope(localScopes, params, () => {
345
- const body = node.getChild("FunctionBody");
306
+ const body = node2.getChild("FunctionBody");
346
307
  if (body)
347
308
  collectInputs(body, "none");
348
309
  });
349
310
  return;
350
311
  }
351
- forEachChild(node, (child) => collectInputs(child, filterCtx));
312
+ forEachChild(node2, (child) => collectInputs(child, filterCtx));
352
313
  };
353
314
  collectInputs(node);
354
315
  return Array.from(inputs).sort();
@@ -402,11 +363,11 @@ function trackFilterItemProperties(node, source, listVarName, inputs, localScope
402
363
  const listVar = listVarName ? findVariable(inputs, listVarName) : null;
403
364
  if (!listVar)
404
365
  return;
405
- const visit = (node) => {
366
+ const visit = (node2) => {
406
367
  if (listVar.type !== "List")
407
368
  return;
408
- if (node.name === "PathExpression") {
409
- const pathParts = collectPathParts(node, source);
369
+ if (node2.name === "PathExpression") {
370
+ const pathParts = collectPathParts(node2, source);
410
371
  if (pathParts.length > 1 && pathParts[0] === "item") {
411
372
  const entries = listVar.entries || [];
412
373
  for (let i = 1;i < pathParts.length; i++) {
@@ -416,9 +377,9 @@ function trackFilterItemProperties(node, source, listVarName, inputs, localScope
416
377
  }
417
378
  listVar.entries = entries;
418
379
  }
419
- } else if (node.name === "VariableName") {
420
- const varName = nodeText(node, source);
421
- if (!isInScope(varName, localScopes) && varName !== "item" && node.parent?.name !== "PathExpression") {
380
+ } else if (node2.name === "VariableName") {
381
+ const varName = nodeText(node2, source);
382
+ if (!isInScope(varName, localScopes) && varName !== "item" && node2.parent?.name !== "PathExpression") {
422
383
  const entries = listVar.entries || [];
423
384
  if (!findVariable(entries, varName)) {
424
385
  entries.push({ name: varName });
@@ -426,7 +387,7 @@ function trackFilterItemProperties(node, source, listVarName, inputs, localScope
426
387
  listVar.entries = entries;
427
388
  }
428
389
  }
429
- forEachChild(node, visit);
390
+ forEachChild(node2, visit);
430
391
  };
431
392
  visit(node);
432
393
  }
@@ -586,7 +547,7 @@ function analyzeForInputs(node, source, builtinNames) {
586
547
  for (const variable of inputs) {
587
548
  sortEntries(variable);
588
549
  }
589
- inputs.sort((a, b) => a.name.localeCompare(b.name));
550
+ inputs.sort((a, b3) => a.name.localeCompare(b3.name));
590
551
  return inputs;
591
552
  }
592
553
  var ITERATION_KEYWORDS = new Set(["for", "return", "some", "every", "InExpressions", "satisfies"]);
@@ -655,7 +616,7 @@ function analyzeForFunctions(node, source, builtinNames) {
655
616
  forEachChild(n, walk);
656
617
  };
657
618
  walk(node);
658
- return functions.sort((a, b) => a.from - b.from);
619
+ return functions.sort((a, b3) => a.from - b3.from);
659
620
  }
660
621
  function analyzeForValidity(node) {
661
622
  return !containsErrorNodes(node);
@@ -682,7 +643,7 @@ function createContext(variables) {
682
643
 
683
644
  class FeelAnalyzer {
684
645
  constructor(options = {}) {
685
- this.builtinNames = new Set(options.builtins?.map((b) => b.name) ?? []);
646
+ this.builtinNames = new Set(options.builtins?.map((b3) => b3.name) ?? []);
686
647
  const config = {
687
648
  top: options.dialect === "unaryTests" ? "UnaryTests" : "Expression",
688
649
  dialect: options.parserDialect
@@ -763,12 +724,12 @@ function requireRe() {
763
724
  } = requireConstants();
764
725
  const debug = requireDebug();
765
726
  exports$1 = module.exports = {};
766
- const re = exports$1.re = [];
727
+ const re2 = exports$1.re = [];
767
728
  const safeRe = exports$1.safeRe = [];
768
729
  const src = exports$1.src = [];
769
730
  const safeSrc = exports$1.safeSrc = [];
770
731
  const t = exports$1.t = {};
771
- let R = 0;
732
+ let R3 = 0;
772
733
  const LETTERDASHNUMBER = "[a-zA-Z0-9-]";
773
734
  const safeRegexReplacements = [
774
735
  ["\\s", 1],
@@ -783,12 +744,12 @@ function requireRe() {
783
744
  };
784
745
  const createToken = (name, value, isGlobal) => {
785
746
  const safe = makeSafeRegex(value);
786
- const index = R++;
747
+ const index = R3++;
787
748
  debug(name, index, value);
788
749
  t[name] = index;
789
750
  src[index] = value;
790
751
  safeSrc[index] = safe;
791
- re[index] = new RegExp(value, isGlobal ? "g" : undefined);
752
+ re2[index] = new RegExp(value, isGlobal ? "g" : undefined);
792
753
  safeRe[index] = new RegExp(safe, isGlobal ? "g" : undefined);
793
754
  };
794
755
  createToken("NUMERICIDENTIFIER", "0|[1-9]\\d*");
@@ -867,19 +828,19 @@ function requireIdentifiers() {
867
828
  return identifiers;
868
829
  hasRequiredIdentifiers = 1;
869
830
  const numeric = /^[0-9]+$/;
870
- const compareIdentifiers = (a, b) => {
871
- if (typeof a === "number" && typeof b === "number") {
872
- return a === b ? 0 : a < b ? -1 : 1;
831
+ const compareIdentifiers = (a, b3) => {
832
+ if (typeof a === "number" && typeof b3 === "number") {
833
+ return a === b3 ? 0 : a < b3 ? -1 : 1;
873
834
  }
874
835
  const anum = numeric.test(a);
875
- const bnum = numeric.test(b);
836
+ const bnum = numeric.test(b3);
876
837
  if (anum && bnum) {
877
838
  a = +a;
878
- b = +b;
839
+ b3 = +b3;
879
840
  }
880
- return a === b ? 0 : anum && !bnum ? -1 : bnum && !anum ? 1 : a < b ? -1 : 1;
841
+ return a === b3 ? 0 : anum && !bnum ? -1 : bnum && !anum ? 1 : a < b3 ? -1 : 1;
881
842
  };
882
- const rcompareIdentifiers = (a, b) => compareIdentifiers(b, a);
843
+ const rcompareIdentifiers = (a, b3) => compareIdentifiers(b3, a);
883
844
  identifiers = {
884
845
  compareIdentifiers,
885
846
  rcompareIdentifiers
@@ -894,7 +855,7 @@ function requireSemver$1() {
894
855
  hasRequiredSemver$1 = 1;
895
856
  const debug = requireDebug();
896
857
  const { MAX_LENGTH, MAX_SAFE_INTEGER } = requireConstants();
897
- const { safeRe: re, t } = requireRe();
858
+ const { safeRe: re2, t } = requireRe();
898
859
  const parseOptions = requireParseOptions();
899
860
  const { compareIdentifiers } = requireIdentifiers();
900
861
 
@@ -917,14 +878,14 @@ function requireSemver$1() {
917
878
  this.options = options;
918
879
  this.loose = !!options.loose;
919
880
  this.includePrerelease = !!options.includePrerelease;
920
- const m = version.trim().match(options.loose ? re[t.LOOSE] : re[t.FULL]);
921
- if (!m) {
881
+ const m2 = version.trim().match(options.loose ? re2[t.LOOSE] : re2[t.FULL]);
882
+ if (!m2) {
922
883
  throw new TypeError(`Invalid Version: ${version}`);
923
884
  }
924
885
  this.raw = version;
925
- this.major = +m[1];
926
- this.minor = +m[2];
927
- this.patch = +m[3];
886
+ this.major = +m2[1];
887
+ this.minor = +m2[2];
888
+ this.patch = +m2[3];
928
889
  if (this.major > MAX_SAFE_INTEGER || this.major < 0) {
929
890
  throw new TypeError("Invalid major version");
930
891
  }
@@ -934,10 +895,10 @@ function requireSemver$1() {
934
895
  if (this.patch > MAX_SAFE_INTEGER || this.patch < 0) {
935
896
  throw new TypeError("Invalid patch version");
936
897
  }
937
- if (!m[4]) {
898
+ if (!m2[4]) {
938
899
  this.prerelease = [];
939
900
  } else {
940
- this.prerelease = m[4].split(".").map((id) => {
901
+ this.prerelease = m2[4].split(".").map((id) => {
941
902
  if (/^[0-9]+$/.test(id)) {
942
903
  const num = +id;
943
904
  if (num >= 0 && num < MAX_SAFE_INTEGER) {
@@ -947,7 +908,7 @@ function requireSemver$1() {
947
908
  return id;
948
909
  });
949
910
  }
950
- this.build = m[5] ? m[5].split(".") : [];
911
+ this.build = m2[5] ? m2[5].split(".") : [];
951
912
  this.format();
952
913
  }
953
914
  format() {
@@ -1011,18 +972,18 @@ function requireSemver$1() {
1011
972
  let i = 0;
1012
973
  do {
1013
974
  const a = this.prerelease[i];
1014
- const b = other.prerelease[i];
1015
- debug("prerelease compare", i, a, b);
1016
- if (a === undefined && b === undefined) {
975
+ const b3 = other.prerelease[i];
976
+ debug("prerelease compare", i, a, b3);
977
+ if (a === undefined && b3 === undefined) {
1017
978
  return 0;
1018
- } else if (b === undefined) {
979
+ } else if (b3 === undefined) {
1019
980
  return 1;
1020
981
  } else if (a === undefined) {
1021
982
  return -1;
1022
- } else if (a === b) {
983
+ } else if (a === b3) {
1023
984
  continue;
1024
985
  } else {
1025
- return compareIdentifiers(a, b);
986
+ return compareIdentifiers(a, b3);
1026
987
  }
1027
988
  } while (++i);
1028
989
  }
@@ -1033,18 +994,18 @@ function requireSemver$1() {
1033
994
  let i = 0;
1034
995
  do {
1035
996
  const a = this.build[i];
1036
- const b = other.build[i];
1037
- debug("build compare", i, a, b);
1038
- if (a === undefined && b === undefined) {
997
+ const b3 = other.build[i];
998
+ debug("build compare", i, a, b3);
999
+ if (a === undefined && b3 === undefined) {
1039
1000
  return 0;
1040
- } else if (b === undefined) {
1001
+ } else if (b3 === undefined) {
1041
1002
  return 1;
1042
1003
  } else if (a === undefined) {
1043
1004
  return -1;
1044
- } else if (a === b) {
1005
+ } else if (a === b3) {
1045
1006
  continue;
1046
1007
  } else {
1047
- return compareIdentifiers(a, b);
1008
+ return compareIdentifiers(a, b3);
1048
1009
  }
1049
1010
  } while (++i);
1050
1011
  }
@@ -1054,7 +1015,7 @@ function requireSemver$1() {
1054
1015
  throw new Error("invalid increment argument: identifier is empty");
1055
1016
  }
1056
1017
  if (identifier) {
1057
- const match = `-${identifier}`.match(this.options.loose ? re[t.PRERELEASELOOSE] : re[t.PRERELEASE]);
1018
+ const match = `-${identifier}`.match(this.options.loose ? re2[t.PRERELEASELOOSE] : re2[t.PRERELEASE]);
1058
1019
  if (!match || match[1] !== identifier) {
1059
1020
  throw new Error(`invalid identifier: ${identifier}`);
1060
1021
  }
@@ -1204,8 +1165,8 @@ function requireClean() {
1204
1165
  hasRequiredClean = 1;
1205
1166
  const parse = requireParse();
1206
1167
  const clean = (version, options) => {
1207
- const s = parse(version.trim().replace(/^[=v]+/, ""), options);
1208
- return s ? s.version : null;
1168
+ const s2 = parse(version.trim().replace(/^[=v]+/, ""), options);
1169
+ return s2 ? s2.version : null;
1209
1170
  };
1210
1171
  clean_1 = clean;
1211
1172
  return clean_1;
@@ -1331,7 +1292,7 @@ function requireCompare() {
1331
1292
  return compare_1;
1332
1293
  hasRequiredCompare = 1;
1333
1294
  const SemVer = requireSemver$1();
1334
- const compare = (a, b, loose) => new SemVer(a, loose).compare(new SemVer(b, loose));
1295
+ const compare = (a, b3, loose) => new SemVer(a, loose).compare(new SemVer(b3, loose));
1335
1296
  compare_1 = compare;
1336
1297
  return compare_1;
1337
1298
  }
@@ -1342,7 +1303,7 @@ function requireRcompare() {
1342
1303
  return rcompare_1;
1343
1304
  hasRequiredRcompare = 1;
1344
1305
  const compare = requireCompare();
1345
- const rcompare = (a, b, loose) => compare(b, a, loose);
1306
+ const rcompare = (a, b3, loose) => compare(b3, a, loose);
1346
1307
  rcompare_1 = rcompare;
1347
1308
  return rcompare_1;
1348
1309
  }
@@ -1353,7 +1314,7 @@ function requireCompareLoose() {
1353
1314
  return compareLoose_1;
1354
1315
  hasRequiredCompareLoose = 1;
1355
1316
  const compare = requireCompare();
1356
- const compareLoose = (a, b) => compare(a, b, true);
1317
+ const compareLoose = (a, b3) => compare(a, b3, true);
1357
1318
  compareLoose_1 = compareLoose;
1358
1319
  return compareLoose_1;
1359
1320
  }
@@ -1364,9 +1325,9 @@ function requireCompareBuild() {
1364
1325
  return compareBuild_1;
1365
1326
  hasRequiredCompareBuild = 1;
1366
1327
  const SemVer = requireSemver$1();
1367
- const compareBuild = (a, b, loose) => {
1328
+ const compareBuild = (a, b3, loose) => {
1368
1329
  const versionA = new SemVer(a, loose);
1369
- const versionB = new SemVer(b, loose);
1330
+ const versionB = new SemVer(b3, loose);
1370
1331
  return versionA.compare(versionB) || versionA.compareBuild(versionB);
1371
1332
  };
1372
1333
  compareBuild_1 = compareBuild;
@@ -1379,7 +1340,7 @@ function requireSort() {
1379
1340
  return sort_1;
1380
1341
  hasRequiredSort = 1;
1381
1342
  const compareBuild = requireCompareBuild();
1382
- const sort = (list, loose) => list.sort((a, b) => compareBuild(a, b, loose));
1343
+ const sort = (list, loose) => list.sort((a, b3) => compareBuild(a, b3, loose));
1383
1344
  sort_1 = sort;
1384
1345
  return sort_1;
1385
1346
  }
@@ -1390,7 +1351,7 @@ function requireRsort() {
1390
1351
  return rsort_1;
1391
1352
  hasRequiredRsort = 1;
1392
1353
  const compareBuild = requireCompareBuild();
1393
- const rsort = (list, loose) => list.sort((a, b) => compareBuild(b, a, loose));
1354
+ const rsort = (list, loose) => list.sort((a, b3) => compareBuild(b3, a, loose));
1394
1355
  rsort_1 = rsort;
1395
1356
  return rsort_1;
1396
1357
  }
@@ -1401,7 +1362,7 @@ function requireGt() {
1401
1362
  return gt_1;
1402
1363
  hasRequiredGt = 1;
1403
1364
  const compare = requireCompare();
1404
- const gt = (a, b, loose) => compare(a, b, loose) > 0;
1365
+ const gt = (a, b3, loose) => compare(a, b3, loose) > 0;
1405
1366
  gt_1 = gt;
1406
1367
  return gt_1;
1407
1368
  }
@@ -1412,7 +1373,7 @@ function requireLt() {
1412
1373
  return lt_1;
1413
1374
  hasRequiredLt = 1;
1414
1375
  const compare = requireCompare();
1415
- const lt = (a, b, loose) => compare(a, b, loose) < 0;
1376
+ const lt = (a, b3, loose) => compare(a, b3, loose) < 0;
1416
1377
  lt_1 = lt;
1417
1378
  return lt_1;
1418
1379
  }
@@ -1423,7 +1384,7 @@ function requireEq() {
1423
1384
  return eq_1;
1424
1385
  hasRequiredEq = 1;
1425
1386
  const compare = requireCompare();
1426
- const eq = (a, b, loose) => compare(a, b, loose) === 0;
1387
+ const eq = (a, b3, loose) => compare(a, b3, loose) === 0;
1427
1388
  eq_1 = eq;
1428
1389
  return eq_1;
1429
1390
  }
@@ -1434,7 +1395,7 @@ function requireNeq() {
1434
1395
  return neq_1;
1435
1396
  hasRequiredNeq = 1;
1436
1397
  const compare = requireCompare();
1437
- const neq = (a, b, loose) => compare(a, b, loose) !== 0;
1398
+ const neq = (a, b3, loose) => compare(a, b3, loose) !== 0;
1438
1399
  neq_1 = neq;
1439
1400
  return neq_1;
1440
1401
  }
@@ -1445,7 +1406,7 @@ function requireGte() {
1445
1406
  return gte_1;
1446
1407
  hasRequiredGte = 1;
1447
1408
  const compare = requireCompare();
1448
- const gte = (a, b, loose) => compare(a, b, loose) >= 0;
1409
+ const gte = (a, b3, loose) => compare(a, b3, loose) >= 0;
1449
1410
  gte_1 = gte;
1450
1411
  return gte_1;
1451
1412
  }
@@ -1456,7 +1417,7 @@ function requireLte() {
1456
1417
  return lte_1;
1457
1418
  hasRequiredLte = 1;
1458
1419
  const compare = requireCompare();
1459
- const lte = (a, b, loose) => compare(a, b, loose) <= 0;
1420
+ const lte = (a, b3, loose) => compare(a, b3, loose) <= 0;
1460
1421
  lte_1 = lte;
1461
1422
  return lte_1;
1462
1423
  }
@@ -1472,38 +1433,38 @@ function requireCmp() {
1472
1433
  const gte = requireGte();
1473
1434
  const lt = requireLt();
1474
1435
  const lte = requireLte();
1475
- const cmp = (a, op, b, loose) => {
1436
+ const cmp = (a, op, b3, loose) => {
1476
1437
  switch (op) {
1477
1438
  case "===":
1478
1439
  if (typeof a === "object") {
1479
1440
  a = a.version;
1480
1441
  }
1481
- if (typeof b === "object") {
1482
- b = b.version;
1442
+ if (typeof b3 === "object") {
1443
+ b3 = b3.version;
1483
1444
  }
1484
- return a === b;
1445
+ return a === b3;
1485
1446
  case "!==":
1486
1447
  if (typeof a === "object") {
1487
1448
  a = a.version;
1488
1449
  }
1489
- if (typeof b === "object") {
1490
- b = b.version;
1450
+ if (typeof b3 === "object") {
1451
+ b3 = b3.version;
1491
1452
  }
1492
- return a !== b;
1453
+ return a !== b3;
1493
1454
  case "":
1494
1455
  case "=":
1495
1456
  case "==":
1496
- return eq(a, b, loose);
1457
+ return eq(a, b3, loose);
1497
1458
  case "!=":
1498
- return neq(a, b, loose);
1459
+ return neq(a, b3, loose);
1499
1460
  case ">":
1500
- return gt(a, b, loose);
1461
+ return gt(a, b3, loose);
1501
1462
  case ">=":
1502
- return gte(a, b, loose);
1463
+ return gte(a, b3, loose);
1503
1464
  case "<":
1504
- return lt(a, b, loose);
1465
+ return lt(a, b3, loose);
1505
1466
  case "<=":
1506
- return lte(a, b, loose);
1467
+ return lte(a, b3, loose);
1507
1468
  default:
1508
1469
  throw new TypeError(`Invalid operator: ${op}`);
1509
1470
  }
@@ -1519,7 +1480,7 @@ function requireCoerce() {
1519
1480
  hasRequiredCoerce = 1;
1520
1481
  const SemVer = requireSemver$1();
1521
1482
  const parse = requireParse();
1522
- const { safeRe: re, t } = requireRe();
1483
+ const { safeRe: re2, t } = requireRe();
1523
1484
  const coerce = (version, options) => {
1524
1485
  if (version instanceof SemVer) {
1525
1486
  return version;
@@ -1533,9 +1494,9 @@ function requireCoerce() {
1533
1494
  options = options || {};
1534
1495
  let match = null;
1535
1496
  if (!options.rtl) {
1536
- match = version.match(options.includePrerelease ? re[t.COERCEFULL] : re[t.COERCE]);
1497
+ match = version.match(options.includePrerelease ? re2[t.COERCEFULL] : re2[t.COERCE]);
1537
1498
  } else {
1538
- const coerceRtlRegex = options.includePrerelease ? re[t.COERCERTLFULL] : re[t.COERCERTL];
1499
+ const coerceRtlRegex = options.includePrerelease ? re2[t.COERCERTLFULL] : re2[t.COERCERTL];
1539
1500
  let next;
1540
1501
  while ((next = coerceRtlRegex.exec(version)) && (!match || match.index + match[0].length !== version.length)) {
1541
1502
  if (!match || next.index + next[0].length !== match.index + match[0].length) {
@@ -1607,38 +1568,38 @@ function requireRange() {
1607
1568
  const SPACE_CHARACTERS = /\s+/g;
1608
1569
 
1609
1570
  class Range {
1610
- constructor(range, options) {
1571
+ constructor(range2, options) {
1611
1572
  options = parseOptions(options);
1612
- if (range instanceof Range) {
1613
- if (range.loose === !!options.loose && range.includePrerelease === !!options.includePrerelease) {
1614
- return range;
1573
+ if (range2 instanceof Range) {
1574
+ if (range2.loose === !!options.loose && range2.includePrerelease === !!options.includePrerelease) {
1575
+ return range2;
1615
1576
  } else {
1616
- return new Range(range.raw, options);
1577
+ return new Range(range2.raw, options);
1617
1578
  }
1618
1579
  }
1619
- if (range instanceof Comparator) {
1620
- this.raw = range.value;
1621
- this.set = [[range]];
1580
+ if (range2 instanceof Comparator) {
1581
+ this.raw = range2.value;
1582
+ this.set = [[range2]];
1622
1583
  this.formatted = undefined;
1623
1584
  return this;
1624
1585
  }
1625
1586
  this.options = options;
1626
1587
  this.loose = !!options.loose;
1627
1588
  this.includePrerelease = !!options.includePrerelease;
1628
- this.raw = range.trim().replace(SPACE_CHARACTERS, " ");
1629
- this.set = this.raw.split("||").map((r) => this.parseRange(r.trim())).filter((c) => c.length);
1589
+ this.raw = range2.trim().replace(SPACE_CHARACTERS, " ");
1590
+ this.set = this.raw.split("||").map((r2) => this.parseRange(r2.trim())).filter((c2) => c2.length);
1630
1591
  if (!this.set.length) {
1631
1592
  throw new TypeError(`Invalid SemVer Range: ${this.raw}`);
1632
1593
  }
1633
1594
  if (this.set.length > 1) {
1634
1595
  const first = this.set[0];
1635
- this.set = this.set.filter((c) => !isNullSet(c[0]));
1596
+ this.set = this.set.filter((c2) => !isNullSet(c2[0]));
1636
1597
  if (this.set.length === 0) {
1637
1598
  this.set = [first];
1638
1599
  } else if (this.set.length > 1) {
1639
- for (const c of this.set) {
1640
- if (c.length === 1 && isAny(c[0])) {
1641
- this.set = [c];
1600
+ for (const c2 of this.set) {
1601
+ if (c2.length === 1 && isAny(c2[0])) {
1602
+ this.set = [c2];
1642
1603
  break;
1643
1604
  }
1644
1605
  }
@@ -1670,28 +1631,28 @@ function requireRange() {
1670
1631
  toString() {
1671
1632
  return this.range;
1672
1633
  }
1673
- parseRange(range) {
1634
+ parseRange(range2) {
1674
1635
  const memoOpts = (this.options.includePrerelease && FLAG_INCLUDE_PRERELEASE) | (this.options.loose && FLAG_LOOSE);
1675
- const memoKey = memoOpts + ":" + range;
1636
+ const memoKey = memoOpts + ":" + range2;
1676
1637
  const cached = cache.get(memoKey);
1677
1638
  if (cached) {
1678
1639
  return cached;
1679
1640
  }
1680
1641
  const loose = this.options.loose;
1681
- const hr = loose ? re[t.HYPHENRANGELOOSE] : re[t.HYPHENRANGE];
1682
- range = range.replace(hr, hyphenReplace(this.options.includePrerelease));
1683
- debug("hyphen replace", range);
1684
- range = range.replace(re[t.COMPARATORTRIM], comparatorTrimReplace);
1685
- debug("comparator trim", range);
1686
- range = range.replace(re[t.TILDETRIM], tildeTrimReplace);
1687
- debug("tilde trim", range);
1688
- range = range.replace(re[t.CARETTRIM], caretTrimReplace);
1689
- debug("caret trim", range);
1690
- let rangeList = range.split(" ").map((comp) => parseComparator(comp, this.options)).join(" ").split(/\s+/).map((comp) => replaceGTE0(comp, this.options));
1642
+ const hr = loose ? re2[t.HYPHENRANGELOOSE] : re2[t.HYPHENRANGE];
1643
+ range2 = range2.replace(hr, hyphenReplace(this.options.includePrerelease));
1644
+ debug("hyphen replace", range2);
1645
+ range2 = range2.replace(re2[t.COMPARATORTRIM], comparatorTrimReplace);
1646
+ debug("comparator trim", range2);
1647
+ range2 = range2.replace(re2[t.TILDETRIM], tildeTrimReplace);
1648
+ debug("tilde trim", range2);
1649
+ range2 = range2.replace(re2[t.CARETTRIM], caretTrimReplace);
1650
+ debug("caret trim", range2);
1651
+ let rangeList = range2.split(" ").map((comp) => parseComparator(comp, this.options)).join(" ").split(/\s+/).map((comp) => replaceGTE0(comp, this.options));
1691
1652
  if (loose) {
1692
1653
  rangeList = rangeList.filter((comp) => {
1693
1654
  debug("loose invalid filter", comp, this.options);
1694
- return !!comp.match(re[t.COMPARATORLOOSE]);
1655
+ return !!comp.match(re2[t.COMPARATORLOOSE]);
1695
1656
  });
1696
1657
  }
1697
1658
  debug("range list", rangeList);
@@ -1710,12 +1671,12 @@ function requireRange() {
1710
1671
  cache.set(memoKey, result);
1711
1672
  return result;
1712
1673
  }
1713
- intersects(range, options) {
1714
- if (!(range instanceof Range)) {
1674
+ intersects(range2, options) {
1675
+ if (!(range2 instanceof Range)) {
1715
1676
  throw new TypeError("a Range is required");
1716
1677
  }
1717
1678
  return this.set.some((thisComparators) => {
1718
- return isSatisfiable(thisComparators, options) && range.set.some((rangeComparators) => {
1679
+ return isSatisfiable(thisComparators, options) && range2.set.some((rangeComparators) => {
1719
1680
  return isSatisfiable(rangeComparators, options) && thisComparators.every((thisComparator) => {
1720
1681
  return rangeComparators.every((rangeComparator) => {
1721
1682
  return thisComparator.intersects(rangeComparator, options);
@@ -1751,15 +1712,15 @@ function requireRange() {
1751
1712
  const debug = requireDebug();
1752
1713
  const SemVer = requireSemver$1();
1753
1714
  const {
1754
- safeRe: re,
1715
+ safeRe: re2,
1755
1716
  t,
1756
1717
  comparatorTrimReplace,
1757
1718
  tildeTrimReplace,
1758
1719
  caretTrimReplace
1759
1720
  } = requireRe();
1760
1721
  const { FLAG_INCLUDE_PRERELEASE, FLAG_LOOSE } = requireConstants();
1761
- const isNullSet = (c) => c.value === "<0.0.0-0";
1762
- const isAny = (c) => c.value === "";
1722
+ const isNullSet = (c2) => c2.value === "<0.0.0-0";
1723
+ const isAny = (c2) => c2.value === "";
1763
1724
  const isSatisfiable = (comparators, options) => {
1764
1725
  let result = true;
1765
1726
  const remainingComparators = comparators.slice();
@@ -1773,7 +1734,7 @@ function requireRange() {
1773
1734
  return result;
1774
1735
  };
1775
1736
  const parseComparator = (comp, options) => {
1776
- comp = comp.replace(re[t.BUILD], "");
1737
+ comp = comp.replace(re2[t.BUILD], "");
1777
1738
  debug("comp", comp, options);
1778
1739
  comp = replaceCarets(comp, options);
1779
1740
  debug("caret", comp);
@@ -1787,70 +1748,70 @@ function requireRange() {
1787
1748
  };
1788
1749
  const isX = (id) => !id || id.toLowerCase() === "x" || id === "*";
1789
1750
  const replaceTildes = (comp, options) => {
1790
- return comp.trim().split(/\s+/).map((c) => replaceTilde(c, options)).join(" ");
1751
+ return comp.trim().split(/\s+/).map((c2) => replaceTilde(c2, options)).join(" ");
1791
1752
  };
1792
1753
  const replaceTilde = (comp, options) => {
1793
- const r = options.loose ? re[t.TILDELOOSE] : re[t.TILDE];
1794
- return comp.replace(r, (_, M, m, p, pr) => {
1795
- debug("tilde", comp, _, M, m, p, pr);
1754
+ const r2 = options.loose ? re2[t.TILDELOOSE] : re2[t.TILDE];
1755
+ return comp.replace(r2, (_2, M2, m2, p2, pr) => {
1756
+ debug("tilde", comp, _2, M2, m2, p2, pr);
1796
1757
  let ret;
1797
- if (isX(M)) {
1758
+ if (isX(M2)) {
1798
1759
  ret = "";
1799
- } else if (isX(m)) {
1800
- ret = `>=${M}.0.0 <${+M + 1}.0.0-0`;
1801
- } else if (isX(p)) {
1802
- ret = `>=${M}.${m}.0 <${M}.${+m + 1}.0-0`;
1760
+ } else if (isX(m2)) {
1761
+ ret = `>=${M2}.0.0 <${+M2 + 1}.0.0-0`;
1762
+ } else if (isX(p2)) {
1763
+ ret = `>=${M2}.${m2}.0 <${M2}.${+m2 + 1}.0-0`;
1803
1764
  } else if (pr) {
1804
1765
  debug("replaceTilde pr", pr);
1805
- ret = `>=${M}.${m}.${p}-${pr} <${M}.${+m + 1}.0-0`;
1766
+ ret = `>=${M2}.${m2}.${p2}-${pr} <${M2}.${+m2 + 1}.0-0`;
1806
1767
  } else {
1807
- ret = `>=${M}.${m}.${p} <${M}.${+m + 1}.0-0`;
1768
+ ret = `>=${M2}.${m2}.${p2} <${M2}.${+m2 + 1}.0-0`;
1808
1769
  }
1809
1770
  debug("tilde return", ret);
1810
1771
  return ret;
1811
1772
  });
1812
1773
  };
1813
1774
  const replaceCarets = (comp, options) => {
1814
- return comp.trim().split(/\s+/).map((c) => replaceCaret(c, options)).join(" ");
1775
+ return comp.trim().split(/\s+/).map((c2) => replaceCaret(c2, options)).join(" ");
1815
1776
  };
1816
1777
  const replaceCaret = (comp, options) => {
1817
1778
  debug("caret", comp, options);
1818
- const r = options.loose ? re[t.CARETLOOSE] : re[t.CARET];
1779
+ const r2 = options.loose ? re2[t.CARETLOOSE] : re2[t.CARET];
1819
1780
  const z = options.includePrerelease ? "-0" : "";
1820
- return comp.replace(r, (_, M, m, p, pr) => {
1821
- debug("caret", comp, _, M, m, p, pr);
1781
+ return comp.replace(r2, (_2, M2, m2, p2, pr) => {
1782
+ debug("caret", comp, _2, M2, m2, p2, pr);
1822
1783
  let ret;
1823
- if (isX(M)) {
1784
+ if (isX(M2)) {
1824
1785
  ret = "";
1825
- } else if (isX(m)) {
1826
- ret = `>=${M}.0.0${z} <${+M + 1}.0.0-0`;
1827
- } else if (isX(p)) {
1828
- if (M === "0") {
1829
- ret = `>=${M}.${m}.0${z} <${M}.${+m + 1}.0-0`;
1786
+ } else if (isX(m2)) {
1787
+ ret = `>=${M2}.0.0${z} <${+M2 + 1}.0.0-0`;
1788
+ } else if (isX(p2)) {
1789
+ if (M2 === "0") {
1790
+ ret = `>=${M2}.${m2}.0${z} <${M2}.${+m2 + 1}.0-0`;
1830
1791
  } else {
1831
- ret = `>=${M}.${m}.0${z} <${+M + 1}.0.0-0`;
1792
+ ret = `>=${M2}.${m2}.0${z} <${+M2 + 1}.0.0-0`;
1832
1793
  }
1833
1794
  } else if (pr) {
1834
1795
  debug("replaceCaret pr", pr);
1835
- if (M === "0") {
1836
- if (m === "0") {
1837
- ret = `>=${M}.${m}.${p}-${pr} <${M}.${m}.${+p + 1}-0`;
1796
+ if (M2 === "0") {
1797
+ if (m2 === "0") {
1798
+ ret = `>=${M2}.${m2}.${p2}-${pr} <${M2}.${m2}.${+p2 + 1}-0`;
1838
1799
  } else {
1839
- ret = `>=${M}.${m}.${p}-${pr} <${M}.${+m + 1}.0-0`;
1800
+ ret = `>=${M2}.${m2}.${p2}-${pr} <${M2}.${+m2 + 1}.0-0`;
1840
1801
  }
1841
1802
  } else {
1842
- ret = `>=${M}.${m}.${p}-${pr} <${+M + 1}.0.0-0`;
1803
+ ret = `>=${M2}.${m2}.${p2}-${pr} <${+M2 + 1}.0.0-0`;
1843
1804
  }
1844
1805
  } else {
1845
1806
  debug("no pr");
1846
- if (M === "0") {
1847
- if (m === "0") {
1848
- ret = `>=${M}.${m}.${p}${z} <${M}.${m}.${+p + 1}-0`;
1807
+ if (M2 === "0") {
1808
+ if (m2 === "0") {
1809
+ ret = `>=${M2}.${m2}.${p2}${z} <${M2}.${m2}.${+p2 + 1}-0`;
1849
1810
  } else {
1850
- ret = `>=${M}.${m}.${p}${z} <${M}.${+m + 1}.0-0`;
1811
+ ret = `>=${M2}.${m2}.${p2}${z} <${M2}.${+m2 + 1}.0-0`;
1851
1812
  }
1852
1813
  } else {
1853
- ret = `>=${M}.${m}.${p} <${+M + 1}.0.0-0`;
1814
+ ret = `>=${M2}.${m2}.${p2} <${+M2 + 1}.0.0-0`;
1854
1815
  }
1855
1816
  }
1856
1817
  debug("caret return", ret);
@@ -1859,16 +1820,16 @@ function requireRange() {
1859
1820
  };
1860
1821
  const replaceXRanges = (comp, options) => {
1861
1822
  debug("replaceXRanges", comp, options);
1862
- return comp.split(/\s+/).map((c) => replaceXRange(c, options)).join(" ");
1823
+ return comp.split(/\s+/).map((c2) => replaceXRange(c2, options)).join(" ");
1863
1824
  };
1864
1825
  const replaceXRange = (comp, options) => {
1865
1826
  comp = comp.trim();
1866
- const r = options.loose ? re[t.XRANGELOOSE] : re[t.XRANGE];
1867
- return comp.replace(r, (ret, gtlt, M, m, p, pr) => {
1868
- debug("xRange", comp, ret, gtlt, M, m, p, pr);
1869
- const xM = isX(M);
1870
- const xm = xM || isX(m);
1871
- const xp = xm || isX(p);
1827
+ const r2 = options.loose ? re2[t.XRANGELOOSE] : re2[t.XRANGE];
1828
+ return comp.replace(r2, (ret, gtlt, M2, m2, p2, pr) => {
1829
+ debug("xRange", comp, ret, gtlt, M2, m2, p2, pr);
1830
+ const xM = isX(M2);
1831
+ const xm = xM || isX(m2);
1832
+ const xp = xm || isX(p2);
1872
1833
  const anyX = xp;
1873
1834
  if (gtlt === "=" && anyX) {
1874
1835
  gtlt = "";
@@ -1882,35 +1843,35 @@ function requireRange() {
1882
1843
  }
1883
1844
  } else if (gtlt && anyX) {
1884
1845
  if (xm) {
1885
- m = 0;
1846
+ m2 = 0;
1886
1847
  }
1887
- p = 0;
1848
+ p2 = 0;
1888
1849
  if (gtlt === ">") {
1889
1850
  gtlt = ">=";
1890
1851
  if (xm) {
1891
- M = +M + 1;
1892
- m = 0;
1893
- p = 0;
1852
+ M2 = +M2 + 1;
1853
+ m2 = 0;
1854
+ p2 = 0;
1894
1855
  } else {
1895
- m = +m + 1;
1896
- p = 0;
1856
+ m2 = +m2 + 1;
1857
+ p2 = 0;
1897
1858
  }
1898
1859
  } else if (gtlt === "<=") {
1899
1860
  gtlt = "<";
1900
1861
  if (xm) {
1901
- M = +M + 1;
1862
+ M2 = +M2 + 1;
1902
1863
  } else {
1903
- m = +m + 1;
1864
+ m2 = +m2 + 1;
1904
1865
  }
1905
1866
  }
1906
1867
  if (gtlt === "<") {
1907
1868
  pr = "-0";
1908
1869
  }
1909
- ret = `${gtlt + M}.${m}.${p}${pr}`;
1870
+ ret = `${gtlt + M2}.${m2}.${p2}${pr}`;
1910
1871
  } else if (xm) {
1911
- ret = `>=${M}.0.0${pr} <${+M + 1}.0.0-0`;
1872
+ ret = `>=${M2}.0.0${pr} <${+M2 + 1}.0.0-0`;
1912
1873
  } else if (xp) {
1913
- ret = `>=${M}.${m}.0${pr} <${M}.${+m + 1}.0-0`;
1874
+ ret = `>=${M2}.${m2}.0${pr} <${M2}.${+m2 + 1}.0-0`;
1914
1875
  }
1915
1876
  debug("xRange return", ret);
1916
1877
  return ret;
@@ -1918,11 +1879,11 @@ function requireRange() {
1918
1879
  };
1919
1880
  const replaceStars = (comp, options) => {
1920
1881
  debug("replaceStars", comp, options);
1921
- return comp.trim().replace(re[t.STAR], "");
1882
+ return comp.trim().replace(re2[t.STAR], "");
1922
1883
  };
1923
1884
  const replaceGTE0 = (comp, options) => {
1924
1885
  debug("replaceGTE0", comp, options);
1925
- return comp.trim().replace(re[options.includePrerelease ? t.GTE0PRE : t.GTE0], "");
1886
+ return comp.trim().replace(re2[options.includePrerelease ? t.GTE0PRE : t.GTE0], "");
1926
1887
  };
1927
1888
  const hyphenReplace = (incPr) => ($0, from, fM, fm, fp, fpr, fb, to, tM, tm, tp, tpr) => {
1928
1889
  if (isX(fM)) {
@@ -2010,19 +1971,19 @@ function requireComparator() {
2010
1971
  debug("comp", this);
2011
1972
  }
2012
1973
  parse(comp) {
2013
- const r = this.options.loose ? re[t.COMPARATORLOOSE] : re[t.COMPARATOR];
2014
- const m = comp.match(r);
2015
- if (!m) {
1974
+ const r2 = this.options.loose ? re2[t.COMPARATORLOOSE] : re2[t.COMPARATOR];
1975
+ const m2 = comp.match(r2);
1976
+ if (!m2) {
2016
1977
  throw new TypeError(`Invalid comparator: ${comp}`);
2017
1978
  }
2018
- this.operator = m[1] !== undefined ? m[1] : "";
1979
+ this.operator = m2[1] !== undefined ? m2[1] : "";
2019
1980
  if (this.operator === "=") {
2020
1981
  this.operator = "";
2021
1982
  }
2022
- if (!m[2]) {
1983
+ if (!m2[2]) {
2023
1984
  this.semver = ANY;
2024
1985
  } else {
2025
- this.semver = new SemVer(m[2], this.options.loose);
1986
+ this.semver = new SemVer(m2[2], this.options.loose);
2026
1987
  }
2027
1988
  }
2028
1989
  toString() {
@@ -2084,7 +2045,7 @@ function requireComparator() {
2084
2045
  }
2085
2046
  comparator = Comparator;
2086
2047
  const parseOptions = requireParseOptions();
2087
- const { safeRe: re, t } = requireRe();
2048
+ const { safeRe: re2, t } = requireRe();
2088
2049
  const cmp = requireCmp();
2089
2050
  const debug = requireDebug();
2090
2051
  const SemVer = requireSemver$1();
@@ -2098,13 +2059,13 @@ function requireSatisfies() {
2098
2059
  return satisfies_1;
2099
2060
  hasRequiredSatisfies = 1;
2100
2061
  const Range = requireRange();
2101
- const satisfies = (version, range, options) => {
2062
+ const satisfies = (version, range2, options) => {
2102
2063
  try {
2103
- range = new Range(range, options);
2064
+ range2 = new Range(range2, options);
2104
2065
  } catch (er) {
2105
2066
  return false;
2106
2067
  }
2107
- return range.test(version);
2068
+ return range2.test(version);
2108
2069
  };
2109
2070
  satisfies_1 = satisfies;
2110
2071
  return satisfies_1;
@@ -2116,7 +2077,7 @@ function requireToComparators() {
2116
2077
  return toComparators_1;
2117
2078
  hasRequiredToComparators = 1;
2118
2079
  const Range = requireRange();
2119
- const toComparators = (range, options) => new Range(range, options).set.map((comp) => comp.map((c) => c.value).join(" ").trim().split(" "));
2080
+ const toComparators = (range2, options) => new Range(range2, options).set.map((comp) => comp.map((c2) => c2.value).join(" ").trim().split(" "));
2120
2081
  toComparators_1 = toComparators;
2121
2082
  return toComparators_1;
2122
2083
  }
@@ -2128,12 +2089,12 @@ function requireMaxSatisfying() {
2128
2089
  hasRequiredMaxSatisfying = 1;
2129
2090
  const SemVer = requireSemver$1();
2130
2091
  const Range = requireRange();
2131
- const maxSatisfying = (versions, range, options) => {
2092
+ const maxSatisfying = (versions, range2, options) => {
2132
2093
  let max = null;
2133
2094
  let maxSV = null;
2134
2095
  let rangeObj = null;
2135
2096
  try {
2136
- rangeObj = new Range(range, options);
2097
+ rangeObj = new Range(range2, options);
2137
2098
  } catch (er) {
2138
2099
  return null;
2139
2100
  }
@@ -2158,12 +2119,12 @@ function requireMinSatisfying() {
2158
2119
  hasRequiredMinSatisfying = 1;
2159
2120
  const SemVer = requireSemver$1();
2160
2121
  const Range = requireRange();
2161
- const minSatisfying = (versions, range, options) => {
2122
+ const minSatisfying = (versions, range2, options) => {
2162
2123
  let min = null;
2163
2124
  let minSV = null;
2164
2125
  let rangeObj = null;
2165
2126
  try {
2166
- rangeObj = new Range(range, options);
2127
+ rangeObj = new Range(range2, options);
2167
2128
  } catch (er) {
2168
2129
  return null;
2169
2130
  }
@@ -2189,23 +2150,23 @@ function requireMinVersion() {
2189
2150
  const SemVer = requireSemver$1();
2190
2151
  const Range = requireRange();
2191
2152
  const gt = requireGt();
2192
- const minVersion = (range, loose) => {
2193
- range = new Range(range, loose);
2153
+ const minVersion = (range2, loose) => {
2154
+ range2 = new Range(range2, loose);
2194
2155
  let minver = new SemVer("0.0.0");
2195
- if (range.test(minver)) {
2156
+ if (range2.test(minver)) {
2196
2157
  return minver;
2197
2158
  }
2198
2159
  minver = new SemVer("0.0.0-0");
2199
- if (range.test(minver)) {
2160
+ if (range2.test(minver)) {
2200
2161
  return minver;
2201
2162
  }
2202
2163
  minver = null;
2203
- for (let i = 0;i < range.set.length; ++i) {
2204
- const comparators = range.set[i];
2164
+ for (let i = 0;i < range2.set.length; ++i) {
2165
+ const comparators = range2.set[i];
2205
2166
  let setMin = null;
2206
- comparators.forEach((comparator) => {
2207
- const compver = new SemVer(comparator.semver.version);
2208
- switch (comparator.operator) {
2167
+ comparators.forEach((comparator2) => {
2168
+ const compver = new SemVer(comparator2.semver.version);
2169
+ switch (comparator2.operator) {
2209
2170
  case ">":
2210
2171
  if (compver.prerelease.length === 0) {
2211
2172
  compver.patch++;
@@ -2223,14 +2184,14 @@ function requireMinVersion() {
2223
2184
  case "<=":
2224
2185
  break;
2225
2186
  default:
2226
- throw new Error(`Unexpected operation: ${comparator.operator}`);
2187
+ throw new Error(`Unexpected operation: ${comparator2.operator}`);
2227
2188
  }
2228
2189
  });
2229
2190
  if (setMin && (!minver || gt(minver, setMin))) {
2230
2191
  minver = setMin;
2231
2192
  }
2232
2193
  }
2233
- if (minver && range.test(minver)) {
2194
+ if (minver && range2.test(minver)) {
2234
2195
  return minver;
2235
2196
  }
2236
2197
  return null;
@@ -2245,9 +2206,9 @@ function requireValid() {
2245
2206
  return valid;
2246
2207
  hasRequiredValid = 1;
2247
2208
  const Range = requireRange();
2248
- const validRange = (range, options) => {
2209
+ const validRange = (range2, options) => {
2249
2210
  try {
2250
- return new Range(range, options).range || "*";
2211
+ return new Range(range2, options).range || "*";
2251
2212
  } catch (er) {
2252
2213
  return null;
2253
2214
  }
@@ -2270,9 +2231,9 @@ function requireOutside() {
2270
2231
  const lt = requireLt();
2271
2232
  const lte = requireLte();
2272
2233
  const gte = requireGte();
2273
- const outside = (version, range, hilo, options) => {
2234
+ const outside = (version, range2, hilo, options) => {
2274
2235
  version = new SemVer(version, options);
2275
- range = new Range(range, options);
2236
+ range2 = new Range(range2, options);
2276
2237
  let gtfn, ltefn, ltfn, comp, ecomp;
2277
2238
  switch (hilo) {
2278
2239
  case ">":
@@ -2292,23 +2253,23 @@ function requireOutside() {
2292
2253
  default:
2293
2254
  throw new TypeError('Must provide a hilo val of "<" or ">"');
2294
2255
  }
2295
- if (satisfies(version, range, options)) {
2256
+ if (satisfies(version, range2, options)) {
2296
2257
  return false;
2297
2258
  }
2298
- for (let i = 0;i < range.set.length; ++i) {
2299
- const comparators = range.set[i];
2259
+ for (let i = 0;i < range2.set.length; ++i) {
2260
+ const comparators = range2.set[i];
2300
2261
  let high = null;
2301
2262
  let low = null;
2302
- comparators.forEach((comparator) => {
2303
- if (comparator.semver === ANY) {
2304
- comparator = new Comparator(">=0.0.0");
2263
+ comparators.forEach((comparator2) => {
2264
+ if (comparator2.semver === ANY) {
2265
+ comparator2 = new Comparator(">=0.0.0");
2305
2266
  }
2306
- high = high || comparator;
2307
- low = low || comparator;
2308
- if (gtfn(comparator.semver, high.semver, options)) {
2309
- high = comparator;
2310
- } else if (ltfn(comparator.semver, low.semver, options)) {
2311
- low = comparator;
2267
+ high = high || comparator2;
2268
+ low = low || comparator2;
2269
+ if (gtfn(comparator2.semver, high.semver, options)) {
2270
+ high = comparator2;
2271
+ } else if (ltfn(comparator2.semver, low.semver, options)) {
2272
+ low = comparator2;
2312
2273
  }
2313
2274
  });
2314
2275
  if (high.operator === comp || high.operator === ecomp) {
@@ -2332,7 +2293,7 @@ function requireGtr() {
2332
2293
  return gtr_1;
2333
2294
  hasRequiredGtr = 1;
2334
2295
  const outside = requireOutside();
2335
- const gtr = (version, range, options) => outside(version, range, ">", options);
2296
+ const gtr = (version, range2, options) => outside(version, range2, ">", options);
2336
2297
  gtr_1 = gtr;
2337
2298
  return gtr_1;
2338
2299
  }
@@ -2343,7 +2304,7 @@ function requireLtr() {
2343
2304
  return ltr_1;
2344
2305
  hasRequiredLtr = 1;
2345
2306
  const outside = requireOutside();
2346
- const ltr = (version, range, options) => outside(version, range, "<", options);
2307
+ const ltr = (version, range2, options) => outside(version, range2, "<", options);
2347
2308
  ltr_1 = ltr;
2348
2309
  return ltr_1;
2349
2310
  }
@@ -2370,13 +2331,13 @@ function requireSimplify() {
2370
2331
  hasRequiredSimplify = 1;
2371
2332
  const satisfies = requireSatisfies();
2372
2333
  const compare = requireCompare();
2373
- simplify = (versions, range, options) => {
2334
+ simplify = (versions, range2, options) => {
2374
2335
  const set = [];
2375
2336
  let first = null;
2376
2337
  let prev = null;
2377
- const v = versions.sort((a, b) => compare(a, b, options));
2338
+ const v = versions.sort((a, b3) => compare(a, b3, options));
2378
2339
  for (const version of v) {
2379
- const included = satisfies(version, range, options);
2340
+ const included = satisfies(version, range2, options);
2380
2341
  if (included) {
2381
2342
  prev = version;
2382
2343
  if (!first) {
@@ -2408,8 +2369,8 @@ function requireSimplify() {
2408
2369
  }
2409
2370
  }
2410
2371
  const simplified = ranges.join(" || ");
2411
- const original = typeof range.raw === "string" ? range.raw : String(range);
2412
- return simplified.length < original.length ? simplified : range;
2372
+ const original = typeof range2.raw === "string" ? range2.raw : String(range2);
2373
+ return simplified.length < original.length ? simplified : range2;
2413
2374
  };
2414
2375
  return simplify;
2415
2376
  }
@@ -2470,13 +2431,13 @@ function requireSubset() {
2470
2431
  }
2471
2432
  const eqSet = new Set;
2472
2433
  let gt, lt;
2473
- for (const c of sub) {
2474
- if (c.operator === ">" || c.operator === ">=") {
2475
- gt = higherGT(gt, c, options);
2476
- } else if (c.operator === "<" || c.operator === "<=") {
2477
- lt = lowerLT(lt, c, options);
2434
+ for (const c2 of sub) {
2435
+ if (c2.operator === ">" || c2.operator === ">=") {
2436
+ gt = higherGT(gt, c2, options);
2437
+ } else if (c2.operator === "<" || c2.operator === "<=") {
2438
+ lt = lowerLT(lt, c2, options);
2478
2439
  } else {
2479
- eqSet.add(c.semver);
2440
+ eqSet.add(c2.semver);
2480
2441
  }
2481
2442
  }
2482
2443
  if (eqSet.size > 1) {
@@ -2498,8 +2459,8 @@ function requireSubset() {
2498
2459
  if (lt && !satisfies(eq, String(lt), options)) {
2499
2460
  return null;
2500
2461
  }
2501
- for (const c of dom) {
2502
- if (!satisfies(eq, String(c), options)) {
2462
+ for (const c2 of dom) {
2463
+ if (!satisfies(eq, String(c2), options)) {
2503
2464
  return false;
2504
2465
  }
2505
2466
  }
@@ -2512,40 +2473,40 @@ function requireSubset() {
2512
2473
  if (needDomLTPre && needDomLTPre.prerelease.length === 1 && lt.operator === "<" && needDomLTPre.prerelease[0] === 0) {
2513
2474
  needDomLTPre = false;
2514
2475
  }
2515
- for (const c of dom) {
2516
- hasDomGT = hasDomGT || c.operator === ">" || c.operator === ">=";
2517
- hasDomLT = hasDomLT || c.operator === "<" || c.operator === "<=";
2476
+ for (const c2 of dom) {
2477
+ hasDomGT = hasDomGT || c2.operator === ">" || c2.operator === ">=";
2478
+ hasDomLT = hasDomLT || c2.operator === "<" || c2.operator === "<=";
2518
2479
  if (gt) {
2519
2480
  if (needDomGTPre) {
2520
- if (c.semver.prerelease && c.semver.prerelease.length && c.semver.major === needDomGTPre.major && c.semver.minor === needDomGTPre.minor && c.semver.patch === needDomGTPre.patch) {
2481
+ if (c2.semver.prerelease && c2.semver.prerelease.length && c2.semver.major === needDomGTPre.major && c2.semver.minor === needDomGTPre.minor && c2.semver.patch === needDomGTPre.patch) {
2521
2482
  needDomGTPre = false;
2522
2483
  }
2523
2484
  }
2524
- if (c.operator === ">" || c.operator === ">=") {
2525
- higher = higherGT(gt, c, options);
2526
- if (higher === c && higher !== gt) {
2485
+ if (c2.operator === ">" || c2.operator === ">=") {
2486
+ higher = higherGT(gt, c2, options);
2487
+ if (higher === c2 && higher !== gt) {
2527
2488
  return false;
2528
2489
  }
2529
- } else if (gt.operator === ">=" && !satisfies(gt.semver, String(c), options)) {
2490
+ } else if (gt.operator === ">=" && !satisfies(gt.semver, String(c2), options)) {
2530
2491
  return false;
2531
2492
  }
2532
2493
  }
2533
2494
  if (lt) {
2534
2495
  if (needDomLTPre) {
2535
- if (c.semver.prerelease && c.semver.prerelease.length && c.semver.major === needDomLTPre.major && c.semver.minor === needDomLTPre.minor && c.semver.patch === needDomLTPre.patch) {
2496
+ if (c2.semver.prerelease && c2.semver.prerelease.length && c2.semver.major === needDomLTPre.major && c2.semver.minor === needDomLTPre.minor && c2.semver.patch === needDomLTPre.patch) {
2536
2497
  needDomLTPre = false;
2537
2498
  }
2538
2499
  }
2539
- if (c.operator === "<" || c.operator === "<=") {
2540
- lower = lowerLT(lt, c, options);
2541
- if (lower === c && lower !== lt) {
2500
+ if (c2.operator === "<" || c2.operator === "<=") {
2501
+ lower = lowerLT(lt, c2, options);
2502
+ if (lower === c2 && lower !== lt) {
2542
2503
  return false;
2543
2504
  }
2544
- } else if (lt.operator === "<=" && !satisfies(lt.semver, String(c), options)) {
2505
+ } else if (lt.operator === "<=" && !satisfies(lt.semver, String(c2), options)) {
2545
2506
  return false;
2546
2507
  }
2547
2508
  }
2548
- if (!c.operator && (lt || gt) && gtltComp !== 0) {
2509
+ if (!c2.operator && (lt || gt) && gtltComp !== 0) {
2549
2510
  return false;
2550
2511
  }
2551
2512
  }
@@ -2560,19 +2521,19 @@ function requireSubset() {
2560
2521
  }
2561
2522
  return true;
2562
2523
  };
2563
- const higherGT = (a, b, options) => {
2524
+ const higherGT = (a, b3, options) => {
2564
2525
  if (!a) {
2565
- return b;
2526
+ return b3;
2566
2527
  }
2567
- const comp = compare(a.semver, b.semver, options);
2568
- return comp > 0 ? a : comp < 0 ? b : b.operator === ">" && a.operator === ">=" ? b : a;
2528
+ const comp = compare(a.semver, b3.semver, options);
2529
+ return comp > 0 ? a : comp < 0 ? b3 : b3.operator === ">" && a.operator === ">=" ? b3 : a;
2569
2530
  };
2570
- const lowerLT = (a, b, options) => {
2531
+ const lowerLT = (a, b3, options) => {
2571
2532
  if (!a) {
2572
- return b;
2533
+ return b3;
2573
2534
  }
2574
- const comp = compare(a.semver, b.semver, options);
2575
- return comp < 0 ? a : comp > 0 ? b : b.operator === "<" && a.operator === "<=" ? b : a;
2535
+ const comp = compare(a.semver, b3.semver, options);
2536
+ return comp < 0 ? a : comp > 0 ? b3 : b3.operator === "<" && a.operator === "<=" ? b3 : a;
2576
2537
  };
2577
2538
  subset_1 = subset;
2578
2539
  return subset_1;
@@ -2584,11 +2545,11 @@ function requireSemver() {
2584
2545
  return semver;
2585
2546
  hasRequiredSemver = 1;
2586
2547
  const internalRe = requireRe();
2587
- const constants = requireConstants();
2548
+ const constants2 = requireConstants();
2588
2549
  const SemVer = requireSemver$1();
2589
- const identifiers = requireIdentifiers();
2550
+ const identifiers2 = requireIdentifiers();
2590
2551
  const parse = requireParse();
2591
- const valid = requireValid$1();
2552
+ const valid2 = requireValid$1();
2592
2553
  const clean = requireClean();
2593
2554
  const inc = requireInc();
2594
2555
  const diff = requireDiff();
@@ -2626,7 +2587,7 @@ function requireSemver() {
2626
2587
  const subset = requireSubset();
2627
2588
  semver = {
2628
2589
  parse,
2629
- valid,
2590
+ valid: valid2,
2630
2591
  clean,
2631
2592
  inc,
2632
2593
  diff,
@@ -2666,35 +2627,35 @@ function requireSemver() {
2666
2627
  re: internalRe.re,
2667
2628
  src: internalRe.src,
2668
2629
  tokens: internalRe.t,
2669
- SEMVER_SPEC_VERSION: constants.SEMVER_SPEC_VERSION,
2670
- RELEASE_TYPES: constants.RELEASE_TYPES,
2671
- compareIdentifiers: identifiers.compareIdentifiers,
2672
- rcompareIdentifiers: identifiers.rcompareIdentifiers
2630
+ SEMVER_SPEC_VERSION: constants2.SEMVER_SPEC_VERSION,
2631
+ RELEASE_TYPES: constants2.RELEASE_TYPES,
2632
+ compareIdentifiers: identifiers2.compareIdentifiers,
2633
+ rcompareIdentifiers: identifiers2.rcompareIdentifiers
2673
2634
  };
2674
2635
  return semver;
2675
2636
  }
2676
2637
  var semverExports = requireSemver();
2677
2638
  function isCompatible(required, provided) {
2678
- for (const [name, range] of Object.entries(required)) {
2639
+ for (const [name, range2] of Object.entries(required)) {
2679
2640
  const version = provided[name];
2680
2641
  if (!version) {
2681
2642
  continue;
2682
2643
  }
2683
- if (isSatisfied(range, version) === false) {
2644
+ if (isSatisfied(range2, version) === false) {
2684
2645
  return false;
2685
2646
  }
2686
2647
  }
2687
2648
  return true;
2688
2649
  }
2689
- function isSatisfied(range, version) {
2690
- if (!semverExports.validRange(range)) {
2650
+ function isSatisfied(range2, version) {
2651
+ if (!semverExports.validRange(range2)) {
2691
2652
  return null;
2692
2653
  }
2693
2654
  const coerced = semverExports.coerce(version);
2694
2655
  if (!coerced) {
2695
2656
  return null;
2696
2657
  }
2697
- return semverExports.satisfies(coerced, range);
2658
+ return semverExports.satisfies(coerced, range2);
2698
2659
  }
2699
2660
 
2700
2661
  // ../../node_modules/@bpmn-io/feel-lint/dist/index.js
@@ -2757,7 +2718,7 @@ var firstItem = {
2757
2718
  actions: [
2758
2719
  {
2759
2720
  name: "fix",
2760
- apply(_, start = from, end = to) {
2721
+ apply(_2, start = from, end = to) {
2761
2722
  context.updateContent(start, end, content.replace(zeroIndexPattern(), "[1]"));
2762
2723
  }
2763
2724
  }
@@ -2819,8 +2780,8 @@ function lintCompatibility(context = {}) {
2819
2780
  return [];
2820
2781
  }
2821
2782
  const analyzer = new FeelAnalyzer({ builtins });
2822
- const { valid, functions = [] } = analyzer.analyzeTree(syntaxTree, expression);
2823
- if (!valid) {
2783
+ const { valid: valid2, functions = [] } = analyzer.analyzeTree(syntaxTree, expression);
2784
+ if (!valid2) {
2824
2785
  return [];
2825
2786
  }
2826
2787
  return functions.reduce((messages, fn) => {
@@ -2851,7 +2812,7 @@ function getUnavailableBuiltins(builtins, engines) {
2851
2812
  return unavailable;
2852
2813
  }
2853
2814
  function formatEngines(engines) {
2854
- return Object.entries(engines).map(([name, range]) => `${capitalize(name)} ${range}`).join(", ");
2815
+ return Object.entries(engines).map(([name, range2]) => `${capitalize(name)} ${range2}`).join(", ");
2855
2816
  }
2856
2817
  function capitalize(string) {
2857
2818
  return string.charAt(0).toUpperCase() + string.slice(1);
@@ -2895,11 +2856,11 @@ function lintExpression(expression, {
2895
2856
  }
2896
2857
 
2897
2858
  // ../../node_modules/@uipath/dmn-editor-utils/dist/validation/index.js
2898
- var K = (i, e2, t) => ({ name: i, ...e2 ? { detail: e2 } : {}, ...t?.length ? { entries: t.map((s) => K(s.name, s.typeRef)) } : {} });
2859
+ var K = (i, e2, t) => ({ name: i, ...e2 ? { detail: e2 } : {}, ...t?.length ? { entries: t.map((s2) => K(s2.name, s2.typeRef)) } : {} });
2899
2860
  var I2 = (i, e2 = []) => {
2900
- let t = i.map((r2) => K(r2.variableName ?? r2.name, r2.typeRef)), s = new Set(i.map((r2) => r2.variableName ?? r2.name));
2861
+ let t = i.map((r2) => K(r2.variableName ?? r2.name, r2.typeRef)), s2 = new Set(i.map((r2) => r2.variableName ?? r2.name));
2901
2862
  for (let r2 of e2)
2902
- s.has(r2.name) || (s.add(r2.name), t.push(K(r2.name, r2.typeRef, r2.members)));
2863
+ s2.has(r2.name) || (s2.add(r2.name), t.push(K(r2.name, r2.typeRef, r2.members)));
2903
2864
  return t;
2904
2865
  };
2905
2866
  var me = "DMN_INPUT_EXPRESSION_MISSING";
@@ -2912,42 +2873,42 @@ var pe = (i, e2) => {
2912
2873
  let t = i.trim();
2913
2874
  return t === "" || e2 === "unaryTests" && t === "-";
2914
2875
  };
2915
- var D = (i, e2, t) => pe(i, e2) ? [] : ce(i, e2, t).map((s) => s.severity === "error" ? { code: "DMN_FEEL_SYNTAX", severity: "error", messageKey: "validation_feel_syntax", messageParams: { message: s.message }, range: { from: s.from, to: s.to } } : { code: "DMN_FEEL_LINT", severity: "warning", messageKey: "validation_feel_lint", messageParams: { message: s.message }, range: { from: s.from, to: s.to } });
2876
+ var D = (i, e2, t) => pe(i, e2) ? [] : ce(i, e2, t).map((s2) => s2.severity === "error" ? { code: "DMN_FEEL_SYNTAX", severity: "error", messageKey: "validation_feel_syntax", messageParams: { message: s2.message }, range: { from: s2.from, to: s2.to } } : { code: "DMN_FEEL_LINT", severity: "warning", messageKey: "validation_feel_lint", messageParams: { message: s2.message }, range: { from: s2.from, to: s2.to } });
2916
2877
  var be = { StringLiteral: "string", NumericLiteral: "number", BooleanLiteral: "boolean" };
2917
2878
  var Ie = { string: ["number", "boolean"], number: ["string", "boolean"], boolean: ["string", "number"] };
2918
2879
  var N = (i, e2) => {
2919
2880
  let t = i.trim();
2920
2881
  if (!t)
2921
2882
  return;
2922
- let s = (e2 === "unaryTests" ? F : parser).parse(t), r2;
2923
- return s.iterate({ enter(c) {
2924
- c.from === 0 && c.to === t.length && (r2 = be[c.name] ?? r2);
2883
+ let s2 = (e2 === "unaryTests" ? F : parser).parse(t), r2;
2884
+ return s2.iterate({ enter(c2) {
2885
+ c2.from === 0 && c2.to === t.length && (r2 = be[c2.name] ?? r2);
2925
2886
  } }), r2;
2926
2887
  };
2927
- var S = (i, e2) => !i || !e2 || !Ie[i].includes(s2(e2)) ? [] : [{ code: "DMN_TYPE_MISMATCH", severity: "error", messageKey: "validation_type_mismatch", messageParams: { literalType: i, columnType: e2 } }];
2888
+ var S = (i, e2) => !i || !e2 || !Ie[i].includes(s(e2)) ? [] : [{ code: "DMN_TYPE_MISMATCH", severity: "error", messageKey: "validation_type_mismatch", messageParams: { literalType: i, columnType: e2 } }];
2928
2889
  var de = (i) => {
2929
2890
  let e2 = F.parse(i.trim()).topNode, t = e2.getChild("PositiveUnaryTests");
2930
2891
  return t && !e2.getChild("not") ? t.getChildren("PositiveUnaryTest").length : 1;
2931
2892
  };
2932
2893
  var ge = (i, e2) => {
2933
- let t = e2 ? s2(e2) : "Any";
2894
+ let t = e2 ? s(e2) : "Any";
2934
2895
  if (t === "Any")
2935
2896
  return Se(i);
2936
2897
  if (!g({ text: i }, t))
2937
2898
  return;
2938
- let s = c(i);
2939
- return new Set(t === "number" ? s.map(Number) : t === "boolean" ? s.map((r2) => r2 === "true") : s);
2899
+ let s2 = c(i);
2900
+ return new Set(t === "number" ? s2.map(Number) : t === "boolean" ? s2.map((r2) => r2 === "true") : s2);
2940
2901
  };
2941
2902
  var Se = (i) => {
2942
- let e2 = i.trim(), t = F.parse(e2).topNode, s = t.getChild("PositiveUnaryTests");
2943
- if (!s || t.getChild("not"))
2903
+ let e2 = i.trim(), t = F.parse(e2).topNode, s2 = t.getChild("PositiveUnaryTests");
2904
+ if (!s2 || t.getChild("not"))
2944
2905
  return;
2945
2906
  let r2 = new Set;
2946
- for (let c of s.getChildren("PositiveUnaryTest")) {
2947
- let l = e2.slice(c.from, c.to), g = N(l, "expression");
2948
- if (!g)
2907
+ for (let c2 of s2.getChildren("PositiveUnaryTest")) {
2908
+ let l = e2.slice(c2.from, c2.to), g2 = N(l, "expression");
2909
+ if (!g2)
2949
2910
  return;
2950
- r2.add(_e(g, l));
2911
+ r2.add(_e(g2, l));
2951
2912
  }
2952
2913
  return r2;
2953
2914
  };
@@ -2956,8 +2917,8 @@ var _e = (i, e2) => {
2956
2917
  return i === "number" ? Number(t.replace(/\s+/g, "")) : i === "string" ? c(t)[0] : t === "true";
2957
2918
  };
2958
2919
  var fe = (i, e2, t) => t.has(_e(i, e2));
2959
- var y2 = (i, e2, t) => pe(i, e2) ? [] : b(i, e2).filter((s) => !t.has(s.name)).map((s) => ({ code: "DMN_UNKNOWN_NAME", severity: "error", messageKey: "validation_unknown_name", messageParams: { name: s.name }, range: { from: s.from, to: s.to } }));
2960
- var Me = (i, e2, t) => !t || !O(t) || [e2, t].some((s) => s2(s) === "Any") ? true : b2(i, e2) ? false : !O(e2) || s2(e2) === s2(t);
2920
+ var y2 = (i, e2, t) => pe(i, e2) ? [] : b(i, e2).filter((s2) => !t.has(s2.name)).map((s2) => ({ code: "DMN_UNKNOWN_NAME", severity: "error", messageKey: "validation_unknown_name", messageParams: { name: s2.name }, range: { from: s2.from, to: s2.to } }));
2921
+ var Me = (i, e2, t) => !t || !O(t) || [e2, t].some((s2) => s(s2) === "Any") ? true : b2(i, e2) ? false : !O(e2) || s(e2) === s(t);
2961
2922
  var De = (i) => {
2962
2923
  let e2 = i.trim();
2963
2924
  return e2 === "" || e2 === "-";
@@ -2967,42 +2928,42 @@ var Pe = (i) => ({ kind: "row", ruleId: i });
2967
2928
  var Ae = "string";
2968
2929
  var Le = (i, e2) => e2 ? i.inputData.find((t) => (t.variableName ?? t.name) === e2) ?? i.scopeVariables?.find((t) => t.name === e2) : undefined;
2969
2930
  var C = (i) => {
2970
- let e2 = i.decision.decisionTable, t = [], s = I2(i.inputData, i.scopeVariables), r2 = new Set(s.map((n) => n.name));
2931
+ let e2 = i.decision.decisionTable, t = [], s2 = I2(i.inputData, i.scopeVariables), r2 = new Set(s2.map((n) => n.name));
2971
2932
  if (i.decision.name.trim() || t.push({ code: "DMN_DECISION_NAME_MISSING", severity: "error", messageKey: "validation_decision_name_missing", target: { kind: "decision" } }), e2.rules.length === 0 && t.push({ code: "DMN_NO_RULES", severity: "warning", messageKey: "validation_no_rules", target: { kind: "decision" } }), e2.hitPolicy === e.Collect && e2.aggregation) {
2972
2933
  let { aggregation: n } = e2;
2973
2934
  e2.outputs.forEach((p2) => {
2974
2935
  let d = p(i, p2);
2975
2936
  d && !M(i, n, p2) && t.push({ code: "DMN_COLLECT_AGGREGATION_TYPE", severity: "error", messageKey: "validation_collect_aggregation_type", messageParams: { aggregation: n, typeRef: d }, target: { kind: "output", outputId: p2.id } });
2976
2937
  });
2977
- let a = i.decision.variableTypeRef, o = e2.outputs.length === 1, m = m2(i, a);
2978
- !!a && (o ? !Me(i, a, m2(i, A(n, e2.outputs[0]))) : b2(i, a) || !!m && O(m) && m !== "Any") && t.push({ code: "DMN_AGGREGATION_RESULT_TYPE", severity: o ? "warning" : "error", messageKey: "validation_aggregation_result_type", messageParams: { aggregation: n, typeRef: a }, target: { kind: "decision" } });
2938
+ let a = i.decision.variableTypeRef, o = e2.outputs.length === 1, m2 = m(i, a);
2939
+ !!a && (o ? !Me(i, a, m(i, A(n, e2.outputs[0]))) : b2(i, a) || !!m2 && O(m2) && m2 !== "Any") && t.push({ code: "DMN_AGGREGATION_RESULT_TYPE", severity: o ? "warning" : "error", messageKey: "validation_aggregation_result_type", messageParams: { aggregation: n, typeRef: a }, target: { kind: "decision" } });
2979
2940
  }
2980
- if (R2.has(e2.hitPolicy)) {
2941
+ if (R.has(e2.hitPolicy)) {
2981
2942
  let n = e2.outputs.flatMap((a) => P(i, a) ?? []);
2982
2943
  n.length === 0 ? t.push({ code: "DMN_RANKED_OUTPUT_VALUES_MISSING", severity: "error", messageKey: "validation_ranked_output_values_missing", messageParams: { hitPolicy: e2.hitPolicy }, target: { kind: "decision" } }) : n.every((a) => de(a.text) < 2) && t.push({ code: "DMN_RANKED_OUTPUT_VALUES_SINGLE", severity: "warning", messageKey: "validation_ranked_output_values_single", messageParams: { hitPolicy: e2.hitPolicy }, target: { kind: "decision" } });
2983
2944
  }
2984
- let c = i.decision.variableTypeRef;
2985
- h(e2) === "list" && c && I(i, c) && t.push({ code: "DMN_LIST_RESULT_TYPE", severity: "error", messageKey: "validation_list_result_type", messageParams: { hitPolicy: e2.hitPolicy, typeRef: c }, target: { kind: "decision" } });
2945
+ let c2 = i.decision.variableTypeRef;
2946
+ h(e2) === "list" && c2 && I(i, c2) && t.push({ code: "DMN_LIST_RESULT_TYPE", severity: "error", messageKey: "validation_list_result_type", messageParams: { hitPolicy: e2.hitPolicy, typeRef: c2 }, target: { kind: "decision" } });
2986
2947
  let l = new Map;
2987
2948
  e2.outputs.forEach((n, a) => {
2988
2949
  let o = B(n, a);
2989
2950
  l.set(o, (l.get(o) ?? 0) + 1);
2990
2951
  }), e2.inputs.forEach((n) => {
2991
2952
  let a = { kind: "input", inputId: n.id }, o = { ...a, field: "expression" };
2992
- n.expressionText.trim() || t.push({ code: me, severity: "error", messageKey: "validation_input_expression_missing", target: o }), t.push(...[...D(n.expressionText, "expression", s), ...y2(n.expressionText, "expression", r2)].map((_) => ({ ..._, target: o })));
2993
- let m = Le(i, n.expressionText.trim()), u = m2(i, m?.typeRef), p = m2(i, n.typeRef) ?? Ae;
2994
- u !== undefined && u !== "Any" && r.includes(u) && u !== p && t.push({ code: "DMN_COLUMN_TYPE_MISMATCH", severity: "error", messageKey: "validation_column_type_mismatch", messageParams: { name: n.expressionText.trim(), declared: u, column: p }, target: o }), n.allowedValues && (t.push(...D(n.allowedValues.text, "unaryTests", s).map((_) => ({ ..._, target: a }))), t.push(...y2(n.allowedValues.text, "unaryTests", r2).map((_) => ({ ..._, target: a }))));
2953
+ n.expressionText.trim() || t.push({ code: me, severity: "error", messageKey: "validation_input_expression_missing", target: o }), t.push(...[...D(n.expressionText, "expression", s2), ...y2(n.expressionText, "expression", r2)].map((_2) => ({ ..._2, target: o })));
2954
+ let m2 = Le(i, n.expressionText.trim()), u = m(i, m2?.typeRef), p2 = m(i, n.typeRef) ?? Ae;
2955
+ u !== undefined && u !== "Any" && r.includes(u) && u !== p2 && t.push({ code: "DMN_COLUMN_TYPE_MISMATCH", severity: "error", messageKey: "validation_column_type_mismatch", messageParams: { name: n.expressionText.trim(), declared: u, column: p2 }, target: o }), n.allowedValues && (t.push(...D(n.allowedValues.text, "unaryTests", s2).map((_2) => ({ ..._2, target: a }))), t.push(...y2(n.allowedValues.text, "unaryTests", r2).map((_2) => ({ ..._2, target: a }))));
2995
2956
  }), e2.outputs.forEach((n, a) => {
2996
- let o = { kind: "output", outputId: n.id }, m = B(n, a);
2997
- (l.get(m) ?? 0) > 1 && t.push({ code: "DMN_DUPLICATE_OUTPUT_NAME", severity: "error", messageKey: "validation_duplicate_output_name", messageParams: { name: m }, target: o }), n.name?.trim() ? w(n.name.trim()) || t.push({ code: "DMN_OUTPUT_NAME_INVALID", severity: "error", messageKey: "validation_output_name_invalid", messageParams: { name: n.name.trim() }, target: o }) : e2.outputs.length > 1 && t.push({ code: "DMN_OUTPUT_NAME_MISSING", severity: "error", messageKey: "validation_output_name_missing", target: o }), n.allowedValues && (t.push(...D(n.allowedValues.text, "unaryTests", s).map((u) => ({ ...u, target: o }))), t.push(...y2(n.allowedValues.text, "unaryTests", r2).map((u) => ({ ...u, target: o }))));
2957
+ let o = { kind: "output", outputId: n.id }, m2 = B(n, a);
2958
+ (l.get(m2) ?? 0) > 1 && t.push({ code: "DMN_DUPLICATE_OUTPUT_NAME", severity: "error", messageKey: "validation_duplicate_output_name", messageParams: { name: m2 }, target: o }), n.name?.trim() ? w(n.name.trim()) || t.push({ code: "DMN_OUTPUT_NAME_INVALID", severity: "error", messageKey: "validation_output_name_invalid", messageParams: { name: n.name.trim() }, target: o }) : e2.outputs.length > 1 && t.push({ code: "DMN_OUTPUT_NAME_MISSING", severity: "error", messageKey: "validation_output_name_missing", target: o }), n.allowedValues && (t.push(...D(n.allowedValues.text, "unaryTests", s2).map((u) => ({ ...u, target: o }))), t.push(...y2(n.allowedValues.text, "unaryTests", r2).map((u) => ({ ...u, target: o }))));
2998
2959
  });
2999
- let g = i.decision.variableName ?? i.decision.name, v = new Set((i.scopeVariables ?? []).map((n) => n.name)), T = new Map;
2960
+ let g2 = i.decision.variableName ?? i.decision.name, v = new Set((i.scopeVariables ?? []).map((n) => n.name)), T = new Map;
3000
2961
  i.inputData.forEach((n) => {
3001
2962
  let a = n.variableName ?? n.name;
3002
2963
  T.set(a, (T.get(a) ?? 0) + 1);
3003
2964
  }), i.inputData.forEach((n) => {
3004
2965
  let a = n.variableName ?? n.name, o = { kind: "inputData", inputDataId: n.id };
3005
- (T.get(a) ?? 0) > 1 || a === g ? t.push({ code: "DMN_DUPLICATE_INPUT_DATA_NAME", severity: "error", messageKey: "validation_duplicate_input_data_name", messageParams: { name: a }, target: o }) : v.has(a) && t.push({ code: "DMN_INPUT_DATA_SHADOWS_DECISION", severity: "error", messageKey: "validation_input_data_shadows_decision", messageParams: { name: a }, target: o }), a.trim() && !x(a.trim()) && t.push({ code: "DMN_INPUT_DATA_NAME_INVALID", severity: "error", messageKey: "validation_input_data_name_invalid", messageParams: { name: a.trim() }, target: o });
2966
+ (T.get(a) ?? 0) > 1 || a === g2 ? t.push({ code: "DMN_DUPLICATE_INPUT_DATA_NAME", severity: "error", messageKey: "validation_duplicate_input_data_name", messageParams: { name: a }, target: o }) : v.has(a) && t.push({ code: "DMN_INPUT_DATA_SHADOWS_DECISION", severity: "error", messageKey: "validation_input_data_shadows_decision", messageParams: { name: a }, target: o }), a.trim() && !x(a.trim()) && t.push({ code: "DMN_INPUT_DATA_NAME_INVALID", severity: "error", messageKey: "validation_input_data_name_invalid", messageParams: { name: a.trim() }, target: o });
3006
2967
  });
3007
2968
  let ye = e2.outputs.map((n) => {
3008
2969
  let a = P(i, n);
@@ -3010,18 +2971,18 @@ var C = (i) => {
3010
2971
  }), G = e2.outputs.map(() => 0), Y = new Set, B2 = false;
3011
2972
  return e2.rules.forEach((n) => {
3012
2973
  let a = Pe(n.id);
3013
- if ((n.inputEntries.length !== e2.inputs.length || n.outputEntries.length !== e2.outputs.length) && t.push({ code: "DMN_RULE_ENTRY_COUNT", severity: "error", messageKey: "validation_rule_entry_count", target: a }), e2.hitPolicy === e.First && (B2 ? t.push({ code: "DMN_UNREACHABLE_RULE", severity: "warning", messageKey: "validation_unreachable_rule", target: a }) : n.inputEntries.every((m) => De(m.text)) && (B2 = true)), !y.has(e2.hitPolicy)) {
3014
- let m = xe(n);
3015
- Y.has(m) ? t.push({ code: "DMN_DUPLICATE_RULE", severity: "warning", messageKey: "validation_duplicate_rule", target: a }) : Y.add(m);
2974
+ if ((n.inputEntries.length !== e2.inputs.length || n.outputEntries.length !== e2.outputs.length) && t.push({ code: "DMN_RULE_ENTRY_COUNT", severity: "error", messageKey: "validation_rule_entry_count", target: a }), e2.hitPolicy === e.First && (B2 ? t.push({ code: "DMN_UNREACHABLE_RULE", severity: "warning", messageKey: "validation_unreachable_rule", target: a }) : n.inputEntries.every((m2) => De(m2.text)) && (B2 = true)), !y.has(e2.hitPolicy)) {
2975
+ let m2 = xe(n);
2976
+ Y.has(m2) ? t.push({ code: "DMN_DUPLICATE_RULE", severity: "warning", messageKey: "validation_duplicate_rule", target: a }) : Y.add(m2);
3016
2977
  }
3017
2978
  let o = [{ entries: n.inputEntries, columns: e2.inputs, dialect: "unaryTests" }, { entries: n.outputEntries, columns: e2.outputs, dialect: "expression" }];
3018
- for (let { entries: m, columns: u, dialect: p } of o)
3019
- m.forEach((d, _) => {
3020
- let h = u[_];
3021
- if (!h)
2979
+ for (let { entries: m2, columns: u, dialect: p2 } of o)
2980
+ m2.forEach((d, _2) => {
2981
+ let h2 = u[_2];
2982
+ if (!h2)
3022
2983
  return;
3023
- let H = { kind: "cell", ruleId: n.id, columnId: h.id }, q = D(d.text, p, s), M = p === "expression" && !q.some((P) => P.severity === "error") ? ye[_] : undefined, x = h.typeRef || M ? N(d.text, p) : undefined, X = S(x, h.typeRef), Te = [...q, ...y2(d.text, p, r2), ...X];
3024
- t.push(...Te.map((P) => ({ ...P, target: H }))), !(!M || !d.text.trim()) && (x ? X.length === 0 && !fe(x, d.text, M) && t.push({ code: "DMN_OUTPUT_VALUE_NOT_ALLOWED", severity: "error", messageKey: "validation_output_value_not_allowed", messageParams: { value: d.text.trim() }, target: H }) : G[_] += 1);
2984
+ let H = { kind: "cell", ruleId: n.id, columnId: h2.id }, q = D(d.text, p2, s2), M2 = p2 === "expression" && !q.some((P2) => P2.severity === "error") ? ye[_2] : undefined, x2 = h2.typeRef || M2 ? N(d.text, p2) : undefined, X = S(x2, h2.typeRef), Te = [...q, ...y2(d.text, p2, r2), ...X];
2985
+ t.push(...Te.map((P2) => ({ ...P2, target: H }))), !(!M2 || !d.text.trim()) && (x2 ? X.length === 0 && !fe(x2, d.text, M2) && t.push({ code: "DMN_OUTPUT_VALUE_NOT_ALLOWED", severity: "error", messageKey: "validation_output_value_not_allowed", messageParams: { value: d.text.trim() }, target: H }) : G[_2] += 1);
3025
2986
  });
3026
2987
  }), e2.outputs.forEach((n, a) => {
3027
2988
  let o = G[a];
@@ -3029,23 +2990,23 @@ var C = (i) => {
3029
2990
  }), t;
3030
2991
  };
3031
2992
  var k = (i) => {
3032
- let { literalExpression: e2 } = i.decision, t = [], s = { kind: "decision" }, r2 = I2(i.inputData, i.scopeVariables);
3033
- if (i.decision.name.trim() || t.push({ code: "DMN_DECISION_NAME_MISSING", severity: "error", messageKey: "validation_decision_name_missing", target: s }), !e2.text.trim())
3034
- return t.push({ code: "DMN_LITERAL_EXPRESSION_EMPTY", severity: "error", messageKey: "validation_literal_expression_empty", target: s }), t;
3035
- e2.typeRef || t.push({ code: "DMN_LITERAL_EXPRESSION_TYPE_MISSING", severity: "warning", messageKey: "validation_literal_expression_type_missing", target: s });
3036
- let c = new Set(r2.map((l) => l.name));
3037
- return t.push(...[...D(e2.text, "expression", r2), ...y2(e2.text, "expression", c), ...S(N(e2.text, "expression"), e2.typeRef)].map((l) => ({ ...l, target: s }))), t;
2993
+ let { literalExpression: e2 } = i.decision, t = [], s2 = { kind: "decision" }, r2 = I2(i.inputData, i.scopeVariables);
2994
+ if (i.decision.name.trim() || t.push({ code: "DMN_DECISION_NAME_MISSING", severity: "error", messageKey: "validation_decision_name_missing", target: s2 }), !e2.text.trim())
2995
+ return t.push({ code: "DMN_LITERAL_EXPRESSION_EMPTY", severity: "error", messageKey: "validation_literal_expression_empty", target: s2 }), t;
2996
+ e2.typeRef || t.push({ code: "DMN_LITERAL_EXPRESSION_TYPE_MISSING", severity: "warning", messageKey: "validation_literal_expression_type_missing", target: s2 });
2997
+ let c2 = new Set(r2.map((l) => l.name));
2998
+ return t.push(...[...D(e2.text, "expression", r2), ...y2(e2.text, "expression", c2), ...S(N(e2.text, "expression"), e2.typeRef)].map((l) => ({ ...l, target: s2 }))), t;
3038
2999
  };
3039
3000
  var Re = new Set(["invalid-xml", "unsafe-xml", "migration-failed", "unsupported-version"]);
3040
3001
  var we = (i) => Re.has(i) ? { code: "DMN_DOCUMENT_UNREADABLE", severity: "error", messageKey: "validation_document_unreadable", target: { kind: "document" } } : null;
3041
3002
  var Oe = (i) => {
3042
- let e2 = i.definitions.drgElement ?? [], t = new Set(e2.filter((l) => l.__$$element === "inputData").map(_)), s = new Set(e2.filter((l) => l.__$$element === "decision").map(_)), r2 = (l, g) => {
3003
+ let e2 = i.definitions.drgElement ?? [], t = new Set(e2.filter((l) => l.__$$element === "inputData").map(_)), s2 = new Set(e2.filter((l) => l.__$$element === "decision").map(_)), r2 = (l, g2) => {
3043
3004
  if (!l)
3044
3005
  return false;
3045
3006
  let v = l["@_href"], T = $(v);
3046
- return T !== undefined ? !g.has(T) : !v;
3007
+ return T !== undefined ? !g2.has(T) : !v;
3047
3008
  };
3048
- return e2.filter((l) => l.__$$element === "decision").some((l) => (l.informationRequirement ?? []).some((g) => r2(g.requiredInput, t) || r2(g.requiredDecision, s))) ? [{ code: "DMN_DANGLING_REQUIREMENT", severity: "error", messageKey: "validation_dangling_requirement", target: { kind: "document" } }] : [];
3009
+ return e2.filter((l) => l.__$$element === "decision").some((l) => (l.informationRequirement ?? []).some((g2) => r2(g2.requiredInput, t) || r2(g2.requiredDecision, s2))) ? [{ code: "DMN_DANGLING_REQUIREMENT", severity: "error", messageKey: "validation_dangling_requirement", target: { kind: "document" } }] : [];
3049
3010
  };
3050
3011
  var Ue = async (i) => {
3051
3012
  let e2 = await bs(i);
@@ -3056,16 +3017,19 @@ var Ue = async (i) => {
3056
3017
  let t = Oe(e2.document);
3057
3018
  if (t.length > 0)
3058
3019
  return t;
3059
- if (R(e2.document.definitions).length === 1) {
3020
+ if (R2(e2.document.definitions).length === 1) {
3060
3021
  let r2 = await tt(i);
3061
3022
  if (r2.kind === "decision-table")
3062
3023
  return t.push(...C(r2.model)), t;
3063
3024
  }
3064
- let s = Yt(e2.document);
3065
- return s && t.push(...k(s)), t;
3025
+ let s2 = Yt(e2.document);
3026
+ return s2 && t.push(...k(s2)), t;
3066
3027
  };
3067
3028
  export {
3068
- Ue as validateDmnDocument
3029
+ w as isFeelIdentifier,
3030
+ C as validateDecisionTableModel,
3031
+ Ue as validateDmnDocument,
3032
+ k as validateLiteralExpressionModel
3069
3033
  };
3070
3034
 
3071
- //# debugId=5F43BA316D73E0C464756E2164756E21
3035
+ //# debugId=656F839CEBA8455A64756E2164756E21