edf2csv 0.5.53 → 0.5.55

package/CHANGELOG.md

@@ -3,6 +3,58 @@
 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.55
+
+### Fixed: a duration that could not be read was exported as a duration nobody wrote
+
+`duration_s` is empty in annotations.csv when the event carries no duration, and the
+documentation says so on three pages. The decoder produced the same empty cell for a TAL that
+stated a duration which is not a number — `Number('abc')` is NaN, NaN became `null`, and
+`null` is what an absent duration is. So
+
+```
+onset_s,duration_s,description,record_index
+0.25,,duration-was-given,0
+0.5,,no-duration-given,0
+```
+
+two rows that the file distinguishes and the CSV does not, with nothing on stderr and no
+diagnostic in metadata.json. The onset is already held to a stricter standard: one that is
+not a number costs the whole TAL and raises ANNOTATION_DECODE_FAILED. A duration is one field
+of an otherwise perfectly readable event, so losing the event over it would be the wrong
+trade — but losing it in silence is not the alternative.
+
+Counted now, and reported: "1 annotation states a duration that is not a number, so its
+duration_s cell is empty", with a hint saying the onset and description were read normally
+and that these rows cannot be told apart from the ones whose file gave no duration. Counted
+per row rather than per TAL, since one TAL may carry several texts and each becomes a row
+with the same empty cell. A recording whose durations are all readable or all absent stays
+silent, which is nearly all of them.
+
+## 0.5.54
+
+### Fixed: a recording with no channels was told its channels carry no samples
+
+`signals.csv` is not written when there is nothing to put in it, and the run says so. There
+are two ways to get there, and the warning gave the reason for one of them in both cases.
+
+Converting a recording that holds nothing but EDF+ annotations printed, directly beneath a
+warning saying the file has no signal channels: "every channel selected carries zero samples
+per data record", "channels.csv still describes them", and "Run with --info to see which
+channels do carry samples". No channel was selected, because there are none to select; its
+channels.csv is a header row and nothing else, so it describes nothing; and `--info` on that
+file prints an empty channel table. Three statements about channels, on a file with none.
+
+The other two paths already had this right. `--stdout` on the same recording distinguishes
+the two cases and says "this recording has no signal channels, only EDF+ annotations";
+`--info` says "Would write annotations.csv and channels.csv, and no signal data". Only the
+conversion path did not.
+
+It says "there is no signal data in this recording to put in one" now, pointing at
+annotations.csv for the events and explaining that channels.csv lists signal channels and so
+has none to list — both checkable, and both checked. Selecting a channel that carries no
+samples keeps the original wording, which is true of that case and was only ever true of it.
+
 ## 0.5.53
 
 ### Fixed: the correctness page's layout sweep disagreed with itself about how many recordings it ran

package/dist/convert/run.js

