@uipath/api-workflow-tool 1.205.0-preview.277 → 1.206.0-preview.279
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 +41 -0
- package/dist/THIRD-PARTY-NOTICES.md +64 -3
- package/dist/applicationinsights-web-8m26566f.js +17209 -0
- package/dist/executor-tool.js +7 -9
- package/dist/index-1wp4j95a.js +10 -0
- package/dist/index-3d09whjq.js +11 -0
- package/dist/{index-waq4trz1.js → index-njewr1c3.js} +5040 -2961
- package/dist/{index-h8cph72k.js → index-nzr4mx5p.js} +2 -22
- package/dist/index.js +14 -15
- package/dist/index.umd.min-ttg1qc0x.js +7814 -0
- package/dist/{jmespath-e4a59c8w.js → jmespath-wwym30dp.js} +1 -1
- package/dist/js-yaml-0c4svjwq.js +36 -0
- package/dist/{node-0aex431z.js → node-zecqtv6e.js} +13 -90
- package/dist/{packager-tool-bgy9gdsp.js → packager-tool-2ckhrf4j.js} +128 -15
- package/dist/{packager-tool-kh3aq9n7.js → packager-tool-2wwd7kp4.js} +920 -903
- package/dist/{packager-tool-xak3m9vd.js → packager-tool-3hcrfsc1.js} +762 -384
- package/dist/{packager-tool-0aacqssr.js → packager-tool-5b6vjjp3.js} +371 -371
- package/dist/{packager-tool-d3w0wn6k.js → packager-tool-5gce5wfd.js} +16 -16
- package/dist/{packager-tool-f7zta1kg.js → packager-tool-61bdk9sn.js} +203 -156
- package/dist/{packager-tool-1yh8g550.js → packager-tool-6an893wm.js} +12 -3
- package/dist/{packager-tool-646qm7dh.js → packager-tool-km68yge6.js} +62 -586
- package/dist/{packager-tool-evd1kzq2.js → packager-tool-qhv22qaj.js} +809 -380
- package/dist/packager-tool-rqprykf5.js +15 -0
- package/dist/{packager-tool-h29ph2zm.js → packager-tool-w1asrkzg.js} +361 -205
- package/dist/packager-tool.js +6 -6
- package/dist/tool.js +13 -14
- package/package.json +2 -2
- package/dist/index-a8veczhw.js +0 -72
- package/dist/index.umd.min-fqefd9kn.js +0 -7814
- package/dist/js-yaml-69tsdrrf.js +0 -37
|
@@ -112,31 +112,36 @@ var NugetConstants = {
|
|
|
112
112
|
BindingsFileId: "bindings.json"
|
|
113
113
|
};
|
|
114
114
|
|
|
115
|
-
// ../packager/packager-core/src/services/
|
|
116
|
-
|
|
117
|
-
|
|
118
|
-
|
|
119
|
-
return typeof value === "string" && value.length > 0;
|
|
120
|
-
}
|
|
121
|
-
async function readJsonObject(fs, filePath) {
|
|
122
|
-
let content;
|
|
115
|
+
// ../packager/packager-core/src/services/json-object.ts
|
|
116
|
+
function parseJsonObject(text) {
|
|
117
|
+
if (!text)
|
|
118
|
+
return;
|
|
123
119
|
try {
|
|
124
|
-
|
|
120
|
+
const value = JSON.parse(text);
|
|
121
|
+
return typeof value === "object" && value !== null && !Array.isArray(value) ? value : undefined;
|
|
125
122
|
} catch {
|
|
126
123
|
return;
|
|
127
124
|
}
|
|
128
|
-
|
|
129
|
-
|
|
130
|
-
|
|
125
|
+
}
|
|
126
|
+
async function readJsonObjectFile(fs, filePath) {
|
|
127
|
+
let content;
|
|
131
128
|
try {
|
|
132
|
-
|
|
133
|
-
if (parsed === null || typeof parsed !== "object") {
|
|
134
|
-
return;
|
|
135
|
-
}
|
|
136
|
-
return parsed;
|
|
129
|
+
content = await fs.readFile(filePath);
|
|
137
130
|
} catch {
|
|
138
131
|
return;
|
|
139
132
|
}
|
|
133
|
+
if (!content)
|
|
134
|
+
return;
|
|
135
|
+
const text = typeof content === "string" ? content : new TextDecoder().decode(content);
|
|
136
|
+
const value = parseJsonObject(text);
|
|
137
|
+
return value ? { text, value } : undefined;
|
|
138
|
+
}
|
|
139
|
+
|
|
140
|
+
// ../packager/packager-core/src/services/project-id.ts
|
|
141
|
+
var OPERATE_FILE = "operate.json";
|
|
142
|
+
var PROJECT_FILE = "project.json";
|
|
143
|
+
function isNonEmptyString(value) {
|
|
144
|
+
return typeof value === "string" && value.length > 0;
|
|
140
145
|
}
|
|
141
146
|
async function writeJsonObject(fs, filePath, data) {
|
|
142
147
|
await fs.writeFile(filePath, `${JSON.stringify(data, null, 2)}
|
|
@@ -146,7 +151,7 @@ async function ensureProjectId(projectPath, fs) {
|
|
|
146
151
|
const operatePath = Path.join(projectPath, OPERATE_FILE);
|
|
147
152
|
const operateExists = await fs.exists(operatePath);
|
|
148
153
|
if (operateExists) {
|
|
149
|
-
const operate = await
|
|
154
|
+
const operate = (await readJsonObjectFile(fs, operatePath))?.value;
|
|
150
155
|
if (operate && isNonEmptyString(operate.projectId)) {
|
|
151
156
|
return operate.projectId;
|
|
152
157
|
}
|
|
@@ -163,7 +168,7 @@ async function ensureProjectId(projectPath, fs) {
|
|
|
163
168
|
const projectFilePath = Path.join(projectPath, PROJECT_FILE);
|
|
164
169
|
const projectFileExists = await fs.exists(projectFilePath);
|
|
165
170
|
if (projectFileExists) {
|
|
166
|
-
const projectFile = await
|
|
171
|
+
const projectFile = (await readJsonObjectFile(fs, projectFilePath))?.value;
|
|
167
172
|
if (projectFile && isNonEmptyString(projectFile.projectId)) {
|
|
168
173
|
return projectFile.projectId;
|
|
169
174
|
}
|
|
@@ -183,7 +188,7 @@ async function ensureProjectIdInOperateFile(operateFilePath, fallbackProjectId,
|
|
|
183
188
|
if (!await fs.exists(operateFilePath)) {
|
|
184
189
|
return;
|
|
185
190
|
}
|
|
186
|
-
const parsed = await
|
|
191
|
+
const parsed = (await readJsonObjectFile(fs, operateFilePath))?.value;
|
|
187
192
|
if (!parsed) {
|
|
188
193
|
return;
|
|
189
194
|
}
|
|
@@ -208,15 +213,28 @@ var OPERATE_SCHEMA = "https://cloud.uipath.com/draft/2024-12/operate";
|
|
|
208
213
|
function withoutContentPrefix(filePath) {
|
|
209
214
|
return filePath.replace(/^\/?content\//, "");
|
|
210
215
|
}
|
|
211
|
-
function
|
|
212
|
-
|
|
213
|
-
|
|
214
|
-
|
|
215
|
-
|
|
216
|
-
|
|
217
|
-
|
|
218
|
-
|
|
219
|
-
|
|
216
|
+
function entryPointFile(filePath) {
|
|
217
|
+
const path = withoutContentPrefix(filePath);
|
|
218
|
+
const file = path.split("#")[0] ?? "";
|
|
219
|
+
return file.endsWith(".bpmn") ? file : path;
|
|
220
|
+
}
|
|
221
|
+
function hasFilePath(entry) {
|
|
222
|
+
return typeof entry === "object" && entry !== null && typeof entry.filePath === "string";
|
|
223
|
+
}
|
|
224
|
+
function isDefaultFlag(value) {
|
|
225
|
+
return value === true || value === "true";
|
|
226
|
+
}
|
|
227
|
+
function isDefaultEntryPoint(entry) {
|
|
228
|
+
return hasFilePath(entry) && isDefaultFlag(entry.isDefault);
|
|
229
|
+
}
|
|
230
|
+
function resolveOperateMainEntry(entryPoints, mainFile) {
|
|
231
|
+
const wanted = mainFile ? entryPointFile(mainFile) : undefined;
|
|
232
|
+
const inMainFile = wanted ? entryPoints.filter((entry) => hasFilePath(entry) && entryPointFile(entry.filePath) === wanted) : [];
|
|
233
|
+
return inMainFile.find(isDefaultEntryPoint) ?? inMainFile[0] ?? entryPoints.find(isDefaultEntryPoint) ?? entryPoints[0];
|
|
234
|
+
}
|
|
235
|
+
function resolveOperateMain(entryPoints, mainFile) {
|
|
236
|
+
const main = resolveOperateMainEntry(entryPoints, mainFile);
|
|
237
|
+
return main && hasFilePath(main) ? main.filePath : "";
|
|
220
238
|
}
|
|
221
239
|
async function resolveEntryPointMain(fs, sourceFolder, mainFile) {
|
|
222
240
|
const entryPointsFilePath = Path.join(sourceFolder, NugetConstants.EntryPointsFileName);
|
|
@@ -229,7 +247,7 @@ async function resolveEntryPointMain(fs, sourceFolder, mainFile) {
|
|
|
229
247
|
}
|
|
230
248
|
try {
|
|
231
249
|
const parsed = JSON.parse(new TextDecoder().decode(content));
|
|
232
|
-
return
|
|
250
|
+
return resolveOperateMain(parsed.entryPoints ?? [], mainFile);
|
|
233
251
|
} catch {
|
|
234
252
|
return "";
|
|
235
253
|
}
|
|
@@ -307,25 +325,25 @@ var x;
|
|
|
307
325
|
var i;
|
|
308
326
|
var hMap = function(cd, mb, r) {
|
|
309
327
|
var s = cd.length;
|
|
310
|
-
var
|
|
328
|
+
var i = 0;
|
|
311
329
|
var l = new u16(mb);
|
|
312
|
-
for (;
|
|
313
|
-
if (cd[
|
|
314
|
-
++l[cd[
|
|
330
|
+
for (;i < s; ++i) {
|
|
331
|
+
if (cd[i])
|
|
332
|
+
++l[cd[i] - 1];
|
|
315
333
|
}
|
|
316
334
|
var le = new u16(mb);
|
|
317
|
-
for (
|
|
318
|
-
le[
|
|
335
|
+
for (i = 1;i < mb; ++i) {
|
|
336
|
+
le[i] = le[i - 1] + l[i - 1] << 1;
|
|
319
337
|
}
|
|
320
338
|
var co;
|
|
321
339
|
if (r) {
|
|
322
340
|
co = new u16(1 << mb);
|
|
323
341
|
var rvb = 15 - mb;
|
|
324
|
-
for (
|
|
325
|
-
if (cd[
|
|
326
|
-
var sv =
|
|
327
|
-
var r_1 = mb - cd[
|
|
328
|
-
var v = le[cd[
|
|
342
|
+
for (i = 0;i < s; ++i) {
|
|
343
|
+
if (cd[i]) {
|
|
344
|
+
var sv = i << 4 | cd[i];
|
|
345
|
+
var r_1 = mb - cd[i];
|
|
346
|
+
var v = le[cd[i] - 1]++ << r_1;
|
|
329
347
|
for (var m = v | (1 << r_1) - 1;v <= m; ++v) {
|
|
330
348
|
co[rev[v] >> rvb] = sv;
|
|
331
349
|
}
|
|
@@ -333,9 +351,9 @@ var hMap = function(cd, mb, r) {
|
|
|
333
351
|
}
|
|
334
352
|
} else {
|
|
335
353
|
co = new u16(s);
|
|
336
|
-
for (
|
|
337
|
-
if (cd[
|
|
338
|
-
co[
|
|
354
|
+
for (i = 0;i < s; ++i) {
|
|
355
|
+
if (cd[i]) {
|
|
356
|
+
co[i] = rev[le[cd[i] - 1]++] >> 15 - cd[i];
|
|
339
357
|
}
|
|
340
358
|
}
|
|
341
359
|
}
|
|
@@ -364,9 +382,9 @@ var fdm = /* @__PURE__ */ hMap(fdt, 5, 0);
|
|
|
364
382
|
var fdrm = /* @__PURE__ */ hMap(fdt, 5, 1);
|
|
365
383
|
var max = function(a) {
|
|
366
384
|
var m = a[0];
|
|
367
|
-
for (var
|
|
368
|
-
if (a[
|
|
369
|
-
m = a[
|
|
385
|
+
for (var i = 1;i < a.length; ++i) {
|
|
386
|
+
if (a[i] > m)
|
|
387
|
+
m = a[i];
|
|
370
388
|
}
|
|
371
389
|
return m;
|
|
372
390
|
};
|
|
@@ -422,15 +440,15 @@ var inflt = function(dat, st, buf, dict) {
|
|
|
422
440
|
var noSt = st.i;
|
|
423
441
|
if (noBuf)
|
|
424
442
|
buf = new u8(sl * 3);
|
|
425
|
-
var cbuf = function(
|
|
443
|
+
var cbuf = function(l) {
|
|
426
444
|
var bl = buf.length;
|
|
427
|
-
if (
|
|
428
|
-
var nbuf = new u8(Math.max(bl * 2,
|
|
445
|
+
if (l > bl) {
|
|
446
|
+
var nbuf = new u8(Math.max(bl * 2, l));
|
|
429
447
|
nbuf.set(buf);
|
|
430
448
|
buf = nbuf;
|
|
431
449
|
}
|
|
432
450
|
};
|
|
433
|
-
var final = st.f || 0, pos = st.p || 0, bt = st.b || 0,
|
|
451
|
+
var final = st.f || 0, pos = st.p || 0, bt = st.b || 0, { l: lm, d: dm, m: lbt, n: dbt } = st;
|
|
434
452
|
var tbts = sl * 8;
|
|
435
453
|
do {
|
|
436
454
|
if (!lm) {
|
|
@@ -457,28 +475,28 @@ var inflt = function(dat, st, buf, dict) {
|
|
|
457
475
|
pos += 14;
|
|
458
476
|
var ldt = new u8(tl);
|
|
459
477
|
var clt = new u8(19);
|
|
460
|
-
for (var
|
|
461
|
-
clt[clim[
|
|
478
|
+
for (var i = 0;i < hcLen; ++i) {
|
|
479
|
+
clt[clim[i]] = bits(dat, pos + i * 3, 7);
|
|
462
480
|
}
|
|
463
481
|
pos += hcLen * 3;
|
|
464
482
|
var clb = max(clt), clbmsk = (1 << clb) - 1;
|
|
465
483
|
var clm = hMap(clt, clb, 1);
|
|
466
|
-
for (var
|
|
484
|
+
for (var i = 0;i < tl; ) {
|
|
467
485
|
var r = clm[bits(dat, pos, clbmsk)];
|
|
468
486
|
pos += r & 15;
|
|
469
487
|
var s = r >> 4;
|
|
470
488
|
if (s < 16) {
|
|
471
|
-
ldt[
|
|
489
|
+
ldt[i++] = s;
|
|
472
490
|
} else {
|
|
473
491
|
var c = 0, n = 0;
|
|
474
492
|
if (s == 16)
|
|
475
|
-
n = 3 + bits(dat, pos, 3), pos += 2, c = ldt[
|
|
493
|
+
n = 3 + bits(dat, pos, 3), pos += 2, c = ldt[i - 1];
|
|
476
494
|
else if (s == 17)
|
|
477
495
|
n = 3 + bits(dat, pos, 7), pos += 3;
|
|
478
496
|
else if (s == 18)
|
|
479
497
|
n = 11 + bits(dat, pos, 127), pos += 7;
|
|
480
498
|
while (n--)
|
|
481
|
-
ldt[
|
|
499
|
+
ldt[i++] = c;
|
|
482
500
|
}
|
|
483
501
|
}
|
|
484
502
|
var lt = ldt.subarray(0, hLit), dt = ldt.subarray(hLit);
|
|
@@ -516,8 +534,8 @@ var inflt = function(dat, st, buf, dict) {
|
|
|
516
534
|
} else {
|
|
517
535
|
var add = sym - 254;
|
|
518
536
|
if (sym > 264) {
|
|
519
|
-
var
|
|
520
|
-
add = bits(dat, pos, (1 << b) - 1) + fl[
|
|
537
|
+
var i = sym - 257, b = fleb[i];
|
|
538
|
+
add = bits(dat, pos, (1 << b) - 1) + fl[i];
|
|
521
539
|
pos += b;
|
|
522
540
|
}
|
|
523
541
|
var d = dm[bits16(dat, pos) & dms], dsym = d >> 4;
|
|
@@ -569,9 +587,9 @@ var wbits16 = function(d, p, v) {
|
|
|
569
587
|
};
|
|
570
588
|
var hTree = function(d, mb) {
|
|
571
589
|
var t = [];
|
|
572
|
-
for (var
|
|
573
|
-
if (d[
|
|
574
|
-
t.push({ s:
|
|
590
|
+
for (var i = 0;i < d.length; ++i) {
|
|
591
|
+
if (d[i])
|
|
592
|
+
t.push({ s: i, f: d[i] });
|
|
575
593
|
}
|
|
576
594
|
var s = t.length;
|
|
577
595
|
var t2 = t.slice();
|
|
@@ -586,28 +604,28 @@ var hTree = function(d, mb) {
|
|
|
586
604
|
return a.f - b.f;
|
|
587
605
|
});
|
|
588
606
|
t.push({ s: -1, f: 25001 });
|
|
589
|
-
var l = t[0], r = t[1], i0 = 0, i1 = 1,
|
|
607
|
+
var l = t[0], r = t[1], i0 = 0, i1 = 1, i2 = 2;
|
|
590
608
|
t[0] = { s: -1, f: l.f + r.f, l, r };
|
|
591
609
|
while (i1 != s - 1) {
|
|
592
|
-
l = t[t[i0].f < t[
|
|
593
|
-
r = t[i0 != i1 && t[i0].f < t[
|
|
610
|
+
l = t[t[i0].f < t[i2].f ? i0++ : i2++];
|
|
611
|
+
r = t[i0 != i1 && t[i0].f < t[i2].f ? i0++ : i2++];
|
|
594
612
|
t[i1++] = { s: -1, f: l.f + r.f, l, r };
|
|
595
613
|
}
|
|
596
614
|
var maxSym = t2[0].s;
|
|
597
|
-
for (var
|
|
598
|
-
if (t2[
|
|
599
|
-
maxSym = t2[
|
|
615
|
+
for (var i = 1;i < s; ++i) {
|
|
616
|
+
if (t2[i].s > maxSym)
|
|
617
|
+
maxSym = t2[i].s;
|
|
600
618
|
}
|
|
601
619
|
var tr = new u16(maxSym + 1);
|
|
602
620
|
var mbt = ln(t[i1 - 1], tr, 0);
|
|
603
621
|
if (mbt > mb) {
|
|
604
|
-
var
|
|
622
|
+
var i = 0, dt = 0;
|
|
605
623
|
var lft = mbt - mb, cst = 1 << lft;
|
|
606
624
|
t2.sort(function(a, b) {
|
|
607
625
|
return tr[b.s] - tr[a.s] || a.f - b.f;
|
|
608
626
|
});
|
|
609
|
-
for (;
|
|
610
|
-
var i2_1 = t2[
|
|
627
|
+
for (;i < s; ++i) {
|
|
628
|
+
var i2_1 = t2[i].s;
|
|
611
629
|
if (tr[i2_1] > mb) {
|
|
612
630
|
dt += cst - (1 << mbt - tr[i2_1]);
|
|
613
631
|
tr[i2_1] = mb;
|
|
@@ -616,14 +634,14 @@ var hTree = function(d, mb) {
|
|
|
616
634
|
}
|
|
617
635
|
dt >>= lft;
|
|
618
636
|
while (dt > 0) {
|
|
619
|
-
var i2_2 = t2[
|
|
637
|
+
var i2_2 = t2[i].s;
|
|
620
638
|
if (tr[i2_2] < mb)
|
|
621
639
|
dt -= 1 << mb - tr[i2_2]++ - 1;
|
|
622
640
|
else
|
|
623
|
-
++
|
|
641
|
+
++i;
|
|
624
642
|
}
|
|
625
|
-
for (;
|
|
626
|
-
var i2_3 = t2[
|
|
643
|
+
for (;i >= 0 && dt; --i) {
|
|
644
|
+
var i2_3 = t2[i].s;
|
|
627
645
|
if (tr[i2_3] == mb) {
|
|
628
646
|
--tr[i2_3];
|
|
629
647
|
++dt;
|
|
@@ -645,8 +663,8 @@ var lc = function(c) {
|
|
|
645
663
|
var w = function(v) {
|
|
646
664
|
cl[cli++] = v;
|
|
647
665
|
};
|
|
648
|
-
for (var
|
|
649
|
-
if (c[
|
|
666
|
+
for (var i = 1;i <= s; ++i) {
|
|
667
|
+
if (c[i] == cln && i != s)
|
|
650
668
|
++cls;
|
|
651
669
|
else {
|
|
652
670
|
if (!cln && cls > 2) {
|
|
@@ -666,15 +684,15 @@ var lc = function(c) {
|
|
|
666
684
|
while (cls--)
|
|
667
685
|
w(cln);
|
|
668
686
|
cls = 1;
|
|
669
|
-
cln = c[
|
|
687
|
+
cln = c[i];
|
|
670
688
|
}
|
|
671
689
|
}
|
|
672
690
|
return { c: cl.subarray(0, cli), n: s };
|
|
673
691
|
};
|
|
674
692
|
var clen = function(cf, cl) {
|
|
675
693
|
var l = 0;
|
|
676
|
-
for (var
|
|
677
|
-
l += cf[
|
|
694
|
+
for (var i = 0;i < cl.length; ++i)
|
|
695
|
+
l += cf[i] * cl[i];
|
|
678
696
|
return l;
|
|
679
697
|
};
|
|
680
698
|
var wfblk = function(out, pos, dat) {
|
|
@@ -684,23 +702,23 @@ var wfblk = function(out, pos, dat) {
|
|
|
684
702
|
out[o + 1] = s >> 8;
|
|
685
703
|
out[o + 2] = out[o] ^ 255;
|
|
686
704
|
out[o + 3] = out[o + 1] ^ 255;
|
|
687
|
-
for (var
|
|
688
|
-
out[o +
|
|
705
|
+
for (var i = 0;i < s; ++i)
|
|
706
|
+
out[o + i + 4] = dat[i];
|
|
689
707
|
return (o + 4 + s) * 8;
|
|
690
708
|
};
|
|
691
709
|
var wblk = function(dat, out, final, syms, lf, df, eb, li, bs, bl, p) {
|
|
692
710
|
wbits(out, p++, final);
|
|
693
711
|
++lf[256];
|
|
694
|
-
var
|
|
695
|
-
var
|
|
696
|
-
var _c = lc(dlt),
|
|
697
|
-
var _d = lc(ddt),
|
|
712
|
+
var _a = hTree(lf, 15), { t: dlt, l: mlb } = _a;
|
|
713
|
+
var _b = hTree(df, 15), { t: ddt, l: mdb } = _b;
|
|
714
|
+
var _c = lc(dlt), { c: lclt, n: nlc } = _c;
|
|
715
|
+
var _d = lc(ddt), { c: lcdt, n: ndc } = _d;
|
|
698
716
|
var lcfreq = new u16(19);
|
|
699
|
-
for (var
|
|
700
|
-
++lcfreq[lclt[
|
|
701
|
-
for (var
|
|
702
|
-
++lcfreq[lcdt[
|
|
703
|
-
var _e = hTree(lcfreq, 7),
|
|
717
|
+
for (var i = 0;i < lclt.length; ++i)
|
|
718
|
+
++lcfreq[lclt[i] & 31];
|
|
719
|
+
for (var i = 0;i < lcdt.length; ++i)
|
|
720
|
+
++lcfreq[lcdt[i] & 31];
|
|
721
|
+
var _e = hTree(lcfreq, 7), { t: lct, l: mlcb } = _e;
|
|
704
722
|
var nlcc = 19;
|
|
705
723
|
for (;nlcc > 4 && !lct[clim[nlcc - 1]]; --nlcc)
|
|
706
724
|
;
|
|
@@ -718,24 +736,24 @@ var wblk = function(dat, out, final, syms, lf, df, eb, li, bs, bl, p) {
|
|
|
718
736
|
wbits(out, p + 5, ndc - 1);
|
|
719
737
|
wbits(out, p + 10, nlcc - 4);
|
|
720
738
|
p += 14;
|
|
721
|
-
for (var
|
|
722
|
-
wbits(out, p + 3 *
|
|
739
|
+
for (var i = 0;i < nlcc; ++i)
|
|
740
|
+
wbits(out, p + 3 * i, lct[clim[i]]);
|
|
723
741
|
p += 3 * nlcc;
|
|
724
742
|
var lcts = [lclt, lcdt];
|
|
725
743
|
for (var it = 0;it < 2; ++it) {
|
|
726
744
|
var clct = lcts[it];
|
|
727
|
-
for (var
|
|
728
|
-
var len = clct[
|
|
745
|
+
for (var i = 0;i < clct.length; ++i) {
|
|
746
|
+
var len = clct[i] & 31;
|
|
729
747
|
wbits(out, p, llm[len]), p += lct[len];
|
|
730
748
|
if (len > 15)
|
|
731
|
-
wbits(out, p, clct[
|
|
749
|
+
wbits(out, p, clct[i] >> 5 & 127), p += clct[i] >> 12;
|
|
732
750
|
}
|
|
733
751
|
}
|
|
734
752
|
} else {
|
|
735
753
|
lm = flm, ll = flt, dm = fdm, dl = fdt;
|
|
736
754
|
}
|
|
737
|
-
for (var
|
|
738
|
-
var sym = syms[
|
|
755
|
+
for (var i = 0;i < li; ++i) {
|
|
756
|
+
var sym = syms[i];
|
|
739
757
|
if (sym > 255) {
|
|
740
758
|
var len = sym >> 18 & 31;
|
|
741
759
|
wbits16(out, p, lm[len + 257]), p += ll[len + 257];
|
|
@@ -768,36 +786,36 @@ var dflt = function(dat, lvl, plvl, pre, post, st) {
|
|
|
768
786
|
var msk_1 = (1 << plvl) - 1;
|
|
769
787
|
var prev = st.p || new u16(32768), head = st.h || new u16(msk_1 + 1);
|
|
770
788
|
var bs1_1 = Math.ceil(plvl / 3), bs2_1 = 2 * bs1_1;
|
|
771
|
-
var hsh = function(
|
|
772
|
-
return (dat[
|
|
789
|
+
var hsh = function(i) {
|
|
790
|
+
return (dat[i] ^ dat[i + 1] << bs1_1 ^ dat[i + 2] << bs2_1) & msk_1;
|
|
773
791
|
};
|
|
774
792
|
var syms = new i32(25000);
|
|
775
793
|
var lf = new u16(288), df = new u16(32);
|
|
776
|
-
var lc_1 = 0, eb = 0,
|
|
777
|
-
for (;
|
|
778
|
-
var hv = hsh(
|
|
779
|
-
var imod =
|
|
794
|
+
var lc_1 = 0, eb = 0, i = st.i || 0, li = 0, wi = st.w || 0, bs = 0;
|
|
795
|
+
for (;i + 2 < s; ++i) {
|
|
796
|
+
var hv = hsh(i);
|
|
797
|
+
var imod = i & 32767, pimod = head[hv];
|
|
780
798
|
prev[imod] = pimod;
|
|
781
799
|
head[hv] = imod;
|
|
782
|
-
if (wi <=
|
|
783
|
-
var rem = s -
|
|
800
|
+
if (wi <= i) {
|
|
801
|
+
var rem = s - i;
|
|
784
802
|
if ((lc_1 > 7000 || li > 24576) && (rem > 423 || !lst)) {
|
|
785
|
-
pos = wblk(dat, w, 0, syms, lf, df, eb, li, bs,
|
|
786
|
-
li = lc_1 = eb = 0, bs =
|
|
803
|
+
pos = wblk(dat, w, 0, syms, lf, df, eb, li, bs, i - bs, pos);
|
|
804
|
+
li = lc_1 = eb = 0, bs = i;
|
|
787
805
|
for (var j = 0;j < 286; ++j)
|
|
788
806
|
lf[j] = 0;
|
|
789
807
|
for (var j = 0;j < 30; ++j)
|
|
790
808
|
df[j] = 0;
|
|
791
809
|
}
|
|
792
810
|
var l = 2, d = 0, ch_1 = c, dif = imod - pimod & 32767;
|
|
793
|
-
if (rem > 2 && hv == hsh(
|
|
811
|
+
if (rem > 2 && hv == hsh(i - dif)) {
|
|
794
812
|
var maxn = Math.min(n, rem) - 1;
|
|
795
|
-
var maxd = Math.min(32767,
|
|
813
|
+
var maxd = Math.min(32767, i);
|
|
796
814
|
var ml = Math.min(258, rem);
|
|
797
815
|
while (dif <= maxd && --ch_1 && imod != pimod) {
|
|
798
|
-
if (dat[
|
|
816
|
+
if (dat[i + l] == dat[i + l - dif]) {
|
|
799
817
|
var nl = 0;
|
|
800
|
-
for (;nl < ml && dat[
|
|
818
|
+
for (;nl < ml && dat[i + nl] == dat[i + nl - dif]; ++nl)
|
|
801
819
|
;
|
|
802
820
|
if (nl > l) {
|
|
803
821
|
l = nl, d = dif;
|
|
@@ -806,7 +824,7 @@ var dflt = function(dat, lvl, plvl, pre, post, st) {
|
|
|
806
824
|
var mmd = Math.min(dif, nl - 2);
|
|
807
825
|
var md = 0;
|
|
808
826
|
for (var j = 0;j < mmd; ++j) {
|
|
809
|
-
var ti =
|
|
827
|
+
var ti = i - dif + j & 32767;
|
|
810
828
|
var pti = prev[ti];
|
|
811
829
|
var cd = ti - pti & 32767;
|
|
812
830
|
if (cd > md)
|
|
@@ -824,32 +842,32 @@ var dflt = function(dat, lvl, plvl, pre, post, st) {
|
|
|
824
842
|
eb += fleb[lin] + fdeb[din];
|
|
825
843
|
++lf[257 + lin];
|
|
826
844
|
++df[din];
|
|
827
|
-
wi =
|
|
845
|
+
wi = i + l;
|
|
828
846
|
++lc_1;
|
|
829
847
|
} else {
|
|
830
|
-
syms[li++] = dat[
|
|
831
|
-
++lf[dat[
|
|
848
|
+
syms[li++] = dat[i];
|
|
849
|
+
++lf[dat[i]];
|
|
832
850
|
}
|
|
833
851
|
}
|
|
834
852
|
}
|
|
835
|
-
for (
|
|
836
|
-
syms[li++] = dat[
|
|
837
|
-
++lf[dat[
|
|
853
|
+
for (i = Math.max(i, wi);i < s; ++i) {
|
|
854
|
+
syms[li++] = dat[i];
|
|
855
|
+
++lf[dat[i]];
|
|
838
856
|
}
|
|
839
|
-
pos = wblk(dat, w, lst, syms, lf, df, eb, li, bs,
|
|
857
|
+
pos = wblk(dat, w, lst, syms, lf, df, eb, li, bs, i - bs, pos);
|
|
840
858
|
if (!lst) {
|
|
841
859
|
st.r = pos & 7 | w[pos / 8 | 0] << 3;
|
|
842
860
|
pos -= 7;
|
|
843
|
-
st.h = head, st.p = prev, st.i =
|
|
861
|
+
st.h = head, st.p = prev, st.i = i, st.w = wi;
|
|
844
862
|
}
|
|
845
863
|
} else {
|
|
846
|
-
for (var
|
|
847
|
-
var e =
|
|
864
|
+
for (var i = st.w || 0;i < s + lst; i += 65535) {
|
|
865
|
+
var e = i + 65535;
|
|
848
866
|
if (e >= s) {
|
|
849
867
|
w[pos / 8 | 0] = lst;
|
|
850
868
|
e = s;
|
|
851
869
|
}
|
|
852
|
-
pos = wfblk(w, pos + 1, dat.subarray(
|
|
870
|
+
pos = wfblk(w, pos + 1, dat.subarray(i, e));
|
|
853
871
|
}
|
|
854
872
|
st.i = s;
|
|
855
873
|
}
|
|
@@ -857,11 +875,11 @@ var dflt = function(dat, lvl, plvl, pre, post, st) {
|
|
|
857
875
|
};
|
|
858
876
|
var crct = /* @__PURE__ */ function() {
|
|
859
877
|
var t = new Int32Array(256);
|
|
860
|
-
for (var
|
|
861
|
-
var c =
|
|
878
|
+
for (var i = 0;i < 256; ++i) {
|
|
879
|
+
var c = i, k = 9;
|
|
862
880
|
while (--k)
|
|
863
881
|
c = (c & 1 && -306674912) ^ c >>> 1;
|
|
864
|
-
t[
|
|
882
|
+
t[i] = c;
|
|
865
883
|
}
|
|
866
884
|
return t;
|
|
867
885
|
}();
|
|
@@ -870,8 +888,8 @@ var crc = function() {
|
|
|
870
888
|
return {
|
|
871
889
|
p: function(d) {
|
|
872
890
|
var cr = c;
|
|
873
|
-
for (var
|
|
874
|
-
cr = crct[cr & 255 ^ d[
|
|
891
|
+
for (var i = 0;i < d.length; ++i)
|
|
892
|
+
cr = crct[cr & 255 ^ d[i]] ^ cr >>> 8;
|
|
875
893
|
c = cr;
|
|
876
894
|
},
|
|
877
895
|
d: function() {
|
|
@@ -941,26 +959,26 @@ try {
|
|
|
941
959
|
tds = 1;
|
|
942
960
|
} catch (e) {}
|
|
943
961
|
var dutf8 = function(d) {
|
|
944
|
-
for (var r = "",
|
|
945
|
-
var c = d[
|
|
962
|
+
for (var r = "", i = 0;; ) {
|
|
963
|
+
var c = d[i++];
|
|
946
964
|
var eb = (c > 127) + (c > 223) + (c > 239);
|
|
947
|
-
if (
|
|
948
|
-
return { s: r, r: slc(d,
|
|
965
|
+
if (i + eb > d.length)
|
|
966
|
+
return { s: r, r: slc(d, i - 1) };
|
|
949
967
|
if (!eb)
|
|
950
968
|
r += String.fromCharCode(c);
|
|
951
969
|
else if (eb == 3) {
|
|
952
|
-
c = ((c & 15) << 18 | (d[
|
|
970
|
+
c = ((c & 15) << 18 | (d[i++] & 63) << 12 | (d[i++] & 63) << 6 | d[i++] & 63) - 65536, r += String.fromCharCode(55296 | c >> 10, 56320 | c & 1023);
|
|
953
971
|
} else if (eb & 1)
|
|
954
|
-
r += String.fromCharCode((c & 31) << 6 | d[
|
|
972
|
+
r += String.fromCharCode((c & 31) << 6 | d[i++] & 63);
|
|
955
973
|
else
|
|
956
|
-
r += String.fromCharCode((c & 15) << 12 | (d[
|
|
974
|
+
r += String.fromCharCode((c & 15) << 12 | (d[i++] & 63) << 6 | d[i++] & 63);
|
|
957
975
|
}
|
|
958
976
|
};
|
|
959
977
|
function strToU8(str, latin1) {
|
|
960
978
|
if (latin1) {
|
|
961
979
|
var ar_1 = new u8(str.length);
|
|
962
|
-
for (var
|
|
963
|
-
ar_1[
|
|
980
|
+
for (var i = 0;i < str.length; ++i)
|
|
981
|
+
ar_1[i] = str.charCodeAt(i);
|
|
964
982
|
return ar_1;
|
|
965
983
|
}
|
|
966
984
|
if (te)
|
|
@@ -971,19 +989,19 @@ function strToU8(str, latin1) {
|
|
|
971
989
|
var w = function(v) {
|
|
972
990
|
ar[ai++] = v;
|
|
973
991
|
};
|
|
974
|
-
for (var
|
|
992
|
+
for (var i = 0;i < l; ++i) {
|
|
975
993
|
if (ai + 5 > ar.length) {
|
|
976
|
-
var n = new u8(ai + 8 + (l -
|
|
994
|
+
var n = new u8(ai + 8 + (l - i << 1));
|
|
977
995
|
n.set(ar);
|
|
978
996
|
ar = n;
|
|
979
997
|
}
|
|
980
|
-
var c = str.charCodeAt(
|
|
998
|
+
var c = str.charCodeAt(i);
|
|
981
999
|
if (c < 128 || latin1)
|
|
982
1000
|
w(c);
|
|
983
1001
|
else if (c < 2048)
|
|
984
1002
|
w(192 | c >> 6), w(128 | c & 63);
|
|
985
1003
|
else if (c > 55295 && c < 57344)
|
|
986
|
-
c = 65536 + (c & 1023 << 10) | str.charCodeAt(++
|
|
1004
|
+
c = 65536 + (c & 1023 << 10) | str.charCodeAt(++i) & 1023, w(240 | c >> 18), w(128 | c >> 12 & 63), w(128 | c >> 6 & 63), w(128 | c & 63);
|
|
987
1005
|
else
|
|
988
1006
|
w(224 | c >> 12), w(128 | c >> 6 & 63), w(128 | c & 63);
|
|
989
1007
|
}
|
|
@@ -992,13 +1010,13 @@ function strToU8(str, latin1) {
|
|
|
992
1010
|
function strFromU8(dat, latin1) {
|
|
993
1011
|
if (latin1) {
|
|
994
1012
|
var r = "";
|
|
995
|
-
for (var
|
|
996
|
-
r += String.fromCharCode.apply(null, dat.subarray(
|
|
1013
|
+
for (var i = 0;i < dat.length; i += 16384)
|
|
1014
|
+
r += String.fromCharCode.apply(null, dat.subarray(i, i + 16384));
|
|
997
1015
|
return r;
|
|
998
1016
|
} else if (td) {
|
|
999
1017
|
return td.decode(dat);
|
|
1000
1018
|
} else {
|
|
1001
|
-
var
|
|
1019
|
+
var _a = dutf8(dat), { s, r } = _a;
|
|
1002
1020
|
if (r.length)
|
|
1003
1021
|
err(8);
|
|
1004
1022
|
return s;
|
|
@@ -1009,7 +1027,7 @@ var slzh = function(d, b) {
|
|
|
1009
1027
|
};
|
|
1010
1028
|
var zh = function(d, b, z) {
|
|
1011
1029
|
var fnl = b2(d, b + 28), efl = b2(d, b + 30), fn = strFromU8(d.subarray(b + 46, b + 46 + fnl), !(b2(d, b + 8) & 2048)), es = b + 46 + fnl;
|
|
1012
|
-
var
|
|
1030
|
+
var _a = z64hs(d, es, efl, z, b4(d, b + 20), b4(d, b + 24), b4(d, b + 42)), sc = _a[0], su = _a[1], off = _a[2];
|
|
1013
1031
|
return [b2(d, b + 10), sc, su, fn, es + efl + b2(d, b + 32), off];
|
|
1014
1032
|
};
|
|
1015
1033
|
var z64hs = function(d, b, l, z, sc, su, off) {
|
|
@@ -1044,7 +1062,7 @@ var exfl = function(ex) {
|
|
|
1044
1062
|
return le;
|
|
1045
1063
|
};
|
|
1046
1064
|
var wzh = function(d, b, f, fn, u, c, ce, co) {
|
|
1047
|
-
var
|
|
1065
|
+
var fl = fn.length, ex = f.extra, col = co && co.length;
|
|
1048
1066
|
var exl = exfl(ex);
|
|
1049
1067
|
wbytes(d, b, ce != null ? 33639248 : 67324752), b += 4;
|
|
1050
1068
|
if (ce != null)
|
|
@@ -1061,7 +1079,7 @@ var wzh = function(d, b, f, fn, u, c, ce, co) {
|
|
|
1061
1079
|
wbytes(d, b + 4, c < 0 ? -c - 2 : c);
|
|
1062
1080
|
wbytes(d, b + 8, f.size);
|
|
1063
1081
|
}
|
|
1064
|
-
wbytes(d, b + 12,
|
|
1082
|
+
wbytes(d, b + 12, fl);
|
|
1065
1083
|
wbytes(d, b + 14, exl), b += 16;
|
|
1066
1084
|
if (ce != null) {
|
|
1067
1085
|
wbytes(d, b, col);
|
|
@@ -1069,7 +1087,7 @@ var wzh = function(d, b, f, fn, u, c, ce, co) {
|
|
|
1069
1087
|
wbytes(d, b + 10, ce), b += 14;
|
|
1070
1088
|
}
|
|
1071
1089
|
d.set(fn, b);
|
|
1072
|
-
b +=
|
|
1090
|
+
b += fl;
|
|
1073
1091
|
if (exl) {
|
|
1074
1092
|
for (var k in ex) {
|
|
1075
1093
|
var exf = ex[k], l = exf.length;
|
|
@@ -1098,7 +1116,7 @@ function zipSync(data, opts) {
|
|
|
1098
1116
|
var o = 0;
|
|
1099
1117
|
var tot = 0;
|
|
1100
1118
|
for (var fn in r) {
|
|
1101
|
-
var
|
|
1119
|
+
var _a = r[fn], file = _a[0], p = _a[1];
|
|
1102
1120
|
var compression = p.level == 0 ? 0 : 8;
|
|
1103
1121
|
var f = strToU8(fn), s = f.length;
|
|
1104
1122
|
var com = p.comment, m = com && strToU8(com), ms = m && m.length;
|
|
@@ -1122,8 +1140,8 @@ function zipSync(data, opts) {
|
|
|
1122
1140
|
tot += 76 + 2 * (s + exl) + (ms || 0) + l;
|
|
1123
1141
|
}
|
|
1124
1142
|
var out = new u8(tot + 22), oe = o, cdl = tot - o;
|
|
1125
|
-
for (var
|
|
1126
|
-
var f = files[
|
|
1143
|
+
for (var i = 0;i < files.length; ++i) {
|
|
1144
|
+
var f = files[i];
|
|
1127
1145
|
wzh(out, f.o, f, f.f, f.u, f.c.length);
|
|
1128
1146
|
var badd = 30 + f.f.length + exfl(f.extra);
|
|
1129
1147
|
out.set(f.c, f.o + badd);
|
|
@@ -1153,8 +1171,8 @@ function unzipSync(data, opts) {
|
|
|
1153
1171
|
}
|
|
1154
1172
|
}
|
|
1155
1173
|
var fltr = opts && opts.filter;
|
|
1156
|
-
for (var
|
|
1157
|
-
var
|
|
1174
|
+
for (var i = 0;i < c; ++i) {
|
|
1175
|
+
var _a = zh(data, o, z), c_2 = _a[0], sc = _a[1], su = _a[2], fn = _a[3], no = _a[4], off = _a[5], b = slzh(data, off);
|
|
1158
1176
|
o = no;
|
|
1159
1177
|
if (!fltr || fltr({
|
|
1160
1178
|
name: fn,
|
|
@@ -1292,6 +1310,35 @@ class NugetPackager {
|
|
|
1292
1310
|
};
|
|
1293
1311
|
}
|
|
1294
1312
|
}
|
|
1313
|
+
// ../packager/packager-core/src/services/project-identity.ts
|
|
1314
|
+
async function readIdentityJson(fs, path) {
|
|
1315
|
+
const stat = await fs.stat(path);
|
|
1316
|
+
if (!stat)
|
|
1317
|
+
return;
|
|
1318
|
+
if (!stat.isFile() || stat.size > 1024 * 1024)
|
|
1319
|
+
throw new Error("Invalid identity metadata");
|
|
1320
|
+
const text = await fs.readFile(path, "utf-8");
|
|
1321
|
+
if (text === null)
|
|
1322
|
+
return;
|
|
1323
|
+
const value = JSON.parse(text);
|
|
1324
|
+
if (!value || typeof value !== "object" || Array.isArray(value)) {
|
|
1325
|
+
throw new Error("Invalid identity metadata");
|
|
1326
|
+
}
|
|
1327
|
+
return value;
|
|
1328
|
+
}
|
|
1329
|
+
async function readIdentityField(fs, file, fields) {
|
|
1330
|
+
let value = await readIdentityJson(fs, file);
|
|
1331
|
+
for (const field of fields) {
|
|
1332
|
+
if (!value || typeof value !== "object")
|
|
1333
|
+
return;
|
|
1334
|
+
value = value[field];
|
|
1335
|
+
}
|
|
1336
|
+
if (value === undefined || value === null || value === "")
|
|
1337
|
+
return;
|
|
1338
|
+
if (typeof value !== "string" || !value.trim())
|
|
1339
|
+
throw new Error("Invalid project identity");
|
|
1340
|
+
return value;
|
|
1341
|
+
}
|
|
1295
1342
|
// ../packager/packager-core/src/models/tool-result.ts
|
|
1296
1343
|
class ToolResult {
|
|
1297
1344
|
errorCode;
|
|
@@ -2378,6 +2425,6 @@ class LogMessage {
|
|
|
2378
2425
|
return parts.join(" ");
|
|
2379
2426
|
}
|
|
2380
2427
|
}
|
|
2381
|
-
export { Path, TemporaryStorageService, ZipService, I18nManager, translate, normalizeIgnoredRules, LogMessage, NugetConstants, ToolResult, ensureContentOperateFile, NugetPackager, ProjectTool, toolsFactoryRepository };
|
|
2428
|
+
export { Path, TemporaryStorageService, ZipService, I18nManager, translate, normalizeIgnoredRules, LogMessage, NugetConstants, ToolResult, ensureContentOperateFile, NugetPackager, readIdentityJson, readIdentityField, ProjectTool, toolsFactoryRepository };
|
|
2382
2429
|
|
|
2383
|
-
//# debugId=
|
|
2430
|
+
//# debugId=82649604C52D7E3564756E2164756E21
|