@uipath/codedapp-tool 1.205.0-preview.276 → 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 +48 -0
- package/dist/{browser-strategy-6atc7v8s.js → browser-strategy-z97p0ezf.js} +5 -6
- package/dist/{embedded-file-reader-r66242ey.js → embedded-file-reader-0228j82a.js} +1 -4
- package/dist/first-party-service-ahcc6xc6.js +8 -0
- package/dist/{index-0k30knwv.js → index-0py5k2e9.js} +177 -2055
- package/dist/index-c3zcyvwz.js +20 -0
- package/dist/index-cw1j9s6d.js +3176 -0
- package/dist/{index-h8cph72k.js → index-nzr4mx5p.js} +2 -22
- package/dist/index-z2qk2qn6.js +24 -0
- package/dist/index.js +14 -17
- package/dist/{jmespath-e4a59c8w.js → jmespath-wwym30dp.js} +1 -1
- package/dist/{js-yaml-87cdx6bm.js → js-yaml-a2bk27p6.js} +1 -3
- package/dist/{node-strategy-myagr1zp.js → node-strategy-fk02jqd8.js} +9 -12
- package/dist/{packager-tool-5ebgtev7.js → packager-tool-06tdd0p9.js} +3168 -3092
- package/dist/{packager-tool-je2re4j6.js → packager-tool-0ajs8pnk.js} +53 -8
- package/dist/{packager-tool-vc19fcdp.js → packager-tool-19x86hb2.js} +3 -21
- package/dist/{packager-tool-0gctz400.js → packager-tool-2rwzcase.js} +2 -5
- package/dist/{packager-tool-s8h46737.js → packager-tool-3ss96mpk.js} +82 -709
- package/dist/{packager-tool-d94wjncg.js → packager-tool-5t7c439j.js} +97 -97
- package/dist/{packager-tool-1yh8g550.js → packager-tool-6an893wm.js} +12 -3
- package/dist/packager-tool-8pm90w77.js +6640 -0
- package/dist/{packager-tool-8zq6m3bp.js → packager-tool-9hsas3s8.js} +1676 -1451
- package/dist/{packager-tool-cmfktvbt.js → packager-tool-h9q8znad.js} +885 -439
- package/dist/{packager-tool-gdtpsdn7.js → packager-tool-mm1x18d6.js} +223 -28
- package/dist/{packager-tool-qa9gftnj.js → packager-tool-xd2w5pct.js} +3 -3
- package/dist/packager-tool.js +7 -8
- package/dist/tool.js +13 -16
- package/package.json +2 -2
- package/dist/first-party-service-srxaftkn.js +0 -27
- package/dist/index-78bnpdqb.js +0 -3177
- package/dist/index-kmp9fmhb.js +0 -25
- package/dist/index-wbp18pm0.js +0 -157
- package/dist/packager-tool-53w8skv5.js +0 -262
- package/dist/packager-tool-m7tmga2c.js +0 -20538
- /package/dist/{packager-tool-yc4kw997.js → packager-tool-1qg04b7q.js} +0 -0
|
@@ -157,25 +157,25 @@ var x;
|
|
|
157
157
|
var i;
|
|
158
158
|
var hMap = function(cd, mb, r) {
|
|
159
159
|
var s = cd.length;
|
|
160
|
-
var
|
|
160
|
+
var i = 0;
|
|
161
161
|
var l = new u16(mb);
|
|
162
|
-
for (;
|
|
163
|
-
if (cd[
|
|
164
|
-
++l[cd[
|
|
162
|
+
for (;i < s; ++i) {
|
|
163
|
+
if (cd[i])
|
|
164
|
+
++l[cd[i] - 1];
|
|
165
165
|
}
|
|
166
166
|
var le = new u16(mb);
|
|
167
|
-
for (
|
|
168
|
-
le[
|
|
167
|
+
for (i = 1;i < mb; ++i) {
|
|
168
|
+
le[i] = le[i - 1] + l[i - 1] << 1;
|
|
169
169
|
}
|
|
170
170
|
var co;
|
|
171
171
|
if (r) {
|
|
172
172
|
co = new u16(1 << mb);
|
|
173
173
|
var rvb = 15 - mb;
|
|
174
|
-
for (
|
|
175
|
-
if (cd[
|
|
176
|
-
var sv =
|
|
177
|
-
var r_1 = mb - cd[
|
|
178
|
-
var v = le[cd[
|
|
174
|
+
for (i = 0;i < s; ++i) {
|
|
175
|
+
if (cd[i]) {
|
|
176
|
+
var sv = i << 4 | cd[i];
|
|
177
|
+
var r_1 = mb - cd[i];
|
|
178
|
+
var v = le[cd[i] - 1]++ << r_1;
|
|
179
179
|
for (var m = v | (1 << r_1) - 1;v <= m; ++v) {
|
|
180
180
|
co[rev[v] >> rvb] = sv;
|
|
181
181
|
}
|
|
@@ -183,9 +183,9 @@ var hMap = function(cd, mb, r) {
|
|
|
183
183
|
}
|
|
184
184
|
} else {
|
|
185
185
|
co = new u16(s);
|
|
186
|
-
for (
|
|
187
|
-
if (cd[
|
|
188
|
-
co[
|
|
186
|
+
for (i = 0;i < s; ++i) {
|
|
187
|
+
if (cd[i]) {
|
|
188
|
+
co[i] = rev[le[cd[i] - 1]++] >> 15 - cd[i];
|
|
189
189
|
}
|
|
190
190
|
}
|
|
191
191
|
}
|
|
@@ -260,9 +260,9 @@ var wbits16 = function(d, p, v) {
|
|
|
260
260
|
};
|
|
261
261
|
var hTree = function(d, mb) {
|
|
262
262
|
var t = [];
|
|
263
|
-
for (var
|
|
264
|
-
if (d[
|
|
265
|
-
t.push({ s:
|
|
263
|
+
for (var i = 0;i < d.length; ++i) {
|
|
264
|
+
if (d[i])
|
|
265
|
+
t.push({ s: i, f: d[i] });
|
|
266
266
|
}
|
|
267
267
|
var s = t.length;
|
|
268
268
|
var t2 = t.slice();
|
|
@@ -277,28 +277,28 @@ var hTree = function(d, mb) {
|
|
|
277
277
|
return a.f - b.f;
|
|
278
278
|
});
|
|
279
279
|
t.push({ s: -1, f: 25001 });
|
|
280
|
-
var l = t[0], r = t[1], i0 = 0, i1 = 1,
|
|
280
|
+
var l = t[0], r = t[1], i0 = 0, i1 = 1, i2 = 2;
|
|
281
281
|
t[0] = { s: -1, f: l.f + r.f, l, r };
|
|
282
282
|
while (i1 != s - 1) {
|
|
283
|
-
l = t[t[i0].f < t[
|
|
284
|
-
r = t[i0 != i1 && t[i0].f < t[
|
|
283
|
+
l = t[t[i0].f < t[i2].f ? i0++ : i2++];
|
|
284
|
+
r = t[i0 != i1 && t[i0].f < t[i2].f ? i0++ : i2++];
|
|
285
285
|
t[i1++] = { s: -1, f: l.f + r.f, l, r };
|
|
286
286
|
}
|
|
287
287
|
var maxSym = t2[0].s;
|
|
288
|
-
for (var
|
|
289
|
-
if (t2[
|
|
290
|
-
maxSym = t2[
|
|
288
|
+
for (var i = 1;i < s; ++i) {
|
|
289
|
+
if (t2[i].s > maxSym)
|
|
290
|
+
maxSym = t2[i].s;
|
|
291
291
|
}
|
|
292
292
|
var tr = new u16(maxSym + 1);
|
|
293
293
|
var mbt = ln(t[i1 - 1], tr, 0);
|
|
294
294
|
if (mbt > mb) {
|
|
295
|
-
var
|
|
295
|
+
var i = 0, dt = 0;
|
|
296
296
|
var lft = mbt - mb, cst = 1 << lft;
|
|
297
297
|
t2.sort(function(a, b) {
|
|
298
298
|
return tr[b.s] - tr[a.s] || a.f - b.f;
|
|
299
299
|
});
|
|
300
|
-
for (;
|
|
301
|
-
var i2_1 = t2[
|
|
300
|
+
for (;i < s; ++i) {
|
|
301
|
+
var i2_1 = t2[i].s;
|
|
302
302
|
if (tr[i2_1] > mb) {
|
|
303
303
|
dt += cst - (1 << mbt - tr[i2_1]);
|
|
304
304
|
tr[i2_1] = mb;
|
|
@@ -307,14 +307,14 @@ var hTree = function(d, mb) {
|
|
|
307
307
|
}
|
|
308
308
|
dt >>= lft;
|
|
309
309
|
while (dt > 0) {
|
|
310
|
-
var i2_2 = t2[
|
|
310
|
+
var i2_2 = t2[i].s;
|
|
311
311
|
if (tr[i2_2] < mb)
|
|
312
312
|
dt -= 1 << mb - tr[i2_2]++ - 1;
|
|
313
313
|
else
|
|
314
|
-
++
|
|
314
|
+
++i;
|
|
315
315
|
}
|
|
316
|
-
for (;
|
|
317
|
-
var i2_3 = t2[
|
|
316
|
+
for (;i >= 0 && dt; --i) {
|
|
317
|
+
var i2_3 = t2[i].s;
|
|
318
318
|
if (tr[i2_3] == mb) {
|
|
319
319
|
--tr[i2_3];
|
|
320
320
|
++dt;
|
|
@@ -336,8 +336,8 @@ var lc = function(c) {
|
|
|
336
336
|
var w = function(v) {
|
|
337
337
|
cl[cli++] = v;
|
|
338
338
|
};
|
|
339
|
-
for (var
|
|
340
|
-
if (c[
|
|
339
|
+
for (var i = 1;i <= s; ++i) {
|
|
340
|
+
if (c[i] == cln && i != s)
|
|
341
341
|
++cls;
|
|
342
342
|
else {
|
|
343
343
|
if (!cln && cls > 2) {
|
|
@@ -357,15 +357,15 @@ var lc = function(c) {
|
|
|
357
357
|
while (cls--)
|
|
358
358
|
w(cln);
|
|
359
359
|
cls = 1;
|
|
360
|
-
cln = c[
|
|
360
|
+
cln = c[i];
|
|
361
361
|
}
|
|
362
362
|
}
|
|
363
363
|
return { c: cl.subarray(0, cli), n: s };
|
|
364
364
|
};
|
|
365
365
|
var clen = function(cf, cl) {
|
|
366
366
|
var l = 0;
|
|
367
|
-
for (var
|
|
368
|
-
l += cf[
|
|
367
|
+
for (var i = 0;i < cl.length; ++i)
|
|
368
|
+
l += cf[i] * cl[i];
|
|
369
369
|
return l;
|
|
370
370
|
};
|
|
371
371
|
var wfblk = function(out, pos, dat) {
|
|
@@ -375,23 +375,23 @@ var wfblk = function(out, pos, dat) {
|
|
|
375
375
|
out[o + 1] = s >> 8;
|
|
376
376
|
out[o + 2] = out[o] ^ 255;
|
|
377
377
|
out[o + 3] = out[o + 1] ^ 255;
|
|
378
|
-
for (var
|
|
379
|
-
out[o +
|
|
378
|
+
for (var i = 0;i < s; ++i)
|
|
379
|
+
out[o + i + 4] = dat[i];
|
|
380
380
|
return (o + 4 + s) * 8;
|
|
381
381
|
};
|
|
382
382
|
var wblk = function(dat, out, final, syms, lf, df, eb, li, bs, bl, p) {
|
|
383
383
|
wbits(out, p++, final);
|
|
384
384
|
++lf[256];
|
|
385
|
-
var
|
|
386
|
-
var
|
|
387
|
-
var _c = lc(dlt),
|
|
388
|
-
var _d = lc(ddt),
|
|
385
|
+
var _a = hTree(lf, 15), { t: dlt, l: mlb } = _a;
|
|
386
|
+
var _b = hTree(df, 15), { t: ddt, l: mdb } = _b;
|
|
387
|
+
var _c = lc(dlt), { c: lclt, n: nlc } = _c;
|
|
388
|
+
var _d = lc(ddt), { c: lcdt, n: ndc } = _d;
|
|
389
389
|
var lcfreq = new u16(19);
|
|
390
|
-
for (var
|
|
391
|
-
++lcfreq[lclt[
|
|
392
|
-
for (var
|
|
393
|
-
++lcfreq[lcdt[
|
|
394
|
-
var _e = hTree(lcfreq, 7),
|
|
390
|
+
for (var i = 0;i < lclt.length; ++i)
|
|
391
|
+
++lcfreq[lclt[i] & 31];
|
|
392
|
+
for (var i = 0;i < lcdt.length; ++i)
|
|
393
|
+
++lcfreq[lcdt[i] & 31];
|
|
394
|
+
var _e = hTree(lcfreq, 7), { t: lct, l: mlcb } = _e;
|
|
395
395
|
var nlcc = 19;
|
|
396
396
|
for (;nlcc > 4 && !lct[clim[nlcc - 1]]; --nlcc)
|
|
397
397
|
;
|
|
@@ -409,24 +409,24 @@ var wblk = function(dat, out, final, syms, lf, df, eb, li, bs, bl, p) {
|
|
|
409
409
|
wbits(out, p + 5, ndc - 1);
|
|
410
410
|
wbits(out, p + 10, nlcc - 4);
|
|
411
411
|
p += 14;
|
|
412
|
-
for (var
|
|
413
|
-
wbits(out, p + 3 *
|
|
412
|
+
for (var i = 0;i < nlcc; ++i)
|
|
413
|
+
wbits(out, p + 3 * i, lct[clim[i]]);
|
|
414
414
|
p += 3 * nlcc;
|
|
415
415
|
var lcts = [lclt, lcdt];
|
|
416
416
|
for (var it = 0;it < 2; ++it) {
|
|
417
417
|
var clct = lcts[it];
|
|
418
|
-
for (var
|
|
419
|
-
var len = clct[
|
|
418
|
+
for (var i = 0;i < clct.length; ++i) {
|
|
419
|
+
var len = clct[i] & 31;
|
|
420
420
|
wbits(out, p, llm[len]), p += lct[len];
|
|
421
421
|
if (len > 15)
|
|
422
|
-
wbits(out, p, clct[
|
|
422
|
+
wbits(out, p, clct[i] >> 5 & 127), p += clct[i] >> 12;
|
|
423
423
|
}
|
|
424
424
|
}
|
|
425
425
|
} else {
|
|
426
426
|
lm = flm, ll = flt, dm = fdm, dl = fdt;
|
|
427
427
|
}
|
|
428
|
-
for (var
|
|
429
|
-
var sym = syms[
|
|
428
|
+
for (var i = 0;i < li; ++i) {
|
|
429
|
+
var sym = syms[i];
|
|
430
430
|
if (sym > 255) {
|
|
431
431
|
var len = sym >> 18 & 31;
|
|
432
432
|
wbits16(out, p, lm[len + 257]), p += ll[len + 257];
|
|
@@ -459,36 +459,36 @@ var dflt = function(dat, lvl, plvl, pre, post, st) {
|
|
|
459
459
|
var msk_1 = (1 << plvl) - 1;
|
|
460
460
|
var prev = st.p || new u16(32768), head = st.h || new u16(msk_1 + 1);
|
|
461
461
|
var bs1_1 = Math.ceil(plvl / 3), bs2_1 = 2 * bs1_1;
|
|
462
|
-
var hsh = function(
|
|
463
|
-
return (dat[
|
|
462
|
+
var hsh = function(i) {
|
|
463
|
+
return (dat[i] ^ dat[i + 1] << bs1_1 ^ dat[i + 2] << bs2_1) & msk_1;
|
|
464
464
|
};
|
|
465
465
|
var syms = new i32(25000);
|
|
466
466
|
var lf = new u16(288), df = new u16(32);
|
|
467
|
-
var lc_1 = 0, eb = 0,
|
|
468
|
-
for (;
|
|
469
|
-
var hv = hsh(
|
|
470
|
-
var imod =
|
|
467
|
+
var lc_1 = 0, eb = 0, i = st.i || 0, li = 0, wi = st.w || 0, bs = 0;
|
|
468
|
+
for (;i + 2 < s; ++i) {
|
|
469
|
+
var hv = hsh(i);
|
|
470
|
+
var imod = i & 32767, pimod = head[hv];
|
|
471
471
|
prev[imod] = pimod;
|
|
472
472
|
head[hv] = imod;
|
|
473
|
-
if (wi <=
|
|
474
|
-
var rem = s -
|
|
473
|
+
if (wi <= i) {
|
|
474
|
+
var rem = s - i;
|
|
475
475
|
if ((lc_1 > 7000 || li > 24576) && (rem > 423 || !lst)) {
|
|
476
|
-
pos = wblk(dat, w, 0, syms, lf, df, eb, li, bs,
|
|
477
|
-
li = lc_1 = eb = 0, bs =
|
|
476
|
+
pos = wblk(dat, w, 0, syms, lf, df, eb, li, bs, i - bs, pos);
|
|
477
|
+
li = lc_1 = eb = 0, bs = i;
|
|
478
478
|
for (var j = 0;j < 286; ++j)
|
|
479
479
|
lf[j] = 0;
|
|
480
480
|
for (var j = 0;j < 30; ++j)
|
|
481
481
|
df[j] = 0;
|
|
482
482
|
}
|
|
483
483
|
var l = 2, d = 0, ch_1 = c, dif = imod - pimod & 32767;
|
|
484
|
-
if (rem > 2 && hv == hsh(
|
|
484
|
+
if (rem > 2 && hv == hsh(i - dif)) {
|
|
485
485
|
var maxn = Math.min(n, rem) - 1;
|
|
486
|
-
var maxd = Math.min(32767,
|
|
486
|
+
var maxd = Math.min(32767, i);
|
|
487
487
|
var ml = Math.min(258, rem);
|
|
488
488
|
while (dif <= maxd && --ch_1 && imod != pimod) {
|
|
489
|
-
if (dat[
|
|
489
|
+
if (dat[i + l] == dat[i + l - dif]) {
|
|
490
490
|
var nl = 0;
|
|
491
|
-
for (;nl < ml && dat[
|
|
491
|
+
for (;nl < ml && dat[i + nl] == dat[i + nl - dif]; ++nl)
|
|
492
492
|
;
|
|
493
493
|
if (nl > l) {
|
|
494
494
|
l = nl, d = dif;
|
|
@@ -497,7 +497,7 @@ var dflt = function(dat, lvl, plvl, pre, post, st) {
|
|
|
497
497
|
var mmd = Math.min(dif, nl - 2);
|
|
498
498
|
var md = 0;
|
|
499
499
|
for (var j = 0;j < mmd; ++j) {
|
|
500
|
-
var ti =
|
|
500
|
+
var ti = i - dif + j & 32767;
|
|
501
501
|
var pti = prev[ti];
|
|
502
502
|
var cd = ti - pti & 32767;
|
|
503
503
|
if (cd > md)
|
|
@@ -515,32 +515,32 @@ var dflt = function(dat, lvl, plvl, pre, post, st) {
|
|
|
515
515
|
eb += fleb[lin] + fdeb[din];
|
|
516
516
|
++lf[257 + lin];
|
|
517
517
|
++df[din];
|
|
518
|
-
wi =
|
|
518
|
+
wi = i + l;
|
|
519
519
|
++lc_1;
|
|
520
520
|
} else {
|
|
521
|
-
syms[li++] = dat[
|
|
522
|
-
++lf[dat[
|
|
521
|
+
syms[li++] = dat[i];
|
|
522
|
+
++lf[dat[i]];
|
|
523
523
|
}
|
|
524
524
|
}
|
|
525
525
|
}
|
|
526
|
-
for (
|
|
527
|
-
syms[li++] = dat[
|
|
528
|
-
++lf[dat[
|
|
526
|
+
for (i = Math.max(i, wi);i < s; ++i) {
|
|
527
|
+
syms[li++] = dat[i];
|
|
528
|
+
++lf[dat[i]];
|
|
529
529
|
}
|
|
530
|
-
pos = wblk(dat, w, lst, syms, lf, df, eb, li, bs,
|
|
530
|
+
pos = wblk(dat, w, lst, syms, lf, df, eb, li, bs, i - bs, pos);
|
|
531
531
|
if (!lst) {
|
|
532
532
|
st.r = pos & 7 | w[pos / 8 | 0] << 3;
|
|
533
533
|
pos -= 7;
|
|
534
|
-
st.h = head, st.p = prev, st.i =
|
|
534
|
+
st.h = head, st.p = prev, st.i = i, st.w = wi;
|
|
535
535
|
}
|
|
536
536
|
} else {
|
|
537
|
-
for (var
|
|
538
|
-
var e =
|
|
537
|
+
for (var i = st.w || 0;i < s + lst; i += 65535) {
|
|
538
|
+
var e = i + 65535;
|
|
539
539
|
if (e >= s) {
|
|
540
540
|
w[pos / 8 | 0] = lst;
|
|
541
541
|
e = s;
|
|
542
542
|
}
|
|
543
|
-
pos = wfblk(w, pos + 1, dat.subarray(
|
|
543
|
+
pos = wfblk(w, pos + 1, dat.subarray(i, e));
|
|
544
544
|
}
|
|
545
545
|
st.i = s;
|
|
546
546
|
}
|
|
@@ -548,11 +548,11 @@ var dflt = function(dat, lvl, plvl, pre, post, st) {
|
|
|
548
548
|
};
|
|
549
549
|
var crct = /* @__PURE__ */ function() {
|
|
550
550
|
var t = new Int32Array(256);
|
|
551
|
-
for (var
|
|
552
|
-
var c =
|
|
551
|
+
for (var i = 0;i < 256; ++i) {
|
|
552
|
+
var c = i, k = 9;
|
|
553
553
|
while (--k)
|
|
554
554
|
c = (c & 1 && -306674912) ^ c >>> 1;
|
|
555
|
-
t[
|
|
555
|
+
t[i] = c;
|
|
556
556
|
}
|
|
557
557
|
return t;
|
|
558
558
|
}();
|
|
@@ -561,8 +561,8 @@ var crc = function() {
|
|
|
561
561
|
return {
|
|
562
562
|
p: function(d) {
|
|
563
563
|
var cr = c;
|
|
564
|
-
for (var
|
|
565
|
-
cr = crct[cr & 255 ^ d[
|
|
564
|
+
for (var i = 0;i < d.length; ++i)
|
|
565
|
+
cr = crct[cr & 255 ^ d[i]] ^ cr >>> 8;
|
|
566
566
|
c = cr;
|
|
567
567
|
},
|
|
568
568
|
d: function() {
|
|
@@ -622,8 +622,8 @@ try {
|
|
|
622
622
|
function strToU8(str, latin1) {
|
|
623
623
|
if (latin1) {
|
|
624
624
|
var ar_1 = new u8(str.length);
|
|
625
|
-
for (var
|
|
626
|
-
ar_1[
|
|
625
|
+
for (var i = 0;i < str.length; ++i)
|
|
626
|
+
ar_1[i] = str.charCodeAt(i);
|
|
627
627
|
return ar_1;
|
|
628
628
|
}
|
|
629
629
|
if (te)
|
|
@@ -634,19 +634,19 @@ function strToU8(str, latin1) {
|
|
|
634
634
|
var w = function(v) {
|
|
635
635
|
ar[ai++] = v;
|
|
636
636
|
};
|
|
637
|
-
for (var
|
|
637
|
+
for (var i = 0;i < l; ++i) {
|
|
638
638
|
if (ai + 5 > ar.length) {
|
|
639
|
-
var n = new u8(ai + 8 + (l -
|
|
639
|
+
var n = new u8(ai + 8 + (l - i << 1));
|
|
640
640
|
n.set(ar);
|
|
641
641
|
ar = n;
|
|
642
642
|
}
|
|
643
|
-
var c = str.charCodeAt(
|
|
643
|
+
var c = str.charCodeAt(i);
|
|
644
644
|
if (c < 128 || latin1)
|
|
645
645
|
w(c);
|
|
646
646
|
else if (c < 2048)
|
|
647
647
|
w(192 | c >> 6), w(128 | c & 63);
|
|
648
648
|
else if (c > 55295 && c < 57344)
|
|
649
|
-
c = 65536 + (c & 1023 << 10) | str.charCodeAt(++
|
|
649
|
+
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);
|
|
650
650
|
else
|
|
651
651
|
w(224 | c >> 12), w(128 | c >> 6 & 63), w(128 | c & 63);
|
|
652
652
|
}
|
|
@@ -665,7 +665,7 @@ var exfl = function(ex) {
|
|
|
665
665
|
return le;
|
|
666
666
|
};
|
|
667
667
|
var wzh = function(d, b, f, fn, u, c, ce, co) {
|
|
668
|
-
var
|
|
668
|
+
var fl = fn.length, ex = f.extra, col = co && co.length;
|
|
669
669
|
var exl = exfl(ex);
|
|
670
670
|
wbytes(d, b, ce != null ? 33639248 : 67324752), b += 4;
|
|
671
671
|
if (ce != null)
|
|
@@ -682,7 +682,7 @@ var wzh = function(d, b, f, fn, u, c, ce, co) {
|
|
|
682
682
|
wbytes(d, b + 4, c < 0 ? -c - 2 : c);
|
|
683
683
|
wbytes(d, b + 8, f.size);
|
|
684
684
|
}
|
|
685
|
-
wbytes(d, b + 12,
|
|
685
|
+
wbytes(d, b + 12, fl);
|
|
686
686
|
wbytes(d, b + 14, exl), b += 16;
|
|
687
687
|
if (ce != null) {
|
|
688
688
|
wbytes(d, b, col);
|
|
@@ -690,7 +690,7 @@ var wzh = function(d, b, f, fn, u, c, ce, co) {
|
|
|
690
690
|
wbytes(d, b + 10, ce), b += 14;
|
|
691
691
|
}
|
|
692
692
|
d.set(fn, b);
|
|
693
|
-
b +=
|
|
693
|
+
b += fl;
|
|
694
694
|
if (exl) {
|
|
695
695
|
for (var k in ex) {
|
|
696
696
|
var exf = ex[k], l = exf.length;
|
|
@@ -719,7 +719,7 @@ function zipSync(data, opts) {
|
|
|
719
719
|
var o = 0;
|
|
720
720
|
var tot = 0;
|
|
721
721
|
for (var fn in r) {
|
|
722
|
-
var
|
|
722
|
+
var _a = r[fn], file = _a[0], p = _a[1];
|
|
723
723
|
var compression = p.level == 0 ? 0 : 8;
|
|
724
724
|
var f = strToU8(fn), s = f.length;
|
|
725
725
|
var com = p.comment, m = com && strToU8(com), ms = m && m.length;
|
|
@@ -743,8 +743,8 @@ function zipSync(data, opts) {
|
|
|
743
743
|
tot += 76 + 2 * (s + exl) + (ms || 0) + l;
|
|
744
744
|
}
|
|
745
745
|
var out = new u8(tot + 22), oe = o, cdl = tot - o;
|
|
746
|
-
for (var
|
|
747
|
-
var f = files[
|
|
746
|
+
for (var i = 0;i < files.length; ++i) {
|
|
747
|
+
var f = files[i];
|
|
748
748
|
wzh(out, f.o, f, f.f, f.u, f.c.length);
|
|
749
749
|
var badd = 30 + f.f.length + exfl(f.extra);
|
|
750
750
|
out.set(f.c, f.o + badd);
|
|
@@ -1811,4 +1811,4 @@ I18nManager.registerTranslations("zu", zu);
|
|
|
1811
1811
|
I18nManager.setLocale("en");
|
|
1812
1812
|
export { Path, TemporaryStorageService, NugetConstants, ToolResult, NugetPackager, ProjectTool, toolsFactoryRepository };
|
|
1813
1813
|
|
|
1814
|
-
//# debugId=
|
|
1814
|
+
//# debugId=FAAC4A7C4300CD9464756E2164756E21
|
|
@@ -18,7 +18,7 @@ var __toESM = (mod, isNodeMode, target) => {
|
|
|
18
18
|
return cached;
|
|
19
19
|
}
|
|
20
20
|
target = mod != null ? __create(__getProtoOf(mod)) : {};
|
|
21
|
-
const to = isNodeMode || !mod || !mod.__esModule ? __defProp(target, "default", { value: mod, enumerable: true }) : target;
|
|
21
|
+
const to = isNodeMode || !mod || !mod.__esModule || !__hasOwnProp.call(mod, "default") ? __defProp(target, "default", { value: mod, enumerable: true }) : target;
|
|
22
22
|
if (mod && typeof mod === "object" || typeof mod === "function") {
|
|
23
23
|
for (let key of __getOwnPropNames(mod))
|
|
24
24
|
if (!__hasOwnProp.call(to, key))
|
|
@@ -45,8 +45,17 @@ var __export = (target, all) => {
|
|
|
45
45
|
set: __exportSetter.bind(all, name)
|
|
46
46
|
});
|
|
47
47
|
};
|
|
48
|
+
var __exportCjs = (target, getters, setters) => {
|
|
49
|
+
for (var name in getters)
|
|
50
|
+
__defProp(target, name, {
|
|
51
|
+
get: getters[name],
|
|
52
|
+
set: setters[name],
|
|
53
|
+
enumerable: true,
|
|
54
|
+
configurable: true
|
|
55
|
+
});
|
|
56
|
+
};
|
|
48
57
|
var __require = /* @__PURE__ */ createRequire(import.meta.url);
|
|
49
58
|
|
|
50
|
-
export { __toESM, __commonJS, __export, __require };
|
|
59
|
+
export { __toESM, __commonJS, __export, __exportCjs, __require };
|
|
51
60
|
|
|
52
|
-
//# debugId=
|
|
61
|
+
//# debugId=6238031C22BFDF8D64756E2164756E21
|