@@ -151,14 +151,30 @@ export async function convert(inputPath, options = {}) {
               signals.csv at all. The NO_SAMPLES warning explains the channel; nothing explained the
               missing file, and the documentation says signals.csv is written unless
               --annotations-only was passed. Someone looking for it should be told where it went.
+      
+              There are two ways to arrive with no groups, and the wording above is only true of
+              one of them. A recording that holds nothing but EDF+ annotations has no channel that
+              could have been selected, its channels.csv is a header row and nothing else, and no
+              channel of it carries samples — so "every channel selected", "channels.csv still
+              describes them" and "which channels do carry samples" were three false statements in
+              one warning, printed under a warning that had just said the file has no signal
+              channels. `--stdout` distinguishes the two cases a few lines up and `--info` prints
+              one accurate line; this path was the only one that did not.
             */
+            const noChannelsAtAll = file.dataSignals.length === 0;
             plan.diagnostics.push({
                 code: 'NO_SAMPLES',
                 severity: 'warning',
-                message: 'No signal file was written: every channel selected carries zero samples per data ' +
-                    'record, so there is nothing to put in one.',
-                hint: 'channels.csv still describes them. Run with --info to see which channels do carry ' +
-                    'samples.',
+                message: noChannelsAtAll
+                    ? 'No signal file was written: there is no signal data in this recording to put in ' +
+                        'one.'
+                    : 'No signal file was written: every channel selected carries zero samples per data ' +
+                        'record, so there is nothing to put in one.',
+                hint: noChannelsAtAll
+                    ? 'annotations.csv holds whatever events it carries. channels.csv lists signal ' +
+                        'channels, so it has none to list.'
+                    : 'channels.csv still describes them. Run with --info to see which channels do carry ' +
+                        'samples.',
             });
         }
         if (options.annotationsOnly === true && file.annotationSignals.length === 0) {

package/dist/convert/run.js.map

@@ -1 +1 @@
-{"version":3,"file":"run.js","sourceRoot":"","sources":["../../src/convert/run.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,iBAAiB,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AACvD,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AACnE,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,gBAAgB,EAAE,MAAM,SAAS,CAAC;AAC3C,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAE1D,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AACjD,OAAO,IAAI,MAAM,WAAW,CAAC;AAG7B,OAAO,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC;AAC3C,OAAO,EAAE,cAAc,EAAE,WAAW,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAEhF,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAE5C,OAAO,EACL,kBAAkB,EAClB,uBAAuB,EACvB,QAAQ,EACR,MAAM,EACN,cAAc,GACf,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAC3C,OAAO,EACL,KAAK,EACL,mBAAmB,EACnB,iBAAiB,EACjB,eAAe,EACf,oBAAoB,GACrB,MAAM,qBAAqB,CAAC;AAE7B,OAAO,EAAE,SAAS,EAAE,sBAAsB,EAAE,MAAM,WAAW,CAAC;AAE9D,OAAO,EAAE,kBAAkB,EAAE,MAAM,aAAa,CAAC;AACjD,OAAO,EAAE,mBAAmB,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AACpE,OAAO,EAAE,OAAO,IAAI,YAAY,EAAE,MAAM,eAAe,CAAC;AAExD,OAAO,EAAE,YAAY,EAAE,CAAC;AAWxB;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAqC,IAAI,GAAG,CAAC,CAAC,qBAAqB,CAAC,CAAC,CAAC;AAEpG,MAAM,OAAO,eAAgB,SAAQ,KAAK;IAC/B,IAAI,CAAsB;IAC1B,IAAI,CAAqB;IAClC,YAAY,IAAyB,EAAE,OAAe,EAAE,IAAa,EAAE,OAAsB;QAC3F,KAAK,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QACxB,IAAI,CAAC,IAAI,GAAG,iBAAiB,CAAC;QAC9B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;CACF;AA4DD,MAAM,CAAC,KAAK,UAAU,OAAO,CAAC,SAAiB,EAAE,UAA0B,EAAE;IAC3E,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAC7B,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAE3C,IAAI,CAAC;QACH;;;;;;;;;;;;;;UAcE;QACF,MAAM,cAAc,GAAG,OAAO,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;QAE9E,+EAA+E;QAC/E,8EAA8E;QAC9E,iFAAiF;QACjF,wCAAwC;QACxC,MAAM,cAAc,GAClB,IAAI,CAAC,iBAAiB,CAAC,MAAM,GAAG,CAAC;YAC/B,CAAC,CAAC,MAAM,IAAI,CAAC,eAAe,EAAE;YAC9B,CAAC,CAAC,EAAE,WAAW,EAAE,EAAkB,EAAE,YAAY,EAAE,EAAuB,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC;QAE/F,MAAM,MAAM,GAAG,kBAAkB,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;QAExD,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,OAAO,CACR,CAAC;QACF,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC;QAE7C,IAAI,OAAO,CAAC,QAAQ,KAAK,IAAI,EAAE,CAAC;YAC9B,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC;gBACvB,MAAM,IAAI,eAAe,CACvB,qBAAqB,EACrB,4EAA4E,EAC5E,4BAA4B,CAC7B,CAAC;YACJ,CAAC;YACD;;;;;;;;;;;;cAYE;YACF,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC7B,MAAM,IAAI,eAAe,CACvB,qBAAqB,EACrB,IAAI,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC;oBAC3B,CAAC,CAAC,+EAA+E;wBAC/E,wBAAwB;oBAC1B,CAAC,CAAC,kFAAkF,EACtF,IAAI,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC;oBAC3B,CAAC,CAAC,sEAAsE;oBACxE,CAAC,CAAC,+EAA+E,CACpF,CAAC;YACJ,CAAC;YAED,oFAAoF;YACpF,IAAI,IAAI,CAAC,MAAM,KAAK,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACvD,MAAM,IAAI,eAAe,CACvB,qBAAqB;gBACrB,iFAAiF;gBACjF,+EAA+E;gBAC/E,gFAAgF;gBAChF,0DAA0D;gBAC1D,iEAAiE,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI;oBACrF,8CAA8C;oBAC9C,IAAI,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,EACnF,gFAAgF;oBAC9E,+CAA+C,CAClD,CAAC;YACJ,CAAC;YACD,IAAI,YAAY,GAAG,KAAK,CAAC;YACzB,MAAM,OAAO,GAAG,MAAM,gBAAgB,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC,MAAM,EAAE,EAAE;gBAC1F,YAAY,GAAG,MAAM,CAAC;YACxB,CAAC,CAAC,CAAC;YACH,IAAI,MAAM,IAAI,CAAC,gBAAgB,EAAE;gBAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC;YAC9E,OAAO;gBACL,SAAS,EAAE,GAAG;gBACd,KAAK,EAAE,OAAO;gBACd,YAAY;gBACZ,eAAe,EAAE,CAAC;gBAClB,WAAW,EAAE,CAAC,GAAG,sBAAsB,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC;gBAC/E,IAAI;gBACJ,IAAI;gBACJ,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;aAClC,CAAC;QACJ,CAAC;QAED,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,gBAAgB,CAAC,SAAS,CAAC,CAAC;QACnE,MAAM,gCAAgC,CAAC,SAAS,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;QAClF,MAAM,gBAAgB,CAAC,SAAS,EAAE,OAAO,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC;QAE1D,MAAM,OAAO,GAAkB,EAAE,CAAC;QAElC,IAAI,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAChD,MAAM,OAAO,GAAG,MAAM,gBAAgB,CAAC,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;YACtF,OAAO,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC;QAC3B,CAAC;aAAM,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YAC7B;;;;;;;;cAQE;YACF,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC;gBACpB,IAAI,EAAE,YAAY;gBAClB,QAAQ,EAAE,SAAS;gBACnB,OAAO,EACL,mFAAmF;oBACnF,4CAA4C;gBAC9C,IAAI,EACF,oFAAoF;oBACpF,UAAU;aACb,CAAC,CAAC;QACL,CAAC;QAED,IAAI,OAAO,CAAC,eAAe,KAAK,IAAI,IAAI,IAAI,CAAC,iBAAiB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5E,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC;gBACpB,IAAI,EAAE,gBAAgB;gBACtB,QAAQ,EAAE,SAAS;gBACnB,OAAO,EACL,iFAAiF;oBACjF,mCAAmC;gBACrC,IAAI,EAAE,8FAA8F;aACrG,CAAC,CAAC;QACL,CAAC;QAED,IAAI,kBAAkB,GAAG,CAAC,CAAC;QAC3B,IAAI,IAAI,CAAC,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtC,MAAM,MAAM,GAAG,MAAM,mBAAmB,CACtC,SAAS,EACT,cAAc,CAAC,WAAW,EAC1B,yBAAyB,CAAC,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,qBAAqB,CAAC,EACpE,OAAO,CAAC,IAAI,KAAK,IAAI,EACrB,OAAO,CAAC,GAAG,KAAK,IAAI,CACrB,CAAC;YACF,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACrB,kBAAkB,GAAG,MAAM,CAAC,IAAI,CAAC;QACnC,CAAC;QAED,OAAO,CAAC,IAAI,CACV,MAAM,gBAAgB,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,KAAK,IAAI,EAAE,OAAO,CAAC,GAAG,KAAK,IAAI,CAAC,CAC3F,CAAC;QAEF;;;;;;;;UAQE;QACF,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,gBAAgB,EAAE,CAAC;QAC9C,IAAI,OAAO;YAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC;QAE5E,MAAM,aAAa,CACjB,SAAS,EACT,SAAS,EACT,IAAI,EACJ,IAAI,EACJ,OAAO,EACP,kBAAkB,EAClB,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,cAAc,CAChC,CAAC;QAEF,MAAM,KAAK,GAAG,MAAM,eAAe,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QAExD,OAAO;YACL,SAAS;YACT,KAAK,EAAE,OAAO;YACd,YAAY,EAAE,KAAK;YACnB,eAAe,EAAE,kBAAkB;YACnC,WAAW,EAAE,CAAC,GAAG,sBAAsB,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,GAAG,IAAI,CAAC,WAAW,EAAE,GAAG,KAAK,CAAC;YACzF,IAAI;YACJ,IAAI;YACJ,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;SAClC,CAAC;IACJ,CAAC;YAAS,CAAC;QACT,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;IACrB,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;;;;;EAgBE;AACF,MAAM,cAAc,GAClB,6GAA6G,CAAC;AAEhH;;;;;;;GAOG;AACH,KAAK,UAAU,eAAe,CAC5B,SAAiB,EACjB,OAA+B;IAE/B,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,SAAS,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;IAC3D,IAAI,CAAC,OAAO;QAAE,OAAO,EAAE,CAAC;IAExB,qFAAqF;IACrF,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC;IACxE,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAC7F,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAElC,OAAO;QACL;YACE,IAAI,EAAE,cAAc;YACpB,QAAQ,EAAE,SAAS;YACnB,OAAO,EACL,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,6BAA6B;gBACrF,sCAAsC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,iBAAiB;YAC5F,IAAI,EAAE,sFAAsF;SAC7F;KACF,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,gBAAgB,CAAC,SAAiB;IAChD,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC;IAC/D,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,GAAG,IAAI,MAAM,CAAC,CAAC;AAC3D,CAAC;AAED,yFAAyF;AACzF,KAAK,UAAU,gCAAgC,CAC7C,SAAiB,EACjB,SAAiB,EACjB,IAAa,EACb,IAAoB,EACpB,OAAuB;IAEvB;;;;;;;;MAQE;IACF,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC;IAC1D,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC;IAClE,IAAI,IAAI,CAAC,iBAAiB,CAAC,MAAM,GAAG,CAAC;QAAE,KAAK,CAAC,GAAG,CAAC,cAAc,MAAM,EAAE,CAAC,CAAC;IACzE,KAAK,CAAC,GAAG,CAAC,WAAW,MAAM,EAAE,CAAC,CAAC;IAC/B,KAAK,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC;IAE3B,MAAM,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;IAC9C,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,CAAC;IAExC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;QAC1C,MAAM,cAAc,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAC5C,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;QACxD,MAAM,QAAQ,GAAG,cAAc,KAAK,aAAa,CAAC;QAClD,MAAM,QAAQ,GACZ,UAAU,KAAK,IAAI,IAAI,UAAU,CAAC,GAAG,KAAK,SAAS,CAAC,GAAG,IAAI,UAAU,CAAC,GAAG,KAAK,SAAS,CAAC,GAAG,CAAC;QAC9F,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ;YAAE,SAAS;QAErC,MAAM,IAAI,eAAe,CACvB,wBAAwB,EACxB,gBAAgB,MAAM,4CAA4C,EAClE,qEAAqE,CACtE,CAAC;IACJ,CAAC;AACH,CAAC;AAED,KAAK,UAAU,gBAAgB,CAAC,GAAW,EAAE,KAAc;IACzD;;;;;;;;;;;;MAYE;IACF,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACjC,IAAI,MAAM,IAAI,MAAM,KAAK,GAAG,EAAE,CAAC;QAC7B,IAAI,CAAC;YACH,MAAM,KAAK,CAAC,MAAM,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAC3C,CAAC;QAAC,OAAO,KAAc,EAAE,CAAC;YACxB,oFAAoF;YACpF,4EAA4E;YAC5E,yEAAyE;YACzE,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;YAClD,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;gBAChC,MAAM,IAAI,eAAe,CACvB,mBAAmB,EACnB,kBAAkB,GAAG,OAAO,MAAM,+BAA+B,EACjE,4EAA4E,CAC7E,CAAC;YACJ,CAAC;YACD,MAAM,IAAI,eAAe,CACvB,mBAAmB,EACnB,kBAAkB,GAAG,MAAM,eAAe,CAAC,KAAK,CAAC,GAAG,EACpD,oEAAoE,CACrE,CAAC;QACJ,CAAC;IACH,CAAC;IAED,IAAI,OAAO,GAAG,IAAI,CAAC;IACnB,IAAI,CAAC;QACH,MAAM,KAAK,CAAC,GAAG,CAAC,CAAC;IACnB,CAAC;IAAC,OAAO,KAAc,EAAE,CAAC;QACxB,IAAK,KAA+B,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YACvD,MAAM,IAAI,eAAe,CACvB,mBAAmB,EACnB,kBAAkB,GAAG,MAAM,eAAe,CAAC,KAAK,CAAC,GAAG,EACpD,oEAAoE,CACrE,CAAC;QACJ,CAAC;QACD,OAAO,GAAG,KAAK,CAAC;IAClB,CAAC;IAED,IAAI,CAAC,OAAO,EAAE,CAAC;QACb,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;QAEnD,2EAA2E;QAC3E,+EAA+E;QAC/E,IAAI,QAAQ,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE,EAAE,CAAC;YACxC,MAAM,IAAI,eAAe,CACvB,mBAAmB,EACnB,IAAI,GAAG,wDAAwD,EAC/D,gCAAgC,CACjC,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,MAAM,IAAI,eAAe,CACvB,eAAe,EACf,IAAI,GAAG,mBAAmB,EAC1B,yEAAyE,CAC1E,CAAC;QACJ,CAAC;IACH,CAAC;AACH,CAAC;AAED,uEAAuE;AACvE,SAAS,eAAe,CAAC,KAAc;IACrC,MAAM,IAAI,GAAI,KAA2C,EAAE,IAAI,CAAC;IAChE,IAAI,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,OAAO;QAAE,OAAO,mBAAmB,CAAC;IACtE,IAAI,IAAI,KAAK,QAAQ;QAAE,OAAO,kBAAkB,CAAC;IACjD,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,6CAA6C,CAAC;IAC7E,IAAI,IAAI,KAAK,OAAO;QAAE,OAAO,6BAA6B,CAAC;IAC3D,IAAI,IAAI,KAAK,cAAc;QAAE,OAAO,sBAAsB,CAAC;IAC3D,OAAO,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AAChE,CAAC;AAED,KAAK,UAAU,gBAAgB,CAC7B,IAAa,EACb,IAAoB,EACpB,SAAwB,EACxB,YAAiC,EACjC,OAAuB,EACvB,QAAoC;IAEpC,sFAAsF;IACtF,MAAM,OAAO,GAAG,eAAe,EAAE,CAAC;IAClC,8EAA8E;IAC9E,MAAM,YAAY,GAAG,oBAAoB,EAAE,CAAC;IAC5C,yFAAyF;IACzF,yDAAyD;IACzD,MAAM,KAAK,GAAG,SAAS,KAAK,IAAI,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IACxD;;;;MAIE;IACF,IAAI,MAAM,GAKC,IAAI,CAAC;IAEhB;;;;;;;;;;;;MAYE;IACF,MAAM,mBAAmB,GAAG,CAAC,GAAG,IAAI,CAAC;IACrC,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAC7B,mBAAmB,EACnB,IAAI,CAAC,KAAK,CAAC,uBAAuB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CACtE,CAAC;IACF;;;;;;;MAOE;IACF,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAC3B,EAAE,GAAG,IAAI,EACT,IAAI,CAAC,KAAK,CAAC,uBAAuB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CACtE,CAAC;IAEF,MAAM,IAAI,GAAgB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,UAAU,EAAE,EAAE;QAC9D,sFAAsF;QACtF,gFAAgF;QAChF,MAAM,MAAM,GACV,MAAM,EAAE,MAAM;YACd,CAAC,SAAS,KAAK,IAAI;gBACjB,CAAC,CAAC,OAAO,CAAC,MAAM;gBAChB,CAAC,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,KAAK,CAAC,QAAQ,CAAC,EAAE;oBACtD,aAAa,EAAE,YAAY;iBAC5B,CAAC,CAAC,CAAC;QACV,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,MAAM,IAAI,UAAU,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;QAChF;;;;;;;;;;;;;;UAcE;QACF,IAAI,KAAK,IAAI,MAAM,KAAK,MAAM,IAAI,CAAC,MAAM,EAAE,CAAC;YAC1C,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,KAAa,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;QAClE,CAAC;QACD;;;;;;UAME;QACF,MAAM,MAAM,GAAG,MAAM,EAAE,MAAM,IAAI,IAAI,kBAAkB,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;QAChF,IAAI,IAAI,CAAC,MAAM,KAAK,MAAM,IAAI,CAAC,MAAM;YAAE,MAAM,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;QAEpF,oFAAoF;QACpF,IAAI,IAAI,CAAC,MAAM,KAAK,MAAM,IAAI,UAAU,KAAK,CAAC,EAAE,CAAC;YAC/C,IAAI,OAAO,CAAC,GAAG,KAAK,IAAI;gBAAE,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAChD,MAAM,CAAC,QAAQ,CACb,IAAI,CAAC,MAAM,KAAK,MAAM;gBACpB,CAAC,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;gBACxC,CAAC,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAC/D,CAAC;QACJ,CAAC;QACD,OAAO;YACL,KAAK;YACL,MAAM;YACN,UAAU,EAAE,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,mBAAmB,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;YAC9F,UAAU,EAAE,iBAAiB,CAC3B,KAAK,CAAC,gBAAgB,EACtB,KAAK,CAAC,IAAI,EACV,KAAK,CAAC,YAAY,EAClB,OAAO,CACR;YACD,IAAI,EAAE,CAAC;YACP,OAAO;SACR,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC;QACH,MAAM,OAAO,GAAG,MAAM,gBAAgB,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,YAAY,EAAE,OAAO,CAAC,CAAC;QAEhF;;;;;;;UAOE;QACF,IAAI,KAAK,EAAE,CAAC;YACV,mFAAmF;YACnF,iDAAiD;YACjD,IAAI,OAAO,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;gBAC1B;;;;;;;;kBAQE;gBACF,KAAK,MAAM,MAAM,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;oBAChE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;gBAC/B,CAAC;YACH,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC;gBAAE,KAAK,CAAC,MAAM,EAAE,CAAC;QACjE,CAAC;QACD,QAAQ,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;QACtD,OAAO,OAAO,CAAC;IACjB,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,KAAK,MAAM,KAAK,IAAI,IAAI;YAAE,KAAK,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;QAEjD;;;;;;;;;;;UAWE;QACF,yFAAyF;QACzF,kFAAkF;QAClF,uFAAuF;QACvF,IAAI,KAAK,YAAY,eAAe;YAAE,MAAM,KAAK,CAAC;QAElD,IAAI,KAAK,YAAY,QAAQ,EAAE,CAAC;YAC9B,MAAM,KAAK,GAAG,SAAS,KAAK,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,SAAS,GAAG,CAAC;YAC/D,MAAM,IAAI,eAAe,CACvB,kBAAkB,EAClB,KAAK,CAAC,OAAO,EACb,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,uBAAuB,KAAK,uBAAuB;gBACtF,oCAAoC,CACvC,CAAC;QACJ,CAAC;QAED,MAAM,MAAM,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACtE,MAAM,IAAI,eAAe,CACvB,cAAc,EACd,cAAc,SAAS,KAAK,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,SAAS,GAAG,YAAY,MAAM,EAAE,EAClF,SAAS,CAAC,KAAK,EAAE,SAAS,KAAK,IAAI,CAAC,CACrC,CAAC;IACJ,CAAC;AACH,CAAC;AAED;;;;;;;;;;;GAWG;AACH;;;;;;;GAOG;AACH,SAAS,WAAW,CAAC,CAAS,EAAE,CAAS;IACvC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;AACvE,CAAC;AAED,sFAAsF;AACtF,SAAS,QAAQ,CACf,IAA0B,EAC1B,OAAmB,EACnB,WAAmB,EACnB,QAAgB;IAEhB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,CAAC,KAAK;YAAE,SAAS;QACrB,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,gBAAgB;YAAE,SAAS;QACrD,IAAI,WAAW,GAAG,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YACzD,OAAO,KAAK,CAAC,UAAU,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;QAC/C,CAAC;IACH,CAAC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,KAAK,UAAU,eAAe,CAC5B,IAAa,EACb,IAA0B,EAC1B,KAAkB,EAClB,aAAqB,EACrB,WAAmB,EACnB,KAA8B;IAE9B,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC;IAC/B,IAAI,CAAC,MAAM;QAAE,OAAO;IAEpB,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC5C,0FAA0F;IAC1F,MAAM,GAAG,GAAgF,EAAE,CAAC;IAE5F,SAAS,CAAC;QACR,IAAI,QAAQ,GAAG,QAAQ,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,CAAC,KAAK;gBAAE,SAAS;YACrB,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAC/B,IAAI,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,gBAAgB;gBAAE,SAAS;YACrD,MAAM,IAAI,GAAG,WAAW,GAAG,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC;YACrD,IAAI,IAAI,GAAG,QAAQ;gBAAE,QAAQ,GAAG,IAAI,CAAC;QACvC,CAAC;QACD,IAAI,QAAQ,KAAK,QAAQ;YAAE,OAAO;QAElC;;;;;;;;;;;;;;;;;;UAkBE;QACF,MAAM,YAAY,GAAG,QAAQ,CAAC,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,CAAC,CAAC;QACpE,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,CAAC,KAAK;gBAAE,SAAS;YACrB,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAC/B,IAAI,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,gBAAgB;gBAAE,SAAS;YACrD,MAAM,IAAI,GAAG,WAAW,GAAG,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC;YACrD,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;gBACtB,sEAAsE;gBACtE,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC;oBAAE,SAAS;gBAC3C,IAAI,KAAK,CAAC,UAAU,CAAC,WAAW,EAAE,MAAM,CAAC,KAAK,YAAY;oBAAE,SAAS;YACvE,CAAC;YACD,OAAO,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC;YACxB,qEAAqE;YACrE,IACE,CAAC,mBAAmB,CAAC,QAAQ,EAAE,KAAK,CAAC,YAAY,EAAE,KAAK,CAAC,UAAU,EAAE,YAAY,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EACpG,CAAC;gBACD,SAAS;YACX,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrD,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC;YACzD,CAAC;QACH,CAAC;QACD,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAC/B,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACnB,GAAG,CAAC,IAAI,CACN,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC,KAAK,IAAI,CAAC,CAAC;gBACtD,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC,KAAK,IAAI,CAAC,CAAC,CACzD,CAAC;QACJ,CAAC;QAED,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;YACvB,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACxD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACnD,IAAI,CAAC,OAAO,IAAI,CAAC,MAAM;gBAAE,SAAS;YAClC,IAAI,MAAM,CAAC,MAAM;gBAAE,OAAO;YAC1B,MAAM,CAAC,QAAQ,CACb,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,WAAW,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,cAAc,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG;gBACrF,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,aAAa,EAAE,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAChF,CAAC;YACF,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;YAClB,+EAA+E;YAC/E,IAAI,MAAM,CAAC,IAAI;gBAAE,MAAM,MAAM,CAAC,KAAK,EAAE,CAAC;QACxC,CAAC;IACH,CAAC;AACH,CAAC;AAED,KAAK,UAAU,gBAAgB,CAC7B,IAAa,EACb,IAAoB,EACpB,IAAiB,EACjB,YAAiC,EACjC,OAAuB;IAEvB,MAAM,EAAE,YAAY,EAAE,UAAU,EAAE,WAAW,EAAE,SAAS,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC;IACxE,MAAM,EAAE,cAAc,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC;IACvC,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB;;;;;;;MAOE;IACF,MAAM,SAAS,GAAG,GAAY,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAE/F,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,IAAI,CAAC,WAAW,CAAC,EAAE,WAAW,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC;QACvE,IAAI,SAAS,EAAE;YAAE,MAAM;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,IAAI,SAAS,EAAE;gBAAE,MAAM;YACvB,MAAM,KAAK,GAAG,KAAK,CAAC,gBAAgB,GAAG,CAAC,CAAC;YACzC,MAAM,WAAW,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,cAAc,CAAC;YAE5G,IAAI,IAAI,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;gBAC3B,MAAM,eAAe,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,WAAW,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;gBACrE,WAAW,EAAE,CAAC;gBACd,SAAS;YACX,CAAC;YAED,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;gBACzB,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,UAAU,EAAE,GAAG,KAAK,CAAC;gBACxD,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC;gBACjC,8DAA8D;gBAC9D,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;gBAEjC,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,KAAK,CAAC,gBAAgB,EAAE,MAAM,EAAE,EAAE,CAAC;oBAC/D,MAAM,IAAI,GAAG,WAAW,GAAG,MAAM,GAAG,IAAI,CAAC;oBACzC,IAAI,CAAC,mBAAmB,CAAC,IAAI,EAAE,YAAY,EAAE,UAAU,EAAE,KAAK,CAAC;wBAAE,SAAS;oBAE1E,IAAI,GAAG,GAAG,UAAU,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;oBAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;wBACzC,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;wBAC5B,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;wBAC7B,IAAI,CAAC,OAAO,IAAI,CAAC,MAAM;4BAAE,SAAS;wBAClC,GAAG,IAAI,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,EAAE,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;oBACvE,CAAC;oBACD,IAAI,MAAM,CAAC,MAAM;wBAAE,MAAM;oBACzB,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;oBACrB,KAAK,CAAC,IAAI,EAAE,CAAC;oBAEb;;;;;;;;;;;;sBAYE;oBACF,IAAI,MAAM,CAAC,IAAI;wBAAE,MAAM,MAAM,CAAC,KAAK,EAAE,CAAC;gBACxC,CAAC;gBACD,MAAM,MAAM,CAAC,UAAU,EAAE,CAAC;YAC5B,CAAC;YAED,WAAW,EAAE,CAAC;QAChB,CAAC;QAED,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;YACvB;;;;;;;;;;;cAWE;YACF,IAAI,CAAC;gBACH,OAAO,CAAC,UAAU,CAAC;oBACjB,WAAW;oBACX,YAAY,EAAE,SAAS,GAAG,WAAW;oBACrC,4EAA4E;oBAC5E,wDAAwD;oBACxD,YAAY,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAClE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,GAAG,KAAK,CAAC,YAAY,EACxC,CAAC,CACF;iBACF,CAAC,CAAC;YACL,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,MAAM,IAAI,eAAe,CACvB,iBAAiB,EACjB,kCAAkC,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,EAC1F,qFAAqF;oBACnF,+DAA+D,EACjE,EAAE,KAAK,EAAE,CACV,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,GAAG,EAAsB,CAAC;IAC7C,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;QACzB,IAAI,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC;YAAE,SAAS;QACvC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACzB,MAAM,KAAK,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC;QACzB,uFAAuF;QACvF,sFAAsF;QACtF,4DAA4D;QAC5D,MAAM,KAAK,CAAC,OAAO,CAAC;IACtB,CAAC;IAED,wFAAwF;IACxF,IAAI,IAAI,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;QAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,CAAC,KAAK;YAAE,OAAO,EAAE,CAAC;QACtB,OAAO,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,QAAQ,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;IAC1F,CAAC;IACD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,QAAQ,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;AACjF,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,UAAU,CAAC,MAAgB,EAAE,IAAa;IACjD,IAAI,CAAC,IAAI;QAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;IACjE,MAAM,UAAU,GAAG,UAAU,EAAE,CAAC;IAChC,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,KAAY,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;IAEhE;;;;;MAKE;IACF,MAAM,QAAQ,GAAG,MAAM,KAAK,OAAO,CAAC,MAAM,CAAC;IAC3C,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,CAAC;IAC5C,IAAI,QAAQ;QAAE,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;IAExE;;;;;;;;;MASE;IACF,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;IACjC,OAAO,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;IACxB,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC;AACzC,CAAC;AAED;;;;;;;GAOG;AACH,KAAK,UAAU,eAAe,CAC5B,SAAiB,EACjB,IAAY,EACZ,QAAgB,EAChB,IAAI,GAAG,KAAK,EACZ,GAAG,GAAG,KAAK;IAEX,qFAAqF;IACrF,oFAAoF;IACpF,IAAI,GAAG;QAAE,QAAQ,GAAG,QAAQ,GAAG,QAAQ,CAAC;IACxC,IAAI,CAAC;QACH,uFAAuF;QACvF,iFAAiF;QACjF,MAAM,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IAC/G,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,MAAM,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACtE,MAAM,IAAI,eAAe,CACvB,cAAc,EACd,YAAY,IAAI,SAAS,SAAS,aAAa,MAAM,EAAE,EACvD,SAAS,CAAC,KAAK,CAAC,CACjB,CAAC;IACJ,CAAC;AACH,CAAC;AAED,KAAK,UAAU,gBAAgB,CAC7B,SAAiB,EACjB,IAAa,EACb,IAAoB,EACpB,IAAa,EACb,GAAY;IAEZ,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACnG,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;QAChC,KAAK,MAAM,OAAO,IAAI,KAAK,CAAC,QAAQ;YAAE,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;IAC1F,CAAC;IAED,MAAM,KAAK,GAAG;QACZ,MAAM,CAAC;YACL,QAAQ;YACR,cAAc;YACd,OAAO;YACP,MAAM;YACN,kBAAkB;YAClB,oBAAoB;YACpB,cAAc;YACd,cAAc;YACd,aAAa;YACb,aAAa;YACb,YAAY;YACZ,cAAc;YACd,aAAa;YACb,WAAW;SACZ,CAAC;KACH,CAAC;IAEF,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;QACzC,IAAI,MAAM,CAAC,aAAa;YAAE,SAAS;QACnC,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,UAAU,MAAM,CAAC,KAAK,EAAE,CAAC;QAC9E,KAAK,CAAC,IAAI,CACR,MAAM,CAAC;YACL,MAAM;YACN,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC;YACpB,MAAM,CAAC,KAAK;YACZ,MAAM,CAAC,iBAAiB;YACxB,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC;YAC3B,MAAM,CAAC,MAAM,CAAC,gBAAgB,CAAC;YAC/B,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC;YAC1B,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC;YAC1B,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC;YACzB,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC;YACzB,MAAM,CAAC,UAAU;YACjB,MAAM,CAAC,YAAY;YACnB,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE;YAC/B,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI;SACjD,CAAC,CACH,CAAC;IACJ,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,cAAc,CAAC;IACvD,MAAM,eAAe,CAAC,SAAS,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;IAC3E,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;AAC1C,CAAC;AAED;;;;;;;;;;;;;;;;;;;EAmBE;AACF,SAAS,yBAAyB,CAChC,OAAuB,EACvB,cAAsB;IAEtB,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,IAAI,CAAC,QAAQ,CAAC;IACxC,MAAM,EAAE,GACN,OAAO,CAAC,GAAG,KAAK,SAAS;QACvB,CAAC,CAAC,OAAO,CAAC,GAAG;QACb,CAAC,CAAC,OAAO,CAAC,QAAQ,KAAK,SAAS;YAC9B,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,IAAI,cAAc,CAAC,GAAG,OAAO,CAAC,QAAQ;YACtD,CAAC,CAAC,QAAQ,CAAC;IACjB,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;AACtB,CAAC;AAED,KAAK,UAAU,mBAAmB,CAChC,SAAiB,EACjB,WAAkC,EAClC,MAAoC,EACpC,IAAa,EACb,GAAY;IAEZ,MAAM,QAAQ,GAAG,WAAW;SACzB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,MAAM,CAAC,IAAI,IAAI,CAAC,CAAC,KAAK,GAAG,MAAM,CAAC,EAAE,CAAC;SAC5D,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC;IAEtE,MAAM,KAAK,GAAG,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,YAAY,EAAE,aAAa,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC;IACjF,KAAK,MAAM,UAAU,IAAI,QAAQ,EAAE,CAAC;QAClC,KAAK,CAAC,IAAI,CACR,MAAM,CAAC;YACL,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC;YACxB,UAAU,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC;YAC/D,UAAU,CAAC,IAAI;YACf,MAAM,CAAC,UAAU,CAAC,WAAW,CAAC;SAC/B,CAAC,CACH,CAAC;IACJ,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,iBAAiB,CAAC;IAC7D,MAAM,eAAe,CAAC,SAAS,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;IAC3E,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,CAAC,MAAM,EAAE,CAAC;AACzC,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,SAAS,SAAS,CAAC,KAAc,EAAE,QAAQ,GAAG,KAAK;IACjD;;;;;;;MAOE;IACF,MAAM,QAAQ,GAAG,QAAQ;QACvB,CAAC,CAAC,6EAA6E;QAC/E,CAAC,CAAC,kEAAkE,CAAC;IACvE,MAAM,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAC,4BAA4B,CAAC,CAAC,CAAC,2BAA2B,CAAC;IACxF,MAAM,IAAI,GAAI,KAAsC,EAAE,IAAI,CAAC;IAC3D,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,QAAQ;YACX,OAAO,GAAG,QAAQ,oDAAoD,SAAS,GAAG,CAAC;QACrF,KAAK,QAAQ;YACX,OAAO,GAAG,QAAQ,oDAAoD,SAAS,GAAG,CAAC;QACrF,KAAK,QAAQ,CAAC;QACd,KAAK,OAAO;YACV,OAAO,GAAG,QAAQ,8CAA8C,SAAS,GAAG,CAAC;QAC/E,KAAK,OAAO;YACV,OAAO,GAAG,QAAQ,yCAAyC,SAAS,GAAG,CAAC;QAC1E,KAAK,QAAQ;YACX,OAAO,GAAG,QAAQ,2EAA2E,SAAS,GAAG,CAAC;QAC5G,KAAK,QAAQ;YACX,OAAO,GAAG,QAAQ,iGAAiG,CAAC;QACtH,KAAK,cAAc;YACjB,OAAO,GAAG,QAAQ,mDAAmD,QAAQ,CAAC,CAAC,CAAC,+BAA+B,CAAC,CAAC,CAAC,yCAAyC,GAAG,CAAC;QACjK,KAAK,QAAQ,CAAC;QACd,KAAK,QAAQ;YACX,OAAO,GAAG,QAAQ,yHAAyH,CAAC;QAC9I,KAAK,OAAO;YACV,OAAO,GAAG,QAAQ,2EAA2E,CAAC;QAChG;YACE,OAAO,GAAG,QAAQ,qDAAqD,CAAC;IAC5E,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,SAAS,WAAW;IAClB,IAAI,SAAiB,CAAC;IACtB,IAAI,CAAC;QACH,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;YAAE,OAAO,IAAI,CAAC;QAChC,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC;IACxB,CAAC;IAAC,MAAM,CAAC;QACP,uFAAuF;QACvF,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,OAAO;QACL,KAAK,EAAE,CAAC,KAAa,EAAQ,EAAE;YAC7B,QAAQ,IAAI,KAAK,CAAC;QACpB,CAAC;QACD,MAAM,EAAE,GAAS,EAAE;YACjB,IAAI,MAAc,CAAC;YACnB,IAAI,CAAC;gBACH,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,SAAS,CAAC;YACzC,CAAC;YAAC,MAAM,CAAC;gBACP,OAAO;YACT,CAAC;YACD,IAAI,MAAM,IAAI,QAAQ;gBAAE,OAAO;YAC/B,MAAM,IAAI,eAAe,CACvB,cAAc,EACd,6BAA6B,QAAQ,GAAG,MAAM,OAAO,QAAQ,uBAAuB;gBAClF,iEAAiE,EACnE,+EAA+E;gBAC7E,gFAAgF;gBAChF,qFAAqF,CACxF,CAAC;QACJ,CAAC;KACF,CAAC;AACJ,CAAC;AAED,qFAAqF;AACrF,SAAS,MAAM,CAAC,OAA+B;IAC7C,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;AAC/D,CAAC;AAGD,mFAAmF;AACnF,SAAS,YAAY,CAAC,WAAoB;IACxC,OAAO;QACL,IAAI,EAAE,eAAe;QACrB,QAAQ,EAAE,SAAS;QACnB,OAAO,EACL,oFAAoF;YACpF,uDAAuD;QACzD,IAAI,EAAE,WAAW;YACf,CAAC,CAAC,iFAAiF;gBACjF,qDAAqD;YACvD,CAAC,CAAC,mEAAmE;KACxE,CAAC;AACJ,CAAC;AAED,KAAK,UAAU,aAAa,CAC1B,SAAiB,EACjB,SAAiB,EACjB,IAAa,EACb,IAAoB,EACpB,OAA+B,EAC/B,eAAuB;AACvB,uFAAuF;AACvF,QAAuB;IAEvB,MAAM,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;IAExB;;;;;;;;;;;;;;MAcE;IACF,MAAM,QAAQ,GAAG;QACf,IAAI,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,YAAY,EAAE;QAChD,MAAM,EAAE;YACN,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC;YAC7B,KAAK,EAAE,IAAI,CAAC,QAAQ;YACpB,QAAQ,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,WAAW,EAAE;YACvD,MAAM,EAAE,QAAQ;SACjB;QACD,SAAS,EAAE;YACT,MAAM,EAAE,cAAc,CAAC,MAAM,CAAC;YAC9B,OAAO,EAAE,MAAM,CAAC,OAAO;YACvB,UAAU,EAAE,MAAM,CAAC,SAAS;YAC5B,YAAY,EAAE,MAAM,CAAC,WAAW;YAChC,6EAA6E;YAC7E,oBAAoB,EAAE,eAAe,CAAC,MAAM,CAAC,aAAa,CAAC;YAC3D,cAAc,EAAE,MAAM,CAAC,YAAY;YACnC,cAAc,EAAE,MAAM,CAAC,YAAY;YACnC,YAAY,EAAE,IAAI,CAAC,WAAW;YAC9B,qBAAqB,EAAE,MAAM,CAAC,mBAAmB;YACjD,uBAAuB,EAAE,MAAM,CAAC,cAAc;YAC9C,gBAAgB,EAAE,IAAI,CAAC,eAAe;YACtC,YAAY,EAAE,MAAM,CAAC,WAAW;YAChC,mBAAmB,EAAE,IAAI,CAAC,iBAAiB,CAAC,MAAM;SACnD;QACD,UAAU,EAAE;YACV,YAAY,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;YACtC,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC,YAAY;YACtC,WAAW,EAAE,IAAI,CAAC,KAAK,CAAC,UAAU;YAClC,eAAe,EAAE,IAAI,CAAC,KAAK,CAAC,gBAAgB;YAC5C,iBAAiB,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC;YACjE,mBAAmB,EAAE,eAAe;YACpC,KAAK,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;YAC3D,WAAW,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBACnC,IAAI,EAAE,CAAC,CAAC,QAAQ;gBAChB,gBAAgB,EAAE,CAAC,CAAC,IAAI;gBACxB,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;gBACzC,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC;aAC5C,CAAC,CAAC;SACJ;QACD,KAAK,EAAE,CAAC,GAAG,sBAAsB,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACpF,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,QAAQ,EAAE,CAAC,CAAC,QAAQ;YACpB,OAAO,EAAE,CAAC,CAAC,OAAO;SACnB,CAAC,CAAC;KACJ,CAAC;IAEF,MAAM,eAAe,CAAC,SAAS,EAAE,eAAe,EAAE,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;AAC9F,CAAC","sourcesContent":["/**\n * Executing a conversion.\n *\n * Everything is written in a single pass over the data records. All rate groups are\n * open at once and fed from the same batch of bytes, so a file is read once no\n * matter how many output tables it produces, and memory stays flat.\n */\n\nimport { createWriteStream, fstatSync } from 'node:fs';\nimport { mkdir, readdir, stat, writeFile } from 'node:fs/promises';\nimport { createHash } from 'node:crypto';\nimport { createReadStream } from 'node:fs';\nimport { finished, pipeline } from 'node:stream/promises';\nimport type { Writable } from 'node:stream';\nimport { createGzip, gzipSync } from 'node:zlib';\nimport path from 'node:path';\n\nimport type { RecordBatch } from '../edf/reader.js';\nimport { EdfFile } from '../edf/reader.js';\nimport { describeFormat, formatRates, formatWallClock } from '../edf/header.js';\nimport type { Diagnostic } from '../edf/errors.js';\nimport { EdfError } from '../edf/errors.js';\nimport type { Annotation } from '../edf/annotations.js';\nimport {\n  BufferedLineWriter,\n  DEFAULT_FLUSH_THRESHOLD,\n  UTF8_BOM,\n  csvRow,\n  escapeCsvField,\n} from '../format/csv.js';\nimport { listed } from '../format/list.js';\nimport {\n  fixed,\n  makeSampleFormatter,\n  makeTimeFormatter,\n  newOffsetBudget,\n  newSampleCacheBudget,\n} from '../format/number.js';\nimport type { SampleFormatter } from '../format/number.js';\nimport { buildPlan, withoutFileRateWarning } from './plan.js';\nimport type { ConversionPlan, PlanOptions, RateGroup } from './plan.js';\nimport { deriveRecordStarts } from './timing.js';\nimport { sampleTimeIsInRange, toleranceFor } from './time-range.js';\nimport { VERSION as TOOL_VERSION } from '../version.js';\n\nexport { TOOL_VERSION };\n\nexport type ConversionErrorCode =\n  | 'OUTPUT_EXISTS'\n  | 'OUTPUT_UNWRITABLE'\n  | 'INPUT_OUTPUT_COLLISION'\n  | 'INPUT_UNREADABLE'\n  | 'UNSUPPORTED_REQUEST'\n  | 'CALLBACK_FAILED'\n  | 'WRITE_FAILED';\n\n/**\n * Codes that mean the command cannot be carried out as written, rather than that something\n * about the file or the destination went wrong.\n *\n * The distinction is the one the exit codes draw: 1 is \"the file or the destination is the\n * problem\", 2 is \"the command line is the problem\". A caller with a `--stdout` conflict is\n * being told to change the flags — the hints say exactly that — so filing it under 1 sent\n * scripts looking at the disk. Exit 2 already covers checks that need the header first,\n * such as a `--channels` term matching nothing.\n */\nexport const USAGE_ERROR_CODES: ReadonlySet<ConversionErrorCode> = new Set(['UNSUPPORTED_REQUEST']);\n\nexport class ConversionError extends Error {\n  readonly code: ConversionErrorCode;\n  readonly hint: string | undefined;\n  constructor(code: ConversionErrorCode, message: string, hint?: string, options?: ErrorOptions) {\n    super(message, options);\n    this.name = 'ConversionError';\n    this.code = code;\n    this.hint = hint;\n  }\n}\n\nexport interface ConvertOptions extends PlanOptions {\n  /** Destination directory. Defaults to the input file's name without its extension. */\n  outputDir?: string | undefined;\n  /** Overwrite an existing output directory. */\n  force?: boolean | undefined;\n  /** Record a SHA-256 of the input in metadata.json. Costs one extra read of the file. */\n  checksum?: boolean | undefined;\n  /**\n   * Write the signal CSV to stdout instead of to a directory.\n   *\n   * Only valid when the conversion produces exactly one signal file. In the default wide\n   * layout a mixed-rate recording becomes several tables, and merging them into one stream\n   * would mean inventing the samples this tool exists not to invent; `layout: 'long'` gives\n   * one table for any recording, so it lifts the restriction. No sidecar files are written.\n   */\n  toStdout?: boolean | undefined;\n  onProgress?: ((progress: ConversionProgress) => void) | undefined;\n}\n\nexport interface ConversionProgress {\n  recordsDone: number;\n  recordsTotal: number;\n  bytesWritten: number;\n}\n\nexport interface WrittenFile {\n  name: string;\n  rows: number;\n}\n\nexport interface ConvertResult {\n  outputDir: string;\n  files: WrittenFile[];\n  /**\n   * True when a `--stdout` reader closed the pipe before the conversion finished.\n   *\n   * `edf2csv rec.edf --stdout | head -1` is an ordinary thing to type and not a failure, but\n   * it is also not a conversion: the row count is rows formatted before the close was\n   * noticed, which is neither the recording's total nor what the reader received.\n   */\n  readerHungUp: boolean;\n  annotationCount: number;\n  diagnostics: Diagnostic[];\n  plan: ConversionPlan;\n  file: EdfFile;\n  elapsedMs: number;\n}\n\ninterface OpenGroup {\n  group: RateGroup;\n  writer: BufferedLineWriter;\n  formatters: SampleFormatter[];\n  formatTime: (recordStart: number, sample: number) => string;\n  rows: number;\n  /** Resolves once a compressed stream's bytes have reached the file behind it. */\n  settled: Promise<void>;\n}\n\nexport async function convert(inputPath: string, options: ConvertOptions = {}): Promise<ConvertResult> {\n  const startedAt = Date.now();\n  const file = await EdfFile.open(inputPath);\n\n  try {\n    /*\n      Hashed before a record is read, and only published if the file held still.\n\n      A checksum taken afterwards cannot be trusted whichever descriptor it goes through. A\n      file overwritten in place keeps its inode, so the open handle sees the new bytes too,\n      and the old ones are simply gone — there is nowhere left to read what was converted.\n      Taking it first at least means the hash describes the file the header was read from.\n\n      What makes it a guarantee rather than a hope is the check at the end: if size or\n      modification time moved at any point, the hash is dropped and the run says why. So\n      `sha256` present means the file demonstrably did not change while it was read, and a\n      recording still being written gets a null and a warning instead of a plausible hash of\n      the wrong bytes. (A change reverted within the same modification timestamp would slip\n      through; nothing short of copying the input first can close that.)\n    */\n    const checksumAtOpen = options.checksum === true ? await file.sha256() : null;\n\n    // One pass over the annotation channel supplies everything annotation-related:\n    // where each record sits in time, and the full event list. It reads the whole\n    // file even when a window was requested, because an annotation inside the window\n    // may be stored in a record outside it.\n    const annotationData =\n      file.annotationSignals.length > 0\n        ? await file.readAnnotations()\n        : { annotations: [] as Annotation[], recordStarts: [] as (number | null)[], malformed: 0 };\n\n    const timing = deriveRecordStarts(file, annotationData);\n\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      options,\n    );\n    plan.diagnostics.push(...timing.diagnostics);\n\n    if (options.toStdout === true) {\n      if (!plan.writeSignals) {\n        throw new ConversionError(\n          'UNSUPPORTED_REQUEST',\n          '--stdout has no signal data to write because --annotations-only was given.',\n          'Drop one of the two flags.',\n        );\n      }\n      /*\n        No table at all is its own answer, and neither layout gave it.\n\n        A recording with no signal channels — one holding only EDF+ annotations — produced\n        zero rate groups. The wide layout then said \"--stdout needs exactly one table, but\n        this recording produces 0, one for each sampling rate its channels use ()\", with an\n        empty parenthetical, advice to narrow to one of no rates, and advice to use\n        `--layout long` — which wrote zero bytes to stdout, not even a header row, and exited\n        0 while warning that \"the signal files hold their headers and no data\". There were no\n        files and there was no header. The one path that was right about this is\n        `--annotations-only`, which refuses outright, and this is the same situation reached\n        by a different route.\n      */\n      if (plan.groups.length === 0) {\n        throw new ConversionError(\n          'UNSUPPORTED_REQUEST',\n          file.dataSignals.length === 0\n            ? '--stdout has no signal data to write: this recording has no signal channels, ' +\n              'only EDF+ annotations.'\n            : '--stdout has no signal data to write: nothing was selected that carries samples.',\n          file.dataSignals.length === 0\n            ? 'Convert to a directory to get its annotations.csv, or drop --stdout.'\n            : 'Check --channels and the requested window, or convert to a directory instead.',\n        );\n      }\n\n      // The long layout is one table whatever the rates are, so it has nothing to refuse.\n      if (plan.layout !== 'long' && plan.groups.length !== 1) {\n        throw new ConversionError(\n          'UNSUPPORTED_REQUEST',\n          // Naming the rates is the point: the hint says to narrow the selection, and this\n          // is what there is to narrow it to. The parenthetical used to repeat the count\n          // that had just been given — \"produces 3 (its channels use 3 different sampling\n          // rates)\" — which told nobody anything they could act on.\n          `--stdout needs exactly one table, but this recording produces ${plan.groups.length}, ` +\n            `one for each sampling rate its channels use ` +\n            `(${listed(formatRates(plan.groups.map((g) => g.rate)).map((r) => `${r} Hz`))}).`,\n          'Narrow it to one rate with --channels, write --layout long to get them all in ' +\n            'one table, or convert to a directory instead.',\n        );\n      }\n      let readerHungUp = false;\n      const written = await writeSignalFiles(file, plan, null, timing.starts, options, (hungUp) => {\n        readerHungUp = hungUp;\n      });\n      if (await file.changedSinceOpen()) plan.diagnostics.push(inputChanged(false));\n      return {\n        outputDir: '-',\n        files: written,\n        readerHungUp,\n        annotationCount: 0,\n        diagnostics: [...withoutFileRateWarning(file.diagnostics), ...plan.diagnostics],\n        plan,\n        file,\n        elapsedMs: Date.now() - startedAt,\n      };\n    }\n\n    const outputDir = options.outputDir ?? defaultOutputDir(inputPath);\n    await assertInputDoesNotOverlapOutputs(inputPath, outputDir, file, plan, options);\n    await prepareOutputDir(outputDir, options.force === true);\n\n    const written: WrittenFile[] = [];\n\n    if (plan.writeSignals && plan.groups.length > 0) {\n      const signals = await writeSignalFiles(file, plan, outputDir, timing.starts, options);\n      written.push(...signals);\n    } else if (plan.writeSignals) {\n      /*\n        Asked for signal data and given none to write.\n\n        Every channel selected carries zero samples per record, so there is no table to make\n        — `edf2csv rec.edf --channels unused` writes channels.csv and metadata.json and no\n        signals.csv at all. The NO_SAMPLES warning explains the channel; nothing explained the\n        missing file, and the documentation says signals.csv is written unless\n        --annotations-only was passed. Someone looking for it should be told where it went.\n      */\n      plan.diagnostics.push({\n        code: 'NO_SAMPLES',\n        severity: 'warning',\n        message:\n          'No signal file was written: every channel selected carries zero samples per data ' +\n          'record, so there is nothing to put in one.',\n        hint:\n          'channels.csv still describes them. Run with --info to see which channels do carry ' +\n          'samples.',\n      });\n    }\n\n    if (options.annotationsOnly === true && file.annotationSignals.length === 0) {\n      plan.diagnostics.push({\n        code: 'NO_ANNOTATIONS',\n        severity: 'warning',\n        message:\n          '--annotations-only was requested but this recording has no annotation channel, ' +\n          'so there are no events to export.',\n        hint: 'Plain EDF files carry no annotations. Convert without --annotations-only to get the signals.',\n      });\n    }\n\n    let annotationsWritten = 0;\n    if (file.annotationSignals.length > 0) {\n      const result = await writeAnnotationsCsv(\n        outputDir,\n        annotationData.annotations,\n        requestedAnnotationWindow(options, plan.range.recordingStartSeconds),\n        options.gzip === true,\n        options.bom === true,\n      );\n      written.push(result);\n      annotationsWritten = result.rows;\n    }\n\n    written.push(\n      await writeChannelsCsv(outputDir, file, plan, options.gzip === true, options.bom === true),\n    );\n\n    /*\n      The file moved under the conversion. Said out loud, because nothing else shows it.\n\n      The CSVs are still correct for the records that were read, and metadata.json still\n      describes the file as it was opened — so the record is consistent with the output\n      whatever happens here. What stops being true is that the checksum describes the bytes\n      that were converted, since an in-place overwrite leaves nowhere to read them from. It\n      is dropped rather than guessed at.\n    */\n    const changed = await file.changedSinceOpen();\n    if (changed) plan.diagnostics.push(inputChanged(options.checksum === true));\n\n    await writeMetadata(\n      outputDir,\n      inputPath,\n      file,\n      plan,\n      written,\n      annotationsWritten,\n      changed ? null : checksumAtOpen,\n    );\n\n    const stale = await findStaleOutput(outputDir, written);\n\n    return {\n      outputDir,\n      files: written,\n      readerHungUp: false,\n      annotationCount: annotationsWritten,\n      diagnostics: [...withoutFileRateWarning(file.diagnostics), ...plan.diagnostics, ...stale],\n      plan,\n      file,\n      elapsedMs: Date.now() - startedAt,\n    };\n  } finally {\n    await file.close();\n  }\n}\n\n/*\n  Files this tool produces, used to spot leftovers from an earlier conversion.\n\n  The rate part has to allow every shape a filename can now take, not just the plain ones:\n\n    signals_256hz.csv         an integer rate\n    signals_12_5hz.csv        a fractional rate, decimal point written as an underscore\n    signals_1_000e-7hz.csv    a rate small enough to need exponent form  (0.2.2)\n    signals_256hz.csv.gz      any of the above, compressed                (0.3.0)\n    signals_0hz_2.csv         a second group whose rate slug collided    (0.2.1)\n\n  The previous `[\\w.]+hz` matched neither of the last two — `-` and `+` are not word\n  characters, and the collision suffix falls after the `hz`. Both were introduced by\n  recent changes and both silently stopped being recognised as this tool's own output, so\n  leftovers of exactly those kinds went unreported: the one situation the warning exists\n  for. Requiring a digit after the underscore keeps a user's own `signals_notes.csv` out.\n*/\nconst OUTPUT_PATTERN =\n  /^(signals(_\\d[\\w.+-]*hz(_\\d+)?)?\\.csv(\\.gz)?|annotations\\.csv(\\.gz)?|channels\\.csv(\\.gz)?|metadata\\.json)$/u;\n\n/**\n * Detect output from a previous run that this one did not replace.\n *\n * `--force` overwrites files but does not empty the directory, so converting a\n * mixed-rate recording and then a single-rate one into the same place leaves\n * `signals_256hz.csv` sitting next to a fresh `signals.csv`. Both look current.\n * Nothing is deleted here — the user is told, and decides.\n */\nasync function findStaleOutput(\n  outputDir: string,\n  written: readonly WrittenFile[],\n): Promise<Diagnostic[]> {\n  const entries = await readdir(outputDir).catch(() => null);\n  if (!entries) return [];\n\n  // metadata.json is rewritten on every run but is not part of the reported file list.\n  const fresh = new Set([...written.map((f) => f.name), 'metadata.json']);\n  const stale = entries.filter((name) => OUTPUT_PATTERN.test(name) && !fresh.has(name)).sort();\n  if (stale.length === 0) return [];\n\n  return [\n    {\n      code: 'STALE_OUTPUT',\n      severity: 'warning',\n      message:\n        `${stale.join(', ')} ${stale.length === 1 ? 'is' : 'are'} left over from an earlier ` +\n        `conversion into this directory and ${stale.length === 1 ? 'was' : 'were'} not rewritten.`,\n      hint: 'Delete them, or convert into a fresh directory, so the two runs do not get mixed up.',\n    },\n  ];\n}\n\nexport function defaultOutputDir(inputPath: string): string {\n  const base = path.basename(inputPath, path.extname(inputPath));\n  return path.join(path.dirname(inputPath), `${base}_csv`);\n}\n\n/** Never let an output target resolve to the recording being read, even with --force. */\nasync function assertInputDoesNotOverlapOutputs(\n  inputPath: string,\n  outputDir: string,\n  file: EdfFile,\n  plan: ConversionPlan,\n  options: ConvertOptions,\n): Promise<void> {\n  /*\n    The names this run will actually write, compressed ones included.\n\n    The rate files come from the plan and already carry `.csv.gz` under --gzip; the sidecars\n    were spelled out here and did not. So a compressed run checked two names it would never\n    write and missed the two it would: a recording sitting at <outdir>/channels.csv.gz was\n    overwritten by its own conversion, with --force, reported as a success. The same file\n    named signals.csv.gz was refused, which is what gives the oversight away.\n  */\n  const suffix = options.gzip === true ? '.csv.gz' : '.csv';\n  const names = new Set(plan.groups.map((group) => group.fileName));\n  if (file.annotationSignals.length > 0) names.add(`annotations${suffix}`);\n  names.add(`channels${suffix}`);\n  names.add('metadata.json');\n\n  const inputResolved = path.resolve(inputPath);\n  const inputInfo = await stat(inputPath);\n\n  for (const name of names) {\n    const target = path.join(outputDir, name);\n    const targetResolved = path.resolve(target);\n    const targetInfo = await stat(target).catch(() => null);\n    const samePath = targetResolved === inputResolved;\n    const sameFile =\n      targetInfo !== null && targetInfo.dev === inputInfo.dev && targetInfo.ino === inputInfo.ino;\n    if (!samePath && !sameFile) continue;\n\n    throw new ConversionError(\n      'INPUT_OUTPUT_COLLISION',\n      `Output file \"${target}\" is the same file as the input recording.`,\n      'Choose a separate directory with --out. The input was not modified.',\n    );\n  }\n}\n\nasync function prepareOutputDir(dir: string, force: boolean): Promise<void> {\n  /*\n    Claim the directory with a single atomic mkdir rather than asking whether it exists\n    and then creating it.\n\n    Checking first left a window between the two: two conversions started together both\n    saw \"not there\", both proceeded, and both opened write streams on the same signals.csv.\n    Neither reported anything — both exited 0, having half-written one file between them.\n    A non-recursive mkdir cannot do that. Exactly one caller creates the directory; every\n    other one gets EEXIST from the filesystem and takes the already-exists path below.\n\n    Parents are still created recursively, since --out ./a/b/c should work. Only the final\n    component is the claim.\n  */\n  const parent = path.dirname(dir);\n  if (parent && parent !== dir) {\n    try {\n      await mkdir(parent, { recursive: true });\n    } catch (cause: unknown) {\n      // A parent that is a regular file surfaces as EEXIST naming the parent, which reads\n      // as though the destination already exists rather than as \"you cannot put a\n      // directory inside a file\". Name the real obstacle instead of the errno.\n      const info = await stat(parent).catch(() => null);\n      if (info && !info.isDirectory()) {\n        throw new ConversionError(\n          'OUTPUT_UNWRITABLE',\n          `Cannot create \"${dir}\": \"${parent}\" is a file, not a directory.`,\n          'Choose a destination whose parent directories are directories, with --out.',\n        );\n      }\n      throw new ConversionError(\n        'OUTPUT_UNWRITABLE',\n        `Cannot create \"${dir}\": ${describeFsError(cause)}.`,\n        'Check the path exists and that you have permission to write there.',\n      );\n    }\n  }\n\n  let claimed = true;\n  try {\n    await mkdir(dir);\n  } catch (cause: unknown) {\n    if ((cause as NodeJS.ErrnoException).code !== 'EEXIST') {\n      throw new ConversionError(\n        'OUTPUT_UNWRITABLE',\n        `Cannot create \"${dir}\": ${describeFsError(cause)}.`,\n        'Check the path exists and that you have permission to write there.',\n      );\n    }\n    claimed = false;\n  }\n\n  if (!claimed) {\n    const existing = await stat(dir).catch(() => null);\n\n    // --force means \"replace my previous output\", not \"write output files into\n    // whatever this happens to be\". Pointing it at a regular file needs saying so.\n    if (existing && !existing.isDirectory()) {\n      throw new ConversionError(\n        'OUTPUT_UNWRITABLE',\n        `\"${dir}\" is a file, but the converted data needs a directory.`,\n        'Choose a directory with --out.',\n      );\n    }\n    if (!force) {\n      throw new ConversionError(\n        'OUTPUT_EXISTS',\n        `\"${dir}\" already exists.`,\n        'Pass --force to overwrite it, or --out to choose a different directory.',\n      );\n    }\n  }\n}\n\n/** Turn a Node filesystem error into something a person can act on. */\nfunction describeFsError(cause: unknown): string {\n  const code = (cause as NodeJS.ErrnoException | undefined)?.code;\n  if (code === 'EACCES' || code === 'EPERM') return 'permission denied';\n  if (code === 'ENOSPC') return 'the disk is full';\n  if (code === 'ENOTDIR') return 'part of the path is a file, not a directory';\n  if (code === 'EROFS') return 'the filesystem is read-only';\n  if (code === 'ENAMETOOLONG') return 'the path is too long';\n  return cause instanceof Error ? cause.message : String(cause);\n}\n\nasync function writeSignalFiles(\n  file: EdfFile,\n  plan: ConversionPlan,\n  outputDir: string | null,\n  recordStarts: Float64Array | null,\n  options: ConvertOptions,\n  onHangUp?: (hungUp: boolean) => void,\n): Promise<WrittenFile[]> {\n  // One budget for every table in this conversion, not one per table: see OffsetBudget.\n  const offsets = newOffsetBudget();\n  // Likewise one for every channel, not one per channel: see SampleCacheBudget.\n  const sampleCaches = newSampleCacheBudget();\n  // Only the stdout path needs this; --out finds a full disk on its own, because it always\n  // has another file to write afterwards. See auditStdout.\n  const audit = outputDir === null ? auditStdout() : null;\n  /*\n    In the long layout every group writes into one table, so they share one stream. Opening\n    a stream per group on the same path is what the rate-slug collision fix in groupByRate\n    was about: two writers on one file interleave rows under a header naming one of them.\n  */\n  let shared: {\n    stream: Writable;\n    settled: Promise<void>;\n    target: Writable;\n    writer: BufferedLineWriter;\n  } | null = null;\n\n  /*\n    One buffer's worth of memory for the conversion, not one per table.\n\n    Every group had its own writer at the default 1 MiB threshold, so pending output was\n    group count × 1 MiB before anything drained. A 6.5 MB recording with 40 sampling rates\n    — the header allows thousands of channels, and a research montage really does mix a\n    dozen rates — died with a raw V8 heap out-of-memory and exit 134 under a 96 MB cap,\n    while the site advertises 48 MB. The recording is small; it is the fan-out that is not.\n\n    Split evenly with a floor, so the single-rate case, which is nearly every recording,\n    keeps exactly the buffer it always had, and forty tables cost 2.5 MB rather than 40.\n    The long layout shares one writer already and is unaffected either way.\n  */\n  const MIN_FLUSH_THRESHOLD = 8 * 1024;\n  const flushThreshold = Math.max(\n    MIN_FLUSH_THRESHOLD,\n    Math.floor(DEFAULT_FLUSH_THRESHOLD / Math.max(1, plan.groups.length)),\n  );\n  /*\n    The stream's own buffer is the other half of the same sum.\n\n    0.5.6 shared the line-buffer budget and left `createWriteStream` at its 64 KiB default,\n    which is per stream: 200 rate groups meant 12.8 MB of stream buffer on top of 12.8 MB of\n    line buffer, and an 855 KB recording still died at a 48 MB cap. Shared the same way, with\n    a floor that keeps an ordinary conversion writing in useful-sized pieces.\n  */\n  const streamBuffer = Math.max(\n    16 * 1024,\n    Math.floor(DEFAULT_FLUSH_THRESHOLD / Math.max(1, plan.groups.length)),\n  );\n\n  const open: OpenGroup[] = plan.groups.map((group, groupIndex) => {\n    // A null directory means the single table goes to stdout. process.stdout is already a\n    // writable stream, so the same buffered writer and backpressure handling apply.\n    const target =\n      shared?.target ??\n      (outputDir === null\n        ? process.stdout\n        : createWriteStream(path.join(outputDir, group.fileName), {\n            highWaterMark: streamBuffer,\n          }));\n    const { stream, settled } = shared ?? compressed(target, options.gzip === true);\n    /*\n      Under --gzip the writer feeds the compressor, so its byte count is the CSV before\n      compression and says nothing about what reached the descriptor. The compressor's own\n      output is what stdout is handed, so that is what is counted. `pipe` uses a 'data'\n      listener of its own and a second one is delivered the same chunks.\n\n      Once per stream, which in the long layout is once for all the groups. Attaching per\n      group put N listeners on the one shared compressor, so every chunk was counted N\n      times: `--stdout --layout long --gzip` on a 40-rate recording claimed 622,240 of\n      622,240 bytes where 15,556 had been written, failed with a disk-full error over a\n      perfectly good file, and printed Node's MaxListenersExceededWarning to stderr on the\n      way past ten. 0.5.4 fixed the same arithmetic in the uncompressed branch and left\n      this one, because the uncompressed branch is where the count is a sum and this one is\n      where it is a subscription.\n    */\n    if (audit && stream !== target && !shared) {\n      stream.on('data', (chunk: Buffer) => audit.count(chunk.length));\n    }\n    /*\n      One writer, not one per group, when the table is shared. Separate writers over one\n      stream each hold their own buffer and flush on their own schedule, so the rows would\n      reach the file in whatever order the buffers filled — which is not the order they\n      were produced in, and the long layout's whole claim is that its rows are in time\n      order.\n    */\n    const writer = shared?.writer ?? new BufferedLineWriter(stream, flushThreshold);\n    if (plan.layout === 'long' && !shared) shared = { stream, settled, target, writer };\n\n    // Only the first group writes the header of a shared table, and the mark before it.\n    if (plan.layout !== 'long' || groupIndex === 0) {\n      if (options.bom === true) writer.push(UTF8_BOM);\n      writer.pushLine(\n        plan.layout === 'long'\n          ? csvRow(['time_s', 'channel', 'value'])\n          : csvRow(['time_s', ...group.channels.map((c) => c.column)]),\n      );\n    }\n    return {\n      group,\n      writer,\n      formatters: group.channels.map((c) => makeSampleFormatter(c.signal, c.decimals, sampleCaches)),\n      formatTime: makeTimeFormatter(\n        group.samplesPerRecord,\n        group.rate,\n        group.timeDecimals,\n        offsets,\n      ),\n      rows: 0,\n      settled,\n    };\n  });\n\n  try {\n    const written = await streamSignalRows(file, plan, open, recordStarts, options);\n\n    /*\n      Checked once everything has been flushed and ended, and not when the reader hung up.\n\n      `--stdout | head -1` closes the pipe on purpose, which is a shell idiom rather than a\n      failure. A pipe is not a regular file, so auditStdout declines it anyway — the second\n      guard is here because the cost of getting this one wrong is reporting a failure for a\n      command that worked.\n    */\n    if (audit) {\n      // Uncompressed, the writer hands its bytes straight to the descriptor; compressed,\n      // they were counted on the compressor's way out.\n      if (options.gzip !== true) {\n        /*\n          Once per writer, not once per group. The long layout gives every group the same\n          writer, so counting per group multiplied its byte total by the number of rates:\n          `--stdout --layout long` on a three-rate recording handed over 32,043 bytes, was\n          credited with 96,129, and failed with a disk-full error for a file that was\n          complete on disk. It only showed with stdout redirected to a regular file, since\n          that is the one case the audit applies to — which is the command the --layout\n          documentation gives.\n        */\n        for (const writer of new Set(open.map((entry) => entry.writer))) {\n          audit.count(writer.bytesOut);\n        }\n      }\n      if (!open.some((entry) => entry.writer.hungUp)) audit.verify();\n    }\n    onHangUp?.(open.some((entry) => entry.writer.hungUp));\n    return written;\n  } catch (cause) {\n    for (const entry of open) entry.writer.destroy();\n\n    /*\n      Reading and writing both fail through here, and both were reported as writing.\n\n      A recording that shrinks mid-conversion — still being written by the acquisition\n      software, say — raises the reader's own error, which names the record and says the\n      file changed size while it was being read. That precise diagnosis was then filed under\n      `Writing to \"<dir>\" failed` and given the hint about freeing disk space, which sends\n      someone to look at the one part of the system that was working.\n\n      The reader's message and its advice are kept; only the note about partial output is\n      added, since that much is true of either failure.\n    */\n    // A ConversionError arrived already saying what went wrong — a callback that threw, say.\n    // Wrapping it again turned \"the onProgress callback threw\" into `Writing to \"out\"\n    // failed: the onProgress callback threw`, under a hint about checking the destination.\n    if (cause instanceof ConversionError) throw cause;\n\n    if (cause instanceof EdfError) {\n      const where = outputDir === null ? 'stdout' : `\"${outputDir}\"`;\n      throw new ConversionError(\n        'INPUT_UNREADABLE',\n        cause.message,\n        `${cause.hint ? `${cause.hint} ` : ''}What was written to ${where} before it failed is ` +\n          `incomplete and should not be used.`,\n      );\n    }\n\n    const detail = cause instanceof Error ? cause.message : String(cause);\n    throw new ConversionError(\n      'WRITE_FAILED',\n      `Writing to ${outputDir === null ? 'stdout' : `\"${outputDir}\"`} failed: ${detail}`,\n      writeHint(cause, outputDir === null),\n    );\n  }\n}\n\n/**\n * One record's samples in the long layout: `time_s,channel,value`, in time order.\n *\n * The groups are merged rather than written one after another. Every sample in a record\n * falls inside that record's span, so taking the earliest next sample across the groups\n * each time leaves the whole file sorted by `time_s` — which is the only thing that makes a\n * mixed-rate long table useful, since sorting 3 million rows afterwards is the reader's\n * problem and a large one.\n *\n * Ties go to the group with the higher rate, which is the order the groups are already in.\n * Within a sample time the channels come out in the order the file declares them.\n */\n/**\n * Whether two sample times are close enough that only rounding could separate them.\n *\n * A relative epsilon, because the gap between doubles grows with magnitude. Well below any\n * real sample interval — the finest a recording can declare is bounded by its record\n * duration and samples-per-record fields — and well above the one-ULP disagreement that two\n * exact divisions of the same instant produce.\n */\nfunction nearlyEqual(a: number, b: number): boolean {\n  return Math.abs(a - b) <= Math.max(Math.abs(a), Math.abs(b)) * 1e-12;\n}\n\n/** The chosen instant as it will be written, for deciding which channels share it. */\nfunction formatAt(\n  open: readonly OpenGroup[],\n  cursors: Int32Array,\n  recordStart: number,\n  earliest: number,\n): string {\n  for (let g = 0; g < open.length; g++) {\n    const entry = open[g];\n    if (!entry) continue;\n    const sample = cursors[g] ?? 0;\n    if (sample >= entry.group.samplesPerRecord) continue;\n    if (recordStart + sample / entry.group.rate === earliest) {\n      return entry.formatTime(recordStart, sample);\n    }\n  }\n  return '';\n}\n\nasync function writeLongRecord(\n  file: EdfFile,\n  open: readonly OpenGroup[],\n  batch: RecordBatch,\n  recordInBatch: number,\n  recordStart: number,\n  range: ConversionPlan['range'],\n): Promise<void> {\n  const writer = open[0]?.writer;\n  if (!writer) return;\n\n  const cursors = new Int32Array(open.length);\n  /* Reused across sample times so a three-million-row conversion allocates one of these. */\n  const due: { entry: OpenGroup; groupIndex: number; sample: number; channel: number }[] = [];\n\n  for (;;) {\n    let earliest = Infinity;\n    for (let g = 0; g < open.length; g++) {\n      const entry = open[g];\n      if (!entry) continue;\n      const sample = cursors[g] ?? 0;\n      if (sample >= entry.group.samplesPerRecord) continue;\n      const time = recordStart + sample / entry.group.rate;\n      if (time < earliest) earliest = time;\n    }\n    if (earliest === Infinity) return;\n\n    /*\n      Everything at this instant, in the order the file declares its channels.\n\n      Groups are ordered by rate, largest first, because that is how the wide layout names\n      its files. Emitting a tie group by group therefore ordered the channels by descending\n      sampling rate — so a recording declaring `slow, medium, fast` wrote `fast, medium,\n      slow`, while the documentation promised file order and channels.csv listed file order.\n      Signal index is the file's own order, and the only one a reader can predict.\n\n      \"At this instant\" is decided on the time as written, not on the double. `s / rate` for\n      two channels at one moment need not give the same double: a 0.3 s record holding 12 and\n      4 samples makes 40 Hz and 13.333… Hz, and 9/40 is 0.22500000000000000555 while 3/13.333…\n      is 0.22499999999999997780. Equality missed that, so those two rows fell out in numeric\n      order — `slow` before `fast`, once, in the middle of a file that was otherwise right.\n\n      Two rows are at one time exactly when they carry the same `time_s`, which is the only\n      definition a reader of the CSV can apply. The numeric pre-filter keeps the common case\n      to one comparison; formatting happens only for candidates already within a hair.\n    */\n    const earliestText = formatAt(open, cursors, recordStart, earliest);\n    due.length = 0;\n    for (let g = 0; g < open.length; g++) {\n      const entry = open[g];\n      if (!entry) continue;\n      const sample = cursors[g] ?? 0;\n      if (sample >= entry.group.samplesPerRecord) continue;\n      const time = recordStart + sample / entry.group.rate;\n      if (time !== earliest) {\n        // Far away in the ordinary case; only a near-tie is worth formatting.\n        if (!nearlyEqual(time, earliest)) continue;\n        if (entry.formatTime(recordStart, sample) !== earliestText) continue;\n      }\n      cursors[g] = sample + 1;\n      // Same window rule as the wide layout, with the same per-rate slack.\n      if (\n        !sampleTimeIsInRange(earliest, range.startSeconds, range.endSeconds, toleranceFor(entry.group.rate))\n      ) {\n        continue;\n      }\n      for (let c = 0; c < entry.group.channels.length; c++) {\n        due.push({ entry, groupIndex: g, sample, channel: c });\n      }\n    }\n    if (due.length === 0) continue;\n    if (due.length > 1) {\n      due.sort(\n        (a, b) =>\n          (a.entry.group.channels[a.channel]?.signal.index ?? 0) -\n          (b.entry.group.channels[b.channel]?.signal.index ?? 0),\n      );\n    }\n\n    for (const item of due) {\n      const channel = item.entry.group.channels[item.channel];\n      const format = item.entry.formatters[item.channel];\n      if (!channel || !format) continue;\n      if (writer.hungUp) return;\n      writer.pushLine(\n        `${item.entry.formatTime(recordStart, item.sample)},${escapeCsvField(channel.column)},` +\n          `${format(file.sampleAt(batch, recordInBatch, channel.signal, item.sample))}`,\n      );\n      item.entry.rows++;\n      // Flushed inside the record for the same reason the wide layout is; see there.\n      if (writer.full) await writer.flush();\n    }\n  }\n}\n\nasync function streamSignalRows(\n  file: EdfFile,\n  plan: ConversionPlan,\n  open: OpenGroup[],\n  recordStarts: Float64Array | null,\n  options: ConvertOptions,\n): Promise<WrittenFile[]> {\n  const { startSeconds, endSeconds, startRecord, endRecord } = plan.range;\n  const { recordDuration } = file.header;\n  let recordsDone = 0;\n\n  /*\n    Every destination has hung up, so nothing formatted from here on could reach anyone.\n    `--stdout | head -1` is the usual way to arrive here: the reader takes one line and\n    closes the pipe while the conversion is still near the start of the recording.\n\n    Stopping also makes the reported row count mean what it says — rows that reached the\n    consumer, rather than rows the loop went on formatting into a discarded buffer.\n  */\n  const allHungUp = (): boolean => open.length > 0 && open.every((entry) => entry.writer.hungUp);\n\n  for await (const batch of file.readRecords({ startRecord, endRecord })) {\n    if (allHungUp()) break;\n    for (let r = 0; r < batch.recordCount; r++) {\n      if (allHungUp()) break;\n      const index = batch.firstRecordIndex + r;\n      const recordStart = recordStarts ? (recordStarts[index] ?? index * recordDuration) : index * recordDuration;\n\n      if (plan.layout === 'long') {\n        await writeLongRecord(file, open, batch, r, recordStart, plan.range);\n        recordsDone++;\n        continue;\n      }\n\n      for (const entry of open) {\n        const { group, writer, formatters, formatTime } = entry;\n        const { channels, rate } = group;\n        // Slack that never reaches the next sample; see toleranceFor.\n        const slack = toleranceFor(rate);\n\n        for (let sample = 0; sample < group.samplesPerRecord; sample++) {\n          const time = recordStart + sample / rate;\n          if (!sampleTimeIsInRange(time, startSeconds, endSeconds, slack)) continue;\n\n          let row = formatTime(recordStart, sample);\n          for (let c = 0; c < channels.length; c++) {\n            const channel = channels[c];\n            const format = formatters[c];\n            if (!channel || !format) continue;\n            row += ',' + format(file.sampleAt(batch, r, channel.signal, sample));\n          }\n          if (writer.hungUp) break;\n          writer.pushLine(row);\n          entry.rows++;\n\n          /*\n            Flushed inside the record, not only at the end of one.\n\n            The buffer was drained once per record, so the rows of a single record piled up\n            with nothing emptying them — memory followed samples-per-record rather than the\n            batch size the writer exists to hold to. One record of 16,000,000 samples died\n            with a heap out of memory under a 256 MB cap, while the same 32 MB of samples\n            split into 16,000 records converted to the same 283 MB CSV without trouble. The\n            format allows either layout and says nothing about which to expect.\n\n            `full` is a synchronous read of the pending size, so the twenty million rows that\n            are not at a boundary cost a comparison rather than a microtask each.\n          */\n          if (writer.full) await writer.flush();\n        }\n        await writer.maybeFlush();\n      }\n\n      recordsDone++;\n    }\n\n    if (options.onProgress) {\n      /*\n        A caller's callback is the caller's, and its failures are not the destination's.\n\n        This ran inside the same try that turns a stream failure into WRITE_FAILED, so a\n        progress callback that threw came back as `Writing to \"out\" failed: caller bug`,\n        advising the reader to check a destination that was working perfectly. It is the\n        same misattribution the write hints had until 0.4.36, one layer up.\n\n        The original is kept as `cause`, so the stack that actually matters survives, and\n        the conversion still stops — the callback threw, and carrying on writing into a\n        directory whose owner has just failed is not an improvement.\n      */\n      try {\n        options.onProgress({\n          recordsDone,\n          recordsTotal: endRecord - startRecord,\n          // Once per writer: the long layout's groups share one, so summing per group\n          // reported a figure larger than the file being written.\n          bytesWritten: [...new Set(open.map((entry) => entry.writer))].reduce(\n            (sum, entry) => sum + entry.charsWritten,\n            0,\n          ),\n        });\n      } catch (cause) {\n        throw new ConversionError(\n          'CALLBACK_FAILED',\n          `The onProgress callback threw: ${cause instanceof Error ? cause.message : String(cause)}`,\n          'This is the caller\\'s callback, not the recording or the destination. Whatever was ' +\n            'written before it threw is incomplete and should not be used.',\n          { cause },\n        );\n      }\n    }\n  }\n\n  const closed = new Set<BufferedLineWriter>();\n  for (const entry of open) {\n    if (closed.has(entry.writer)) continue;\n    closed.add(entry.writer);\n    await entry.writer.end();\n    // With --gzip the writer's stream is the compressor, whose end callback fires when the\n    // compressor is done rather than when the file behind it is. Awaiting only that would\n    // report success with the tail of the file still in flight.\n    await entry.settled;\n  }\n\n  // A shared table is one file, and its row count is every group's rows, not the first's.\n  if (plan.layout === 'long') {\n    const first = open[0];\n    if (!first) return [];\n    return [{ name: first.group.fileName, rows: open.reduce((sum, e) => sum + e.rows, 0) }];\n  }\n  return open.map((entry) => ({ name: entry.group.fileName, rows: entry.rows }));\n}\n\n/**\n * The stream rows are written to, plus a promise for the data reaching its destination.\n *\n * Compression sits between the writer and the file as a transform. Failures below it — a\n * full disk, an unwritable path — surface on the file stream, where nothing is listening,\n * so they are forwarded onto the compressor: that is the stream the writer watches, and\n * routing them there keeps one error path rather than two.\n */\nfunction compressed(target: Writable, gzip: boolean): { stream: Writable; settled: Promise<void> } {\n  if (!gzip) return { stream: target, settled: Promise.resolve() };\n  const compressor = createGzip();\n  target.on('error', (error: Error) => compressor.destroy(error));\n\n  /*\n    pipe() ends its destination when the source ends, and stdout must survive the\n    conversion: the writer already refuses to close it, because a closed stdout breaks\n    every later write in the process. Nothing waits on stdout either — it is not this\n    tool's to finish.\n  */\n  const toStdout = target === process.stdout;\n  compressor.pipe(target, { end: !toStdout });\n  if (toStdout) return { stream: compressor, settled: Promise.resolve() };\n\n  /*\n    A failure under the compressor rejects both this promise and the writer's own end(),\n    and end() is the one awaited first. Without a handler attached here that rejection\n    belonged to nobody, and Node killed the process over it: `--gzip` into an unwritable\n    path printed a raw EISDIR stack trace instead of the ordinary \"Writing to ... failed\"\n    message and exit 1, which is what the same path does uncompressed.\n\n    Attaching the handler is enough to make it handled. Awaiting `settled` downstream still\n    reports the failure in the case where end() happened to succeed.\n  */\n  const settled = finished(target);\n  settled.catch(() => {});\n  return { stream: compressor, settled };\n}\n\n/**\n * Write one of the sidecar files, reporting a failure the way the signal writer does.\n *\n * These three used to call `writeFile` bare, so a failure escaped as whatever the\n * filesystem said — `EISDIR: illegal operation on a directory, open '...'` with no hint\n * and, more importantly, no mention that the signal files had already been written. The\n * conversion stopped half-done and the message gave no sign of it.\n */\nasync function writeOutputFile(\n  outputDir: string,\n  name: string,\n  contents: string,\n  gzip = false,\n  bom = false,\n): Promise<void> {\n  // metadata.json never gets one: JSON.parse rejects a leading U+FEFF, so a mark there\n  // would break every reader of the file to help a spreadsheet that will not open it.\n  if (bom) contents = UTF8_BOM + contents;\n  try {\n    // The sidecars are built in memory before being written, so compressing them in memory\n    // costs nothing extra. Only the signal tables are large enough to need a stream.\n    await writeFile(path.join(outputDir, name), gzip ? gzipSync(contents) : contents, gzip ? undefined : 'utf8');\n  } catch (cause) {\n    const detail = cause instanceof Error ? cause.message : String(cause);\n    throw new ConversionError(\n      'WRITE_FAILED',\n      `Writing \"${name}\" to \"${outputDir}\" failed: ${detail}`,\n      writeHint(cause),\n    );\n  }\n}\n\nasync function writeChannelsCsv(\n  outputDir: string,\n  file: EdfFile,\n  plan: ConversionPlan,\n  gzip: boolean,\n  bom: boolean,\n): Promise<WrittenFile> {\n  const includedColumns = new Set(plan.groups.flatMap((g) => g.channels.map((c) => c.signal.index)));\n  const fileFor = new Map<number, string>();\n  for (const group of plan.groups) {\n    for (const channel of group.channels) fileFor.set(channel.signal.index, group.fileName);\n  }\n\n  const lines = [\n    csvRow([\n      'column',\n      'signal_index',\n      'label',\n      'unit',\n      'sampling_rate_hz',\n      'samples_per_record',\n      'physical_min',\n      'physical_max',\n      'digital_min',\n      'digital_max',\n      'transducer',\n      'prefiltering',\n      'output_file',\n      'converted',\n    ]),\n  ];\n\n  for (const signal of file.header.signals) {\n    if (signal.isAnnotations) continue;\n    const column = plan.columnNames.get(signal.index) ?? `signal_${signal.index}`;\n    lines.push(\n      csvRow([\n        column,\n        String(signal.index),\n        signal.label,\n        signal.physicalDimension,\n        String(signal.samplingRate),\n        String(signal.samplesPerRecord),\n        String(signal.physicalMin),\n        String(signal.physicalMax),\n        String(signal.digitalMin),\n        String(signal.digitalMax),\n        signal.transducer,\n        signal.prefiltering,\n        fileFor.get(signal.index) ?? '',\n        includedColumns.has(signal.index) ? 'yes' : 'no',\n      ]),\n    );\n  }\n\n  const name = gzip ? 'channels.csv.gz' : 'channels.csv';\n  await writeOutputFile(outputDir, name, lines.join('\\n') + '\\n', gzip, bom);\n  return { name, rows: lines.length - 1 };\n}\n\n/*\n  The bounds an annotation is filtered against: what the caller actually asked for, not the\n  window that survived being clamped to the recording.\n\n  Filtering by the resolved window meant an unbounded request still lost events. `--end 999h`\n  on a three-second file clamps to 3, and `--start 0` gets its end from the recording, so\n  both filtered to [0, 3) and dropped the markers at 3.0 and 3.5 that a bare invocation\n  keeps — asking for more of a recording returned less of it.\n\n  An end the caller did not give is unbounded, not \"the end of the data\": EDF+ lets an\n  annotation sit past the last sample, which is exactly where an end-of-recording marker is.\n\n  `--duration` is measured from wherever the conversion actually starts. Anchoring it at 0\n  instead read the same absent `--start` two ways in two adjacent lines, and on a recording\n  that does not begin at zero the two windows did not even overlap: an EDF+D file whose first\n  record sits at 30 s converted its samples from [30, 35) while filtering annotations against\n  (-inf, 5), so every event inside the converted window was dropped and `annotations.csv` came\n  back empty. `resolveRange` has always defaulted the same missing start to the earliest\n  record, which is where this now takes it from.\n*/\nfunction requestedAnnotationWindow(\n  options: ConvertOptions,\n  recordingStart: number,\n): { from: number; to: number } {\n  const from = options.start ?? -Infinity;\n  const to =\n    options.end !== undefined\n      ? options.end\n      : options.duration !== undefined\n        ? (options.start ?? recordingStart) + options.duration\n        : Infinity;\n  return { from, to };\n}\n\nasync function writeAnnotationsCsv(\n  outputDir: string,\n  annotations: readonly Annotation[],\n  window: { from: number; to: number },\n  gzip: boolean,\n  bom: boolean,\n): Promise<WrittenFile> {\n  const inWindow = annotations\n    .filter((a) => a.onset >= window.from && a.onset < window.to)\n    .sort((a, b) => a.onset - b.onset || a.recordIndex - b.recordIndex);\n\n  const lines = [csvRow(['onset_s', 'duration_s', 'description', 'record_index'])];\n  for (const annotation of inWindow) {\n    lines.push(\n      csvRow([\n        String(annotation.onset),\n        annotation.duration === null ? '' : String(annotation.duration),\n        annotation.text,\n        String(annotation.recordIndex),\n      ]),\n    );\n  }\n\n  const name = gzip ? 'annotations.csv.gz' : 'annotations.csv';\n  await writeOutputFile(outputDir, name, lines.join('\\n') + '\\n', gzip, bom);\n  return { name, rows: inWindow.length };\n}\n\n/**\n * What to try next, chosen from what actually went wrong.\n *\n * Every write failure carried the same advice — \"Free up space or choose another destination\n * with --out\" — which fits exactly one errno. A directory sitting where signals.csv belongs\n * came back telling the reader to free up disk space, and so did a read-only volume, a\n * permission denial and a path too long for the filesystem. Wrong advice is worse than none:\n * it sends someone to check `df` on a disk that is fine, and the thing that is actually\n * wrong stays unexamined.\n *\n * The errno is the one piece of the failure that names the cause, so it is what picks the\n * sentence. Anything unrecognised keeps the general form rather than guessing.\n */\nfunction writeHint(cause: unknown, toStdout = false): string {\n  /*\n    The stdout path writes no files, and --out is the flag its user chose not to pass.\n\n    Both halves of this sentence were wrong there: \"the files written so far\" named files\n    that do not exist, and \"choose another destination with --out\" is advice for a different\n    command — the destination is whatever the shell redirected the stream to. Same class as\n    the disk-space hint this function replaced, one flag over.\n  */\n  const preamble = toStdout\n    ? 'What reached stdout before it failed is incomplete and should not be used. '\n    : 'The files written so far are incomplete and should not be used. ';\n  const elsewhere = toStdout ? 'redirect it somewhere else' : 'choose another with --out';\n  const code = (cause as NodeJS.ErrnoException | null)?.code;\n  switch (code) {\n    case 'ENOSPC':\n      return `${preamble}The destination is out of space; free some up or ${elsewhere}.`;\n    case 'EDQUOT':\n      return `${preamble}You are over your disk quota on this filesystem; ${elsewhere}.`;\n    case 'EACCES':\n    case 'EPERM':\n      return `${preamble}You do not have permission to write there; ${elsewhere}.`;\n    case 'EROFS':\n      return `${preamble}That filesystem is mounted read-only; ${elsewhere}.`;\n    case 'EISDIR':\n      return `${preamble}A directory is sitting where that file belongs; remove or rename it, or ${elsewhere}.`;\n    case 'ENOENT':\n      return `${preamble}Part of that path no longer exists; make sure nothing is removing it while the conversion runs.`;\n    case 'ENAMETOOLONG':\n      return `${preamble}That path is longer than the filesystem allows; ${toStdout ? 'redirect it somewhere shorter' : 'choose a shorter destination with --out'}.`;\n    case 'EMFILE':\n    case 'ENFILE':\n      return `${preamble}Too many files are open; a recording with many sampling rates opens one output file per rate, so --channels narrows it.`;\n    case 'EPIPE':\n      return `${preamble}Whatever was reading the output closed it before the conversion finished.`;\n    default:\n      return `${preamble}Check the destination and run the conversion again.`;\n  }\n}\n\n/**\n * Confirms that everything handed to a file-backed stdout actually arrived.\n *\n * `edf2csv rec.edf --stdout > out.csv` onto a volume that the output very nearly fills lost\n * the tail in silence: 94,977 of 102,400 rows on disk, the file ending mid-row, stderr\n * announcing \"Wrote 102,400 rows to stdout.\" and the process exiting 0. The same recording\n * onto the same volume through `--out` fails correctly, which is what gives it away.\n *\n * POSIX `write` returns a short count rather than an error when the disk fills partway\n * through a single call, and only the NEXT write raises ENOSPC. `--out` always has a next\n * write — channels.csv and metadata.json come after — so it always finds out. `--stdout`\n * has nothing after it, and when fd 1 is a regular file Node's stdout is a SyncWriteStream\n * whose `_write` discards the byte count `writeSync` returns, so nothing is raised at all.\n * No error means no `#failure`, so checking that alone would not have caught this.\n *\n * What can be checked is the descriptor: how much it grew against how much it was given.\n * Only for a regular file — a pipe, a terminal or a socket has no size to compare, and on\n * those a short write cannot go unreported this way. Appending (`>>`) is fine, since the\n * starting size is taken before anything is written.\n */\nfunction auditStdout(): { count: (bytes: number) => void; verify: () => void } | null {\n  let startSize: number;\n  try {\n    const info = fstatSync(1);\n    if (!info.isFile()) return null;\n    startSize = info.size;\n  } catch {\n    // No usable descriptor to audit; the conversion is not the place to complain about it.\n    return null;\n  }\n\n  let expected = 0;\n  return {\n    count: (bytes: number): void => {\n      expected += bytes;\n    },\n    verify: (): void => {\n      let landed: number;\n      try {\n        landed = fstatSync(1).size - startSize;\n      } catch {\n        return;\n      }\n      if (landed >= expected) return;\n      throw new ConversionError(\n        'WRITE_FAILED',\n        `Writing to stdout failed: ${expected - landed} of ${expected} bytes did not reach ` +\n          `the destination, which stopped accepting them part way through.`,\n        'What is there ends mid-row and should not be used. The destination is almost ' +\n          'certainly out of space — a short write is how a filesystem reports filling up ' +\n          'mid-write, and nothing after it raised an error because there was nothing after it.',\n      );\n    },\n  };\n}\n\n/** Data rows across every signal table, so \"nothing was written\" is one question. */\nfunction rowsIn(written: readonly WrittenFile[]): number {\n  return written.reduce((total, file) => total + file.rows, 0);\n}\n\n\n/** Raised when the input moved while it was being read. See where it is pushed. */\nfunction inputChanged(hadChecksum: boolean): Diagnostic {\n  return {\n    code: 'INPUT_CHANGED',\n    severity: 'warning',\n    message:\n      'The input changed while it was being converted, so this output covers the file as ' +\n      'it was when the conversion started, not as it is now.',\n    hint: hadChecksum\n      ? 'No checksum was recorded: the bytes that were converted are no longer there to ' +\n        'hash. Convert again once the recording is finished.'\n      : 'Convert again once the recording is finished to pick up the rest.',\n  };\n}\n\nasync function writeMetadata(\n  outputDir: string,\n  inputPath: string,\n  file: EdfFile,\n  plan: ConversionPlan,\n  written: readonly WrittenFile[],\n  annotationCount: number,\n  /** Hash of the bytes that were converted, or null when it could not be vouched for. */\n  checksum: string | null,\n): Promise<void> {\n  const { header } = file;\n\n  /*\n    The file as it was when it was opened, not as it is now.\n\n    Both of these used to come from re-opening the path once the CSVs were written, which\n    describes whatever answers to that name by then rather than what was converted. A\n    recording still being written grew from 2,000 records to 3,000 mid-conversion and\n    metadata.json recorded `data_records: 2000` — correct, the CSV holds 2,000 — beside the\n    byte count and SHA-256 of the 3,000-record file. The two halves of one provenance record\n    described two different files, and the checksum covered bytes nobody had converted.\n    Replacing the file at that path did the same thing more thoroughly.\n\n    `file.fileSize` is the number every record count and window in this output was derived\n    from, and the hash is taken over exactly those bytes through the descriptor already open\n    on them, so the record describes one file throughout.\n  */\n  const metadata = {\n    tool: { name: 'edf2csv', version: TOOL_VERSION },\n    source: {\n      path: path.resolve(inputPath),\n      bytes: file.fileSize,\n      modified: new Date(file.modifiedAtOpenMs).toISOString(),\n      sha256: checksum,\n    },\n    recording: {\n      format: describeFormat(header),\n      version: header.version,\n      patient_id: header.patientId,\n      recording_id: header.recordingId,\n      // Zone-less on purpose: EDF records local wall-clock digits and no timezone.\n      start_datetime_local: formatWallClock(header.startDateTime),\n      start_date_raw: header.startDateRaw,\n      start_time_raw: header.startTimeRaw,\n      data_records: file.recordCount,\n      data_records_declared: header.declaredRecordCount,\n      record_duration_seconds: header.recordDuration,\n      duration_seconds: file.durationSeconds,\n      signal_count: header.signalCount,\n      annotation_channels: file.annotationSignals.length,\n    },\n    conversion: {\n      converted_at: new Date().toISOString(),\n      start_seconds: plan.range.startSeconds,\n      end_seconds: plan.range.endSeconds,\n      whole_recording: plan.range.isWholeRecording,\n      records_converted: [plan.range.startRecord, plan.range.endRecord],\n      annotations_written: annotationCount,\n      files: written.map((f) => ({ name: f.name, rows: f.rows })),\n      rate_groups: plan.groups.map((g) => ({\n        file: g.fileName,\n        sampling_rate_hz: g.rate,\n        channels: g.channels.map((c) => c.column),\n        decimals: g.channels.map((c) => c.decimals),\n      })),\n    },\n    notes: [...withoutFileRateWarning(file.diagnostics), ...plan.diagnostics].map((d) => ({\n      code: d.code,\n      severity: d.severity,\n      message: d.message,\n    })),\n  };\n\n  await writeOutputFile(outputDir, 'metadata.json', JSON.stringify(metadata, null, 2) + '\\n');\n}\n\n\n"]}
+{"version":3,"file":"run.js","sourceRoot":"","sources":["../../src/convert/run.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,iBAAiB,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AACvD,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AACnE,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,gBAAgB,EAAE,MAAM,SAAS,CAAC;AAC3C,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAE1D,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AACjD,OAAO,IAAI,MAAM,WAAW,CAAC;AAG7B,OAAO,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC;AAC3C,OAAO,EAAE,cAAc,EAAE,WAAW,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAEhF,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAE5C,OAAO,EACL,kBAAkB,EAClB,uBAAuB,EACvB,QAAQ,EACR,MAAM,EACN,cAAc,GACf,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAC3C,OAAO,EACL,KAAK,EACL,mBAAmB,EACnB,iBAAiB,EACjB,eAAe,EACf,oBAAoB,GACrB,MAAM,qBAAqB,CAAC;AAE7B,OAAO,EAAE,SAAS,EAAE,sBAAsB,EAAE,MAAM,WAAW,CAAC;AAE9D,OAAO,EAAE,kBAAkB,EAAE,MAAM,aAAa,CAAC;AACjD,OAAO,EAAE,mBAAmB,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AACpE,OAAO,EAAE,OAAO,IAAI,YAAY,EAAE,MAAM,eAAe,CAAC;AAExD,OAAO,EAAE,YAAY,EAAE,CAAC;AAWxB;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAqC,IAAI,GAAG,CAAC,CAAC,qBAAqB,CAAC,CAAC,CAAC;AAEpG,MAAM,OAAO,eAAgB,SAAQ,KAAK;IAC/B,IAAI,CAAsB;IAC1B,IAAI,CAAqB;IAClC,YAAY,IAAyB,EAAE,OAAe,EAAE,IAAa,EAAE,OAAsB;QAC3F,KAAK,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QACxB,IAAI,CAAC,IAAI,GAAG,iBAAiB,CAAC;QAC9B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;CACF;AA4DD,MAAM,CAAC,KAAK,UAAU,OAAO,CAAC,SAAiB,EAAE,UAA0B,EAAE;IAC3E,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAC7B,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAE3C,IAAI,CAAC;QACH;;;;;;;;;;;;;;UAcE;QACF,MAAM,cAAc,GAAG,OAAO,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;QAE9E,+EAA+E;QAC/E,8EAA8E;QAC9E,iFAAiF;QACjF,wCAAwC;QACxC,MAAM,cAAc,GAClB,IAAI,CAAC,iBAAiB,CAAC,MAAM,GAAG,CAAC;YAC/B,CAAC,CAAC,MAAM,IAAI,CAAC,eAAe,EAAE;YAC9B,CAAC,CAAC,EAAE,WAAW,EAAE,EAAkB,EAAE,YAAY,EAAE,EAAuB,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC;QAE/F,MAAM,MAAM,GAAG,kBAAkB,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;QAExD,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,OAAO,CACR,CAAC;QACF,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC;QAE7C,IAAI,OAAO,CAAC,QAAQ,KAAK,IAAI,EAAE,CAAC;YAC9B,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC;gBACvB,MAAM,IAAI,eAAe,CACvB,qBAAqB,EACrB,4EAA4E,EAC5E,4BAA4B,CAC7B,CAAC;YACJ,CAAC;YACD;;;;;;;;;;;;cAYE;YACF,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC7B,MAAM,IAAI,eAAe,CACvB,qBAAqB,EACrB,IAAI,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC;oBAC3B,CAAC,CAAC,+EAA+E;wBAC/E,wBAAwB;oBAC1B,CAAC,CAAC,kFAAkF,EACtF,IAAI,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC;oBAC3B,CAAC,CAAC,sEAAsE;oBACxE,CAAC,CAAC,+EAA+E,CACpF,CAAC;YACJ,CAAC;YAED,oFAAoF;YACpF,IAAI,IAAI,CAAC,MAAM,KAAK,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACvD,MAAM,IAAI,eAAe,CACvB,qBAAqB;gBACrB,iFAAiF;gBACjF,+EAA+E;gBAC/E,gFAAgF;gBAChF,0DAA0D;gBAC1D,iEAAiE,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI;oBACrF,8CAA8C;oBAC9C,IAAI,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,EACnF,gFAAgF;oBAC9E,+CAA+C,CAClD,CAAC;YACJ,CAAC;YACD,IAAI,YAAY,GAAG,KAAK,CAAC;YACzB,MAAM,OAAO,GAAG,MAAM,gBAAgB,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC,MAAM,EAAE,EAAE;gBAC1F,YAAY,GAAG,MAAM,CAAC;YACxB,CAAC,CAAC,CAAC;YACH,IAAI,MAAM,IAAI,CAAC,gBAAgB,EAAE;gBAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC;YAC9E,OAAO;gBACL,SAAS,EAAE,GAAG;gBACd,KAAK,EAAE,OAAO;gBACd,YAAY;gBACZ,eAAe,EAAE,CAAC;gBAClB,WAAW,EAAE,CAAC,GAAG,sBAAsB,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC;gBAC/E,IAAI;gBACJ,IAAI;gBACJ,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;aAClC,CAAC;QACJ,CAAC;QAED,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,gBAAgB,CAAC,SAAS,CAAC,CAAC;QACnE,MAAM,gCAAgC,CAAC,SAAS,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;QAClF,MAAM,gBAAgB,CAAC,SAAS,EAAE,OAAO,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC;QAE1D,MAAM,OAAO,GAAkB,EAAE,CAAC;QAElC,IAAI,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAChD,MAAM,OAAO,GAAG,MAAM,gBAAgB,CAAC,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;YACtF,OAAO,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC;QAC3B,CAAC;aAAM,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YAC7B;;;;;;;;;;;;;;;;;cAiBE;YACF,MAAM,eAAe,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC,CAAC;YACtD,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC;gBACpB,IAAI,EAAE,YAAY;gBAClB,QAAQ,EAAE,SAAS;gBACnB,OAAO,EAAE,eAAe;oBACtB,CAAC,CAAC,kFAAkF;wBAClF,MAAM;oBACR,CAAC,CAAC,mFAAmF;wBACnF,4CAA4C;gBAChD,IAAI,EAAE,eAAe;oBACnB,CAAC,CAAC,8EAA8E;wBAC9E,mCAAmC;oBACrC,CAAC,CAAC,oFAAoF;wBACpF,UAAU;aACf,CAAC,CAAC;QACL,CAAC;QAED,IAAI,OAAO,CAAC,eAAe,KAAK,IAAI,IAAI,IAAI,CAAC,iBAAiB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5E,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC;gBACpB,IAAI,EAAE,gBAAgB;gBACtB,QAAQ,EAAE,SAAS;gBACnB,OAAO,EACL,iFAAiF;oBACjF,mCAAmC;gBACrC,IAAI,EAAE,8FAA8F;aACrG,CAAC,CAAC;QACL,CAAC;QAED,IAAI,kBAAkB,GAAG,CAAC,CAAC;QAC3B,IAAI,IAAI,CAAC,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtC,MAAM,MAAM,GAAG,MAAM,mBAAmB,CACtC,SAAS,EACT,cAAc,CAAC,WAAW,EAC1B,yBAAyB,CAAC,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,qBAAqB,CAAC,EACpE,OAAO,CAAC,IAAI,KAAK,IAAI,EACrB,OAAO,CAAC,GAAG,KAAK,IAAI,CACrB,CAAC;YACF,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACrB,kBAAkB,GAAG,MAAM,CAAC,IAAI,CAAC;QACnC,CAAC;QAED,OAAO,CAAC,IAAI,CACV,MAAM,gBAAgB,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,KAAK,IAAI,EAAE,OAAO,CAAC,GAAG,KAAK,IAAI,CAAC,CAC3F,CAAC;QAEF;;;;;;;;UAQE;QACF,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,gBAAgB,EAAE,CAAC;QAC9C,IAAI,OAAO;YAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC;QAE5E,MAAM,aAAa,CACjB,SAAS,EACT,SAAS,EACT,IAAI,EACJ,IAAI,EACJ,OAAO,EACP,kBAAkB,EAClB,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,cAAc,CAChC,CAAC;QAEF,MAAM,KAAK,GAAG,MAAM,eAAe,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QAExD,OAAO;YACL,SAAS;YACT,KAAK,EAAE,OAAO;YACd,YAAY,EAAE,KAAK;YACnB,eAAe,EAAE,kBAAkB;YACnC,WAAW,EAAE,CAAC,GAAG,sBAAsB,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,GAAG,IAAI,CAAC,WAAW,EAAE,GAAG,KAAK,CAAC;YACzF,IAAI;YACJ,IAAI;YACJ,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;SAClC,CAAC;IACJ,CAAC;YAAS,CAAC;QACT,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;IACrB,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;;;;;EAgBE;AACF,MAAM,cAAc,GAClB,6GAA6G,CAAC;AAEhH;;;;;;;GAOG;AACH,KAAK,UAAU,eAAe,CAC5B,SAAiB,EACjB,OAA+B;IAE/B,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,SAAS,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;IAC3D,IAAI,CAAC,OAAO;QAAE,OAAO,EAAE,CAAC;IAExB,qFAAqF;IACrF,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC;IACxE,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAC7F,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAElC,OAAO;QACL;YACE,IAAI,EAAE,cAAc;YACpB,QAAQ,EAAE,SAAS;YACnB,OAAO,EACL,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,6BAA6B;gBACrF,sCAAsC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,iBAAiB;YAC5F,IAAI,EAAE,sFAAsF;SAC7F;KACF,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,gBAAgB,CAAC,SAAiB;IAChD,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC;IAC/D,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,GAAG,IAAI,MAAM,CAAC,CAAC;AAC3D,CAAC;AAED,yFAAyF;AACzF,KAAK,UAAU,gCAAgC,CAC7C,SAAiB,EACjB,SAAiB,EACjB,IAAa,EACb,IAAoB,EACpB,OAAuB;IAEvB;;;;;;;;MAQE;IACF,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC;IAC1D,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC;IAClE,IAAI,IAAI,CAAC,iBAAiB,CAAC,MAAM,GAAG,CAAC;QAAE,KAAK,CAAC,GAAG,CAAC,cAAc,MAAM,EAAE,CAAC,CAAC;IACzE,KAAK,CAAC,GAAG,CAAC,WAAW,MAAM,EAAE,CAAC,CAAC;IAC/B,KAAK,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC;IAE3B,MAAM,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;IAC9C,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,CAAC;IAExC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;QAC1C,MAAM,cAAc,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAC5C,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;QACxD,MAAM,QAAQ,GAAG,cAAc,KAAK,aAAa,CAAC;QAClD,MAAM,QAAQ,GACZ,UAAU,KAAK,IAAI,IAAI,UAAU,CAAC,GAAG,KAAK,SAAS,CAAC,GAAG,IAAI,UAAU,CAAC,GAAG,KAAK,SAAS,CAAC,GAAG,CAAC;QAC9F,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ;YAAE,SAAS;QAErC,MAAM,IAAI,eAAe,CACvB,wBAAwB,EACxB,gBAAgB,MAAM,4CAA4C,EAClE,qEAAqE,CACtE,CAAC;IACJ,CAAC;AACH,CAAC;AAED,KAAK,UAAU,gBAAgB,CAAC,GAAW,EAAE,KAAc;IACzD;;;;;;;;;;;;MAYE;IACF,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACjC,IAAI,MAAM,IAAI,MAAM,KAAK,GAAG,EAAE,CAAC;QAC7B,IAAI,CAAC;YACH,MAAM,KAAK,CAAC,MAAM,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAC3C,CAAC;QAAC,OAAO,KAAc,EAAE,CAAC;YACxB,oFAAoF;YACpF,4EAA4E;YAC5E,yEAAyE;YACzE,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;YAClD,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;gBAChC,MAAM,IAAI,eAAe,CACvB,mBAAmB,EACnB,kBAAkB,GAAG,OAAO,MAAM,+BAA+B,EACjE,4EAA4E,CAC7E,CAAC;YACJ,CAAC;YACD,MAAM,IAAI,eAAe,CACvB,mBAAmB,EACnB,kBAAkB,GAAG,MAAM,eAAe,CAAC,KAAK,CAAC,GAAG,EACpD,oEAAoE,CACrE,CAAC;QACJ,CAAC;IACH,CAAC;IAED,IAAI,OAAO,GAAG,IAAI,CAAC;IACnB,IAAI,CAAC;QACH,MAAM,KAAK,CAAC,GAAG,CAAC,CAAC;IACnB,CAAC;IAAC,OAAO,KAAc,EAAE,CAAC;QACxB,IAAK,KAA+B,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YACvD,MAAM,IAAI,eAAe,CACvB,mBAAmB,EACnB,kBAAkB,GAAG,MAAM,eAAe,CAAC,KAAK,CAAC,GAAG,EACpD,oEAAoE,CACrE,CAAC;QACJ,CAAC;QACD,OAAO,GAAG,KAAK,CAAC;IAClB,CAAC;IAED,IAAI,CAAC,OAAO,EAAE,CAAC;QACb,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;QAEnD,2EAA2E;QAC3E,+EAA+E;QAC/E,IAAI,QAAQ,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE,EAAE,CAAC;YACxC,MAAM,IAAI,eAAe,CACvB,mBAAmB,EACnB,IAAI,GAAG,wDAAwD,EAC/D,gCAAgC,CACjC,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,MAAM,IAAI,eAAe,CACvB,eAAe,EACf,IAAI,GAAG,mBAAmB,EAC1B,yEAAyE,CAC1E,CAAC;QACJ,CAAC;IACH,CAAC;AACH,CAAC;AAED,uEAAuE;AACvE,SAAS,eAAe,CAAC,KAAc;IACrC,MAAM,IAAI,GAAI,KAA2C,EAAE,IAAI,CAAC;IAChE,IAAI,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,OAAO;QAAE,OAAO,mBAAmB,CAAC;IACtE,IAAI,IAAI,KAAK,QAAQ;QAAE,OAAO,kBAAkB,CAAC;IACjD,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,6CAA6C,CAAC;IAC7E,IAAI,IAAI,KAAK,OAAO;QAAE,OAAO,6BAA6B,CAAC;IAC3D,IAAI,IAAI,KAAK,cAAc;QAAE,OAAO,sBAAsB,CAAC;IAC3D,OAAO,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AAChE,CAAC;AAED,KAAK,UAAU,gBAAgB,CAC7B,IAAa,EACb,IAAoB,EACpB,SAAwB,EACxB,YAAiC,EACjC,OAAuB,EACvB,QAAoC;IAEpC,sFAAsF;IACtF,MAAM,OAAO,GAAG,eAAe,EAAE,CAAC;IAClC,8EAA8E;IAC9E,MAAM,YAAY,GAAG,oBAAoB,EAAE,CAAC;IAC5C,yFAAyF;IACzF,yDAAyD;IACzD,MAAM,KAAK,GAAG,SAAS,KAAK,IAAI,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IACxD;;;;MAIE;IACF,IAAI,MAAM,GAKC,IAAI,CAAC;IAEhB;;;;;;;;;;;;MAYE;IACF,MAAM,mBAAmB,GAAG,CAAC,GAAG,IAAI,CAAC;IACrC,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAC7B,mBAAmB,EACnB,IAAI,CAAC,KAAK,CAAC,uBAAuB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CACtE,CAAC;IACF;;;;;;;MAOE;IACF,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAC3B,EAAE,GAAG,IAAI,EACT,IAAI,CAAC,KAAK,CAAC,uBAAuB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CACtE,CAAC;IAEF,MAAM,IAAI,GAAgB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,UAAU,EAAE,EAAE;QAC9D,sFAAsF;QACtF,gFAAgF;QAChF,MAAM,MAAM,GACV,MAAM,EAAE,MAAM;YACd,CAAC,SAAS,KAAK,IAAI;gBACjB,CAAC,CAAC,OAAO,CAAC,MAAM;gBAChB,CAAC,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,KAAK,CAAC,QAAQ,CAAC,EAAE;oBACtD,aAAa,EAAE,YAAY;iBAC5B,CAAC,CAAC,CAAC;QACV,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,MAAM,IAAI,UAAU,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;QAChF;;;;;;;;;;;;;;UAcE;QACF,IAAI,KAAK,IAAI,MAAM,KAAK,MAAM,IAAI,CAAC,MAAM,EAAE,CAAC;YAC1C,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,KAAa,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;QAClE,CAAC;QACD;;;;;;UAME;QACF,MAAM,MAAM,GAAG,MAAM,EAAE,MAAM,IAAI,IAAI,kBAAkB,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;QAChF,IAAI,IAAI,CAAC,MAAM,KAAK,MAAM,IAAI,CAAC,MAAM;YAAE,MAAM,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;QAEpF,oFAAoF;QACpF,IAAI,IAAI,CAAC,MAAM,KAAK,MAAM,IAAI,UAAU,KAAK,CAAC,EAAE,CAAC;YAC/C,IAAI,OAAO,CAAC,GAAG,KAAK,IAAI;gBAAE,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAChD,MAAM,CAAC,QAAQ,CACb,IAAI,CAAC,MAAM,KAAK,MAAM;gBACpB,CAAC,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;gBACxC,CAAC,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAC/D,CAAC;QACJ,CAAC;QACD,OAAO;YACL,KAAK;YACL,MAAM;YACN,UAAU,EAAE,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,mBAAmB,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;YAC9F,UAAU,EAAE,iBAAiB,CAC3B,KAAK,CAAC,gBAAgB,EACtB,KAAK,CAAC,IAAI,EACV,KAAK,CAAC,YAAY,EAClB,OAAO,CACR;YACD,IAAI,EAAE,CAAC;YACP,OAAO;SACR,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC;QACH,MAAM,OAAO,GAAG,MAAM,gBAAgB,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,YAAY,EAAE,OAAO,CAAC,CAAC;QAEhF;;;;;;;UAOE;QACF,IAAI,KAAK,EAAE,CAAC;YACV,mFAAmF;YACnF,iDAAiD;YACjD,IAAI,OAAO,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;gBAC1B;;;;;;;;kBAQE;gBACF,KAAK,MAAM,MAAM,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;oBAChE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;gBAC/B,CAAC;YACH,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC;gBAAE,KAAK,CAAC,MAAM,EAAE,CAAC;QACjE,CAAC;QACD,QAAQ,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;QACtD,OAAO,OAAO,CAAC;IACjB,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,KAAK,MAAM,KAAK,IAAI,IAAI;YAAE,KAAK,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;QAEjD;;;;;;;;;;;UAWE;QACF,yFAAyF;QACzF,kFAAkF;QAClF,uFAAuF;QACvF,IAAI,KAAK,YAAY,eAAe;YAAE,MAAM,KAAK,CAAC;QAElD,IAAI,KAAK,YAAY,QAAQ,EAAE,CAAC;YAC9B,MAAM,KAAK,GAAG,SAAS,KAAK,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,SAAS,GAAG,CAAC;YAC/D,MAAM,IAAI,eAAe,CACvB,kBAAkB,EAClB,KAAK,CAAC,OAAO,EACb,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,uBAAuB,KAAK,uBAAuB;gBACtF,oCAAoC,CACvC,CAAC;QACJ,CAAC;QAED,MAAM,MAAM,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACtE,MAAM,IAAI,eAAe,CACvB,cAAc,EACd,cAAc,SAAS,KAAK,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,SAAS,GAAG,YAAY,MAAM,EAAE,EAClF,SAAS,CAAC,KAAK,EAAE,SAAS,KAAK,IAAI,CAAC,CACrC,CAAC;IACJ,CAAC;AACH,CAAC;AAED;;;;;;;;;;;GAWG;AACH;;;;;;;GAOG;AACH,SAAS,WAAW,CAAC,CAAS,EAAE,CAAS;IACvC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;AACvE,CAAC;AAED,sFAAsF;AACtF,SAAS,QAAQ,CACf,IAA0B,EAC1B,OAAmB,EACnB,WAAmB,EACnB,QAAgB;IAEhB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,CAAC,KAAK;YAAE,SAAS;QACrB,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,gBAAgB;YAAE,SAAS;QACrD,IAAI,WAAW,GAAG,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YACzD,OAAO,KAAK,CAAC,UAAU,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;QAC/C,CAAC;IACH,CAAC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,KAAK,UAAU,eAAe,CAC5B,IAAa,EACb,IAA0B,EAC1B,KAAkB,EAClB,aAAqB,EACrB,WAAmB,EACnB,KAA8B;IAE9B,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC;IAC/B,IAAI,CAAC,MAAM;QAAE,OAAO;IAEpB,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC5C,0FAA0F;IAC1F,MAAM,GAAG,GAAgF,EAAE,CAAC;IAE5F,SAAS,CAAC;QACR,IAAI,QAAQ,GAAG,QAAQ,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,CAAC,KAAK;gBAAE,SAAS;YACrB,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAC/B,IAAI,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,gBAAgB;gBAAE,SAAS;YACrD,MAAM,IAAI,GAAG,WAAW,GAAG,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC;YACrD,IAAI,IAAI,GAAG,QAAQ;gBAAE,QAAQ,GAAG,IAAI,CAAC;QACvC,CAAC;QACD,IAAI,QAAQ,KAAK,QAAQ;YAAE,OAAO;QAElC;;;;;;;;;;;;;;;;;;UAkBE;QACF,MAAM,YAAY,GAAG,QAAQ,CAAC,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,CAAC,CAAC;QACpE,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,CAAC,KAAK;gBAAE,SAAS;YACrB,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAC/B,IAAI,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,gBAAgB;gBAAE,SAAS;YACrD,MAAM,IAAI,GAAG,WAAW,GAAG,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC;YACrD,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;gBACtB,sEAAsE;gBACtE,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC;oBAAE,SAAS;gBAC3C,IAAI,KAAK,CAAC,UAAU,CAAC,WAAW,EAAE,MAAM,CAAC,KAAK,YAAY;oBAAE,SAAS;YACvE,CAAC;YACD,OAAO,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC;YACxB,qEAAqE;YACrE,IACE,CAAC,mBAAmB,CAAC,QAAQ,EAAE,KAAK,CAAC,YAAY,EAAE,KAAK,CAAC,UAAU,EAAE,YAAY,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EACpG,CAAC;gBACD,SAAS;YACX,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrD,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC;YACzD,CAAC;QACH,CAAC;QACD,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAC/B,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACnB,GAAG,CAAC,IAAI,CACN,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC,KAAK,IAAI,CAAC,CAAC;gBACtD,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC,KAAK,IAAI,CAAC,CAAC,CACzD,CAAC;QACJ,CAAC;QAED,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;YACvB,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACxD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACnD,IAAI,CAAC,OAAO,IAAI,CAAC,MAAM;gBAAE,SAAS;YAClC,IAAI,MAAM,CAAC,MAAM;gBAAE,OAAO;YAC1B,MAAM,CAAC,QAAQ,CACb,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,WAAW,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,cAAc,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG;gBACrF,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,aAAa,EAAE,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAChF,CAAC;YACF,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;YAClB,+EAA+E;YAC/E,IAAI,MAAM,CAAC,IAAI;gBAAE,MAAM,MAAM,CAAC,KAAK,EAAE,CAAC;QACxC,CAAC;IACH,CAAC;AACH,CAAC;AAED,KAAK,UAAU,gBAAgB,CAC7B,IAAa,EACb,IAAoB,EACpB,IAAiB,EACjB,YAAiC,EACjC,OAAuB;IAEvB,MAAM,EAAE,YAAY,EAAE,UAAU,EAAE,WAAW,EAAE,SAAS,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC;IACxE,MAAM,EAAE,cAAc,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC;IACvC,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB;;;;;;;MAOE;IACF,MAAM,SAAS,GAAG,GAAY,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAE/F,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,IAAI,CAAC,WAAW,CAAC,EAAE,WAAW,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC;QACvE,IAAI,SAAS,EAAE;YAAE,MAAM;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,IAAI,SAAS,EAAE;gBAAE,MAAM;YACvB,MAAM,KAAK,GAAG,KAAK,CAAC,gBAAgB,GAAG,CAAC,CAAC;YACzC,MAAM,WAAW,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,cAAc,CAAC;YAE5G,IAAI,IAAI,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;gBAC3B,MAAM,eAAe,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,WAAW,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;gBACrE,WAAW,EAAE,CAAC;gBACd,SAAS;YACX,CAAC;YAED,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;gBACzB,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,UAAU,EAAE,GAAG,KAAK,CAAC;gBACxD,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC;gBACjC,8DAA8D;gBAC9D,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;gBAEjC,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,KAAK,CAAC,gBAAgB,EAAE,MAAM,EAAE,EAAE,CAAC;oBAC/D,MAAM,IAAI,GAAG,WAAW,GAAG,MAAM,GAAG,IAAI,CAAC;oBACzC,IAAI,CAAC,mBAAmB,CAAC,IAAI,EAAE,YAAY,EAAE,UAAU,EAAE,KAAK,CAAC;wBAAE,SAAS;oBAE1E,IAAI,GAAG,GAAG,UAAU,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;oBAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;wBACzC,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;wBAC5B,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;wBAC7B,IAAI,CAAC,OAAO,IAAI,CAAC,MAAM;4BAAE,SAAS;wBAClC,GAAG,IAAI,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,EAAE,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;oBACvE,CAAC;oBACD,IAAI,MAAM,CAAC,MAAM;wBAAE,MAAM;oBACzB,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;oBACrB,KAAK,CAAC,IAAI,EAAE,CAAC;oBAEb;;;;;;;;;;;;sBAYE;oBACF,IAAI,MAAM,CAAC,IAAI;wBAAE,MAAM,MAAM,CAAC,KAAK,EAAE,CAAC;gBACxC,CAAC;gBACD,MAAM,MAAM,CAAC,UAAU,EAAE,CAAC;YAC5B,CAAC;YAED,WAAW,EAAE,CAAC;QAChB,CAAC;QAED,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;YACvB;;;;;;;;;;;cAWE;YACF,IAAI,CAAC;gBACH,OAAO,CAAC,UAAU,CAAC;oBACjB,WAAW;oBACX,YAAY,EAAE,SAAS,GAAG,WAAW;oBACrC,4EAA4E;oBAC5E,wDAAwD;oBACxD,YAAY,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAClE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,GAAG,KAAK,CAAC,YAAY,EACxC,CAAC,CACF;iBACF,CAAC,CAAC;YACL,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,MAAM,IAAI,eAAe,CACvB,iBAAiB,EACjB,kCAAkC,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,EAC1F,qFAAqF;oBACnF,+DAA+D,EACjE,EAAE,KAAK,EAAE,CACV,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,GAAG,EAAsB,CAAC;IAC7C,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;QACzB,IAAI,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC;YAAE,SAAS;QACvC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACzB,MAAM,KAAK,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC;QACzB,uFAAuF;QACvF,sFAAsF;QACtF,4DAA4D;QAC5D,MAAM,KAAK,CAAC,OAAO,CAAC;IACtB,CAAC;IAED,wFAAwF;IACxF,IAAI,IAAI,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;QAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,CAAC,KAAK;YAAE,OAAO,EAAE,CAAC;QACtB,OAAO,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,QAAQ,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;IAC1F,CAAC;IACD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,QAAQ,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;AACjF,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,UAAU,CAAC,MAAgB,EAAE,IAAa;IACjD,IAAI,CAAC,IAAI;QAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;IACjE,MAAM,UAAU,GAAG,UAAU,EAAE,CAAC;IAChC,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,KAAY,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;IAEhE;;;;;MAKE;IACF,MAAM,QAAQ,GAAG,MAAM,KAAK,OAAO,CAAC,MAAM,CAAC;IAC3C,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,CAAC;IAC5C,IAAI,QAAQ;QAAE,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;IAExE;;;;;;;;;MASE;IACF,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;IACjC,OAAO,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;IACxB,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC;AACzC,CAAC;AAED;;;;;;;GAOG;AACH,KAAK,UAAU,eAAe,CAC5B,SAAiB,EACjB,IAAY,EACZ,QAAgB,EAChB,IAAI,GAAG,KAAK,EACZ,GAAG,GAAG,KAAK;IAEX,qFAAqF;IACrF,oFAAoF;IACpF,IAAI,GAAG;QAAE,QAAQ,GAAG,QAAQ,GAAG,QAAQ,CAAC;IACxC,IAAI,CAAC;QACH,uFAAuF;QACvF,iFAAiF;QACjF,MAAM,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IAC/G,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,MAAM,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACtE,MAAM,IAAI,eAAe,CACvB,cAAc,EACd,YAAY,IAAI,SAAS,SAAS,aAAa,MAAM,EAAE,EACvD,SAAS,CAAC,KAAK,CAAC,CACjB,CAAC;IACJ,CAAC;AACH,CAAC;AAED,KAAK,UAAU,gBAAgB,CAC7B,SAAiB,EACjB,IAAa,EACb,IAAoB,EACpB,IAAa,EACb,GAAY;IAEZ,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACnG,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;QAChC,KAAK,MAAM,OAAO,IAAI,KAAK,CAAC,QAAQ;YAAE,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;IAC1F,CAAC;IAED,MAAM,KAAK,GAAG;QACZ,MAAM,CAAC;YACL,QAAQ;YACR,cAAc;YACd,OAAO;YACP,MAAM;YACN,kBAAkB;YAClB,oBAAoB;YACpB,cAAc;YACd,cAAc;YACd,aAAa;YACb,aAAa;YACb,YAAY;YACZ,cAAc;YACd,aAAa;YACb,WAAW;SACZ,CAAC;KACH,CAAC;IAEF,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;QACzC,IAAI,MAAM,CAAC,aAAa;YAAE,SAAS;QACnC,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,UAAU,MAAM,CAAC,KAAK,EAAE,CAAC;QAC9E,KAAK,CAAC,IAAI,CACR,MAAM,CAAC;YACL,MAAM;YACN,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC;YACpB,MAAM,CAAC,KAAK;YACZ,MAAM,CAAC,iBAAiB;YACxB,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC;YAC3B,MAAM,CAAC,MAAM,CAAC,gBAAgB,CAAC;YAC/B,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC;YAC1B,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC;YAC1B,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC;YACzB,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC;YACzB,MAAM,CAAC,UAAU;YACjB,MAAM,CAAC,YAAY;YACnB,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE;YAC/B,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI;SACjD,CAAC,CACH,CAAC;IACJ,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,cAAc,CAAC;IACvD,MAAM,eAAe,CAAC,SAAS,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;IAC3E,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;AAC1C,CAAC;AAED;;;;;;;;;;;;;;;;;;;EAmBE;AACF,SAAS,yBAAyB,CAChC,OAAuB,EACvB,cAAsB;IAEtB,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,IAAI,CAAC,QAAQ,CAAC;IACxC,MAAM,EAAE,GACN,OAAO,CAAC,GAAG,KAAK,SAAS;QACvB,CAAC,CAAC,OAAO,CAAC,GAAG;QACb,CAAC,CAAC,OAAO,CAAC,QAAQ,KAAK,SAAS;YAC9B,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,IAAI,cAAc,CAAC,GAAG,OAAO,CAAC,QAAQ;YACtD,CAAC,CAAC,QAAQ,CAAC;IACjB,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;AACtB,CAAC;AAED,KAAK,UAAU,mBAAmB,CAChC,SAAiB,EACjB,WAAkC,EAClC,MAAoC,EACpC,IAAa,EACb,GAAY;IAEZ,MAAM,QAAQ,GAAG,WAAW;SACzB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,MAAM,CAAC,IAAI,IAAI,CAAC,CAAC,KAAK,GAAG,MAAM,CAAC,EAAE,CAAC;SAC5D,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC;IAEtE,MAAM,KAAK,GAAG,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,YAAY,EAAE,aAAa,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC;IACjF,KAAK,MAAM,UAAU,IAAI,QAAQ,EAAE,CAAC;QAClC,KAAK,CAAC,IAAI,CACR,MAAM,CAAC;YACL,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC;YACxB,UAAU,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC;YAC/D,UAAU,CAAC,IAAI;YACf,MAAM,CAAC,UAAU,CAAC,WAAW,CAAC;SAC/B,CAAC,CACH,CAAC;IACJ,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,iBAAiB,CAAC;IAC7D,MAAM,eAAe,CAAC,SAAS,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;IAC3E,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,CAAC,MAAM,EAAE,CAAC;AACzC,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,SAAS,SAAS,CAAC,KAAc,EAAE,QAAQ,GAAG,KAAK;IACjD;;;;;;;MAOE;IACF,MAAM,QAAQ,GAAG,QAAQ;QACvB,CAAC,CAAC,6EAA6E;QAC/E,CAAC,CAAC,kEAAkE,CAAC;IACvE,MAAM,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAC,4BAA4B,CAAC,CAAC,CAAC,2BAA2B,CAAC;IACxF,MAAM,IAAI,GAAI,KAAsC,EAAE,IAAI,CAAC;IAC3D,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,QAAQ;YACX,OAAO,GAAG,QAAQ,oDAAoD,SAAS,GAAG,CAAC;QACrF,KAAK,QAAQ;YACX,OAAO,GAAG,QAAQ,oDAAoD,SAAS,GAAG,CAAC;QACrF,KAAK,QAAQ,CAAC;QACd,KAAK,OAAO;YACV,OAAO,GAAG,QAAQ,8CAA8C,SAAS,GAAG,CAAC;QAC/E,KAAK,OAAO;YACV,OAAO,GAAG,QAAQ,yCAAyC,SAAS,GAAG,CAAC;QAC1E,KAAK,QAAQ;YACX,OAAO,GAAG,QAAQ,2EAA2E,SAAS,GAAG,CAAC;QAC5G,KAAK,QAAQ;YACX,OAAO,GAAG,QAAQ,iGAAiG,CAAC;QACtH,KAAK,cAAc;YACjB,OAAO,GAAG,QAAQ,mDAAmD,QAAQ,CAAC,CAAC,CAAC,+BAA+B,CAAC,CAAC,CAAC,yCAAyC,GAAG,CAAC;QACjK,KAAK,QAAQ,CAAC;QACd,KAAK,QAAQ;YACX,OAAO,GAAG,QAAQ,yHAAyH,CAAC;QAC9I,KAAK,OAAO;YACV,OAAO,GAAG,QAAQ,2EAA2E,CAAC;QAChG;YACE,OAAO,GAAG,QAAQ,qDAAqD,CAAC;IAC5E,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,SAAS,WAAW;IAClB,IAAI,SAAiB,CAAC;IACtB,IAAI,CAAC;QACH,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;YAAE,OAAO,IAAI,CAAC;QAChC,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC;IACxB,CAAC;IAAC,MAAM,CAAC;QACP,uFAAuF;QACvF,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,OAAO;QACL,KAAK,EAAE,CAAC,KAAa,EAAQ,EAAE;YAC7B,QAAQ,IAAI,KAAK,CAAC;QACpB,CAAC;QACD,MAAM,EAAE,GAAS,EAAE;YACjB,IAAI,MAAc,CAAC;YACnB,IAAI,CAAC;gBACH,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,SAAS,CAAC;YACzC,CAAC;YAAC,MAAM,CAAC;gBACP,OAAO;YACT,CAAC;YACD,IAAI,MAAM,IAAI,QAAQ;gBAAE,OAAO;YAC/B,MAAM,IAAI,eAAe,CACvB,cAAc,EACd,6BAA6B,QAAQ,GAAG,MAAM,OAAO,QAAQ,uBAAuB;gBAClF,iEAAiE,EACnE,+EAA+E;gBAC7E,gFAAgF;gBAChF,qFAAqF,CACxF,CAAC;QACJ,CAAC;KACF,CAAC;AACJ,CAAC;AAED,qFAAqF;AACrF,SAAS,MAAM,CAAC,OAA+B;IAC7C,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;AAC/D,CAAC;AAGD,mFAAmF;AACnF,SAAS,YAAY,CAAC,WAAoB;IACxC,OAAO;QACL,IAAI,EAAE,eAAe;QACrB,QAAQ,EAAE,SAAS;QACnB,OAAO,EACL,oFAAoF;YACpF,uDAAuD;QACzD,IAAI,EAAE,WAAW;YACf,CAAC,CAAC,iFAAiF;gBACjF,qDAAqD;YACvD,CAAC,CAAC,mEAAmE;KACxE,CAAC;AACJ,CAAC;AAED,KAAK,UAAU,aAAa,CAC1B,SAAiB,EACjB,SAAiB,EACjB,IAAa,EACb,IAAoB,EACpB,OAA+B,EAC/B,eAAuB;AACvB,uFAAuF;AACvF,QAAuB;IAEvB,MAAM,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;IAExB;;;;;;;;;;;;;;MAcE;IACF,MAAM,QAAQ,GAAG;QACf,IAAI,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,YAAY,EAAE;QAChD,MAAM,EAAE;YACN,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC;YAC7B,KAAK,EAAE,IAAI,CAAC,QAAQ;YACpB,QAAQ,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,WAAW,EAAE;YACvD,MAAM,EAAE,QAAQ;SACjB;QACD,SAAS,EAAE;YACT,MAAM,EAAE,cAAc,CAAC,MAAM,CAAC;YAC9B,OAAO,EAAE,MAAM,CAAC,OAAO;YACvB,UAAU,EAAE,MAAM,CAAC,SAAS;YAC5B,YAAY,EAAE,MAAM,CAAC,WAAW;YAChC,6EAA6E;YAC7E,oBAAoB,EAAE,eAAe,CAAC,MAAM,CAAC,aAAa,CAAC;YAC3D,cAAc,EAAE,MAAM,CAAC,YAAY;YACnC,cAAc,EAAE,MAAM,CAAC,YAAY;YACnC,YAAY,EAAE,IAAI,CAAC,WAAW;YAC9B,qBAAqB,EAAE,MAAM,CAAC,mBAAmB;YACjD,uBAAuB,EAAE,MAAM,CAAC,cAAc;YAC9C,gBAAgB,EAAE,IAAI,CAAC,eAAe;YACtC,YAAY,EAAE,MAAM,CAAC,WAAW;YAChC,mBAAmB,EAAE,IAAI,CAAC,iBAAiB,CAAC,MAAM;SACnD;QACD,UAAU,EAAE;YACV,YAAY,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;YACtC,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC,YAAY;YACtC,WAAW,EAAE,IAAI,CAAC,KAAK,CAAC,UAAU;YAClC,eAAe,EAAE,IAAI,CAAC,KAAK,CAAC,gBAAgB;YAC5C,iBAAiB,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC;YACjE,mBAAmB,EAAE,eAAe;YACpC,KAAK,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;YAC3D,WAAW,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBACnC,IAAI,EAAE,CAAC,CAAC,QAAQ;gBAChB,gBAAgB,EAAE,CAAC,CAAC,IAAI;gBACxB,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;gBACzC,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC;aAC5C,CAAC,CAAC;SACJ;QACD,KAAK,EAAE,CAAC,GAAG,sBAAsB,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACpF,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,QAAQ,EAAE,CAAC,CAAC,QAAQ;YACpB,OAAO,EAAE,CAAC,CAAC,OAAO;SACnB,CAAC,CAAC;KACJ,CAAC;IAEF,MAAM,eAAe,CAAC,SAAS,EAAE,eAAe,EAAE,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;AAC9F,CAAC","sourcesContent":["/**\n * Executing a conversion.\n *\n * Everything is written in a single pass over the data records. All rate groups are\n * open at once and fed from the same batch of bytes, so a file is read once no\n * matter how many output tables it produces, and memory stays flat.\n */\n\nimport { createWriteStream, fstatSync } from 'node:fs';\nimport { mkdir, readdir, stat, writeFile } from 'node:fs/promises';\nimport { createHash } from 'node:crypto';\nimport { createReadStream } from 'node:fs';\nimport { finished, pipeline } from 'node:stream/promises';\nimport type { Writable } from 'node:stream';\nimport { createGzip, gzipSync } from 'node:zlib';\nimport path from 'node:path';\n\nimport type { RecordBatch } from '../edf/reader.js';\nimport { EdfFile } from '../edf/reader.js';\nimport { describeFormat, formatRates, formatWallClock } from '../edf/header.js';\nimport type { Diagnostic } from '../edf/errors.js';\nimport { EdfError } from '../edf/errors.js';\nimport type { Annotation } from '../edf/annotations.js';\nimport {\n  BufferedLineWriter,\n  DEFAULT_FLUSH_THRESHOLD,\n  UTF8_BOM,\n  csvRow,\n  escapeCsvField,\n} from '../format/csv.js';\nimport { listed } from '../format/list.js';\nimport {\n  fixed,\n  makeSampleFormatter,\n  makeTimeFormatter,\n  newOffsetBudget,\n  newSampleCacheBudget,\n} from '../format/number.js';\nimport type { SampleFormatter } from '../format/number.js';\nimport { buildPlan, withoutFileRateWarning } from './plan.js';\nimport type { ConversionPlan, PlanOptions, RateGroup } from './plan.js';\nimport { deriveRecordStarts } from './timing.js';\nimport { sampleTimeIsInRange, toleranceFor } from './time-range.js';\nimport { VERSION as TOOL_VERSION } from '../version.js';\n\nexport { TOOL_VERSION };\n\nexport type ConversionErrorCode =\n  | 'OUTPUT_EXISTS'\n  | 'OUTPUT_UNWRITABLE'\n  | 'INPUT_OUTPUT_COLLISION'\n  | 'INPUT_UNREADABLE'\n  | 'UNSUPPORTED_REQUEST'\n  | 'CALLBACK_FAILED'\n  | 'WRITE_FAILED';\n\n/**\n * Codes that mean the command cannot be carried out as written, rather than that something\n * about the file or the destination went wrong.\n *\n * The distinction is the one the exit codes draw: 1 is \"the file or the destination is the\n * problem\", 2 is \"the command line is the problem\". A caller with a `--stdout` conflict is\n * being told to change the flags — the hints say exactly that — so filing it under 1 sent\n * scripts looking at the disk. Exit 2 already covers checks that need the header first,\n * such as a `--channels` term matching nothing.\n */\nexport const USAGE_ERROR_CODES: ReadonlySet<ConversionErrorCode> = new Set(['UNSUPPORTED_REQUEST']);\n\nexport class ConversionError extends Error {\n  readonly code: ConversionErrorCode;\n  readonly hint: string | undefined;\n  constructor(code: ConversionErrorCode, message: string, hint?: string, options?: ErrorOptions) {\n    super(message, options);\n    this.name = 'ConversionError';\n    this.code = code;\n    this.hint = hint;\n  }\n}\n\nexport interface ConvertOptions extends PlanOptions {\n  /** Destination directory. Defaults to the input file's name without its extension. */\n  outputDir?: string | undefined;\n  /** Overwrite an existing output directory. */\n  force?: boolean | undefined;\n  /** Record a SHA-256 of the input in metadata.json. Costs one extra read of the file. */\n  checksum?: boolean | undefined;\n  /**\n   * Write the signal CSV to stdout instead of to a directory.\n   *\n   * Only valid when the conversion produces exactly one signal file. In the default wide\n   * layout a mixed-rate recording becomes several tables, and merging them into one stream\n   * would mean inventing the samples this tool exists not to invent; `layout: 'long'` gives\n   * one table for any recording, so it lifts the restriction. No sidecar files are written.\n   */\n  toStdout?: boolean | undefined;\n  onProgress?: ((progress: ConversionProgress) => void) | undefined;\n}\n\nexport interface ConversionProgress {\n  recordsDone: number;\n  recordsTotal: number;\n  bytesWritten: number;\n}\n\nexport interface WrittenFile {\n  name: string;\n  rows: number;\n}\n\nexport interface ConvertResult {\n  outputDir: string;\n  files: WrittenFile[];\n  /**\n   * True when a `--stdout` reader closed the pipe before the conversion finished.\n   *\n   * `edf2csv rec.edf --stdout | head -1` is an ordinary thing to type and not a failure, but\n   * it is also not a conversion: the row count is rows formatted before the close was\n   * noticed, which is neither the recording's total nor what the reader received.\n   */\n  readerHungUp: boolean;\n  annotationCount: number;\n  diagnostics: Diagnostic[];\n  plan: ConversionPlan;\n  file: EdfFile;\n  elapsedMs: number;\n}\n\ninterface OpenGroup {\n  group: RateGroup;\n  writer: BufferedLineWriter;\n  formatters: SampleFormatter[];\n  formatTime: (recordStart: number, sample: number) => string;\n  rows: number;\n  /** Resolves once a compressed stream's bytes have reached the file behind it. */\n  settled: Promise<void>;\n}\n\nexport async function convert(inputPath: string, options: ConvertOptions = {}): Promise<ConvertResult> {\n  const startedAt = Date.now();\n  const file = await EdfFile.open(inputPath);\n\n  try {\n    /*\n      Hashed before a record is read, and only published if the file held still.\n\n      A checksum taken afterwards cannot be trusted whichever descriptor it goes through. A\n      file overwritten in place keeps its inode, so the open handle sees the new bytes too,\n      and the old ones are simply gone — there is nowhere left to read what was converted.\n      Taking it first at least means the hash describes the file the header was read from.\n\n      What makes it a guarantee rather than a hope is the check at the end: if size or\n      modification time moved at any point, the hash is dropped and the run says why. So\n      `sha256` present means the file demonstrably did not change while it was read, and a\n      recording still being written gets a null and a warning instead of a plausible hash of\n      the wrong bytes. (A change reverted within the same modification timestamp would slip\n      through; nothing short of copying the input first can close that.)\n    */\n    const checksumAtOpen = options.checksum === true ? await file.sha256() : null;\n\n    // One pass over the annotation channel supplies everything annotation-related:\n    // where each record sits in time, and the full event list. It reads the whole\n    // file even when a window was requested, because an annotation inside the window\n    // may be stored in a record outside it.\n    const annotationData =\n      file.annotationSignals.length > 0\n        ? await file.readAnnotations()\n        : { annotations: [] as Annotation[], recordStarts: [] as (number | null)[], malformed: 0 };\n\n    const timing = deriveRecordStarts(file, annotationData);\n\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      options,\n    );\n    plan.diagnostics.push(...timing.diagnostics);\n\n    if (options.toStdout === true) {\n      if (!plan.writeSignals) {\n        throw new ConversionError(\n          'UNSUPPORTED_REQUEST',\n          '--stdout has no signal data to write because --annotations-only was given.',\n          'Drop one of the two flags.',\n        );\n      }\n      /*\n        No table at all is its own answer, and neither layout gave it.\n\n        A recording with no signal channels — one holding only EDF+ annotations — produced\n        zero rate groups. The wide layout then said \"--stdout needs exactly one table, but\n        this recording produces 0, one for each sampling rate its channels use ()\", with an\n        empty parenthetical, advice to narrow to one of no rates, and advice to use\n        `--layout long` — which wrote zero bytes to stdout, not even a header row, and exited\n        0 while warning that \"the signal files hold their headers and no data\". There were no\n        files and there was no header. The one path that was right about this is\n        `--annotations-only`, which refuses outright, and this is the same situation reached\n        by a different route.\n      */\n      if (plan.groups.length === 0) {\n        throw new ConversionError(\n          'UNSUPPORTED_REQUEST',\n          file.dataSignals.length === 0\n            ? '--stdout has no signal data to write: this recording has no signal channels, ' +\n              'only EDF+ annotations.'\n            : '--stdout has no signal data to write: nothing was selected that carries samples.',\n          file.dataSignals.length === 0\n            ? 'Convert to a directory to get its annotations.csv, or drop --stdout.'\n            : 'Check --channels and the requested window, or convert to a directory instead.',\n        );\n      }\n\n      // The long layout is one table whatever the rates are, so it has nothing to refuse.\n      if (plan.layout !== 'long' && plan.groups.length !== 1) {\n        throw new ConversionError(\n          'UNSUPPORTED_REQUEST',\n          // Naming the rates is the point: the hint says to narrow the selection, and this\n          // is what there is to narrow it to. The parenthetical used to repeat the count\n          // that had just been given — \"produces 3 (its channels use 3 different sampling\n          // rates)\" — which told nobody anything they could act on.\n          `--stdout needs exactly one table, but this recording produces ${plan.groups.length}, ` +\n            `one for each sampling rate its channels use ` +\n            `(${listed(formatRates(plan.groups.map((g) => g.rate)).map((r) => `${r} Hz`))}).`,\n          'Narrow it to one rate with --channels, write --layout long to get them all in ' +\n            'one table, or convert to a directory instead.',\n        );\n      }\n      let readerHungUp = false;\n      const written = await writeSignalFiles(file, plan, null, timing.starts, options, (hungUp) => {\n        readerHungUp = hungUp;\n      });\n      if (await file.changedSinceOpen()) plan.diagnostics.push(inputChanged(false));\n      return {\n        outputDir: '-',\n        files: written,\n        readerHungUp,\n        annotationCount: 0,\n        diagnostics: [...withoutFileRateWarning(file.diagnostics), ...plan.diagnostics],\n        plan,\n        file,\n        elapsedMs: Date.now() - startedAt,\n      };\n    }\n\n    const outputDir = options.outputDir ?? defaultOutputDir(inputPath);\n    await assertInputDoesNotOverlapOutputs(inputPath, outputDir, file, plan, options);\n    await prepareOutputDir(outputDir, options.force === true);\n\n    const written: WrittenFile[] = [];\n\n    if (plan.writeSignals && plan.groups.length > 0) {\n      const signals = await writeSignalFiles(file, plan, outputDir, timing.starts, options);\n      written.push(...signals);\n    } else if (plan.writeSignals) {\n      /*\n        Asked for signal data and given none to write.\n\n        Every channel selected carries zero samples per record, so there is no table to make\n        — `edf2csv rec.edf --channels unused` writes channels.csv and metadata.json and no\n        signals.csv at all. The NO_SAMPLES warning explains the channel; nothing explained the\n        missing file, and the documentation says signals.csv is written unless\n        --annotations-only was passed. Someone looking for it should be told where it went.\n\n        There are two ways to arrive with no groups, and the wording above is only true of\n        one of them. A recording that holds nothing but EDF+ annotations has no channel that\n        could have been selected, its channels.csv is a header row and nothing else, and no\n        channel of it carries samples — so \"every channel selected\", \"channels.csv still\n        describes them\" and \"which channels do carry samples\" were three false statements in\n        one warning, printed under a warning that had just said the file has no signal\n        channels. `--stdout` distinguishes the two cases a few lines up and `--info` prints\n        one accurate line; this path was the only one that did not.\n      */\n      const noChannelsAtAll = file.dataSignals.length === 0;\n      plan.diagnostics.push({\n        code: 'NO_SAMPLES',\n        severity: 'warning',\n        message: noChannelsAtAll\n          ? 'No signal file was written: there is no signal data in this recording to put in ' +\n            'one.'\n          : 'No signal file was written: every channel selected carries zero samples per data ' +\n            'record, so there is nothing to put in one.',\n        hint: noChannelsAtAll\n          ? 'annotations.csv holds whatever events it carries. channels.csv lists signal ' +\n            'channels, so it has none to list.'\n          : 'channels.csv still describes them. Run with --info to see which channels do carry ' +\n            'samples.',\n      });\n    }\n\n    if (options.annotationsOnly === true && file.annotationSignals.length === 0) {\n      plan.diagnostics.push({\n        code: 'NO_ANNOTATIONS',\n        severity: 'warning',\n        message:\n          '--annotations-only was requested but this recording has no annotation channel, ' +\n          'so there are no events to export.',\n        hint: 'Plain EDF files carry no annotations. Convert without --annotations-only to get the signals.',\n      });\n    }\n\n    let annotationsWritten = 0;\n    if (file.annotationSignals.length > 0) {\n      const result = await writeAnnotationsCsv(\n        outputDir,\n        annotationData.annotations,\n        requestedAnnotationWindow(options, plan.range.recordingStartSeconds),\n        options.gzip === true,\n        options.bom === true,\n      );\n      written.push(result);\n      annotationsWritten = result.rows;\n    }\n\n    written.push(\n      await writeChannelsCsv(outputDir, file, plan, options.gzip === true, options.bom === true),\n    );\n\n    /*\n      The file moved under the conversion. Said out loud, because nothing else shows it.\n\n      The CSVs are still correct for the records that were read, and metadata.json still\n      describes the file as it was opened — so the record is consistent with the output\n      whatever happens here. What stops being true is that the checksum describes the bytes\n      that were converted, since an in-place overwrite leaves nowhere to read them from. It\n      is dropped rather than guessed at.\n    */\n    const changed = await file.changedSinceOpen();\n    if (changed) plan.diagnostics.push(inputChanged(options.checksum === true));\n\n    await writeMetadata(\n      outputDir,\n      inputPath,\n      file,\n      plan,\n      written,\n      annotationsWritten,\n      changed ? null : checksumAtOpen,\n    );\n\n    const stale = await findStaleOutput(outputDir, written);\n\n    return {\n      outputDir,\n      files: written,\n      readerHungUp: false,\n      annotationCount: annotationsWritten,\n      diagnostics: [...withoutFileRateWarning(file.diagnostics), ...plan.diagnostics, ...stale],\n      plan,\n      file,\n      elapsedMs: Date.now() - startedAt,\n    };\n  } finally {\n    await file.close();\n  }\n}\n\n/*\n  Files this tool produces, used to spot leftovers from an earlier conversion.\n\n  The rate part has to allow every shape a filename can now take, not just the plain ones:\n\n    signals_256hz.csv         an integer rate\n    signals_12_5hz.csv        a fractional rate, decimal point written as an underscore\n    signals_1_000e-7hz.csv    a rate small enough to need exponent form  (0.2.2)\n    signals_256hz.csv.gz      any of the above, compressed                (0.3.0)\n    signals_0hz_2.csv         a second group whose rate slug collided    (0.2.1)\n\n  The previous `[\\w.]+hz` matched neither of the last two — `-` and `+` are not word\n  characters, and the collision suffix falls after the `hz`. Both were introduced by\n  recent changes and both silently stopped being recognised as this tool's own output, so\n  leftovers of exactly those kinds went unreported: the one situation the warning exists\n  for. Requiring a digit after the underscore keeps a user's own `signals_notes.csv` out.\n*/\nconst OUTPUT_PATTERN =\n  /^(signals(_\\d[\\w.+-]*hz(_\\d+)?)?\\.csv(\\.gz)?|annotations\\.csv(\\.gz)?|channels\\.csv(\\.gz)?|metadata\\.json)$/u;\n\n/**\n * Detect output from a previous run that this one did not replace.\n *\n * `--force` overwrites files but does not empty the directory, so converting a\n * mixed-rate recording and then a single-rate one into the same place leaves\n * `signals_256hz.csv` sitting next to a fresh `signals.csv`. Both look current.\n * Nothing is deleted here — the user is told, and decides.\n */\nasync function findStaleOutput(\n  outputDir: string,\n  written: readonly WrittenFile[],\n): Promise<Diagnostic[]> {\n  const entries = await readdir(outputDir).catch(() => null);\n  if (!entries) return [];\n\n  // metadata.json is rewritten on every run but is not part of the reported file list.\n  const fresh = new Set([...written.map((f) => f.name), 'metadata.json']);\n  const stale = entries.filter((name) => OUTPUT_PATTERN.test(name) && !fresh.has(name)).sort();\n  if (stale.length === 0) return [];\n\n  return [\n    {\n      code: 'STALE_OUTPUT',\n      severity: 'warning',\n      message:\n        `${stale.join(', ')} ${stale.length === 1 ? 'is' : 'are'} left over from an earlier ` +\n        `conversion into this directory and ${stale.length === 1 ? 'was' : 'were'} not rewritten.`,\n      hint: 'Delete them, or convert into a fresh directory, so the two runs do not get mixed up.',\n    },\n  ];\n}\n\nexport function defaultOutputDir(inputPath: string): string {\n  const base = path.basename(inputPath, path.extname(inputPath));\n  return path.join(path.dirname(inputPath), `${base}_csv`);\n}\n\n/** Never let an output target resolve to the recording being read, even with --force. */\nasync function assertInputDoesNotOverlapOutputs(\n  inputPath: string,\n  outputDir: string,\n  file: EdfFile,\n  plan: ConversionPlan,\n  options: ConvertOptions,\n): Promise<void> {\n  /*\n    The names this run will actually write, compressed ones included.\n\n    The rate files come from the plan and already carry `.csv.gz` under --gzip; the sidecars\n    were spelled out here and did not. So a compressed run checked two names it would never\n    write and missed the two it would: a recording sitting at <outdir>/channels.csv.gz was\n    overwritten by its own conversion, with --force, reported as a success. The same file\n    named signals.csv.gz was refused, which is what gives the oversight away.\n  */\n  const suffix = options.gzip === true ? '.csv.gz' : '.csv';\n  const names = new Set(plan.groups.map((group) => group.fileName));\n  if (file.annotationSignals.length > 0) names.add(`annotations${suffix}`);\n  names.add(`channels${suffix}`);\n  names.add('metadata.json');\n\n  const inputResolved = path.resolve(inputPath);\n  const inputInfo = await stat(inputPath);\n\n  for (const name of names) {\n    const target = path.join(outputDir, name);\n    const targetResolved = path.resolve(target);\n    const targetInfo = await stat(target).catch(() => null);\n    const samePath = targetResolved === inputResolved;\n    const sameFile =\n      targetInfo !== null && targetInfo.dev === inputInfo.dev && targetInfo.ino === inputInfo.ino;\n    if (!samePath && !sameFile) continue;\n\n    throw new ConversionError(\n      'INPUT_OUTPUT_COLLISION',\n      `Output file \"${target}\" is the same file as the input recording.`,\n      'Choose a separate directory with --out. The input was not modified.',\n    );\n  }\n}\n\nasync function prepareOutputDir(dir: string, force: boolean): Promise<void> {\n  /*\n    Claim the directory with a single atomic mkdir rather than asking whether it exists\n    and then creating it.\n\n    Checking first left a window between the two: two conversions started together both\n    saw \"not there\", both proceeded, and both opened write streams on the same signals.csv.\n    Neither reported anything — both exited 0, having half-written one file between them.\n    A non-recursive mkdir cannot do that. Exactly one caller creates the directory; every\n    other one gets EEXIST from the filesystem and takes the already-exists path below.\n\n    Parents are still created recursively, since --out ./a/b/c should work. Only the final\n    component is the claim.\n  */\n  const parent = path.dirname(dir);\n  if (parent && parent !== dir) {\n    try {\n      await mkdir(parent, { recursive: true });\n    } catch (cause: unknown) {\n      // A parent that is a regular file surfaces as EEXIST naming the parent, which reads\n      // as though the destination already exists rather than as \"you cannot put a\n      // directory inside a file\". Name the real obstacle instead of the errno.\n      const info = await stat(parent).catch(() => null);\n      if (info && !info.isDirectory()) {\n        throw new ConversionError(\n          'OUTPUT_UNWRITABLE',\n          `Cannot create \"${dir}\": \"${parent}\" is a file, not a directory.`,\n          'Choose a destination whose parent directories are directories, with --out.',\n        );\n      }\n      throw new ConversionError(\n        'OUTPUT_UNWRITABLE',\n        `Cannot create \"${dir}\": ${describeFsError(cause)}.`,\n        'Check the path exists and that you have permission to write there.',\n      );\n    }\n  }\n\n  let claimed = true;\n  try {\n    await mkdir(dir);\n  } catch (cause: unknown) {\n    if ((cause as NodeJS.ErrnoException).code !== 'EEXIST') {\n      throw new ConversionError(\n        'OUTPUT_UNWRITABLE',\n        `Cannot create \"${dir}\": ${describeFsError(cause)}.`,\n        'Check the path exists and that you have permission to write there.',\n      );\n    }\n    claimed = false;\n  }\n\n  if (!claimed) {\n    const existing = await stat(dir).catch(() => null);\n\n    // --force means \"replace my previous output\", not \"write output files into\n    // whatever this happens to be\". Pointing it at a regular file needs saying so.\n    if (existing && !existing.isDirectory()) {\n      throw new ConversionError(\n        'OUTPUT_UNWRITABLE',\n        `\"${dir}\" is a file, but the converted data needs a directory.`,\n        'Choose a directory with --out.',\n      );\n    }\n    if (!force) {\n      throw new ConversionError(\n        'OUTPUT_EXISTS',\n        `\"${dir}\" already exists.`,\n        'Pass --force to overwrite it, or --out to choose a different directory.',\n      );\n    }\n  }\n}\n\n/** Turn a Node filesystem error into something a person can act on. */\nfunction describeFsError(cause: unknown): string {\n  const code = (cause as NodeJS.ErrnoException | undefined)?.code;\n  if (code === 'EACCES' || code === 'EPERM') return 'permission denied';\n  if (code === 'ENOSPC') return 'the disk is full';\n  if (code === 'ENOTDIR') return 'part of the path is a file, not a directory';\n  if (code === 'EROFS') return 'the filesystem is read-only';\n  if (code === 'ENAMETOOLONG') return 'the path is too long';\n  return cause instanceof Error ? cause.message : String(cause);\n}\n\nasync function writeSignalFiles(\n  file: EdfFile,\n  plan: ConversionPlan,\n  outputDir: string | null,\n  recordStarts: Float64Array | null,\n  options: ConvertOptions,\n  onHangUp?: (hungUp: boolean) => void,\n): Promise<WrittenFile[]> {\n  // One budget for every table in this conversion, not one per table: see OffsetBudget.\n  const offsets = newOffsetBudget();\n  // Likewise one for every channel, not one per channel: see SampleCacheBudget.\n  const sampleCaches = newSampleCacheBudget();\n  // Only the stdout path needs this; --out finds a full disk on its own, because it always\n  // has another file to write afterwards. See auditStdout.\n  const audit = outputDir === null ? auditStdout() : null;\n  /*\n    In the long layout every group writes into one table, so they share one stream. Opening\n    a stream per group on the same path is what the rate-slug collision fix in groupByRate\n    was about: two writers on one file interleave rows under a header naming one of them.\n  */\n  let shared: {\n    stream: Writable;\n    settled: Promise<void>;\n    target: Writable;\n    writer: BufferedLineWriter;\n  } | null = null;\n\n  /*\n    One buffer's worth of memory for the conversion, not one per table.\n\n    Every group had its own writer at the default 1 MiB threshold, so pending output was\n    group count × 1 MiB before anything drained. A 6.5 MB recording with 40 sampling rates\n    — the header allows thousands of channels, and a research montage really does mix a\n    dozen rates — died with a raw V8 heap out-of-memory and exit 134 under a 96 MB cap,\n    while the site advertises 48 MB. The recording is small; it is the fan-out that is not.\n\n    Split evenly with a floor, so the single-rate case, which is nearly every recording,\n    keeps exactly the buffer it always had, and forty tables cost 2.5 MB rather than 40.\n    The long layout shares one writer already and is unaffected either way.\n  */\n  const MIN_FLUSH_THRESHOLD = 8 * 1024;\n  const flushThreshold = Math.max(\n    MIN_FLUSH_THRESHOLD,\n    Math.floor(DEFAULT_FLUSH_THRESHOLD / Math.max(1, plan.groups.length)),\n  );\n  /*\n    The stream's own buffer is the other half of the same sum.\n\n    0.5.6 shared the line-buffer budget and left `createWriteStream` at its 64 KiB default,\n    which is per stream: 200 rate groups meant 12.8 MB of stream buffer on top of 12.8 MB of\n    line buffer, and an 855 KB recording still died at a 48 MB cap. Shared the same way, with\n    a floor that keeps an ordinary conversion writing in useful-sized pieces.\n  */\n  const streamBuffer = Math.max(\n    16 * 1024,\n    Math.floor(DEFAULT_FLUSH_THRESHOLD / Math.max(1, plan.groups.length)),\n  );\n\n  const open: OpenGroup[] = plan.groups.map((group, groupIndex) => {\n    // A null directory means the single table goes to stdout. process.stdout is already a\n    // writable stream, so the same buffered writer and backpressure handling apply.\n    const target =\n      shared?.target ??\n      (outputDir === null\n        ? process.stdout\n        : createWriteStream(path.join(outputDir, group.fileName), {\n            highWaterMark: streamBuffer,\n          }));\n    const { stream, settled } = shared ?? compressed(target, options.gzip === true);\n    /*\n      Under --gzip the writer feeds the compressor, so its byte count is the CSV before\n      compression and says nothing about what reached the descriptor. The compressor's own\n      output is what stdout is handed, so that is what is counted. `pipe` uses a 'data'\n      listener of its own and a second one is delivered the same chunks.\n\n      Once per stream, which in the long layout is once for all the groups. Attaching per\n      group put N listeners on the one shared compressor, so every chunk was counted N\n      times: `--stdout --layout long --gzip` on a 40-rate recording claimed 622,240 of\n      622,240 bytes where 15,556 had been written, failed with a disk-full error over a\n      perfectly good file, and printed Node's MaxListenersExceededWarning to stderr on the\n      way past ten. 0.5.4 fixed the same arithmetic in the uncompressed branch and left\n      this one, because the uncompressed branch is where the count is a sum and this one is\n      where it is a subscription.\n    */\n    if (audit && stream !== target && !shared) {\n      stream.on('data', (chunk: Buffer) => audit.count(chunk.length));\n    }\n    /*\n      One writer, not one per group, when the table is shared. Separate writers over one\n      stream each hold their own buffer and flush on their own schedule, so the rows would\n      reach the file in whatever order the buffers filled — which is not the order they\n      were produced in, and the long layout's whole claim is that its rows are in time\n      order.\n    */\n    const writer = shared?.writer ?? new BufferedLineWriter(stream, flushThreshold);\n    if (plan.layout === 'long' && !shared) shared = { stream, settled, target, writer };\n\n    // Only the first group writes the header of a shared table, and the mark before it.\n    if (plan.layout !== 'long' || groupIndex === 0) {\n      if (options.bom === true) writer.push(UTF8_BOM);\n      writer.pushLine(\n        plan.layout === 'long'\n          ? csvRow(['time_s', 'channel', 'value'])\n          : csvRow(['time_s', ...group.channels.map((c) => c.column)]),\n      );\n    }\n    return {\n      group,\n      writer,\n      formatters: group.channels.map((c) => makeSampleFormatter(c.signal, c.decimals, sampleCaches)),\n      formatTime: makeTimeFormatter(\n        group.samplesPerRecord,\n        group.rate,\n        group.timeDecimals,\n        offsets,\n      ),\n      rows: 0,\n      settled,\n    };\n  });\n\n  try {\n    const written = await streamSignalRows(file, plan, open, recordStarts, options);\n\n    /*\n      Checked once everything has been flushed and ended, and not when the reader hung up.\n\n      `--stdout | head -1` closes the pipe on purpose, which is a shell idiom rather than a\n      failure. A pipe is not a regular file, so auditStdout declines it anyway — the second\n      guard is here because the cost of getting this one wrong is reporting a failure for a\n      command that worked.\n    */\n    if (audit) {\n      // Uncompressed, the writer hands its bytes straight to the descriptor; compressed,\n      // they were counted on the compressor's way out.\n      if (options.gzip !== true) {\n        /*\n          Once per writer, not once per group. The long layout gives every group the same\n          writer, so counting per group multiplied its byte total by the number of rates:\n          `--stdout --layout long` on a three-rate recording handed over 32,043 bytes, was\n          credited with 96,129, and failed with a disk-full error for a file that was\n          complete on disk. It only showed with stdout redirected to a regular file, since\n          that is the one case the audit applies to — which is the command the --layout\n          documentation gives.\n        */\n        for (const writer of new Set(open.map((entry) => entry.writer))) {\n          audit.count(writer.bytesOut);\n        }\n      }\n      if (!open.some((entry) => entry.writer.hungUp)) audit.verify();\n    }\n    onHangUp?.(open.some((entry) => entry.writer.hungUp));\n    return written;\n  } catch (cause) {\n    for (const entry of open) entry.writer.destroy();\n\n    /*\n      Reading and writing both fail through here, and both were reported as writing.\n\n      A recording that shrinks mid-conversion — still being written by the acquisition\n      software, say — raises the reader's own error, which names the record and says the\n      file changed size while it was being read. That precise diagnosis was then filed under\n      `Writing to \"<dir>\" failed` and given the hint about freeing disk space, which sends\n      someone to look at the one part of the system that was working.\n\n      The reader's message and its advice are kept; only the note about partial output is\n      added, since that much is true of either failure.\n    */\n    // A ConversionError arrived already saying what went wrong — a callback that threw, say.\n    // Wrapping it again turned \"the onProgress callback threw\" into `Writing to \"out\"\n    // failed: the onProgress callback threw`, under a hint about checking the destination.\n    if (cause instanceof ConversionError) throw cause;\n\n    if (cause instanceof EdfError) {\n      const where = outputDir === null ? 'stdout' : `\"${outputDir}\"`;\n      throw new ConversionError(\n        'INPUT_UNREADABLE',\n        cause.message,\n        `${cause.hint ? `${cause.hint} ` : ''}What was written to ${where} before it failed is ` +\n          `incomplete and should not be used.`,\n      );\n    }\n\n    const detail = cause instanceof Error ? cause.message : String(cause);\n    throw new ConversionError(\n      'WRITE_FAILED',\n      `Writing to ${outputDir === null ? 'stdout' : `\"${outputDir}\"`} failed: ${detail}`,\n      writeHint(cause, outputDir === null),\n    );\n  }\n}\n\n/**\n * One record's samples in the long layout: `time_s,channel,value`, in time order.\n *\n * The groups are merged rather than written one after another. Every sample in a record\n * falls inside that record's span, so taking the earliest next sample across the groups\n * each time leaves the whole file sorted by `time_s` — which is the only thing that makes a\n * mixed-rate long table useful, since sorting 3 million rows afterwards is the reader's\n * problem and a large one.\n *\n * Ties go to the group with the higher rate, which is the order the groups are already in.\n * Within a sample time the channels come out in the order the file declares them.\n */\n/**\n * Whether two sample times are close enough that only rounding could separate them.\n *\n * A relative epsilon, because the gap between doubles grows with magnitude. Well below any\n * real sample interval — the finest a recording can declare is bounded by its record\n * duration and samples-per-record fields — and well above the one-ULP disagreement that two\n * exact divisions of the same instant produce.\n */\nfunction nearlyEqual(a: number, b: number): boolean {\n  return Math.abs(a - b) <= Math.max(Math.abs(a), Math.abs(b)) * 1e-12;\n}\n\n/** The chosen instant as it will be written, for deciding which channels share it. */\nfunction formatAt(\n  open: readonly OpenGroup[],\n  cursors: Int32Array,\n  recordStart: number,\n  earliest: number,\n): string {\n  for (let g = 0; g < open.length; g++) {\n    const entry = open[g];\n    if (!entry) continue;\n    const sample = cursors[g] ?? 0;\n    if (sample >= entry.group.samplesPerRecord) continue;\n    if (recordStart + sample / entry.group.rate === earliest) {\n      return entry.formatTime(recordStart, sample);\n    }\n  }\n  return '';\n}\n\nasync function writeLongRecord(\n  file: EdfFile,\n  open: readonly OpenGroup[],\n  batch: RecordBatch,\n  recordInBatch: number,\n  recordStart: number,\n  range: ConversionPlan['range'],\n): Promise<void> {\n  const writer = open[0]?.writer;\n  if (!writer) return;\n\n  const cursors = new Int32Array(open.length);\n  /* Reused across sample times so a three-million-row conversion allocates one of these. */\n  const due: { entry: OpenGroup; groupIndex: number; sample: number; channel: number }[] = [];\n\n  for (;;) {\n    let earliest = Infinity;\n    for (let g = 0; g < open.length; g++) {\n      const entry = open[g];\n      if (!entry) continue;\n      const sample = cursors[g] ?? 0;\n      if (sample >= entry.group.samplesPerRecord) continue;\n      const time = recordStart + sample / entry.group.rate;\n      if (time < earliest) earliest = time;\n    }\n    if (earliest === Infinity) return;\n\n    /*\n      Everything at this instant, in the order the file declares its channels.\n\n      Groups are ordered by rate, largest first, because that is how the wide layout names\n      its files. Emitting a tie group by group therefore ordered the channels by descending\n      sampling rate — so a recording declaring `slow, medium, fast` wrote `fast, medium,\n      slow`, while the documentation promised file order and channels.csv listed file order.\n      Signal index is the file's own order, and the only one a reader can predict.\n\n      \"At this instant\" is decided on the time as written, not on the double. `s / rate` for\n      two channels at one moment need not give the same double: a 0.3 s record holding 12 and\n      4 samples makes 40 Hz and 13.333… Hz, and 9/40 is 0.22500000000000000555 while 3/13.333…\n      is 0.22499999999999997780. Equality missed that, so those two rows fell out in numeric\n      order — `slow` before `fast`, once, in the middle of a file that was otherwise right.\n\n      Two rows are at one time exactly when they carry the same `time_s`, which is the only\n      definition a reader of the CSV can apply. The numeric pre-filter keeps the common case\n      to one comparison; formatting happens only for candidates already within a hair.\n    */\n    const earliestText = formatAt(open, cursors, recordStart, earliest);\n    due.length = 0;\n    for (let g = 0; g < open.length; g++) {\n      const entry = open[g];\n      if (!entry) continue;\n      const sample = cursors[g] ?? 0;\n      if (sample >= entry.group.samplesPerRecord) continue;\n      const time = recordStart + sample / entry.group.rate;\n      if (time !== earliest) {\n        // Far away in the ordinary case; only a near-tie is worth formatting.\n        if (!nearlyEqual(time, earliest)) continue;\n        if (entry.formatTime(recordStart, sample) !== earliestText) continue;\n      }\n      cursors[g] = sample + 1;\n      // Same window rule as the wide layout, with the same per-rate slack.\n      if (\n        !sampleTimeIsInRange(earliest, range.startSeconds, range.endSeconds, toleranceFor(entry.group.rate))\n      ) {\n        continue;\n      }\n      for (let c = 0; c < entry.group.channels.length; c++) {\n        due.push({ entry, groupIndex: g, sample, channel: c });\n      }\n    }\n    if (due.length === 0) continue;\n    if (due.length > 1) {\n      due.sort(\n        (a, b) =>\n          (a.entry.group.channels[a.channel]?.signal.index ?? 0) -\n          (b.entry.group.channels[b.channel]?.signal.index ?? 0),\n      );\n    }\n\n    for (const item of due) {\n      const channel = item.entry.group.channels[item.channel];\n      const format = item.entry.formatters[item.channel];\n      if (!channel || !format) continue;\n      if (writer.hungUp) return;\n      writer.pushLine(\n        `${item.entry.formatTime(recordStart, item.sample)},${escapeCsvField(channel.column)},` +\n          `${format(file.sampleAt(batch, recordInBatch, channel.signal, item.sample))}`,\n      );\n      item.entry.rows++;\n      // Flushed inside the record for the same reason the wide layout is; see there.\n      if (writer.full) await writer.flush();\n    }\n  }\n}\n\nasync function streamSignalRows(\n  file: EdfFile,\n  plan: ConversionPlan,\n  open: OpenGroup[],\n  recordStarts: Float64Array | null,\n  options: ConvertOptions,\n): Promise<WrittenFile[]> {\n  const { startSeconds, endSeconds, startRecord, endRecord } = plan.range;\n  const { recordDuration } = file.header;\n  let recordsDone = 0;\n\n  /*\n    Every destination has hung up, so nothing formatted from here on could reach anyone.\n    `--stdout | head -1` is the usual way to arrive here: the reader takes one line and\n    closes the pipe while the conversion is still near the start of the recording.\n\n    Stopping also makes the reported row count mean what it says — rows that reached the\n    consumer, rather than rows the loop went on formatting into a discarded buffer.\n  */\n  const allHungUp = (): boolean => open.length > 0 && open.every((entry) => entry.writer.hungUp);\n\n  for await (const batch of file.readRecords({ startRecord, endRecord })) {\n    if (allHungUp()) break;\n    for (let r = 0; r < batch.recordCount; r++) {\n      if (allHungUp()) break;\n      const index = batch.firstRecordIndex + r;\n      const recordStart = recordStarts ? (recordStarts[index] ?? index * recordDuration) : index * recordDuration;\n\n      if (plan.layout === 'long') {\n        await writeLongRecord(file, open, batch, r, recordStart, plan.range);\n        recordsDone++;\n        continue;\n      }\n\n      for (const entry of open) {\n        const { group, writer, formatters, formatTime } = entry;\n        const { channels, rate } = group;\n        // Slack that never reaches the next sample; see toleranceFor.\n        const slack = toleranceFor(rate);\n\n        for (let sample = 0; sample < group.samplesPerRecord; sample++) {\n          const time = recordStart + sample / rate;\n          if (!sampleTimeIsInRange(time, startSeconds, endSeconds, slack)) continue;\n\n          let row = formatTime(recordStart, sample);\n          for (let c = 0; c < channels.length; c++) {\n            const channel = channels[c];\n            const format = formatters[c];\n            if (!channel || !format) continue;\n            row += ',' + format(file.sampleAt(batch, r, channel.signal, sample));\n          }\n          if (writer.hungUp) break;\n          writer.pushLine(row);\n          entry.rows++;\n\n          /*\n            Flushed inside the record, not only at the end of one.\n\n            The buffer was drained once per record, so the rows of a single record piled up\n            with nothing emptying them — memory followed samples-per-record rather than the\n            batch size the writer exists to hold to. One record of 16,000,000 samples died\n            with a heap out of memory under a 256 MB cap, while the same 32 MB of samples\n            split into 16,000 records converted to the same 283 MB CSV without trouble. The\n            format allows either layout and says nothing about which to expect.\n\n            `full` is a synchronous read of the pending size, so the twenty million rows that\n            are not at a boundary cost a comparison rather than a microtask each.\n          */\n          if (writer.full) await writer.flush();\n        }\n        await writer.maybeFlush();\n      }\n\n      recordsDone++;\n    }\n\n    if (options.onProgress) {\n      /*\n        A caller's callback is the caller's, and its failures are not the destination's.\n\n        This ran inside the same try that turns a stream failure into WRITE_FAILED, so a\n        progress callback that threw came back as `Writing to \"out\" failed: caller bug`,\n        advising the reader to check a destination that was working perfectly. It is the\n        same misattribution the write hints had until 0.4.36, one layer up.\n\n        The original is kept as `cause`, so the stack that actually matters survives, and\n        the conversion still stops — the callback threw, and carrying on writing into a\n        directory whose owner has just failed is not an improvement.\n      */\n      try {\n        options.onProgress({\n          recordsDone,\n          recordsTotal: endRecord - startRecord,\n          // Once per writer: the long layout's groups share one, so summing per group\n          // reported a figure larger than the file being written.\n          bytesWritten: [...new Set(open.map((entry) => entry.writer))].reduce(\n            (sum, entry) => sum + entry.charsWritten,\n            0,\n          ),\n        });\n      } catch (cause) {\n        throw new ConversionError(\n          'CALLBACK_FAILED',\n          `The onProgress callback threw: ${cause instanceof Error ? cause.message : String(cause)}`,\n          'This is the caller\\'s callback, not the recording or the destination. Whatever was ' +\n            'written before it threw is incomplete and should not be used.',\n          { cause },\n        );\n      }\n    }\n  }\n\n  const closed = new Set<BufferedLineWriter>();\n  for (const entry of open) {\n    if (closed.has(entry.writer)) continue;\n    closed.add(entry.writer);\n    await entry.writer.end();\n    // With --gzip the writer's stream is the compressor, whose end callback fires when the\n    // compressor is done rather than when the file behind it is. Awaiting only that would\n    // report success with the tail of the file still in flight.\n    await entry.settled;\n  }\n\n  // A shared table is one file, and its row count is every group's rows, not the first's.\n  if (plan.layout === 'long') {\n    const first = open[0];\n    if (!first) return [];\n    return [{ name: first.group.fileName, rows: open.reduce((sum, e) => sum + e.rows, 0) }];\n  }\n  return open.map((entry) => ({ name: entry.group.fileName, rows: entry.rows }));\n}\n\n/**\n * The stream rows are written to, plus a promise for the data reaching its destination.\n *\n * Compression sits between the writer and the file as a transform. Failures below it — a\n * full disk, an unwritable path — surface on the file stream, where nothing is listening,\n * so they are forwarded onto the compressor: that is the stream the writer watches, and\n * routing them there keeps one error path rather than two.\n */\nfunction compressed(target: Writable, gzip: boolean): { stream: Writable; settled: Promise<void> } {\n  if (!gzip) return { stream: target, settled: Promise.resolve() };\n  const compressor = createGzip();\n  target.on('error', (error: Error) => compressor.destroy(error));\n\n  /*\n    pipe() ends its destination when the source ends, and stdout must survive the\n    conversion: the writer already refuses to close it, because a closed stdout breaks\n    every later write in the process. Nothing waits on stdout either — it is not this\n    tool's to finish.\n  */\n  const toStdout = target === process.stdout;\n  compressor.pipe(target, { end: !toStdout });\n  if (toStdout) return { stream: compressor, settled: Promise.resolve() };\n\n  /*\n    A failure under the compressor rejects both this promise and the writer's own end(),\n    and end() is the one awaited first. Without a handler attached here that rejection\n    belonged to nobody, and Node killed the process over it: `--gzip` into an unwritable\n    path printed a raw EISDIR stack trace instead of the ordinary \"Writing to ... failed\"\n    message and exit 1, which is what the same path does uncompressed.\n\n    Attaching the handler is enough to make it handled. Awaiting `settled` downstream still\n    reports the failure in the case where end() happened to succeed.\n  */\n  const settled = finished(target);\n  settled.catch(() => {});\n  return { stream: compressor, settled };\n}\n\n/**\n * Write one of the sidecar files, reporting a failure the way the signal writer does.\n *\n * These three used to call `writeFile` bare, so a failure escaped as whatever the\n * filesystem said — `EISDIR: illegal operation on a directory, open '...'` with no hint\n * and, more importantly, no mention that the signal files had already been written. The\n * conversion stopped half-done and the message gave no sign of it.\n */\nasync function writeOutputFile(\n  outputDir: string,\n  name: string,\n  contents: string,\n  gzip = false,\n  bom = false,\n): Promise<void> {\n  // metadata.json never gets one: JSON.parse rejects a leading U+FEFF, so a mark there\n  // would break every reader of the file to help a spreadsheet that will not open it.\n  if (bom) contents = UTF8_BOM + contents;\n  try {\n    // The sidecars are built in memory before being written, so compressing them in memory\n    // costs nothing extra. Only the signal tables are large enough to need a stream.\n    await writeFile(path.join(outputDir, name), gzip ? gzipSync(contents) : contents, gzip ? undefined : 'utf8');\n  } catch (cause) {\n    const detail = cause instanceof Error ? cause.message : String(cause);\n    throw new ConversionError(\n      'WRITE_FAILED',\n      `Writing \"${name}\" to \"${outputDir}\" failed: ${detail}`,\n      writeHint(cause),\n    );\n  }\n}\n\nasync function writeChannelsCsv(\n  outputDir: string,\n  file: EdfFile,\n  plan: ConversionPlan,\n  gzip: boolean,\n  bom: boolean,\n): Promise<WrittenFile> {\n  const includedColumns = new Set(plan.groups.flatMap((g) => g.channels.map((c) => c.signal.index)));\n  const fileFor = new Map<number, string>();\n  for (const group of plan.groups) {\n    for (const channel of group.channels) fileFor.set(channel.signal.index, group.fileName);\n  }\n\n  const lines = [\n    csvRow([\n      'column',\n      'signal_index',\n      'label',\n      'unit',\n      'sampling_rate_hz',\n      'samples_per_record',\n      'physical_min',\n      'physical_max',\n      'digital_min',\n      'digital_max',\n      'transducer',\n      'prefiltering',\n      'output_file',\n      'converted',\n    ]),\n  ];\n\n  for (const signal of file.header.signals) {\n    if (signal.isAnnotations) continue;\n    const column = plan.columnNames.get(signal.index) ?? `signal_${signal.index}`;\n    lines.push(\n      csvRow([\n        column,\n        String(signal.index),\n        signal.label,\n        signal.physicalDimension,\n        String(signal.samplingRate),\n        String(signal.samplesPerRecord),\n        String(signal.physicalMin),\n        String(signal.physicalMax),\n        String(signal.digitalMin),\n        String(signal.digitalMax),\n        signal.transducer,\n        signal.prefiltering,\n        fileFor.get(signal.index) ?? '',\n        includedColumns.has(signal.index) ? 'yes' : 'no',\n      ]),\n    );\n  }\n\n  const name = gzip ? 'channels.csv.gz' : 'channels.csv';\n  await writeOutputFile(outputDir, name, lines.join('\\n') + '\\n', gzip, bom);\n  return { name, rows: lines.length - 1 };\n}\n\n/*\n  The bounds an annotation is filtered against: what the caller actually asked for, not the\n  window that survived being clamped to the recording.\n\n  Filtering by the resolved window meant an unbounded request still lost events. `--end 999h`\n  on a three-second file clamps to 3, and `--start 0` gets its end from the recording, so\n  both filtered to [0, 3) and dropped the markers at 3.0 and 3.5 that a bare invocation\n  keeps — asking for more of a recording returned less of it.\n\n  An end the caller did not give is unbounded, not \"the end of the data\": EDF+ lets an\n  annotation sit past the last sample, which is exactly where an end-of-recording marker is.\n\n  `--duration` is measured from wherever the conversion actually starts. Anchoring it at 0\n  instead read the same absent `--start` two ways in two adjacent lines, and on a recording\n  that does not begin at zero the two windows did not even overlap: an EDF+D file whose first\n  record sits at 30 s converted its samples from [30, 35) while filtering annotations against\n  (-inf, 5), so every event inside the converted window was dropped and `annotations.csv` came\n  back empty. `resolveRange` has always defaulted the same missing start to the earliest\n  record, which is where this now takes it from.\n*/\nfunction requestedAnnotationWindow(\n  options: ConvertOptions,\n  recordingStart: number,\n): { from: number; to: number } {\n  const from = options.start ?? -Infinity;\n  const to =\n    options.end !== undefined\n      ? options.end\n      : options.duration !== undefined\n        ? (options.start ?? recordingStart) + options.duration\n        : Infinity;\n  return { from, to };\n}\n\nasync function writeAnnotationsCsv(\n  outputDir: string,\n  annotations: readonly Annotation[],\n  window: { from: number; to: number },\n  gzip: boolean,\n  bom: boolean,\n): Promise<WrittenFile> {\n  const inWindow = annotations\n    .filter((a) => a.onset >= window.from && a.onset < window.to)\n    .sort((a, b) => a.onset - b.onset || a.recordIndex - b.recordIndex);\n\n  const lines = [csvRow(['onset_s', 'duration_s', 'description', 'record_index'])];\n  for (const annotation of inWindow) {\n    lines.push(\n      csvRow([\n        String(annotation.onset),\n        annotation.duration === null ? '' : String(annotation.duration),\n        annotation.text,\n        String(annotation.recordIndex),\n      ]),\n    );\n  }\n\n  const name = gzip ? 'annotations.csv.gz' : 'annotations.csv';\n  await writeOutputFile(outputDir, name, lines.join('\\n') + '\\n', gzip, bom);\n  return { name, rows: inWindow.length };\n}\n\n/**\n * What to try next, chosen from what actually went wrong.\n *\n * Every write failure carried the same advice — \"Free up space or choose another destination\n * with --out\" — which fits exactly one errno. A directory sitting where signals.csv belongs\n * came back telling the reader to free up disk space, and so did a read-only volume, a\n * permission denial and a path too long for the filesystem. Wrong advice is worse than none:\n * it sends someone to check `df` on a disk that is fine, and the thing that is actually\n * wrong stays unexamined.\n *\n * The errno is the one piece of the failure that names the cause, so it is what picks the\n * sentence. Anything unrecognised keeps the general form rather than guessing.\n */\nfunction writeHint(cause: unknown, toStdout = false): string {\n  /*\n    The stdout path writes no files, and --out is the flag its user chose not to pass.\n\n    Both halves of this sentence were wrong there: \"the files written so far\" named files\n    that do not exist, and \"choose another destination with --out\" is advice for a different\n    command — the destination is whatever the shell redirected the stream to. Same class as\n    the disk-space hint this function replaced, one flag over.\n  */\n  const preamble = toStdout\n    ? 'What reached stdout before it failed is incomplete and should not be used. '\n    : 'The files written so far are incomplete and should not be used. ';\n  const elsewhere = toStdout ? 'redirect it somewhere else' : 'choose another with --out';\n  const code = (cause as NodeJS.ErrnoException | null)?.code;\n  switch (code) {\n    case 'ENOSPC':\n      return `${preamble}The destination is out of space; free some up or ${elsewhere}.`;\n    case 'EDQUOT':\n      return `${preamble}You are over your disk quota on this filesystem; ${elsewhere}.`;\n    case 'EACCES':\n    case 'EPERM':\n      return `${preamble}You do not have permission to write there; ${elsewhere}.`;\n    case 'EROFS':\n      return `${preamble}That filesystem is mounted read-only; ${elsewhere}.`;\n    case 'EISDIR':\n      return `${preamble}A directory is sitting where that file belongs; remove or rename it, or ${elsewhere}.`;\n    case 'ENOENT':\n      return `${preamble}Part of that path no longer exists; make sure nothing is removing it while the conversion runs.`;\n    case 'ENAMETOOLONG':\n      return `${preamble}That path is longer than the filesystem allows; ${toStdout ? 'redirect it somewhere shorter' : 'choose a shorter destination with --out'}.`;\n    case 'EMFILE':\n    case 'ENFILE':\n      return `${preamble}Too many files are open; a recording with many sampling rates opens one output file per rate, so --channels narrows it.`;\n    case 'EPIPE':\n      return `${preamble}Whatever was reading the output closed it before the conversion finished.`;\n    default:\n      return `${preamble}Check the destination and run the conversion again.`;\n  }\n}\n\n/**\n * Confirms that everything handed to a file-backed stdout actually arrived.\n *\n * `edf2csv rec.edf --stdout > out.csv` onto a volume that the output very nearly fills lost\n * the tail in silence: 94,977 of 102,400 rows on disk, the file ending mid-row, stderr\n * announcing \"Wrote 102,400 rows to stdout.\" and the process exiting 0. The same recording\n * onto the same volume through `--out` fails correctly, which is what gives it away.\n *\n * POSIX `write` returns a short count rather than an error when the disk fills partway\n * through a single call, and only the NEXT write raises ENOSPC. `--out` always has a next\n * write — channels.csv and metadata.json come after — so it always finds out. `--stdout`\n * has nothing after it, and when fd 1 is a regular file Node's stdout is a SyncWriteStream\n * whose `_write` discards the byte count `writeSync` returns, so nothing is raised at all.\n * No error means no `#failure`, so checking that alone would not have caught this.\n *\n * What can be checked is the descriptor: how much it grew against how much it was given.\n * Only for a regular file — a pipe, a terminal or a socket has no size to compare, and on\n * those a short write cannot go unreported this way. Appending (`>>`) is fine, since the\n * starting size is taken before anything is written.\n */\nfunction auditStdout(): { count: (bytes: number) => void; verify: () => void } | null {\n  let startSize: number;\n  try {\n    const info = fstatSync(1);\n    if (!info.isFile()) return null;\n    startSize = info.size;\n  } catch {\n    // No usable descriptor to audit; the conversion is not the place to complain about it.\n    return null;\n  }\n\n  let expected = 0;\n  return {\n    count: (bytes: number): void => {\n      expected += bytes;\n    },\n    verify: (): void => {\n      let landed: number;\n      try {\n        landed = fstatSync(1).size - startSize;\n      } catch {\n        return;\n      }\n      if (landed >= expected) return;\n      throw new ConversionError(\n        'WRITE_FAILED',\n        `Writing to stdout failed: ${expected - landed} of ${expected} bytes did not reach ` +\n          `the destination, which stopped accepting them part way through.`,\n        'What is there ends mid-row and should not be used. The destination is almost ' +\n          'certainly out of space — a short write is how a filesystem reports filling up ' +\n          'mid-write, and nothing after it raised an error because there was nothing after it.',\n      );\n    },\n  };\n}\n\n/** Data rows across every signal table, so \"nothing was written\" is one question. */\nfunction rowsIn(written: readonly WrittenFile[]): number {\n  return written.reduce((total, file) => total + file.rows, 0);\n}\n\n\n/** Raised when the input moved while it was being read. See where it is pushed. */\nfunction inputChanged(hadChecksum: boolean): Diagnostic {\n  return {\n    code: 'INPUT_CHANGED',\n    severity: 'warning',\n    message:\n      'The input changed while it was being converted, so this output covers the file as ' +\n      'it was when the conversion started, not as it is now.',\n    hint: hadChecksum\n      ? 'No checksum was recorded: the bytes that were converted are no longer there to ' +\n        'hash. Convert again once the recording is finished.'\n      : 'Convert again once the recording is finished to pick up the rest.',\n  };\n}\n\nasync function writeMetadata(\n  outputDir: string,\n  inputPath: string,\n  file: EdfFile,\n  plan: ConversionPlan,\n  written: readonly WrittenFile[],\n  annotationCount: number,\n  /** Hash of the bytes that were converted, or null when it could not be vouched for. */\n  checksum: string | null,\n): Promise<void> {\n  const { header } = file;\n\n  /*\n    The file as it was when it was opened, not as it is now.\n\n    Both of these used to come from re-opening the path once the CSVs were written, which\n    describes whatever answers to that name by then rather than what was converted. A\n    recording still being written grew from 2,000 records to 3,000 mid-conversion and\n    metadata.json recorded `data_records: 2000` — correct, the CSV holds 2,000 — beside the\n    byte count and SHA-256 of the 3,000-record file. The two halves of one provenance record\n    described two different files, and the checksum covered bytes nobody had converted.\n    Replacing the file at that path did the same thing more thoroughly.\n\n    `file.fileSize` is the number every record count and window in this output was derived\n    from, and the hash is taken over exactly those bytes through the descriptor already open\n    on them, so the record describes one file throughout.\n  */\n  const metadata = {\n    tool: { name: 'edf2csv', version: TOOL_VERSION },\n    source: {\n      path: path.resolve(inputPath),\n      bytes: file.fileSize,\n      modified: new Date(file.modifiedAtOpenMs).toISOString(),\n      sha256: checksum,\n    },\n    recording: {\n      format: describeFormat(header),\n      version: header.version,\n      patient_id: header.patientId,\n      recording_id: header.recordingId,\n      // Zone-less on purpose: EDF records local wall-clock digits and no timezone.\n      start_datetime_local: formatWallClock(header.startDateTime),\n      start_date_raw: header.startDateRaw,\n      start_time_raw: header.startTimeRaw,\n      data_records: file.recordCount,\n      data_records_declared: header.declaredRecordCount,\n      record_duration_seconds: header.recordDuration,\n      duration_seconds: file.durationSeconds,\n      signal_count: header.signalCount,\n      annotation_channels: file.annotationSignals.length,\n    },\n    conversion: {\n      converted_at: new Date().toISOString(),\n      start_seconds: plan.range.startSeconds,\n      end_seconds: plan.range.endSeconds,\n      whole_recording: plan.range.isWholeRecording,\n      records_converted: [plan.range.startRecord, plan.range.endRecord],\n      annotations_written: annotationCount,\n      files: written.map((f) => ({ name: f.name, rows: f.rows })),\n      rate_groups: plan.groups.map((g) => ({\n        file: g.fileName,\n        sampling_rate_hz: g.rate,\n        channels: g.channels.map((c) => c.column),\n        decimals: g.channels.map((c) => c.decimals),\n      })),\n    },\n    notes: [...withoutFileRateWarning(file.diagnostics), ...plan.diagnostics].map((d) => ({\n      code: d.code,\n      severity: d.severity,\n      message: d.message,\n    })),\n  };\n\n  await writeOutputFile(outputDir, 'metadata.json', JSON.stringify(metadata, null, 2) + '\\n');\n}\n\n\n"]}

package/dist/convert/timing.d.ts

@@ -5,6 +5,8 @@ export interface AnnotationTimingData {
     malformed: number;
     /** Unreadable TALs in first position, which carry timing rather than an event. */
     malformedTimekeeping?: number;
+    /** Events kept whose stated duration could not be read. */
+    unreadableDurations?: number;
 }
 /**
  * Resolve the true start time of every data record.

package/dist/convert/timing.js

@@ -16,6 +16,31 @@ export function deriveRecordStarts(file, annotationData) {
             hint: 'The rest were exported normally. The file may have been written by a non-conforming tool.',
         });
     }
+    /*
+      An event that was exported, minus a field.
+  
+      `duration_s` is empty in annotations.csv when the file stated no duration, which is what
+      the documentation says an empty cell means. A duration the file did state and this could
+      not read produced exactly the same empty cell, so an event written with a duration of
+      `abc` was exported as an event that never had one — the same row as its neighbour, and
+      nothing said a field had been dropped.
+  
+      Not counted among the entries that "could not be exported": this one was, and everything
+      else about it is intact. The count is of rows in annotations.csv, since a TAL may carry
+      several texts and each becomes a row with the same empty cell.
+    */
+    const unreadableDurations = annotationData.unreadableDurations ?? 0;
+    if (unreadableDurations > 0) {
+        const one = unreadableDurations === 1;
+        diagnostics.push({
+            code: 'ANNOTATION_DECODE_FAILED',
+            severity: 'warning',
+            message: `${unreadableDurations} annotation${one ? '' : 's'} state${one ? 's' : ''} a duration ` +
+                `that is not a number, so ${one ? 'its' : 'their'} duration_s cell is empty.`,
+            hint: 'The onset and the description were read normally. An empty duration_s otherwise ' +
+                'means the file stated no duration, so these rows cannot be told apart from those.',
+        });
+    }
     /*
       A timekeeping TAL is not an event, and saying it "could not be exported" describes the
       wrong loss twice over.

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;YAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC;QAE1D,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;;;;;;;;;;UAUE;QACF,IAAI,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC;QACvD,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) 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    /*\n      An origin of zero is the same as no origin, for timing. It is not the same for the\n      check above.\n\n      This returned early on `origin === 0`, which is right about the times — contiguous\n      starts from zero are what timing from zero already produces — and skipped the\n      contradiction check on the way past. So an EDF+C file whose records say 0, 5 and 10 on\n      one-second records went unreported, while the same file shifted one second, saying 1, 6\n      and 11, was reported. The contradiction is in records 1 and 2 either way; where record 0\n      happens to sit decides nothing about it.\n    */\n    if (origin === 0) return { starts: null, diagnostics };\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"]}
+{"version":3,"file":"timing.js","sourceRoot":"","sources":["../../src/convert/timing.ts"],"names":[],"mappings":"AAYA;;;;;;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;;;;;;;;;;;;MAYE;IACF,MAAM,mBAAmB,GAAG,cAAc,CAAC,mBAAmB,IAAI,CAAC,CAAC;IACpE,IAAI,mBAAmB,GAAG,CAAC,EAAE,CAAC;QAC5B,MAAM,GAAG,GAAG,mBAAmB,KAAK,CAAC,CAAC;QACtC,WAAW,CAAC,IAAI,CAAC;YACf,IAAI,EAAE,0BAA0B;YAChC,QAAQ,EAAE,SAAS;YACnB,OAAO,EACL,GAAG,mBAAmB,cAAc,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,SAAS,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,cAAc;gBACvF,4BAA4B,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,4BAA4B;YAC/E,IAAI,EACF,kFAAkF;gBAClF,mFAAmF;SACtF,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;YAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC;QAE1D,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;;;;;;;;;;UAUE;QACF,IAAI,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC;QACvD,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  /** Events kept whose stated duration could not be read. */\n  unreadableDurations?: 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    An event that was exported, minus a field.\n\n    `duration_s` is empty in annotations.csv when the file stated no duration, which is what\n    the documentation says an empty cell means. A duration the file did state and this could\n    not read produced exactly the same empty cell, so an event written with a duration of\n    `abc` was exported as an event that never had one — the same row as its neighbour, and\n    nothing said a field had been dropped.\n\n    Not counted among the entries that \"could not be exported\": this one was, and everything\n    else about it is intact. The count is of rows in annotations.csv, since a TAL may carry\n    several texts and each becomes a row with the same empty cell.\n  */\n  const unreadableDurations = annotationData.unreadableDurations ?? 0;\n  if (unreadableDurations > 0) {\n    const one = unreadableDurations === 1;\n    diagnostics.push({\n      code: 'ANNOTATION_DECODE_FAILED',\n      severity: 'warning',\n      message:\n        `${unreadableDurations} annotation${one ? '' : 's'} state${one ? 's' : ''} a duration ` +\n        `that is not a number, so ${one ? 'its' : 'their'} duration_s cell is empty.`,\n      hint:\n        'The onset and the description were read normally. An empty duration_s otherwise ' +\n        'means the file stated no duration, so these rows cannot be told apart from those.',\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) 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    /*\n      An origin of zero is the same as no origin, for timing. It is not the same for the\n      check above.\n\n      This returned early on `origin === 0`, which is right about the times — contiguous\n      starts from zero are what timing from zero already produces — and skipped the\n      contradiction check on the way past. So an EDF+C file whose records say 0, 5 and 10 on\n      one-second records went unreported, while the same file shifted one second, saying 1, 6\n      and 11, was reported. The contradiction is in records 1 and 2 either way; where record 0\n      happens to sit decides nothing about it.\n    */\n    if (origin === 0) return { starts: null, diagnostics };\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/dist/edf/annotations.d.ts

@@ -18,7 +18,14 @@ declare const TAL_END = 0;
 export interface Annotation {
     /** Seconds from the start of the recording. */
     onset: number;
-    /** Seconds, or null when the TAL omitted a duration. */
+    /**
+     * Seconds, or null when the TAL stated no duration that could be read.
+     *
+     * Null covers two cases the file distinguishes and this field does not: a TAL that omitted
+     * the duration, and a TAL that stated one which is not a number. They are told apart by
+     * `unreadableDurations`, which is what raises the warning; the value itself has nowhere
+     * honest to put "the file said `abc`".
+     */
     duration: number | null;
     text: string;
     /** Index of the data record this annotation was stored in. */
@@ -32,6 +39,14 @@ export interface DecodedRecordAnnotations {
     malformed: number;
     /** Unreadable TALs in first position, which carry a record's start time, not an event. */
     malformedTimekeeping: number;
+    /**
+     * Events kept whose stated duration could not be read.
+     *
+     * Counted apart again, for the same reason the two above are: the entry was exported and
+     * nothing about it is missing except the one field, so calling it an entry that "could not
+     * be exported" describes a loss that did not happen and hides the one that did.
+     */
+    unreadableDurations: number;
 }
 /**
  * Decode one data record's annotation bytes.

package/dist/edf/annotations.js

@@ -31,6 +31,7 @@ export function decodeRecordAnnotations(bytes, recordIndex, carriesTimekeeping =
     let isFirstTal = true;
     let malformed = 0;
     let malformedTimekeeping = 0;
+    let unreadableDurations = 0;
     let start = 0;
     for (let i = 0; i <= bytes.length; i++) {
         if (i !== bytes.length && bytes[i] !== TAL_END)
@@ -61,6 +62,7 @@ export function decodeRecordAnnotations(bytes, recordIndex, carriesTimekeeping =
                     recordStart = parsed.onset;
                 for (const annotation of parsed.annotations)
                     annotations.push(annotation);
+                unreadableDurations += parsed.unreadableDurations;
             }
             else {
                 /*
@@ -81,7 +83,7 @@ export function decodeRecordAnnotations(bytes, recordIndex, carriesTimekeeping =
         }
         start = i + 1;
     }
-    return { recordStart, annotations, malformed, malformedTimekeeping };
+    return { recordStart, annotations, malformed, malformedTimekeeping, unreadableDurations };
 }
 function parseTal(chunk, recordIndex) {
     // The onset must be explicitly signed; anything else is not a TAL.
@@ -101,10 +103,25 @@ function parseTal(chunk, recordIndex) {
     const onset = Number(onsetText);
     if (!Number.isFinite(onset))
         return null;
+    /*
+      A duration the file stated and this could not read is not the same as no duration.
+  
+      Both came out as `null` and so as an empty `duration_s` cell, which the documentation
+      defines as meaning the file gave no duration — so an event whose duration was written as
+      `abc` was exported as an event with no duration, indistinguishable from one beside it
+      that genuinely had none, and nothing anywhere said a field had been dropped. The onset is
+      already held to this standard: one that is not a number costs the whole TAL and is
+      reported. A duration is one field of an otherwise readable event, so the event is kept —
+      but it is counted, and the run says so.
+    */
     let duration = null;
+    let durationUnreadable = false;
     if (durationText !== null && durationText !== '') {
         const d = Number(durationText);
-        duration = Number.isFinite(d) ? d : null;
+        if (Number.isFinite(d))
+            duration = d;
+        else
+            durationUnreadable = true;
     }
     const annotations = [];
     for (const raw of parts.slice(1)) {
@@ -113,7 +130,9 @@ function parseTal(chunk, recordIndex) {
             continue;
         annotations.push({ onset, duration, text: raw, recordIndex });
     }
-    return { onset, annotations };
+    // Per event rather than per TAL: one TAL may carry several texts, and each becomes a row
+    // of annotations.csv with the same empty cell in it.
+    return { onset, annotations, unreadableDurations: durationUnreadable ? annotations.length : 0 };
 }
 export { SEP_TEXT, SEP_DURATION, TAL_END };
 //# sourceMappingURL=annotations.js.map

package/dist/edf/annotations.js.map

@@ -1 +1 @@
-{"version":3,"file":"annotations.js","sourceRoot":"","sources":["../../src/edf/annotations.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAExC,MAAM,QAAQ,GAAG,IAAI,CAAC,CAAC,yDAAyD;AAChF,MAAM,YAAY,GAAG,IAAI,CAAC,CAAC,gCAAgC;AAC3D,MAAM,OAAO,GAAG,IAAI,CAAC;AAErB,MAAM,aAAa,GAAG,MAAM,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;AACpD,MAAM,iBAAiB,GAAG,MAAM,CAAC,YAAY,CAAC,YAAY,CAAC,CAAC;AAsB5D;;;;;;GAMG;AACH,MAAM,UAAU,uBAAuB,CACrC,KAAiB,EACjB,WAAmB,EACnB,kBAAkB,GAAG,IAAI;IAEzB,MAAM,WAAW,GAAiB,EAAE,CAAC;IACrC,IAAI,WAAW,GAAkB,IAAI,CAAC;IACtC,IAAI,UAAU,GAAG,IAAI,CAAC;IACtB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,oBAAoB,GAAG,CAAC,CAAC;IAE7B,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,IAAI,CAAC,KAAK,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,OAAO;YAAE,SAAS;QAEzD,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC;YACd,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACvC,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;YAE5C,+EAA+E;YAC/E,mFAAmF;YACnF,+EAA+E;YAC/E,iFAAiF;YACjF,+EAA+E;YAC/E,uEAAuE;YACvE;;;;;;;;;cASE;YACF,MAAM,aAAa,GAAG,UAAU,IAAI,kBAAkB,CAAC;YACvD,UAAU,GAAG,KAAK,CAAC;YAEnB,IAAI,MAAM,EAAE,CAAC;gBACX,IAAI,aAAa;oBAAE,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC;gBAC9C,KAAK,MAAM,UAAU,IAAI,MAAM,CAAC,WAAW;oBAAE,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC5E,CAAC;iBAAM,CAAC;gBACN;;;;;;;;;kBASE;gBACF,IAAI,aAAa;oBAAE,oBAAoB,EAAE,CAAC;;oBACrC,SAAS,EAAE,CAAC;YACnB,CAAC;QACH,CAAC;QACD,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;IAChB,CAAC;IAED,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,SAAS,EAAE,oBAAoB,EAAE,CAAC;AACvE,CAAC;AAOD,SAAS,QAAQ,CAAC,KAAiB,EAAE,WAAmB;IACtD,mEAAmE;IACnE,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACvB,IAAI,KAAK,KAAK,IAAI,CAAC,OAAO,IAAI,KAAK,KAAK,IAAI,CAAC,OAAO;QAAE,OAAO,IAAI,CAAC;IAElE,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;IAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;IACxC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAE5B,IAAI,SAAS,GAAG,IAAI,CAAC;IACrB,IAAI,YAAY,GAAkB,IAAI,CAAC;IACvC,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,iBAAiB,CAAC,CAAC;IACpD,IAAI,WAAW,IAAI,CAAC,EAAE,CAAC;QACrB,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;QACvC,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC;IAC7C,CAAC;IAED,MAAM,KAAK,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC;IAChC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAEzC,IAAI,QAAQ,GAAkB,IAAI,CAAC;IACnC,IAAI,YAAY,KAAK,IAAI,IAAI,YAAY,KAAK,EAAE,EAAE,CAAC;QACjD,MAAM,CAAC,GAAG,MAAM,CAAC,YAAY,CAAC,CAAC;QAC/B,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAC3C,CAAC;IAED,MAAM,WAAW,GAAiB,EAAE,CAAC;IACrC,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;QACjC,gFAAgF;QAChF,IAAI,GAAG,KAAK,EAAE;YAAE,SAAS;QACzB,WAAW,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,WAAW,EAAE,CAAC,CAAC;IAChE,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,CAAC;AAChC,CAAC;AAED,OAAO,EAAE,QAAQ,EAAE,YAAY,EAAE,OAAO,EAAE,CAAC","sourcesContent":["/**\n * EDF+ annotation (TAL) decoding.\n *\n * The annotations channel stores UTF-8 text in place of samples. Its bytes are a\n * run of Time-stamped Annotation Lists, each terminated by a NUL, with the rest\n * of the channel NUL-padded:\n *\n *   +<onset>[<0x15><duration>]<0x14><text><0x14>...<0x00>\n *\n * The first TAL of every data record must carry that record's start time and no\n * text; that is how an EDF+D file states where each record actually sits in time.\n *\n *   +1.25<0x15>0.5<0x14>Seizure onset<0x14><0x00>\n */\n\nimport { decodeUtf8 } from './bytes.js';\n\nconst SEP_TEXT = 0x14; // separates onset/duration from text, and text from text\nconst SEP_DURATION = 0x15; // separates onset from duration\nconst TAL_END = 0x00;\n\nconst TEXT_SEP_CHAR = String.fromCharCode(SEP_TEXT);\nconst DURATION_SEP_CHAR = String.fromCharCode(SEP_DURATION);\n\nexport interface Annotation {\n  /** Seconds from the start of the recording. */\n  onset: number;\n  /** Seconds, or null when the TAL omitted a duration. */\n  duration: number | null;\n  text: string;\n  /** Index of the data record this annotation was stored in. */\n  recordIndex: number;\n}\n\nexport interface DecodedRecordAnnotations {\n  /** Record start time in seconds, from the leading timekeeping TAL. */\n  recordStart: number | null;\n  annotations: Annotation[];\n  /** Non-empty chunks that were not valid TALs, so the caller can report them. */\n  malformed: number;\n  /** Unreadable TALs in first position, which carry a record's start time, not an event. */\n  malformedTimekeeping: number;\n}\n\n/**\n * Decode one data record's annotation bytes.\n *\n * Malformed TALs are skipped rather than thrown, because a single bad annotation\n * should not cost the user an entire conversion. The count of skipped chunks is\n * returned so the caller can tell the user rather than losing them in silence.\n */\nexport function decodeRecordAnnotations(\n  bytes: Uint8Array,\n  recordIndex: number,\n  carriesTimekeeping = true,\n): DecodedRecordAnnotations {\n  const annotations: Annotation[] = [];\n  let recordStart: number | null = null;\n  let isFirstTal = true;\n  let malformed = 0;\n  let malformedTimekeeping = 0;\n\n  let start = 0;\n  for (let i = 0; i <= bytes.length; i++) {\n    if (i !== bytes.length && bytes[i] !== TAL_END) continue;\n\n    if (i > start) {\n      const chunk = bytes.subarray(start, i);\n      const parsed = parseTal(chunk, recordIndex);\n\n      // The timekeeping TAL is the one in first POSITION, whether or not it decodes.\n      // Clearing this flag only on a successful parse meant that an unreadable first TAL\n      // promoted the next ordinary annotation to timekeeping, and its onset silently\n      // became the record's start time — shifting every sample in that record. Leaving\n      // recordStart null instead is what the caller already handles, with a fallback\n      // timestamp and an ANNOTATION_DECODE_FAILED warning naming the record.\n      /*\n        Only one annotation channel carries a record's start time.\n\n        This flagged the first TAL of *every* annotation channel as timekeeping. In a second\n        channel the first TAL is an ordinary event — so when one failed to parse, the event\n        was dropped and counted as a lost timekeeping entry, which produced the warning\n        \"3 data records carry a timekeeping annotation that could not be read\" followed by\n        \"No event was lost\". Three events had been lost, and the timekeeping in that file was\n        perfectly readable. Both sentences false, about the same three records.\n      */\n      const isTimekeeping = isFirstTal && carriesTimekeeping;\n      isFirstTal = false;\n\n      if (parsed) {\n        if (isTimekeeping) recordStart = parsed.onset;\n        for (const annotation of parsed.annotations) annotations.push(annotation);\n      } else {\n        /*\n          Counted apart from the events, because losing one is a different loss.\n\n          A timekeeping TAL is never exported — it says where the record sits, not what\n          happened — so counting it among the entries that \"could not be exported\" both\n          overstated what was lost from annotations.csv and said nothing about the thing that\n          actually went missing, which is a record's position in time. A file with one\n          unreadable timekeeping TAL and three perfectly good events reported \"1 annotation\n          entry was unreadable and could not be exported\" while exporting all three.\n        */\n        if (isTimekeeping) malformedTimekeeping++;\n        else malformed++;\n      }\n    }\n    start = i + 1;\n  }\n\n  return { recordStart, annotations, malformed, malformedTimekeeping };\n}\n\ninterface ParsedTal {\n  onset: number;\n  annotations: Annotation[];\n}\n\nfunction parseTal(chunk: Uint8Array, recordIndex: number): ParsedTal | null {\n  // The onset must be explicitly signed; anything else is not a TAL.\n  const first = chunk[0];\n  if (first !== 0x2b /* + */ && first !== 0x2d /* - */) return null;\n\n  const text = decodeUtf8(chunk);\n  const parts = text.split(TEXT_SEP_CHAR);\n  const head = parts[0] ?? '';\n\n  let onsetText = head;\n  let durationText: string | null = null;\n  const durationSep = head.indexOf(DURATION_SEP_CHAR);\n  if (durationSep >= 0) {\n    onsetText = head.slice(0, durationSep);\n    durationText = head.slice(durationSep + 1);\n  }\n\n  const onset = Number(onsetText);\n  if (!Number.isFinite(onset)) return null;\n\n  let duration: number | null = null;\n  if (durationText !== null && durationText !== '') {\n    const d = Number(durationText);\n    duration = Number.isFinite(d) ? d : null;\n  }\n\n  const annotations: Annotation[] = [];\n  for (const raw of parts.slice(1)) {\n    // A trailing separator yields an empty segment; a timekeeping TAL is all empty.\n    if (raw === '') continue;\n    annotations.push({ onset, duration, text: raw, recordIndex });\n  }\n\n  return { onset, annotations };\n}\n\nexport { SEP_TEXT, SEP_DURATION, TAL_END };\n"]}
+{"version":3,"file":"annotations.js","sourceRoot":"","sources":["../../src/edf/annotations.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAExC,MAAM,QAAQ,GAAG,IAAI,CAAC,CAAC,yDAAyD;AAChF,MAAM,YAAY,GAAG,IAAI,CAAC,CAAC,gCAAgC;AAC3D,MAAM,OAAO,GAAG,IAAI,CAAC;AAErB,MAAM,aAAa,GAAG,MAAM,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;AACpD,MAAM,iBAAiB,GAAG,MAAM,CAAC,YAAY,CAAC,YAAY,CAAC,CAAC;AAqC5D;;;;;;GAMG;AACH,MAAM,UAAU,uBAAuB,CACrC,KAAiB,EACjB,WAAmB,EACnB,kBAAkB,GAAG,IAAI;IAEzB,MAAM,WAAW,GAAiB,EAAE,CAAC;IACrC,IAAI,WAAW,GAAkB,IAAI,CAAC;IACtC,IAAI,UAAU,GAAG,IAAI,CAAC;IACtB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,oBAAoB,GAAG,CAAC,CAAC;IAC7B,IAAI,mBAAmB,GAAG,CAAC,CAAC;IAE5B,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,IAAI,CAAC,KAAK,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,OAAO;YAAE,SAAS;QAEzD,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC;YACd,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACvC,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;YAE5C,+EAA+E;YAC/E,mFAAmF;YACnF,+EAA+E;YAC/E,iFAAiF;YACjF,+EAA+E;YAC/E,uEAAuE;YACvE;;;;;;;;;cASE;YACF,MAAM,aAAa,GAAG,UAAU,IAAI,kBAAkB,CAAC;YACvD,UAAU,GAAG,KAAK,CAAC;YAEnB,IAAI,MAAM,EAAE,CAAC;gBACX,IAAI,aAAa;oBAAE,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC;gBAC9C,KAAK,MAAM,UAAU,IAAI,MAAM,CAAC,WAAW;oBAAE,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBAC1E,mBAAmB,IAAI,MAAM,CAAC,mBAAmB,CAAC;YACpD,CAAC;iBAAM,CAAC;gBACN;;;;;;;;;kBASE;gBACF,IAAI,aAAa;oBAAE,oBAAoB,EAAE,CAAC;;oBACrC,SAAS,EAAE,CAAC;YACnB,CAAC;QACH,CAAC;QACD,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;IAChB,CAAC;IAED,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,SAAS,EAAE,oBAAoB,EAAE,mBAAmB,EAAE,CAAC;AAC5F,CAAC;AASD,SAAS,QAAQ,CAAC,KAAiB,EAAE,WAAmB;IACtD,mEAAmE;IACnE,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACvB,IAAI,KAAK,KAAK,IAAI,CAAC,OAAO,IAAI,KAAK,KAAK,IAAI,CAAC,OAAO;QAAE,OAAO,IAAI,CAAC;IAElE,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;IAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;IACxC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAE5B,IAAI,SAAS,GAAG,IAAI,CAAC;IACrB,IAAI,YAAY,GAAkB,IAAI,CAAC;IACvC,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,iBAAiB,CAAC,CAAC;IACpD,IAAI,WAAW,IAAI,CAAC,EAAE,CAAC;QACrB,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;QACvC,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC;IAC7C,CAAC;IAED,MAAM,KAAK,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC;IAChC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAEzC;;;;;;;;;;MAUE;IACF,IAAI,QAAQ,GAAkB,IAAI,CAAC;IACnC,IAAI,kBAAkB,GAAG,KAAK,CAAC;IAC/B,IAAI,YAAY,KAAK,IAAI,IAAI,YAAY,KAAK,EAAE,EAAE,CAAC;QACjD,MAAM,CAAC,GAAG,MAAM,CAAC,YAAY,CAAC,CAAC;QAC/B,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,QAAQ,GAAG,CAAC,CAAC;;YAChC,kBAAkB,GAAG,IAAI,CAAC;IACjC,CAAC;IAED,MAAM,WAAW,GAAiB,EAAE,CAAC;IACrC,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;QACjC,gFAAgF;QAChF,IAAI,GAAG,KAAK,EAAE;YAAE,SAAS;QACzB,WAAW,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,WAAW,EAAE,CAAC,CAAC;IAChE,CAAC;IAED,yFAAyF;IACzF,qDAAqD;IACrD,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,mBAAmB,EAAE,kBAAkB,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AAClG,CAAC;AAED,OAAO,EAAE,QAAQ,EAAE,YAAY,EAAE,OAAO,EAAE,CAAC","sourcesContent":["/**\n * EDF+ annotation (TAL) decoding.\n *\n * The annotations channel stores UTF-8 text in place of samples. Its bytes are a\n * run of Time-stamped Annotation Lists, each terminated by a NUL, with the rest\n * of the channel NUL-padded:\n *\n *   +<onset>[<0x15><duration>]<0x14><text><0x14>...<0x00>\n *\n * The first TAL of every data record must carry that record's start time and no\n * text; that is how an EDF+D file states where each record actually sits in time.\n *\n *   +1.25<0x15>0.5<0x14>Seizure onset<0x14><0x00>\n */\n\nimport { decodeUtf8 } from './bytes.js';\n\nconst SEP_TEXT = 0x14; // separates onset/duration from text, and text from text\nconst SEP_DURATION = 0x15; // separates onset from duration\nconst TAL_END = 0x00;\n\nconst TEXT_SEP_CHAR = String.fromCharCode(SEP_TEXT);\nconst DURATION_SEP_CHAR = String.fromCharCode(SEP_DURATION);\n\nexport interface Annotation {\n  /** Seconds from the start of the recording. */\n  onset: number;\n  /**\n   * Seconds, or null when the TAL stated no duration that could be read.\n   *\n   * Null covers two cases the file distinguishes and this field does not: a TAL that omitted\n   * the duration, and a TAL that stated one which is not a number. They are told apart by\n   * `unreadableDurations`, which is what raises the warning; the value itself has nowhere\n   * honest to put \"the file said `abc`\".\n   */\n  duration: number | null;\n  text: string;\n  /** Index of the data record this annotation was stored in. */\n  recordIndex: number;\n}\n\nexport interface DecodedRecordAnnotations {\n  /** Record start time in seconds, from the leading timekeeping TAL. */\n  recordStart: number | null;\n  annotations: Annotation[];\n  /** Non-empty chunks that were not valid TALs, so the caller can report them. */\n  malformed: number;\n  /** Unreadable TALs in first position, which carry a record's start time, not an event. */\n  malformedTimekeeping: number;\n  /**\n   * Events kept whose stated duration could not be read.\n   *\n   * Counted apart again, for the same reason the two above are: the entry was exported and\n   * nothing about it is missing except the one field, so calling it an entry that \"could not\n   * be exported\" describes a loss that did not happen and hides the one that did.\n   */\n  unreadableDurations: number;\n}\n\n/**\n * Decode one data record's annotation bytes.\n *\n * Malformed TALs are skipped rather than thrown, because a single bad annotation\n * should not cost the user an entire conversion. The count of skipped chunks is\n * returned so the caller can tell the user rather than losing them in silence.\n */\nexport function decodeRecordAnnotations(\n  bytes: Uint8Array,\n  recordIndex: number,\n  carriesTimekeeping = true,\n): DecodedRecordAnnotations {\n  const annotations: Annotation[] = [];\n  let recordStart: number | null = null;\n  let isFirstTal = true;\n  let malformed = 0;\n  let malformedTimekeeping = 0;\n  let unreadableDurations = 0;\n\n  let start = 0;\n  for (let i = 0; i <= bytes.length; i++) {\n    if (i !== bytes.length && bytes[i] !== TAL_END) continue;\n\n    if (i > start) {\n      const chunk = bytes.subarray(start, i);\n      const parsed = parseTal(chunk, recordIndex);\n\n      // The timekeeping TAL is the one in first POSITION, whether or not it decodes.\n      // Clearing this flag only on a successful parse meant that an unreadable first TAL\n      // promoted the next ordinary annotation to timekeeping, and its onset silently\n      // became the record's start time — shifting every sample in that record. Leaving\n      // recordStart null instead is what the caller already handles, with a fallback\n      // timestamp and an ANNOTATION_DECODE_FAILED warning naming the record.\n      /*\n        Only one annotation channel carries a record's start time.\n\n        This flagged the first TAL of *every* annotation channel as timekeeping. In a second\n        channel the first TAL is an ordinary event — so when one failed to parse, the event\n        was dropped and counted as a lost timekeeping entry, which produced the warning\n        \"3 data records carry a timekeeping annotation that could not be read\" followed by\n        \"No event was lost\". Three events had been lost, and the timekeeping in that file was\n        perfectly readable. Both sentences false, about the same three records.\n      */\n      const isTimekeeping = isFirstTal && carriesTimekeeping;\n      isFirstTal = false;\n\n      if (parsed) {\n        if (isTimekeeping) recordStart = parsed.onset;\n        for (const annotation of parsed.annotations) annotations.push(annotation);\n        unreadableDurations += parsed.unreadableDurations;\n      } else {\n        /*\n          Counted apart from the events, because losing one is a different loss.\n\n          A timekeeping TAL is never exported — it says where the record sits, not what\n          happened — so counting it among the entries that \"could not be exported\" both\n          overstated what was lost from annotations.csv and said nothing about the thing that\n          actually went missing, which is a record's position in time. A file with one\n          unreadable timekeeping TAL and three perfectly good events reported \"1 annotation\n          entry was unreadable and could not be exported\" while exporting all three.\n        */\n        if (isTimekeeping) malformedTimekeeping++;\n        else malformed++;\n      }\n    }\n    start = i + 1;\n  }\n\n  return { recordStart, annotations, malformed, malformedTimekeeping, unreadableDurations };\n}\n\ninterface ParsedTal {\n  onset: number;\n  annotations: Annotation[];\n  /** How many of those annotations carry a duration the file stated and this could not read. */\n  unreadableDurations: number;\n}\n\nfunction parseTal(chunk: Uint8Array, recordIndex: number): ParsedTal | null {\n  // The onset must be explicitly signed; anything else is not a TAL.\n  const first = chunk[0];\n  if (first !== 0x2b /* + */ && first !== 0x2d /* - */) return null;\n\n  const text = decodeUtf8(chunk);\n  const parts = text.split(TEXT_SEP_CHAR);\n  const head = parts[0] ?? '';\n\n  let onsetText = head;\n  let durationText: string | null = null;\n  const durationSep = head.indexOf(DURATION_SEP_CHAR);\n  if (durationSep >= 0) {\n    onsetText = head.slice(0, durationSep);\n    durationText = head.slice(durationSep + 1);\n  }\n\n  const onset = Number(onsetText);\n  if (!Number.isFinite(onset)) return null;\n\n  /*\n    A duration the file stated and this could not read is not the same as no duration.\n\n    Both came out as `null` and so as an empty `duration_s` cell, which the documentation\n    defines as meaning the file gave no duration — so an event whose duration was written as\n    `abc` was exported as an event with no duration, indistinguishable from one beside it\n    that genuinely had none, and nothing anywhere said a field had been dropped. The onset is\n    already held to this standard: one that is not a number costs the whole TAL and is\n    reported. A duration is one field of an otherwise readable event, so the event is kept —\n    but it is counted, and the run says so.\n  */\n  let duration: number | null = null;\n  let durationUnreadable = false;\n  if (durationText !== null && durationText !== '') {\n    const d = Number(durationText);\n    if (Number.isFinite(d)) duration = d;\n    else durationUnreadable = true;\n  }\n\n  const annotations: Annotation[] = [];\n  for (const raw of parts.slice(1)) {\n    // A trailing separator yields an empty segment; a timekeeping TAL is all empty.\n    if (raw === '') continue;\n    annotations.push({ onset, duration, text: raw, recordIndex });\n  }\n\n  // Per event rather than per TAL: one TAL may carry several texts, and each becomes a row\n  // of annotations.csv with the same empty cell in it.\n  return { onset, annotations, unreadableDurations: durationUnreadable ? annotations.length : 0 };\n}\n\nexport { SEP_TEXT, SEP_DURATION, TAL_END };\n"]}

package/dist/edf/reader.d.ts

@@ -156,6 +156,8 @@ export declare class EdfFile {
         malformed: number;
         /** Unreadable TALs in first position, which carry timing rather than an event. */
         malformedTimekeeping: number;
+        /** Events kept whose stated duration could not be read; see Annotation.duration. */
+        unreadableDurations: number;
     }>;
     close(): Promise<void>;
 }

package/dist/edf/reader.js

@@ -361,9 +361,10 @@ export class EdfFile {
         const recordStarts = new Array(this.recordCount).fill(null);
         let malformed = 0;
         let malformedTimekeeping = 0;
+        let unreadableDurations = 0;
         const channels = this.annotationSignals;
         if (channels.length === 0) {
-            return { annotations, recordStarts, malformed, malformedTimekeeping };
+            return { annotations, recordStarts, malformed, malformedTimekeeping, unreadableDurations };
         }
         const { headerBytes, recordBytes, bytesPerSample } = this.header;
         const buffers = channels.map((c) => Buffer.alloc(c.samplesPerRecord * bytesPerSample));
@@ -386,10 +387,11 @@ export class EdfFile {
                     annotations.push(annotation);
                 malformed += decoded.malformed;
                 malformedTimekeeping += decoded.malformedTimekeeping;
+                unreadableDurations += decoded.unreadableDurations;
             }
         }
         annotations.sort((a, b) => a.onset - b.onset || a.recordIndex - b.recordIndex);
-        return { annotations, recordStarts, malformed, malformedTimekeeping };
+        return { annotations, recordStarts, malformed, malformedTimekeeping, unreadableDurations };
     }
     async close() {
         if (this.#closed)

package/dist/edf/reader.js.map

@@ -1 +1 @@
-{"version":3,"file":"reader.js","sourceRoot":"","sources":["../../src/edf/reader.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AAG9C,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAEzC,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAEvC,OAAO,EAAE,kBAAkB,EAAE,mBAAmB,EAAE,WAAW,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAEpG,OAAO,EAAE,uBAAuB,EAAE,MAAM,kBAAkB,CAAC;AAE3D,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAEvD;;;;;GAKG;AACH,MAAM,2BAA2B,GAAG,EAAE,CAAC;AAEvC,oGAAoG;AACpG,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;AAuBnD,MAAM,OAAO,OAAO;IACT,IAAI,CAAS;IACb,QAAQ,CAAS;IAC1B;;;;;;;;OAQG;IACM,gBAAgB,CAAS;IACzB,MAAM,CAAY;IAC3B,sFAAsF;IAC7E,WAAW,CAAS;IACpB,aAAa,CAAS;IACtB,WAAW,CAAe;IAEnC,OAAO,CAAa;IACpB,OAAO,GAAG,KAAK,CAAC;IAChB,yFAAyF;IACzF,QAAQ,GAAmB,IAAI,CAAC;IAEhC,YAAoB,IASnB;QACC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACtB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC9B,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,gBAAgB,CAAC;QAC9C,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC;QACpC,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,aAAa,CAAC;QACxC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC;QACpC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC;IAC7B,CAAC;IAED;;;;;;;;;;OAUG;IACH,KAAK,CAAC,MAAM;QACV,IAAI,CAAC,WAAW,EAAE,CAAC;QACnB,MAAM,IAAI,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC;QAClC,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3E,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,QAAQ,GAAI,CAAC;YACtC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC,CAAC;YACzD,MAAM,EAAE,SAAS,EAAE,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC;YACnE,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;gBACnB,MAAM,IAAI,QAAQ,CAChB,YAAY,EACZ,YAAY,IAAI,CAAC,QAAQ,4CAA4C,EAAE,IAAI;oBACzE,0DAA0D,EAC5D,wEAAwE,CACzE,CAAC;YACJ,CAAC;YACD,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;YAC3C,EAAE,IAAI,SAAS,CAAC;QAClB,CAAC;QACD,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,gBAAgB;QACpB;;;;;;;;;;;UAWE;QACF,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI;gBAAE,OAAO,IAAI,CAAC,QAAQ,CAAC;YACjD,MAAM,IAAI,QAAQ,CAChB,YAAY,EACZ,IAAI,IAAI,CAAC,IAAI,0EAA0E,EACvF,iFAAiF;gBAC/E,qCAAqC,CACxC,CAAC;QACJ,CAAC;QACD,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;QACxD,IAAI,GAAG,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC,QAAQ,IAAI,KAAK,CAAC;QAChD,IAAI,CAAC,QAAQ,GAAG,GAAG,CAAC,IAAI,KAAK,IAAI,CAAC,QAAQ,IAAI,GAAG,CAAC,OAAO,KAAK,IAAI,CAAC,gBAAgB,CAAC;QACpF,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAED,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,IAAY;QAC5B,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,KAAc,EAAE,EAAE;YACrD,MAAM,IAAI,QAAQ,CAAC,YAAY,EAAE,gBAAgB,IAAI,MAAM,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAChF,CAAC,CAAC,CAAC;QACH,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;YACvB,MAAM,IAAI,QAAQ,CAAC,YAAY,EAAE,IAAI,IAAI,oCAAoC,CAAC,CAAC;QACjF,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;YACnB,MAAM,IAAI,QAAQ,CAAC,YAAY,EAAE,IAAI,IAAI,0BAA0B,CAAC,CAAC;QACvE,CAAC;QAED,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACrC,IAAI,CAAC;YACH,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,kBAAkB,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YACpE,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACrB,MAAM,SAAS,GAAG,MAAM,SAAS,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;gBACrE,IAAI,SAAS,GAAG,KAAK,CAAC,MAAM;oBAAE,MAAM,mBAAmB,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;YACtF,CAAC;YAED,qFAAqF;YACrF,sFAAsF;YACtF,oFAAoF;YACpF,uEAAuE;YACvE,IAAI,YAAY,GAAG,KAAK,CAAC;YACzB,IAAI,KAAK,CAAC,MAAM,KAAK,kBAAkB,EAAE,CAAC;gBACxC,MAAM,EAAE,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;gBAClC,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;oBAChB,MAAM,KAAK,GAAG,kBAAkB,GAAG,EAAE,GAAG,mBAAmB,CAAC;oBAC5D,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;wBACvB,YAAY,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;wBACnC,MAAM,SAAS,GAAG,MAAM,SAAS,CAAC,MAAM,EAAE,YAAY,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;wBACrE,IAAI,SAAS,GAAG,KAAK;4BAAE,MAAM,mBAAmB,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;oBACxE,CAAC;gBACH,CAAC;YACH,CAAC;YAED,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,aAAa,EAAE,WAAW,EAAE,GAAG,WAAW,CACrE,YAAY,EACZ,IAAI,CAAC,IAAI,CACV,CAAC;YAEF,OAAO,IAAI,OAAO,CAAC;gBACjB,IAAI;gBACJ,QAAQ,EAAE,IAAI,CAAC,IAAI;gBACnB,gBAAgB,EAAE,IAAI,CAAC,OAAO;gBAC9B,MAAM;gBACN,WAAW;gBACX,aAAa;gBACb,WAAW;gBACX,MAAM;aACP,CAAC,CAAC;QACL,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,MAAM,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;YACrC,MAAM,KAAK,CAAC;QACd,CAAC;IACH,CAAC;IAED,+DAA+D;IAC/D,IAAI,WAAW;QACb,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC;IAC7D,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,IAAI,iBAAiB;QACnB,OAAO,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,gBAAgB,GAAG,CAAC,CAAC,CAAC;IAC9E,CAAC;IAED,IAAI,iBAAiB;QACnB,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC;IAC5D,CAAC;IAED,8EAA8E;IAC9E,IAAI,eAAe;QACjB,OAAO,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC;IACvD,CAAC;IAED,oDAAoD;IACpD,KAAK,CAAC,CAAC,WAAW,CAAC,UAA8B,EAAE;QACjD,IAAI,CAAC,WAAW,EAAE,CAAC;QAEnB;;;;;;;;;UASE;QACF,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI;YAC1B,CAAC,aAAa,EAAE,OAAO,CAAC,WAAW,CAAC;YACpC,CAAC,WAAW,EAAE,OAAO,CAAC,SAAS,CAAC;SACxB,EAAE,CAAC;YACX,IAAI,KAAK,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;gBACpD,MAAM,IAAI,QAAQ,CAChB,kBAAkB,EAClB,gBAAgB,IAAI,sCAAsC,KAAK,GAAG,EAClE,8HAA8H,CAC/H,CAAC;YACJ,CAAC;QACH,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,WAAW,IAAI,CAAC,CAAC,CAAC;QACpD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,OAAO,CAAC,SAAS,IAAI,IAAI,CAAC,WAAW,CAAC,CAAC;QAC9E,IAAI,KAAK,IAAI,GAAG;YAAE,OAAO;QAEzB,MAAM,EAAE,WAAW,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC;QACpC;;;;;;;UAOE;QACF,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,IAAI,mBAAmB,CAAC;QACzD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3C,MAAM,IAAI,QAAQ,CAChB,YAAY,EACZ,sDAAsD,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,GAAG,EACnF,+FAA+F,CAChG,CAAC;QACJ,CAAC;QACD;;;;;;;;;;;UAWE;QACF,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,WAAW,CAAC,EAAE,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC;QACtF,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,QAAQ,GAAG,WAAW,CAAC,CAAC;QAEpD,KAAK,IAAI,MAAM,GAAG,KAAK,EAAE,MAAM,GAAG,GAAG,EAAE,MAAM,IAAI,QAAQ,EAAE,CAAC;YAC1D,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,GAAG,MAAM,CAAC,CAAC;YAC/C,MAAM,KAAK,GAAG,KAAK,GAAG,WAAW,CAAC;YAClC,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,WAAW,GAAG,MAAM,GAAG,WAAW,CAAC;YAEhE,MAAM,SAAS,GAAG,MAAM,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;YAC5E,IAAI,SAAS,GAAG,KAAK,EAAE,CAAC;gBACtB,0EAA0E;gBAC1E,uEAAuE;gBACvE,MAAM,IAAI,QAAQ,CAChB,YAAY,EACZ,YAAY,KAAK,4BAA4B,MAAM,aAAa,SAAS,QAAQ;oBAC/E,2EAA2E,EAC7E,wEAAwE,CACzE,CAAC;YACJ,CAAC;YAED,MAAM,EAAE,gBAAgB,EAAE,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC;QAC1F,CAAC;IACH,CAAC;IAED,gDAAgD;IAChD,QAAQ,CAAC,KAAkB,EAAE,YAAoB,EAAE,MAAiB,EAAE,WAAmB;QACvF,MAAM,QAAQ,GACZ,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,WAAW;YACtC,MAAM,CAAC,kBAAkB;YACzB,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC;QAE3C,IAAI,IAAI,CAAC,MAAM,CAAC,cAAc,KAAK,CAAC,EAAE,CAAC;YACrC,4EAA4E;YAC5E,0EAA0E;YAC1E,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;YACxB,OAAO,CACL,CAAE,IAAI,CAAC,QAAQ,CAAY,IAAI,CAAC,CAAC;gBACjC,CAAE,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAY,IAAI,EAAE,CAAC;gBACtC,CAAE,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAY,IAAI,EAAE,CAAC,CACvC,IAAI,CAAC,CAAC;QACT,CAAC;QACD,OAAO,WAAW,CAAC,KAAK,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IAC3C,CAAC;IAED,wDAAwD;IACxD,QAAQ,CAAC,KAAkB,EAAE,YAAoB,EAAE,MAAiB;QAClE,OAAO,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,WAAW,GAAG,MAAM,CAAC,kBAAkB,CAAC;IAC5E,CAAC;IAED,oEAAoE;IACpE,eAAe,CAAC,KAAkB,EAAE,YAAoB,EAAE,MAAiB;QACzE,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,YAAY,EAAE,MAAM,CAAC,CAAC;QACzD,OAAO,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,CAAC,gBAAgB,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC;IAClG,CAAC;IAED;;;;;;;;;;;OAWG;IACH;;;;;;;;;;;;;;;;;;;;;OAqBG;IACH,KAAK,CAAC,UAAU;QACd,OAAO,CAAC,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,MAAM,CAAC;IAC1C,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,KAAK,CAAC,UAAU;QACd,IAAI,CAAC,WAAW,EAAE,CAAC;QAEnB,IAAI,oBAAoB,GAAG,CAAC,CAAC;QAC7B,MAAM,OAAO,GAAG,IAAI,CAAC,iBAAiB,CAAC;QACvC,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,WAAW,KAAK,CAAC;YAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,oBAAoB,EAAE,CAAC;QAEtF,MAAM,EAAE,WAAW,EAAE,cAAc,EAAE,WAAW,EAAE,cAAc,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC;QACjF,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,gBAAgB,GAAG,cAAc,CAAC,CAAC;QACvE,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,oBAAoB,EAAE,CAAC;QAEvE,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,2BAA2B,CAAC,CAAC;QACzE,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,QAAQ,EAAE,MAAM,EAAE,EAAE,CAAC;YACjD,MAAM,MAAM,GAAG,WAAW,GAAG,MAAM,GAAG,WAAW,GAAG,OAAO,CAAC,kBAAkB,CAAC;YAC/E,MAAM,SAAS,GAAG,MAAM,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YAClF,IAAI,SAAS,GAAG,MAAM,CAAC,MAAM;gBAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,oBAAoB,EAAE,CAAC;YAE7E,MAAM,OAAO,GAAG,uBAAuB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YACxD,oBAAoB,IAAI,OAAO,CAAC,oBAAoB,CAAC;YACrD,IAAI,OAAO,CAAC,WAAW,KAAK,IAAI,EAAE,CAAC;gBACjC,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,WAAW,GAAG,MAAM,GAAG,cAAc,EAAE,oBAAoB,EAAE,CAAC;YACzF,CAAC;QACH,CAAC;QACD,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,oBAAoB,EAAE,CAAC;IAChD,CAAC;IAED,KAAK,CAAC,eAAe;QAOnB,IAAI,CAAC,WAAW,EAAE,CAAC;QAEnB,MAAM,WAAW,GAAiB,EAAE,CAAC;QACrC,MAAM,YAAY,GAAsB,IAAI,KAAK,CAAgB,IAAI,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9F,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,oBAAoB,GAAG,CAAC,CAAC;QAE7B,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC;QACxC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,SAAS,EAAE,oBAAoB,EAAE,CAAC;QACxE,CAAC;QAED,MAAM,EAAE,WAAW,EAAE,WAAW,EAAE,cAAc,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC;QACjE,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,gBAAgB,GAAG,cAAc,CAAC,CAAC,CAAC;QACvF,MAAM,WAAW,GAAG,IAAI,CAAC,iBAAiB,CAAC;QAE3C,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC,WAAW,EAAE,MAAM,EAAE,EAAE,CAAC;YACzD,KAAK,MAAM,CAAC,QAAQ,EAAE,OAAO,CAAC,IAAI,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC;gBACrD,MAAM,MAAM,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC;gBACjC,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;oBAAE,SAAS;gBAE7C,MAAM,MAAM,GAAG,WAAW,GAAG,MAAM,GAAG,WAAW,GAAG,OAAO,CAAC,kBAAkB,CAAC;gBAC/E,MAAM,SAAS,GAAG,MAAM,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;gBAClF,IAAI,SAAS,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;oBAC9B,MAAM,mBAAmB,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,SAAS,EAAE,iBAAiB,CAAC,CAAC;gBACjF,CAAC;gBAED,kFAAkF;gBAClF,MAAM,OAAO,GAAG,uBAAuB,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,KAAK,WAAW,CAAC,CAAC;gBACjF,IAAI,OAAO,KAAK,WAAW;oBAAE,YAAY,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC,WAAW,CAAC;gBACxE,KAAK,MAAM,UAAU,IAAI,OAAO,CAAC,WAAW;oBAAE,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBAC3E,SAAS,IAAI,OAAO,CAAC,SAAS,CAAC;gBAC/B,oBAAoB,IAAI,OAAO,CAAC,oBAAoB,CAAC;YACvD,CAAC;QACH,CAAC;QAED,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC;QAC/E,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,SAAS,EAAE,oBAAoB,EAAE,CAAC;IACxE,CAAC;IAED,KAAK,CAAC,KAAK;QACT,IAAI,IAAI,CAAC,OAAO;YAAE,OAAO;QACzB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;QACpB,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;IAC7B,CAAC;IAED,WAAW;QACT,IAAI,IAAI,CAAC,OAAO;YAAE,MAAM,IAAI,QAAQ,CAAC,YAAY,EAAE,wCAAwC,CAAC,CAAC;IAC/F,CAAC;CACF;AAED,SAAS,QAAQ,CAAC,KAAc;IAC9B,IAAI,KAAK,YAAY,KAAK,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAI,KAA+B,CAAC,IAAI,CAAC;QACnD,IAAI,IAAI,KAAK,QAAQ;YAAE,OAAO,cAAc,CAAC;QAC7C,IAAI,IAAI,KAAK,QAAQ;YAAE,OAAO,mBAAmB,CAAC;QAClD,OAAO,KAAK,CAAC,OAAO,CAAC;IACvB,CAAC;IACD,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC;AACvB,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,cAAc,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC;AAE1C,8FAA8F;AAC9F,KAAK,UAAU,SAAS,CACtB,MAAkB,EAClB,MAAc,EACd,MAAc,EACd,MAAc,EACd,QAAgB;IAEhB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,OAAO,KAAK,GAAG,MAAM,EAAE,CAAC;QACtB;;;;;;;;;;;;UAYE;QACF,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,KAAK,EAAE,cAAc,CAAC,CAAC;QACtD,MAAM,EAAE,SAAS,EAAE,GAAG,MAAM,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,GAAG,KAAK,EAAE,IAAI,EAAE,QAAQ,GAAG,KAAK,CAAC,CAAC;QACxF,IAAI,SAAS,KAAK,CAAC;YAAE,MAAM;QAC3B,KAAK,IAAI,SAAS,CAAC;IACrB,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,mBAAmB,CAC1B,MAAc,EACd,QAAgB,EAChB,MAAc,EACd,OAAO,GAAG,MAAM;IAEhB,OAAO,IAAI,QAAQ,CACjB,YAAY,EACZ,YAAY,QAAQ,aAAa,OAAO,cAAc,MAAM,aAAa,MAAM,QAAQ;QACrF,2EAA2E,EAC7E,wEAAwE,CACzE,CAAC;AACJ,CAAC","sourcesContent":["/**\n * Chunked reader for EDF / EDF+ files.\n *\n * Data records are read in batches sized by a byte budget rather than all at once,\n * so peak memory stays flat regardless of how long the recording is. A 4 GB file\n * and a 4 MB file use the same working set.\n */\n\nimport { open, stat } from 'node:fs/promises';\nimport type { FileHandle } from 'node:fs/promises';\n\nimport { createHash } from 'node:crypto';\n\nimport { EdfError } from './errors.js';\nimport type { Diagnostic } from './errors.js';\nimport { FIXED_HEADER_BYTES, SIGNAL_HEADER_BYTES, parseHeader, peekSignalCount } from './header.js';\nimport type { EdfHeader, EdfSignal } from './header.js';\nimport { decodeRecordAnnotations } from './annotations.js';\nimport type { Annotation } from './annotations.js';\nimport { decodeLatin1, readInt16LE } from './bytes.js';\n\n/**\n * How far `readOrigin` looks for a record that states its own start time.\n *\n * Enough that one or two unreadable timekeeping entries at the top of a file cost nothing,\n * few enough that `--info` stays a header read rather than a scan.\n */\nconst RECORDS_SEARCHED_FOR_ORIGIN = 16;\n\n/** Default read budget per batch. Large enough to amortise syscalls, small enough to stay cheap. */\nexport const DEFAULT_CHUNK_BYTES = 8 * 1024 * 1024;\n\nexport interface RecordBatch {\n  /** Index of the first record in this batch, relative to the whole file. */\n  firstRecordIndex: number;\n  recordCount: number;\n  /**\n   * Raw record bytes, `recordCount * header.recordBytes` long.\n   *\n   * The buffer is reused between iterations. Copy anything you need to keep past\n   * the current loop turn.\n   */\n  data: Uint8Array;\n}\n\nexport interface ReadRecordsOptions {\n  /** First record to read, inclusive. Defaults to 0. */\n  startRecord?: number;\n  /** Last record to read, exclusive. Defaults to the file's record count. */\n  endRecord?: number;\n  chunkBytes?: number;\n}\n\nexport class EdfFile {\n  readonly path: string;\n  readonly fileSize: number;\n  /**\n   * Last-modified time when this file was opened, in milliseconds, for the same reason as\n   * `fileSize`.\n   *\n   * Kept as the raw number rather than a Date because `new Date(ms).getTime()` truncates to\n   * whole milliseconds: comparing that against a later `fstat`, which carries the\n   * filesystem's sub-millisecond precision, reported every undisturbed conversion as one\n   * whose input had changed underneath it.\n   */\n  readonly modifiedAtOpenMs: number;\n  readonly header: EdfHeader;\n  /** Records actually present in the file, which may differ from the header's claim. */\n  readonly recordCount: number;\n  readonly trailingBytes: number;\n  readonly diagnostics: Diagnostic[];\n\n  #handle: FileHandle;\n  #closed = false;\n  /** The last answer `changedSinceOpen` computed, so it survives the file being closed. */\n  #changed: boolean | null = null;\n\n  private constructor(init: {\n    path: string;\n    fileSize: number;\n    modifiedAtOpenMs: number;\n    header: EdfHeader;\n    recordCount: number;\n    trailingBytes: number;\n    diagnostics: Diagnostic[];\n    handle: FileHandle;\n  }) {\n    this.path = init.path;\n    this.fileSize = init.fileSize;\n    this.modifiedAtOpenMs = init.modifiedAtOpenMs;\n    this.header = init.header;\n    this.recordCount = init.recordCount;\n    this.trailingBytes = init.trailingBytes;\n    this.diagnostics = init.diagnostics;\n    this.#handle = init.handle;\n  }\n\n  /**\n   * SHA-256 of the bytes this conversion actually read.\n   *\n   * Hashed through the open descriptor, over exactly the `fileSize` bytes that were there\n   * when the file was opened — the same number every record count and window in the output\n   * was derived from. Re-opening the path to hash it afterwards described whatever was at\n   * that name by then: a recording still being written grew from 2,000 records to 3,000\n   * mid-conversion and metadata.json recorded `data_records: 2000` beside the checksum and\n   * byte count of the 3,000-record file, which is provenance for bytes nobody converted.\n   * Replacing the file at that path did the same thing more completely.\n   */\n  async sha256(): Promise<string> {\n    this.#assertOpen();\n    const hash = createHash('sha256');\n    const buffer = Buffer.alloc(Math.min(this.fileSize, 4 * 1024 * 1024) || 1);\n    for (let at = 0; at < this.fileSize; ) {\n      const want = Math.min(buffer.length, this.fileSize - at);\n      const { bytesRead } = await this.#handle.read(buffer, 0, want, at);\n      if (bytesRead <= 0) {\n        throw new EdfError(\n          'UNREADABLE',\n          `Expected ${this.fileSize} bytes to checksum but the file ended at ${at}; ` +\n            `it appears to have changed size while it was being read.`,\n          'Make sure the recording is not still being written to, then try again.',\n        );\n      }\n      hash.update(buffer.subarray(0, bytesRead));\n      at += bytesRead;\n    }\n    return hash.digest('hex');\n  }\n\n  /**\n   * Whether the file has changed since it was opened, by size or by modification time.\n   *\n   * Checked through the descriptor, so it answers for the bytes that were read rather than\n   * for whatever now answers to the same name. A recording still being written is the\n   * ordinary cause, and the conversion is still correct for the data it saw — it is the\n   * claim that the output describes the file as it now stands that stops being true.\n   */\n  async changedSinceOpen(): Promise<boolean> {\n    /*\n      A closed file remembers its last answer rather than inventing a new one.\n\n      Returning false once closed asserted \"it did not change\", which is not something a\n      closed descriptor can know — and `convert()` closes the file before it returns, so\n      `result.file.changedSinceOpen()` denied the very change the INPUT_CHANGED diagnostic\n      in the same result object had just reported. One object, two answers.\n\n      `convert()` always asks before closing, so the cached answer is the true one. A caller\n      who closed the file without ever asking gets an error, which is the same treatment\n      every other method on a closed file gets.\n    */\n    if (this.#closed) {\n      if (this.#changed !== null) return this.#changed;\n      throw new EdfError(\n        'UNREADABLE',\n        `\"${this.path}\" is closed, and whether it changed while it was open was never checked.`,\n        'Ask before closing the file. A ConvertResult carries the answer already, since ' +\n          'convert() checks it on the way out.',\n      );\n    }\n    const now = await this.#handle.stat().catch(() => null);\n    if (now === null) return this.#changed ?? false;\n    this.#changed = now.size !== this.fileSize || now.mtimeMs !== this.modifiedAtOpenMs;\n    return this.#changed;\n  }\n\n  static async open(path: string): Promise<EdfFile> {\n    const info = await stat(path).catch((cause: unknown) => {\n      throw new EdfError('UNREADABLE', `Cannot read \"${path}\": ${describe(cause)}`);\n    });\n    if (info.isDirectory()) {\n      throw new EdfError('UNREADABLE', `\"${path}\" is a directory, not an EDF file.`);\n    }\n    if (!info.isFile()) {\n      throw new EdfError('UNREADABLE', `\"${path}\" is not a regular file.`);\n    }\n\n    const handle = await open(path, 'r');\n    try {\n      const fixed = Buffer.alloc(Math.min(FIXED_HEADER_BYTES, info.size));\n      if (fixed.length > 0) {\n        const bytesRead = await readFully(handle, fixed, 0, fixed.length, 0);\n        if (bytesRead < fixed.length) throw changedWhileReading(0, fixed.length, bytesRead);\n      }\n\n      // The signal count decides how much more header there is to read. Read by the header\n      // parser itself, so the two cannot disagree about which files are readable: this used\n      // to have its own Number(), which tolerated the NUL padding sloppy writers emit but\n      // not the comma decimal separator that COMMA_DECIMAL exists to accept.\n      let headerBuffer = fixed;\n      if (fixed.length === FIXED_HEADER_BYTES) {\n        const ns = peekSignalCount(fixed);\n        if (ns !== null) {\n          const total = FIXED_HEADER_BYTES + ns * SIGNAL_HEADER_BYTES;\n          if (total <= info.size) {\n            headerBuffer = Buffer.alloc(total);\n            const bytesRead = await readFully(handle, headerBuffer, 0, total, 0);\n            if (bytesRead < total) throw changedWhileReading(0, total, bytesRead);\n          }\n        }\n      }\n\n      const { header, recordCount, trailingBytes, diagnostics } = parseHeader(\n        headerBuffer,\n        info.size,\n      );\n\n      return new EdfFile({\n        path,\n        fileSize: info.size,\n        modifiedAtOpenMs: info.mtimeMs,\n        header,\n        recordCount,\n        trailingBytes,\n        diagnostics,\n        handle,\n      });\n    } catch (error) {\n      await handle.close().catch(() => {});\n      throw error;\n    }\n  }\n\n  /** Signal channels, excluding the EDF+ annotations channel. */\n  get dataSignals(): EdfSignal[] {\n    return this.header.signals.filter((s) => !s.isAnnotations);\n  }\n\n  /**\n   * The annotation channel a record's start time is read from.\n   *\n   * EDF+ puts the timekeeping TAL first in the first annotation channel, and this was read as\n   * `annotationSignals[0]` — the first one declared, whether or not it can hold anything. A\n   * writer that declares an annotation channel and gives it zero samples per record leaves a\n   * slot of zero bytes, so nothing was read from it, and the timekeeping in the channel after\n   * it went unread: a three-record EDF+D reported \"3 of 3 data records carry no readable\n   * timekeeping annotation\" about three that were perfectly readable, and timed the file from\n   * zero.\n   *\n   * A channel with no room carries nothing, so it is not the one the TAL is in.\n   */\n  get timekeepingSignal(): EdfSignal | undefined {\n    return this.annotationSignals.find((signal) => signal.samplesPerRecord > 0);\n  }\n\n  get annotationSignals(): EdfSignal[] {\n    return this.header.signals.filter((s) => s.isAnnotations);\n  }\n\n  /** Total recording duration in seconds, based on records actually present. */\n  get durationSeconds(): number {\n    return this.recordCount * this.header.recordDuration;\n  }\n\n  /** Read a half-open range of records in batches. */\n  async *readRecords(options: ReadRecordsOptions = {}): AsyncGenerator<RecordBatch> {\n    this.#assertOpen();\n\n    /*\n      Record bounds have to be whole records.\n\n      A fractional `startRecord` was carried straight into `position = headerBytes +\n      record * recordBytes`, so reading from 1.5 began half a record in and every sample\n      after it was decoded from the wrong offset: on the two-channel test fixture it\n      returned channel 2's values under channel 1's signal, with no error. Clamping\n      silently would be no better, since a caller asking for record 1.5 has a bug the\n      library should name rather than paper over.\n    */\n    for (const [name, value] of [\n      ['startRecord', options.startRecord],\n      ['endRecord', options.endRecord],\n    ] as const) {\n      if (value !== undefined && !Number.isInteger(value)) {\n        throw new EdfError(\n          'BAD_HEADER_FIELD',\n          `readRecords: ${name} must be a whole record index, got ${value}.`,\n          'Record boundaries are the unit the file can be read in; a fractional index would decode samples from the middle of a record.',\n        );\n      }\n    }\n\n    const start = Math.max(0, options.startRecord ?? 0);\n    const end = Math.min(this.recordCount, options.endRecord ?? this.recordCount);\n    if (start >= end) return;\n\n    const { recordBytes } = this.header;\n    /*\n      Checked rather than handed to Buffer.alloc.\n\n      `chunkBytes: NaN` came back as `RangeError: The value of \"size\" is out of range` from\n      inside Node, with no mention of the option that caused it — while a fractional\n      `startRecord` two lines up gets a typed EdfError naming the field. Every other option\n      here is checked; this one reached the allocator.\n    */\n    const budget = options.chunkBytes ?? DEFAULT_CHUNK_BYTES;\n    if (!Number.isFinite(budget) || budget < 1) {\n      throw new EdfError(\n        'UNREADABLE',\n        `chunkBytes must be a positive number of bytes, got ${String(options.chunkBytes)}.`,\n        'It is a ceiling on how much of the file is held at once; one record is read whatever it says.',\n      );\n    }\n    /*\n      The budget is a ceiling, not an amount to reserve.\n\n      `Math.floor(budget / recordBytes)` is how many records would fit in it, and the buffer\n      was that many — whether or not the file had that many. A 848-byte fixture read with a\n      512 MB budget allocated 536,870,880 bytes for its two records, and every ordinary read\n      of a small file reserved the full 8 MB default. Nothing was wrong with the data; the\n      memory just had nothing to do with it.\n\n      Bounded by what is actually going to be read, so a batch of five hundred short\n      recordings costs five hundred short buffers rather than five hundred 8 MB ones.\n    */\n    const perChunk = Math.max(1, Math.min(Math.floor(budget / recordBytes), end - start));\n    const buffer = Buffer.alloc(perChunk * recordBytes);\n\n    for (let record = start; record < end; record += perChunk) {\n      const count = Math.min(perChunk, end - record);\n      const bytes = count * recordBytes;\n      const position = this.header.headerBytes + record * recordBytes;\n\n      const bytesRead = await readFully(this.#handle, buffer, 0, bytes, position);\n      if (bytesRead < bytes) {\n        // The file is shorter than its own size said. Quietly stopping here would\n        // hand back a conversion missing its tail with nothing to show for it.\n        throw new EdfError(\n          'UNREADABLE',\n          `Expected ${bytes} bytes of data at record ${record} but only ${bytesRead} were ` +\n            `available; the file appears to have changed size while it was being read.`,\n          'Make sure the recording is not still being written to, then try again.',\n        );\n      }\n\n      yield { firstRecordIndex: record, recordCount: count, data: buffer.subarray(0, bytes) };\n    }\n  }\n\n  /** Read one sample as its raw digital value. */\n  sampleAt(batch: RecordBatch, recordOffset: number, signal: EdfSignal, sampleIndex: number): number {\n    const position =\n      recordOffset * this.header.recordBytes +\n      signal.byteOffsetInRecord +\n      sampleIndex * this.header.bytesPerSample;\n\n    if (this.header.bytesPerSample === 3) {\n      // BDF stores 24-bit little-endian two's complement. Loading the three bytes\n      // into the top of a 32-bit word and shifting back down sign-extends them.\n      const data = batch.data;\n      return (\n        ((data[position] as number) << 8) |\n        ((data[position + 1] as number) << 16) |\n        ((data[position + 2] as number) << 24)\n      ) >> 8;\n    }\n    return readInt16LE(batch.data, position);\n  }\n\n  /** Byte offset of a signal's samples within a batch. */\n  offsetOf(batch: RecordBatch, recordOffset: number, signal: EdfSignal): number {\n    return recordOffset * this.header.recordBytes + signal.byteOffsetInRecord;\n  }\n\n  /** The annotation channel's raw bytes for one record in a batch. */\n  annotationBytes(batch: RecordBatch, recordOffset: number, signal: EdfSignal): Uint8Array {\n    const start = this.offsetOf(batch, recordOffset, signal);\n    return batch.data.subarray(start, start + signal.samplesPerRecord * this.header.bytesPerSample);\n  }\n\n  /**\n   * Read every EDF+ annotation in the file, plus the start time each record declares.\n   *\n   * Only the annotation channel is read, seeking straight to it inside each record\n   * rather than pulling whole records through memory. On a multi-gigabyte recording\n   * that is the difference between a few kilobytes of I/O and all of it.\n   *\n   * The whole file is always scanned, never just the records inside a requested\n   * window: writers are not obliged to store an annotation in the record its onset\n   * falls in, and some put every annotation in the first record. Reading only the\n   * window's records would drop those entirely.\n   */\n  /**\n   * Where this continuous recording begins, from the first record that says.\n   *\n   * A few records' worth of annotation bytes rather than the whole channel. A continuous\n   * recording's origin is the fraction of a second by which its first record follows the\n   * header's start time, and `--info` needs that to place a requested window — but it does\n   * not need the events, and finding one number by reading every record costs a seek per\n   * record across the whole file, which is the scan `--info` was deliberately spared.\n   *\n   * It reads on past record 0 because a conversion does. This used to stop there, so the\n   * moment one timekeeping TAL was unreadable the two disagreed: the conversion took the\n   * origin from record 1 and timed the file from 0.5s, while `--info` found nothing at\n   * record 0 and reported a recording starting at zero — the same file described two ways by\n   * one tool. Records are contiguous, so record `i` beginning at `t` puts the origin at\n   * `t - i * duration`, and any one of them settles it.\n   *\n   * The bound is what keeps this cheap: a file whose first `RECORDS_SEARCHED_FOR_ORIGIN`\n   * timekeeping entries are all unreadable reports an origin of zero here, and converting it\n   * raises ANNOTATION_DECODE_FAILED for every one of them.\n   *\n   * Returns null when there is nothing to read it from, in which case the origin is zero.\n   */\n  async readOrigin(): Promise<number | null> {\n    return (await this.scanOrigin()).origin;\n  }\n\n  /**\n   * The origin, and what the search saw on the way to it.\n   *\n   * `--info` takes this route for a continuous recording rather than reading every record,\n   * and reported nothing when the timekeeping it read was unreadable: the count was hard-coded\n   * to zero at the call site, so a file whose first TAL cannot be parsed raised\n   * ANNOTATION_DECODE_FAILED when converted and nothing under `--info`. Its byte-identical\n   * EDF+D twin — same bytes but for the reserved field, which has nothing to do with the\n   * defect — raised it both ways, because that path reads every record and counts as it goes.\n   *\n   * The failure was being read and then thrown away. `readOrigin` keeps its shape for callers\n   * who only want the number.\n   */\n  async scanOrigin(): Promise<{ origin: number | null; malformedTimekeeping: number }> {\n    this.#assertOpen();\n\n    let malformedTimekeeping = 0;\n    const channel = this.timekeepingSignal;\n    if (!channel || this.recordCount === 0) return { origin: null, malformedTimekeeping };\n\n    const { headerBytes, bytesPerSample, recordBytes, recordDuration } = this.header;\n    const buffer = Buffer.alloc(channel.samplesPerRecord * bytesPerSample);\n    if (buffer.length === 0) return { origin: null, malformedTimekeeping };\n\n    const searched = Math.min(this.recordCount, RECORDS_SEARCHED_FOR_ORIGIN);\n    for (let record = 0; record < searched; record++) {\n      const offset = headerBytes + record * recordBytes + channel.byteOffsetInRecord;\n      const bytesRead = await readFully(this.#handle, buffer, 0, buffer.length, offset);\n      if (bytesRead < buffer.length) return { origin: null, malformedTimekeeping };\n\n      const decoded = decodeRecordAnnotations(buffer, record);\n      malformedTimekeeping += decoded.malformedTimekeeping;\n      if (decoded.recordStart !== null) {\n        return { origin: decoded.recordStart - record * recordDuration, malformedTimekeeping };\n      }\n    }\n    return { origin: null, malformedTimekeeping };\n  }\n\n  async readAnnotations(): Promise<{\n    annotations: Annotation[];\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    this.#assertOpen();\n\n    const annotations: Annotation[] = [];\n    const recordStarts: (number | null)[] = new Array<number | null>(this.recordCount).fill(null);\n    let malformed = 0;\n    let malformedTimekeeping = 0;\n\n    const channels = this.annotationSignals;\n    if (channels.length === 0) {\n      return { annotations, recordStarts, malformed, malformedTimekeeping };\n    }\n\n    const { headerBytes, recordBytes, bytesPerSample } = this.header;\n    const buffers = channels.map((c) => Buffer.alloc(c.samplesPerRecord * bytesPerSample));\n    const timekeeping = this.timekeepingSignal;\n\n    for (let record = 0; record < this.recordCount; record++) {\n      for (const [position, channel] of channels.entries()) {\n        const buffer = buffers[position];\n        if (!buffer || buffer.length === 0) continue;\n\n        const offset = headerBytes + record * recordBytes + channel.byteOffsetInRecord;\n        const bytesRead = await readFully(this.#handle, buffer, 0, buffer.length, offset);\n        if (bytesRead < buffer.length) {\n          throw changedWhileReading(record, buffer.length, bytesRead, 'annotation data');\n        }\n\n        // Only the timekeeping channel carries the record's start; see timekeepingSignal.\n        const decoded = decodeRecordAnnotations(buffer, record, channel === timekeeping);\n        if (channel === timekeeping) recordStarts[record] = decoded.recordStart;\n        for (const annotation of decoded.annotations) annotations.push(annotation);\n        malformed += decoded.malformed;\n        malformedTimekeeping += decoded.malformedTimekeeping;\n      }\n    }\n\n    annotations.sort((a, b) => a.onset - b.onset || a.recordIndex - b.recordIndex);\n    return { annotations, recordStarts, malformed, malformedTimekeeping };\n  }\n\n  async close(): Promise<void> {\n    if (this.#closed) return;\n    this.#closed = true;\n    await this.#handle.close();\n  }\n\n  #assertOpen(): void {\n    if (this.#closed) throw new EdfError('UNREADABLE', 'This EDF file has already been closed.');\n  }\n}\n\nfunction describe(cause: unknown): string {\n  if (cause instanceof Error) {\n    const code = (cause as NodeJS.ErrnoException).code;\n    if (code === 'ENOENT') return 'no such file';\n    if (code === 'EACCES') return 'permission denied';\n    return cause.message;\n  }\n  return String(cause);\n}\n\n/**\n * The most `fs.read` will accept as a length.\n *\n * Node asserts on a length that does not fit in a signed 32-bit integer, and it asserts in\n * C++: `Assertion failed: args[3]->IsInt32()`, forty frames of native stack, SIGABRT. Not an\n * exception — nothing in JavaScript sees it, so no catch block and no `uncaughtException`\n * handler runs, and a library consumer's whole process goes down with it.\n *\n * A round gigabyte rather than the exact limit, so the loop below does whole even reads.\n */\nconst MAX_READ_BYTES = 1024 * 1024 * 1024;\n\n/** Fill a requested region unless EOF is reached; regular-file reads may legally be short. */\nasync function readFully(\n  handle: FileHandle,\n  buffer: Buffer,\n  offset: number,\n  length: number,\n  position: number,\n): Promise<number> {\n  let total = 0;\n  while (total < length) {\n    /*\n      Capped, because one data record can be larger than a single read may be.\n\n      A record is read in one call when it exceeds the chunk budget — there is nothing\n      smaller to divide it by, since a record is the unit the format is addressed in. EDF's\n      samples-per-record field is 8 characters, so eleven channels at 99,999,999 samples make\n      a record of 2.2 GB, and a long record duration at ordinary rates gets there too. That\n      went to `fs.read` as a single length over 2^31-1 and took the process out with a native\n      assertion rather than an error.\n\n      Looping was already how a short read is handled, so the cap costs one more iteration\n      per gigabyte and nothing else.\n    */\n    const want = Math.min(length - total, MAX_READ_BYTES);\n    const { bytesRead } = await handle.read(buffer, offset + total, want, position + total);\n    if (bytesRead === 0) break;\n    total += bytesRead;\n  }\n  return total;\n}\n\nfunction changedWhileReading(\n  record: number,\n  expected: number,\n  actual: number,\n  subject = 'data',\n): EdfError {\n  return new EdfError(\n    'UNREADABLE',\n    `Expected ${expected} bytes of ${subject} at record ${record} but only ${actual} were ` +\n      `available; the file appears to have changed size while it was being read.`,\n    'Make sure the recording is not still being written to, then try again.',\n  );\n}\n"]}
+{"version":3,"file":"reader.js","sourceRoot":"","sources":["../../src/edf/reader.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AAG9C,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAEzC,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAEvC,OAAO,EAAE,kBAAkB,EAAE,mBAAmB,EAAE,WAAW,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAEpG,OAAO,EAAE,uBAAuB,EAAE,MAAM,kBAAkB,CAAC;AAE3D,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAEvD;;;;;GAKG;AACH,MAAM,2BAA2B,GAAG,EAAE,CAAC;AAEvC,oGAAoG;AACpG,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;AAuBnD,MAAM,OAAO,OAAO;IACT,IAAI,CAAS;IACb,QAAQ,CAAS;IAC1B;;;;;;;;OAQG;IACM,gBAAgB,CAAS;IACzB,MAAM,CAAY;IAC3B,sFAAsF;IAC7E,WAAW,CAAS;IACpB,aAAa,CAAS;IACtB,WAAW,CAAe;IAEnC,OAAO,CAAa;IACpB,OAAO,GAAG,KAAK,CAAC;IAChB,yFAAyF;IACzF,QAAQ,GAAmB,IAAI,CAAC;IAEhC,YAAoB,IASnB;QACC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACtB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC9B,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,gBAAgB,CAAC;QAC9C,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC;QACpC,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,aAAa,CAAC;QACxC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC;QACpC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC;IAC7B,CAAC;IAED;;;;;;;;;;OAUG;IACH,KAAK,CAAC,MAAM;QACV,IAAI,CAAC,WAAW,EAAE,CAAC;QACnB,MAAM,IAAI,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC;QAClC,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3E,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,QAAQ,GAAI,CAAC;YACtC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC,CAAC;YACzD,MAAM,EAAE,SAAS,EAAE,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC;YACnE,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;gBACnB,MAAM,IAAI,QAAQ,CAChB,YAAY,EACZ,YAAY,IAAI,CAAC,QAAQ,4CAA4C,EAAE,IAAI;oBACzE,0DAA0D,EAC5D,wEAAwE,CACzE,CAAC;YACJ,CAAC;YACD,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;YAC3C,EAAE,IAAI,SAAS,CAAC;QAClB,CAAC;QACD,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,gBAAgB;QACpB;;;;;;;;;;;UAWE;QACF,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI;gBAAE,OAAO,IAAI,CAAC,QAAQ,CAAC;YACjD,MAAM,IAAI,QAAQ,CAChB,YAAY,EACZ,IAAI,IAAI,CAAC,IAAI,0EAA0E,EACvF,iFAAiF;gBAC/E,qCAAqC,CACxC,CAAC;QACJ,CAAC;QACD,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;QACxD,IAAI,GAAG,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC,QAAQ,IAAI,KAAK,CAAC;QAChD,IAAI,CAAC,QAAQ,GAAG,GAAG,CAAC,IAAI,KAAK,IAAI,CAAC,QAAQ,IAAI,GAAG,CAAC,OAAO,KAAK,IAAI,CAAC,gBAAgB,CAAC;QACpF,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAED,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,IAAY;QAC5B,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,KAAc,EAAE,EAAE;YACrD,MAAM,IAAI,QAAQ,CAAC,YAAY,EAAE,gBAAgB,IAAI,MAAM,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAChF,CAAC,CAAC,CAAC;QACH,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;YACvB,MAAM,IAAI,QAAQ,CAAC,YAAY,EAAE,IAAI,IAAI,oCAAoC,CAAC,CAAC;QACjF,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;YACnB,MAAM,IAAI,QAAQ,CAAC,YAAY,EAAE,IAAI,IAAI,0BAA0B,CAAC,CAAC;QACvE,CAAC;QAED,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACrC,IAAI,CAAC;YACH,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,kBAAkB,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YACpE,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACrB,MAAM,SAAS,GAAG,MAAM,SAAS,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;gBACrE,IAAI,SAAS,GAAG,KAAK,CAAC,MAAM;oBAAE,MAAM,mBAAmB,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;YACtF,CAAC;YAED,qFAAqF;YACrF,sFAAsF;YACtF,oFAAoF;YACpF,uEAAuE;YACvE,IAAI,YAAY,GAAG,KAAK,CAAC;YACzB,IAAI,KAAK,CAAC,MAAM,KAAK,kBAAkB,EAAE,CAAC;gBACxC,MAAM,EAAE,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;gBAClC,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;oBAChB,MAAM,KAAK,GAAG,kBAAkB,GAAG,EAAE,GAAG,mBAAmB,CAAC;oBAC5D,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;wBACvB,YAAY,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;wBACnC,MAAM,SAAS,GAAG,MAAM,SAAS,CAAC,MAAM,EAAE,YAAY,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;wBACrE,IAAI,SAAS,GAAG,KAAK;4BAAE,MAAM,mBAAmB,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;oBACxE,CAAC;gBACH,CAAC;YACH,CAAC;YAED,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,aAAa,EAAE,WAAW,EAAE,GAAG,WAAW,CACrE,YAAY,EACZ,IAAI,CAAC,IAAI,CACV,CAAC;YAEF,OAAO,IAAI,OAAO,CAAC;gBACjB,IAAI;gBACJ,QAAQ,EAAE,IAAI,CAAC,IAAI;gBACnB,gBAAgB,EAAE,IAAI,CAAC,OAAO;gBAC9B,MAAM;gBACN,WAAW;gBACX,aAAa;gBACb,WAAW;gBACX,MAAM;aACP,CAAC,CAAC;QACL,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,MAAM,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;YACrC,MAAM,KAAK,CAAC;QACd,CAAC;IACH,CAAC;IAED,+DAA+D;IAC/D,IAAI,WAAW;QACb,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC;IAC7D,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,IAAI,iBAAiB;QACnB,OAAO,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,gBAAgB,GAAG,CAAC,CAAC,CAAC;IAC9E,CAAC;IAED,IAAI,iBAAiB;QACnB,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC;IAC5D,CAAC;IAED,8EAA8E;IAC9E,IAAI,eAAe;QACjB,OAAO,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC;IACvD,CAAC;IAED,oDAAoD;IACpD,KAAK,CAAC,CAAC,WAAW,CAAC,UAA8B,EAAE;QACjD,IAAI,CAAC,WAAW,EAAE,CAAC;QAEnB;;;;;;;;;UASE;QACF,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI;YAC1B,CAAC,aAAa,EAAE,OAAO,CAAC,WAAW,CAAC;YACpC,CAAC,WAAW,EAAE,OAAO,CAAC,SAAS,CAAC;SACxB,EAAE,CAAC;YACX,IAAI,KAAK,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;gBACpD,MAAM,IAAI,QAAQ,CAChB,kBAAkB,EAClB,gBAAgB,IAAI,sCAAsC,KAAK,GAAG,EAClE,8HAA8H,CAC/H,CAAC;YACJ,CAAC;QACH,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,WAAW,IAAI,CAAC,CAAC,CAAC;QACpD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,OAAO,CAAC,SAAS,IAAI,IAAI,CAAC,WAAW,CAAC,CAAC;QAC9E,IAAI,KAAK,IAAI,GAAG;YAAE,OAAO;QAEzB,MAAM,EAAE,WAAW,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC;QACpC;;;;;;;UAOE;QACF,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,IAAI,mBAAmB,CAAC;QACzD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3C,MAAM,IAAI,QAAQ,CAChB,YAAY,EACZ,sDAAsD,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,GAAG,EACnF,+FAA+F,CAChG,CAAC;QACJ,CAAC;QACD;;;;;;;;;;;UAWE;QACF,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,WAAW,CAAC,EAAE,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC;QACtF,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,QAAQ,GAAG,WAAW,CAAC,CAAC;QAEpD,KAAK,IAAI,MAAM,GAAG,KAAK,EAAE,MAAM,GAAG,GAAG,EAAE,MAAM,IAAI,QAAQ,EAAE,CAAC;YAC1D,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,GAAG,MAAM,CAAC,CAAC;YAC/C,MAAM,KAAK,GAAG,KAAK,GAAG,WAAW,CAAC;YAClC,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,WAAW,GAAG,MAAM,GAAG,WAAW,CAAC;YAEhE,MAAM,SAAS,GAAG,MAAM,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;YAC5E,IAAI,SAAS,GAAG,KAAK,EAAE,CAAC;gBACtB,0EAA0E;gBAC1E,uEAAuE;gBACvE,MAAM,IAAI,QAAQ,CAChB,YAAY,EACZ,YAAY,KAAK,4BAA4B,MAAM,aAAa,SAAS,QAAQ;oBAC/E,2EAA2E,EAC7E,wEAAwE,CACzE,CAAC;YACJ,CAAC;YAED,MAAM,EAAE,gBAAgB,EAAE,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC;QAC1F,CAAC;IACH,CAAC;IAED,gDAAgD;IAChD,QAAQ,CAAC,KAAkB,EAAE,YAAoB,EAAE,MAAiB,EAAE,WAAmB;QACvF,MAAM,QAAQ,GACZ,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,WAAW;YACtC,MAAM,CAAC,kBAAkB;YACzB,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC;QAE3C,IAAI,IAAI,CAAC,MAAM,CAAC,cAAc,KAAK,CAAC,EAAE,CAAC;YACrC,4EAA4E;YAC5E,0EAA0E;YAC1E,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;YACxB,OAAO,CACL,CAAE,IAAI,CAAC,QAAQ,CAAY,IAAI,CAAC,CAAC;gBACjC,CAAE,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAY,IAAI,EAAE,CAAC;gBACtC,CAAE,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAY,IAAI,EAAE,CAAC,CACvC,IAAI,CAAC,CAAC;QACT,CAAC;QACD,OAAO,WAAW,CAAC,KAAK,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IAC3C,CAAC;IAED,wDAAwD;IACxD,QAAQ,CAAC,KAAkB,EAAE,YAAoB,EAAE,MAAiB;QAClE,OAAO,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,WAAW,GAAG,MAAM,CAAC,kBAAkB,CAAC;IAC5E,CAAC;IAED,oEAAoE;IACpE,eAAe,CAAC,KAAkB,EAAE,YAAoB,EAAE,MAAiB;QACzE,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,YAAY,EAAE,MAAM,CAAC,CAAC;QACzD,OAAO,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,CAAC,gBAAgB,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC;IAClG,CAAC;IAED;;;;;;;;;;;OAWG;IACH;;;;;;;;;;;;;;;;;;;;;OAqBG;IACH,KAAK,CAAC,UAAU;QACd,OAAO,CAAC,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,MAAM,CAAC;IAC1C,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,KAAK,CAAC,UAAU;QACd,IAAI,CAAC,WAAW,EAAE,CAAC;QAEnB,IAAI,oBAAoB,GAAG,CAAC,CAAC;QAC7B,MAAM,OAAO,GAAG,IAAI,CAAC,iBAAiB,CAAC;QACvC,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,WAAW,KAAK,CAAC;YAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,oBAAoB,EAAE,CAAC;QAEtF,MAAM,EAAE,WAAW,EAAE,cAAc,EAAE,WAAW,EAAE,cAAc,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC;QACjF,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,gBAAgB,GAAG,cAAc,CAAC,CAAC;QACvE,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,oBAAoB,EAAE,CAAC;QAEvE,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,2BAA2B,CAAC,CAAC;QACzE,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,QAAQ,EAAE,MAAM,EAAE,EAAE,CAAC;YACjD,MAAM,MAAM,GAAG,WAAW,GAAG,MAAM,GAAG,WAAW,GAAG,OAAO,CAAC,kBAAkB,CAAC;YAC/E,MAAM,SAAS,GAAG,MAAM,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YAClF,IAAI,SAAS,GAAG,MAAM,CAAC,MAAM;gBAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,oBAAoB,EAAE,CAAC;YAE7E,MAAM,OAAO,GAAG,uBAAuB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YACxD,oBAAoB,IAAI,OAAO,CAAC,oBAAoB,CAAC;YACrD,IAAI,OAAO,CAAC,WAAW,KAAK,IAAI,EAAE,CAAC;gBACjC,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,WAAW,GAAG,MAAM,GAAG,cAAc,EAAE,oBAAoB,EAAE,CAAC;YACzF,CAAC;QACH,CAAC;QACD,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,oBAAoB,EAAE,CAAC;IAChD,CAAC;IAED,KAAK,CAAC,eAAe;QASnB,IAAI,CAAC,WAAW,EAAE,CAAC;QAEnB,MAAM,WAAW,GAAiB,EAAE,CAAC;QACrC,MAAM,YAAY,GAAsB,IAAI,KAAK,CAAgB,IAAI,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9F,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,oBAAoB,GAAG,CAAC,CAAC;QAC7B,IAAI,mBAAmB,GAAG,CAAC,CAAC;QAE5B,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC;QACxC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,SAAS,EAAE,oBAAoB,EAAE,mBAAmB,EAAE,CAAC;QAC7F,CAAC;QAED,MAAM,EAAE,WAAW,EAAE,WAAW,EAAE,cAAc,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC;QACjE,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,gBAAgB,GAAG,cAAc,CAAC,CAAC,CAAC;QACvF,MAAM,WAAW,GAAG,IAAI,CAAC,iBAAiB,CAAC;QAE3C,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC,WAAW,EAAE,MAAM,EAAE,EAAE,CAAC;YACzD,KAAK,MAAM,CAAC,QAAQ,EAAE,OAAO,CAAC,IAAI,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC;gBACrD,MAAM,MAAM,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC;gBACjC,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;oBAAE,SAAS;gBAE7C,MAAM,MAAM,GAAG,WAAW,GAAG,MAAM,GAAG,WAAW,GAAG,OAAO,CAAC,kBAAkB,CAAC;gBAC/E,MAAM,SAAS,GAAG,MAAM,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;gBAClF,IAAI,SAAS,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;oBAC9B,MAAM,mBAAmB,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,SAAS,EAAE,iBAAiB,CAAC,CAAC;gBACjF,CAAC;gBAED,kFAAkF;gBAClF,MAAM,OAAO,GAAG,uBAAuB,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,KAAK,WAAW,CAAC,CAAC;gBACjF,IAAI,OAAO,KAAK,WAAW;oBAAE,YAAY,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC,WAAW,CAAC;gBACxE,KAAK,MAAM,UAAU,IAAI,OAAO,CAAC,WAAW;oBAAE,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBAC3E,SAAS,IAAI,OAAO,CAAC,SAAS,CAAC;gBAC/B,oBAAoB,IAAI,OAAO,CAAC,oBAAoB,CAAC;gBACrD,mBAAmB,IAAI,OAAO,CAAC,mBAAmB,CAAC;YACrD,CAAC;QACH,CAAC;QAED,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC;QAC/E,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,SAAS,EAAE,oBAAoB,EAAE,mBAAmB,EAAE,CAAC;IAC7F,CAAC;IAED,KAAK,CAAC,KAAK;QACT,IAAI,IAAI,CAAC,OAAO;YAAE,OAAO;QACzB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;QACpB,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;IAC7B,CAAC;IAED,WAAW;QACT,IAAI,IAAI,CAAC,OAAO;YAAE,MAAM,IAAI,QAAQ,CAAC,YAAY,EAAE,wCAAwC,CAAC,CAAC;IAC/F,CAAC;CACF;AAED,SAAS,QAAQ,CAAC,KAAc;IAC9B,IAAI,KAAK,YAAY,KAAK,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAI,KAA+B,CAAC,IAAI,CAAC;QACnD,IAAI,IAAI,KAAK,QAAQ;YAAE,OAAO,cAAc,CAAC;QAC7C,IAAI,IAAI,KAAK,QAAQ;YAAE,OAAO,mBAAmB,CAAC;QAClD,OAAO,KAAK,CAAC,OAAO,CAAC;IACvB,CAAC;IACD,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC;AACvB,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,cAAc,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC;AAE1C,8FAA8F;AAC9F,KAAK,UAAU,SAAS,CACtB,MAAkB,EAClB,MAAc,EACd,MAAc,EACd,MAAc,EACd,QAAgB;IAEhB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,OAAO,KAAK,GAAG,MAAM,EAAE,CAAC;QACtB;;;;;;;;;;;;UAYE;QACF,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,KAAK,EAAE,cAAc,CAAC,CAAC;QACtD,MAAM,EAAE,SAAS,EAAE,GAAG,MAAM,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,GAAG,KAAK,EAAE,IAAI,EAAE,QAAQ,GAAG,KAAK,CAAC,CAAC;QACxF,IAAI,SAAS,KAAK,CAAC;YAAE,MAAM;QAC3B,KAAK,IAAI,SAAS,CAAC;IACrB,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,mBAAmB,CAC1B,MAAc,EACd,QAAgB,EAChB,MAAc,EACd,OAAO,GAAG,MAAM;IAEhB,OAAO,IAAI,QAAQ,CACjB,YAAY,EACZ,YAAY,QAAQ,aAAa,OAAO,cAAc,MAAM,aAAa,MAAM,QAAQ;QACrF,2EAA2E,EAC7E,wEAAwE,CACzE,CAAC;AACJ,CAAC","sourcesContent":["/**\n * Chunked reader for EDF / EDF+ files.\n *\n * Data records are read in batches sized by a byte budget rather than all at once,\n * so peak memory stays flat regardless of how long the recording is. A 4 GB file\n * and a 4 MB file use the same working set.\n */\n\nimport { open, stat } from 'node:fs/promises';\nimport type { FileHandle } from 'node:fs/promises';\n\nimport { createHash } from 'node:crypto';\n\nimport { EdfError } from './errors.js';\nimport type { Diagnostic } from './errors.js';\nimport { FIXED_HEADER_BYTES, SIGNAL_HEADER_BYTES, parseHeader, peekSignalCount } from './header.js';\nimport type { EdfHeader, EdfSignal } from './header.js';\nimport { decodeRecordAnnotations } from './annotations.js';\nimport type { Annotation } from './annotations.js';\nimport { decodeLatin1, readInt16LE } from './bytes.js';\n\n/**\n * How far `readOrigin` looks for a record that states its own start time.\n *\n * Enough that one or two unreadable timekeeping entries at the top of a file cost nothing,\n * few enough that `--info` stays a header read rather than a scan.\n */\nconst RECORDS_SEARCHED_FOR_ORIGIN = 16;\n\n/** Default read budget per batch. Large enough to amortise syscalls, small enough to stay cheap. */\nexport const DEFAULT_CHUNK_BYTES = 8 * 1024 * 1024;\n\nexport interface RecordBatch {\n  /** Index of the first record in this batch, relative to the whole file. */\n  firstRecordIndex: number;\n  recordCount: number;\n  /**\n   * Raw record bytes, `recordCount * header.recordBytes` long.\n   *\n   * The buffer is reused between iterations. Copy anything you need to keep past\n   * the current loop turn.\n   */\n  data: Uint8Array;\n}\n\nexport interface ReadRecordsOptions {\n  /** First record to read, inclusive. Defaults to 0. */\n  startRecord?: number;\n  /** Last record to read, exclusive. Defaults to the file's record count. */\n  endRecord?: number;\n  chunkBytes?: number;\n}\n\nexport class EdfFile {\n  readonly path: string;\n  readonly fileSize: number;\n  /**\n   * Last-modified time when this file was opened, in milliseconds, for the same reason as\n   * `fileSize`.\n   *\n   * Kept as the raw number rather than a Date because `new Date(ms).getTime()` truncates to\n   * whole milliseconds: comparing that against a later `fstat`, which carries the\n   * filesystem's sub-millisecond precision, reported every undisturbed conversion as one\n   * whose input had changed underneath it.\n   */\n  readonly modifiedAtOpenMs: number;\n  readonly header: EdfHeader;\n  /** Records actually present in the file, which may differ from the header's claim. */\n  readonly recordCount: number;\n  readonly trailingBytes: number;\n  readonly diagnostics: Diagnostic[];\n\n  #handle: FileHandle;\n  #closed = false;\n  /** The last answer `changedSinceOpen` computed, so it survives the file being closed. */\n  #changed: boolean | null = null;\n\n  private constructor(init: {\n    path: string;\n    fileSize: number;\n    modifiedAtOpenMs: number;\n    header: EdfHeader;\n    recordCount: number;\n    trailingBytes: number;\n    diagnostics: Diagnostic[];\n    handle: FileHandle;\n  }) {\n    this.path = init.path;\n    this.fileSize = init.fileSize;\n    this.modifiedAtOpenMs = init.modifiedAtOpenMs;\n    this.header = init.header;\n    this.recordCount = init.recordCount;\n    this.trailingBytes = init.trailingBytes;\n    this.diagnostics = init.diagnostics;\n    this.#handle = init.handle;\n  }\n\n  /**\n   * SHA-256 of the bytes this conversion actually read.\n   *\n   * Hashed through the open descriptor, over exactly the `fileSize` bytes that were there\n   * when the file was opened — the same number every record count and window in the output\n   * was derived from. Re-opening the path to hash it afterwards described whatever was at\n   * that name by then: a recording still being written grew from 2,000 records to 3,000\n   * mid-conversion and metadata.json recorded `data_records: 2000` beside the checksum and\n   * byte count of the 3,000-record file, which is provenance for bytes nobody converted.\n   * Replacing the file at that path did the same thing more completely.\n   */\n  async sha256(): Promise<string> {\n    this.#assertOpen();\n    const hash = createHash('sha256');\n    const buffer = Buffer.alloc(Math.min(this.fileSize, 4 * 1024 * 1024) || 1);\n    for (let at = 0; at < this.fileSize; ) {\n      const want = Math.min(buffer.length, this.fileSize - at);\n      const { bytesRead } = await this.#handle.read(buffer, 0, want, at);\n      if (bytesRead <= 0) {\n        throw new EdfError(\n          'UNREADABLE',\n          `Expected ${this.fileSize} bytes to checksum but the file ended at ${at}; ` +\n            `it appears to have changed size while it was being read.`,\n          'Make sure the recording is not still being written to, then try again.',\n        );\n      }\n      hash.update(buffer.subarray(0, bytesRead));\n      at += bytesRead;\n    }\n    return hash.digest('hex');\n  }\n\n  /**\n   * Whether the file has changed since it was opened, by size or by modification time.\n   *\n   * Checked through the descriptor, so it answers for the bytes that were read rather than\n   * for whatever now answers to the same name. A recording still being written is the\n   * ordinary cause, and the conversion is still correct for the data it saw — it is the\n   * claim that the output describes the file as it now stands that stops being true.\n   */\n  async changedSinceOpen(): Promise<boolean> {\n    /*\n      A closed file remembers its last answer rather than inventing a new one.\n\n      Returning false once closed asserted \"it did not change\", which is not something a\n      closed descriptor can know — and `convert()` closes the file before it returns, so\n      `result.file.changedSinceOpen()` denied the very change the INPUT_CHANGED diagnostic\n      in the same result object had just reported. One object, two answers.\n\n      `convert()` always asks before closing, so the cached answer is the true one. A caller\n      who closed the file without ever asking gets an error, which is the same treatment\n      every other method on a closed file gets.\n    */\n    if (this.#closed) {\n      if (this.#changed !== null) return this.#changed;\n      throw new EdfError(\n        'UNREADABLE',\n        `\"${this.path}\" is closed, and whether it changed while it was open was never checked.`,\n        'Ask before closing the file. A ConvertResult carries the answer already, since ' +\n          'convert() checks it on the way out.',\n      );\n    }\n    const now = await this.#handle.stat().catch(() => null);\n    if (now === null) return this.#changed ?? false;\n    this.#changed = now.size !== this.fileSize || now.mtimeMs !== this.modifiedAtOpenMs;\n    return this.#changed;\n  }\n\n  static async open(path: string): Promise<EdfFile> {\n    const info = await stat(path).catch((cause: unknown) => {\n      throw new EdfError('UNREADABLE', `Cannot read \"${path}\": ${describe(cause)}`);\n    });\n    if (info.isDirectory()) {\n      throw new EdfError('UNREADABLE', `\"${path}\" is a directory, not an EDF file.`);\n    }\n    if (!info.isFile()) {\n      throw new EdfError('UNREADABLE', `\"${path}\" is not a regular file.`);\n    }\n\n    const handle = await open(path, 'r');\n    try {\n      const fixed = Buffer.alloc(Math.min(FIXED_HEADER_BYTES, info.size));\n      if (fixed.length > 0) {\n        const bytesRead = await readFully(handle, fixed, 0, fixed.length, 0);\n        if (bytesRead < fixed.length) throw changedWhileReading(0, fixed.length, bytesRead);\n      }\n\n      // The signal count decides how much more header there is to read. Read by the header\n      // parser itself, so the two cannot disagree about which files are readable: this used\n      // to have its own Number(), which tolerated the NUL padding sloppy writers emit but\n      // not the comma decimal separator that COMMA_DECIMAL exists to accept.\n      let headerBuffer = fixed;\n      if (fixed.length === FIXED_HEADER_BYTES) {\n        const ns = peekSignalCount(fixed);\n        if (ns !== null) {\n          const total = FIXED_HEADER_BYTES + ns * SIGNAL_HEADER_BYTES;\n          if (total <= info.size) {\n            headerBuffer = Buffer.alloc(total);\n            const bytesRead = await readFully(handle, headerBuffer, 0, total, 0);\n            if (bytesRead < total) throw changedWhileReading(0, total, bytesRead);\n          }\n        }\n      }\n\n      const { header, recordCount, trailingBytes, diagnostics } = parseHeader(\n        headerBuffer,\n        info.size,\n      );\n\n      return new EdfFile({\n        path,\n        fileSize: info.size,\n        modifiedAtOpenMs: info.mtimeMs,\n        header,\n        recordCount,\n        trailingBytes,\n        diagnostics,\n        handle,\n      });\n    } catch (error) {\n      await handle.close().catch(() => {});\n      throw error;\n    }\n  }\n\n  /** Signal channels, excluding the EDF+ annotations channel. */\n  get dataSignals(): EdfSignal[] {\n    return this.header.signals.filter((s) => !s.isAnnotations);\n  }\n\n  /**\n   * The annotation channel a record's start time is read from.\n   *\n   * EDF+ puts the timekeeping TAL first in the first annotation channel, and this was read as\n   * `annotationSignals[0]` — the first one declared, whether or not it can hold anything. A\n   * writer that declares an annotation channel and gives it zero samples per record leaves a\n   * slot of zero bytes, so nothing was read from it, and the timekeeping in the channel after\n   * it went unread: a three-record EDF+D reported \"3 of 3 data records carry no readable\n   * timekeeping annotation\" about three that were perfectly readable, and timed the file from\n   * zero.\n   *\n   * A channel with no room carries nothing, so it is not the one the TAL is in.\n   */\n  get timekeepingSignal(): EdfSignal | undefined {\n    return this.annotationSignals.find((signal) => signal.samplesPerRecord > 0);\n  }\n\n  get annotationSignals(): EdfSignal[] {\n    return this.header.signals.filter((s) => s.isAnnotations);\n  }\n\n  /** Total recording duration in seconds, based on records actually present. */\n  get durationSeconds(): number {\n    return this.recordCount * this.header.recordDuration;\n  }\n\n  /** Read a half-open range of records in batches. */\n  async *readRecords(options: ReadRecordsOptions = {}): AsyncGenerator<RecordBatch> {\n    this.#assertOpen();\n\n    /*\n      Record bounds have to be whole records.\n\n      A fractional `startRecord` was carried straight into `position = headerBytes +\n      record * recordBytes`, so reading from 1.5 began half a record in and every sample\n      after it was decoded from the wrong offset: on the two-channel test fixture it\n      returned channel 2's values under channel 1's signal, with no error. Clamping\n      silently would be no better, since a caller asking for record 1.5 has a bug the\n      library should name rather than paper over.\n    */\n    for (const [name, value] of [\n      ['startRecord', options.startRecord],\n      ['endRecord', options.endRecord],\n    ] as const) {\n      if (value !== undefined && !Number.isInteger(value)) {\n        throw new EdfError(\n          'BAD_HEADER_FIELD',\n          `readRecords: ${name} must be a whole record index, got ${value}.`,\n          'Record boundaries are the unit the file can be read in; a fractional index would decode samples from the middle of a record.',\n        );\n      }\n    }\n\n    const start = Math.max(0, options.startRecord ?? 0);\n    const end = Math.min(this.recordCount, options.endRecord ?? this.recordCount);\n    if (start >= end) return;\n\n    const { recordBytes } = this.header;\n    /*\n      Checked rather than handed to Buffer.alloc.\n\n      `chunkBytes: NaN` came back as `RangeError: The value of \"size\" is out of range` from\n      inside Node, with no mention of the option that caused it — while a fractional\n      `startRecord` two lines up gets a typed EdfError naming the field. Every other option\n      here is checked; this one reached the allocator.\n    */\n    const budget = options.chunkBytes ?? DEFAULT_CHUNK_BYTES;\n    if (!Number.isFinite(budget) || budget < 1) {\n      throw new EdfError(\n        'UNREADABLE',\n        `chunkBytes must be a positive number of bytes, got ${String(options.chunkBytes)}.`,\n        'It is a ceiling on how much of the file is held at once; one record is read whatever it says.',\n      );\n    }\n    /*\n      The budget is a ceiling, not an amount to reserve.\n\n      `Math.floor(budget / recordBytes)` is how many records would fit in it, and the buffer\n      was that many — whether or not the file had that many. A 848-byte fixture read with a\n      512 MB budget allocated 536,870,880 bytes for its two records, and every ordinary read\n      of a small file reserved the full 8 MB default. Nothing was wrong with the data; the\n      memory just had nothing to do with it.\n\n      Bounded by what is actually going to be read, so a batch of five hundred short\n      recordings costs five hundred short buffers rather than five hundred 8 MB ones.\n    */\n    const perChunk = Math.max(1, Math.min(Math.floor(budget / recordBytes), end - start));\n    const buffer = Buffer.alloc(perChunk * recordBytes);\n\n    for (let record = start; record < end; record += perChunk) {\n      const count = Math.min(perChunk, end - record);\n      const bytes = count * recordBytes;\n      const position = this.header.headerBytes + record * recordBytes;\n\n      const bytesRead = await readFully(this.#handle, buffer, 0, bytes, position);\n      if (bytesRead < bytes) {\n        // The file is shorter than its own size said. Quietly stopping here would\n        // hand back a conversion missing its tail with nothing to show for it.\n        throw new EdfError(\n          'UNREADABLE',\n          `Expected ${bytes} bytes of data at record ${record} but only ${bytesRead} were ` +\n            `available; the file appears to have changed size while it was being read.`,\n          'Make sure the recording is not still being written to, then try again.',\n        );\n      }\n\n      yield { firstRecordIndex: record, recordCount: count, data: buffer.subarray(0, bytes) };\n    }\n  }\n\n  /** Read one sample as its raw digital value. */\n  sampleAt(batch: RecordBatch, recordOffset: number, signal: EdfSignal, sampleIndex: number): number {\n    const position =\n      recordOffset * this.header.recordBytes +\n      signal.byteOffsetInRecord +\n      sampleIndex * this.header.bytesPerSample;\n\n    if (this.header.bytesPerSample === 3) {\n      // BDF stores 24-bit little-endian two's complement. Loading the three bytes\n      // into the top of a 32-bit word and shifting back down sign-extends them.\n      const data = batch.data;\n      return (\n        ((data[position] as number) << 8) |\n        ((data[position + 1] as number) << 16) |\n        ((data[position + 2] as number) << 24)\n      ) >> 8;\n    }\n    return readInt16LE(batch.data, position);\n  }\n\n  /** Byte offset of a signal's samples within a batch. */\n  offsetOf(batch: RecordBatch, recordOffset: number, signal: EdfSignal): number {\n    return recordOffset * this.header.recordBytes + signal.byteOffsetInRecord;\n  }\n\n  /** The annotation channel's raw bytes for one record in a batch. */\n  annotationBytes(batch: RecordBatch, recordOffset: number, signal: EdfSignal): Uint8Array {\n    const start = this.offsetOf(batch, recordOffset, signal);\n    return batch.data.subarray(start, start + signal.samplesPerRecord * this.header.bytesPerSample);\n  }\n\n  /**\n   * Read every EDF+ annotation in the file, plus the start time each record declares.\n   *\n   * Only the annotation channel is read, seeking straight to it inside each record\n   * rather than pulling whole records through memory. On a multi-gigabyte recording\n   * that is the difference between a few kilobytes of I/O and all of it.\n   *\n   * The whole file is always scanned, never just the records inside a requested\n   * window: writers are not obliged to store an annotation in the record its onset\n   * falls in, and some put every annotation in the first record. Reading only the\n   * window's records would drop those entirely.\n   */\n  /**\n   * Where this continuous recording begins, from the first record that says.\n   *\n   * A few records' worth of annotation bytes rather than the whole channel. A continuous\n   * recording's origin is the fraction of a second by which its first record follows the\n   * header's start time, and `--info` needs that to place a requested window — but it does\n   * not need the events, and finding one number by reading every record costs a seek per\n   * record across the whole file, which is the scan `--info` was deliberately spared.\n   *\n   * It reads on past record 0 because a conversion does. This used to stop there, so the\n   * moment one timekeeping TAL was unreadable the two disagreed: the conversion took the\n   * origin from record 1 and timed the file from 0.5s, while `--info` found nothing at\n   * record 0 and reported a recording starting at zero — the same file described two ways by\n   * one tool. Records are contiguous, so record `i` beginning at `t` puts the origin at\n   * `t - i * duration`, and any one of them settles it.\n   *\n   * The bound is what keeps this cheap: a file whose first `RECORDS_SEARCHED_FOR_ORIGIN`\n   * timekeeping entries are all unreadable reports an origin of zero here, and converting it\n   * raises ANNOTATION_DECODE_FAILED for every one of them.\n   *\n   * Returns null when there is nothing to read it from, in which case the origin is zero.\n   */\n  async readOrigin(): Promise<number | null> {\n    return (await this.scanOrigin()).origin;\n  }\n\n  /**\n   * The origin, and what the search saw on the way to it.\n   *\n   * `--info` takes this route for a continuous recording rather than reading every record,\n   * and reported nothing when the timekeeping it read was unreadable: the count was hard-coded\n   * to zero at the call site, so a file whose first TAL cannot be parsed raised\n   * ANNOTATION_DECODE_FAILED when converted and nothing under `--info`. Its byte-identical\n   * EDF+D twin — same bytes but for the reserved field, which has nothing to do with the\n   * defect — raised it both ways, because that path reads every record and counts as it goes.\n   *\n   * The failure was being read and then thrown away. `readOrigin` keeps its shape for callers\n   * who only want the number.\n   */\n  async scanOrigin(): Promise<{ origin: number | null; malformedTimekeeping: number }> {\n    this.#assertOpen();\n\n    let malformedTimekeeping = 0;\n    const channel = this.timekeepingSignal;\n    if (!channel || this.recordCount === 0) return { origin: null, malformedTimekeeping };\n\n    const { headerBytes, bytesPerSample, recordBytes, recordDuration } = this.header;\n    const buffer = Buffer.alloc(channel.samplesPerRecord * bytesPerSample);\n    if (buffer.length === 0) return { origin: null, malformedTimekeeping };\n\n    const searched = Math.min(this.recordCount, RECORDS_SEARCHED_FOR_ORIGIN);\n    for (let record = 0; record < searched; record++) {\n      const offset = headerBytes + record * recordBytes + channel.byteOffsetInRecord;\n      const bytesRead = await readFully(this.#handle, buffer, 0, buffer.length, offset);\n      if (bytesRead < buffer.length) return { origin: null, malformedTimekeeping };\n\n      const decoded = decodeRecordAnnotations(buffer, record);\n      malformedTimekeeping += decoded.malformedTimekeeping;\n      if (decoded.recordStart !== null) {\n        return { origin: decoded.recordStart - record * recordDuration, malformedTimekeeping };\n      }\n    }\n    return { origin: null, malformedTimekeeping };\n  }\n\n  async readAnnotations(): Promise<{\n    annotations: Annotation[];\n    recordStarts: (number | null)[];\n    malformed: number;\n    /** Unreadable TALs in first position, which carry timing rather than an event. */\n    malformedTimekeeping: number;\n    /** Events kept whose stated duration could not be read; see Annotation.duration. */\n    unreadableDurations: number;\n  }> {\n    this.#assertOpen();\n\n    const annotations: Annotation[] = [];\n    const recordStarts: (number | null)[] = new Array<number | null>(this.recordCount).fill(null);\n    let malformed = 0;\n    let malformedTimekeeping = 0;\n    let unreadableDurations = 0;\n\n    const channels = this.annotationSignals;\n    if (channels.length === 0) {\n      return { annotations, recordStarts, malformed, malformedTimekeeping, unreadableDurations };\n    }\n\n    const { headerBytes, recordBytes, bytesPerSample } = this.header;\n    const buffers = channels.map((c) => Buffer.alloc(c.samplesPerRecord * bytesPerSample));\n    const timekeeping = this.timekeepingSignal;\n\n    for (let record = 0; record < this.recordCount; record++) {\n      for (const [position, channel] of channels.entries()) {\n        const buffer = buffers[position];\n        if (!buffer || buffer.length === 0) continue;\n\n        const offset = headerBytes + record * recordBytes + channel.byteOffsetInRecord;\n        const bytesRead = await readFully(this.#handle, buffer, 0, buffer.length, offset);\n        if (bytesRead < buffer.length) {\n          throw changedWhileReading(record, buffer.length, bytesRead, 'annotation data');\n        }\n\n        // Only the timekeeping channel carries the record's start; see timekeepingSignal.\n        const decoded = decodeRecordAnnotations(buffer, record, channel === timekeeping);\n        if (channel === timekeeping) recordStarts[record] = decoded.recordStart;\n        for (const annotation of decoded.annotations) annotations.push(annotation);\n        malformed += decoded.malformed;\n        malformedTimekeeping += decoded.malformedTimekeeping;\n        unreadableDurations += decoded.unreadableDurations;\n      }\n    }\n\n    annotations.sort((a, b) => a.onset - b.onset || a.recordIndex - b.recordIndex);\n    return { annotations, recordStarts, malformed, malformedTimekeeping, unreadableDurations };\n  }\n\n  async close(): Promise<void> {\n    if (this.#closed) return;\n    this.#closed = true;\n    await this.#handle.close();\n  }\n\n  #assertOpen(): void {\n    if (this.#closed) throw new EdfError('UNREADABLE', 'This EDF file has already been closed.');\n  }\n}\n\nfunction describe(cause: unknown): string {\n  if (cause instanceof Error) {\n    const code = (cause as NodeJS.ErrnoException).code;\n    if (code === 'ENOENT') return 'no such file';\n    if (code === 'EACCES') return 'permission denied';\n    return cause.message;\n  }\n  return String(cause);\n}\n\n/**\n * The most `fs.read` will accept as a length.\n *\n * Node asserts on a length that does not fit in a signed 32-bit integer, and it asserts in\n * C++: `Assertion failed: args[3]->IsInt32()`, forty frames of native stack, SIGABRT. Not an\n * exception — nothing in JavaScript sees it, so no catch block and no `uncaughtException`\n * handler runs, and a library consumer's whole process goes down with it.\n *\n * A round gigabyte rather than the exact limit, so the loop below does whole even reads.\n */\nconst MAX_READ_BYTES = 1024 * 1024 * 1024;\n\n/** Fill a requested region unless EOF is reached; regular-file reads may legally be short. */\nasync function readFully(\n  handle: FileHandle,\n  buffer: Buffer,\n  offset: number,\n  length: number,\n  position: number,\n): Promise<number> {\n  let total = 0;\n  while (total < length) {\n    /*\n      Capped, because one data record can be larger than a single read may be.\n\n      A record is read in one call when it exceeds the chunk budget — there is nothing\n      smaller to divide it by, since a record is the unit the format is addressed in. EDF's\n      samples-per-record field is 8 characters, so eleven channels at 99,999,999 samples make\n      a record of 2.2 GB, and a long record duration at ordinary rates gets there too. That\n      went to `fs.read` as a single length over 2^31-1 and took the process out with a native\n      assertion rather than an error.\n\n      Looping was already how a short read is handled, so the cap costs one more iteration\n      per gigabyte and nothing else.\n    */\n    const want = Math.min(length - total, MAX_READ_BYTES);\n    const { bytesRead } = await handle.read(buffer, offset + total, want, position + total);\n    if (bytesRead === 0) break;\n    total += bytesRead;\n  }\n  return total;\n}\n\nfunction changedWhileReading(\n  record: number,\n  expected: number,\n  actual: number,\n  subject = 'data',\n): EdfError {\n  return new EdfError(\n    'UNREADABLE',\n    `Expected ${expected} bytes of ${subject} at record ${record} but only ${actual} were ` +\n      `available; the file appears to have changed size while it was being read.`,\n    'Make sure the recording is not still being written to, then try again.',\n  );\n}\n"]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "edf2csv",
-  "version": "0.5.53",
+  "version": "0.5.55",
   "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",