edf2csv 0.5.24 → 0.5.27

package/CHANGELOG.md

@@ -3,6 +3,71 @@
 Notable changes to edf2csv. Versions follow [semantic versioning](https://semver.org); while the
 major version is 0, a minor bump may contain breaking changes.
 
+## 0.5.27
+
+### Fixed: the batch summary said everything converted while the exit code said otherwise
+
+A folder holding one recording beside a sub-directory without read permission printed
+"Converted 1 of 1 recordings." and exited 1. The line agreed with itself and with nothing
+else.
+
+That sentence is the one the directory walk's own comment quotes as the thing it fixed: "a
+folder holding three recordings, one of them inside a sub-directory without read permission,
+converted two and said Converted 2 of 2 recordings — a total that agreed with itself and with
+nothing else." What was fixed then was the error line and the exit code. The unreadable paths
+were added to the failure count on the line *after* the summary printed, so the summary went
+on saying everything worked.
+
+Counted before it prints now, and counted separately from the recordings, because an
+unreadable path is not one of them — how many it held is exactly what nobody knows:
+
+```
+Converted 1 of 1 recordings; 1 path could not be read.
+```
+
+A batch where a recording genuinely fails to convert still reads "Converted 2 of 3
+recordings; 1 failed", and a clean batch is unchanged.
+
+## 0.5.26
+
+### Fixed: 0.5.20's memory test asserted a heap size only one machine has
+
+It converted 200 output tables under a 48 MB cap, which the fixed code does on macOS with
+Node 24 and does not on Linux with Node 22. So the release workflow failed and 0.5.25 did not
+reach npm — a test turning a garbage-collector difference into a red build, which is worse
+than no test.
+
+How much heap a conversion needs is not portable, and the separating cap is not either: the
+pre-fix code dies at 64 MB here and needs considerably more on the runner. The test runs both
+counts at 96 MB now — 40 tables, the size 0.5.6 was measured at and which always fitted, and
+200, the size that did not — so what it asserts is the property, that the second costs no more
+than the first. The exact figures are in the 0.5.20 entry, where a measurement belongs, rather
+than in an assertion that is only true on one machine.
+
+Verified the way it should have been: a fresh clone, `npm ci`, all 261 tests passing.
+
+## 0.5.25
+
+### Fixed: records that overlap in time went unreported, because the check looked for reversal
+
+There are two ways a discontinuous recording can make `time_s` step backwards, and only one
+was being looked for.
+
+The obvious one is a record that starts before the record before it. The other is a record
+that starts before the record before it *ends*. Starts of 0, 0.5 and 1.0 on one-second
+records are strictly increasing, so nothing fired — and the rows still came out 0.25, 0.5,
+0.75, 0.5, because the first record's samples run to 0.75 while the second begins at 0.5. A
+device re-sending a buffer produces exactly this.
+
+Both are reported now, with the same advice, since the reader has no more to say about one
+than the other: every sample is written, in file order, with the time the file gives it.
+Contiguity is not overlap — a continuous recording has `starts[i] === starts[i-1] + duration`
+exactly — so the comparison is made strict by a fraction of the finest interval the recording
+can express, and no ordinary file is called overlapping.
+
+`DISCONTINUOUS` now covers five conditions; the page said four, having said three until
+0.5.17.
+
 ## 0.5.24
 
 ### Fixed: the correctness page described a method it says two hundred lines later was abandoned

package/dist/cli.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"cli.d.ts","sourceRoot":"","sources":["../src/cli.ts"],"names":[],"mappings":";AACA;;;;;;;GAOG;AAeH,OAAO,EAA+C,gBAAgB,EAAE,MAAM,kBAAkB,CAAC;AA6HjG,wBAAsB,IAAI,CAAC,IAAI,EAAE,SAAS,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAkanE;AAq0BD,OAAO,EAAE,gBAAgB,EAAE,CAAC"}
+{"version":3,"file":"cli.d.ts","sourceRoot":"","sources":["../src/cli.ts"],"names":[],"mappings":";AACA;;;;;;;GAOG;AAeH,OAAO,EAA+C,gBAAgB,EAAE,MAAM,kBAAkB,CAAC;AA6HjG,wBAAsB,IAAI,CAAC,IAAI,EAAE,SAAS,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAobnE;AAq0BD,OAAO,EAAE,gBAAgB,EAAE,CAAC"}

package/dist/cli.js

@@ -480,9 +480,27 @@ export async function main(argv) {
                 process.off('SIGTERM', onInterrupt);
             }
         }
+        /*
+          A path that could not be read is a failure of this run, and the closing line has to
+          count it before it prints rather than after.
+    
+          It was counted afterwards, so a folder holding one recording beside a sub-directory
+          without read permission printed "Converted 1 of 1 recordings." and exited 1. The line
+          agreed with itself and with nothing else — which is the failure the walk's own comment
+          says was fixed, quoting that very sentence. What was fixed then was the error line and
+          the exit code; the summary went on saying everything worked.
+    
+          Counted separately from the recordings, because an unreadable path is not one of them:
+          how many recordings it held is the thing nobody knows.
+        */
+        if (unreadable.length > 0)
+            failures.push(EXIT_ERROR);
         if (batch && !quiet && !asJson) {
-            process.stderr.write(`\nConverted ${converted} of ${inputs.length} recordings` +
-                `${failures.length > 0 ? `; ${failures.length} failed` : ''}.\n`);
+            const unread = unreadable.length > 0
+                ? `; ${unreadable.length} path${unreadable.length === 1 ? '' : 's'} could not be read`
+                : '';
+            const failed = converted < inputs.length ? `; ${inputs.length - converted} failed` : '';
+            process.stderr.write(`\nConverted ${converted} of ${inputs.length} recordings${failed}${unread}.\n`);
         }
         /*
           A parent that forked this process needs the counts, not just an exit status.
@@ -495,8 +513,6 @@ export async function main(argv) {
           channel, so nothing changes for an ordinary invocation.
         */
         process.send?.({ edf2csv: { converted, warnings } });
