@dpuse/dpuse-tool-adaltas-csv-parser 1.0.120 → 1.0.121

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 CHANGED
@@ -61,7 +61,7 @@ License data is updated each time `npm run document` is run, using [license-chec
61
61
 
62
62
  | Dependency | Version | License(s) | Document |
63
63
  | :----------------------------------------------------------- | :-----: | :--------- | :-------------------------------------------------------------------- |
64
- | [@dpuse/dpuse-shared](https://github.com/dpuse/dpuse-shared) | 1.0.152 | MIT | [LICENSE](licenses/downloads/@dpuse/dpuse-shared@1.0.152-LICENSE.txt) |
64
+ | [@dpuse/dpuse-shared](https://github.com/dpuse/dpuse-shared) | 1.0.153 | MIT | [LICENSE](licenses/downloads/@dpuse/dpuse-shared@1.0.153-LICENSE.txt) |
65
65
  | [csv-parse](https://github.com/adaltas/node-csv) | 7.0.3 | MIT | [LICENSE](licenses/downloads/csv-parse@7.0.3-LICENSE.txt) |
66
66
  | [valibot](https://github.com/open-circle/valibot) | 1.5.0 | MIT | [LICENSE](licenses/downloads/valibot@1.5.0-LICENSE.txt) |
67
67
 
@@ -69,7 +69,7 @@ License data is updated each time `npm run document` is run, using [license-chec
69
69
 
70
70
  The dependency tree below shows how each package in the table above is reached — direct and transitive — along with its installed version, release date, and update status. A package that does not ship itself, such as one whose parts are bundled separately, is left out and what ships beneath it is shown in its place. Packages flagged ❗ have a newer version available; ⚠️ indicates a package that hasn't been updated in the last 6 months or longer. Neither flag necessarily indicates a problem: we let new releases stabilise before upgrading, and some packages are mature and stable (have limited or no dependencies), so they require no active development.
71
71
 
72
- - **[@dpuse/dpuse-shared](https://github.com/dpuse/dpuse-shared)** 1.0.152 — this month: 2026-10-27
72
+ - **[@dpuse/dpuse-shared](https://github.com/dpuse/dpuse-shared)** 1.0.153 — this month: 2026-10-27
73
73
  - **[valibot](https://github.com/open-circle/valibot)** 1.5.0 — 1 mth ago: 2026-09-09
74
74
  - **[csv-parse](https://github.com/adaltas/node-csv)** 7.0.3 — 1 mth ago: 2026-09-25
75
75
 
@@ -85,11 +85,11 @@ _Note: Sonda's Vite reports currently exclude CSS files, since Vite does not gen
85
85
 
86
86
  | Chunk/Module/File | Composition |
87
87
  | :-------------------------------------------------------------------- | :---------------------------------------------------------------------------------------------- |
88
- | **dist/dpuse-tool-adaltas-csv-parser.es.js** | 126.2 kB · gzip 31.6 kB · 100.0% of the build |
89
- |     csv-parse → dist/esm/index.js | `████████████████░░░░` 78.6% · 99.2 kB |
88
+ | **dist/dpuse-tool-adaltas-csv-parser.es.js** | 126.5 kB · gzip 31.7 kB · 100.0% of the build |
89
+ |     csv-parse → dist/esm/index.js | `████████████████░░░░` 78.4% · 99.2 kB |
90
90
  |     @dpuse/dpuse-shared → dist/dpuse-shared.es.js | `███░░░░░░░░░░░░░░░░░` 12.5% · 15.8 kB |
91
- |     src → index.ts | `█░░░░░░░░░░░░░░░░░░░` 3.1% · 3.9 kB |
92
- |     (bundler output, whitespace & JSON) | `█░░░░░░░░░░░░░░░░░░░` 5.8% · 7.3 kB |
91
+ |     src → index.ts | `█░░░░░░░░░░░░░░░░░░░` 3.3% · 4.1 kB |
92
+ |     (bundler output, whitespace & JSON) | `█░░░░░░░░░░░░░░░░░░░` 5.8% · 7.4 kB |
93
93
 
94
94
  Bars show each row's share of its output file.
95
95
 
@@ -3525,10 +3525,12 @@ var Lr = {
3525
3525
  }),
3526
3526
  delimiter: t.valueDelimiterId,
3527
3527
  relax_column_count: !0
3528
- }), s = Hr({
3528
+ });
3529
+ let i = Hr({
3529
3530
  chunk: n,
3530
3531
  chunkSize: t.chunkSize ?? Br
3531
- }), a.on("readable", () => {
3532
+ });
3533
+ s = i, a.on("readable", () => {
3532
3534
  try {
3533
3535
  if (a == null || s == null) return;
3534
3536
  let e;
@@ -3541,20 +3543,28 @@ var Lr = {
3541
3543
  }
3542
3544
  }), a.on("error", (e) => {
3543
3545
  d(e);
3544
- }), a.on("end", () => {
3545
- c || (s?.flush(), r(Ur(a)));
3546
+ });
3547
+ let l = async (e) => {
3548
+ try {
3549
+ await i.drain(), r(e);
3550
+ } catch (e) {
3551
+ d(e);
3552
+ }
3553
+ };
3554
+ a.on("end", () => {
3555
+ c || (i.flush(), l(Ur(a)));
3546
3556
  }), o = e.getReader();
3547
- let i = new TextDecoder(Ir(t.encodingId)), l = 0, u = !1, f = await o.read();
3548
- for (; !f.done;) {
3557
+ let u = new TextDecoder(Ir(t.encodingId)), f = 0, p = !1, m = await o.read();
3558
+ for (; !m.done;) {
3549
3559
  if (c) return;
3550
- t.abortSignal.throwIfAborted(), l += f.value.length;
3551
- let e = i.decode(f.value, { stream: !0 });
3552
- e.length > 0 && (a.write(e), u = !0), f = await o.read();
3560
+ t.abortSignal.throwIfAborted(), f += m.value.length;
3561
+ let e = u.decode(m.value, { stream: !0 });
3562
+ e.length > 0 && (a.write(e), p = !0), await i.drain(), m = await o.read();
3553
3563
  }
3554
3564
  if (c) return;
3555
- let p = i.decode();
3556
- p.length > 0 && (a.write(p), u = !0), u ? a.end() : (a.removeAllListeners(), a = void 0, r({
3557
- byteCount: l,
3565
+ let h = u.decode();
3566
+ h.length > 0 && (a.write(h), p = !0), p ? a.end() : (a.removeAllListeners(), a = void 0, r({
3567
+ byteCount: f,
3558
3568
  commentLineCount: 0,
3559
3569
  emptyLineCount: 0,
3560
3570
  lineCount: 0,
@@ -3571,18 +3581,23 @@ var Lr = {
3571
3581
  }
3572
3582
  };
3573
3583
  function Hr(e) {
3574
- let t = Math.max(1, Math.floor(e.chunkSize)), n = [], r = o(), i = 0, a = () => {
3575
- if (i === 0) return;
3576
- let t = r;
3577
- t.length = i, r = o(), i = 0, e.chunk("parsingRecordArray", t), n.length < Rr && n.push(t);
3584
+ let t = Math.max(1, Math.floor(e.chunkSize)), n = [], r = [], i = s(), a = 0, o = () => {
3585
+ if (a === 0) return;
3586
+ let t = i;
3587
+ t.length = a, i = s(), a = 0;
3588
+ let o = e.chunk("parsingRecordArray", t);
3589
+ o instanceof Promise ? r.push(o) : n.length < Rr && n.push(t);
3578
3590
  };
3579
3591
  return {
3580
- flush: a,
3592
+ drain: async () => {
3593
+ for (; r.length > 0;) await Promise.all(r.splice(0));
3594
+ },
3595
+ flush: o,
3581
3596
  push: (e) => {
3582
- r[i++] = e, i >= t && a();
3597
+ i[a++] = e, a >= t && o();
3583
3598
  }
3584
3599
  };
3585
- function o() {
3600
+ function s() {
3586
3601
  let e = n.pop();
3587
3602
  if (e != null) return e.length = 0, e;
3588
3603
  let r = Array.from({ length: t });