@uipath/codedapp-tool 1.206.0-preview.301 → 1.207.0-preview.305
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 +8 -1
- package/dist/THIRD-PARTY-NOTICES.md +34 -1
- package/dist/{browser-strategy-z97p0ezf.js → browser-strategy-zem90qdb.js} +1 -1
- package/dist/{index-mmkm1w8a.js → index-11wr60x6.js} +177 -13
- package/dist/{index-c3zcyvwz.js → index-928adfk3.js} +6 -4
- package/dist/index-a74rgqpp.js +12 -0
- package/dist/{index-pkqd5f49.js → index-aj4dp6kt.js} +11 -8
- package/dist/index.js +10 -9
- package/dist/{node-strategy-fk02jqd8.js → node-strategy-ems5bj71.js} +2 -2
- package/dist/{packager-tool-ew0d2fjb.js → packager-tool-1s4184sh.js} +96 -6
- package/dist/{packager-tool-szf8dh1w.js → packager-tool-2g046zfh.js} +1640 -174
- package/dist/{packager-tool-z73h4t8a.js → packager-tool-511nvmp8.js} +421 -245
- package/dist/{packager-tool-t0j980y4.js → packager-tool-62r4c9hq.js} +554 -54
- package/dist/{packager-tool-0ajs8pnk.js → packager-tool-9thx6ae9.js} +30 -8
- package/dist/{packager-tool-1qg04b7q.js → packager-tool-bzcphfa8.js} +4 -2
- package/dist/{packager-tool-tpa79b11.js → packager-tool-g7b4kkqx.js} +9761 -8437
- package/dist/{packager-tool-3ss96mpk.js → packager-tool-rnnkxjfm.js} +60 -18
- package/dist/{packager-tool-5t7c439j.js → packager-tool-tjb9qmzj.js} +9 -646
- package/dist/packager-tool-ywc134a9.js +915 -0
- package/dist/packager-tool.js +68 -7
- package/dist/tool.js +10 -9
- package/dist/zip-gfch9knd.js +77 -0
- package/package.json +3 -3
|
@@ -1,3 +1,7 @@
|
|
|
1
|
+
import {
|
|
2
|
+
zipSync2
|
|
3
|
+
} from "./packager-tool-ywc134a9.js";
|
|
4
|
+
|
|
1
5
|
// ../packager/packager-core/src/services/tools-factory-repository.ts
|
|
2
6
|
class ToolsFactoryRepository {
|
|
3
7
|
projectFactoryMap = new Map;
|
|
@@ -111,649 +115,6 @@ var NugetConstants = {
|
|
|
111
115
|
BindingsV2FileName: "bindings_v2.json",
|
|
112
116
|
BindingsFileId: "bindings.json"
|
|
113
117
|
};
|
|
114
|
-
// ../../node_modules/fflate/esm/index.mjs
|
|
115
|
-
import { createRequire } from "module";
|
|
116
|
-
var require2 = createRequire("/");
|
|
117
|
-
var _a;
|
|
118
|
-
var Worker;
|
|
119
|
-
var isMarkedAsUntransferable;
|
|
120
|
-
try {
|
|
121
|
-
_a = require2("worker_threads"), Worker = _a.Worker, isMarkedAsUntransferable = _a.isMarkedAsUntransferable;
|
|
122
|
-
} catch (e) {}
|
|
123
|
-
var u8 = Uint8Array;
|
|
124
|
-
var u16 = Uint16Array;
|
|
125
|
-
var i32 = Int32Array;
|
|
126
|
-
var fleb = new u8([0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, 0, 0, 0]);
|
|
127
|
-
var fdeb = new u8([0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 0, 0]);
|
|
128
|
-
var clim = new u8([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]);
|
|
129
|
-
var freb = function(eb, start) {
|
|
130
|
-
var b = new u16(31);
|
|
131
|
-
for (var i = 0;i < 31; ++i) {
|
|
132
|
-
b[i] = start += 1 << eb[i - 1];
|
|
133
|
-
}
|
|
134
|
-
var r = new i32(b[30]);
|
|
135
|
-
for (var i = 1;i < 30; ++i) {
|
|
136
|
-
for (var j = b[i];j < b[i + 1]; ++j) {
|
|
137
|
-
r[j] = j - b[i] << 5 | i;
|
|
138
|
-
}
|
|
139
|
-
}
|
|
140
|
-
return { b, r };
|
|
141
|
-
};
|
|
142
|
-
var _a = freb(fleb, 2);
|
|
143
|
-
var fl = _a.b;
|
|
144
|
-
var revfl = _a.r;
|
|
145
|
-
fl[28] = 258, revfl[258] = 28;
|
|
146
|
-
var _b = freb(fdeb, 0);
|
|
147
|
-
var fd = _b.b;
|
|
148
|
-
var revfd = _b.r;
|
|
149
|
-
var rev = new u16(32768);
|
|
150
|
-
for (i = 0;i < 32768; ++i) {
|
|
151
|
-
x = (i & 43690) >> 1 | (i & 21845) << 1;
|
|
152
|
-
x = (x & 52428) >> 2 | (x & 13107) << 2;
|
|
153
|
-
x = (x & 61680) >> 4 | (x & 3855) << 4;
|
|
154
|
-
rev[i] = ((x & 65280) >> 8 | (x & 255) << 8) >> 1;
|
|
155
|
-
}
|
|
156
|
-
var x;
|
|
157
|
-
var i;
|
|
158
|
-
var hMap = function(cd, mb, r) {
|
|
159
|
-
var s = cd.length;
|
|
160
|
-
var i = 0;
|
|
161
|
-
var l = new u16(mb);
|
|
162
|
-
for (;i < s; ++i) {
|
|
163
|
-
if (cd[i])
|
|
164
|
-
++l[cd[i] - 1];
|
|
165
|
-
}
|
|
166
|
-
var le = new u16(mb);
|
|
167
|
-
for (i = 1;i < mb; ++i) {
|
|
168
|
-
le[i] = le[i - 1] + l[i - 1] << 1;
|
|
169
|
-
}
|
|
170
|
-
var co;
|
|
171
|
-
if (r) {
|
|
172
|
-
co = new u16(1 << mb);
|
|
173
|
-
var rvb = 15 - mb;
|
|
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
|
-
for (var m = v | (1 << r_1) - 1;v <= m; ++v) {
|
|
180
|
-
co[rev[v] >> rvb] = sv;
|
|
181
|
-
}
|
|
182
|
-
}
|
|
183
|
-
}
|
|
184
|
-
} else {
|
|
185
|
-
co = new u16(s);
|
|
186
|
-
for (i = 0;i < s; ++i) {
|
|
187
|
-
if (cd[i]) {
|
|
188
|
-
co[i] = rev[le[cd[i] - 1]++] >> 15 - cd[i];
|
|
189
|
-
}
|
|
190
|
-
}
|
|
191
|
-
}
|
|
192
|
-
return co;
|
|
193
|
-
};
|
|
194
|
-
var flt = new u8(288);
|
|
195
|
-
for (i = 0;i < 144; ++i)
|
|
196
|
-
flt[i] = 8;
|
|
197
|
-
var i;
|
|
198
|
-
for (i = 144;i < 256; ++i)
|
|
199
|
-
flt[i] = 9;
|
|
200
|
-
var i;
|
|
201
|
-
for (i = 256;i < 280; ++i)
|
|
202
|
-
flt[i] = 7;
|
|
203
|
-
var i;
|
|
204
|
-
for (i = 280;i < 288; ++i)
|
|
205
|
-
flt[i] = 8;
|
|
206
|
-
var i;
|
|
207
|
-
var fdt = new u8(32);
|
|
208
|
-
for (i = 0;i < 32; ++i)
|
|
209
|
-
fdt[i] = 5;
|
|
210
|
-
var i;
|
|
211
|
-
var flm = /* @__PURE__ */ hMap(flt, 9, 0);
|
|
212
|
-
var fdm = /* @__PURE__ */ hMap(fdt, 5, 0);
|
|
213
|
-
var shft = function(p) {
|
|
214
|
-
return (p + 7) / 8 | 0;
|
|
215
|
-
};
|
|
216
|
-
var slc = function(v, s, e) {
|
|
217
|
-
if (s == null || s < 0)
|
|
218
|
-
s = 0;
|
|
219
|
-
if (e == null || e > v.length)
|
|
220
|
-
e = v.length;
|
|
221
|
-
return new u8(v.subarray(s, e));
|
|
222
|
-
};
|
|
223
|
-
var ec = [
|
|
224
|
-
"unexpected EOF",
|
|
225
|
-
"invalid block type",
|
|
226
|
-
"invalid length/literal",
|
|
227
|
-
"invalid distance",
|
|
228
|
-
"stream finished",
|
|
229
|
-
"no stream handler",
|
|
230
|
-
,
|
|
231
|
-
"no callback",
|
|
232
|
-
"invalid UTF-8 data",
|
|
233
|
-
"extra field too long",
|
|
234
|
-
"date not in range 1980-2099",
|
|
235
|
-
"filename too long",
|
|
236
|
-
"stream finishing",
|
|
237
|
-
"invalid zip data"
|
|
238
|
-
];
|
|
239
|
-
var err = function(ind, msg, nt) {
|
|
240
|
-
var e = new Error(msg || ec[ind]);
|
|
241
|
-
e.code = ind;
|
|
242
|
-
if (Error.captureStackTrace)
|
|
243
|
-
Error.captureStackTrace(e, err);
|
|
244
|
-
if (!nt)
|
|
245
|
-
throw e;
|
|
246
|
-
return e;
|
|
247
|
-
};
|
|
248
|
-
var wbits = function(d, p, v) {
|
|
249
|
-
v <<= p & 7;
|
|
250
|
-
var o = p / 8 | 0;
|
|
251
|
-
d[o] |= v;
|
|
252
|
-
d[o + 1] |= v >> 8;
|
|
253
|
-
};
|
|
254
|
-
var wbits16 = function(d, p, v) {
|
|
255
|
-
v <<= p & 7;
|
|
256
|
-
var o = p / 8 | 0;
|
|
257
|
-
d[o] |= v;
|
|
258
|
-
d[o + 1] |= v >> 8;
|
|
259
|
-
d[o + 2] |= v >> 16;
|
|
260
|
-
};
|
|
261
|
-
var hTree = function(d, mb) {
|
|
262
|
-
var t = [];
|
|
263
|
-
for (var i = 0;i < d.length; ++i) {
|
|
264
|
-
if (d[i])
|
|
265
|
-
t.push({ s: i, f: d[i] });
|
|
266
|
-
}
|
|
267
|
-
var s = t.length;
|
|
268
|
-
var t2 = t.slice();
|
|
269
|
-
if (!s)
|
|
270
|
-
return { t: et, l: 0 };
|
|
271
|
-
if (s == 1) {
|
|
272
|
-
var v = new u8(t[0].s + 1);
|
|
273
|
-
v[t[0].s] = 1;
|
|
274
|
-
return { t: v, l: 1 };
|
|
275
|
-
}
|
|
276
|
-
t.sort(function(a, b) {
|
|
277
|
-
return a.f - b.f;
|
|
278
|
-
});
|
|
279
|
-
t.push({ s: -1, f: 25001 });
|
|
280
|
-
var l = t[0], r = t[1], i0 = 0, i1 = 1, i2 = 2;
|
|
281
|
-
t[0] = { s: -1, f: l.f + r.f, l, r };
|
|
282
|
-
while (i1 != s - 1) {
|
|
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
|
-
t[i1++] = { s: -1, f: l.f + r.f, l, r };
|
|
286
|
-
}
|
|
287
|
-
var maxSym = t2[0].s;
|
|
288
|
-
for (var i = 1;i < s; ++i) {
|
|
289
|
-
if (t2[i].s > maxSym)
|
|
290
|
-
maxSym = t2[i].s;
|
|
291
|
-
}
|
|
292
|
-
var tr = new u16(maxSym + 1);
|
|
293
|
-
var mbt = ln(t[i1 - 1], tr, 0);
|
|
294
|
-
if (mbt > mb) {
|
|
295
|
-
var i = 0, dt = 0;
|
|
296
|
-
var lft = mbt - mb, cst = 1 << lft;
|
|
297
|
-
t2.sort(function(a, b) {
|
|
298
|
-
return tr[b.s] - tr[a.s] || a.f - b.f;
|
|
299
|
-
});
|
|
300
|
-
for (;i < s; ++i) {
|
|
301
|
-
var i2_1 = t2[i].s;
|
|
302
|
-
if (tr[i2_1] > mb) {
|
|
303
|
-
dt += cst - (1 << mbt - tr[i2_1]);
|
|
304
|
-
tr[i2_1] = mb;
|
|
305
|
-
} else
|
|
306
|
-
break;
|
|
307
|
-
}
|
|
308
|
-
dt >>= lft;
|
|
309
|
-
while (dt > 0) {
|
|
310
|
-
var i2_2 = t2[i].s;
|
|
311
|
-
if (tr[i2_2] < mb)
|
|
312
|
-
dt -= 1 << mb - tr[i2_2]++ - 1;
|
|
313
|
-
else
|
|
314
|
-
++i;
|
|
315
|
-
}
|
|
316
|
-
for (;i >= 0 && dt; --i) {
|
|
317
|
-
var i2_3 = t2[i].s;
|
|
318
|
-
if (tr[i2_3] == mb) {
|
|
319
|
-
--tr[i2_3];
|
|
320
|
-
++dt;
|
|
321
|
-
}
|
|
322
|
-
}
|
|
323
|
-
mbt = mb;
|
|
324
|
-
}
|
|
325
|
-
return { t: new u8(tr), l: mbt };
|
|
326
|
-
};
|
|
327
|
-
var ln = function(n, l, d) {
|
|
328
|
-
return n.s == -1 ? Math.max(ln(n.l, l, d + 1), ln(n.r, l, d + 1)) : l[n.s] = d;
|
|
329
|
-
};
|
|
330
|
-
var lc = function(c) {
|
|
331
|
-
var s = c.length;
|
|
332
|
-
while (s && !c[--s])
|
|
333
|
-
;
|
|
334
|
-
var cl = new u16(++s);
|
|
335
|
-
var cli = 0, cln = c[0], cls = 1;
|
|
336
|
-
var w = function(v) {
|
|
337
|
-
cl[cli++] = v;
|
|
338
|
-
};
|
|
339
|
-
for (var i = 1;i <= s; ++i) {
|
|
340
|
-
if (c[i] == cln && i != s)
|
|
341
|
-
++cls;
|
|
342
|
-
else {
|
|
343
|
-
if (!cln && cls > 2) {
|
|
344
|
-
for (;cls > 138; cls -= 138)
|
|
345
|
-
w(32754);
|
|
346
|
-
if (cls > 2) {
|
|
347
|
-
w(cls > 10 ? cls - 11 << 5 | 28690 : cls - 3 << 5 | 12305);
|
|
348
|
-
cls = 0;
|
|
349
|
-
}
|
|
350
|
-
} else if (cls > 3) {
|
|
351
|
-
w(cln), --cls;
|
|
352
|
-
for (;cls > 6; cls -= 6)
|
|
353
|
-
w(8304);
|
|
354
|
-
if (cls > 2)
|
|
355
|
-
w(cls - 3 << 5 | 8208), cls = 0;
|
|
356
|
-
}
|
|
357
|
-
while (cls--)
|
|
358
|
-
w(cln);
|
|
359
|
-
cls = 1;
|
|
360
|
-
cln = c[i];
|
|
361
|
-
}
|
|
362
|
-
}
|
|
363
|
-
return { c: cl.subarray(0, cli), n: s };
|
|
364
|
-
};
|
|
365
|
-
var clen = function(cf, cl) {
|
|
366
|
-
var l = 0;
|
|
367
|
-
for (var i = 0;i < cl.length; ++i)
|
|
368
|
-
l += cf[i] * cl[i];
|
|
369
|
-
return l;
|
|
370
|
-
};
|
|
371
|
-
var wfblk = function(out, pos, dat) {
|
|
372
|
-
var s = dat.length;
|
|
373
|
-
var o = shft(pos + 2);
|
|
374
|
-
out[o] = s & 255;
|
|
375
|
-
out[o + 1] = s >> 8;
|
|
376
|
-
out[o + 2] = out[o] ^ 255;
|
|
377
|
-
out[o + 3] = out[o + 1] ^ 255;
|
|
378
|
-
for (var i = 0;i < s; ++i)
|
|
379
|
-
out[o + i + 4] = dat[i];
|
|
380
|
-
return (o + 4 + s) * 8;
|
|
381
|
-
};
|
|
382
|
-
var wblk = function(dat, out, final, syms, lf, df, eb, li, bs, bl, p) {
|
|
383
|
-
wbits(out, p++, final);
|
|
384
|
-
++lf[256];
|
|
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
|
-
var lcfreq = new u16(19);
|
|
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
|
-
var nlcc = 19;
|
|
396
|
-
for (;nlcc > 4 && !lct[clim[nlcc - 1]]; --nlcc)
|
|
397
|
-
;
|
|
398
|
-
var flen = bl + 5 << 3;
|
|
399
|
-
var ftlen = clen(lf, flt) + clen(df, fdt) + eb;
|
|
400
|
-
var dtlen = clen(lf, dlt) + clen(df, ddt) + eb + 14 + 3 * nlcc + clen(lcfreq, lct) + 2 * lcfreq[16] + 3 * lcfreq[17] + 7 * lcfreq[18];
|
|
401
|
-
if (bs >= 0 && flen <= ftlen && flen <= dtlen)
|
|
402
|
-
return wfblk(out, p, dat.subarray(bs, bs + bl));
|
|
403
|
-
var lm, ll, dm, dl;
|
|
404
|
-
wbits(out, p, 1 + (dtlen < ftlen)), p += 2;
|
|
405
|
-
if (dtlen < ftlen) {
|
|
406
|
-
lm = hMap(dlt, mlb, 0), ll = dlt, dm = hMap(ddt, mdb, 0), dl = ddt;
|
|
407
|
-
var llm = hMap(lct, mlcb, 0);
|
|
408
|
-
wbits(out, p, nlc - 257);
|
|
409
|
-
wbits(out, p + 5, ndc - 1);
|
|
410
|
-
wbits(out, p + 10, nlcc - 4);
|
|
411
|
-
p += 14;
|
|
412
|
-
for (var i = 0;i < nlcc; ++i)
|
|
413
|
-
wbits(out, p + 3 * i, lct[clim[i]]);
|
|
414
|
-
p += 3 * nlcc;
|
|
415
|
-
var lcts = [lclt, lcdt];
|
|
416
|
-
for (var it = 0;it < 2; ++it) {
|
|
417
|
-
var clct = lcts[it];
|
|
418
|
-
for (var i = 0;i < clct.length; ++i) {
|
|
419
|
-
var len = clct[i] & 31;
|
|
420
|
-
wbits(out, p, llm[len]), p += lct[len];
|
|
421
|
-
if (len > 15)
|
|
422
|
-
wbits(out, p, clct[i] >> 5 & 127), p += clct[i] >> 12;
|
|
423
|
-
}
|
|
424
|
-
}
|
|
425
|
-
} else {
|
|
426
|
-
lm = flm, ll = flt, dm = fdm, dl = fdt;
|
|
427
|
-
}
|
|
428
|
-
for (var i = 0;i < li; ++i) {
|
|
429
|
-
var sym = syms[i];
|
|
430
|
-
if (sym > 255) {
|
|
431
|
-
var len = sym >> 18 & 31;
|
|
432
|
-
wbits16(out, p, lm[len + 257]), p += ll[len + 257];
|
|
433
|
-
if (len > 7)
|
|
434
|
-
wbits(out, p, sym >> 23 & 31), p += fleb[len];
|
|
435
|
-
var dst = sym & 31;
|
|
436
|
-
wbits16(out, p, dm[dst]), p += dl[dst];
|
|
437
|
-
if (dst > 3)
|
|
438
|
-
wbits16(out, p, sym >> 5 & 8191), p += fdeb[dst];
|
|
439
|
-
} else {
|
|
440
|
-
wbits16(out, p, lm[sym]), p += ll[sym];
|
|
441
|
-
}
|
|
442
|
-
}
|
|
443
|
-
wbits16(out, p, lm[256]);
|
|
444
|
-
return p + ll[256];
|
|
445
|
-
};
|
|
446
|
-
var deo = /* @__PURE__ */ new i32([65540, 131080, 131088, 131104, 262176, 1048704, 1048832, 2114560, 2117632]);
|
|
447
|
-
var et = /* @__PURE__ */ new u8(0);
|
|
448
|
-
var dflt = function(dat, lvl, plvl, pre, post, st) {
|
|
449
|
-
var s = st.z || dat.length;
|
|
450
|
-
var o = new u8(pre + s + 5 * (1 + Math.ceil(s / 7000)) + post);
|
|
451
|
-
var w = o.subarray(pre, o.length - post);
|
|
452
|
-
var lst = st.l;
|
|
453
|
-
var pos = (st.r || 0) & 7;
|
|
454
|
-
if (lvl) {
|
|
455
|
-
if (pos)
|
|
456
|
-
w[0] = st.r >> 3;
|
|
457
|
-
var opt = deo[lvl - 1];
|
|
458
|
-
var n = opt >> 13, c = opt & 8191;
|
|
459
|
-
var msk_1 = (1 << plvl) - 1;
|
|
460
|
-
var prev = st.p || new u16(32768), head = st.h || new u16(msk_1 + 1);
|
|
461
|
-
var bs1_1 = Math.ceil(plvl / 3), bs2_1 = 2 * bs1_1;
|
|
462
|
-
var hsh = function(i) {
|
|
463
|
-
return (dat[i] ^ dat[i + 1] << bs1_1 ^ dat[i + 2] << bs2_1) & msk_1;
|
|
464
|
-
};
|
|
465
|
-
var syms = new i32(25000);
|
|
466
|
-
var lf = new u16(288), df = new u16(32);
|
|
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
|
-
prev[imod] = pimod;
|
|
472
|
-
head[hv] = imod;
|
|
473
|
-
if (wi <= i) {
|
|
474
|
-
var rem = s - i;
|
|
475
|
-
if ((lc_1 > 7000 || li > 24576) && (rem > 423 || !lst)) {
|
|
476
|
-
pos = wblk(dat, w, 0, syms, lf, df, eb, li, bs, i - bs, pos);
|
|
477
|
-
li = lc_1 = eb = 0, bs = i;
|
|
478
|
-
for (var j = 0;j < 286; ++j)
|
|
479
|
-
lf[j] = 0;
|
|
480
|
-
for (var j = 0;j < 30; ++j)
|
|
481
|
-
df[j] = 0;
|
|
482
|
-
}
|
|
483
|
-
var l = 2, d = 0, ch_1 = c, dif = imod - pimod & 32767;
|
|
484
|
-
if (rem > 2 && hv == hsh(i - dif)) {
|
|
485
|
-
var maxn = Math.min(n, rem) - 1;
|
|
486
|
-
var maxd = Math.min(32767, i);
|
|
487
|
-
var ml = Math.min(258, rem);
|
|
488
|
-
while (dif <= maxd && --ch_1 && imod != pimod) {
|
|
489
|
-
if (dat[i + l] == dat[i + l - dif]) {
|
|
490
|
-
var nl = 0;
|
|
491
|
-
for (;nl < ml && dat[i + nl] == dat[i + nl - dif]; ++nl)
|
|
492
|
-
;
|
|
493
|
-
if (nl > l) {
|
|
494
|
-
l = nl, d = dif;
|
|
495
|
-
if (nl > maxn)
|
|
496
|
-
break;
|
|
497
|
-
var mmd = Math.min(dif, nl - 2);
|
|
498
|
-
var md = 0;
|
|
499
|
-
for (var j = 0;j < mmd; ++j) {
|
|
500
|
-
var ti = i - dif + j & 32767;
|
|
501
|
-
var pti = prev[ti];
|
|
502
|
-
var cd = ti - pti & 32767;
|
|
503
|
-
if (cd > md)
|
|
504
|
-
md = cd, pimod = ti;
|
|
505
|
-
}
|
|
506
|
-
}
|
|
507
|
-
}
|
|
508
|
-
imod = pimod, pimod = prev[imod];
|
|
509
|
-
dif += imod - pimod & 32767;
|
|
510
|
-
}
|
|
511
|
-
}
|
|
512
|
-
if (d) {
|
|
513
|
-
syms[li++] = 268435456 | revfl[l] << 18 | revfd[d];
|
|
514
|
-
var lin = revfl[l] & 31, din = revfd[d] & 31;
|
|
515
|
-
eb += fleb[lin] + fdeb[din];
|
|
516
|
-
++lf[257 + lin];
|
|
517
|
-
++df[din];
|
|
518
|
-
wi = i + l;
|
|
519
|
-
++lc_1;
|
|
520
|
-
} else {
|
|
521
|
-
syms[li++] = dat[i];
|
|
522
|
-
++lf[dat[i]];
|
|
523
|
-
}
|
|
524
|
-
}
|
|
525
|
-
}
|
|
526
|
-
for (i = Math.max(i, wi);i < s; ++i) {
|
|
527
|
-
syms[li++] = dat[i];
|
|
528
|
-
++lf[dat[i]];
|
|
529
|
-
}
|
|
530
|
-
pos = wblk(dat, w, lst, syms, lf, df, eb, li, bs, i - bs, pos);
|
|
531
|
-
if (!lst) {
|
|
532
|
-
st.r = pos & 7 | w[pos / 8 | 0] << 3;
|
|
533
|
-
pos -= 7;
|
|
534
|
-
st.h = head, st.p = prev, st.i = i, st.w = wi;
|
|
535
|
-
}
|
|
536
|
-
} else {
|
|
537
|
-
for (var i = st.w || 0;i < s + lst; i += 65535) {
|
|
538
|
-
var e = i + 65535;
|
|
539
|
-
if (e >= s) {
|
|
540
|
-
w[pos / 8 | 0] = lst;
|
|
541
|
-
e = s;
|
|
542
|
-
}
|
|
543
|
-
pos = wfblk(w, pos + 1, dat.subarray(i, e));
|
|
544
|
-
}
|
|
545
|
-
st.i = s;
|
|
546
|
-
}
|
|
547
|
-
return slc(o, 0, pre + shft(pos) + post);
|
|
548
|
-
};
|
|
549
|
-
var crct = /* @__PURE__ */ function() {
|
|
550
|
-
var t = new Int32Array(256);
|
|
551
|
-
for (var i = 0;i < 256; ++i) {
|
|
552
|
-
var c = i, k = 9;
|
|
553
|
-
while (--k)
|
|
554
|
-
c = (c & 1 && -306674912) ^ c >>> 1;
|
|
555
|
-
t[i] = c;
|
|
556
|
-
}
|
|
557
|
-
return t;
|
|
558
|
-
}();
|
|
559
|
-
var crc = function() {
|
|
560
|
-
var c = -1;
|
|
561
|
-
return {
|
|
562
|
-
p: function(d) {
|
|
563
|
-
var cr = c;
|
|
564
|
-
for (var i = 0;i < d.length; ++i)
|
|
565
|
-
cr = crct[cr & 255 ^ d[i]] ^ cr >>> 8;
|
|
566
|
-
c = cr;
|
|
567
|
-
},
|
|
568
|
-
d: function() {
|
|
569
|
-
return ~c;
|
|
570
|
-
}
|
|
571
|
-
};
|
|
572
|
-
};
|
|
573
|
-
var dopt = function(dat, opt, pre, post, st) {
|
|
574
|
-
if (!st) {
|
|
575
|
-
st = { l: 1 };
|
|
576
|
-
if (opt.dictionary) {
|
|
577
|
-
var dict = opt.dictionary.subarray(-32768);
|
|
578
|
-
var newDat = new u8(dict.length + dat.length);
|
|
579
|
-
newDat.set(dict);
|
|
580
|
-
newDat.set(dat, dict.length);
|
|
581
|
-
dat = newDat;
|
|
582
|
-
st.w = dict.length;
|
|
583
|
-
}
|
|
584
|
-
}
|
|
585
|
-
return dflt(dat, opt.level == null ? 6 : opt.level, opt.mem == null ? st.l ? Math.ceil(Math.max(8, Math.min(13, Math.log(dat.length))) * 1.5) : 20 : 12 + opt.mem, pre, post, st);
|
|
586
|
-
};
|
|
587
|
-
var mrg = function(a, b) {
|
|
588
|
-
var o = {};
|
|
589
|
-
for (var k in a)
|
|
590
|
-
o[k] = a[k];
|
|
591
|
-
for (var k in b)
|
|
592
|
-
o[k] = b[k];
|
|
593
|
-
return o;
|
|
594
|
-
};
|
|
595
|
-
var wbytes = function(d, b, v) {
|
|
596
|
-
for (;v; ++b)
|
|
597
|
-
d[b] = v, v >>>= 8;
|
|
598
|
-
};
|
|
599
|
-
function deflateSync(data, opts) {
|
|
600
|
-
return dopt(data, opts || {}, 0, 0);
|
|
601
|
-
}
|
|
602
|
-
var fltn = function(d, p, t, o) {
|
|
603
|
-
for (var k in d) {
|
|
604
|
-
var val = d[k], n = p + k, op = o;
|
|
605
|
-
if (Array.isArray(val))
|
|
606
|
-
op = mrg(o, val[1]), val = val[0];
|
|
607
|
-
if (ArrayBuffer.isView(val))
|
|
608
|
-
t[n] = [val, op];
|
|
609
|
-
else {
|
|
610
|
-
t[n += "/"] = [new u8(0), op];
|
|
611
|
-
fltn(val, n, t, o);
|
|
612
|
-
}
|
|
613
|
-
}
|
|
614
|
-
};
|
|
615
|
-
var te = typeof TextEncoder != "undefined" && /* @__PURE__ */ new TextEncoder;
|
|
616
|
-
var td = typeof TextDecoder != "undefined" && /* @__PURE__ */ new TextDecoder;
|
|
617
|
-
var tds = 0;
|
|
618
|
-
try {
|
|
619
|
-
td.decode(et, { stream: true });
|
|
620
|
-
tds = 1;
|
|
621
|
-
} catch (e) {}
|
|
622
|
-
function strToU8(str, latin1) {
|
|
623
|
-
if (latin1) {
|
|
624
|
-
var ar_1 = new u8(str.length);
|
|
625
|
-
for (var i = 0;i < str.length; ++i)
|
|
626
|
-
ar_1[i] = str.charCodeAt(i);
|
|
627
|
-
return ar_1;
|
|
628
|
-
}
|
|
629
|
-
if (te)
|
|
630
|
-
return te.encode(str);
|
|
631
|
-
var l = str.length;
|
|
632
|
-
var ar = new u8(str.length + (str.length >> 1));
|
|
633
|
-
var ai = 0;
|
|
634
|
-
var w = function(v) {
|
|
635
|
-
ar[ai++] = v;
|
|
636
|
-
};
|
|
637
|
-
for (var i = 0;i < l; ++i) {
|
|
638
|
-
if (ai + 5 > ar.length) {
|
|
639
|
-
var n = new u8(ai + 8 + (l - i << 1));
|
|
640
|
-
n.set(ar);
|
|
641
|
-
ar = n;
|
|
642
|
-
}
|
|
643
|
-
var c = str.charCodeAt(i);
|
|
644
|
-
if (c < 128 || latin1)
|
|
645
|
-
w(c);
|
|
646
|
-
else if (c < 2048)
|
|
647
|
-
w(192 | c >> 6), w(128 | c & 63);
|
|
648
|
-
else if (c > 55295 && c < 57344)
|
|
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
|
-
else
|
|
651
|
-
w(224 | c >> 12), w(128 | c >> 6 & 63), w(128 | c & 63);
|
|
652
|
-
}
|
|
653
|
-
return slc(ar, 0, ai);
|
|
654
|
-
}
|
|
655
|
-
var exfl = function(ex) {
|
|
656
|
-
var le = 0;
|
|
657
|
-
if (ex) {
|
|
658
|
-
for (var k in ex) {
|
|
659
|
-
var l = ex[k].length;
|
|
660
|
-
if (l > 65535)
|
|
661
|
-
err(9);
|
|
662
|
-
le += l + 4;
|
|
663
|
-
}
|
|
664
|
-
}
|
|
665
|
-
return le;
|
|
666
|
-
};
|
|
667
|
-
var wzh = function(d, b, f, fn, u, c, ce, co) {
|
|
668
|
-
var fl = fn.length, ex = f.extra, col = co && co.length;
|
|
669
|
-
var exl = exfl(ex);
|
|
670
|
-
wbytes(d, b, ce != null ? 33639248 : 67324752), b += 4;
|
|
671
|
-
if (ce != null)
|
|
672
|
-
d[b++] = 20, d[b++] = f.os;
|
|
673
|
-
d[b] = 20, b += 2;
|
|
674
|
-
d[b++] = f.flag << 1 | (c < 0 && 8), d[b++] = u && 8;
|
|
675
|
-
d[b++] = f.compression & 255, d[b++] = f.compression >> 8;
|
|
676
|
-
var dt = new Date(f.mtime == null ? Date.now() : f.mtime), y = dt.getFullYear() - 1980;
|
|
677
|
-
if (y < 0 || y > 119)
|
|
678
|
-
err(10);
|
|
679
|
-
wbytes(d, b, y << 25 | dt.getMonth() + 1 << 21 | dt.getDate() << 16 | dt.getHours() << 11 | dt.getMinutes() << 5 | dt.getSeconds() >> 1), b += 4;
|
|
680
|
-
if (c != -1) {
|
|
681
|
-
wbytes(d, b, f.crc);
|
|
682
|
-
wbytes(d, b + 4, c < 0 ? -c - 2 : c);
|
|
683
|
-
wbytes(d, b + 8, f.size);
|
|
684
|
-
}
|
|
685
|
-
wbytes(d, b + 12, fl);
|
|
686
|
-
wbytes(d, b + 14, exl), b += 16;
|
|
687
|
-
if (ce != null) {
|
|
688
|
-
wbytes(d, b, col);
|
|
689
|
-
wbytes(d, b + 6, f.attrs);
|
|
690
|
-
wbytes(d, b + 10, ce), b += 14;
|
|
691
|
-
}
|
|
692
|
-
d.set(fn, b);
|
|
693
|
-
b += fl;
|
|
694
|
-
if (exl) {
|
|
695
|
-
for (var k in ex) {
|
|
696
|
-
var exf = ex[k], l = exf.length;
|
|
697
|
-
wbytes(d, b, +k);
|
|
698
|
-
wbytes(d, b + 2, l);
|
|
699
|
-
d.set(exf, b + 4), b += 4 + l;
|
|
700
|
-
}
|
|
701
|
-
}
|
|
702
|
-
if (col)
|
|
703
|
-
d.set(co, b), b += col;
|
|
704
|
-
return b;
|
|
705
|
-
};
|
|
706
|
-
var wzf = function(o, b, c, d, e) {
|
|
707
|
-
wbytes(o, b, 101010256);
|
|
708
|
-
wbytes(o, b + 8, c);
|
|
709
|
-
wbytes(o, b + 10, c);
|
|
710
|
-
wbytes(o, b + 12, d);
|
|
711
|
-
wbytes(o, b + 16, e);
|
|
712
|
-
};
|
|
713
|
-
function zipSync(data, opts) {
|
|
714
|
-
if (!opts)
|
|
715
|
-
opts = {};
|
|
716
|
-
var r = {};
|
|
717
|
-
var files = [];
|
|
718
|
-
fltn(data, "", r, opts);
|
|
719
|
-
var o = 0;
|
|
720
|
-
var tot = 0;
|
|
721
|
-
for (var fn in r) {
|
|
722
|
-
var _a = r[fn], file = _a[0], p = _a[1];
|
|
723
|
-
var compression = p.level == 0 ? 0 : 8;
|
|
724
|
-
var f = strToU8(fn), s = f.length;
|
|
725
|
-
var com = p.comment, m = com && strToU8(com), ms = m && m.length;
|
|
726
|
-
var exl = exfl(p.extra);
|
|
727
|
-
if (s > 65535)
|
|
728
|
-
err(11);
|
|
729
|
-
var d = compression ? deflateSync(file, p) : file, l = d.length;
|
|
730
|
-
var c = crc();
|
|
731
|
-
c.p(file);
|
|
732
|
-
files.push(mrg(p, {
|
|
733
|
-
size: file.length,
|
|
734
|
-
crc: c.d(),
|
|
735
|
-
c: d,
|
|
736
|
-
f,
|
|
737
|
-
m,
|
|
738
|
-
u: s != fn.length || m && com.length != ms,
|
|
739
|
-
o,
|
|
740
|
-
compression
|
|
741
|
-
}));
|
|
742
|
-
o += 30 + s + exl + l;
|
|
743
|
-
tot += 76 + 2 * (s + exl) + (ms || 0) + l;
|
|
744
|
-
}
|
|
745
|
-
var out = new u8(tot + 22), oe = o, cdl = tot - o;
|
|
746
|
-
for (var i = 0;i < files.length; ++i) {
|
|
747
|
-
var f = files[i];
|
|
748
|
-
wzh(out, f.o, f, f.f, f.u, f.c.length);
|
|
749
|
-
var badd = 30 + f.f.length + exfl(f.extra);
|
|
750
|
-
out.set(f.c, f.o + badd);
|
|
751
|
-
wzh(out, o, f, f.f, f.u, f.c.length, f.o, f.m), o += 16 + badd + (f.m ? f.m.length : 0);
|
|
752
|
-
}
|
|
753
|
-
wzf(out, o, files.length, cdl, oe);
|
|
754
|
-
return out;
|
|
755
|
-
}
|
|
756
|
-
|
|
757
118
|
// ../packager/packager-core/src/services/nuget-packager.ts
|
|
758
119
|
function escapeXml(str) {
|
|
759
120
|
if (str === null || str === undefined) {
|
|
@@ -866,13 +227,15 @@ class NugetPackager {
|
|
|
866
227
|
zipContents[entry.relativePath] = content;
|
|
867
228
|
}
|
|
868
229
|
}
|
|
869
|
-
const zippedData =
|
|
230
|
+
const zippedData = zipSync2(zipContents);
|
|
870
231
|
await this.fileSystem.writeFile(normalizedOutputPath, zippedData);
|
|
871
232
|
return {
|
|
872
233
|
outputPath: normalizedOutputPath
|
|
873
234
|
};
|
|
874
235
|
}
|
|
875
236
|
}
|
|
237
|
+
// ../packager/packager-core/src/services/project-identity.ts
|
|
238
|
+
var MAX_IDENTITY_FILE_BYTES = 1024 * 1024;
|
|
876
239
|
// ../packager/packager-core/src/models/tool-result.ts
|
|
877
240
|
class ToolResult {
|
|
878
241
|
errorCode;
|
|
@@ -1809,6 +1172,6 @@ I18nManager.registerTranslations("zh-cn", zh_CN);
|
|
|
1809
1172
|
I18nManager.registerTranslations("zh-tw", zh_TW);
|
|
1810
1173
|
I18nManager.registerTranslations("zu", zu);
|
|
1811
1174
|
I18nManager.setLocale("en");
|
|
1812
|
-
export { Path, TemporaryStorageService, NugetConstants, ToolResult, NugetPackager, ProjectTool, toolsFactoryRepository };
|
|
1175
|
+
export { Path, TemporaryStorageService, NugetConstants, ToolResult, NugetPackager, MAX_IDENTITY_FILE_BYTES, ProjectTool, toolsFactoryRepository };
|
|
1813
1176
|
|
|
1814
|
-
//# debugId=
|
|
1177
|
+
//# debugId=08BB741C9007773964756E2164756E21
|