-        if (unreadable.length > 0)
-            failures.push(EXIT_ERROR);
         if (failures.length > 0)
             return worstOf(failures);
         /*

package/dist/cli.js.map

@@ -1 +1 @@
-{"version":3,"file":"cli.js","sourceRoot":"","sources":["../src/cli.ts"],"names":[],"mappings":";AACA;;;;;;;GAOG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AACtC,OAAO,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AACxD,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACvC,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AAClE,OAAO,EAAE,IAAI,EAAE,MAAM,SAAS,CAAC;AAC/B,OAAO,EAAE,IAAI,EAAE,MAAM,oBAAoB,CAAC;AAE1C,OAAO,IAAI,MAAM,WAAW,CAAC;AAC7B,OAAO,OAAO,MAAM,cAAc,CAAC;AAEnC,OAAO,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAC3C,OAAO,EAAE,OAAO,EAAE,MAAM,iBAAiB,CAAC;AAC1C,OAAO,EAAE,SAAS,EAAE,sBAAsB,EAAE,MAAM,mBAAmB,CAAC;AACtE,OAAO,EAAE,eAAe,EAAE,iBAAiB,EAAE,OAAO,EAAE,gBAAgB,EAAE,MAAM,kBAAkB,CAAC;AACjG,OAAO,EAAE,qBAAqB,EAAE,MAAM,uBAAuB,CAAC;AAC9D,sFAAsF;AACtF,OAAO,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AACnD,OAAO,EAAE,cAAc,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACxE,OAAO,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AACzD,OAAO,EAAE,iBAAiB,EAAE,UAAU,EAAE,QAAQ,EAAE,aAAa,EAAE,SAAS,EAAE,cAAc,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AACjI,OAAO,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AAC1C,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAEvC,MAAM,KAAK,GAAG,WAAW,OAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CA+D/B,CAAC;AAEF,MAAM,OAAO,GAAG,CAAC,CAAC;AAClB,MAAM,UAAU,GAAG,CAAC,CAAC;AACrB,MAAM,UAAU,GAAG,CAAC,CAAC;AAErB;;;;;;GAMG;AACH,IAAI,QAAQ,GAAG,KAAK,CAAC;AAErB;;;;GAIG;AACH,SAAS,gBAAgB,CAAC,MAA0B;IAClD,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,KAA4B,EAAE,EAAE;QAClD,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YAC3B,mFAAmF;YACnF,oFAAoF;YACpF,gFAAgF;YAChF,gFAAgF;YAChF,gEAAgE;YAChE,OAAO;QACT,CAAC;QAED;;;;;;;;;;;;;;UAcE;QACF,IAAI,MAAM,CAAC,aAAa,CAAC,OAAO,CAAC,GAAG,CAAC;YAAE,OAAO;QAC9C,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,qBAAqB,MAAM,KAAK,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,YAAY,KAAK,CAAC,OAAO,IAAI,CAAC,CAAC;QACxH,OAAO,CAAC,QAAQ,GAAG,UAAU,CAAC;IAChC,CAAC,CAAC,CAAC;AACL,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,IAAI,CAAC,IAAuB;IAChD,gBAAgB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACjC,gBAAgB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAEjC,IAAI,MAA+B,CAAC;IACpC,IAAI,WAAqB,CAAC;IAE1B,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,SAAS,CAAC;YACvB,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC;YACf,gBAAgB,EAAE,IAAI;YACtB,MAAM,EAAE,IAAI;YACZ,OAAO,EAAE;gBACP,IAAI,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,GAAG,EAAE;gBACrC,GAAG,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,EAAE;gBACnC,QAAQ,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,EAAE,QAAQ,EAAE,IAAI,EAAE;gBACxD,KAAK,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;gBACzB,QAAQ,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;gBAC5B,GAAG,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;gBACvB,kBAAkB,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE;gBACvC,QAAQ,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;gBAC5B,QAAQ,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE;gBAC7B,MAAM,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;gBAC1B,IAAI,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE;gBACzB,GAAG,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE;gBACxB,IAAI,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,EAAE;gBACpC,KAAK,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,GAAG,EAAE;gBACtC,KAAK,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,GAAG,EAAE;gBACtC,IAAI,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE;gBACzB,MAAM,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE;gBAC3B,MAAM,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE;gBAC3B,IAAI,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,GAAG,EAAE;gBACrC,OAAO,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,GAAG,EAAE;aACzC;SACF,CAAC,CAAC;QACH,MAAM,GAAG,MAAM,CAAC,MAAiC,CAAC;QAClD,WAAW,GAAG,MAAM,CAAC,WAAW,CAAC;IACnC,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,8CAA8C,CAAC,CAAC;QACtF,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,IAAI,EAAE,CAAC;QAC5B,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC5B,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,IAAI,MAAM,CAAC,SAAS,CAAC,KAAK,IAAI,EAAE,CAAC;QAC/B,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC;QACrC,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC7B,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,2BAA2B,KAAK,EAAE,CAAC,CAAC;QACzD,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,IAAI,QAAiB,CAAC;IACtB,IAAI,UAAoB,CAAC;IACzB,IAAI,cAAuB,CAAC;IAC5B,IAAI,CAAC;QACH,MAAM,KAAK,GAAG,MAAM,YAAY,CAAC,WAAW,CAAC,CAAC;QAC9C,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC;QACxB,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC;QAC9B,cAAc,GAAG,KAAK,CAAC,cAAc,CAAC;IACxC,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO,WAAW,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;IAED,uFAAuF;IACvF,oFAAoF;IACpF,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;QAC/B,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,UAAU,SAAS,CAAC,KAAK,CAAC,kEAAkE,CAC7F,CAAC;IACJ,CAAC;IAED,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B;;;;;;;;;;;UAWE;QACF,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,+BAA+B,UAAU,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,aAAa,GAAG;gBACrF,iCAAiC,UAAU,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,WAAW,GAAG;gBACtF,0BAA0B,CAC7B,CAAC;YACF,OAAO,UAAU,CAAC;QACpB,CAAC;QACD,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,qCAAqC,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,CACnF,CAAC;QACF,OAAO,UAAU,CAAC;IACpB,CAAC;IACD,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACnD;;;;;;;;;MASE;IACF,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,cAAc,CAAC;IAClD,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,IAAI,CAAC;IACvC,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC;IACvC,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,KAAK,IAAI,CAAC;IACzC,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC,KAAK,IAAI,CAAC;IAE3C,wFAAwF;IACxF,mFAAmF;IACnF,gEAAgE;IAChE,IAAI,QAAQ,IAAI,MAAM,EAAE,CAAC;QACvB,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,yEAAyE;YACvE,wDAAwD,CAC3D,CAAC;QACF,OAAO,UAAU,CAAC;IACpB,CAAC;IAED;;;;;;;;MAQE;IACF,IAAI,QAAQ,IAAI,KAAK,EAAE,CAAC;QACtB,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,MAAM,CAAC,MAAM,KAAK,CAAC;YACjB,CAAC,CAAC,kFAAkF;gBAClF,qDAAqD,MAAM,CAAC,CAAC,CAAC,qBAAqB;gBACnF,sBAAsB;YACxB,CAAC,CAAC,mDAAmD,MAAM,CAAC,MAAM,gBAAgB;gBAChF,sEAAsE,CAC3E,CAAC;QACF,OAAO,UAAU,CAAC;IACpB,CAAC;IAED;;;;;;;;;;;;MAYE;IACF,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI;QAC1B,CAAC,OAAO,EAAE,MAAM,CAAC,KAAK,CAAC,KAAK,SAAS,CAAC;QACtC,CAAC,YAAY,EAAE,MAAM,CAAC,UAAU,CAAC,KAAK,IAAI,CAAC;KACnC,EAAE,CAAC;QACX,IAAI,QAAQ,IAAI,KAAK,EAAE,CAAC;YACtB,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,gBAAgB,IAAI,sDAAsD,IAAI,OAAO;gBACnF,4BAA4B,IAAI,kDAAkD,CACrF,CAAC;YACF,OAAO,UAAU,CAAC;QACpB,CAAC;IACH,CAAC;IAED;;;;;;;;;;;MAWE;IACF,MAAM,UAAU,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAEpC,IAAI,CAAC;QACH,MAAM,SAAS,GAAG,OAAO,MAAM,CAAC,KAAK,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAChF,MAAM,YAAY,GAAG,eAAe,CAAC,QAAQ,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;QACjE,cAAc,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;QAErC,MAAM,MAAM,GAAG;YACb,QAAQ,EAAE,aAAa,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;YAC3C,KAAK,EAAE,YAAY,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,SAAS,CAAC;YAC/C,SAAS,EAAE,OAAO,MAAM,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS;YAC5E,QAAQ,EAAE,YAAY,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,YAAY,CAAC;YACxD,GAAG,EAAE,YAAY,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC;YACzC,OAAO,EAAE,OAAO,MAAM,CAAC,KAAK,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS;YACtE,QAAQ,EAAE,gBAAgB,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;YAC9C,eAAe,EAAE,MAAM,CAAC,kBAAkB,CAAC,KAAK,IAAI;YACpD,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,KAAK,IAAI;YAC7B,GAAG,EAAE,MAAM,CAAC,KAAK,CAAC,KAAK,IAAI;YAC3B,MAAM,EAAE,cAAc,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;SACzC,CAAC;QAEF,kFAAkF;QAClF,mFAAmF;QACnF,iFAAiF;QACjF,oFAAoF;QACpF,sFAAsF;QACtF,mEAAmE;QACnE,MAAM,aAAa,GAAG,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QAC/D,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC;QAE1C,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,IAAI,EAAE,CAAC;YAC5B,MAAM,QAAQ,GAAa,EAAE,CAAC;YAC9B,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;gBAC9C,wEAAwE;gBACxE,IAAI,KAAK,IAAI,CAAC,MAAM,IAAI,KAAK,GAAG,CAAC;oBAAE,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAC9D,IAAI,CAAC;oBACH,QAAQ,IAAI,MAAM,QAAQ,CAAC,KAAe,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;gBAC1E,CAAC;gBAAC,OAAO,KAAK,EAAE,CAAC;oBACf,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAE,KAAgB,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;gBAC3E,CAAC;YACH,CAAC;YACD,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC;gBAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACrD,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;gBAAE,OAAO,OAAO,CAAC,QAAQ,CAAC,CAAC;YAClD,OAAO,MAAM,IAAI,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,OAAO,CAAC;QACvD,CAAC;QAED,wFAAwF;QACxF,8EAA8E;QAC9E,MAAM,YAAY,GAChB,CAAC,KAAK,IAAI,CAAC,MAAM,IAAI,CAAC,QAAQ,IAAI,IAAI,KAAK,CAAC,IAAI,OAAO,CAAC,MAAM,CAAC,KAAK,KAAK,IAAI,CAAC;QAEhF,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,8EAA8E;QAC9E,MAAM,MAAM,GAAG,KAAK,EAAE,KAAa,EAAE,IAAU,EAAiB,EAAE;YAChE,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAW,CAAC;YACtC,MAAM,WAAW,GAAG,YAAY,CAAC,KAAK,CAAW,CAAC;YAClD,oFAAoF;YACpF,gFAAgF;YAChF,IAAI,KAAK,IAAI,CAAC,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;gBAC/B,IAAI,CAAC,KAAK,EAAE,IAAI,KAAK,GAAG,CAAC,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACvE,CAAC;YACD,IAAI,CAAC;gBACH,QAAQ,IAAI,MAAM,UAAU,CAC1B,KAAK,EACL,WAAW,EACX;oBACE,GAAG,MAAM;oBACT,gFAAgF;oBAChF,iCAAiC;oBACjC,SAAS,EAAE,SAAS,KAAK,SAAS,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,WAAW;oBACtE,QAAQ,EAAE,MAAM,CAAC,UAAU,CAAC,KAAK,IAAI;oBACrC,KAAK,EAAE,MAAM,CAAC,OAAO,CAAC,KAAK,IAAI;oBAC/B,QAAQ;oBACR,KAAK;oBACL,MAAM;oBACN,YAAY;oBACZ,UAAU;iBACX,EACD,IAAI,CACL,CAAC;gBACF,SAAS,EAAE,CAAC;YACd,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf;;;;;kBAKE;gBACF,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC;YACrE,CAAC;QACH,CAAC,CAAC;QAEF,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACf,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;gBACnD,MAAM,MAAM,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;gBAClC,oFAAoF;gBACpF,IAAI,CAAC,KAAK,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;oBAAE,OAAO,QAAQ,CAAC,CAAC,CAAW,CAAC;YAClE,CAAC;QACH,CAAC;aAAM,CAAC;YACN;;;;;;;;;;;;;;;cAeE;YACF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAwB,CAAC;YAEhD;;;;;;;cAOE;YACF,MAAM,WAAW,GAAG,CAAC,MAAsB,EAAQ,EAAE;gBACnD,QAAQ,GAAG,IAAI,CAAC;gBAChB,MAAM,SAAS,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;gBACxC,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,IAAI,EAAE;oBAAE,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBAC1D,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,kBAAkB,MAAM,MAAM,SAAS,CAAC,MAAM,aAAa;oBACzD,GAAG,SAAS,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,8BAA8B;oBAClE,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC;wBACnB,CAAC,CAAC,8CAA8C,MAAM,CAAC,SAAS,CAAC,IAAI;wBACrE,CAAC,CAAC,EAAE,CAAC,CACV,CAAC;gBACF,OAAO,CAAC,IAAI,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAChD,CAAC,CAAC;YACF,OAAO,CAAC,IAAI,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;YACpC,OAAO,CAAC,IAAI,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;YAErC,IAAI,IAAI,GAAG,CAAC,CAAC;YACb,MAAM,MAAM,GAAG,KAAK,IAAmB,EAAE;gBACvC,KAAK,IAAI,KAAK,GAAG,IAAI,EAAE,EAAE,KAAK,GAAG,MAAM,CAAC,MAAM,EAAE,KAAK,GAAG,IAAI,EAAE,EAAE,CAAC;oBAC/D,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAW,CAAC;oBACtC,MAAM,IAAI,GAAG,QAAQ,EAAE,CAAC;oBACxB,IAAI,CAAC,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;wBACtB,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,KAAK,GAAG,CAAC,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;oBAC5E,CAAC;oBACD,MAAM,KAAK,GAAG,MAAM,cAAc,CAChC,KAAK,EACL,YAAY,CAAC,KAAK,CAAW,EAC7B,MAAM,EACN,OAAO,CACR,CAAC;oBACF,6EAA6E;oBAC7E,+EAA+E;oBAC/E,qCAAqC;oBACrC,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;wBACjB,SAAS,IAAI,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC;wBACpC,QAAQ,IAAI,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC;oBACpC,CAAC;yBAAM,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;wBAC5B,SAAS,EAAE,CAAC;oBACd,CAAC;oBACD,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC;wBAAE,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;oBAChD,4EAA4E;oBAC5E,qDAAqD;oBACrD,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;oBAC9D,gFAAgF;oBAChF,iFAAiF;oBACjF,2EAA2E;oBAC3E,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;oBAC1C,IAAI,CAAC,KAAK,EAAE,CAAC;gBACf,CAAC;YACH,CAAC,CAAC;YACF,IAAI,CAAC;gBACH,MAAM,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAClE,CAAC;oBAAS,CAAC;gBACT,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;gBACnC,OAAO,CAAC,GAAG,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;QAED,IAAI,KAAK,IAAI,CAAC,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;YAC/B,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,eAAe,SAAS,OAAO,MAAM,CAAC,MAAM,aAAa;gBACvD,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,QAAQ,CAAC,MAAM,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,CACnE,CAAC;QACJ,CAAC;QAED;;;;;;;;;UASE;QACF,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,SAAS,EAAE,QAAQ,EAAE,EAAE,CAAC,CAAC;QAErD,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC;YAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACrD,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,OAAO,CAAC,QAAQ,CAAC,CAAC;QAElD;;;;;;;;UAQE;QACF,IAAI,MAAM,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;YAC3B,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,eAAe,QAAQ,WAAW,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,0BAA0B;gBACnF,wDAAwD,CAC3D,CAAC;YACF,OAAO,UAAU,CAAC;QACpB,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO,WAAW,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;AACH,CAAC;AAED,iFAAiF;AACjF,KAAK,UAAU,QAAQ,CACrB,KAAa,EACb,MAA+B,EAC/B,MAAe,EACf,UAAyB;IAEzB,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACvC,IAAI,CAAC;QACH;;;;;;;;;;;;UAYE;QACF,MAAM,cAAc,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,GAAG,CAAC,CAAC;QACzD,MAAM,qBAAqB,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,KAAK,OAAO,IAAI,cAAc,CAAC;QACnF;;;;;;UAME;QACF,MAAM,cAAc,GAAG,qBAAqB;YAC1C,CAAC,CAAC,MAAM,IAAI,CAAC,eAAe,EAAE;YAC9B,CAAC,CAAC;gBACE,WAAW,EAAE,EAAE;gBACf,YAAY,EACV,IAAI,CAAC,MAAM,CAAC,UAAU,KAAK,OAAO,IAAI,cAAc;oBAClD,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC;oBAC3B,CAAC,CAAC,EAAE;gBACR,SAAS,EAAE,CAAC;aACb,CAAC;QACN,MAAM,MAAM,GAAG,kBAAkB,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;QACxD,MAAM,IAAI,GAAG,SAAS,CACpB;YACE,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO;YAC5B,cAAc,EAAE,IAAI,CAAC,MAAM,CAAC,cAAc;YAC1C,WAAW,EAAE,IAAI,CAAC,WAAW;YAC7B,oBAAoB,EAAE,IAAI,CAAC,iBAAiB,CAAC,MAAM,GAAG,CAAC;YACvD,YAAY,EAAE,MAAM,CAAC,MAAM;SAC5B,EACD,MAAM,CACP,CAAC;QACF,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC;QAC7C,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,IAAI,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CACjF,CAAC;QAEF,iFAAiF;QACjF,iFAAiF;QACjF,MAAM,WAAW,GAAG,CAAC,GAAG,sBAAsB,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;QACvF,IAAI,CAAC,MAAM,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,iBAAiB,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QAChE,CAAC;QACD,OAAO,WAAW,CAAC,MAAM,CAAC;IAC5B,CAAC;YAAS,CAAC;QACT,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;IACrB,CAAC;AACH,CAAC;AAED,wEAAwE;AACxE,KAAK,UAAU,UAAU,CACvB,KAAa,EACb,WAAmB,EACnB,OAMC,EACD,OAAa,YAAY;IAEzB,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC;IAC1D,IAAI,QAAQ,GAAG,CAAC,CAAC;IAEjB;;;;;MAKE;IACF,MAAM,WAAW,GAAG,CAAC,MAAsB,EAAQ,EAAE;QACnD,IAAI,YAAY;YAAE,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QACrD,kFAAkF;QAClF,sFAAsF;QACtF,sDAAsD;QACtD,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,kBAAkB,MAAM,+CAA+C;YACrE,CAAC,QAAQ;gBACP,CAAC,CAAC,wEAAwE;gBAC1E,CAAC,CAAC,oCAAoC,WAAW,4CAA4C,CAAC,CACnG,CAAC;QACF,2EAA2E;QAC3E,OAAO,CAAC,IAAI,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAChD,CAAC,CAAC;IACF,OAAO,CAAC,IAAI,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;IACpC,OAAO,CAAC,IAAI,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;IAErC,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,KAAK,EAAE;YAClC,GAAG,OAAO;YACV,UAAU,EAAE,YAAY;gBACtB,CAAC,CAAC,CAAC,QAAQ,EAAQ,EAAE;oBACjB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;oBACvB,IAAI,GAAG,GAAG,QAAQ,GAAG,GAAG;wBAAE,OAAO;oBACjC,QAAQ,GAAG,GAAG,CAAC;oBACf,MAAM,OAAO,GACX,QAAQ,CAAC,YAAY,KAAK,CAAC;wBACzB,CAAC,CAAC,GAAG;wBACL,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,WAAW,GAAG,QAAQ,CAAC,YAAY,CAAC,GAAG,GAAG,CAAC,CAAC;oBACvE,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,mBAAmB,OAAO,GAAG,CAAC,CAAC;gBACtD,CAAC;gBACH,CAAC,CAAC,SAAS;SACd,CAAC,CAAC;QAEH,IAAI,YAAY;YAAE,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QAErD,IAAI,MAAM,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;YAC7C,IAAI,CAAC,KAAK,EAAE,GAAG,iBAAiB,CAAC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAC9D,CAAC;QACD,IAAI,MAAM,EAAE,CAAC;YACX,gFAAgF;YAChF,mDAAmD;YACnD,IAAI,CAAC,KAAK,EAAE,GAAG,WAAW,CAAC,MAAM,EAAE,OAAO,CAAC,UAA2B,CAAC,IAAI,CAAC,CAAC;QAC/E,CAAC;aAAM,IAAI,CAAC,KAAK,EAAE,CAAC;YAClB,kFAAkF;YAClF,oEAAoE;YACpE,IAAI,QAAQ,EAAE,CAAC;gBACb,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC;gBACxC;;;;;;;;;;;;;kBAaE;gBACF,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;gBAC3C,IAAI,CACF,KAAK,EACL,CAAC,MAAM,CAAC,YAAY;oBAClB,CAAC,CAAC,SAAS,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,oBAAoB;oBAC3D,CAAC,CAAC,IAAI,GAAG,QAAQ;wBACf,CAAC,CAAC,6CAA6C,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,MAAM;4BAC/E,GAAG,QAAQ,CAAC,cAAc,CAAC,OAAO,CAAC,4CAA4C;4BAC/E,0BAA0B;wBAC5B,CAAC,CAAC,SAAS,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,yCAAyC;4BAC9E,2DAA2D,CAClE,CAAC;YACJ,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,KAAK,EAAE,GAAG,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC5C,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC;IACnC,CAAC;YAAS,CAAC;QACT,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;QACnC,OAAO,CAAC,GAAG,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;IACtC,CAAC;AACH,CAAC;AAwBD;;;;;;;GAOG;AACH,KAAK,UAAU,YAAY,CACzB,WAA8B;IAE9B,MAAM,KAAK,GAAY,EAAE,CAAC;IAC1B,MAAM,UAAU,GAAa,EAAE,CAAC;IAChC;;;;;;;;MAQE;IACF,IAAI,cAAc,GAAG,KAAK,CAAC;IAC3B,KAAK,MAAM,KAAK,IAAI,WAAW,EAAE,CAAC;QAChC,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;QACjD,IAAI,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;YACzC,oFAAoF;YACpF,sEAAsE;YACtE,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,aAAa,EAAE,KAAK,EAAE,CAAC,CAAC;YAC9E,SAAS;QACX,CAAC;QACD,cAAc,GAAG,IAAI,CAAC;QACtB,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,CAAC;QACjC,UAAU,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;QACtC,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;YAChC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC;QACpF,CAAC;IACH,CAAC;IACD;;;;;;;;;;;;;;;;;;;;MAoBE;IACF,MAAM,UAAU,GAAwD,EAAE,CAAC;IAC3E,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;QAC1B,MAAM,QAAQ,GAAG,MAAM,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACxF,MAAM,GAAG,GAAG,MAAM,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;QACtD,UAAU,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,cAAc,EAAE,IAAI,KAAK,EAAE,CAAC,CAAC;IAC7E,CAAC;IAED,MAAM,UAAU,GAAG,IAAI,GAAG,EAAiB,CAAC;IAC5C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuC,CAAC;IAC/D,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QAC7C,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,IAAI,CAAC;YAAE,SAAS;QAC/D,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QAC3C,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,QAAQ,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC;IACtD,CAAC;IAED,mFAAmF;IACnF,MAAM,MAAM,GAAG,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC;IACxC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAExE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,cAAc,EAAE,CAAC;AACxD,CAAC;AAED;;;;;;GAMG;AACH,SAAS,QAAQ,CACf,SAA0C,EAC1C,IAAqC;IAErC,IAAI,SAAS,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI;QAAE,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC;IACzD,IAAI,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,IAAI;QAAE,OAAO,SAAS,CAAC,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IAC5F;;;;;;;;;;;;;MAaE;IACF,MAAM,KAAK,GAAG,CAAC,KAAY,EAAU,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IAC1E,IAAI,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACpG,OAAO,SAAS,CAAC,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;AAChD,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,KAAK,UAAU,IAAI,CAAC,IAAY;IAC9B,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,UAAU,GAAa,EAAE,CAAC;IAChC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B;;;;;;;;;;;;;MAaE;IACF,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;IACrB,IAAI,IAAI,GAAG,CAAC,CAAC;IAEb,OAAO,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QAC3B,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,EAAE,CAAW,CAAC;QAC1C,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,SAAS,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;QAC9D,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAEf;;;;;;;;UAQE;QACF,IAAI,OAAO,CAAC;QACZ,IAAI,CAAC;YACH,OAAO,GAAG,MAAM,OAAO,CAAC,SAAS,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC;QAC9D,CAAC;QAAC,MAAM,CAAC;YACP,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC3B,SAAS;QACX,CAAC;QAED,yFAAyF;QACzF,+EAA+E;QAC/E,MAAM,OAAO,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACzC,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,cAAc,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,cAAc,EAAE,CAAC,CAAC;YACrE,OAAO,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5E,CAAC,CAAC,CAAC;QAEH,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;YAC9C,qFAAqF;YACrF,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;YAChD,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;gBAClB;;;;;;;;;;;;;;kBAcE;gBACF,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACtB,SAAS;YACX,CAAC;YACD,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;gBACvB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,CAAC;iBAAM,IAAI,IAAI,CAAC,MAAM,EAAE,IAAI,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC9D,kFAAkF;gBAClF,6DAA6D;gBAC7D,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC;AAC/B,CAAC;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,SAAS,eAAe,CACtB,MAAwB,EACxB,GAAuB;AACvB,2FAA2F;AAC3F,KAAc;IAEd,IAAI,GAAG,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,gBAAgB,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;IAClF,IAAI,CAAC,KAAK;QAAE,OAAO,CAAC,GAAG,CAAC,CAAC;IACzB,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACnE,CAAC;AAED,uFAAuF;AACvF,SAAS,MAAM,CAAC,IAAY;IAC1B,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IAClC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC;IACtE,OAAO,GAAG,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AACrD,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,cAAc,CAAC,MAAyB,EAAE,YAA+B;IAChF;;;;;;;;;;;;;;;;MAgBE;IACF,MAAM,SAAS,GAAG,OAAO,CAAC,QAAQ,KAAK,QAAQ,IAAI,OAAO,CAAC,QAAQ,KAAK,OAAO,CAAC;IAChF;;;;;;;;;;;;;;;;;;;;;MAqBE;IACF,MAAM,QAAQ,GAAG,CAAC,WAAmB,EAAU,EAAE;QAC/C,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QAC3C,IAAI,CAAC,SAAS;YAAE,OAAO,QAAQ,CAAC;QAChC,MAAM,MAAM,GAAG,QAAQ,CAAC,WAAW,EAAE,CAAC;QACtC,OAAO,OAAO,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAC1E,CAAC,CAAC;IAEF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,KAAK,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,YAAY,CAAC,OAAO,EAAE,EAAE,CAAC;QAC1D,MAAM,GAAG,GAAG,QAAQ,CAAC,WAAW,CAAC,CAAC;QAClC,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,MAAM,IAAI,WAAW,CACnB,IAAI,MAAM,CAAC,KAAK,CAAC,UAAU,KAAK,mCAAmC,WAAW,KAAK;gBACjF,qCAAqC;gBACrC,iDAAiD,CACpD,CAAC;QACJ,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,KAAK,CAAW,CAAC,CAAC;IAC5C,CAAC;IAED;;;;;;;;;;;;;;MAcE;IACF;;;;;;;;;;;;;MAaE;IACF,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;IAChD,KAAK,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,YAAY,CAAC,OAAO,EAAE,EAAE,CAAC;QAC1D,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAE,KAAK,CAAC,CAAC;IAClD,CAAC;IAED,KAAK,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,YAAY,CAAC,OAAO,EAAE,EAAE,CAAC;QAC1D,IAAI,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC;QACvD,KAAK,IAAI,MAAM,GAAG,EAAE,EAAE,QAAQ,KAAK,MAAM,EAAE,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC7E,MAAM,GAAG,QAAQ,CAAC;YAClB,MAAM,KAAK,GAAG,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC;YACpD,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,KAAK;gBAAE,SAAS;YACrD,MAAM,IAAI,WAAW,CACnB,IAAI,MAAM,CAAC,KAAK,CAAC,8BAA8B,WAAW,qBAAqB;gBAC7E,IAAI,YAAY,CAAC,KAAK,CAAC,cAAc,MAAM,CAAC,KAAK,CAAC,mBAAmB;gBACrE,kFAAkF;gBAClF,qBAAqB,CACxB,CAAC;QACJ,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,OAAO,CAAC,KAAwB;IACvC,OAAO,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC;AAC9D,CAAC;AAED;;;;;;;GAOG;AACH,KAAK,UAAU,cAAc,CAC3B,KAAa,EACb,WAAmB,EACnB,MAA+B,EAC/B,OAAkC;IAOlC;;;;;;;MAOE;IACF;;;;;;;;;;MAUE;IACF,MAAM,IAAI,GAAG,CAAC,SAAS,WAAW,EAAE,CAAC,CAAC;IACtC;;;;;;MAME;IACF,KAAK,MAAM,IAAI,IAAI,CAAC,kBAAkB,EAAE,UAAU,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,CAAC;QAC7F,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC;IACpD,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU,EAAE,QAAQ,CAAC,EAAE,CAAC;QACtE,IAAI,OAAO,MAAM,CAAC,IAAI,CAAC,KAAK,QAAQ;YAAE,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,IAAI,MAAM,CAAC,IAAI,CAAW,EAAE,CAAC,CAAC;IACzF,CAAC;IACD,0FAA0F;IAC1F,+EAA+E;IAC/E,MAAM,QAAQ,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;IACpC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC3B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAE,QAAqB,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC;YACzF,IAAI,CAAC,IAAI,CAAC,cAAc,IAAI,EAAE,CAAC,CAAC;QAClC,CAAC;IACH,CAAC;IACD,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAEvB,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;QAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE;YACvD,KAAK,EAAE,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC;SACzC,CAAC,CAAC;QACH,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;QAChC,IAAI,GAAG,GAAG,EAAE,CAAC;QACb,IAAI,GAAG,GAAG,EAAE,CAAC;QACb,IAAI,MAAM,GAAmD,IAAI,CAAC;QAClE,KAAK,CAAC,EAAE,CAAC,SAAS,EAAE,CAAC,OAAgB,EAAE,EAAE;YACvC,MAAM,OAAO,GAAI,OAAiE,EAAE,OAAO,CAAC;YAC5F,IAAI,OAAO;gBAAE,MAAM,GAAG,OAAO,CAAC;QAChC,CAAC,CAAC,CAAC;QACH,KAAK,CAAC,MAAM,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,KAAa,EAAE,EAAE;YAC7D,GAAG,IAAI,KAAK,CAAC;QACf,CAAC,CAAC,CAAC;QACH,KAAK,CAAC,MAAM,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,KAAa,EAAE,EAAE;YAC7D,GAAG,IAAI,KAAK,CAAC;QACf,CAAC,CAAC,CAAC;QACH,KAAK,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,KAAK,EAAE,EAAE;YAC1B,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACtB,OAAO,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GAAG,UAAU,KAAK,KAAK,KAAK,CAAC,OAAO,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;QAC/F,CAAC,CAAC,CAAC;QACH,KAAK,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE;YACjC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACtB;;;;;;;;;;;;;cAaE;YACF,IAAI,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACjC,GAAG;oBACD,qBAAqB,MAAM,wBAAwB;wBACnD,8CAA8C,WAAW,IAAI,CAAC;YAClE,CAAC;YACD,OAAO,CAAC,EAAE,IAAI,EAAE,IAAI,IAAI,UAAU,EAAE,GAAG,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,CAAC;QAC1D,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC;AAED,sEAAsE;AACtE,SAAS,KAAK,CAAC,IAAY,EAAE,KAAa;IACxC,uFAAuF;IACvF,2FAA2F;IAC3F,4EAA4E;IAC5E,OAAO,IAAI,CAAC,OAAO,CAAC,aAAa,EAAE,GAAG,EAAE,CAAC,UAAU,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;AAC3E,CAAC;AAED,6FAA6F;AAC7F,SAAS,WAAW,CAAC,IAAY;IAC/B,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;IAC5B,IAAI,OAAO,KAAK,EAAE;QAAE,OAAO,EAAE,CAAC;IAC9B,IAAI,CAAC;QACH,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC;IACpD,CAAC;IAAC,MAAM,CAAC;QACP,2EAA2E;QAC3E,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAYD,MAAM,YAAY,GAAS,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE;IAC1C,CAAC,MAAM,KAAK,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;AACnE,CAAC,CAAC;AAEF,qFAAqF;AACrF,SAAS,QAAQ;IACf,MAAM,KAAK,GAAgC,EAAE,CAAC;IAC9C,OAAO;QACL,IAAI,EAAE,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAClD,KAAK,EAAE,GAAG,EAAE;YACV,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,KAAK;gBAAE,YAAY,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACjE,CAAC;KACF,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,SAAS,WAAW,CAAC,KAAc,EAAE,KAAc,EAAE,OAAa,YAAY;IAC5E,MAAM,KAAK,GAAG,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC;IACjE,IAAI,KAAK,YAAY,QAAQ,IAAI,KAAK,YAAY,eAAe,EAAE,CAAC;QAClE,IAAI,CAAC,KAAK,EAAE,UAAU,KAAK,GAAG,cAAc,CAAC,KAAK,CAAC,OAAO,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC;QAC5E,IAAI,KAAK,CAAC,IAAI;YAAE,IAAI,CAAC,KAAK,EAAE,UAAU,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC;QACtD,qFAAqF;QACrF,oDAAoD;QACpD,OAAO,KAAK,YAAY,eAAe,IAAI,iBAAiB,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC;YAC1E,CAAC,CAAC,UAAU;YACZ,CAAC,CAAC,UAAU,CAAC;IACjB,CAAC;IACD,IACE,KAAK,YAAY,qBAAqB;QACtC,KAAK,YAAY,cAAc;QAC/B,KAAK,YAAY,WAAW,EAC5B,CAAC;QACD,IAAI,CAAC,KAAK,EAAE,UAAU,KAAK,GAAG,cAAc,CAAC,KAAK,CAAC,OAAO,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC;QAC5E,OAAO,UAAU,CAAC;IACpB,CAAC;IACD,IAAI,CAAC,KAAK,EAAE,UAAU,KAAK,GAAG,OAAO,CAAC,KAAK,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC;IAC7D,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;;;;;GAMG;AACH,SAAS,SAAS,CAAC,GAAY,EAAE,MAAc;IAC7C,IAAI,GAAG,KAAK,SAAS;QAAE,OAAO,CAAC,CAAC;IAChC,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IAChC,IAAI,IAAI,KAAK,MAAM;QAAE,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAC7E,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;IAC3B,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QAC1C,MAAM,IAAI,WAAW,CAAC,+DAA+D,IAAI,IAAI,CAAC,CAAC;IACjG,CAAC;IACD,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;AAC9C,CAAC;AAED,SAAS,aAAa,CAAC,GAAY;IACjC,IAAI,GAAG,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IACxC,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,GAAgB,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;IACpE,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;IACrG,oFAAoF;IACpF,6EAA6E;IAC7E,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,MAAM,IAAI,WAAW,CAAC,kDAAkD,CAAC,CAAC;IAC5E,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,YAAY,CAAC,GAAY,EAAE,MAAc;IAChD,IAAI,GAAG,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IACxC,OAAO,aAAa,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;AAC5C,CAAC;AAED,+EAA+E;AAC/E,SAAS,cAAc,CAAC,GAAY;IAClC,IAAI,GAAG,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IACxC,IAAI,GAAG,KAAK,MAAM,IAAI,GAAG,KAAK,MAAM;QAAE,OAAO,GAAG,CAAC;IACjD,MAAM,IAAI,WAAW,CAAC,2CAA2C,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;AACpF,CAAC;AAED,SAAS,gBAAgB,CAAC,GAAY;IACpC,IAAI,GAAG,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IACxC,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IAChC,qFAAqF;IACrF,IAAI,IAAI,KAAK,EAAE,EAAE,CAAC;QAChB,MAAM,IAAI,WAAW,CAAC,sDAAsD,CAAC,CAAC;IAChF,CAAC;IACD,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;IAC3B,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,EAAE,EAAE,CAAC;QACxD,MAAM,IAAI,WAAW,CAAC,4DAA4D,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACrG,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;EAKE;AACF,SAAS,OAAO,CAAC,KAAc,EAAE,MAAM,GAAG,EAAE;IAC1C,2FAA2F;IAC3F,2EAA2E;IAC3E,OAAO,cAAc,CAAC,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,CAAC;AACxF,CAAC;AAED,OAAO,EAAE,gBAAgB,EAAE,CAAC;AAE5B;;;;;;;;GAQG;AACH,SAAS,YAAY;IACnB,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9B,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IACtC,IAAI,CAAC;QACH,OAAO,YAAY,CAAC,KAAK,CAAC,KAAK,YAAY,CAAC,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IAC9E,CAAC;IAAC,MAAM,CAAC;QACP,wEAAwE;QACxE,OAAO,aAAa,CAAC,KAAK,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC;IACvD,CAAC;AACH,CAAC;AAED,MAAM,eAAe,GAAG,YAAY,EAAE,CAAC;AAEvC,IAAI,eAAe,EAAE,CAAC;IACpB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;SACxB,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE;QACb,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC;IAC1B,CAAC,CAAC;SACD,KAAK,CAAC,CAAC,KAAc,EAAE,EAAE;QACxB,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,UAAU,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACnD,OAAO,CAAC,QAAQ,GAAG,UAAU,CAAC;IAChC,CAAC,CAAC,CAAC;AACP,CAAC","sourcesContent":["#!/usr/bin/env node\n/**\n * Command-line entry point.\n *\n * Output discipline: anything that is the *result* of a command goes to stdout\n * (`--info`'s channel table, `--json`'s summary). Progress, warnings and the\n * conversion summary go to stderr, so a conversion can be run in a pipeline without\n * its chatter contaminating the data.\n */\n\nimport { parseArgs } from 'node:util';\nimport { pathToFileURL, fileURLToPath } from 'node:url';\nimport { realpathSync } from 'node:fs';\nimport { lstat, readdir, realpath, stat } from 'node:fs/promises';\nimport { cpus } from 'node:os';\nimport { fork } from 'node:child_process';\nimport type { ChildProcess } from 'node:child_process';\nimport path from 'node:path';\nimport process from 'node:process';\n\nimport { EdfError } from './edf/errors.js';\nimport { EdfFile } from './edf/reader.js';\nimport { buildPlan, withoutFileRateWarning } from './convert/plan.js';\nimport { ConversionError, USAGE_ERROR_CODES, convert, defaultOutputDir } from './convert/run.js';\nimport { ChannelSelectionError } from './convert/channels.js';\n// Shared with the library so a bad option is the same error whichever way it arrived.\nimport { OptionError } from './convert/options.js';\nimport { TimeRangeError, parseTimeSpec } from './convert/time-range.js';\nimport { deriveRecordStarts } from './convert/timing.js';\nimport { formatDiagnostics, formatInfo, infoJson, formatSummary, printable, printableLines, summaryJson } from './cli/report.js';\nimport { listed } from './format/list.js';\nimport { VERSION } from './version.js';\n\nconst USAGE = `edf2csv ${VERSION}\nConvert EDF, EDF+ and BDF recordings to CSV\n\nUsage\n  edf2csv <recording.edf | folder> [more ...] [options]\n\nOptions\n  -i, --info             Show the recording's structure and estimated output size,\n                         without converting anything\n  -o, --out <dir>        Output directory (default: <recording>_csv beside the input)\n  -c, --channels <list>  Only these channels, comma-separated. Use #N to pick a\n                         channel by position when two share a label\n      --start <time>     Begin at this offset (30s, 5m, 1h30m, 00:30:00)\n      --duration <time>  Convert this much\n      --end <time>       Stop at this offset (instead of --duration)\n      --annotations-only Write only the EDF+ annotations, no signal data\n      --decimals <n>     Fix the decimal places instead of deriving them per channel\n      --checksum         Record a SHA-256 of the input in metadata.json\n      --layout <kind>    wide (default): one column per channel, one file per\n                         sampling rate. long: one file of time_s,channel,value,\n                         every rate together, one row per sample\n      --gzip             Compress every CSV, writing .csv.gz files\n      --bom              Start each CSV with a UTF-8 byte order mark, so Excel\n                         reads accented text and units like µV correctly\n  -j, --jobs <n>         Convert this many recordings at once, or \"auto\" (default: 1)\n  -f, --force            Overwrite the output directory if it exists\n  -q, --quiet            Suppress the summary; warnings and errors still print\n      --json             Print machine-readable JSON to stdout (works with --info too)\n      --strict           Exit 1 if the recording raised any warning\n      --stdout           Write the signal CSV to stdout instead of a directory\n                         (one table only: one sampling rate, or --layout long)\n  -h, --help             Show this help\n  -V, --version          Show the version\n\nSeveral recordings\n  A folder is expanded to every .edf and .bdf inside it, at any depth, and the\n  layout is kept: recordings in sub-folders come out in sub-folders.\n  Pass more than one and each is converted in turn. Without --out each lands\n  beside itself as usual; with --out that directory becomes the parent and each\n  recording gets its own inside it. A file that cannot be read is reported and\n  the rest still convert, with a non-zero exit at the end. --jobs converts\n  several at once, which is worth it for a folder of them.\n\nOutput\n  A directory containing signals.csv, channels.csv, metadata.json, and\n  annotations.csv when the recording carries EDF+ annotations. Channels recorded\n  at different sampling rates are written to separate files, never resampled.\n  With --gzip each CSV becomes a .csv.gz; metadata.json stays plain text so the\n  directory can still be read at a glance. With --bom each CSV starts with a\n  UTF-8 byte order mark and metadata.json does not, since JSON.parse rejects one.\n  With --layout long every channel goes into one signals.csv as time_s, channel\n  and value, in time order, whatever rates the recording mixes — which is also\n  the one arrangement --stdout can stream for a mixed-rate file.\n\nExamples\n  edf2csv recording.edf\n  edf2csv recording.edf --info\n  edf2csv recording.edf --channels \"EEG Fpz-Cz,ECG\" --out ./converted\n  edf2csv recording.edf --start 30m --duration 5m\n  edf2csv recording.edf --annotations-only\n  edf2csv /data/*.edf --out ./converted\n  edf2csv /data/*.edf --out ./converted --jobs auto\n  edf2csv /data/study --out ./converted --jobs auto\n`;\n\nconst EXIT_OK = 0;\nconst EXIT_ERROR = 1;\nconst EXIT_USAGE = 2;\n\n/**\n * Whether this run is already shutting its children down.\n *\n * A child dying by signal is normally worth a line of its own, but not when this process is\n * the one that killed it: the interrupt handler names every abandoned directory in a single\n * message, and a per-child line underneath it would say the same thing again, once per job.\n */\nlet stopping = false;\n\n/**\n * Piping into a consumer that exits early (`| head -1`) closes our stdout, and the\n * next write raises EPIPE. That is normal in a shell pipeline, not an error worth a\n * stack trace, so it is swallowed while anything else still surfaces.\n */\nfunction ignoreBrokenPipe(stream: NodeJS.WriteStream): void {\n  stream.on('error', (error: NodeJS.ErrnoException) => {\n    if (error.code === 'EPIPE') {\n      // A reader closing early (`edf2csv ... --info | head -5`) is not a failure, so the\n      // error is swallowed rather than thrown. It deliberately does NOT set an exit code:\n      // forcing 0 here would erase a real failure whenever the pipe happened to close\n      // after the run had already failed, reporting success for a conversion that did\n      // not happen. Node exits 0 on its own when nothing sets a code.\n      return;\n    }\n\n    /*\n      Anything else is a real write failure, and this used to rethrow it.\n\n      The throw lands on a nextTick, outside whatever try/catch the conversion is running\n      inside, so it became an uncaught exception: `--stdout` redirected onto a full disk\n      died with a raw stack trace headed `dist/cli.js: throw error;` and lost the warning\n      that the CSV it had already produced was truncated. The same failure through `--out`\n      printed the ordinary message, and so did `--stdout` through the library API, which\n      never registers this listener — the designed path exists and works, and this was\n      preempting it.\n\n      A second listener means the conversion's writer is watching this stream and will\n      turn the failure into that ordinary message. Saying it here too would report one\n      failure twice, so this only speaks when nothing else will.\n    */\n    if (stream.listenerCount('error') > 1) return;\n    process.stderr.write(`error: Writing to ${stream === process.stdout ? 'stdout' : 'stderr'} failed: ${error.message}\\n`);\n    process.exitCode = EXIT_ERROR;\n  });\n}\n\nexport async function main(argv: readonly string[]): Promise<number> {\n  ignoreBrokenPipe(process.stdout);\n  ignoreBrokenPipe(process.stderr);\n\n  let values: Record<string, unknown>;\n  let positionals: string[];\n\n  try {\n    const parsed = parseArgs({\n      args: [...argv],\n      allowPositionals: true,\n      strict: true,\n      options: {\n        info: { type: 'boolean', short: 'i' },\n        out: { type: 'string', short: 'o' },\n        channels: { type: 'string', short: 'c', multiple: true },\n        start: { type: 'string' },\n        duration: { type: 'string' },\n        end: { type: 'string' },\n        'annotations-only': { type: 'boolean' },\n        decimals: { type: 'string' },\n        checksum: { type: 'boolean' },\n        layout: { type: 'string' },\n        gzip: { type: 'boolean' },\n        bom: { type: 'boolean' },\n        jobs: { type: 'string', short: 'j' },\n        force: { type: 'boolean', short: 'f' },\n        quiet: { type: 'boolean', short: 'q' },\n        json: { type: 'boolean' },\n        strict: { type: 'boolean' },\n        stdout: { type: 'boolean' },\n        help: { type: 'boolean', short: 'h' },\n        version: { type: 'boolean', short: 'V' },\n      },\n    });\n    values = parsed.values as Record<string, unknown>;\n    positionals = parsed.positionals;\n  } catch (error) {\n    process.stderr.write(`${message(error)}\\n\\nRun edf2csv --help to see the options.\\n`);\n    return EXIT_USAGE;\n  }\n\n  if (values['help'] === true) {\n    process.stdout.write(USAGE);\n    return EXIT_OK;\n  }\n  if (values['version'] === true) {\n    process.stdout.write(`${VERSION}\\n`);\n    return EXIT_OK;\n  }\n\n  if (positionals.length === 0) {\n    process.stderr.write(`No input file given.\\n\\n${USAGE}`);\n    return EXIT_USAGE;\n  }\n\n  let expanded: Input[];\n  let unreadable: string[];\n  let namedDirectory: boolean;\n  try {\n    const found = await expandInputs(positionals);\n    expanded = found.inputs;\n    unreadable = found.unreadable;\n    namedDirectory = found.namedDirectory;\n  } catch (error) {\n    return reportError(error);\n  }\n\n  // Reported before anything is converted, so it cannot be lost among the summaries, and\n  // counted against the run so the exit code does not call a partial sweep a success.\n  for (const entry of unreadable) {\n    process.stderr.write(\n      `error: ${printable(entry)}: could not be read, so any recordings inside it were skipped.\\n`,\n    );\n  }\n\n  if (expanded.length === 0) {\n    /*\n      \"None here\" and \"could not look\" are different answers, and so are their exit codes.\n\n      A folder the process cannot read gave the same exit 2 and the same \"No EDF or BDF\n      recordings found\" as an empty one — while the line above it said the folder could not\n      be read. Exit 2 is this tool's code for \"the command itself was wrong\", so a script\n      was being told to fix its arguments when what needed fixing was a permission. The\n      command was fine; the filesystem refused.\n\n      And the sentence itself claimed a fact the run is in no position to state: nothing was\n      found because nothing was looked at.\n    */\n    if (unreadable.length > 0) {\n      process.stderr.write(\n        `Nothing could be converted: ${unreadable.length === 1 ? 'that path' : 'those paths'} ` +\n          `could not be read, so whether ${unreadable.length === 1 ? 'it holds' : 'they hold'} ` +\n          `recordings is unknown.\\n`,\n      );\n      return EXIT_ERROR;\n    }\n    process.stderr.write(\n      `No EDF or BDF recordings found in ${listed(positionals.map((p) => `\"${p}\"`))}.\\n`,\n    );\n    return EXIT_USAGE;\n  }\n  const inputs = expanded.map((entry) => entry.path);\n  /*\n    A batch is what you asked for, not what happened to be there.\n\n    Counting the recordings made the shape of the run depend on the contents of a folder.\n    Under --json a study holding one night printed a pretty-printed object and the same study\n    holding two printed two compact lines, so a script written against one of them broke on\n    the other — and it broke the day a recording was added, not the day the script changed.\n    An input going missing did it in reverse. This is the same count 0.4.20 took out of\n    `--out` for the same reason.\n  */\n  const batch = inputs.length > 1 || namedDirectory;\n  const quiet = values['quiet'] === true;\n  const asJson = values['json'] === true;\n  const strict = values['strict'] === true;\n  const toStdout = values['stdout'] === true;\n\n  // Both of these claim stdout. Allowing them together wrote the CSV and then the summary\n  // object onto one stream, producing a document that is neither valid CSV nor valid\n  // JSON — and silently, since each half looked right on its own.\n  if (toStdout && asJson) {\n    process.stderr.write(\n      '--stdout and --json both write to stdout, so they cannot be combined.\\n' +\n        'Use --stdout for the CSV, or --json for the summary.\\n',\n    );\n    return EXIT_USAGE;\n  }\n\n  /*\n    One stream holds one table, for the same reason it holds one recording: concatenating\n    them would give a CSV whose rows come from different files with nothing marking where\n    one ends. Naming the count makes it obvious a glob was the cause — except when the count\n    is one, which happens for a folder holding a single recording. That read \"--stdout writes\n    a single CSV, so it cannot take 1 recordings\": ungrammatical, and wrong on its face, since\n    one recording is exactly what it can take. What it cannot take is a folder, whose contents\n    are not known until they are walked.\n  */\n  if (toStdout && batch) {\n    process.stderr.write(\n      inputs.length === 1\n        ? `--stdout writes a single CSV, and a folder is converted as a batch even when it ` +\n          `holds one recording.\\nName the recording itself — ${inputs[0]} — or convert to a ` +\n          `directory instead.\\n`\n        : `--stdout writes a single CSV, so it cannot take ${inputs.length} recordings.\\n` +\n          `Convert them to directories instead, or run edf2csv once per file.\\n`,\n    );\n    return EXIT_USAGE;\n  }\n\n  /*\n    Flags that --stdout has nowhere to put.\n\n    Both were accepted and dropped in silence. `--out` names a directory that is never\n    created, so the run looked like it had written one. `--checksum` is worse than useless:\n    the hash is computed before the first record is read, which is a second full pass over\n    the input, and then the only file it is ever written to — metadata.json — is not written\n    at all. A recording large enough to want a checksum is large enough to notice reading it\n    twice for nothing.\n\n    Refusing rather than ignoring is what this tool already does for `--stdout --json` and\n    `--stdout --annotations-only`.\n  */\n  for (const [flag, given] of [\n    ['--out', values['out'] !== undefined],\n    ['--checksum', values['checksum'] === true],\n  ] as const) {\n    if (toStdout && given) {\n      process.stderr.write(\n        `--stdout and ${flag} cannot be combined: --stdout writes no files, and ${flag} has ` +\n          `nothing to act on.\\nDrop ${flag}, or drop --stdout and convert to a directory.\\n`,\n      );\n      return EXIT_USAGE;\n    }\n  }\n\n  /*\n    One recording prints the document it always printed; several print one per line.\n\n    Pretty-printed objects run together are still readable by a streaming JSON parser, but\n    not by anything that reads a record per line — and a batch is exactly where that is\n    wanted. Emitting a batch in the single-file shape would repeat 0.2.28's mistake of\n    putting two documents on one stream and leaving the caller to work out the boundary.\n\n    null, not undefined: the serialisers default this argument to 2, and a default parameter\n    takes effect for undefined, which silently gave a batch the indentation it was supposed\n    to be dropping.\n  */\n  const jsonIndent = batch ? null : 2;\n\n  try {\n    const outOption = typeof values['out'] === 'string' ? values['out'] : undefined;\n    const destinations = destinationsFor(expanded, outOption, batch);\n    assertDistinct(inputs, destinations);\n\n    const shared = {\n      channels: splitChannels(values['channels']),\n      start: optionalTime(values['start'], '--start'),\n      startText: typeof values['start'] === 'string' ? values['start'] : undefined,\n      duration: optionalTime(values['duration'], '--duration'),\n      end: optionalTime(values['end'], '--end'),\n      endText: typeof values['end'] === 'string' ? values['end'] : undefined,\n      decimals: optionalDecimals(values['decimals']),\n      annotationsOnly: values['annotations-only'] === true,\n      gzip: values['gzip'] === true,\n      bom: values['bom'] === true,\n      layout: optionalLayout(values['layout']),\n    };\n\n    // Validated before the --info branch, not inside the conversion path: a flag that\n    // cannot be honoured is a usage error whatever mode it was given in, and accepting\n    // \"--jobs 0\" in silence under --info is the kind of quiet that this tool avoids.\n    // Parsed before it is overridden: --stdout converts one recording however many jobs\n    // were asked for, but \"--stdout --jobs 0\" is still a request that cannot be honoured,\n    // and accepting it in silence is the thing 0.4.2 fixed for --info.\n    const requestedJobs = parseJobs(values['jobs'], inputs.length);\n    const jobs = toStdout ? 1 : requestedJobs;\n\n    if (values['info'] === true) {\n      const failures: number[] = [];\n      let warnings = 0;\n      for (const [index, input] of inputs.entries()) {\n        // A blank line between reports, so several tables read as one document.\n        if (batch && !asJson && index > 0) process.stdout.write('\\n');\n        try {\n          warnings += await showInfo(input as string, shared, asJson, jsonIndent);\n        } catch (error) {\n          failures.push(reportError(error, batch ? (input as string) : undefined));\n        }\n      }\n      if (unreadable.length > 0) failures.push(EXIT_ERROR);\n      if (failures.length > 0) return worstOf(failures);\n      return strict && warnings > 0 ? EXIT_ERROR : EXIT_OK;\n    }\n\n    // The meter redraws one line in place, which two conversions cannot share. Running them\n    // at once replaces it with the completion count each file prints as it lands.\n    const showProgress =\n      !quiet && !asJson && !toStdout && jobs === 1 && process.stderr.isTTY === true;\n\n    const failures: number[] = [];\n    let warnings = 0;\n    let converted = 0;\n\n    /** Convert input `index`, sending its output wherever the caller wants it. */\n    const runOne = async (index: number, emit: Emit): Promise<void> => {\n      const input = inputs[index] as string;\n      const destination = destinations[index] as string;\n      // Which recording this is, before anything it prints. Without it a batch produces a\n      // stack of summaries and errors with nothing saying which file each belongs to.\n      if (batch && !quiet && !asJson) {\n        emit('err', `[${index + 1}/${inputs.length}] ${printable(input)}\\n`);\n      }\n      try {\n        warnings += await convertOne(\n          input,\n          destination,\n          {\n            ...shared,\n            // With one input and no --out, convert() derives the default itself, exactly as\n            // it did before batches existed.\n            outputDir: outOption === undefined && !batch ? undefined : destination,\n            checksum: values['checksum'] === true,\n            force: values['force'] === true,\n            toStdout,\n            quiet,\n            asJson,\n            showProgress,\n            jsonIndent,\n          },\n          emit,\n        );\n        converted++;\n      } catch (error) {\n        /*\n          A batch keeps going. One unreadable recording among five hundred is a reason to\n          report that file, not to abandon the ones already converted and refuse the rest.\n          The exit code still reports the run as failed, and the closing line says how many\n          of them made it, so nothing about the failure is quiet.\n        */\n        failures.push(reportError(error, batch ? input : undefined, emit));\n      }\n    };\n\n    if (jobs === 1) {\n      for (let index = 0; index < inputs.length; index++) {\n        await runOne(index, writeThrough);\n        // A single recording keeps the exit code it has always had rather than the batch's.\n        if (!batch && failures.length > 0) return failures[0] as number;\n      }\n    } else {\n      /*\n        Real processes, not concurrent promises.\n\n        Converting is almost entirely arithmetic and string building — 1.17 s of CPU for\n        1.24 s of wall clock on a 168 MB conversion — and Node runs that on one thread. An\n        in-process pool was tried first and gained 6% on eight recordings, which is the\n        overlap in the file reads and nothing else. Each conversion is already a whole\n        command, so each one gets its own process, which is what `xargs -P` would do by hand.\n\n        Workers take the next recording as they free up rather than splitting the list into\n        equal shares. Recordings in a folder differ wildly in length, and a fixed split\n        leaves every worker but one idle behind the longest file.\n\n        Each child's output is held until it exits, so two finishing together cannot\n        interleave one's summary with the other's warnings.\n      */\n      const running = new Map<ChildProcess, string>();\n\n      /*\n        Ctrl-C in a terminal reaches every process in the group, so the children would stop\n        anyway; a signal sent to this process alone does not, and that is how a batch gets\n        run from a script or a CI job. Interrupting one left four conversions writing\n        gigabytes into a directory their owner believed abandoned, and the last thing on\n        screen was a successful \"Done in 1.6s\" from whichever recording had just landed —\n        the run read as if it had finished.\n      */\n      const onInterrupt = (signal: NodeJS.Signals): void => {\n        stopping = true;\n        const abandoned = [...running.values()];\n        for (const child of running.keys()) child.kill('SIGTERM');\n        process.stderr.write(\n          `\\ninterrupted (${signal}): ${abandoned.length} conversion` +\n            `${abandoned.length === 1 ? '' : 's'} stopped part way through.\\n` +\n            (abandoned.length > 0\n              ? `       Incomplete, and should not be used: ${listed(abandoned)}\\n`\n              : ''),\n        );\n        process.exit(signal === 'SIGINT' ? 130 : 143);\n      };\n      process.once('SIGINT', onInterrupt);\n      process.once('SIGTERM', onInterrupt);\n\n      let next = 0;\n      const worker = async (): Promise<void> => {\n        for (let index = next++; index < inputs.length; index = next++) {\n          const input = inputs[index] as string;\n          const sink = buffered();\n          if (!quiet && !asJson) {\n            sink.emit('err', `[${index + 1}/${inputs.length}] ${printable(input)}\\n`);\n          }\n          const child = await convertInChild(\n            input,\n            destinations[index] as string,\n            values,\n            running,\n          );\n          // The report says what the child actually did; the exit code says whether it\n          // got there. A child that converted and warned has a report and exits 0, since\n          // --strict is the parent's to apply.\n          if (child.report) {\n            converted += child.report.converted;\n            warnings += child.report.warnings;\n          } else if (child.code === 0) {\n            converted++;\n          }\n          if (child.code !== 0) failures.push(child.code);\n          // The child saw one recording, so it printed the indented document a single\n          // conversion prints. A batch is one object per line.\n          sink.emit('out', asJson ? compactJson(child.out) : child.out);\n          // The child converted a single recording, so it named no file in its errors the\n          // way a batch does. Naming it here keeps the two paths identical to a reader and\n          // to anything grepping a log, where the [n/m] header may not be alongside.\n          sink.emit('err', named(child.err, input));\n          sink.flush();\n        }\n      };\n      try {\n        await Promise.all(Array.from({ length: jobs }, () => worker()));\n      } finally {\n        process.off('SIGINT', onInterrupt);\n        process.off('SIGTERM', onInterrupt);\n      }\n    }\n\n    if (batch && !quiet && !asJson) {\n      process.stderr.write(\n        `\\nConverted ${converted} of ${inputs.length} recordings` +\n          `${failures.length > 0 ? `; ${failures.length} failed` : ''}.\\n`,\n      );\n    }\n\n    /*\n      A parent that forked this process needs the counts, not just an exit status.\n\n      An exit code cannot separate \"converted, and raised warnings\" from \"did not convert\",\n      and under --strict those are the same code. The parent read it as a failure, so a\n      parallel run of two recordings — one of which merely warned — reported \"Converted 1 of\n      2 recordings; 1 failed\" for a run in which both converted, while the serial path said\n      \"Converted 2 of 2\". `process.send` exists only when this process was forked with a\n      channel, so nothing changes for an ordinary invocation.\n    */\n    process.send?.({ edf2csv: { converted, warnings } });\n\n    if (unreadable.length > 0) failures.push(EXIT_ERROR);\n    if (failures.length > 0) return worstOf(failures);\n\n    /*\n      --strict turns any warning into a non-zero exit, for pipelines that would rather stop\n      than proceed on a recording the tool had something to say about.\n\n      The output is still written. A warning describes the recording, not a failure to\n      convert it — a truncated file converts correctly for the records that are there — so\n      destroying that work would be the wrong response. The exit code is the signal; what\n      to do about it is the caller's decision, and they still have the files to inspect.\n    */\n    if (strict && warnings > 0) {\n      process.stderr.write(\n        `\\n--strict: ${warnings} warning${warnings === 1 ? '' : 's'} raised, so this run is ` +\n          `reported as a failure. The output was still written.\\n`,\n      );\n      return EXIT_ERROR;\n    }\n    return EXIT_OK;\n  } catch (error) {\n    return reportError(error);\n  }\n}\n\n/** Print one recording's `--info`, and return how many diagnostics it raised. */\nasync function showInfo(\n  input: string,\n  shared: Record<string, unknown>,\n  asJson: boolean,\n  jsonIndent: number | null,\n): Promise<number> {\n  const file = await EdfFile.open(input);\n  try {\n    /*\n      Read the annotation channel only when the timing actually depends on it.\n\n      --info is documented as a header-only summary that returns immediately whatever\n      the file's size, but it called readAnnotations() on every EDF+/BDF+ file — a seek\n      into every data record. deriveRecordStarts discards that data unless the file is\n      EDF+D, where record start times are stored rather than arithmetic, so on a\n      continuous recording the whole scan was thrown away. It cost 0.29 s on a 12 MB\n      file and scaled with record count.\n\n      A discontinuous file still needs the scan: without it the reported span and row\n      estimate are wrong, which is a bug that has already been fixed once here.\n    */\n    const hasAnnotations = file.annotationSignals.length > 0;\n    const needsEveryRecordStart = file.header.continuity === 'EDF+D' && hasAnnotations;\n    /*\n      A continuous recording needs its origin too, which is one read rather than one per\n      record: 0.4.9 made its first record's timekeeping TAL the point the samples are timed\n      from, and this report went on placing a requested window against zero. `--info --start 1`\n      predicted 8 rows where the conversion wrote 10, on a file whose discontinuous twin —\n      identical but for the reserved field — agreed with itself.\n    */\n    const annotationData = needsEveryRecordStart\n      ? await file.readAnnotations()\n      : {\n          annotations: [],\n          recordStarts:\n            file.header.continuity === 'EDF+C' && hasAnnotations\n              ? [await file.readOrigin()]\n              : [],\n          malformed: 0,\n        };\n    const timing = deriveRecordStarts(file, annotationData);\n    const plan = buildPlan(\n      {\n        signals: file.header.signals,\n        recordDuration: file.header.recordDuration,\n        recordCount: file.recordCount,\n        hasAnnotationChannel: file.annotationSignals.length > 0,\n        recordStarts: timing.starts,\n      },\n      shared,\n    );\n    plan.diagnostics.push(...timing.diagnostics);\n    process.stdout.write(\n      asJson ? `${infoJson(file, plan, jsonIndent)}\\n` : `${formatInfo(file, plan)}\\n`,\n    );\n\n    // Under --json the warnings travel inside the document, exactly as they do for a\n    // conversion, so stderr stays empty and the whole result is one parseable thing.\n    const diagnostics = [...withoutFileRateWarning(file.diagnostics), ...plan.diagnostics];\n    if (!asJson && diagnostics.length > 0) {\n      process.stderr.write(`\\n${formatDiagnostics(diagnostics)}\\n`);\n    }\n    return diagnostics.length;\n  } finally {\n    await file.close();\n  }\n}\n\n/** Convert one recording, and return how many diagnostics it raised. */\nasync function convertOne(\n  input: string,\n  destination: string,\n  options: Record<string, unknown> & {\n    quiet: boolean;\n    asJson: boolean;\n    showProgress: boolean;\n    toStdout: boolean;\n    jsonIndent: number | null;\n  },\n  emit: Emit = writeThrough,\n): Promise<number> {\n  const { quiet, asJson, showProgress, toStdout } = options;\n  let lastTick = 0;\n\n  /*\n    Interrupting a conversion leaves a CSV that stops mid-recording but is still\n    perfectly well-formed, so nothing about the file itself reveals that half the\n    data is missing. Saying so on the way out is the whole point of a tool that\n    claims it will not go quiet when something is wrong.\n  */\n  const onInterrupt = (signal: NodeJS.Signals): void => {\n    if (showProgress) process.stderr.write('\\r\\u001b[K');\n    // --stdout writes no directory, so there is none to warn about. Naming one anyway\n    // pointed at a path that was never created — the same \"files that were never written\"\n    // that 0.2.30 removed from this path's error message.\n    process.stderr.write(\n      `\\ninterrupted (${signal}): the conversion stopped part way through.\\n` +\n        (toStdout\n          ? `       The CSV on stdout stops mid-recording and should not be used.\\n`\n          : `       Files already written to \"${destination}\" are incomplete and should not be used.\\n`),\n    );\n    // 128 + signal number, the conventional exit status for dying to a signal.\n    process.exit(signal === 'SIGINT' ? 130 : 143);\n  };\n  process.once('SIGINT', onInterrupt);\n  process.once('SIGTERM', onInterrupt);\n\n  try {\n    const result = await convert(input, {\n      ...options,\n      onProgress: showProgress\n        ? (progress): void => {\n            const now = Date.now();\n            if (now - lastTick < 100) return;\n            lastTick = now;\n            const percent =\n              progress.recordsTotal === 0\n                ? 100\n                : Math.floor((progress.recordsDone / progress.recordsTotal) * 100);\n            process.stderr.write(`\\r  converting… ${percent}%`);\n          }\n        : undefined,\n    });\n\n    if (showProgress) process.stderr.write('\\r\\u001b[K');\n\n    if (result.diagnostics.length > 0 && !asJson) {\n      emit('err', `${formatDiagnostics(result.diagnostics)}\\n\\n`);\n    }\n    if (asJson) {\n      // One object per line, so a batch is JSON Lines — `jq` reads a record at a time\n      // rather than waiting for the whole run to finish.\n      emit('out', `${summaryJson(result, options.jsonIndent as number | null)}\\n`);\n    } else if (!quiet) {\n      // With --stdout there is no directory to summarise, and the row count is the only\n      // thing worth saying — on stderr, so the CSV on stdout stays clean.\n      if (toStdout) {\n        const rows = result.files[0]?.rows ?? 0;\n        /*\n          A reader that closed the pipe did not receive a conversion, so it does not get a\n          conversion's summary. `edf2csv rec.edf --stdout | head -1` announced \"Wrote 52,507\n          rows to stdout\" — a number that is neither the recording's 102,400 nor the one row\n          head took, but however many had been formatted before the close was noticed.\n\n          Whether the *conversion* stopped early is a separate question from whether the\n          reader did, and 0.5.12 answered the first with the second. A 10,000-row recording\n          whose CSV outruns the pipe buffer but fits one flush is written in full and only\n          then meets the closed pipe: every row formatted, every row handed over, and the\n          summary said \"The recording was not converted in full.\" The estimate's row count is\n          exact, so the two cases can be told apart and told apart honestly — what reached\n          the reader is not knowable from this side either way.\n        */\n        const expected = result.plan.estimate.rows;\n        emit(\n          'err',\n          !result.readerHungUp\n            ? `Wrote ${rows.toLocaleString('en-US')} rows to stdout.\\n`\n            : rows < expected\n              ? `Stopped: the reader closed the pipe after ${rows.toLocaleString('en-US')} of ` +\n                `${expected.toLocaleString('en-US')} rows had been written. The recording was ` +\n                `not converted in full.\\n`\n              : `Wrote ${rows.toLocaleString('en-US')} rows to stdout, but the reader closed ` +\n                `the pipe before the end, so not all of them reached it.\\n`,\n        );\n      } else {\n        emit('err', `${formatSummary(result)}\\n`);\n      }\n    }\n    return result.diagnostics.length;\n  } finally {\n    process.off('SIGINT', onInterrupt);\n    process.off('SIGTERM', onInterrupt);\n  }\n}\n\n/** A recording to convert, and the path its output should be named after. */\ninterface Input {\n  /** Where the recording is. */\n  path: string;\n  /**\n   * What to call its output, relative to `--out`.\n   *\n   * For a file named on the command line this is just its own name. For one found by\n   * expanding a directory it keeps the position it had inside that directory, so a study\n   * laid out as one folder per night comes out the same shape — and, more to the point, so\n   * that fifty recordings all named `rec.edf` do not all claim `<out>/rec`.\n   */\n  name: string;\n  /**\n   * Whether this recording was found by expanding a directory rather than named directly.\n   *\n   * `--out` means two different things — the output directory itself, or a parent to put one\n   * directory per recording inside — and this is what decides which. See `destinationsFor`.\n   */\n  fromDirectory: boolean;\n}\n\n/**\n * Recordings to convert, with directories expanded to what is inside them.\n *\n * A directory yields every `.edf` and `.bdf` beneath it, at any depth. Recordings arrive\n * organised into folders, and a shell has no tidy way to reach them — which is why the\n * recipes here carried a `find` incantation to do it. Passing the folder is the obvious\n * thing to try, and it used to fail with \"is a directory, not an EDF file\".\n */\nasync function expandInputs(\n  positionals: readonly string[],\n): Promise<{ inputs: Input[]; unreadable: string[]; namedDirectory: boolean }> {\n  const found: Input[] = [];\n  const unreadable: string[] = [];\n  /*\n    Whether a directory was NAMED, which is not the same as whether one yielded anything.\n\n    `fromDirectory` on the inputs answers the second question, and using it for the first put\n    the 0.4.20 defect back one step along: `edf2csv study named.edf --out csv` wrote\n    csv/named/ while the study held recordings and csv/signals.csv once it held none, because\n    the surviving input then looked like a lone file. Whether some unrelated folder happens\n    to contain anything decided where a different recording's output went.\n  */\n  let namedDirectory = false;\n  for (const given of positionals) {\n    const info = await stat(given).catch(() => null);\n    if (info === null || !info.isDirectory()) {\n      // Anything that is not a directory is passed through untouched, so a file that does\n      // not exist still reports itself rather than vanishing from the list.\n      found.push({ path: given, name: path.basename(given), fromDirectory: false });\n      continue;\n    }\n    namedDirectory = true;\n    const walked = await walk(given);\n    unreadable.push(...walked.unreadable);\n    for (const file of walked.files) {\n      found.push({ path: file, name: path.relative(given, file), fromDirectory: true });\n    }\n  }\n  /*\n    One recording, however many ways it was named.\n\n    The walk already does this for links inside a folder, and the two halves disagreed:\n    `edf2csv study` converted a recording reached twice once, while `edf2csv a.edf a.edf`\n    refused the whole run for the collision it would cause. A shell makes the second easy\n    to produce by accident — `edf2csv *.edf recording.edf` — and there is nothing ambiguous\n    about it: it is one recording, and converting it once is what was meant.\n\n    A path that does not resolve keeps its own identity so that a file which is not there\n    still reports itself rather than being folded into another entry.\n\n    Which of the names survives is decided by the names themselves, not by the order they\n    turned up in. Keeping the first arrival meant the output directory was named by argument\n    order — `edf2csv data/one.edf data/alias.edf` wrote out/one and the same two swapped\n    wrote out/alias — and a shell orders a glob however it likes. Inside a folder it was the\n    order `readdir` returned, which differs between filesystems, so copying a study to\n    another machine could rename its output. A recording that is not a link is preferred over\n    a link to it, since that is the name the recording actually has; two of a kind are\n    settled by the path that sorts first.\n  */\n  const identified: { entry: Input; identity: string; link: boolean }[] = [];\n  for (const entry of found) {\n    const identity = await realpath(entry.path).catch(() => `?${path.resolve(entry.path)}`);\n    const own = await lstat(entry.path).catch(() => null);\n    identified.push({ entry, identity, link: own?.isSymbolicLink() ?? false });\n  }\n\n  const byIdentity = new Map<string, Input>();\n  const winners = new Map<string, (typeof identified)[number]>();\n  for (const candidate of identified) {\n    const held = winners.get(candidate.identity);\n    if (held !== undefined && !outnames(candidate, held)) continue;\n    winners.set(candidate.identity, candidate);\n    byIdentity.set(candidate.identity, candidate.entry);\n  }\n\n  // A directory hands its entries back in whatever order the filesystem stored them.\n  const unique = [...byIdentity.values()];\n  unique.sort((a, b) => (a.path < b.path ? -1 : a.path > b.path ? 1 : 0));\n\n  return { inputs: unique, unreadable, namedDirectory };\n}\n\n/**\n * Which of two names for one recording the output should be called after.\n *\n * A name the recording actually has beats a link pointing at it, and two of a kind are\n * settled by sort order. Both are properties of the names, so the answer does not move when\n * a shell expands a glob differently or a filesystem enumerates a folder in another order.\n */\nfunction outnames(\n  candidate: { entry: Input; link: boolean },\n  held: { entry: Input; link: boolean },\n): boolean {\n  if (candidate.link !== held.link) return !candidate.link;\n  if (candidate.entry.path !== held.entry.path) return candidate.entry.path < held.entry.path;\n  /*\n    One recording, one path, two names — reached directly and through a named folder.\n\n    `edf2csv study study/night-01/rec.edf` and the same two swapped are the same request, and\n    they disagreed: the folder gives the recording its position inside the folder\n    (`night-01/rec`), a direct mention gives it its bare name (`rec`), and whichever spelling\n    the loop met first won. So argument order decided the output directory's name, and, once\n    a second `study/rec.edf` was in play, decided whether the run happened at all — the bare\n    name collides with it and the run is refused, exit 2, while the other order converts both.\n\n    The nested name wins. It is what the folder promised — \"the layout is kept: recordings in\n    sub-folders come out in sub-folders\" — and it is the one that does not collide, since\n    collapsing a recording to its bare name is what puts it on top of a sibling.\n  */\n  const depth = (entry: Input): number => entry.name.split(path.sep).length;\n  if (depth(candidate.entry) !== depth(held.entry)) return depth(candidate.entry) > depth(held.entry);\n  return candidate.entry.name < held.entry.name;\n}\n\n/**\n * Every recording under a directory, following symbolic links.\n *\n * Written by hand rather than with a recursive `readdir` because that reports a symlink as\n * a symlink and never as a file, so a linked recording was skipped without a word — and the\n * closing \"converted 3 of 3\" then described the three it had noticed rather than what was in\n * the folder. Data organised by linking recordings into a working directory is ordinary, and\n * quietly converting fewer files than were asked for is the failure this tool exists to\n * avoid. Naming the same link on the command line always worked, which made the omission\n * harder to notice rather than easier.\n *\n * Following links means they can form a cycle, so directories are recorded by their resolved\n * identity and visited once. A link to a file already reached another way is likewise\n * converted once.\n */\nasync function walk(root: string): Promise<{ files: string[]; unreadable: string[] }> {\n  const files: string[] = [];\n  const unreadable: string[] = [];\n  const seen = new Set<string>();\n  /*\n    A queue, taken from the front, and each directory's children entered in a settled order.\n\n    This was a stack popped from the back, so which of two names for one directory was\n    visited first came down to the order `readdir` happened to return them — and the loser\n    was then skipped as already seen, taking its name out of the run with it. A folder\n    holding `aaa-real/` beside `zzz-alias -> aaa-real` converted into `<out>/zzz-alias/`: the\n    link's name, chosen by a hash order that differs between filesystems. 0.4.29 settled this\n    for two names of one *file* and left the directory above it deciding by accident.\n\n    Breadth first, and each directory's sub-directories entered with real names before links\n    and alphabetically within each, so the name that survives is a property of the tree: the\n    shallowest, then the one that is not a link, then the first in sort order.\n  */\n  const queue = [root];\n  let next = 0;\n\n  while (next < queue.length) {\n    const directory = queue[next++] as string;\n    const real = await realpath(directory).catch(() => directory);\n    if (seen.has(real)) continue;\n    seen.add(real);\n\n    /*\n      A directory that cannot be listed is reported, not stepped over.\n\n      Skipping it in silence meant a folder holding three recordings, one of them inside a\n      sub-directory without read permission, converted two and said \"Converted 2 of 2\n      recordings\" — a total that agreed with itself and with nothing else. That is the same\n      failure 0.4.4 fixed for symbolic links, arriving by a different route: converting fewer\n      recordings than were asked for and reporting success.\n    */\n    let entries;\n    try {\n      entries = await readdir(directory, { withFileTypes: true });\n    } catch {\n      unreadable.push(directory);\n      continue;\n    }\n\n    // A real name before a link to the same thing, then alphabetically. The dirent describes\n    // the entry itself rather than its target, which is exactly the question here.\n    const ordered = [...entries].sort((a, b) => {\n      const link = Number(a.isSymbolicLink()) - Number(b.isSymbolicLink());\n      return link !== 0 ? link : a.name < b.name ? -1 : a.name > b.name ? 1 : 0;\n    });\n\n    for (const entry of ordered) {\n      const full = path.join(directory, entry.name);\n      // stat, not the dirent: a dirent describes the link, and what matters is its target.\n      const info = await stat(full).catch(() => null);\n      if (info === null) {\n        /*\n          Anything that cannot be inspected is reported, whatever it is called.\n\n          This used to report only names ending in `.edf` or `.bdf`, on the reasoning that a\n          broken link to something else is nobody's business. A directory carries no such\n          name. A study kept as one folder per night, with one night linked to an external\n          drive, converted the nights that were mounted and said nothing about the one that\n          was not — and because losing that input left a single recording, `--out` stopped\n          meaning \"a parent to fill\" and started meaning \"the directory to write\", so the\n          survivor landed somewhere else as well. Whether a drive happened to be mounted\n          changed both what was converted and where it went, in silence, exit 0.\n\n          The walk cannot know what was behind a link it cannot follow, which is exactly the\n          reason to say so rather than to guess.\n        */\n        unreadable.push(full);\n        continue;\n      }\n      if (info.isDirectory()) {\n        queue.push(full);\n      } else if (info.isFile() && /\\.(edf|bdf)$/iu.test(entry.name)) {\n        // Duplicates are collapsed once for the whole list in expandInputs; this only has\n        // to find them. The `seen` set here is for directory cycles.\n        files.push(full);\n      }\n    }\n  }\n  return { files, unreadable };\n}\n\n/**\n * Where each recording's output goes.\n *\n * Naming one recording, `--out` is the output directory itself, which is what it has always\n * meant. Naming a folder, or several recordings, it is a parent and each recording gets its\n * own directory inside it, because writing several recordings into one directory would have\n * them overwrite each other's `signals.csv` — the one thing a batch must not do quietly.\n *\n * With no `--out` at all, every recording converts beside itself exactly as it would have\n * done alone, so a glob behaves like the shell loop it replaces.\n *\n * What a folder means is decided by the folder, not by how much is in it. Counting the\n * recordings instead meant `edf2csv study --out csv` wrote `csv/signals.csv` while the study\n * held one night and `csv/night-01/rec/signals.csv` once it held two: adding a recording\n * moved the output of a recording that had not changed. The same count made the destination\n * depend on things no one had touched either — a night on an unmounted drive, a\n * sub-directory that could not be read — so where the data landed turned on the state of the\n * machine rather than on the command.\n */\nfunction destinationsFor(\n  inputs: readonly Input[],\n  out: string | undefined,\n  /** True when a folder was named, or more than one recording was. See `batch` in `main`. */\n  batch: boolean,\n): string[] {\n  if (out === undefined) return inputs.map((input) => defaultOutputDir(input.path));\n  if (!batch) return [out];\n  return inputs.map((input) => path.join(out, stemOf(input.name)));\n}\n\n/** A name without its extension, keeping a leading dot: `.hidden.edf` -> `.hidden`. */\nfunction stemOf(name: string): string {\n  const dot = name.lastIndexOf('.');\n  const slash = Math.max(name.lastIndexOf('/'), name.lastIndexOf('\\\\'));\n  return dot > slash + 1 ? name.slice(0, dot) : name;\n}\n\n/**\n * Refuse a batch in which two recordings would land in the same directory.\n *\n * Two files with the same name in different folders — `night-1/rec.edf` and\n * `night-2/rec.edf`, which is how recordings usually get organised — both resolve to\n * `<out>/rec`. Converting them in turn would leave one recording's data sitting under the\n * other's name with nothing to show it had happened, so the run stops before writing\n * anything at all.\n */\nfunction assertDistinct(inputs: readonly string[], destinations: readonly string[]): void {\n  /*\n    Two names that differ only in case are one directory on a filesystem that does not\n    distinguish them, which is the default on macOS and the rule on Windows.\n\n    `a/REC.edf` and `b/rec.edf` produce `<out>/REC` and `<out>/rec`. Compared exactly those\n    are different, so both went through, and with --force the second conversion wrote into\n    the directory the first had made: one directory holding one recording's `signals.csv`\n    beside the other's `signals_256hz.csv`, under a single `metadata.json` naming only one\n    of them. The run reported \"Converted 2 of 2 recordings\" and exited 0. A directory whose\n    provenance file describes a recording other than the data beside it is the one outcome\n    this tool exists to prevent.\n\n    The comparison follows the platform rather than being applied everywhere, so a\n    case-sensitive filesystem — where those really are two directories — keeps converting\n    both. A case-sensitive volume on macOS is the exception it gets wrong, and it gets it\n    wrong in the safe direction: a refusal that names both recordings, not a silent merge.\n  */\n  const foldsCase = process.platform === 'darwin' || process.platform === 'win32';\n  /*\n    macOS filesystems fold Unicode normalisation as well as case.\n\n    HFS+ and APFS compare names in a normalised form, so `café` written as e + U+0301 and\n    `café` written as U+00E9 are one directory — while remaining two different JavaScript\n    strings, which is all this guard was comparing. Two recordings whose stems differ only\n    that way therefore both passed the check and both converted into the same place:\n\n      study/café.edf   (NFC)   ->  csv/café/signals.csv\n      study/café.bdf   (NFD)   ->  csv/café/signals_256hz.csv, _128hz, _1hz\n\n    one directory holding both, under a single metadata.json naming one of them, reported as\n    \"Converted 2 of 2 recordings\" and exit 0 under --force. Without --force the second run\n    happened to hit \"already exists\", which is the accidental save rather than the check\n    doing its job — and it named the wrong problem.\n\n    Not folded on Linux, where the two names are genuinely two directories and refusing them\n    would be inventing a collision that does not exist. Windows preserves normalisation too,\n    so only darwin. This is the same platform-shaped assumption the case fold above already\n    makes, and it has the same limit: a network or removable volume that normalises while the\n    running platform does not is not covered by either.\n  */\n  const identity = (destination: string): string => {\n    const resolved = path.resolve(destination);\n    if (!foldsCase) return resolved;\n    const folded = resolved.toLowerCase();\n    return process.platform === 'darwin' ? folded.normalize('NFC') : folded;\n  };\n\n  const claimed = new Map<string, string>();\n  for (const [index, destination] of destinations.entries()) {\n    const key = identity(destination);\n    const first = claimed.get(key);\n    if (first !== undefined) {\n      throw new OptionError(\n        `\"${inputs[index]}\" and \"${first}\" would both be converted into \"${destination}\", ` +\n          `so one would overwrite the other.\\n` +\n          `Convert them separately, or rename one of them.`,\n      );\n    }\n    claimed.set(key, inputs[index] as string);\n  }\n\n  /*\n    And refuse one destination sitting inside another.\n\n    A recording named `rec.edf` beside a folder named `rec` is enough: their outputs are\n    `<out>/rec` and `<out>/rec/inner`, which are not equal, so the check above let both\n    through. What happened next depended on which conversion got there first. Each creates\n    its own directory with a single non-recursive mkdir but its parents recursively, so\n    whichever started second either claimed a directory the other had already made as a\n    parent — failing with \"already exists\" — or did not. Five runs in twenty failed that way\n    under --jobs 2, converting one recording of two; the same command succeeded the other\n    fifteen times.\n\n    Sorting first puts an ancestor next to its descendant: anything sorting between them\n    shares the same prefix, and would be caught as its own adjacent pair.\n  */\n  /*\n    Each destination is checked against its own ancestors, by name.\n\n    The first version of this sorted the resolved paths and compared neighbours, on the\n    reasoning that an ancestor and its descendant end up adjacent. They do not: the\n    separator is not the lowest character, so any sibling whose name begins with one of the\n    thirteen printable characters below '/' lands between them. With `rec.edf`, `rec!x.edf`\n    and `rec/inner.edf` in one folder, '!' sorts between `out/rec` and `out/rec/inner` and\n    the pair was never compared — three recordings converted, one of them inside another's\n    directory, reported as \"Converted 3 of 3\".\n\n    Walking up from each destination has no such gap. Output trees are shallow, so this is a\n    handful of string lookups per recording.\n  */\n  const byDestination = new Map<string, number>();\n  for (const [index, destination] of destinations.entries()) {\n    byDestination.set(identity(destination), index);\n  }\n\n  for (const [index, destination] of destinations.entries()) {\n    let ancestor = path.dirname(path.resolve(destination));\n    for (let parent = ''; ancestor !== parent; ancestor = path.dirname(ancestor)) {\n      parent = ancestor;\n      const owner = byDestination.get(identity(ancestor));\n      if (owner === undefined || owner === index) continue;\n      throw new OptionError(\n        `\"${inputs[index]}\" would be converted into \"${destination}\", which is inside ` +\n          `\"${destinations[owner]}\" — where \"${inputs[owner]}\" is converted.\\n` +\n          `One recording's output cannot sit inside another's. Convert them separately, or ` +\n          `rename one of them.`,\n      );\n    }\n  }\n}\n\n/**\n * The exit code for a run in which several files failed for different reasons.\n *\n * 2 means \"you invoked it wrong\" and 1 means \"something went wrong with a file\". When both\n * happened, 1 is the honest answer: the invocation cannot be the whole story once a file has\n * genuinely failed. With a single input there is only ever one code, so its exit status is\n * exactly what it always was.\n */\nfunction worstOf(codes: readonly number[]): number {\n  return codes.includes(EXIT_ERROR) ? EXIT_ERROR : EXIT_USAGE;\n}\n\n/**\n * Convert one recording in a separate process, and collect everything it printed.\n *\n * The arguments are rebuilt from the parsed options rather than sliced out of argv, so the\n * child receives exactly the flags this run was given and nothing that only makes sense to\n * the parent: not the other recordings, not --jobs, and not --info or --stdout, neither of\n * which reaches this path.\n */\nasync function convertInChild(\n  input: string,\n  destination: string,\n  values: Record<string, unknown>,\n  running: Map<ChildProcess, string>,\n): Promise<{\n  code: number;\n  out: string;\n  err: string;\n  report: { converted: number; warnings: number } | null;\n}> {\n  /*\n    The recording goes last, behind `--`.\n\n    As the first argument it was parsed as an option whenever its path began with a dash,\n    which `path.join` produces from a folder given as `.` — `./-lead.edf` normalises to\n    `-lead.edf`. The child then failed on a file the parent had converted happily, so the\n    same command converted two recordings serially and one under --jobs.\n  */\n  /*\n    Option values go in the `--flag=value` form, never as two arguments.\n\n    Split across two arguments, a value beginning with a dash is another option as far as the\n    child's parser is concerned: `--out ./-nightly` reached it as `--out` followed by\n    `-nightly`, and the child died on \"Option '--out' argument is ambiguous\" while the serial\n    path converted the same command without complaint. A leading dash is not exotic —\n    `path.join` produces one from a folder given as `.`, and directories get named after\n    dates and flags often enough. Same failure 0.4.19 fixed for the recording's own path, on\n    everything that carries a value rather than on the positional.\n  */\n  const args = [`--out=${destination}`];\n  /*\n    --strict is deliberately absent: it is a verdict on the whole run, and a child converting\n    one recording is not the whole run. Passing it down made each child announce \"--strict: 1\n    warning raised, so this run is reported as a failure\" about its own single file, and exit\n    1 for it, which the parent then counted as a conversion that had not happened. The parent\n    applies it once, from the counts the children report.\n  */\n  for (const flag of ['annotations-only', 'checksum', 'gzip', 'bom', 'force', 'quiet', 'json']) {\n    if (values[flag] === true) args.push(`--${flag}`);\n  }\n  for (const flag of ['start', 'duration', 'end', 'decimals', 'layout']) {\n    if (typeof values[flag] === 'string') args.push(`--${flag}=${values[flag] as string}`);\n  }\n  // --channels is repeatable, and each term is passed as given so that a label containing a\n  // comma survives: joining them back into one list would split it in the child.\n  const channels = values['channels'];\n  if (channels !== undefined) {\n    for (const term of Array.isArray(channels) ? (channels as string[]) : [String(channels)]) {\n      args.push(`--channels=${term}`);\n    }\n  }\n  args.push('--', input);\n\n  return new Promise((resolve) => {\n    const child = fork(fileURLToPath(import.meta.url), args, {\n      stdio: ['ignore', 'pipe', 'pipe', 'ipc'],\n    });\n    running.set(child, destination);\n    let out = '';\n    let err = '';\n    let report: { converted: number; warnings: number } | null = null;\n    child.on('message', (message: unknown) => {\n      const payload = (message as { edf2csv?: { converted: number; warnings: number } })?.edf2csv;\n      if (payload) report = payload;\n    });\n    child.stdout?.setEncoding('utf8').on('data', (chunk: string) => {\n      out += chunk;\n    });\n    child.stderr?.setEncoding('utf8').on('data', (chunk: string) => {\n      err += chunk;\n    });\n    child.on('error', (error) => {\n      running.delete(child);\n      resolve({ code: EXIT_ERROR, out, err: `${err}error: ${input}: ${error.message}\\n`, report });\n    });\n    child.on('close', (code, signal) => {\n      running.delete(child);\n      /*\n        A child that was killed says nothing on its way out, so the parent has to.\n\n        `code` is null when a process dies by signal, which left the parent with `code ??\n        EXIT_ERROR` — a failure with an empty `err`, so the run printed nothing but \"Converted\n        1 of 2 recordings; 1 failed.\" and stopped. Nothing said which recording, nothing said\n        why, and nothing said that its directory held a 194 MB signals.csv cut off mid-row\n        with no channels.csv beside it. That file looks exactly like a finished one to\n        anything that opens it.\n\n        The out-of-memory killer, a job scheduler's time limit and `kill` all arrive this way.\n        A run stopped from the keyboard is reported by the interrupt handler instead, which\n        names every directory at once rather than one line per child.\n      */\n      if (signal !== null && !stopping) {\n        err +=\n          `error: stopped by ${signal} before it finished.\\n` +\n          `       Incomplete, and should not be used: ${destination}\\n`;\n      }\n      resolve({ code: code ?? EXIT_ERROR, out, err, report });\n    });\n  });\n}\n\n/** Put the recording's name into the error lines a child produced. */\nfunction named(text: string, input: string): string {\n  // A function, not a string: `$&`, `$\\'`, `` $` `` and `$1` in a replacement string are\n  // patterns, and a file may legitimately be called any of them. `bad$&name.edf` re-injected\n  // the text it had just matched and reported itself as `baderror: name.edf`.\n  return text.replace(/^error: /gmu, () => `error: ${printable(input)}: `);\n}\n\n/** Re-render a child's pretty-printed summary onto one line, leaving anything else alone. */\nfunction compactJson(text: string): string {\n  const trimmed = text.trim();\n  if (trimmed === '') return '';\n  try {\n    return `${JSON.stringify(JSON.parse(trimmed))}\\n`;\n  } catch {\n    // Not the document expected; passing it through unchanged beats losing it.\n    return text;\n  }\n}\n\n/**\n * Where a conversion's output goes.\n *\n * Serial runs write straight through, which is what they have always done. Running several\n * conversions at once needs the alternative: each one's lines are collected and released in\n * a block when it finishes, so two recordings finishing together cannot interleave a summary\n * with a warning belonging to the other file.\n */\ntype Emit = (stream: 'out' | 'err', text: string) => void;\n\nconst writeThrough: Emit = (stream, text) => {\n  (stream === 'out' ? process.stdout : process.stderr).write(text);\n};\n\n/** Collects output so it can be released in one piece when a conversion finishes. */\nfunction buffered(): { emit: Emit; flush: () => void } {\n  const parts: [('out' | 'err'), string][] = [];\n  return {\n    emit: (stream, text) => parts.push([stream, text]),\n    flush: () => {\n      for (const [stream, text] of parts) writeThrough(stream, text);\n    },\n  };\n}\n\n/**\n * Report an error the way this command always has, and give the exit code it implies.\n *\n * `input` names the recording while a batch is running: several failures otherwise arrive\n * as a stack of messages with nothing saying which file each belongs to.\n */\nfunction reportError(error: unknown, input?: string, emit: Emit = writeThrough): number {\n  const where = input === undefined ? '' : `${printable(input)}: `;\n  if (error instanceof EdfError || error instanceof ConversionError) {\n    emit('err', `error: ${where}${printableLines(error.message, '       ')}\\n`);\n    if (error.hint) emit('err', `       ${error.hint}\\n`);\n    // A request the tool cannot carry out is the command line's problem, not the file's,\n    // whatever layer noticed it. See USAGE_ERROR_CODES.\n    return error instanceof ConversionError && USAGE_ERROR_CODES.has(error.code)\n      ? EXIT_USAGE\n      : EXIT_ERROR;\n  }\n  if (\n    error instanceof ChannelSelectionError ||\n    error instanceof TimeRangeError ||\n    error instanceof OptionError\n  ) {\n    emit('err', `error: ${where}${printableLines(error.message, '       ')}\\n`);\n    return EXIT_USAGE;\n  }\n  emit('err', `error: ${where}${message(error, '       ')}\\n`);\n  return EXIT_ERROR;\n}\n\n/**\n * How many conversions to run at once.\n *\n * `auto` is one per core, less one, so a long batch does not take the machine over. A batch\n * is the only place this means anything: a single recording is a single conversion however\n * many jobs are asked for.\n */\nfunction parseJobs(raw: unknown, inputs: number): number {\n  if (raw === undefined) return 1;\n  const text = String(raw).trim();\n  if (text === 'auto') return Math.max(1, Math.min(inputs, cpus().length - 1));\n  const value = Number(text);\n  if (!Number.isInteger(value) || value < 1) {\n    throw new OptionError(`--jobs must be a whole number of 1 or more, or \"auto\", got \"${text}\".`);\n  }\n  return Math.min(value, Math.max(1, inputs));\n}\n\nfunction splitChannels(raw: unknown): string[] | undefined {\n  if (raw === undefined) return undefined;\n  const list = Array.isArray(raw) ? (raw as string[]) : [String(raw)];\n  const terms = list.flatMap((entry) => entry.split(',')).map((t) => t.trim()).filter((t) => t !== '');\n  // Returning undefined here would mean \"no --channels given\" and convert everything,\n  // which is the opposite of what someone passing an empty list is asking for.\n  if (terms.length === 0) {\n    throw new OptionError('--channels was given but lists no channel names.');\n  }\n  return terms;\n}\n\nfunction optionalTime(raw: unknown, option: string): number | undefined {\n  if (raw === undefined) return undefined;\n  return parseTimeSpec(String(raw), option);\n}\n\n/** `--layout`, which is one of two words and not a guess at what was meant. */\nfunction optionalLayout(raw: unknown): 'wide' | 'long' | undefined {\n  if (raw === undefined) return undefined;\n  if (raw === 'wide' || raw === 'long') return raw;\n  throw new OptionError(`--layout must be \"wide\" or \"long\", got \"${String(raw)}\".`);\n}\n\nfunction optionalDecimals(raw: unknown): number | undefined {\n  if (raw === undefined) return undefined;\n  const text = String(raw).trim();\n  // Number('') is 0, which would quietly round every physical value to a whole number.\n  if (text === '') {\n    throw new OptionError('--decimals needs a number, for example --decimals 3.');\n  }\n  const value = Number(text);\n  if (!Number.isInteger(value) || value < 0 || value > 20) {\n    throw new OptionError(`--decimals must be a whole number between 0 and 20, got \"${String(raw)}\".`);\n  }\n  return value;\n}\n\n/*\n  Error text is escaped for the same reason --info's table is: a fatal header error quotes\n  the channel label that caused it, and that label is free text out of the file. A recording\n  declaring a negative sample count under a label containing `\\x1b[2J` cleared the reader's\n  screen on the way out.\n*/\nfunction message(error: unknown, indent = ''): string {\n  // The indent lines continuation up under an \"error: \" prefix. Usage problems print without\n  // one, alongside the usage text, so they pass nothing and stay flush left.\n  return printableLines(error instanceof Error ? error.message : String(error), indent);\n}\n\nexport { defaultOutputDir };\n\n/**\n * Whether this file was executed rather than imported.\n *\n * npm installs a bin as a symlink (node_modules/.bin/edf2csv -> ../edf2csv/dist/cli.js),\n * and that is the path `npx` runs. In that case process.argv[1] is the symlink while\n * import.meta.url is already resolved to the real file, so comparing the two directly\n * reports \"imported\" and the command silently does nothing. Both sides are resolved\n * through realpath before comparing.\n */\nfunction isMainModule(): boolean {\n  const entry = process.argv[1];\n  if (entry === undefined) return false;\n  try {\n    return realpathSync(entry) === realpathSync(fileURLToPath(import.meta.url));\n  } catch {\n    // An unreadable or deleted entry path is not a reason to refuse to run.\n    return pathToFileURL(entry).href === import.meta.url;\n  }\n}\n\nconst invokedDirectly = isMainModule();\n\nif (invokedDirectly) {\n  main(process.argv.slice(2))\n    .then((code) => {\n      process.exitCode = code;\n    })\n    .catch((error: unknown) => {\n      process.stderr.write(`error: ${message(error)}\\n`);\n      process.exitCode = EXIT_ERROR;\n    });\n}\n"]}
+{"version":3,"file":"cli.js","sourceRoot":"","sources":["../src/cli.ts"],"names":[],"mappings":";AACA;;;;;;;GAOG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AACtC,OAAO,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AACxD,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACvC,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AAClE,OAAO,EAAE,IAAI,EAAE,MAAM,SAAS,CAAC;AAC/B,OAAO,EAAE,IAAI,EAAE,MAAM,oBAAoB,CAAC;AAE1C,OAAO,IAAI,MAAM,WAAW,CAAC;AAC7B,OAAO,OAAO,MAAM,cAAc,CAAC;AAEnC,OAAO,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAC3C,OAAO,EAAE,OAAO,EAAE,MAAM,iBAAiB,CAAC;AAC1C,OAAO,EAAE,SAAS,EAAE,sBAAsB,EAAE,MAAM,mBAAmB,CAAC;AACtE,OAAO,EAAE,eAAe,EAAE,iBAAiB,EAAE,OAAO,EAAE,gBAAgB,EAAE,MAAM,kBAAkB,CAAC;AACjG,OAAO,EAAE,qBAAqB,EAAE,MAAM,uBAAuB,CAAC;AAC9D,sFAAsF;AACtF,OAAO,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AACnD,OAAO,EAAE,cAAc,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACxE,OAAO,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AACzD,OAAO,EAAE,iBAAiB,EAAE,UAAU,EAAE,QAAQ,EAAE,aAAa,EAAE,SAAS,EAAE,cAAc,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AACjI,OAAO,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AAC1C,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAEvC,MAAM,KAAK,GAAG,WAAW,OAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CA+D/B,CAAC;AAEF,MAAM,OAAO,GAAG,CAAC,CAAC;AAClB,MAAM,UAAU,GAAG,CAAC,CAAC;AACrB,MAAM,UAAU,GAAG,CAAC,CAAC;AAErB;;;;;;GAMG;AACH,IAAI,QAAQ,GAAG,KAAK,CAAC;AAErB;;;;GAIG;AACH,SAAS,gBAAgB,CAAC,MAA0B;IAClD,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,KAA4B,EAAE,EAAE;QAClD,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YAC3B,mFAAmF;YACnF,oFAAoF;YACpF,gFAAgF;YAChF,gFAAgF;YAChF,gEAAgE;YAChE,OAAO;QACT,CAAC;QAED;;;;;;;;;;;;;;UAcE;QACF,IAAI,MAAM,CAAC,aAAa,CAAC,OAAO,CAAC,GAAG,CAAC;YAAE,OAAO;QAC9C,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,qBAAqB,MAAM,KAAK,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,YAAY,KAAK,CAAC,OAAO,IAAI,CAAC,CAAC;QACxH,OAAO,CAAC,QAAQ,GAAG,UAAU,CAAC;IAChC,CAAC,CAAC,CAAC;AACL,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,IAAI,CAAC,IAAuB;IAChD,gBAAgB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACjC,gBAAgB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAEjC,IAAI,MAA+B,CAAC;IACpC,IAAI,WAAqB,CAAC;IAE1B,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,SAAS,CAAC;YACvB,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC;YACf,gBAAgB,EAAE,IAAI;YACtB,MAAM,EAAE,IAAI;YACZ,OAAO,EAAE;gBACP,IAAI,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,GAAG,EAAE;gBACrC,GAAG,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,EAAE;gBACnC,QAAQ,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,EAAE,QAAQ,EAAE,IAAI,EAAE;gBACxD,KAAK,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;gBACzB,QAAQ,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;gBAC5B,GAAG,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;gBACvB,kBAAkB,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE;gBACvC,QAAQ,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;gBAC5B,QAAQ,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE;gBAC7B,MAAM,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;gBAC1B,IAAI,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE;gBACzB,GAAG,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE;gBACxB,IAAI,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,EAAE;gBACpC,KAAK,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,GAAG,EAAE;gBACtC,KAAK,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,GAAG,EAAE;gBACtC,IAAI,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE;gBACzB,MAAM,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE;gBAC3B,MAAM,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE;gBAC3B,IAAI,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,GAAG,EAAE;gBACrC,OAAO,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,GAAG,EAAE;aACzC;SACF,CAAC,CAAC;QACH,MAAM,GAAG,MAAM,CAAC,MAAiC,CAAC;QAClD,WAAW,GAAG,MAAM,CAAC,WAAW,CAAC;IACnC,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,8CAA8C,CAAC,CAAC;QACtF,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,IAAI,EAAE,CAAC;QAC5B,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC5B,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,IAAI,MAAM,CAAC,SAAS,CAAC,KAAK,IAAI,EAAE,CAAC;QAC/B,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC;QACrC,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC7B,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,2BAA2B,KAAK,EAAE,CAAC,CAAC;QACzD,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,IAAI,QAAiB,CAAC;IACtB,IAAI,UAAoB,CAAC;IACzB,IAAI,cAAuB,CAAC;IAC5B,IAAI,CAAC;QACH,MAAM,KAAK,GAAG,MAAM,YAAY,CAAC,WAAW,CAAC,CAAC;QAC9C,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC;QACxB,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC;QAC9B,cAAc,GAAG,KAAK,CAAC,cAAc,CAAC;IACxC,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO,WAAW,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;IAED,uFAAuF;IACvF,oFAAoF;IACpF,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;QAC/B,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,UAAU,SAAS,CAAC,KAAK,CAAC,kEAAkE,CAC7F,CAAC;IACJ,CAAC;IAED,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B;;;;;;;;;;;UAWE;QACF,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,+BAA+B,UAAU,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,aAAa,GAAG;gBACrF,iCAAiC,UAAU,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,WAAW,GAAG;gBACtF,0BAA0B,CAC7B,CAAC;YACF,OAAO,UAAU,CAAC;QACpB,CAAC;QACD,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,qCAAqC,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,CACnF,CAAC;QACF,OAAO,UAAU,CAAC;IACpB,CAAC;IACD,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACnD;;;;;;;;;MASE;IACF,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,cAAc,CAAC;IAClD,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,IAAI,CAAC;IACvC,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC;IACvC,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,KAAK,IAAI,CAAC;IACzC,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC,KAAK,IAAI,CAAC;IAE3C,wFAAwF;IACxF,mFAAmF;IACnF,gEAAgE;IAChE,IAAI,QAAQ,IAAI,MAAM,EAAE,CAAC;QACvB,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,yEAAyE;YACvE,wDAAwD,CAC3D,CAAC;QACF,OAAO,UAAU,CAAC;IACpB,CAAC;IAED;;;;;;;;MAQE;IACF,IAAI,QAAQ,IAAI,KAAK,EAAE,CAAC;QACtB,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,MAAM,CAAC,MAAM,KAAK,CAAC;YACjB,CAAC,CAAC,kFAAkF;gBAClF,qDAAqD,MAAM,CAAC,CAAC,CAAC,qBAAqB;gBACnF,sBAAsB;YACxB,CAAC,CAAC,mDAAmD,MAAM,CAAC,MAAM,gBAAgB;gBAChF,sEAAsE,CAC3E,CAAC;QACF,OAAO,UAAU,CAAC;IACpB,CAAC;IAED;;;;;;;;;;;;MAYE;IACF,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI;QAC1B,CAAC,OAAO,EAAE,MAAM,CAAC,KAAK,CAAC,KAAK,SAAS,CAAC;QACtC,CAAC,YAAY,EAAE,MAAM,CAAC,UAAU,CAAC,KAAK,IAAI,CAAC;KACnC,EAAE,CAAC;QACX,IAAI,QAAQ,IAAI,KAAK,EAAE,CAAC;YACtB,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,gBAAgB,IAAI,sDAAsD,IAAI,OAAO;gBACnF,4BAA4B,IAAI,kDAAkD,CACrF,CAAC;YACF,OAAO,UAAU,CAAC;QACpB,CAAC;IACH,CAAC;IAED;;;;;;;;;;;MAWE;IACF,MAAM,UAAU,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAEpC,IAAI,CAAC;QACH,MAAM,SAAS,GAAG,OAAO,MAAM,CAAC,KAAK,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAChF,MAAM,YAAY,GAAG,eAAe,CAAC,QAAQ,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;QACjE,cAAc,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;QAErC,MAAM,MAAM,GAAG;YACb,QAAQ,EAAE,aAAa,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;YAC3C,KAAK,EAAE,YAAY,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,SAAS,CAAC;YAC/C,SAAS,EAAE,OAAO,MAAM,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS;YAC5E,QAAQ,EAAE,YAAY,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,YAAY,CAAC;YACxD,GAAG,EAAE,YAAY,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC;YACzC,OAAO,EAAE,OAAO,MAAM,CAAC,KAAK,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS;YACtE,QAAQ,EAAE,gBAAgB,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;YAC9C,eAAe,EAAE,MAAM,CAAC,kBAAkB,CAAC,KAAK,IAAI;YACpD,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,KAAK,IAAI;YAC7B,GAAG,EAAE,MAAM,CAAC,KAAK,CAAC,KAAK,IAAI;YAC3B,MAAM,EAAE,cAAc,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;SACzC,CAAC;QAEF,kFAAkF;QAClF,mFAAmF;QACnF,iFAAiF;QACjF,oFAAoF;QACpF,sFAAsF;QACtF,mEAAmE;QACnE,MAAM,aAAa,GAAG,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QAC/D,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC;QAE1C,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,IAAI,EAAE,CAAC;YAC5B,MAAM,QAAQ,GAAa,EAAE,CAAC;YAC9B,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;gBAC9C,wEAAwE;gBACxE,IAAI,KAAK,IAAI,CAAC,MAAM,IAAI,KAAK,GAAG,CAAC;oBAAE,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAC9D,IAAI,CAAC;oBACH,QAAQ,IAAI,MAAM,QAAQ,CAAC,KAAe,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;gBAC1E,CAAC;gBAAC,OAAO,KAAK,EAAE,CAAC;oBACf,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAE,KAAgB,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;gBAC3E,CAAC;YACH,CAAC;YACD,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC;gBAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACrD,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;gBAAE,OAAO,OAAO,CAAC,QAAQ,CAAC,CAAC;YAClD,OAAO,MAAM,IAAI,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,OAAO,CAAC;QACvD,CAAC;QAED,wFAAwF;QACxF,8EAA8E;QAC9E,MAAM,YAAY,GAChB,CAAC,KAAK,IAAI,CAAC,MAAM,IAAI,CAAC,QAAQ,IAAI,IAAI,KAAK,CAAC,IAAI,OAAO,CAAC,MAAM,CAAC,KAAK,KAAK,IAAI,CAAC;QAEhF,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,8EAA8E;QAC9E,MAAM,MAAM,GAAG,KAAK,EAAE,KAAa,EAAE,IAAU,EAAiB,EAAE;YAChE,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAW,CAAC;YACtC,MAAM,WAAW,GAAG,YAAY,CAAC,KAAK,CAAW,CAAC;YAClD,oFAAoF;YACpF,gFAAgF;YAChF,IAAI,KAAK,IAAI,CAAC,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;gBAC/B,IAAI,CAAC,KAAK,EAAE,IAAI,KAAK,GAAG,CAAC,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACvE,CAAC;YACD,IAAI,CAAC;gBACH,QAAQ,IAAI,MAAM,UAAU,CAC1B,KAAK,EACL,WAAW,EACX;oBACE,GAAG,MAAM;oBACT,gFAAgF;oBAChF,iCAAiC;oBACjC,SAAS,EAAE,SAAS,KAAK,SAAS,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,WAAW;oBACtE,QAAQ,EAAE,MAAM,CAAC,UAAU,CAAC,KAAK,IAAI;oBACrC,KAAK,EAAE,MAAM,CAAC,OAAO,CAAC,KAAK,IAAI;oBAC/B,QAAQ;oBACR,KAAK;oBACL,MAAM;oBACN,YAAY;oBACZ,UAAU;iBACX,EACD,IAAI,CACL,CAAC;gBACF,SAAS,EAAE,CAAC;YACd,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf;;;;;kBAKE;gBACF,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC;YACrE,CAAC;QACH,CAAC,CAAC;QAEF,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACf,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;gBACnD,MAAM,MAAM,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;gBAClC,oFAAoF;gBACpF,IAAI,CAAC,KAAK,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;oBAAE,OAAO,QAAQ,CAAC,CAAC,CAAW,CAAC;YAClE,CAAC;QACH,CAAC;aAAM,CAAC;YACN;;;;;;;;;;;;;;;cAeE;YACF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAwB,CAAC;YAEhD;;;;;;;cAOE;YACF,MAAM,WAAW,GAAG,CAAC,MAAsB,EAAQ,EAAE;gBACnD,QAAQ,GAAG,IAAI,CAAC;gBAChB,MAAM,SAAS,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;gBACxC,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,IAAI,EAAE;oBAAE,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBAC1D,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,kBAAkB,MAAM,MAAM,SAAS,CAAC,MAAM,aAAa;oBACzD,GAAG,SAAS,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,8BAA8B;oBAClE,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC;wBACnB,CAAC,CAAC,8CAA8C,MAAM,CAAC,SAAS,CAAC,IAAI;wBACrE,CAAC,CAAC,EAAE,CAAC,CACV,CAAC;gBACF,OAAO,CAAC,IAAI,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAChD,CAAC,CAAC;YACF,OAAO,CAAC,IAAI,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;YACpC,OAAO,CAAC,IAAI,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;YAErC,IAAI,IAAI,GAAG,CAAC,CAAC;YACb,MAAM,MAAM,GAAG,KAAK,IAAmB,EAAE;gBACvC,KAAK,IAAI,KAAK,GAAG,IAAI,EAAE,EAAE,KAAK,GAAG,MAAM,CAAC,MAAM,EAAE,KAAK,GAAG,IAAI,EAAE,EAAE,CAAC;oBAC/D,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAW,CAAC;oBACtC,MAAM,IAAI,GAAG,QAAQ,EAAE,CAAC;oBACxB,IAAI,CAAC,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;wBACtB,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,KAAK,GAAG,CAAC,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;oBAC5E,CAAC;oBACD,MAAM,KAAK,GAAG,MAAM,cAAc,CAChC,KAAK,EACL,YAAY,CAAC,KAAK,CAAW,EAC7B,MAAM,EACN,OAAO,CACR,CAAC;oBACF,6EAA6E;oBAC7E,+EAA+E;oBAC/E,qCAAqC;oBACrC,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;wBACjB,SAAS,IAAI,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC;wBACpC,QAAQ,IAAI,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC;oBACpC,CAAC;yBAAM,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;wBAC5B,SAAS,EAAE,CAAC;oBACd,CAAC;oBACD,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC;wBAAE,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;oBAChD,4EAA4E;oBAC5E,qDAAqD;oBACrD,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;oBAC9D,gFAAgF;oBAChF,iFAAiF;oBACjF,2EAA2E;oBAC3E,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;oBAC1C,IAAI,CAAC,KAAK,EAAE,CAAC;gBACf,CAAC;YACH,CAAC,CAAC;YACF,IAAI,CAAC;gBACH,MAAM,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAClE,CAAC;oBAAS,CAAC;gBACT,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;gBACnC,OAAO,CAAC,GAAG,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;QAED;;;;;;;;;;;;UAYE;QACF,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC;YAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAErD,IAAI,KAAK,IAAI,CAAC,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;YAC/B,MAAM,MAAM,GACV,UAAU,CAAC,MAAM,GAAG,CAAC;gBACnB,CAAC,CAAC,KAAK,UAAU,CAAC,MAAM,QAAQ,UAAU,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,oBAAoB;gBACtF,CAAC,CAAC,EAAE,CAAC;YACT,MAAM,MAAM,GAAG,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,GAAG,SAAS,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;YACxF,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,eAAe,SAAS,OAAO,MAAM,CAAC,MAAM,cAAc,MAAM,GAAG,MAAM,KAAK,CAC/E,CAAC;QACJ,CAAC;QAED;;;;;;;;;UASE;QACF,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,SAAS,EAAE,QAAQ,EAAE,EAAE,CAAC,CAAC;QAErD,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,OAAO,CAAC,QAAQ,CAAC,CAAC;QAElD;;;;;;;;UAQE;QACF,IAAI,MAAM,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;YAC3B,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,eAAe,QAAQ,WAAW,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,0BAA0B;gBACnF,wDAAwD,CAC3D,CAAC;YACF,OAAO,UAAU,CAAC;QACpB,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO,WAAW,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;AACH,CAAC;AAED,iFAAiF;AACjF,KAAK,UAAU,QAAQ,CACrB,KAAa,EACb,MAA+B,EAC/B,MAAe,EACf,UAAyB;IAEzB,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACvC,IAAI,CAAC;QACH;;;;;;;;;;;;UAYE;QACF,MAAM,cAAc,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,GAAG,CAAC,CAAC;QACzD,MAAM,qBAAqB,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,KAAK,OAAO,IAAI,cAAc,CAAC;QACnF;;;;;;UAME;QACF,MAAM,cAAc,GAAG,qBAAqB;YAC1C,CAAC,CAAC,MAAM,IAAI,CAAC,eAAe,EAAE;YAC9B,CAAC,CAAC;gBACE,WAAW,EAAE,EAAE;gBACf,YAAY,EACV,IAAI,CAAC,MAAM,CAAC,UAAU,KAAK,OAAO,IAAI,cAAc;oBAClD,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC;oBAC3B,CAAC,CAAC,EAAE;gBACR,SAAS,EAAE,CAAC;aACb,CAAC;QACN,MAAM,MAAM,GAAG,kBAAkB,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;QACxD,MAAM,IAAI,GAAG,SAAS,CACpB;YACE,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO;YAC5B,cAAc,EAAE,IAAI,CAAC,MAAM,CAAC,cAAc;YAC1C,WAAW,EAAE,IAAI,CAAC,WAAW;YAC7B,oBAAoB,EAAE,IAAI,CAAC,iBAAiB,CAAC,MAAM,GAAG,CAAC;YACvD,YAAY,EAAE,MAAM,CAAC,MAAM;SAC5B,EACD,MAAM,CACP,CAAC;QACF,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC;QAC7C,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,IAAI,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CACjF,CAAC;QAEF,iFAAiF;QACjF,iFAAiF;QACjF,MAAM,WAAW,GAAG,CAAC,GAAG,sBAAsB,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;QACvF,IAAI,CAAC,MAAM,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,iBAAiB,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QAChE,CAAC;QACD,OAAO,WAAW,CAAC,MAAM,CAAC;IAC5B,CAAC;YAAS,CAAC;QACT,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;IACrB,CAAC;AACH,CAAC;AAED,wEAAwE;AACxE,KAAK,UAAU,UAAU,CACvB,KAAa,EACb,WAAmB,EACnB,OAMC,EACD,OAAa,YAAY;IAEzB,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC;IAC1D,IAAI,QAAQ,GAAG,CAAC,CAAC;IAEjB;;;;;MAKE;IACF,MAAM,WAAW,GAAG,CAAC,MAAsB,EAAQ,EAAE;QACnD,IAAI,YAAY;YAAE,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QACrD,kFAAkF;QAClF,sFAAsF;QACtF,sDAAsD;QACtD,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,kBAAkB,MAAM,+CAA+C;YACrE,CAAC,QAAQ;gBACP,CAAC,CAAC,wEAAwE;gBAC1E,CAAC,CAAC,oCAAoC,WAAW,4CAA4C,CAAC,CACnG,CAAC;QACF,2EAA2E;QAC3E,OAAO,CAAC,IAAI,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAChD,CAAC,CAAC;IACF,OAAO,CAAC,IAAI,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;IACpC,OAAO,CAAC,IAAI,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;IAErC,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,KAAK,EAAE;YAClC,GAAG,OAAO;YACV,UAAU,EAAE,YAAY;gBACtB,CAAC,CAAC,CAAC,QAAQ,EAAQ,EAAE;oBACjB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;oBACvB,IAAI,GAAG,GAAG,QAAQ,GAAG,GAAG;wBAAE,OAAO;oBACjC,QAAQ,GAAG,GAAG,CAAC;oBACf,MAAM,OAAO,GACX,QAAQ,CAAC,YAAY,KAAK,CAAC;wBACzB,CAAC,CAAC,GAAG;wBACL,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,WAAW,GAAG,QAAQ,CAAC,YAAY,CAAC,GAAG,GAAG,CAAC,CAAC;oBACvE,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,mBAAmB,OAAO,GAAG,CAAC,CAAC;gBACtD,CAAC;gBACH,CAAC,CAAC,SAAS;SACd,CAAC,CAAC;QAEH,IAAI,YAAY;YAAE,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QAErD,IAAI,MAAM,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;YAC7C,IAAI,CAAC,KAAK,EAAE,GAAG,iBAAiB,CAAC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAC9D,CAAC;QACD,IAAI,MAAM,EAAE,CAAC;YACX,gFAAgF;YAChF,mDAAmD;YACnD,IAAI,CAAC,KAAK,EAAE,GAAG,WAAW,CAAC,MAAM,EAAE,OAAO,CAAC,UAA2B,CAAC,IAAI,CAAC,CAAC;QAC/E,CAAC;aAAM,IAAI,CAAC,KAAK,EAAE,CAAC;YAClB,kFAAkF;YAClF,oEAAoE;YACpE,IAAI,QAAQ,EAAE,CAAC;gBACb,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC;gBACxC;;;;;;;;;;;;;kBAaE;gBACF,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;gBAC3C,IAAI,CACF,KAAK,EACL,CAAC,MAAM,CAAC,YAAY;oBAClB,CAAC,CAAC,SAAS,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,oBAAoB;oBAC3D,CAAC,CAAC,IAAI,GAAG,QAAQ;wBACf,CAAC,CAAC,6CAA6C,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,MAAM;4BAC/E,GAAG,QAAQ,CAAC,cAAc,CAAC,OAAO,CAAC,4CAA4C;4BAC/E,0BAA0B;wBAC5B,CAAC,CAAC,SAAS,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,yCAAyC;4BAC9E,2DAA2D,CAClE,CAAC;YACJ,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,KAAK,EAAE,GAAG,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC5C,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC;IACnC,CAAC;YAAS,CAAC;QACT,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;QACnC,OAAO,CAAC,GAAG,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;IACtC,CAAC;AACH,CAAC;AAwBD;;;;;;;GAOG;AACH,KAAK,UAAU,YAAY,CACzB,WAA8B;IAE9B,MAAM,KAAK,GAAY,EAAE,CAAC;IAC1B,MAAM,UAAU,GAAa,EAAE,CAAC;IAChC;;;;;;;;MAQE;IACF,IAAI,cAAc,GAAG,KAAK,CAAC;IAC3B,KAAK,MAAM,KAAK,IAAI,WAAW,EAAE,CAAC;QAChC,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;QACjD,IAAI,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;YACzC,oFAAoF;YACpF,sEAAsE;YACtE,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,aAAa,EAAE,KAAK,EAAE,CAAC,CAAC;YAC9E,SAAS;QACX,CAAC;QACD,cAAc,GAAG,IAAI,CAAC;QACtB,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,CAAC;QACjC,UAAU,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;QACtC,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;YAChC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC;QACpF,CAAC;IACH,CAAC;IACD;;;;;;;;;;;;;;;;;;;;MAoBE;IACF,MAAM,UAAU,GAAwD,EAAE,CAAC;IAC3E,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;QAC1B,MAAM,QAAQ,GAAG,MAAM,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACxF,MAAM,GAAG,GAAG,MAAM,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;QACtD,UAAU,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,cAAc,EAAE,IAAI,KAAK,EAAE,CAAC,CAAC;IAC7E,CAAC;IAED,MAAM,UAAU,GAAG,IAAI,GAAG,EAAiB,CAAC;IAC5C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuC,CAAC;IAC/D,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QAC7C,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,IAAI,CAAC;YAAE,SAAS;QAC/D,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QAC3C,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,QAAQ,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC;IACtD,CAAC;IAED,mFAAmF;IACnF,MAAM,MAAM,GAAG,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC;IACxC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAExE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,cAAc,EAAE,CAAC;AACxD,CAAC;AAED;;;;;;GAMG;AACH,SAAS,QAAQ,CACf,SAA0C,EAC1C,IAAqC;IAErC,IAAI,SAAS,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI;QAAE,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC;IACzD,IAAI,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,IAAI;QAAE,OAAO,SAAS,CAAC,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IAC5F;;;;;;;;;;;;;MAaE;IACF,MAAM,KAAK,GAAG,CAAC,KAAY,EAAU,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IAC1E,IAAI,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACpG,OAAO,SAAS,CAAC,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;AAChD,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,KAAK,UAAU,IAAI,CAAC,IAAY;IAC9B,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,UAAU,GAAa,EAAE,CAAC;IAChC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B;;;;;;;;;;;;;MAaE;IACF,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;IACrB,IAAI,IAAI,GAAG,CAAC,CAAC;IAEb,OAAO,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QAC3B,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,EAAE,CAAW,CAAC;QAC1C,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,SAAS,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;QAC9D,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAEf;;;;;;;;UAQE;QACF,IAAI,OAAO,CAAC;QACZ,IAAI,CAAC;YACH,OAAO,GAAG,MAAM,OAAO,CAAC,SAAS,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC;QAC9D,CAAC;QAAC,MAAM,CAAC;YACP,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC3B,SAAS;QACX,CAAC;QAED,yFAAyF;QACzF,+EAA+E;QAC/E,MAAM,OAAO,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACzC,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,cAAc,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,cAAc,EAAE,CAAC,CAAC;YACrE,OAAO,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5E,CAAC,CAAC,CAAC;QAEH,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;YAC9C,qFAAqF;YACrF,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;YAChD,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;gBAClB;;;;;;;;;;;;;;kBAcE;gBACF,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACtB,SAAS;YACX,CAAC;YACD,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;gBACvB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,CAAC;iBAAM,IAAI,IAAI,CAAC,MAAM,EAAE,IAAI,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC9D,kFAAkF;gBAClF,6DAA6D;gBAC7D,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC;AAC/B,CAAC;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,SAAS,eAAe,CACtB,MAAwB,EACxB,GAAuB;AACvB,2FAA2F;AAC3F,KAAc;IAEd,IAAI,GAAG,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,gBAAgB,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;IAClF,IAAI,CAAC,KAAK;QAAE,OAAO,CAAC,GAAG,CAAC,CAAC;IACzB,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACnE,CAAC;AAED,uFAAuF;AACvF,SAAS,MAAM,CAAC,IAAY;IAC1B,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IAClC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC;IACtE,OAAO,GAAG,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AACrD,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,cAAc,CAAC,MAAyB,EAAE,YAA+B;IAChF;;;;;;;;;;;;;;;;MAgBE;IACF,MAAM,SAAS,GAAG,OAAO,CAAC,QAAQ,KAAK,QAAQ,IAAI,OAAO,CAAC,QAAQ,KAAK,OAAO,CAAC;IAChF;;;;;;;;;;;;;;;;;;;;;MAqBE;IACF,MAAM,QAAQ,GAAG,CAAC,WAAmB,EAAU,EAAE;QAC/C,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QAC3C,IAAI,CAAC,SAAS;YAAE,OAAO,QAAQ,CAAC;QAChC,MAAM,MAAM,GAAG,QAAQ,CAAC,WAAW,EAAE,CAAC;QACtC,OAAO,OAAO,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAC1E,CAAC,CAAC;IAEF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,KAAK,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,YAAY,CAAC,OAAO,EAAE,EAAE,CAAC;QAC1D,MAAM,GAAG,GAAG,QAAQ,CAAC,WAAW,CAAC,CAAC;QAClC,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,MAAM,IAAI,WAAW,CACnB,IAAI,MAAM,CAAC,KAAK,CAAC,UAAU,KAAK,mCAAmC,WAAW,KAAK;gBACjF,qCAAqC;gBACrC,iDAAiD,CACpD,CAAC;QACJ,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,KAAK,CAAW,CAAC,CAAC;IAC5C,CAAC;IAED;;;;;;;;;;;;;;MAcE;IACF;;;;;;;;;;;;;MAaE;IACF,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;IAChD,KAAK,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,YAAY,CAAC,OAAO,EAAE,EAAE,CAAC;QAC1D,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAE,KAAK,CAAC,CAAC;IAClD,CAAC;IAED,KAAK,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,YAAY,CAAC,OAAO,EAAE,EAAE,CAAC;QAC1D,IAAI,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC;QACvD,KAAK,IAAI,MAAM,GAAG,EAAE,EAAE,QAAQ,KAAK,MAAM,EAAE,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC7E,MAAM,GAAG,QAAQ,CAAC;YAClB,MAAM,KAAK,GAAG,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC;YACpD,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,KAAK;gBAAE,SAAS;YACrD,MAAM,IAAI,WAAW,CACnB,IAAI,MAAM,CAAC,KAAK,CAAC,8BAA8B,WAAW,qBAAqB;gBAC7E,IAAI,YAAY,CAAC,KAAK,CAAC,cAAc,MAAM,CAAC,KAAK,CAAC,mBAAmB;gBACrE,kFAAkF;gBAClF,qBAAqB,CACxB,CAAC;QACJ,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,OAAO,CAAC,KAAwB;IACvC,OAAO,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC;AAC9D,CAAC;AAED;;;;;;;GAOG;AACH,KAAK,UAAU,cAAc,CAC3B,KAAa,EACb,WAAmB,EACnB,MAA+B,EAC/B,OAAkC;IAOlC;;;;;;;MAOE;IACF;;;;;;;;;;MAUE;IACF,MAAM,IAAI,GAAG,CAAC,SAAS,WAAW,EAAE,CAAC,CAAC;IACtC;;;;;;MAME;IACF,KAAK,MAAM,IAAI,IAAI,CAAC,kBAAkB,EAAE,UAAU,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,CAAC;QAC7F,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC;IACpD,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU,EAAE,QAAQ,CAAC,EAAE,CAAC;QACtE,IAAI,OAAO,MAAM,CAAC,IAAI,CAAC,KAAK,QAAQ;YAAE,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,IAAI,MAAM,CAAC,IAAI,CAAW,EAAE,CAAC,CAAC;IACzF,CAAC;IACD,0FAA0F;IAC1F,+EAA+E;IAC/E,MAAM,QAAQ,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;IACpC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC3B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAE,QAAqB,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC;YACzF,IAAI,CAAC,IAAI,CAAC,cAAc,IAAI,EAAE,CAAC,CAAC;QAClC,CAAC;IACH,CAAC;IACD,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAEvB,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;QAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE;YACvD,KAAK,EAAE,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC;SACzC,CAAC,CAAC;QACH,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;QAChC,IAAI,GAAG,GAAG,EAAE,CAAC;QACb,IAAI,GAAG,GAAG,EAAE,CAAC;QACb,IAAI,MAAM,GAAmD,IAAI,CAAC;QAClE,KAAK,CAAC,EAAE,CAAC,SAAS,EAAE,CAAC,OAAgB,EAAE,EAAE;YACvC,MAAM,OAAO,GAAI,OAAiE,EAAE,OAAO,CAAC;YAC5F,IAAI,OAAO;gBAAE,MAAM,GAAG,OAAO,CAAC;QAChC,CAAC,CAAC,CAAC;QACH,KAAK,CAAC,MAAM,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,KAAa,EAAE,EAAE;YAC7D,GAAG,IAAI,KAAK,CAAC;QACf,CAAC,CAAC,CAAC;QACH,KAAK,CAAC,MAAM,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,KAAa,EAAE,EAAE;YAC7D,GAAG,IAAI,KAAK,CAAC;QACf,CAAC,CAAC,CAAC;QACH,KAAK,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,KAAK,EAAE,EAAE;YAC1B,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACtB,OAAO,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GAAG,UAAU,KAAK,KAAK,KAAK,CAAC,OAAO,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;QAC/F,CAAC,CAAC,CAAC;QACH,KAAK,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE;YACjC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACtB;;;;;;;;;;;;;cAaE;YACF,IAAI,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACjC,GAAG;oBACD,qBAAqB,MAAM,wBAAwB;wBACnD,8CAA8C,WAAW,IAAI,CAAC;YAClE,CAAC;YACD,OAAO,CAAC,EAAE,IAAI,EAAE,IAAI,IAAI,UAAU,EAAE,GAAG,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,CAAC;QAC1D,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC;AAED,sEAAsE;AACtE,SAAS,KAAK,CAAC,IAAY,EAAE,KAAa;IACxC,uFAAuF;IACvF,2FAA2F;IAC3F,4EAA4E;IAC5E,OAAO,IAAI,CAAC,OAAO,CAAC,aAAa,EAAE,GAAG,EAAE,CAAC,UAAU,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;AAC3E,CAAC;AAED,6FAA6F;AAC7F,SAAS,WAAW,CAAC,IAAY;IAC/B,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;IAC5B,IAAI,OAAO,KAAK,EAAE;QAAE,OAAO,EAAE,CAAC;IAC9B,IAAI,CAAC;QACH,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC;IACpD,CAAC;IAAC,MAAM,CAAC;QACP,2EAA2E;QAC3E,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAYD,MAAM,YAAY,GAAS,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE;IAC1C,CAAC,MAAM,KAAK,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;AACnE,CAAC,CAAC;AAEF,qFAAqF;AACrF,SAAS,QAAQ;IACf,MAAM,KAAK,GAAgC,EAAE,CAAC;IAC9C,OAAO;QACL,IAAI,EAAE,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAClD,KAAK,EAAE,GAAG,EAAE;YACV,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,KAAK;gBAAE,YAAY,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACjE,CAAC;KACF,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,SAAS,WAAW,CAAC,KAAc,EAAE,KAAc,EAAE,OAAa,YAAY;IAC5E,MAAM,KAAK,GAAG,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC;IACjE,IAAI,KAAK,YAAY,QAAQ,IAAI,KAAK,YAAY,eAAe,EAAE,CAAC;QAClE,IAAI,CAAC,KAAK,EAAE,UAAU,KAAK,GAAG,cAAc,CAAC,KAAK,CAAC,OAAO,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC;QAC5E,IAAI,KAAK,CAAC,IAAI;YAAE,IAAI,CAAC,KAAK,EAAE,UAAU,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC;QACtD,qFAAqF;QACrF,oDAAoD;QACpD,OAAO,KAAK,YAAY,eAAe,IAAI,iBAAiB,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC;YAC1E,CAAC,CAAC,UAAU;YACZ,CAAC,CAAC,UAAU,CAAC;IACjB,CAAC;IACD,IACE,KAAK,YAAY,qBAAqB;QACtC,KAAK,YAAY,cAAc;QAC/B,KAAK,YAAY,WAAW,EAC5B,CAAC;QACD,IAAI,CAAC,KAAK,EAAE,UAAU,KAAK,GAAG,cAAc,CAAC,KAAK,CAAC,OAAO,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC;QAC5E,OAAO,UAAU,CAAC;IACpB,CAAC;IACD,IAAI,CAAC,KAAK,EAAE,UAAU,KAAK,GAAG,OAAO,CAAC,KAAK,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC;IAC7D,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;;;;;GAMG;AACH,SAAS,SAAS,CAAC,GAAY,EAAE,MAAc;IAC7C,IAAI,GAAG,KAAK,SAAS;QAAE,OAAO,CAAC,CAAC;IAChC,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IAChC,IAAI,IAAI,KAAK,MAAM;QAAE,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAC7E,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;IAC3B,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QAC1C,MAAM,IAAI,WAAW,CAAC,+DAA+D,IAAI,IAAI,CAAC,CAAC;IACjG,CAAC;IACD,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;AAC9C,CAAC;AAED,SAAS,aAAa,CAAC,GAAY;IACjC,IAAI,GAAG,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IACxC,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,GAAgB,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;IACpE,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;IACrG,oFAAoF;IACpF,6EAA6E;IAC7E,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,MAAM,IAAI,WAAW,CAAC,kDAAkD,CAAC,CAAC;IAC5E,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,YAAY,CAAC,GAAY,EAAE,MAAc;IAChD,IAAI,GAAG,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IACxC,OAAO,aAAa,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;AAC5C,CAAC;AAED,+EAA+E;AAC/E,SAAS,cAAc,CAAC,GAAY;IAClC,IAAI,GAAG,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IACxC,IAAI,GAAG,KAAK,MAAM,IAAI,GAAG,KAAK,MAAM;QAAE,OAAO,GAAG,CAAC;IACjD,MAAM,IAAI,WAAW,CAAC,2CAA2C,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;AACpF,CAAC;AAED,SAAS,gBAAgB,CAAC,GAAY;IACpC,IAAI,GAAG,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IACxC,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IAChC,qFAAqF;IACrF,IAAI,IAAI,KAAK,EAAE,EAAE,CAAC;QAChB,MAAM,IAAI,WAAW,CAAC,sDAAsD,CAAC,CAAC;IAChF,CAAC;IACD,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;IAC3B,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,EAAE,EAAE,CAAC;QACxD,MAAM,IAAI,WAAW,CAAC,4DAA4D,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACrG,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;EAKE;AACF,SAAS,OAAO,CAAC,KAAc,EAAE,MAAM,GAAG,EAAE;IAC1C,2FAA2F;IAC3F,2EAA2E;IAC3E,OAAO,cAAc,CAAC,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,CAAC;AACxF,CAAC;AAED,OAAO,EAAE,gBAAgB,EAAE,CAAC;AAE5B;;;;;;;;GAQG;AACH,SAAS,YAAY;IACnB,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9B,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IACtC,IAAI,CAAC;QACH,OAAO,YAAY,CAAC,KAAK,CAAC,KAAK,YAAY,CAAC,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IAC9E,CAAC;IAAC,MAAM,CAAC;QACP,wEAAwE;QACxE,OAAO,aAAa,CAAC,KAAK,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC;IACvD,CAAC;AACH,CAAC;AAED,MAAM,eAAe,GAAG,YAAY,EAAE,CAAC;AAEvC,IAAI,eAAe,EAAE,CAAC;IACpB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;SACxB,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE;QACb,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC;IAC1B,CAAC,CAAC;SACD,KAAK,CAAC,CAAC,KAAc,EAAE,EAAE;QACxB,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,UAAU,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACnD,OAAO,CAAC,QAAQ,GAAG,UAAU,CAAC;IAChC,CAAC,CAAC,CAAC;AACP,CAAC","sourcesContent":["#!/usr/bin/env node\n/**\n * Command-line entry point.\n *\n * Output discipline: anything that is the *result* of a command goes to stdout\n * (`--info`'s channel table, `--json`'s summary). Progress, warnings and the\n * conversion summary go to stderr, so a conversion can be run in a pipeline without\n * its chatter contaminating the data.\n */\n\nimport { parseArgs } from 'node:util';\nimport { pathToFileURL, fileURLToPath } from 'node:url';\nimport { realpathSync } from 'node:fs';\nimport { lstat, readdir, realpath, stat } from 'node:fs/promises';\nimport { cpus } from 'node:os';\nimport { fork } from 'node:child_process';\nimport type { ChildProcess } from 'node:child_process';\nimport path from 'node:path';\nimport process from 'node:process';\n\nimport { EdfError } from './edf/errors.js';\nimport { EdfFile } from './edf/reader.js';\nimport { buildPlan, withoutFileRateWarning } from './convert/plan.js';\nimport { ConversionError, USAGE_ERROR_CODES, convert, defaultOutputDir } from './convert/run.js';\nimport { ChannelSelectionError } from './convert/channels.js';\n// Shared with the library so a bad option is the same error whichever way it arrived.\nimport { OptionError } from './convert/options.js';\nimport { TimeRangeError, parseTimeSpec } from './convert/time-range.js';\nimport { deriveRecordStarts } from './convert/timing.js';\nimport { formatDiagnostics, formatInfo, infoJson, formatSummary, printable, printableLines, summaryJson } from './cli/report.js';\nimport { listed } from './format/list.js';\nimport { VERSION } from './version.js';\n\nconst USAGE = `edf2csv ${VERSION}\nConvert EDF, EDF+ and BDF recordings to CSV\n\nUsage\n  edf2csv <recording.edf | folder> [more ...] [options]\n\nOptions\n  -i, --info             Show the recording's structure and estimated output size,\n                         without converting anything\n  -o, --out <dir>        Output directory (default: <recording>_csv beside the input)\n  -c, --channels <list>  Only these channels, comma-separated. Use #N to pick a\n                         channel by position when two share a label\n      --start <time>     Begin at this offset (30s, 5m, 1h30m, 00:30:00)\n      --duration <time>  Convert this much\n      --end <time>       Stop at this offset (instead of --duration)\n      --annotations-only Write only the EDF+ annotations, no signal data\n      --decimals <n>     Fix the decimal places instead of deriving them per channel\n      --checksum         Record a SHA-256 of the input in metadata.json\n      --layout <kind>    wide (default): one column per channel, one file per\n                         sampling rate. long: one file of time_s,channel,value,\n                         every rate together, one row per sample\n      --gzip             Compress every CSV, writing .csv.gz files\n      --bom              Start each CSV with a UTF-8 byte order mark, so Excel\n                         reads accented text and units like µV correctly\n  -j, --jobs <n>         Convert this many recordings at once, or \"auto\" (default: 1)\n  -f, --force            Overwrite the output directory if it exists\n  -q, --quiet            Suppress the summary; warnings and errors still print\n      --json             Print machine-readable JSON to stdout (works with --info too)\n      --strict           Exit 1 if the recording raised any warning\n      --stdout           Write the signal CSV to stdout instead of a directory\n                         (one table only: one sampling rate, or --layout long)\n  -h, --help             Show this help\n  -V, --version          Show the version\n\nSeveral recordings\n  A folder is expanded to every .edf and .bdf inside it, at any depth, and the\n  layout is kept: recordings in sub-folders come out in sub-folders.\n  Pass more than one and each is converted in turn. Without --out each lands\n  beside itself as usual; with --out that directory becomes the parent and each\n  recording gets its own inside it. A file that cannot be read is reported and\n  the rest still convert, with a non-zero exit at the end. --jobs converts\n  several at once, which is worth it for a folder of them.\n\nOutput\n  A directory containing signals.csv, channels.csv, metadata.json, and\n  annotations.csv when the recording carries EDF+ annotations. Channels recorded\n  at different sampling rates are written to separate files, never resampled.\n  With --gzip each CSV becomes a .csv.gz; metadata.json stays plain text so the\n  directory can still be read at a glance. With --bom each CSV starts with a\n  UTF-8 byte order mark and metadata.json does not, since JSON.parse rejects one.\n  With --layout long every channel goes into one signals.csv as time_s, channel\n  and value, in time order, whatever rates the recording mixes — which is also\n  the one arrangement --stdout can stream for a mixed-rate file.\n\nExamples\n  edf2csv recording.edf\n  edf2csv recording.edf --info\n  edf2csv recording.edf --channels \"EEG Fpz-Cz,ECG\" --out ./converted\n  edf2csv recording.edf --start 30m --duration 5m\n  edf2csv recording.edf --annotations-only\n  edf2csv /data/*.edf --out ./converted\n  edf2csv /data/*.edf --out ./converted --jobs auto\n  edf2csv /data/study --out ./converted --jobs auto\n`;\n\nconst EXIT_OK = 0;\nconst EXIT_ERROR = 1;\nconst EXIT_USAGE = 2;\n\n/**\n * Whether this run is already shutting its children down.\n *\n * A child dying by signal is normally worth a line of its own, but not when this process is\n * the one that killed it: the interrupt handler names every abandoned directory in a single\n * message, and a per-child line underneath it would say the same thing again, once per job.\n */\nlet stopping = false;\n\n/**\n * Piping into a consumer that exits early (`| head -1`) closes our stdout, and the\n * next write raises EPIPE. That is normal in a shell pipeline, not an error worth a\n * stack trace, so it is swallowed while anything else still surfaces.\n */\nfunction ignoreBrokenPipe(stream: NodeJS.WriteStream): void {\n  stream.on('error', (error: NodeJS.ErrnoException) => {\n    if (error.code === 'EPIPE') {\n      // A reader closing early (`edf2csv ... --info | head -5`) is not a failure, so the\n      // error is swallowed rather than thrown. It deliberately does NOT set an exit code:\n      // forcing 0 here would erase a real failure whenever the pipe happened to close\n      // after the run had already failed, reporting success for a conversion that did\n      // not happen. Node exits 0 on its own when nothing sets a code.\n      return;\n    }\n\n    /*\n      Anything else is a real write failure, and this used to rethrow it.\n\n      The throw lands on a nextTick, outside whatever try/catch the conversion is running\n      inside, so it became an uncaught exception: `--stdout` redirected onto a full disk\n      died with a raw stack trace headed `dist/cli.js: throw error;` and lost the warning\n      that the CSV it had already produced was truncated. The same failure through `--out`\n      printed the ordinary message, and so did `--stdout` through the library API, which\n      never registers this listener — the designed path exists and works, and this was\n      preempting it.\n\n      A second listener means the conversion's writer is watching this stream and will\n      turn the failure into that ordinary message. Saying it here too would report one\n      failure twice, so this only speaks when nothing else will.\n    */\n    if (stream.listenerCount('error') > 1) return;\n    process.stderr.write(`error: Writing to ${stream === process.stdout ? 'stdout' : 'stderr'} failed: ${error.message}\\n`);\n    process.exitCode = EXIT_ERROR;\n  });\n}\n\nexport async function main(argv: readonly string[]): Promise<number> {\n  ignoreBrokenPipe(process.stdout);\n  ignoreBrokenPipe(process.stderr);\n\n  let values: Record<string, unknown>;\n  let positionals: string[];\n\n  try {\n    const parsed = parseArgs({\n      args: [...argv],\n      allowPositionals: true,\n      strict: true,\n      options: {\n        info: { type: 'boolean', short: 'i' },\n        out: { type: 'string', short: 'o' },\n        channels: { type: 'string', short: 'c', multiple: true },\n        start: { type: 'string' },\n        duration: { type: 'string' },\n        end: { type: 'string' },\n        'annotations-only': { type: 'boolean' },\n        decimals: { type: 'string' },\n        checksum: { type: 'boolean' },\n        layout: { type: 'string' },\n        gzip: { type: 'boolean' },\n        bom: { type: 'boolean' },\n        jobs: { type: 'string', short: 'j' },\n        force: { type: 'boolean', short: 'f' },\n        quiet: { type: 'boolean', short: 'q' },\n        json: { type: 'boolean' },\n        strict: { type: 'boolean' },\n        stdout: { type: 'boolean' },\n        help: { type: 'boolean', short: 'h' },\n        version: { type: 'boolean', short: 'V' },\n      },\n    });\n    values = parsed.values as Record<string, unknown>;\n    positionals = parsed.positionals;\n  } catch (error) {\n    process.stderr.write(`${message(error)}\\n\\nRun edf2csv --help to see the options.\\n`);\n    return EXIT_USAGE;\n  }\n\n  if (values['help'] === true) {\n    process.stdout.write(USAGE);\n    return EXIT_OK;\n  }\n  if (values['version'] === true) {\n    process.stdout.write(`${VERSION}\\n`);\n    return EXIT_OK;\n  }\n\n  if (positionals.length === 0) {\n    process.stderr.write(`No input file given.\\n\\n${USAGE}`);\n    return EXIT_USAGE;\n  }\n\n  let expanded: Input[];\n  let unreadable: string[];\n  let namedDirectory: boolean;\n  try {\n    const found = await expandInputs(positionals);\n    expanded = found.inputs;\n    unreadable = found.unreadable;\n    namedDirectory = found.namedDirectory;\n  } catch (error) {\n    return reportError(error);\n  }\n\n  // Reported before anything is converted, so it cannot be lost among the summaries, and\n  // counted against the run so the exit code does not call a partial sweep a success.\n  for (const entry of unreadable) {\n    process.stderr.write(\n      `error: ${printable(entry)}: could not be read, so any recordings inside it were skipped.\\n`,\n    );\n  }\n\n  if (expanded.length === 0) {\n    /*\n      \"None here\" and \"could not look\" are different answers, and so are their exit codes.\n\n      A folder the process cannot read gave the same exit 2 and the same \"No EDF or BDF\n      recordings found\" as an empty one — while the line above it said the folder could not\n      be read. Exit 2 is this tool's code for \"the command itself was wrong\", so a script\n      was being told to fix its arguments when what needed fixing was a permission. The\n      command was fine; the filesystem refused.\n\n      And the sentence itself claimed a fact the run is in no position to state: nothing was\n      found because nothing was looked at.\n    */\n    if (unreadable.length > 0) {\n      process.stderr.write(\n        `Nothing could be converted: ${unreadable.length === 1 ? 'that path' : 'those paths'} ` +\n          `could not be read, so whether ${unreadable.length === 1 ? 'it holds' : 'they hold'} ` +\n          `recordings is unknown.\\n`,\n      );\n      return EXIT_ERROR;\n    }\n    process.stderr.write(\n      `No EDF or BDF recordings found in ${listed(positionals.map((p) => `\"${p}\"`))}.\\n`,\n    );\n    return EXIT_USAGE;\n  }\n  const inputs = expanded.map((entry) => entry.path);\n  /*\n    A batch is what you asked for, not what happened to be there.\n\n    Counting the recordings made the shape of the run depend on the contents of a folder.\n    Under --json a study holding one night printed a pretty-printed object and the same study\n    holding two printed two compact lines, so a script written against one of them broke on\n    the other — and it broke the day a recording was added, not the day the script changed.\n    An input going missing did it in reverse. This is the same count 0.4.20 took out of\n    `--out` for the same reason.\n  */\n  const batch = inputs.length > 1 || namedDirectory;\n  const quiet = values['quiet'] === true;\n  const asJson = values['json'] === true;\n  const strict = values['strict'] === true;\n  const toStdout = values['stdout'] === true;\n\n  // Both of these claim stdout. Allowing them together wrote the CSV and then the summary\n  // object onto one stream, producing a document that is neither valid CSV nor valid\n  // JSON — and silently, since each half looked right on its own.\n  if (toStdout && asJson) {\n    process.stderr.write(\n      '--stdout and --json both write to stdout, so they cannot be combined.\\n' +\n        'Use --stdout for the CSV, or --json for the summary.\\n',\n    );\n    return EXIT_USAGE;\n  }\n\n  /*\n    One stream holds one table, for the same reason it holds one recording: concatenating\n    them would give a CSV whose rows come from different files with nothing marking where\n    one ends. Naming the count makes it obvious a glob was the cause — except when the count\n    is one, which happens for a folder holding a single recording. That read \"--stdout writes\n    a single CSV, so it cannot take 1 recordings\": ungrammatical, and wrong on its face, since\n    one recording is exactly what it can take. What it cannot take is a folder, whose contents\n    are not known until they are walked.\n  */\n  if (toStdout && batch) {\n    process.stderr.write(\n      inputs.length === 1\n        ? `--stdout writes a single CSV, and a folder is converted as a batch even when it ` +\n          `holds one recording.\\nName the recording itself — ${inputs[0]} — or convert to a ` +\n          `directory instead.\\n`\n        : `--stdout writes a single CSV, so it cannot take ${inputs.length} recordings.\\n` +\n          `Convert them to directories instead, or run edf2csv once per file.\\n`,\n    );\n    return EXIT_USAGE;\n  }\n\n  /*\n    Flags that --stdout has nowhere to put.\n\n    Both were accepted and dropped in silence. `--out` names a directory that is never\n    created, so the run looked like it had written one. `--checksum` is worse than useless:\n    the hash is computed before the first record is read, which is a second full pass over\n    the input, and then the only file it is ever written to — metadata.json — is not written\n    at all. A recording large enough to want a checksum is large enough to notice reading it\n    twice for nothing.\n\n    Refusing rather than ignoring is what this tool already does for `--stdout --json` and\n    `--stdout --annotations-only`.\n  */\n  for (const [flag, given] of [\n    ['--out', values['out'] !== undefined],\n    ['--checksum', values['checksum'] === true],\n  ] as const) {\n    if (toStdout && given) {\n      process.stderr.write(\n        `--stdout and ${flag} cannot be combined: --stdout writes no files, and ${flag} has ` +\n          `nothing to act on.\\nDrop ${flag}, or drop --stdout and convert to a directory.\\n`,\n      );\n      return EXIT_USAGE;\n    }\n  }\n\n  /*\n    One recording prints the document it always printed; several print one per line.\n\n    Pretty-printed objects run together are still readable by a streaming JSON parser, but\n    not by anything that reads a record per line — and a batch is exactly where that is\n    wanted. Emitting a batch in the single-file shape would repeat 0.2.28's mistake of\n    putting two documents on one stream and leaving the caller to work out the boundary.\n\n    null, not undefined: the serialisers default this argument to 2, and a default parameter\n    takes effect for undefined, which silently gave a batch the indentation it was supposed\n    to be dropping.\n  */\n  const jsonIndent = batch ? null : 2;\n\n  try {\n    const outOption = typeof values['out'] === 'string' ? values['out'] : undefined;\n    const destinations = destinationsFor(expanded, outOption, batch);\n    assertDistinct(inputs, destinations);\n\n    const shared = {\n      channels: splitChannels(values['channels']),\n      start: optionalTime(values['start'], '--start'),\n      startText: typeof values['start'] === 'string' ? values['start'] : undefined,\n      duration: optionalTime(values['duration'], '--duration'),\n      end: optionalTime(values['end'], '--end'),\n      endText: typeof values['end'] === 'string' ? values['end'] : undefined,\n      decimals: optionalDecimals(values['decimals']),\n      annotationsOnly: values['annotations-only'] === true,\n      gzip: values['gzip'] === true,\n      bom: values['bom'] === true,\n      layout: optionalLayout(values['layout']),\n    };\n\n    // Validated before the --info branch, not inside the conversion path: a flag that\n    // cannot be honoured is a usage error whatever mode it was given in, and accepting\n    // \"--jobs 0\" in silence under --info is the kind of quiet that this tool avoids.\n    // Parsed before it is overridden: --stdout converts one recording however many jobs\n    // were asked for, but \"--stdout --jobs 0\" is still a request that cannot be honoured,\n    // and accepting it in silence is the thing 0.4.2 fixed for --info.\n    const requestedJobs = parseJobs(values['jobs'], inputs.length);\n    const jobs = toStdout ? 1 : requestedJobs;\n\n    if (values['info'] === true) {\n      const failures: number[] = [];\n      let warnings = 0;\n      for (const [index, input] of inputs.entries()) {\n        // A blank line between reports, so several tables read as one document.\n        if (batch && !asJson && index > 0) process.stdout.write('\\n');\n        try {\n          warnings += await showInfo(input as string, shared, asJson, jsonIndent);\n        } catch (error) {\n          failures.push(reportError(error, batch ? (input as string) : undefined));\n        }\n      }\n      if (unreadable.length > 0) failures.push(EXIT_ERROR);\n      if (failures.length > 0) return worstOf(failures);\n      return strict && warnings > 0 ? EXIT_ERROR : EXIT_OK;\n    }\n\n    // The meter redraws one line in place, which two conversions cannot share. Running them\n    // at once replaces it with the completion count each file prints as it lands.\n    const showProgress =\n      !quiet && !asJson && !toStdout && jobs === 1 && process.stderr.isTTY === true;\n\n    const failures: number[] = [];\n    let warnings = 0;\n    let converted = 0;\n\n    /** Convert input `index`, sending its output wherever the caller wants it. */\n    const runOne = async (index: number, emit: Emit): Promise<void> => {\n      const input = inputs[index] as string;\n      const destination = destinations[index] as string;\n      // Which recording this is, before anything it prints. Without it a batch produces a\n      // stack of summaries and errors with nothing saying which file each belongs to.\n      if (batch && !quiet && !asJson) {\n        emit('err', `[${index + 1}/${inputs.length}] ${printable(input)}\\n`);\n      }\n      try {\n        warnings += await convertOne(\n          input,\n          destination,\n          {\n            ...shared,\n            // With one input and no --out, convert() derives the default itself, exactly as\n            // it did before batches existed.\n            outputDir: outOption === undefined && !batch ? undefined : destination,\n            checksum: values['checksum'] === true,\n            force: values['force'] === true,\n            toStdout,\n            quiet,\n            asJson,\n            showProgress,\n            jsonIndent,\n          },\n          emit,\n        );\n        converted++;\n      } catch (error) {\n        /*\n          A batch keeps going. One unreadable recording among five hundred is a reason to\n          report that file, not to abandon the ones already converted and refuse the rest.\n          The exit code still reports the run as failed, and the closing line says how many\n          of them made it, so nothing about the failure is quiet.\n        */\n        failures.push(reportError(error, batch ? input : undefined, emit));\n      }\n    };\n\n    if (jobs === 1) {\n      for (let index = 0; index < inputs.length; index++) {\n        await runOne(index, writeThrough);\n        // A single recording keeps the exit code it has always had rather than the batch's.\n        if (!batch && failures.length > 0) return failures[0] as number;\n      }\n    } else {\n      /*\n        Real processes, not concurrent promises.\n\n        Converting is almost entirely arithmetic and string building — 1.17 s of CPU for\n        1.24 s of wall clock on a 168 MB conversion — and Node runs that on one thread. An\n        in-process pool was tried first and gained 6% on eight recordings, which is the\n        overlap in the file reads and nothing else. Each conversion is already a whole\n        command, so each one gets its own process, which is what `xargs -P` would do by hand.\n\n        Workers take the next recording as they free up rather than splitting the list into\n        equal shares. Recordings in a folder differ wildly in length, and a fixed split\n        leaves every worker but one idle behind the longest file.\n\n        Each child's output is held until it exits, so two finishing together cannot\n        interleave one's summary with the other's warnings.\n      */\n      const running = new Map<ChildProcess, string>();\n\n      /*\n        Ctrl-C in a terminal reaches every process in the group, so the children would stop\n        anyway; a signal sent to this process alone does not, and that is how a batch gets\n        run from a script or a CI job. Interrupting one left four conversions writing\n        gigabytes into a directory their owner believed abandoned, and the last thing on\n        screen was a successful \"Done in 1.6s\" from whichever recording had just landed —\n        the run read as if it had finished.\n      */\n      const onInterrupt = (signal: NodeJS.Signals): void => {\n        stopping = true;\n        const abandoned = [...running.values()];\n        for (const child of running.keys()) child.kill('SIGTERM');\n        process.stderr.write(\n          `\\ninterrupted (${signal}): ${abandoned.length} conversion` +\n            `${abandoned.length === 1 ? '' : 's'} stopped part way through.\\n` +\n            (abandoned.length > 0\n              ? `       Incomplete, and should not be used: ${listed(abandoned)}\\n`\n              : ''),\n        );\n        process.exit(signal === 'SIGINT' ? 130 : 143);\n      };\n      process.once('SIGINT', onInterrupt);\n      process.once('SIGTERM', onInterrupt);\n\n      let next = 0;\n      const worker = async (): Promise<void> => {\n        for (let index = next++; index < inputs.length; index = next++) {\n          const input = inputs[index] as string;\n          const sink = buffered();\n          if (!quiet && !asJson) {\n            sink.emit('err', `[${index + 1}/${inputs.length}] ${printable(input)}\\n`);\n          }\n          const child = await convertInChild(\n            input,\n            destinations[index] as string,\n            values,\n            running,\n          );\n          // The report says what the child actually did; the exit code says whether it\n          // got there. A child that converted and warned has a report and exits 0, since\n          // --strict is the parent's to apply.\n          if (child.report) {\n            converted += child.report.converted;\n            warnings += child.report.warnings;\n          } else if (child.code === 0) {\n            converted++;\n          }\n          if (child.code !== 0) failures.push(child.code);\n          // The child saw one recording, so it printed the indented document a single\n          // conversion prints. A batch is one object per line.\n          sink.emit('out', asJson ? compactJson(child.out) : child.out);\n          // The child converted a single recording, so it named no file in its errors the\n          // way a batch does. Naming it here keeps the two paths identical to a reader and\n          // to anything grepping a log, where the [n/m] header may not be alongside.\n          sink.emit('err', named(child.err, input));\n          sink.flush();\n        }\n      };\n      try {\n        await Promise.all(Array.from({ length: jobs }, () => worker()));\n      } finally {\n        process.off('SIGINT', onInterrupt);\n        process.off('SIGTERM', onInterrupt);\n      }\n    }\n\n    /*\n      A path that could not be read is a failure of this run, and the closing line has to\n      count it before it prints rather than after.\n\n      It was counted afterwards, so a folder holding one recording beside a sub-directory\n      without read permission printed \"Converted 1 of 1 recordings.\" and exited 1. The line\n      agreed with itself and with nothing else — which is the failure the walk's own comment\n      says was fixed, quoting that very sentence. What was fixed then was the error line and\n      the exit code; the summary went on saying everything worked.\n\n      Counted separately from the recordings, because an unreadable path is not one of them:\n      how many recordings it held is the thing nobody knows.\n    */\n    if (unreadable.length > 0) failures.push(EXIT_ERROR);\n\n    if (batch && !quiet && !asJson) {\n      const unread =\n        unreadable.length > 0\n          ? `; ${unreadable.length} path${unreadable.length === 1 ? '' : 's'} could not be read`\n          : '';\n      const failed = converted < inputs.length ? `; ${inputs.length - converted} failed` : '';\n      process.stderr.write(\n        `\\nConverted ${converted} of ${inputs.length} recordings${failed}${unread}.\\n`,\n      );\n    }\n\n    /*\n      A parent that forked this process needs the counts, not just an exit status.\n\n      An exit code cannot separate \"converted, and raised warnings\" from \"did not convert\",\n      and under --strict those are the same code. The parent read it as a failure, so a\n      parallel run of two recordings — one of which merely warned — reported \"Converted 1 of\n      2 recordings; 1 failed\" for a run in which both converted, while the serial path said\n      \"Converted 2 of 2\". `process.send` exists only when this process was forked with a\n      channel, so nothing changes for an ordinary invocation.\n    */\n    process.send?.({ edf2csv: { converted, warnings } });\n\n    if (failures.length > 0) return worstOf(failures);\n\n    /*\n      --strict turns any warning into a non-zero exit, for pipelines that would rather stop\n      than proceed on a recording the tool had something to say about.\n\n      The output is still written. A warning describes the recording, not a failure to\n      convert it — a truncated file converts correctly for the records that are there — so\n      destroying that work would be the wrong response. The exit code is the signal; what\n      to do about it is the caller's decision, and they still have the files to inspect.\n    */\n    if (strict && warnings > 0) {\n      process.stderr.write(\n        `\\n--strict: ${warnings} warning${warnings === 1 ? '' : 's'} raised, so this run is ` +\n          `reported as a failure. The output was still written.\\n`,\n      );\n      return EXIT_ERROR;\n    }\n    return EXIT_OK;\n  } catch (error) {\n    return reportError(error);\n  }\n}\n\n/** Print one recording's `--info`, and return how many diagnostics it raised. */\nasync function showInfo(\n  input: string,\n  shared: Record<string, unknown>,\n  asJson: boolean,\n  jsonIndent: number | null,\n): Promise<number> {\n  const file = await EdfFile.open(input);\n  try {\n    /*\n      Read the annotation channel only when the timing actually depends on it.\n\n      --info is documented as a header-only summary that returns immediately whatever\n      the file's size, but it called readAnnotations() on every EDF+/BDF+ file — a seek\n      into every data record. deriveRecordStarts discards that data unless the file is\n      EDF+D, where record start times are stored rather than arithmetic, so on a\n      continuous recording the whole scan was thrown away. It cost 0.29 s on a 12 MB\n      file and scaled with record count.\n\n      A discontinuous file still needs the scan: without it the reported span and row\n      estimate are wrong, which is a bug that has already been fixed once here.\n    */\n    const hasAnnotations = file.annotationSignals.length > 0;\n    const needsEveryRecordStart = file.header.continuity === 'EDF+D' && hasAnnotations;\n    /*\n      A continuous recording needs its origin too, which is one read rather than one per\n      record: 0.4.9 made its first record's timekeeping TAL the point the samples are timed\n      from, and this report went on placing a requested window against zero. `--info --start 1`\n      predicted 8 rows where the conversion wrote 10, on a file whose discontinuous twin —\n      identical but for the reserved field — agreed with itself.\n    */\n    const annotationData = needsEveryRecordStart\n      ? await file.readAnnotations()\n      : {\n          annotations: [],\n          recordStarts:\n            file.header.continuity === 'EDF+C' && hasAnnotations\n              ? [await file.readOrigin()]\n              : [],\n          malformed: 0,\n        };\n    const timing = deriveRecordStarts(file, annotationData);\n    const plan = buildPlan(\n      {\n        signals: file.header.signals,\n        recordDuration: file.header.recordDuration,\n        recordCount: file.recordCount,\n        hasAnnotationChannel: file.annotationSignals.length > 0,\n        recordStarts: timing.starts,\n      },\n      shared,\n    );\n    plan.diagnostics.push(...timing.diagnostics);\n    process.stdout.write(\n      asJson ? `${infoJson(file, plan, jsonIndent)}\\n` : `${formatInfo(file, plan)}\\n`,\n    );\n\n    // Under --json the warnings travel inside the document, exactly as they do for a\n    // conversion, so stderr stays empty and the whole result is one parseable thing.\n    const diagnostics = [...withoutFileRateWarning(file.diagnostics), ...plan.diagnostics];\n    if (!asJson && diagnostics.length > 0) {\n      process.stderr.write(`\\n${formatDiagnostics(diagnostics)}\\n`);\n    }\n    return diagnostics.length;\n  } finally {\n    await file.close();\n  }\n}\n\n/** Convert one recording, and return how many diagnostics it raised. */\nasync function convertOne(\n  input: string,\n  destination: string,\n  options: Record<string, unknown> & {\n    quiet: boolean;\n    asJson: boolean;\n    showProgress: boolean;\n    toStdout: boolean;\n    jsonIndent: number | null;\n  },\n  emit: Emit = writeThrough,\n): Promise<number> {\n  const { quiet, asJson, showProgress, toStdout } = options;\n  let lastTick = 0;\n\n  /*\n    Interrupting a conversion leaves a CSV that stops mid-recording but is still\n    perfectly well-formed, so nothing about the file itself reveals that half the\n    data is missing. Saying so on the way out is the whole point of a tool that\n    claims it will not go quiet when something is wrong.\n  */\n  const onInterrupt = (signal: NodeJS.Signals): void => {\n    if (showProgress) process.stderr.write('\\r\\u001b[K');\n    // --stdout writes no directory, so there is none to warn about. Naming one anyway\n    // pointed at a path that was never created — the same \"files that were never written\"\n    // that 0.2.30 removed from this path's error message.\n    process.stderr.write(\n      `\\ninterrupted (${signal}): the conversion stopped part way through.\\n` +\n        (toStdout\n          ? `       The CSV on stdout stops mid-recording and should not be used.\\n`\n          : `       Files already written to \"${destination}\" are incomplete and should not be used.\\n`),\n    );\n    // 128 + signal number, the conventional exit status for dying to a signal.\n    process.exit(signal === 'SIGINT' ? 130 : 143);\n  };\n  process.once('SIGINT', onInterrupt);\n  process.once('SIGTERM', onInterrupt);\n\n  try {\n    const result = await convert(input, {\n      ...options,\n      onProgress: showProgress\n        ? (progress): void => {\n            const now = Date.now();\n            if (now - lastTick < 100) return;\n            lastTick = now;\n            const percent =\n              progress.recordsTotal === 0\n                ? 100\n                : Math.floor((progress.recordsDone / progress.recordsTotal) * 100);\n            process.stderr.write(`\\r  converting… ${percent}%`);\n          }\n        : undefined,\n    });\n\n    if (showProgress) process.stderr.write('\\r\\u001b[K');\n\n    if (result.diagnostics.length > 0 && !asJson) {\n      emit('err', `${formatDiagnostics(result.diagnostics)}\\n\\n`);\n    }\n    if (asJson) {\n      // One object per line, so a batch is JSON Lines — `jq` reads a record at a time\n      // rather than waiting for the whole run to finish.\n      emit('out', `${summaryJson(result, options.jsonIndent as number | null)}\\n`);\n    } else if (!quiet) {\n      // With --stdout there is no directory to summarise, and the row count is the only\n      // thing worth saying — on stderr, so the CSV on stdout stays clean.\n      if (toStdout) {\n        const rows = result.files[0]?.rows ?? 0;\n        /*\n          A reader that closed the pipe did not receive a conversion, so it does not get a\n          conversion's summary. `edf2csv rec.edf --stdout | head -1` announced \"Wrote 52,507\n          rows to stdout\" — a number that is neither the recording's 102,400 nor the one row\n          head took, but however many had been formatted before the close was noticed.\n\n          Whether the *conversion* stopped early is a separate question from whether the\n          reader did, and 0.5.12 answered the first with the second. A 10,000-row recording\n          whose CSV outruns the pipe buffer but fits one flush is written in full and only\n          then meets the closed pipe: every row formatted, every row handed over, and the\n          summary said \"The recording was not converted in full.\" The estimate's row count is\n          exact, so the two cases can be told apart and told apart honestly — what reached\n          the reader is not knowable from this side either way.\n        */\n        const expected = result.plan.estimate.rows;\n        emit(\n          'err',\n          !result.readerHungUp\n            ? `Wrote ${rows.toLocaleString('en-US')} rows to stdout.\\n`\n            : rows < expected\n              ? `Stopped: the reader closed the pipe after ${rows.toLocaleString('en-US')} of ` +\n                `${expected.toLocaleString('en-US')} rows had been written. The recording was ` +\n                `not converted in full.\\n`\n              : `Wrote ${rows.toLocaleString('en-US')} rows to stdout, but the reader closed ` +\n                `the pipe before the end, so not all of them reached it.\\n`,\n        );\n      } else {\n        emit('err', `${formatSummary(result)}\\n`);\n      }\n    }\n    return result.diagnostics.length;\n  } finally {\n    process.off('SIGINT', onInterrupt);\n    process.off('SIGTERM', onInterrupt);\n  }\n}\n\n/** A recording to convert, and the path its output should be named after. */\ninterface Input {\n  /** Where the recording is. */\n  path: string;\n  /**\n   * What to call its output, relative to `--out`.\n   *\n   * For a file named on the command line this is just its own name. For one found by\n   * expanding a directory it keeps the position it had inside that directory, so a study\n   * laid out as one folder per night comes out the same shape — and, more to the point, so\n   * that fifty recordings all named `rec.edf` do not all claim `<out>/rec`.\n   */\n  name: string;\n  /**\n   * Whether this recording was found by expanding a directory rather than named directly.\n   *\n   * `--out` means two different things — the output directory itself, or a parent to put one\n   * directory per recording inside — and this is what decides which. See `destinationsFor`.\n   */\n  fromDirectory: boolean;\n}\n\n/**\n * Recordings to convert, with directories expanded to what is inside them.\n *\n * A directory yields every `.edf` and `.bdf` beneath it, at any depth. Recordings arrive\n * organised into folders, and a shell has no tidy way to reach them — which is why the\n * recipes here carried a `find` incantation to do it. Passing the folder is the obvious\n * thing to try, and it used to fail with \"is a directory, not an EDF file\".\n */\nasync function expandInputs(\n  positionals: readonly string[],\n): Promise<{ inputs: Input[]; unreadable: string[]; namedDirectory: boolean }> {\n  const found: Input[] = [];\n  const unreadable: string[] = [];\n  /*\n    Whether a directory was NAMED, which is not the same as whether one yielded anything.\n\n    `fromDirectory` on the inputs answers the second question, and using it for the first put\n    the 0.4.20 defect back one step along: `edf2csv study named.edf --out csv` wrote\n    csv/named/ while the study held recordings and csv/signals.csv once it held none, because\n    the surviving input then looked like a lone file. Whether some unrelated folder happens\n    to contain anything decided where a different recording's output went.\n  */\n  let namedDirectory = false;\n  for (const given of positionals) {\n    const info = await stat(given).catch(() => null);\n    if (info === null || !info.isDirectory()) {\n      // Anything that is not a directory is passed through untouched, so a file that does\n      // not exist still reports itself rather than vanishing from the list.\n      found.push({ path: given, name: path.basename(given), fromDirectory: false });\n      continue;\n    }\n    namedDirectory = true;\n    const walked = await walk(given);\n    unreadable.push(...walked.unreadable);\n    for (const file of walked.files) {\n      found.push({ path: file, name: path.relative(given, file), fromDirectory: true });\n    }\n  }\n  /*\n    One recording, however many ways it was named.\n\n    The walk already does this for links inside a folder, and the two halves disagreed:\n    `edf2csv study` converted a recording reached twice once, while `edf2csv a.edf a.edf`\n    refused the whole run for the collision it would cause. A shell makes the second easy\n    to produce by accident — `edf2csv *.edf recording.edf` — and there is nothing ambiguous\n    about it: it is one recording, and converting it once is what was meant.\n\n    A path that does not resolve keeps its own identity so that a file which is not there\n    still reports itself rather than being folded into another entry.\n\n    Which of the names survives is decided by the names themselves, not by the order they\n    turned up in. Keeping the first arrival meant the output directory was named by argument\n    order — `edf2csv data/one.edf data/alias.edf` wrote out/one and the same two swapped\n    wrote out/alias — and a shell orders a glob however it likes. Inside a folder it was the\n    order `readdir` returned, which differs between filesystems, so copying a study to\n    another machine could rename its output. A recording that is not a link is preferred over\n    a link to it, since that is the name the recording actually has; two of a kind are\n    settled by the path that sorts first.\n  */\n  const identified: { entry: Input; identity: string; link: boolean }[] = [];\n  for (const entry of found) {\n    const identity = await realpath(entry.path).catch(() => `?${path.resolve(entry.path)}`);\n    const own = await lstat(entry.path).catch(() => null);\n    identified.push({ entry, identity, link: own?.isSymbolicLink() ?? false });\n  }\n\n  const byIdentity = new Map<string, Input>();\n  const winners = new Map<string, (typeof identified)[number]>();\n  for (const candidate of identified) {\n    const held = winners.get(candidate.identity);\n    if (held !== undefined && !outnames(candidate, held)) continue;\n    winners.set(candidate.identity, candidate);\n    byIdentity.set(candidate.identity, candidate.entry);\n  }\n\n  // A directory hands its entries back in whatever order the filesystem stored them.\n  const unique = [...byIdentity.values()];\n  unique.sort((a, b) => (a.path < b.path ? -1 : a.path > b.path ? 1 : 0));\n\n  return { inputs: unique, unreadable, namedDirectory };\n}\n\n/**\n * Which of two names for one recording the output should be called after.\n *\n * A name the recording actually has beats a link pointing at it, and two of a kind are\n * settled by sort order. Both are properties of the names, so the answer does not move when\n * a shell expands a glob differently or a filesystem enumerates a folder in another order.\n */\nfunction outnames(\n  candidate: { entry: Input; link: boolean },\n  held: { entry: Input; link: boolean },\n): boolean {\n  if (candidate.link !== held.link) return !candidate.link;\n  if (candidate.entry.path !== held.entry.path) return candidate.entry.path < held.entry.path;\n  /*\n    One recording, one path, two names — reached directly and through a named folder.\n\n    `edf2csv study study/night-01/rec.edf` and the same two swapped are the same request, and\n    they disagreed: the folder gives the recording its position inside the folder\n    (`night-01/rec`), a direct mention gives it its bare name (`rec`), and whichever spelling\n    the loop met first won. So argument order decided the output directory's name, and, once\n    a second `study/rec.edf` was in play, decided whether the run happened at all — the bare\n    name collides with it and the run is refused, exit 2, while the other order converts both.\n\n    The nested name wins. It is what the folder promised — \"the layout is kept: recordings in\n    sub-folders come out in sub-folders\" — and it is the one that does not collide, since\n    collapsing a recording to its bare name is what puts it on top of a sibling.\n  */\n  const depth = (entry: Input): number => entry.name.split(path.sep).length;\n  if (depth(candidate.entry) !== depth(held.entry)) return depth(candidate.entry) > depth(held.entry);\n  return candidate.entry.name < held.entry.name;\n}\n\n/**\n * Every recording under a directory, following symbolic links.\n *\n * Written by hand rather than with a recursive `readdir` because that reports a symlink as\n * a symlink and never as a file, so a linked recording was skipped without a word — and the\n * closing \"converted 3 of 3\" then described the three it had noticed rather than what was in\n * the folder. Data organised by linking recordings into a working directory is ordinary, and\n * quietly converting fewer files than were asked for is the failure this tool exists to\n * avoid. Naming the same link on the command line always worked, which made the omission\n * harder to notice rather than easier.\n *\n * Following links means they can form a cycle, so directories are recorded by their resolved\n * identity and visited once. A link to a file already reached another way is likewise\n * converted once.\n */\nasync function walk(root: string): Promise<{ files: string[]; unreadable: string[] }> {\n  const files: string[] = [];\n  const unreadable: string[] = [];\n  const seen = new Set<string>();\n  /*\n    A queue, taken from the front, and each directory's children entered in a settled order.\n\n    This was a stack popped from the back, so which of two names for one directory was\n    visited first came down to the order `readdir` happened to return them — and the loser\n    was then skipped as already seen, taking its name out of the run with it. A folder\n    holding `aaa-real/` beside `zzz-alias -> aaa-real` converted into `<out>/zzz-alias/`: the\n    link's name, chosen by a hash order that differs between filesystems. 0.4.29 settled this\n    for two names of one *file* and left the directory above it deciding by accident.\n\n    Breadth first, and each directory's sub-directories entered with real names before links\n    and alphabetically within each, so the name that survives is a property of the tree: the\n    shallowest, then the one that is not a link, then the first in sort order.\n  */\n  const queue = [root];\n  let next = 0;\n\n  while (next < queue.length) {\n    const directory = queue[next++] as string;\n    const real = await realpath(directory).catch(() => directory);\n    if (seen.has(real)) continue;\n    seen.add(real);\n\n    /*\n      A directory that cannot be listed is reported, not stepped over.\n\n      Skipping it in silence meant a folder holding three recordings, one of them inside a\n      sub-directory without read permission, converted two and said \"Converted 2 of 2\n      recordings\" — a total that agreed with itself and with nothing else. That is the same\n      failure 0.4.4 fixed for symbolic links, arriving by a different route: converting fewer\n      recordings than were asked for and reporting success.\n    */\n    let entries;\n    try {\n      entries = await readdir(directory, { withFileTypes: true });\n    } catch {\n      unreadable.push(directory);\n      continue;\n    }\n\n    // A real name before a link to the same thing, then alphabetically. The dirent describes\n    // the entry itself rather than its target, which is exactly the question here.\n    const ordered = [...entries].sort((a, b) => {\n      const link = Number(a.isSymbolicLink()) - Number(b.isSymbolicLink());\n      return link !== 0 ? link : a.name < b.name ? -1 : a.name > b.name ? 1 : 0;\n    });\n\n    for (const entry of ordered) {\n      const full = path.join(directory, entry.name);\n      // stat, not the dirent: a dirent describes the link, and what matters is its target.\n      const info = await stat(full).catch(() => null);\n      if (info === null) {\n        /*\n          Anything that cannot be inspected is reported, whatever it is called.\n\n          This used to report only names ending in `.edf` or `.bdf`, on the reasoning that a\n          broken link to something else is nobody's business. A directory carries no such\n          name. A study kept as one folder per night, with one night linked to an external\n          drive, converted the nights that were mounted and said nothing about the one that\n          was not — and because losing that input left a single recording, `--out` stopped\n          meaning \"a parent to fill\" and started meaning \"the directory to write\", so the\n          survivor landed somewhere else as well. Whether a drive happened to be mounted\n          changed both what was converted and where it went, in silence, exit 0.\n\n          The walk cannot know what was behind a link it cannot follow, which is exactly the\n          reason to say so rather than to guess.\n        */\n        unreadable.push(full);\n        continue;\n      }\n      if (info.isDirectory()) {\n        queue.push(full);\n      } else if (info.isFile() && /\\.(edf|bdf)$/iu.test(entry.name)) {\n        // Duplicates are collapsed once for the whole list in expandInputs; this only has\n        // to find them. The `seen` set here is for directory cycles.\n        files.push(full);\n      }\n    }\n  }\n  return { files, unreadable };\n}\n\n/**\n * Where each recording's output goes.\n *\n * Naming one recording, `--out` is the output directory itself, which is what it has always\n * meant. Naming a folder, or several recordings, it is a parent and each recording gets its\n * own directory inside it, because writing several recordings into one directory would have\n * them overwrite each other's `signals.csv` — the one thing a batch must not do quietly.\n *\n * With no `--out` at all, every recording converts beside itself exactly as it would have\n * done alone, so a glob behaves like the shell loop it replaces.\n *\n * What a folder means is decided by the folder, not by how much is in it. Counting the\n * recordings instead meant `edf2csv study --out csv` wrote `csv/signals.csv` while the study\n * held one night and `csv/night-01/rec/signals.csv` once it held two: adding a recording\n * moved the output of a recording that had not changed. The same count made the destination\n * depend on things no one had touched either — a night on an unmounted drive, a\n * sub-directory that could not be read — so where the data landed turned on the state of the\n * machine rather than on the command.\n */\nfunction destinationsFor(\n  inputs: readonly Input[],\n  out: string | undefined,\n  /** True when a folder was named, or more than one recording was. See `batch` in `main`. */\n  batch: boolean,\n): string[] {\n  if (out === undefined) return inputs.map((input) => defaultOutputDir(input.path));\n  if (!batch) return [out];\n  return inputs.map((input) => path.join(out, stemOf(input.name)));\n}\n\n/** A name without its extension, keeping a leading dot: `.hidden.edf` -> `.hidden`. */\nfunction stemOf(name: string): string {\n  const dot = name.lastIndexOf('.');\n  const slash = Math.max(name.lastIndexOf('/'), name.lastIndexOf('\\\\'));\n  return dot > slash + 1 ? name.slice(0, dot) : name;\n}\n\n/**\n * Refuse a batch in which two recordings would land in the same directory.\n *\n * Two files with the same name in different folders — `night-1/rec.edf` and\n * `night-2/rec.edf`, which is how recordings usually get organised — both resolve to\n * `<out>/rec`. Converting them in turn would leave one recording's data sitting under the\n * other's name with nothing to show it had happened, so the run stops before writing\n * anything at all.\n */\nfunction assertDistinct(inputs: readonly string[], destinations: readonly string[]): void {\n  /*\n    Two names that differ only in case are one directory on a filesystem that does not\n    distinguish them, which is the default on macOS and the rule on Windows.\n\n    `a/REC.edf` and `b/rec.edf` produce `<out>/REC` and `<out>/rec`. Compared exactly those\n    are different, so both went through, and with --force the second conversion wrote into\n    the directory the first had made: one directory holding one recording's `signals.csv`\n    beside the other's `signals_256hz.csv`, under a single `metadata.json` naming only one\n    of them. The run reported \"Converted 2 of 2 recordings\" and exited 0. A directory whose\n    provenance file describes a recording other than the data beside it is the one outcome\n    this tool exists to prevent.\n\n    The comparison follows the platform rather than being applied everywhere, so a\n    case-sensitive filesystem — where those really are two directories — keeps converting\n    both. A case-sensitive volume on macOS is the exception it gets wrong, and it gets it\n    wrong in the safe direction: a refusal that names both recordings, not a silent merge.\n  */\n  const foldsCase = process.platform === 'darwin' || process.platform === 'win32';\n  /*\n    macOS filesystems fold Unicode normalisation as well as case.\n\n    HFS+ and APFS compare names in a normalised form, so `café` written as e + U+0301 and\n    `café` written as U+00E9 are one directory — while remaining two different JavaScript\n    strings, which is all this guard was comparing. Two recordings whose stems differ only\n    that way therefore both passed the check and both converted into the same place:\n\n      study/café.edf   (NFC)   ->  csv/café/signals.csv\n      study/café.bdf   (NFD)   ->  csv/café/signals_256hz.csv, _128hz, _1hz\n\n    one directory holding both, under a single metadata.json naming one of them, reported as\n    \"Converted 2 of 2 recordings\" and exit 0 under --force. Without --force the second run\n    happened to hit \"already exists\", which is the accidental save rather than the check\n    doing its job — and it named the wrong problem.\n\n    Not folded on Linux, where the two names are genuinely two directories and refusing them\n    would be inventing a collision that does not exist. Windows preserves normalisation too,\n    so only darwin. This is the same platform-shaped assumption the case fold above already\n    makes, and it has the same limit: a network or removable volume that normalises while the\n    running platform does not is not covered by either.\n  */\n  const identity = (destination: string): string => {\n    const resolved = path.resolve(destination);\n    if (!foldsCase) return resolved;\n    const folded = resolved.toLowerCase();\n    return process.platform === 'darwin' ? folded.normalize('NFC') : folded;\n  };\n\n  const claimed = new Map<string, string>();\n  for (const [index, destination] of destinations.entries()) {\n    const key = identity(destination);\n    const first = claimed.get(key);\n    if (first !== undefined) {\n      throw new OptionError(\n        `\"${inputs[index]}\" and \"${first}\" would both be converted into \"${destination}\", ` +\n          `so one would overwrite the other.\\n` +\n          `Convert them separately, or rename one of them.`,\n      );\n    }\n    claimed.set(key, inputs[index] as string);\n  }\n\n  /*\n    And refuse one destination sitting inside another.\n\n    A recording named `rec.edf` beside a folder named `rec` is enough: their outputs are\n    `<out>/rec` and `<out>/rec/inner`, which are not equal, so the check above let both\n    through. What happened next depended on which conversion got there first. Each creates\n    its own directory with a single non-recursive mkdir but its parents recursively, so\n    whichever started second either claimed a directory the other had already made as a\n    parent — failing with \"already exists\" — or did not. Five runs in twenty failed that way\n    under --jobs 2, converting one recording of two; the same command succeeded the other\n    fifteen times.\n\n    Sorting first puts an ancestor next to its descendant: anything sorting between them\n    shares the same prefix, and would be caught as its own adjacent pair.\n  */\n  /*\n    Each destination is checked against its own ancestors, by name.\n\n    The first version of this sorted the resolved paths and compared neighbours, on the\n    reasoning that an ancestor and its descendant end up adjacent. They do not: the\n    separator is not the lowest character, so any sibling whose name begins with one of the\n    thirteen printable characters below '/' lands between them. With `rec.edf`, `rec!x.edf`\n    and `rec/inner.edf` in one folder, '!' sorts between `out/rec` and `out/rec/inner` and\n    the pair was never compared — three recordings converted, one of them inside another's\n    directory, reported as \"Converted 3 of 3\".\n\n    Walking up from each destination has no such gap. Output trees are shallow, so this is a\n    handful of string lookups per recording.\n  */\n  const byDestination = new Map<string, number>();\n  for (const [index, destination] of destinations.entries()) {\n    byDestination.set(identity(destination), index);\n  }\n\n  for (const [index, destination] of destinations.entries()) {\n    let ancestor = path.dirname(path.resolve(destination));\n    for (let parent = ''; ancestor !== parent; ancestor = path.dirname(ancestor)) {\n      parent = ancestor;\n      const owner = byDestination.get(identity(ancestor));\n      if (owner === undefined || owner === index) continue;\n      throw new OptionError(\n        `\"${inputs[index]}\" would be converted into \"${destination}\", which is inside ` +\n          `\"${destinations[owner]}\" — where \"${inputs[owner]}\" is converted.\\n` +\n          `One recording's output cannot sit inside another's. Convert them separately, or ` +\n          `rename one of them.`,\n      );\n    }\n  }\n}\n\n/**\n * The exit code for a run in which several files failed for different reasons.\n *\n * 2 means \"you invoked it wrong\" and 1 means \"something went wrong with a file\". When both\n * happened, 1 is the honest answer: the invocation cannot be the whole story once a file has\n * genuinely failed. With a single input there is only ever one code, so its exit status is\n * exactly what it always was.\n */\nfunction worstOf(codes: readonly number[]): number {\n  return codes.includes(EXIT_ERROR) ? EXIT_ERROR : EXIT_USAGE;\n}\n\n/**\n * Convert one recording in a separate process, and collect everything it printed.\n *\n * The arguments are rebuilt from the parsed options rather than sliced out of argv, so the\n * child receives exactly the flags this run was given and nothing that only makes sense to\n * the parent: not the other recordings, not --jobs, and not --info or --stdout, neither of\n * which reaches this path.\n */\nasync function convertInChild(\n  input: string,\n  destination: string,\n  values: Record<string, unknown>,\n  running: Map<ChildProcess, string>,\n): Promise<{\n  code: number;\n  out: string;\n  err: string;\n  report: { converted: number; warnings: number } | null;\n}> {\n  /*\n    The recording goes last, behind `--`.\n\n    As the first argument it was parsed as an option whenever its path began with a dash,\n    which `path.join` produces from a folder given as `.` — `./-lead.edf` normalises to\n    `-lead.edf`. The child then failed on a file the parent had converted happily, so the\n    same command converted two recordings serially and one under --jobs.\n  */\n  /*\n    Option values go in the `--flag=value` form, never as two arguments.\n\n    Split across two arguments, a value beginning with a dash is another option as far as the\n    child's parser is concerned: `--out ./-nightly` reached it as `--out` followed by\n    `-nightly`, and the child died on \"Option '--out' argument is ambiguous\" while the serial\n    path converted the same command without complaint. A leading dash is not exotic —\n    `path.join` produces one from a folder given as `.`, and directories get named after\n    dates and flags often enough. Same failure 0.4.19 fixed for the recording's own path, on\n    everything that carries a value rather than on the positional.\n  */\n  const args = [`--out=${destination}`];\n  /*\n    --strict is deliberately absent: it is a verdict on the whole run, and a child converting\n    one recording is not the whole run. Passing it down made each child announce \"--strict: 1\n    warning raised, so this run is reported as a failure\" about its own single file, and exit\n    1 for it, which the parent then counted as a conversion that had not happened. The parent\n    applies it once, from the counts the children report.\n  */\n  for (const flag of ['annotations-only', 'checksum', 'gzip', 'bom', 'force', 'quiet', 'json']) {\n    if (values[flag] === true) args.push(`--${flag}`);\n  }\n  for (const flag of ['start', 'duration', 'end', 'decimals', 'layout']) {\n    if (typeof values[flag] === 'string') args.push(`--${flag}=${values[flag] as string}`);\n  }\n  // --channels is repeatable, and each term is passed as given so that a label containing a\n  // comma survives: joining them back into one list would split it in the child.\n  const channels = values['channels'];\n  if (channels !== undefined) {\n    for (const term of Array.isArray(channels) ? (channels as string[]) : [String(channels)]) {\n      args.push(`--channels=${term}`);\n    }\n  }\n  args.push('--', input);\n\n  return new Promise((resolve) => {\n    const child = fork(fileURLToPath(import.meta.url), args, {\n      stdio: ['ignore', 'pipe', 'pipe', 'ipc'],\n    });\n    running.set(child, destination);\n    let out = '';\n    let err = '';\n    let report: { converted: number; warnings: number } | null = null;\n    child.on('message', (message: unknown) => {\n      const payload = (message as { edf2csv?: { converted: number; warnings: number } })?.edf2csv;\n      if (payload) report = payload;\n    });\n    child.stdout?.setEncoding('utf8').on('data', (chunk: string) => {\n      out += chunk;\n    });\n    child.stderr?.setEncoding('utf8').on('data', (chunk: string) => {\n      err += chunk;\n    });\n    child.on('error', (error) => {\n      running.delete(child);\n      resolve({ code: EXIT_ERROR, out, err: `${err}error: ${input}: ${error.message}\\n`, report });\n    });\n    child.on('close', (code, signal) => {\n      running.delete(child);\n      /*\n        A child that was killed says nothing on its way out, so the parent has to.\n\n        `code` is null when a process dies by signal, which left the parent with `code ??\n        EXIT_ERROR` — a failure with an empty `err`, so the run printed nothing but \"Converted\n        1 of 2 recordings; 1 failed.\" and stopped. Nothing said which recording, nothing said\n        why, and nothing said that its directory held a 194 MB signals.csv cut off mid-row\n        with no channels.csv beside it. That file looks exactly like a finished one to\n        anything that opens it.\n\n        The out-of-memory killer, a job scheduler's time limit and `kill` all arrive this way.\n        A run stopped from the keyboard is reported by the interrupt handler instead, which\n        names every directory at once rather than one line per child.\n      */\n      if (signal !== null && !stopping) {\n        err +=\n          `error: stopped by ${signal} before it finished.\\n` +\n          `       Incomplete, and should not be used: ${destination}\\n`;\n      }\n      resolve({ code: code ?? EXIT_ERROR, out, err, report });\n    });\n  });\n}\n\n/** Put the recording's name into the error lines a child produced. */\nfunction named(text: string, input: string): string {\n  // A function, not a string: `$&`, `$\\'`, `` $` `` and `$1` in a replacement string are\n  // patterns, and a file may legitimately be called any of them. `bad$&name.edf` re-injected\n  // the text it had just matched and reported itself as `baderror: name.edf`.\n  return text.replace(/^error: /gmu, () => `error: ${printable(input)}: `);\n}\n\n/** Re-render a child's pretty-printed summary onto one line, leaving anything else alone. */\nfunction compactJson(text: string): string {\n  const trimmed = text.trim();\n  if (trimmed === '') return '';\n  try {\n    return `${JSON.stringify(JSON.parse(trimmed))}\\n`;\n  } catch {\n    // Not the document expected; passing it through unchanged beats losing it.\n    return text;\n  }\n}\n\n/**\n * Where a conversion's output goes.\n *\n * Serial runs write straight through, which is what they have always done. Running several\n * conversions at once needs the alternative: each one's lines are collected and released in\n * a block when it finishes, so two recordings finishing together cannot interleave a summary\n * with a warning belonging to the other file.\n */\ntype Emit = (stream: 'out' | 'err', text: string) => void;\n\nconst writeThrough: Emit = (stream, text) => {\n  (stream === 'out' ? process.stdout : process.stderr).write(text);\n};\n\n/** Collects output so it can be released in one piece when a conversion finishes. */\nfunction buffered(): { emit: Emit; flush: () => void } {\n  const parts: [('out' | 'err'), string][] = [];\n  return {\n    emit: (stream, text) => parts.push([stream, text]),\n    flush: () => {\n      for (const [stream, text] of parts) writeThrough(stream, text);\n    },\n  };\n}\n\n/**\n * Report an error the way this command always has, and give the exit code it implies.\n *\n * `input` names the recording while a batch is running: several failures otherwise arrive\n * as a stack of messages with nothing saying which file each belongs to.\n */\nfunction reportError(error: unknown, input?: string, emit: Emit = writeThrough): number {\n  const where = input === undefined ? '' : `${printable(input)}: `;\n  if (error instanceof EdfError || error instanceof ConversionError) {\n    emit('err', `error: ${where}${printableLines(error.message, '       ')}\\n`);\n    if (error.hint) emit('err', `       ${error.hint}\\n`);\n    // A request the tool cannot carry out is the command line's problem, not the file's,\n    // whatever layer noticed it. See USAGE_ERROR_CODES.\n    return error instanceof ConversionError && USAGE_ERROR_CODES.has(error.code)\n      ? EXIT_USAGE\n      : EXIT_ERROR;\n  }\n  if (\n    error instanceof ChannelSelectionError ||\n    error instanceof TimeRangeError ||\n    error instanceof OptionError\n  ) {\n    emit('err', `error: ${where}${printableLines(error.message, '       ')}\\n`);\n    return EXIT_USAGE;\n  }\n  emit('err', `error: ${where}${message(error, '       ')}\\n`);\n  return EXIT_ERROR;\n}\n\n/**\n * How many conversions to run at once.\n *\n * `auto` is one per core, less one, so a long batch does not take the machine over. A batch\n * is the only place this means anything: a single recording is a single conversion however\n * many jobs are asked for.\n */\nfunction parseJobs(raw: unknown, inputs: number): number {\n  if (raw === undefined) return 1;\n  const text = String(raw).trim();\n  if (text === 'auto') return Math.max(1, Math.min(inputs, cpus().length - 1));\n  const value = Number(text);\n  if (!Number.isInteger(value) || value < 1) {\n    throw new OptionError(`--jobs must be a whole number of 1 or more, or \"auto\", got \"${text}\".`);\n  }\n  return Math.min(value, Math.max(1, inputs));\n}\n\nfunction splitChannels(raw: unknown): string[] | undefined {\n  if (raw === undefined) return undefined;\n  const list = Array.isArray(raw) ? (raw as string[]) : [String(raw)];\n  const terms = list.flatMap((entry) => entry.split(',')).map((t) => t.trim()).filter((t) => t !== '');\n  // Returning undefined here would mean \"no --channels given\" and convert everything,\n  // which is the opposite of what someone passing an empty list is asking for.\n  if (terms.length === 0) {\n    throw new OptionError('--channels was given but lists no channel names.');\n  }\n  return terms;\n}\n\nfunction optionalTime(raw: unknown, option: string): number | undefined {\n  if (raw === undefined) return undefined;\n  return parseTimeSpec(String(raw), option);\n}\n\n/** `--layout`, which is one of two words and not a guess at what was meant. */\nfunction optionalLayout(raw: unknown): 'wide' | 'long' | undefined {\n  if (raw === undefined) return undefined;\n  if (raw === 'wide' || raw === 'long') return raw;\n  throw new OptionError(`--layout must be \"wide\" or \"long\", got \"${String(raw)}\".`);\n}\n\nfunction optionalDecimals(raw: unknown): number | undefined {\n  if (raw === undefined) return undefined;\n  const text = String(raw).trim();\n  // Number('') is 0, which would quietly round every physical value to a whole number.\n  if (text === '') {\n    throw new OptionError('--decimals needs a number, for example --decimals 3.');\n  }\n  const value = Number(text);\n  if (!Number.isInteger(value) || value < 0 || value > 20) {\n    throw new OptionError(`--decimals must be a whole number between 0 and 20, got \"${String(raw)}\".`);\n  }\n  return value;\n}\n\n/*\n  Error text is escaped for the same reason --info's table is: a fatal header error quotes\n  the channel label that caused it, and that label is free text out of the file. A recording\n  declaring a negative sample count under a label containing `\\x1b[2J` cleared the reader's\n  screen on the way out.\n*/\nfunction message(error: unknown, indent = ''): string {\n  // The indent lines continuation up under an \"error: \" prefix. Usage problems print without\n  // one, alongside the usage text, so they pass nothing and stay flush left.\n  return printableLines(error instanceof Error ? error.message : String(error), indent);\n}\n\nexport { defaultOutputDir };\n\n/**\n * Whether this file was executed rather than imported.\n *\n * npm installs a bin as a symlink (node_modules/.bin/edf2csv -> ../edf2csv/dist/cli.js),\n * and that is the path `npx` runs. In that case process.argv[1] is the symlink while\n * import.meta.url is already resolved to the real file, so comparing the two directly\n * reports \"imported\" and the command silently does nothing. Both sides are resolved\n * through realpath before comparing.\n */\nfunction isMainModule(): boolean {\n  const entry = process.argv[1];\n  if (entry === undefined) return false;\n  try {\n    return realpathSync(entry) === realpathSync(fileURLToPath(import.meta.url));\n  } catch {\n    // An unreadable or deleted entry path is not a reason to refuse to run.\n    return pathToFileURL(entry).href === import.meta.url;\n  }\n}\n\nconst invokedDirectly = isMainModule();\n\nif (invokedDirectly) {\n  main(process.argv.slice(2))\n    .then((code) => {\n      process.exitCode = code;\n    })\n    .catch((error: unknown) => {\n      process.stderr.write(`error: ${message(error)}\\n`);\n      process.exitCode = EXIT_ERROR;\n    });\n}\n"]}

package/dist/convert/timing.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"timing.d.ts","sourceRoot":"","sources":["../../src/convert/timing.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AACnD,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC;AAEhD,MAAM,WAAW,oBAAoB;IACnC,YAAY,EAAE,CAAC,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC;IAChC,SAAS,EAAE,MAAM,CAAC;IAClB,kFAAkF;IAClF,oBAAoB,CAAC,EAAE,MAAM,CAAC;CAC/B;AAED;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAChC,IAAI,EAAE,OAAO,EACb,cAAc,EAAE,oBAAoB,GACnC;IAAE,MAAM,EAAE,YAAY,GAAG,IAAI,CAAC;IAAC,WAAW,EAAE,UAAU,EAAE,CAAA;CAAE,CAiN5D"}
+{"version":3,"file":"timing.d.ts","sourceRoot":"","sources":["../../src/convert/timing.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AACnD,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC;AAEhD,MAAM,WAAW,oBAAoB;IACnC,YAAY,EAAE,CAAC,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC;IAChC,SAAS,EAAE,MAAM,CAAC;IAClB,kFAAkF;IAClF,oBAAoB,CAAC,EAAE,MAAM,CAAC;CAC/B;AAED;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAChC,IAAI,EAAE,OAAO,EACb,cAAc,EAAE,oBAAoB,GACnC;IAAE,MAAM,EAAE,YAAY,GAAG,IAAI,CAAC;IAAC,WAAW,EAAE,UAAU,EAAE,CAAA;CAAE,CA+O5D"}

package/dist/convert/timing.js

@@ -184,10 +184,31 @@ export function deriveRecordStarts(file, annotationData) {
         diagnostics.push(unusableOrigin(furthest, file));
         return { starts: null, diagnostics };
     }
+    /*
+      Two ways a record can put the time column out of order, and only one was being looked for.
+  
+      A record starting before the one before it is the obvious case. The other is a record
+      starting before the one before it *ends*: starts of 0, 0.5 and 1.0 on one-second records
+      are strictly increasing, so nothing fired, and the rows still came out 0.25, 0.5, 0.75,
+      0.5 — because record 0's samples run to 0.75 while record 1 begins at 0.5. Overlapping
+      acquisition is what a device does when it re-sends a buffer, and the reader has no more
+      to say about it than about the reversed case: every sample is written, in file order,
+      with the time the file gives it.
+  
+      Contiguity is not overlap. A continuous recording has `starts[i] === starts[i-1] +
+      duration` exactly, so the comparison is made strict by a fraction of the finest interval
+      the recording can express — the same measure the origin check uses.
+    */
+    const slack = finestInterval(file) / 2;
     let outOfOrder = 0;
+    let overlapping = 0;
     for (let i = 1; i < starts.length; i++) {
-        if (starts[i] < starts[i - 1])
+        const previous = starts[i - 1];
+        const current = starts[i];
+        if (current < previous)
             outOfOrder++;
+        else if (current + slack < previous + file.header.recordDuration)
+            overlapping++;
     }
     if (outOfOrder > 0) {
         diagnostics.push({
@@ -197,6 +218,15 @@ export function deriveRecordStarts(file, annotationData) {
             hint: 'Rows are written in file order, so the time column will not increase monotonically.',
         });
     }
+    if (overlapping > 0) {
+        diagnostics.push({
+            code: 'DISCONTINUOUS',
+            severity: 'warning',
+            message: `${overlapping} data record${overlapping === 1 ? '' : 's'} start before the record ` +
+                `before ${overlapping === 1 ? 'it' : 'them'} ends, so their samples overlap in time.`,
+            hint: 'Rows are written in file order, so the time column will not increase monotonically.',
+        });
+    }
     return { starts, diagnostics };
 }
 /**

package/dist/convert/timing.js.map

@@ -1 +1 @@
-{"version":3,"file":"timing.js","sourceRoot":"","sources":["../../src/convert/timing.ts"],"names":[],"mappings":"AAUA;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAChC,IAAa,EACb,cAAoC;IAEpC,MAAM,WAAW,GAAiB,EAAE,CAAC;IAErC,IAAI,cAAc,CAAC,SAAS,GAAG,CAAC,EAAE,CAAC;QACjC,WAAW,CAAC,IAAI,CAAC;YACf,IAAI,EAAE,0BAA0B;YAChC,QAAQ,EAAE,SAAS;YACnB,OAAO,EACL,GAAG,cAAc,CAAC,SAAS,mBAAmB,cAAc,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,GAAG;gBACtG,uCAAuC;YACzC,IAAI,EAAE,2FAA2F;SAClG,CAAC,CAAC;IACL,CAAC;IAED;;;;;;;;MAQE;IACF,MAAM,eAAe,GAAG,cAAc,CAAC,oBAAoB,IAAI,CAAC,CAAC;IACjE,uFAAuF;IACvF,8CAA8C;IAC9C,IAAI,eAAe,GAAG,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,UAAU,KAAK,OAAO,EAAE,CAAC;QAC9D,MAAM,GAAG,GAAG,eAAe,KAAK,CAAC,CAAC;QAClC,WAAW,CAAC,IAAI,CAAC;YACf,IAAI,EAAE,0BAA0B;YAChC,QAAQ,EAAE,SAAS;YACnB,OAAO,EACL,GAAG,eAAe,eAAe,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,QAAQ,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,iBAAiB;gBACzF,yCAAyC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,oBAAoB;gBACxF,QAAQ,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,GAAG;YACzC,IAAI,EACF,oFAAoF;gBACpF,wEAAwE;SAC3E,CAAC,CAAC;IACL,CAAC;IAED;;;;;;;;;;;;;MAaE;IACF,IAAI,IAAI,CAAC,MAAM,CAAC,UAAU,KAAK,OAAO,EAAE,CAAC;QACvC,IAAI,IAAI,CAAC,MAAM,CAAC,UAAU,KAAK,OAAO;YAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC;QAE7E;;;;;;;;;;;;;UAaE;QACF,MAAM,MAAM,GAAG,QAAQ,CAAC,cAAc,CAAC,YAAY,EAAE,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC;QACjF,IAAI,MAAM,KAAK,IAAI,IAAI,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC;QAE1E,MAAM,UAAU,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,UAAU,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC;QAC1D,CAAC;QAED;;;;;;;;;;;;;;;;;UAiBE;QACF,MAAM,SAAS,GAAG,cAAc,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC3C,MAAM,aAAa,GAAG,cAAc,CAAC,YAAY,CAAC,MAAM,CACtD,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,CACd,OAAO,QAAQ,KAAK,QAAQ,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAI,UAAU,CAAC,CAAC,CAAY,CAAC,GAAG,SAAS,CAC7F,CAAC,MAAM,CAAC;QACT,IAAI,aAAa,GAAG,CAAC,EAAE,CAAC;YACtB,WAAW,CAAC,IAAI,CAAC;gBACf,IAAI,EAAE,eAAe;gBACrB,QAAQ,EAAE,SAAS;gBACnB,OAAO,EACL,+CAA+C,aAAa,UAAU;oBACtE,GAAG,IAAI,CAAC,WAAW,0DAA0D;oBAC7E,uBAAuB;gBACzB,IAAI,EACF,kFAAkF;oBAClF,2EAA2E;aAC9E,CAAC,CAAC;QACL,CAAC;QACD,MAAM,KAAK,GAAG,MAAM,CAAC;QACrB,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC;QACvD,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;YAC1B,WAAW,CAAC,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;YAC9C,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC;QACvC,CAAC;QACD,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,CAAC;IAC7C,CAAC;IAED,IAAI,IAAI,CAAC,iBAAiB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxC,WAAW,CAAC,IAAI,CAAC;YACf,IAAI,EAAE,eAAe;YACrB,QAAQ,EAAE,SAAS;YACnB,OAAO,EACL,gFAAgF;gBAChF,+CAA+C;YACjD,IAAI,EAAE,yEAAyE;SAChF,CAAC,CAAC;QACH,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC;IACvC,CAAC;IAED;;;;;;;;;;MAUE;IACF,MAAM,IAAI,GAAG,QAAQ,CAAC,cAAc,CAAC,YAAY,EAAE,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;IACpF,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAClD,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,MAAM,QAAQ,GAAG,cAAc,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAChD,IAAI,QAAQ,KAAK,IAAI,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAChD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChB,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC;QACpD,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;QACvB,CAAC;IACH,CAAC;IAED,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7C,WAAW,CAAC,IAAI,CAAC;YACf,IAAI,EAAE,0BAA0B;YAChC,QAAQ,EAAE,SAAS;YACnB,OAAO,EACL,GAAG,OAAO,CAAC,MAAM,OAAO,IAAI,CAAC,WAAW,8CAA8C;gBACtF,qBAAqB,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,KAAK,EAAE;gBAC/D,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,+CAA+C;YACnF,IAAI,EAAE,2FAA2F;SAClG,CAAC,CAAC;IACL,CAAC;IAED;;;;;;;;;;;;;MAaE;IACF,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,MAAM,KAAK,IAAI,MAAM;QAAE,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC;YAAE,QAAQ,GAAG,KAAK,CAAC;IACvF,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAE,CAAC;QAC9B,WAAW,CAAC,IAAI,CAAC,cAAc,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC;QACjD,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC;IACvC,CAAC;IAED,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,IAAK,MAAM,CAAC,CAAC,CAAY,GAAI,MAAM,CAAC,CAAC,GAAG,CAAC,CAAY;YAAE,UAAU,EAAE,CAAC;IACtE,CAAC;IACD,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;QACnB,WAAW,CAAC,IAAI,CAAC;YACf,IAAI,EAAE,eAAe;YACrB,QAAQ,EAAE,SAAS;YACnB,OAAO,EAAE,GAAG,UAAU,eAAe,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,2CAA2C;YAC3G,IAAI,EAAE,qFAAqF;SAC5F,CAAC,CAAC;IACL,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC;AACjC,CAAC;AAED;;;;;;GAMG;AACH,SAAS,QAAQ,CAAC,YAAwC,EAAE,cAAsB;IAChF,KAAK,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,IAAI,YAAY,CAAC,OAAO,EAAE,EAAE,CAAC;QACvD,IAAI,OAAO,QAAQ,KAAK,QAAQ;YAAE,SAAS;QAC3C,MAAM,MAAM,GAAG,QAAQ,GAAG,KAAK,GAAG,cAAc,CAAC;QACjD,OAAO,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC;IACjD,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAS,QAAQ,CAAC,MAAc,EAAE,IAAa;IAC7C,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC;QAAE,OAAO,KAAK,CAAC;IAC3C,0FAA0F;IAC1F,kFAAkF;IAClF,OAAO,MAAM,GAAG,cAAc,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC;AAChD,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,cAAc,CAAC,IAAa;IACnC,IAAI,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC;IAC1C,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;QACzC,IAAI,MAAM,CAAC,aAAa,IAAI,CAAC,CAAC,MAAM,CAAC,gBAAgB,GAAG,CAAC,CAAC;YAAE,SAAS;QACrE,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,GAAG,MAAM,CAAC,gBAAgB,CAAC;QAClE,IAAI,IAAI,GAAG,CAAC,IAAI,IAAI,GAAG,QAAQ;YAAE,QAAQ,GAAG,IAAI,CAAC;IACnD,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,SAAS,cAAc,CAAC,MAAc,EAAE,IAAa;IACnD,OAAO;QACL,IAAI,EAAE,eAAe;QACrB,QAAQ,EAAE,SAAS;QACnB,OAAO,EACL,qDAAqD,MAAM,uBAAuB;YAClF,sCAAsC,IAAI,CAAC,MAAM,CAAC,cAAc,uBAAuB;YACvF,gFAAgF;QAClF,IAAI,EACF,qFAAqF;YACrF,0FAA0F;KAC7F,CAAC;AACJ,CAAC","sourcesContent":["import type { Diagnostic } from '../edf/errors.js';\nimport type { EdfFile } from '../edf/reader.js';\n\nexport interface AnnotationTimingData {\n  recordStarts: (number | null)[];\n  malformed: number;\n  /** Unreadable TALs in first position, which carry timing rather than an event. */\n  malformedTimekeeping?: number;\n}\n\n/**\n * Resolve the true start time of every data record.\n *\n * Continuous recordings need no table because their record positions are\n * arithmetic. EDF+D recordings carry their positions in the annotation channel;\n * missing or malformed timekeeping entries are reported before falling back.\n */\nexport function deriveRecordStarts(\n  file: EdfFile,\n  annotationData: AnnotationTimingData,\n): { starts: Float64Array | null; diagnostics: Diagnostic[] } {\n  const diagnostics: Diagnostic[] = [];\n\n  if (annotationData.malformed > 0) {\n    diagnostics.push({\n      code: 'ANNOTATION_DECODE_FAILED',\n      severity: 'warning',\n      message:\n        `${annotationData.malformed} annotation entr${annotationData.malformed === 1 ? 'y was' : 'ies were'} ` +\n        `unreadable and could not be exported.`,\n      hint: 'The rest were exported normally. The file may have been written by a non-conforming tool.',\n    });\n  }\n\n  /*\n    A timekeeping TAL is not an event, and saying it \"could not be exported\" describes the\n    wrong loss twice over.\n\n    These were counted among the annotations, so a file with one unreadable timekeeping TAL\n    and three good events announced \"1 annotation entry was unreadable and could not be\n    exported\" — while exporting all three. Nothing was missing from annotations.csv; what\n    went missing was a record's position in time, which the message never mentioned.\n  */\n  const lostTimekeeping = annotationData.malformedTimekeeping ?? 0;\n  // The EDF+D branch below raises its own, which names the records and is more specific.\n  // Saying both would report one problem twice.\n  if (lostTimekeeping > 0 && file.header.continuity !== 'EDF+D') {\n    const one = lostTimekeeping === 1;\n    diagnostics.push({\n      code: 'ANNOTATION_DECODE_FAILED',\n      severity: 'warning',\n      message:\n        `${lostTimekeeping} data record${one ? '' : 's'} carr${one ? 'ies' : 'y'} a timekeeping ` +\n        `annotation that could not be read, so ${one ? 'it does' : 'they do'} not say where in ` +\n        `time ${one ? 'it sits' : 'they sit'}.`,\n      hint:\n        'No event was lost — a timekeeping annotation states a record\\'s start time and is ' +\n        'never exported. Times are derived from the records that could be read.',\n    });\n  }\n\n  /*\n    A continuous recording's records are contiguous, but the first one need not sit at zero.\n\n    EDF+ puts the header's start time and every annotation onset on one origin, and says the\n    first data record's timekeeping TAL \"always starts with +0.X\", stating the fraction of a\n    second by which that record follows it. Ignoring that fraction timed the samples from 0\n    while the events kept their true onsets, so the two ended up on origins half a second\n    apart — an event at +0.75 in a 4 Hz recording whose first TAL reads +0.5 landed on sample\n    3 instead of sample 1. The same file marked EDF+D, byte-identical but for the reserved\n    field, placed it correctly, which is what gives the omission away.\n\n    Records stay contiguous, which is what continuous means: only the origin moves. A first\n    TAL of +0 needs no table at all, and that is nearly every file.\n  */\n  if (file.header.continuity !== 'EDF+D') {\n    if (file.header.continuity !== 'EDF+C') return { starts: null, diagnostics };\n\n    /*\n      The origin comes from whichever record first states one, not from record 0 alone.\n\n      Reading only `recordStarts[0]` meant a single unreadable timekeeping TAL threw the\n      origin away and timed the whole file from zero — while records 1 and 2, saying plainly\n      that they start at 1.5s and 2.5s, went unread. A recording whose records sit at 0.5s,\n      1.5s and 2.5s came out with every sample 0.5s earlier than the file states, against\n      annotation onsets that kept their true values. That is precisely the mismatch 0.4.9\n      fixed, arriving through the one hole left in it, and the byte-identical EDF+D twin\n      timed it correctly, which is what gives it away.\n\n      Continuity is what makes this recoverable: record i sits at `origin + i * duration`,\n      so any readable record determines the origin for all of them.\n    */\n    const origin = originOf(annotationData.recordStarts, file.header.recordDuration);\n    if (origin === null || origin === 0) return { starts: null, diagnostics };\n\n    const contiguous = new Float64Array(file.recordCount);\n    for (let i = 0; i < file.recordCount; i++) {\n      contiguous[i] = origin + i * file.header.recordDuration;\n    }\n\n    /*\n      A file marked continuous whose own records disagree about it.\n\n      Nothing looked at records past the first, so an EDF+C file whose records are in fact\n      spread out was timed as though they were contiguous and said nothing. The records are\n      being read here anyway, so the contradiction costs nothing to notice — and it is the\n      file, not the reader, that has to be wrong for this to fire.\n\n      Compared against what the file can express, not for equality. 0.4.41 asked whether the\n      two doubles were the same, which they are not: a recording of 0.1s records sitting at\n      0.1, 0.2, 0.3 ... is contiguous by construction, and 0.1 + 2 * 0.1 is\n      0.30000000000000004. Two of its eight records were reported as contradicting\n      continuity, on an ordinary file — and under --strict that was a failed run. The\n      smallest interval the recording distinguishes is one sample of its fastest channel;\n      anything below half of that is arithmetic, not a gap. `canCarry` has already refused\n      origins where the double spacing swamps that interval, so the representation error is\n      under the tolerance by construction rather than by hope.\n    */\n    const tolerance = finestInterval(file) / 2;\n    const contradicting = annotationData.recordStarts.filter(\n      (declared, i) =>\n        typeof declared === 'number' && Math.abs(declared - (contiguous[i] as number)) > tolerance,\n    ).length;\n    if (contradicting > 0) {\n      diagnostics.push({\n        code: 'DISCONTINUOUS',\n        severity: 'warning',\n        message:\n          `This file is marked continuous (EDF+C), but ${contradicting} of its ` +\n          `${file.recordCount} data records say they start somewhere other than where ` +\n          `continuity puts them.`,\n        hint:\n          'Times are written as if the records were contiguous, which is what EDF+C means. ' +\n          'If the recording really has gaps, the file should have been marked EDF+D.',\n      });\n    }\n    const first = origin;\n    const last = contiguous[file.recordCount - 1] ?? first;\n    if (!canCarry(last, file)) {\n      diagnostics.push(unusableOrigin(first, file));\n      return { starts: null, diagnostics };\n    }\n    return { starts: contiguous, diagnostics };\n  }\n\n  if (file.annotationSignals.length === 0) {\n    diagnostics.push({\n      code: 'DISCONTINUOUS',\n      severity: 'warning',\n      message:\n        'This file is marked discontinuous but has no annotation channel, so where its ' +\n        'records sit in time is not recorded anywhere.',\n      hint: 'Times are written as if the records were contiguous. Any gaps are lost.',\n    });\n    return { starts: null, diagnostics };\n  }\n\n  /*\n    A record with no readable time is placed from the origin the other records establish,\n    not from zero.\n\n    `i * recordDuration` assumed the recording began at zero, which is the one thing the\n    other records are in a position to contradict: a file starting at 0.5s put its\n    unreadable record at 0.000 while its neighbours sat at 1.5s and 2.5s. The guess is still\n    a guess — a discontinuous file may have a gap exactly there — and it is still reported\n    below, but starting it from where the recording actually begins is strictly closer, and\n    it makes an EDF+D file agree with its byte-identical EDF+C twin about record 0.\n  */\n  const base = originOf(annotationData.recordStarts, file.header.recordDuration) ?? 0;\n  const starts = new Float64Array(file.recordCount);\n  const missing: number[] = [];\n  for (let i = 0; i < file.recordCount; i++) {\n    const declared = annotationData.recordStarts[i];\n    if (declared === null || declared === undefined) {\n      missing.push(i);\n      starts[i] = base + i * file.header.recordDuration;\n    } else {\n      starts[i] = declared;\n    }\n  }\n\n  if (missing.length > 0) {\n    const shown = missing.slice(0, 5).join(', ');\n    diagnostics.push({\n      code: 'ANNOTATION_DECODE_FAILED',\n      severity: 'warning',\n      message:\n        `${missing.length} of ${file.recordCount} data records carry no readable timekeeping ` +\n        `annotation (record${missing.length === 1 ? '' : 's'} ${shown}` +\n        `${missing.length > 5 ? ', …' : ''}), so their true position in time is unknown.`,\n      hint: 'Those records are timed as if they were contiguous; treat their timestamps as unreliable.',\n    });\n  }\n\n  /*\n    Furthest from zero, in either direction.\n\n    This took the signed maximum and seeded it with 0, so a recording whose records all sit\n    at negative onsets never got past the seed: `furthest` stayed 0, which any interval can\n    carry. Then the samples collapsed anyway, because the arithmetic that defeats a large\n    positive origin defeats a large negative one identically — at -1e16 seconds, adding a\n    1-second sample interval leaves the double unchanged.\n\n    A four-record recording of eight samples wrote two rows, exit 0, no warning. Its\n    byte-for-byte positive mirror wrote all eight and explained why it had to time them from\n    zero. Same file, same failure, opposite sign, opposite outcome — and the silent one is\n    the one that loses data, which is exactly what unusableOrigin exists to prevent.\n  */\n  let furthest = 0;\n  for (const start of starts) if (Math.abs(start) > Math.abs(furthest)) furthest = start;\n  if (!canCarry(furthest, file)) {\n    diagnostics.push(unusableOrigin(furthest, file));\n    return { starts: null, diagnostics };\n  }\n\n  let outOfOrder = 0;\n  for (let i = 1; i < starts.length; i++) {\n    if ((starts[i] as number) < (starts[i - 1] as number)) outOfOrder++;\n  }\n  if (outOfOrder > 0) {\n    diagnostics.push({\n      code: 'DISCONTINUOUS',\n      severity: 'warning',\n      message: `${outOfOrder} data record${outOfOrder === 1 ? '' : 's'} start earlier than the record before it.`,\n      hint: 'Rows are written in file order, so the time column will not increase monotonically.',\n    });\n  }\n\n  return { starts, diagnostics };\n}\n\n/**\n * The recording's origin, from the first record that states where it is.\n *\n * Records of a continuous recording sit end to end, so record `i` beginning at `t` puts the\n * origin at `t - i * duration`. Any one readable timekeeping TAL is therefore enough, which\n * is what stops one unreadable entry from costing the whole file its position in time.\n */\nfunction originOf(recordStarts: readonly (number | null)[], recordDuration: number): number | null {\n  for (const [index, declared] of recordStarts.entries()) {\n    if (typeof declared !== 'number') continue;\n    const origin = declared - index * recordDuration;\n    return Number.isFinite(origin) ? origin : null;\n  }\n  return null;\n}\n\n/**\n * Whether times this far out can still tell one sample from the next.\n *\n * A double spaces its values further apart the larger they get: at 1e16 the gap is 2\n * seconds, so `t + 1` is `t`. Past that point a recording's declared origin stops being a\n * position and becomes a wall — the arithmetic that places records and samples returns the\n * origin itself, whatever is added to it.\n *\n * The finest thing that has to survive is the gap between two consecutive samples of the\n * fastest channel, since that is what the time column is made of. If that survives, so does\n * a whole record.\n */\nfunction canCarry(origin: number, file: EdfFile): boolean {\n  if (!Number.isFinite(origin)) return false;\n  // Asked of the origin furthest from zero, whichever side it is on: the spacing of doubles\n  // grows with magnitude, not with value, so -1e16 and +1e16 fail this identically.\n  return origin + finestInterval(file) > origin;\n}\n\n/**\n * The shortest span this recording can tell apart: one sample of its fastest channel.\n *\n * The time column is made of these, so nothing below one is a distinction the file is in a\n * position to make — which is what makes it the right size for both the \"can this origin\n * still separate two samples\" question and the \"is this record really somewhere else\"\n * question.\n */\nfunction finestInterval(file: EdfFile): number {\n  let interval = file.header.recordDuration;\n  for (const signal of file.header.signals) {\n    if (signal.isAnnotations || !(signal.samplesPerRecord > 0)) continue;\n    const step = file.header.recordDuration / signal.samplesPerRecord;\n    if (step > 0 && step < interval) interval = step;\n  }\n  return interval;\n}\n\n/**\n * An origin the file's own arithmetic cannot express, reported rather than acted on.\n *\n * Two things went wrong when this was taken at face value, both of them quiet. A file whose\n * records all collapsed onto one instant made the recording zero seconds long, and the\n * window resolver — which had no reason to suspect the recording rather than the request —\n * blamed a flag nobody had passed:\n *\n *     error: --start 100000000000000000s is at or past the end of this\n *            100000000000000000s recording.\n *\n * Slightly below that, the collapse is partial: `records[i].start + recordDuration` equals\n * the start again, so the test for \"does this record overlap the window\" fails for every\n * record whose neighbour rounded onto it. A twelve-row recording wrote four rows, exit 0,\n * no warning — the eight that vanished looked exactly like a file that never had them.\n *\n * Timing from zero is what the file did before 0.4.9 taught it to honour the first\n * timekeeping TAL, and at this magnitude it is the only column that can hold distinct\n * values. The origin is lost, so this says so.\n */\nfunction unusableOrigin(origin: number, file: EdfFile): Diagnostic {\n  return {\n    code: 'DISCONTINUOUS',\n    severity: 'warning',\n    message:\n      `This recording's timekeeping annotations place it ${origin}s from its own start ` +\n      `date, which is too far out for its ${file.header.recordDuration}s records to be told ` +\n      `apart: at that magnitude adding a sample interval leaves the number unchanged.`,\n    hint:\n      'Sample times are written from zero instead, so every row is present and the column ' +\n      'increases. Add the onsets in annotations.csv to recover absolute times if you need them.',\n  };\n}\n"]}
+{"version":3,"file":"timing.js","sourceRoot":"","sources":["../../src/convert/timing.ts"],"names":[],"mappings":"AAUA;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAChC,IAAa,EACb,cAAoC;IAEpC,MAAM,WAAW,GAAiB,EAAE,CAAC;IAErC,IAAI,cAAc,CAAC,SAAS,GAAG,CAAC,EAAE,CAAC;QACjC,WAAW,CAAC,IAAI,CAAC;YACf,IAAI,EAAE,0BAA0B;YAChC,QAAQ,EAAE,SAAS;YACnB,OAAO,EACL,GAAG,cAAc,CAAC,SAAS,mBAAmB,cAAc,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,GAAG;gBACtG,uCAAuC;YACzC,IAAI,EAAE,2FAA2F;SAClG,CAAC,CAAC;IACL,CAAC;IAED;;;;;;;;MAQE;IACF,MAAM,eAAe,GAAG,cAAc,CAAC,oBAAoB,IAAI,CAAC,CAAC;IACjE,uFAAuF;IACvF,8CAA8C;IAC9C,IAAI,eAAe,GAAG,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,UAAU,KAAK,OAAO,EAAE,CAAC;QAC9D,MAAM,GAAG,GAAG,eAAe,KAAK,CAAC,CAAC;QAClC,WAAW,CAAC,IAAI,CAAC;YACf,IAAI,EAAE,0BAA0B;YAChC,QAAQ,EAAE,SAAS;YACnB,OAAO,EACL,GAAG,eAAe,eAAe,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,QAAQ,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,iBAAiB;gBACzF,yCAAyC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,oBAAoB;gBACxF,QAAQ,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,GAAG;YACzC,IAAI,EACF,oFAAoF;gBACpF,wEAAwE;SAC3E,CAAC,CAAC;IACL,CAAC;IAED;;;;;;;;;;;;;MAaE;IACF,IAAI,IAAI,CAAC,MAAM,CAAC,UAAU,KAAK,OAAO,EAAE,CAAC;QACvC,IAAI,IAAI,CAAC,MAAM,CAAC,UAAU,KAAK,OAAO;YAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC;QAE7E;;;;;;;;;;;;;UAaE;QACF,MAAM,MAAM,GAAG,QAAQ,CAAC,cAAc,CAAC,YAAY,EAAE,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC;QACjF,IAAI,MAAM,KAAK,IAAI,IAAI,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC;QAE1E,MAAM,UAAU,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,UAAU,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC;QAC1D,CAAC;QAED;;;;;;;;;;;;;;;;;UAiBE;QACF,MAAM,SAAS,GAAG,cAAc,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC3C,MAAM,aAAa,GAAG,cAAc,CAAC,YAAY,CAAC,MAAM,CACtD,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,CACd,OAAO,QAAQ,KAAK,QAAQ,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAI,UAAU,CAAC,CAAC,CAAY,CAAC,GAAG,SAAS,CAC7F,CAAC,MAAM,CAAC;QACT,IAAI,aAAa,GAAG,CAAC,EAAE,CAAC;YACtB,WAAW,CAAC,IAAI,CAAC;gBACf,IAAI,EAAE,eAAe;gBACrB,QAAQ,EAAE,SAAS;gBACnB,OAAO,EACL,+CAA+C,aAAa,UAAU;oBACtE,GAAG,IAAI,CAAC,WAAW,0DAA0D;oBAC7E,uBAAuB;gBACzB,IAAI,EACF,kFAAkF;oBAClF,2EAA2E;aAC9E,CAAC,CAAC;QACL,CAAC;QACD,MAAM,KAAK,GAAG,MAAM,CAAC;QACrB,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC;QACvD,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;YAC1B,WAAW,CAAC,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;YAC9C,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC;QACvC,CAAC;QACD,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,CAAC;IAC7C,CAAC;IAED,IAAI,IAAI,CAAC,iBAAiB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxC,WAAW,CAAC,IAAI,CAAC;YACf,IAAI,EAAE,eAAe;YACrB,QAAQ,EAAE,SAAS;YACnB,OAAO,EACL,gFAAgF;gBAChF,+CAA+C;YACjD,IAAI,EAAE,yEAAyE;SAChF,CAAC,CAAC;QACH,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC;IACvC,CAAC;IAED;;;;;;;;;;MAUE;IACF,MAAM,IAAI,GAAG,QAAQ,CAAC,cAAc,CAAC,YAAY,EAAE,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;IACpF,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAClD,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,MAAM,QAAQ,GAAG,cAAc,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAChD,IAAI,QAAQ,KAAK,IAAI,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAChD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChB,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC;QACpD,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;QACvB,CAAC;IACH,CAAC;IAED,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7C,WAAW,CAAC,IAAI,CAAC;YACf,IAAI,EAAE,0BAA0B;YAChC,QAAQ,EAAE,SAAS;YACnB,OAAO,EACL,GAAG,OAAO,CAAC,MAAM,OAAO,IAAI,CAAC,WAAW,8CAA8C;gBACtF,qBAAqB,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,KAAK,EAAE;gBAC/D,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,+CAA+C;YACnF,IAAI,EAAE,2FAA2F;SAClG,CAAC,CAAC;IACL,CAAC;IAED;;;;;;;;;;;;;MAaE;IACF,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,MAAM,KAAK,IAAI,MAAM;QAAE,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC;YAAE,QAAQ,GAAG,KAAK,CAAC;IACvF,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAE,CAAC;QAC9B,WAAW,CAAC,IAAI,CAAC,cAAc,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC;QACjD,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC;IACvC,CAAC;IAED;;;;;;;;;;;;;;MAcE;IACF,MAAM,KAAK,GAAG,cAAc,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACvC,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAW,CAAC;QACzC,MAAM,OAAO,GAAG,MAAM,CAAC,CAAC,CAAW,CAAC;QACpC,IAAI,OAAO,GAAG,QAAQ;YAAE,UAAU,EAAE,CAAC;aAChC,IAAI,OAAO,GAAG,KAAK,GAAG,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc;YAAE,WAAW,EAAE,CAAC;IAClF,CAAC;IACD,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;QACnB,WAAW,CAAC,IAAI,CAAC;YACf,IAAI,EAAE,eAAe;YACrB,QAAQ,EAAE,SAAS;YACnB,OAAO,EAAE,GAAG,UAAU,eAAe,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,2CAA2C;YAC3G,IAAI,EAAE,qFAAqF;SAC5F,CAAC,CAAC;IACL,CAAC;IACD,IAAI,WAAW,GAAG,CAAC,EAAE,CAAC;QACpB,WAAW,CAAC,IAAI,CAAC;YACf,IAAI,EAAE,eAAe;YACrB,QAAQ,EAAE,SAAS;YACnB,OAAO,EACL,GAAG,WAAW,eAAe,WAAW,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,2BAA2B;gBACpF,UAAU,WAAW,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,0CAA0C;YACvF,IAAI,EAAE,qFAAqF;SAC5F,CAAC,CAAC;IACL,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC;AACjC,CAAC;AAED;;;;;;GAMG;AACH,SAAS,QAAQ,CAAC,YAAwC,EAAE,cAAsB;IAChF,KAAK,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,IAAI,YAAY,CAAC,OAAO,EAAE,EAAE,CAAC;QACvD,IAAI,OAAO,QAAQ,KAAK,QAAQ;YAAE,SAAS;QAC3C,MAAM,MAAM,GAAG,QAAQ,GAAG,KAAK,GAAG,cAAc,CAAC;QACjD,OAAO,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC;IACjD,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAS,QAAQ,CAAC,MAAc,EAAE,IAAa;IAC7C,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC;QAAE,OAAO,KAAK,CAAC;IAC3C,0FAA0F;IAC1F,kFAAkF;IAClF,OAAO,MAAM,GAAG,cAAc,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC;AAChD,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,cAAc,CAAC,IAAa;IACnC,IAAI,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC;IAC1C,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;QACzC,IAAI,MAAM,CAAC,aAAa,IAAI,CAAC,CAAC,MAAM,CAAC,gBAAgB,GAAG,CAAC,CAAC;YAAE,SAAS;QACrE,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,GAAG,MAAM,CAAC,gBAAgB,CAAC;QAClE,IAAI,IAAI,GAAG,CAAC,IAAI,IAAI,GAAG,QAAQ;YAAE,QAAQ,GAAG,IAAI,CAAC;IACnD,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,SAAS,cAAc,CAAC,MAAc,EAAE,IAAa;IACnD,OAAO;QACL,IAAI,EAAE,eAAe;QACrB,QAAQ,EAAE,SAAS;QACnB,OAAO,EACL,qDAAqD,MAAM,uBAAuB;YAClF,sCAAsC,IAAI,CAAC,MAAM,CAAC,cAAc,uBAAuB;YACvF,gFAAgF;QAClF,IAAI,EACF,qFAAqF;YACrF,0FAA0F;KAC7F,CAAC;AACJ,CAAC","sourcesContent":["import type { Diagnostic } from '../edf/errors.js';\nimport type { EdfFile } from '../edf/reader.js';\n\nexport interface AnnotationTimingData {\n  recordStarts: (number | null)[];\n  malformed: number;\n  /** Unreadable TALs in first position, which carry timing rather than an event. */\n  malformedTimekeeping?: number;\n}\n\n/**\n * Resolve the true start time of every data record.\n *\n * Continuous recordings need no table because their record positions are\n * arithmetic. EDF+D recordings carry their positions in the annotation channel;\n * missing or malformed timekeeping entries are reported before falling back.\n */\nexport function deriveRecordStarts(\n  file: EdfFile,\n  annotationData: AnnotationTimingData,\n): { starts: Float64Array | null; diagnostics: Diagnostic[] } {\n  const diagnostics: Diagnostic[] = [];\n\n  if (annotationData.malformed > 0) {\n    diagnostics.push({\n      code: 'ANNOTATION_DECODE_FAILED',\n      severity: 'warning',\n      message:\n        `${annotationData.malformed} annotation entr${annotationData.malformed === 1 ? 'y was' : 'ies were'} ` +\n        `unreadable and could not be exported.`,\n      hint: 'The rest were exported normally. The file may have been written by a non-conforming tool.',\n    });\n  }\n\n  /*\n    A timekeeping TAL is not an event, and saying it \"could not be exported\" describes the\n    wrong loss twice over.\n\n    These were counted among the annotations, so a file with one unreadable timekeeping TAL\n    and three good events announced \"1 annotation entry was unreadable and could not be\n    exported\" — while exporting all three. Nothing was missing from annotations.csv; what\n    went missing was a record's position in time, which the message never mentioned.\n  */\n  const lostTimekeeping = annotationData.malformedTimekeeping ?? 0;\n  // The EDF+D branch below raises its own, which names the records and is more specific.\n  // Saying both would report one problem twice.\n  if (lostTimekeeping > 0 && file.header.continuity !== 'EDF+D') {\n    const one = lostTimekeeping === 1;\n    diagnostics.push({\n      code: 'ANNOTATION_DECODE_FAILED',\n      severity: 'warning',\n      message:\n        `${lostTimekeeping} data record${one ? '' : 's'} carr${one ? 'ies' : 'y'} a timekeeping ` +\n        `annotation that could not be read, so ${one ? 'it does' : 'they do'} not say where in ` +\n        `time ${one ? 'it sits' : 'they sit'}.`,\n      hint:\n        'No event was lost — a timekeeping annotation states a record\\'s start time and is ' +\n        'never exported. Times are derived from the records that could be read.',\n    });\n  }\n\n  /*\n    A continuous recording's records are contiguous, but the first one need not sit at zero.\n\n    EDF+ puts the header's start time and every annotation onset on one origin, and says the\n    first data record's timekeeping TAL \"always starts with +0.X\", stating the fraction of a\n    second by which that record follows it. Ignoring that fraction timed the samples from 0\n    while the events kept their true onsets, so the two ended up on origins half a second\n    apart — an event at +0.75 in a 4 Hz recording whose first TAL reads +0.5 landed on sample\n    3 instead of sample 1. The same file marked EDF+D, byte-identical but for the reserved\n    field, placed it correctly, which is what gives the omission away.\n\n    Records stay contiguous, which is what continuous means: only the origin moves. A first\n    TAL of +0 needs no table at all, and that is nearly every file.\n  */\n  if (file.header.continuity !== 'EDF+D') {\n    if (file.header.continuity !== 'EDF+C') return { starts: null, diagnostics };\n\n    /*\n      The origin comes from whichever record first states one, not from record 0 alone.\n\n      Reading only `recordStarts[0]` meant a single unreadable timekeeping TAL threw the\n      origin away and timed the whole file from zero — while records 1 and 2, saying plainly\n      that they start at 1.5s and 2.5s, went unread. A recording whose records sit at 0.5s,\n      1.5s and 2.5s came out with every sample 0.5s earlier than the file states, against\n      annotation onsets that kept their true values. That is precisely the mismatch 0.4.9\n      fixed, arriving through the one hole left in it, and the byte-identical EDF+D twin\n      timed it correctly, which is what gives it away.\n\n      Continuity is what makes this recoverable: record i sits at `origin + i * duration`,\n      so any readable record determines the origin for all of them.\n    */\n    const origin = originOf(annotationData.recordStarts, file.header.recordDuration);\n    if (origin === null || origin === 0) return { starts: null, diagnostics };\n\n    const contiguous = new Float64Array(file.recordCount);\n    for (let i = 0; i < file.recordCount; i++) {\n      contiguous[i] = origin + i * file.header.recordDuration;\n    }\n\n    /*\n      A file marked continuous whose own records disagree about it.\n\n      Nothing looked at records past the first, so an EDF+C file whose records are in fact\n      spread out was timed as though they were contiguous and said nothing. The records are\n      being read here anyway, so the contradiction costs nothing to notice — and it is the\n      file, not the reader, that has to be wrong for this to fire.\n\n      Compared against what the file can express, not for equality. 0.4.41 asked whether the\n      two doubles were the same, which they are not: a recording of 0.1s records sitting at\n      0.1, 0.2, 0.3 ... is contiguous by construction, and 0.1 + 2 * 0.1 is\n      0.30000000000000004. Two of its eight records were reported as contradicting\n      continuity, on an ordinary file — and under --strict that was a failed run. The\n      smallest interval the recording distinguishes is one sample of its fastest channel;\n      anything below half of that is arithmetic, not a gap. `canCarry` has already refused\n      origins where the double spacing swamps that interval, so the representation error is\n      under the tolerance by construction rather than by hope.\n    */\n    const tolerance = finestInterval(file) / 2;\n    const contradicting = annotationData.recordStarts.filter(\n      (declared, i) =>\n        typeof declared === 'number' && Math.abs(declared - (contiguous[i] as number)) > tolerance,\n    ).length;\n    if (contradicting > 0) {\n      diagnostics.push({\n        code: 'DISCONTINUOUS',\n        severity: 'warning',\n        message:\n          `This file is marked continuous (EDF+C), but ${contradicting} of its ` +\n          `${file.recordCount} data records say they start somewhere other than where ` +\n          `continuity puts them.`,\n        hint:\n          'Times are written as if the records were contiguous, which is what EDF+C means. ' +\n          'If the recording really has gaps, the file should have been marked EDF+D.',\n      });\n    }\n    const first = origin;\n    const last = contiguous[file.recordCount - 1] ?? first;\n    if (!canCarry(last, file)) {\n      diagnostics.push(unusableOrigin(first, file));\n      return { starts: null, diagnostics };\n    }\n    return { starts: contiguous, diagnostics };\n  }\n\n  if (file.annotationSignals.length === 0) {\n    diagnostics.push({\n      code: 'DISCONTINUOUS',\n      severity: 'warning',\n      message:\n        'This file is marked discontinuous but has no annotation channel, so where its ' +\n        'records sit in time is not recorded anywhere.',\n      hint: 'Times are written as if the records were contiguous. Any gaps are lost.',\n    });\n    return { starts: null, diagnostics };\n  }\n\n  /*\n    A record with no readable time is placed from the origin the other records establish,\n    not from zero.\n\n    `i * recordDuration` assumed the recording began at zero, which is the one thing the\n    other records are in a position to contradict: a file starting at 0.5s put its\n    unreadable record at 0.000 while its neighbours sat at 1.5s and 2.5s. The guess is still\n    a guess — a discontinuous file may have a gap exactly there — and it is still reported\n    below, but starting it from where the recording actually begins is strictly closer, and\n    it makes an EDF+D file agree with its byte-identical EDF+C twin about record 0.\n  */\n  const base = originOf(annotationData.recordStarts, file.header.recordDuration) ?? 0;\n  const starts = new Float64Array(file.recordCount);\n  const missing: number[] = [];\n  for (let i = 0; i < file.recordCount; i++) {\n    const declared = annotationData.recordStarts[i];\n    if (declared === null || declared === undefined) {\n      missing.push(i);\n      starts[i] = base + i * file.header.recordDuration;\n    } else {\n      starts[i] = declared;\n    }\n  }\n\n  if (missing.length > 0) {\n    const shown = missing.slice(0, 5).join(', ');\n    diagnostics.push({\n      code: 'ANNOTATION_DECODE_FAILED',\n      severity: 'warning',\n      message:\n        `${missing.length} of ${file.recordCount} data records carry no readable timekeeping ` +\n        `annotation (record${missing.length === 1 ? '' : 's'} ${shown}` +\n        `${missing.length > 5 ? ', …' : ''}), so their true position in time is unknown.`,\n      hint: 'Those records are timed as if they were contiguous; treat their timestamps as unreliable.',\n    });\n  }\n\n  /*\n    Furthest from zero, in either direction.\n\n    This took the signed maximum and seeded it with 0, so a recording whose records all sit\n    at negative onsets never got past the seed: `furthest` stayed 0, which any interval can\n    carry. Then the samples collapsed anyway, because the arithmetic that defeats a large\n    positive origin defeats a large negative one identically — at -1e16 seconds, adding a\n    1-second sample interval leaves the double unchanged.\n\n    A four-record recording of eight samples wrote two rows, exit 0, no warning. Its\n    byte-for-byte positive mirror wrote all eight and explained why it had to time them from\n    zero. Same file, same failure, opposite sign, opposite outcome — and the silent one is\n    the one that loses data, which is exactly what unusableOrigin exists to prevent.\n  */\n  let furthest = 0;\n  for (const start of starts) if (Math.abs(start) > Math.abs(furthest)) furthest = start;\n  if (!canCarry(furthest, file)) {\n    diagnostics.push(unusableOrigin(furthest, file));\n    return { starts: null, diagnostics };\n  }\n\n  /*\n    Two ways a record can put the time column out of order, and only one was being looked for.\n\n    A record starting before the one before it is the obvious case. The other is a record\n    starting before the one before it *ends*: starts of 0, 0.5 and 1.0 on one-second records\n    are strictly increasing, so nothing fired, and the rows still came out 0.25, 0.5, 0.75,\n    0.5 — because record 0's samples run to 0.75 while record 1 begins at 0.5. Overlapping\n    acquisition is what a device does when it re-sends a buffer, and the reader has no more\n    to say about it than about the reversed case: every sample is written, in file order,\n    with the time the file gives it.\n\n    Contiguity is not overlap. A continuous recording has `starts[i] === starts[i-1] +\n    duration` exactly, so the comparison is made strict by a fraction of the finest interval\n    the recording can express — the same measure the origin check uses.\n  */\n  const slack = finestInterval(file) / 2;\n  let outOfOrder = 0;\n  let overlapping = 0;\n  for (let i = 1; i < starts.length; i++) {\n    const previous = starts[i - 1] as number;\n    const current = starts[i] as number;\n    if (current < previous) outOfOrder++;\n    else if (current + slack < previous + file.header.recordDuration) overlapping++;\n  }\n  if (outOfOrder > 0) {\n    diagnostics.push({\n      code: 'DISCONTINUOUS',\n      severity: 'warning',\n      message: `${outOfOrder} data record${outOfOrder === 1 ? '' : 's'} start earlier than the record before it.`,\n      hint: 'Rows are written in file order, so the time column will not increase monotonically.',\n    });\n  }\n  if (overlapping > 0) {\n    diagnostics.push({\n      code: 'DISCONTINUOUS',\n      severity: 'warning',\n      message:\n        `${overlapping} data record${overlapping === 1 ? '' : 's'} start before the record ` +\n        `before ${overlapping === 1 ? 'it' : 'them'} ends, so their samples overlap in time.`,\n      hint: 'Rows are written in file order, so the time column will not increase monotonically.',\n    });\n  }\n\n  return { starts, diagnostics };\n}\n\n/**\n * The recording's origin, from the first record that states where it is.\n *\n * Records of a continuous recording sit end to end, so record `i` beginning at `t` puts the\n * origin at `t - i * duration`. Any one readable timekeeping TAL is therefore enough, which\n * is what stops one unreadable entry from costing the whole file its position in time.\n */\nfunction originOf(recordStarts: readonly (number | null)[], recordDuration: number): number | null {\n  for (const [index, declared] of recordStarts.entries()) {\n    if (typeof declared !== 'number') continue;\n    const origin = declared - index * recordDuration;\n    return Number.isFinite(origin) ? origin : null;\n  }\n  return null;\n}\n\n/**\n * Whether times this far out can still tell one sample from the next.\n *\n * A double spaces its values further apart the larger they get: at 1e16 the gap is 2\n * seconds, so `t + 1` is `t`. Past that point a recording's declared origin stops being a\n * position and becomes a wall — the arithmetic that places records and samples returns the\n * origin itself, whatever is added to it.\n *\n * The finest thing that has to survive is the gap between two consecutive samples of the\n * fastest channel, since that is what the time column is made of. If that survives, so does\n * a whole record.\n */\nfunction canCarry(origin: number, file: EdfFile): boolean {\n  if (!Number.isFinite(origin)) return false;\n  // Asked of the origin furthest from zero, whichever side it is on: the spacing of doubles\n  // grows with magnitude, not with value, so -1e16 and +1e16 fail this identically.\n  return origin + finestInterval(file) > origin;\n}\n\n/**\n * The shortest span this recording can tell apart: one sample of its fastest channel.\n *\n * The time column is made of these, so nothing below one is a distinction the file is in a\n * position to make — which is what makes it the right size for both the \"can this origin\n * still separate two samples\" question and the \"is this record really somewhere else\"\n * question.\n */\nfunction finestInterval(file: EdfFile): number {\n  let interval = file.header.recordDuration;\n  for (const signal of file.header.signals) {\n    if (signal.isAnnotations || !(signal.samplesPerRecord > 0)) continue;\n    const step = file.header.recordDuration / signal.samplesPerRecord;\n    if (step > 0 && step < interval) interval = step;\n  }\n  return interval;\n}\n\n/**\n * An origin the file's own arithmetic cannot express, reported rather than acted on.\n *\n * Two things went wrong when this was taken at face value, both of them quiet. A file whose\n * records all collapsed onto one instant made the recording zero seconds long, and the\n * window resolver — which had no reason to suspect the recording rather than the request —\n * blamed a flag nobody had passed:\n *\n *     error: --start 100000000000000000s is at or past the end of this\n *            100000000000000000s recording.\n *\n * Slightly below that, the collapse is partial: `records[i].start + recordDuration` equals\n * the start again, so the test for \"does this record overlap the window\" fails for every\n * record whose neighbour rounded onto it. A twelve-row recording wrote four rows, exit 0,\n * no warning — the eight that vanished looked exactly like a file that never had them.\n *\n * Timing from zero is what the file did before 0.4.9 taught it to honour the first\n * timekeeping TAL, and at this magnitude it is the only column that can hold distinct\n * values. The origin is lost, so this says so.\n */\nfunction unusableOrigin(origin: number, file: EdfFile): Diagnostic {\n  return {\n    code: 'DISCONTINUOUS',\n    severity: 'warning',\n    message:\n      `This recording's timekeeping annotations place it ${origin}s from its own start ` +\n      `date, which is too far out for its ${file.header.recordDuration}s records to be told ` +\n      `apart: at that magnitude adding a sample interval leaves the number unchanged.`,\n    hint:\n      'Sample times are written from zero instead, so every row is present and the column ' +\n      'increases. Add the onsets in annotations.csv to recover absolute times if you need them.',\n  };\n}\n"]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "edf2csv",
-  "version": "0.5.24",
+  "version": "0.5.27",
   "description": "Convert EDF, EDF+ and BDF biosignal recordings (European Data Format) to CSV from the command line. Local, streaming, and never resamples or alters units.",
   "keywords": [
     "edf",