@ifc-lite/parser 4.3.2 → 5.0.0

package/dist/scan-entities-balanced.js

@@ -0,0 +1,258 @@
+/* This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at https://mozilla.org/MPL/2.0/. */
+/**
+ * The balanced-parenthesis entity scan: closes a record on the ')' that
+ * balances its argument list, rather than on the terminating ';'.
+ *
+ * Split out of `tokenizer.ts`, which holds the fast semicolon scan
+ * (`StepTokenizer.scanEntitiesFast`). The two share nothing but the
+ * `step-lexing` helpers -- the cursor helpers below (`readExpressId`,
+ * `readTypeName`, `skipTrivia`) exist only for this scan, because the fast one
+ * inlines its equivalents for speed. `StepTokenizer.scanEntities` is the
+ * public entry point and delegates here.
+ */
+import { safeUtf8Decode } from '@ifc-lite/data';
+import { isIndexableExpressId } from './express-id.js';
+import { countNewlines, findEntityLength, opensLiteralOrComment, skipLexical, skipTrivia, } from './step-lexing.js';
+/**
+ * One balanced-parenthesis scan over one buffer.
+ *
+ * The cursor and the refusal count are bound to the scan rather than kept on
+ * `StepTokenizer`, so a second scan cannot read the first one's leftovers.
+ */
+export class BalancedEntityScan {
+    buffer;
+    position = 0;
+    lineNumber = 1;
+    oversizedIds = 0;
+    malformed = 0;
+    constructor(buffer) {
+        this.buffer = buffer;
+    }
+    /** Records this scan refused for an out-of-contract express id (#3395). */
+    get oversizedIdCount() {
+        return this.oversizedIds;
+    }
+    /** Mirrors `StepTokenizer.malformedRecordCount`'s contract: 0 or 1, set by
+     *  the single post-loop check at the end of `run()`. */
+    get malformedRecordCount() {
+        return this.malformed;
+    }
+    /** Every entity declaration (`#EXPRESS_ID = TYPE(...)`) in the buffer. */
+    *run() {
+        this.position = 0;
+        this.lineNumber = 1;
+        this.oversizedIds = 0;
+        this.malformed = 0;
+        // Set on the way to the single post-loop check below: `stopped` for an
+        // unclosed string or comment that ran the scan to end of buffer with
+        // nothing left to find, `declOpen` while a `#id=TYPE(` header is
+        // incomplete. `declOpen` stays armed ONLY when the reason for abandoning
+        // is running out of buffer; a mismatch with buffer still left clears it,
+        // because the scan resumes byte-by-byte from wherever it gave up, and a
+        // `#ref` token inside the abandoned record's own argument list reads as
+        // a fresh, equally incomplete attempt that must not report "cut off"
+        // just because nothing later happens to clear it.
+        let stopped = false;
+        let declOpen = false;
+        while (this.position < this.buffer.length) {
+            // Look for '#' character (entity ID marker)
+            if (this.buffer[this.position] === 0x23) { // '#'
+                const startOffset = this.position;
+                const startLine = this.lineNumber;
+                // Read express ID
+                const expressId = this.readExpressId();
+                if (expressId === null) {
+                    this.position++;
+                    continue;
+                }
+                declOpen = true;
+                // Whitespace AND comments: 10303-21 allows a comment wherever
+                // whitespace is allowed, so `#1 /* was #7 */ =` is a declaration.
+                if (this.skipTrivia()) {
+                    stopped = true;
+                    break;
+                }
+                // Check for '=' (assignment). Not a truncation when buffer is still
+                // left to scan -- clear declOpen so a reference token inside a LATER
+                // abandoned record's argument list (walked byte-by-byte once this
+                // one is given up on) cannot leave it stuck armed with nothing left
+                // to clear it.
+                if (this.position >= this.buffer.length) {
+                    this.position++;
+                    continue;
+                }
+                if (this.buffer[this.position] !== 0x3D) {
+                    declOpen = false;
+                    this.position++;
+                    continue;
+                }
+                this.position++; // Skip '='
+                if (this.skipTrivia()) {
+                    stopped = true;
+                    break;
+                }
+                // Read type name. `readTypeName` returns null both on EOF and on a
+                // bad start byte, and leaves `position` untouched either way, so
+                // check `position` here to tell the two apart the same way the '='
+                // and '(' checks do.
+                const type = this.readTypeName();
+                if (!type) {
+                    if (this.position < this.buffer.length)
+                        declOpen = false;
+                    this.position++;
+                    continue;
+                }
+                if (this.skipTrivia()) {
+                    stopped = true;
+                    break;
+                }
+                // Check for '(' (start of parameters). Same EOF-vs-mismatch split.
+                if (this.position >= this.buffer.length) {
+                    this.position++;
+                    continue;
+                }
+                if (this.buffer[this.position] !== 0x28) {
+                    declOpen = false;
+                    this.position++;
+                    continue;
+                }
+                declOpen = false; // header complete: '(' found
+                // Find matching closing parenthesis to get full entity length
+                const entityLength = findEntityLength(this.buffer, this.position, startOffset);
+                if (entityLength > 0) {
+                    // Step past the whole record, as Rust's next_entity does. Leaving
+                    // `position` at the '(' made this loop re-walk the body, which was
+                    // harmless only while it ignored quotes and comments.
+                    //
+                    // Count from `position`, not from `startOffset`: `position` is on the
+                    // '(' here, and every newline before it was already counted by the
+                    // three skipTrivia calls above. Counting the whole record instead
+                    // double-counts a newline written between `#1=` and its type name,
+                    // which is ordinary whitespace and legal.
+                    this.lineNumber += countNewlines(this.buffer, this.position, startOffset + entityLength);
+                    this.position = startOffset + entityLength;
+                    yield {
+                        expressId,
+                        type,
+                        offset: startOffset,
+                        length: entityLength,
+                        line: startLine,
+                    };
+                }
+                else {
+                    // 0 means findEntityLength ran off the end of the buffer without
+                    // ever balancing the '(' -- an unterminated literal or comment
+                    // inside the argument list, or no closing ')' at all. Its own loop
+                    // has no other exit, so this is always the EOF case, never a
+                    // mid-file syntax choice to resume past.
+                    stopped = true;
+                    break;
+                }
+            }
+            else if (this.buffer[this.position] === 0x0A) {
+                // Newline
+                this.lineNumber++;
+                this.position++;
+            }
+            else if (opensLiteralOrComment(this.buffer, this.position, this.buffer.length)) {
+                // A commented-out record satisfies every check above, so a comment has
+                // to be skipped as a region; a literal has to be skipped so its
+                // contents cannot look like one. See step-lexing.
+                const skip = skipLexical(this.buffer, this.position, this.buffer.length);
+                this.lineNumber += skip.lines;
+                this.position = skip.next;
+                if (skip.stop) {
+                    stopped = true;
+                    break;
+                }
+            }
+            else {
+                this.position++;
+            }
+        }
+        // ONE post-loop check, not an increment at every exit site above: the
+        // scan stopped early if it hit an explicit "no terminator" boundary, or
+        // the last `#id=TYPE(` header was cut short before its '(' was found.
+        // Always 0 or 1 -- the scan stops at the first one, so there is nothing
+        // to accumulate past that.
+        if (stopped || declOpen)
+            this.malformed = 1;
+    }
+    readExpressId() {
+        let id = 0;
+        let digits = 0;
+        let pos = this.position + 1; // Skip '#'
+        while (pos < this.buffer.length) {
+            const char = this.buffer[pos];
+            if (char >= 0x30 && char <= 0x39) { // '0'-'9'
+                id = id * 10 + (char - 0x30);
+                digits++;
+                pos++;
+            }
+            else {
+                break;
+            }
+        }
+        if (digits === 0)
+            return null;
+        // Same storage contract as scanEntitiesFast; see express-id.ts (#3395).
+        // And the same rule about WHICH refusals count: only a declaration,
+        // `#<trivia>=`. This scan resumes one byte into a refused record and
+        // walks its argument list, so an oversized `#ref` in there reaches this
+        // method too. Look ahead rather than consume — `position` must stay where
+        // the caller's recovery expects it.
+        if (!isIndexableExpressId(id)) {
+            // Trivia, not just whitespace, so this probe recognises exactly the
+            // declarations the accept path above does. Skipping only whitespace here
+            // would let `#4294967297 /* n */ =` be dropped without being counted.
+            const probe = skipTrivia(this.buffer, pos, this.buffer.length).next;
+            if (probe < this.buffer.length && this.buffer[probe] === 0x3D)
+                this.oversizedIds++;
+            return null;
+        }
+        this.position = pos;
+        return id;
+    }
+    readTypeName() {
+        const start = this.position;
+        let end = start;
+        // Type names start with uppercase letter
+        if (this.position >= this.buffer.length || this.buffer[this.position] < 0x41 || this.buffer[this.position] > 0x5A) {
+            return null;
+        }
+        while (end < this.buffer.length) {
+            const char = this.buffer[end];
+            // Allow letters, numbers, and underscore
+            if ((char >= 0x41 && char <= 0x5A) || // A-Z
+                (char >= 0x61 && char <= 0x7A) || // a-z
+                (char >= 0x30 && char <= 0x39) || // 0-9
+                char === 0x5F // _
+            ) {
+                end++;
+            }
+            else {
+                break;
+            }
+        }
+        if (end === start)
+            return null;
+        const typeName = safeUtf8Decode(this.buffer, start, end);
+        this.position = end;
+        return typeName;
+    }
+    /**
+     * Advance past whitespace and comments (see `skipTrivia` in step-lexing).
+     * Returns true when the comment it was in never closed, so the caller's
+     * single post-loop check can count it instead of reading a false '0' from
+     * a scan that actually ran out of buffer mid-header.
+     */
+    skipTrivia() {
+        const skip = skipTrivia(this.buffer, this.position, this.buffer.length);
+        this.lineNumber += skip.lines;
+        this.position = skip.next;
+        return skip.stop;
+    }
+}
+//# sourceMappingURL=scan-entities-balanced.js.map

package/dist/scan-entities-balanced.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scan-entities-balanced.js","sourceRoot":"","sources":["../src/scan-entities-balanced.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAE/D;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAEhD,OAAO,EAAE,oBAAoB,EAAE,MAAM,iBAAiB,CAAC;AACvD,OAAO,EACL,aAAa,EACb,gBAAgB,EAChB,qBAAqB,EACrB,WAAW,EACX,UAAU,GACX,MAAM,kBAAkB,CAAC;AAU1B;;;;;GAKG;AACH,MAAM,OAAO,kBAAkB;IAMA;IALrB,QAAQ,GAAG,CAAC,CAAC;IACb,UAAU,GAAG,CAAC,CAAC;IACf,YAAY,GAAG,CAAC,CAAC;IACjB,SAAS,GAAG,CAAC,CAAC;IAEtB,YAA6B,MAAkB;QAAlB,WAAM,GAAN,MAAM,CAAY;IAAG,CAAC;IAEnD,2EAA2E;IAC3E,IAAI,gBAAgB;QAClB,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAED;4DACwD;IACxD,IAAI,oBAAoB;QACtB,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED,0EAA0E;IAC1E,CAAC,GAAG;QACF,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;QAClB,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;QACpB,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QAEnB,uEAAuE;QACvE,qEAAqE;QACrE,iEAAiE;QACjE,yEAAyE;QACzE,yEAAyE;QACzE,wEAAwE;QACxE,wEAAwE;QACxE,qEAAqE;QACrE,kDAAkD;QAClD,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,IAAI,QAAQ,GAAG,KAAK,CAAC;QAErB,OAAO,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;YAC1C,4CAA4C;YAC5C,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,MAAM;gBAC/C,MAAM,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC;gBAClC,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC;gBAElC,kBAAkB;gBAClB,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;gBACvC,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;oBACvB,IAAI,CAAC,QAAQ,EAAE,CAAC;oBAChB,SAAS;gBACX,CAAC;gBACD,QAAQ,GAAG,IAAI,CAAC;gBAEhB,8DAA8D;gBAC9D,kEAAkE;gBAClE,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE,CAAC;oBAAC,OAAO,GAAG,IAAI,CAAC;oBAAC,MAAM;gBAAC,CAAC;gBAEjD,oEAAoE;gBACpE,qEAAqE;gBACrE,kEAAkE;gBAClE,oEAAoE;gBACpE,eAAe;gBACf,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;oBACxC,IAAI,CAAC,QAAQ,EAAE,CAAC;oBAChB,SAAS;gBACX,CAAC;gBACD,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,IAAI,EAAE,CAAC;oBACxC,QAAQ,GAAG,KAAK,CAAC;oBACjB,IAAI,CAAC,QAAQ,EAAE,CAAC;oBAChB,SAAS;gBACX,CAAC;gBACD,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,WAAW;gBAE5B,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE,CAAC;oBAAC,OAAO,GAAG,IAAI,CAAC;oBAAC,MAAM;gBAAC,CAAC;gBAEjD,mEAAmE;gBACnE,iEAAiE;gBACjE,mEAAmE;gBACnE,qBAAqB;gBACrB,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;gBACjC,IAAI,CAAC,IAAI,EAAE,CAAC;oBACV,IAAI,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM;wBAAE,QAAQ,GAAG,KAAK,CAAC;oBACzD,IAAI,CAAC,QAAQ,EAAE,CAAC;oBAChB,SAAS;gBACX,CAAC;gBAED,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE,CAAC;oBAAC,OAAO,GAAG,IAAI,CAAC;oBAAC,MAAM;gBAAC,CAAC;gBAEjD,mEAAmE;gBACnE,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;oBACxC,IAAI,CAAC,QAAQ,EAAE,CAAC;oBAChB,SAAS;gBACX,CAAC;gBACD,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,IAAI,EAAE,CAAC;oBACxC,QAAQ,GAAG,KAAK,CAAC;oBACjB,IAAI,CAAC,QAAQ,EAAE,CAAC;oBAChB,SAAS;gBACX,CAAC;gBACD,QAAQ,GAAG,KAAK,CAAC,CAAC,6BAA6B;gBAE/C,8DAA8D;gBAC9D,MAAM,YAAY,GAAG,gBAAgB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;gBAC/E,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;oBACrB,kEAAkE;oBAClE,mEAAmE;oBACnE,sDAAsD;oBACtD,EAAE;oBACF,sEAAsE;oBACtE,mEAAmE;oBACnE,kEAAkE;oBAClE,mEAAmE;oBACnE,0CAA0C;oBAC1C,IAAI,CAAC,UAAU,IAAI,aAAa,CAC9B,IAAI,CAAC,MAAM,EACX,IAAI,CAAC,QAAQ,EACb,WAAW,GAAG,YAAY,CAC3B,CAAC;oBACF,IAAI,CAAC,QAAQ,GAAG,WAAW,GAAG,YAAY,CAAC;oBAC3C,MAAM;wBACJ,SAAS;wBACT,IAAI;wBACJ,MAAM,EAAE,WAAW;wBACnB,MAAM,EAAE,YAAY;wBACpB,IAAI,EAAE,SAAS;qBAChB,CAAC;gBACJ,CAAC;qBAAM,CAAC;oBACN,iEAAiE;oBACjE,+DAA+D;oBAC/D,mEAAmE;oBACnE,6DAA6D;oBAC7D,yCAAyC;oBACzC,OAAO,GAAG,IAAI,CAAC;oBACf,MAAM;gBACR,CAAC;YACH,CAAC;iBAAM,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,IAAI,EAAE,CAAC;gBAC/C,UAAU;gBACV,IAAI,CAAC,UAAU,EAAE,CAAC;gBAClB,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,CAAC;iBAAM,IAAI,qBAAqB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;gBACjF,uEAAuE;gBACvE,gEAAgE;gBAChE,kDAAkD;gBAClD,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;gBACzE,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,KAAK,CAAC;gBAC9B,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC;gBAC1B,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;oBAAC,OAAO,GAAG,IAAI,CAAC;oBAAC,MAAM;gBAAC,CAAC;YAC3C,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,CAAC;QACH,CAAC;QAED,sEAAsE;QACtE,wEAAwE;QACxE,sEAAsE;QACtE,wEAAwE;QACxE,2BAA2B;QAC3B,IAAI,OAAO,IAAI,QAAQ;YAAE,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IAC9C,CAAC;IAEO,aAAa;QACnB,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,GAAG,GAAG,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,WAAW;QAExC,OAAO,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;YAChC,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAC9B,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC,CAAC,UAAU;gBAC5C,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC;gBAC7B,MAAM,EAAE,CAAC;gBACT,GAAG,EAAE,CAAC;YACR,CAAC;iBAAM,CAAC;gBACN,MAAM;YACR,CAAC;QACH,CAAC;QAED,IAAI,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAC9B,wEAAwE;QACxE,oEAAoE;QACpE,qEAAqE;QACrE,wEAAwE;QACxE,0EAA0E;QAC1E,oCAAoC;QACpC,IAAI,CAAC,oBAAoB,CAAC,EAAE,CAAC,EAAE,CAAC;YAC9B,oEAAoE;YACpE,yEAAyE;YACzE,sEAAsE;YACtE,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC;YACpE,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,IAAI;gBAAE,IAAI,CAAC,YAAY,EAAE,CAAC;YACnF,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,CAAC,QAAQ,GAAG,GAAG,CAAC;QACpB,OAAO,EAAE,CAAC;IACZ,CAAC;IAEO,YAAY;QAClB,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC5B,IAAI,GAAG,GAAG,KAAK,CAAC;QAEhB,yCAAyC;QACzC,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,IAAI,EAAE,CAAC;YAClH,OAAO,IAAI,CAAC;QACd,CAAC;QAED,OAAO,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;YAChC,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAC9B,yCAAyC;YACzC,IACE,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI,MAAM;gBACxC,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI,MAAM;gBACxC,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI,MAAM;gBACxC,IAAI,KAAK,IAAI,CAAC,IAAI;cAClB,CAAC;gBACD,GAAG,EAAE,CAAC;YACR,CAAC;iBAAM,CAAC;gBACN,MAAM;YACR,CAAC;QACH,CAAC;QAED,IAAI,GAAG,KAAK,KAAK;YAAE,OAAO,IAAI,CAAC;QAE/B,MAAM,QAAQ,GAAG,cAAc,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;QACzD,IAAI,CAAC,QAAQ,GAAG,GAAG,CAAC;QACpB,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;;;OAKG;IACK,UAAU;QAChB,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACxE,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,KAAK,CAAC;QAC9B,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC;QAC1B,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;CACF"}

package/dist/scan-worker-inline.d.ts

@@ -2,9 +2,10 @@
  * Inline Web Worker for IFC entity scanning.
  *
  * Moves the 7-8s entity scanning off the main thread so geometry streaming
- * and UI remain responsive. The scanning logic is embedded as a string to
- * avoid bundler/import issues with Web Workers.
+ * and UI remain responsive. The scanning logic is embedded as a string (see
+ * `scan-worker-source.ts`) to avoid bundler/import issues with Web Workers.
  */
+import { WORKER_CODE } from './scan-worker-source.js';
 export interface EntityRefWorkerResult {
     expressId: number;
     type: string;
@@ -12,18 +13,23 @@ export interface EntityRefWorkerResult {
     byteLength: number;
     lineNumber: number;
 }
-/**
- * Self-contained entity scanner code (runs inside Web Worker).
- * This is the same algorithm as StepTokenizer.scanEntitiesFast() but
- * written as a standalone function for worker embedding.
- */
-/** Exported for direct testing (run inside a mock `self`); the runtime path
- *  wraps it in a Blob worker via {@link getWorkerBlobUrl}. */
-export declare const WORKER_CODE = "\n'use strict';\nself.onmessage = function(e) {\n  var buf = new Uint8Array(e.data);\n  var len = buf.length;\n  var pos = 0;\n  var line = 1;\n\n  // Pre-allocate result array (estimate ~13,500 entities per MB)\n  var estimatedCount = Math.max((len / 1024 / 1024) * 13500, 1000) | 0;\n  // Pack results into typed arrays for fast transfer\n  var ids = new Uint32Array(estimatedCount);\n  var offsets = new Uint32Array(estimatedCount);\n  var lengths = new Uint32Array(estimatedCount);\n  var lines = new Uint32Array(estimatedCount);\n  // Type names stored separately (strings)\n  var types = new Array(estimatedCount);\n  var count = 0;\n\n  // Type name cache (IFC files have ~776 unique types across millions of entities)\n  var typeCache = new Map();\n\n  function growArrays() {\n    var newSize = (count * 2) | 0;\n    var newIds = new Uint32Array(newSize);\n    newIds.set(ids);\n    ids = newIds;\n    var newOffsets = new Uint32Array(newSize);\n    newOffsets.set(offsets);\n    offsets = newOffsets;\n    var newLengths = new Uint32Array(newSize);\n    newLengths.set(lengths);\n    lengths = newLengths;\n    var newLines = new Uint32Array(newSize);\n    newLines.set(lines);\n    lines = newLines;\n    types.length = newSize;\n  }\n\n  while (pos < len) {\n    var ch = buf[pos];\n\n    if (ch === 0x23) { // '#'\n      var startOffset = pos;\n      var startLine = line;\n      pos++;\n\n      // Read express ID\n      var expressId = 0;\n      var hasDigits = false;\n      while (pos < len) {\n        var c = buf[pos];\n        if (c >= 0x30 && c <= 0x39) {\n          expressId = expressId * 10 + (c - 0x30);\n          hasDigits = true;\n          pos++;\n        } else {\n          break;\n        }\n      }\n      if (!hasDigits) continue;\n\n      // Skip whitespace\n      while (pos < len) {\n        var c2 = buf[pos];\n        if (c2 === 0x20 || c2 === 0x09 || c2 === 0x0D) { pos++; }\n        else if (c2 === 0x0A) { line++; pos++; }\n        else break;\n      }\n\n      // Check for '='\n      if (pos >= len || buf[pos] !== 0x3D) continue;\n      pos++;\n\n      // Skip whitespace\n      while (pos < len) {\n        var c3 = buf[pos];\n        if (c3 === 0x20 || c3 === 0x09 || c3 === 0x0D) { pos++; }\n        else if (c3 === 0x0A) { line++; pos++; }\n        else break;\n      }\n\n      // Read type name\n      var typeStart = pos;\n      if (pos >= len || buf[pos] < 0x41 || buf[pos] > 0x5A) continue;\n\n      while (pos < len) {\n        var c4 = buf[pos];\n        if ((c4 >= 0x41 && c4 <= 0x5A) || (c4 >= 0x61 && c4 <= 0x7A) ||\n            (c4 >= 0x30 && c4 <= 0x39) || c4 === 0x5F) {\n          pos++;\n        } else {\n          break;\n        }\n      }\n      if (pos === typeStart) continue;\n\n      // Cache type name \u2014 use length + hash compound key and verify the actual\n      // bytes on a hit. Length alone can't disambiguate a 32-bit hash collision\n      // (e.g. \"Aa\"/\"BB\"), so without the byte compare a crafted/unlucky file\n      // could have one type silently misread as another. Mirrors tokenizer.ts.\n      var typeLen = pos - typeStart;\n      var typeHash = typeLen;\n      for (var i = typeStart; i < pos; i++) {\n        typeHash = (typeHash * 31 + buf[i]) | 0;\n      }\n      var cacheKey = typeLen + ':' + typeHash;\n      var typeName = typeCache.get(cacheKey);\n      var cacheHitMatches = false;\n      if (typeName !== undefined && typeName.length === typeLen) {\n        cacheHitMatches = true;\n        for (var v = 0; v < typeLen; v++) {\n          if (typeName.charCodeAt(v) !== buf[typeStart + v]) {\n            cacheHitMatches = false;\n            break;\n          }\n        }\n      }\n      if (typeName === undefined || !cacheHitMatches) {\n        typeName = String.fromCharCode.apply(null, buf.subarray(typeStart, pos));\n        typeCache.set(cacheKey, typeName);\n      }\n\n      // Skip whitespace\n      while (pos < len) {\n        var c5 = buf[pos];\n        if (c5 === 0x20 || c5 === 0x09 || c5 === 0x0D) { pos++; }\n        else if (c5 === 0x0A) { line++; pos++; }\n        else break;\n      }\n\n      // Check for '('\n      if (pos >= len || buf[pos] !== 0x28) continue;\n\n      // Skip to semicolon (handling strings)\n      var inString = false;\n      while (pos < len) {\n        var c6 = buf[pos];\n        if (c6 === 0x27) { // quote\n          if (inString && pos + 1 < len && buf[pos + 1] === 0x27) {\n            pos += 2;\n            continue;\n          }\n          inString = !inString;\n        } else if (c6 === 0x3B && !inString) { // semicolon\n          var entityLength = pos - startOffset + 1;\n\n          // Grow if needed\n          if (count >= ids.length) growArrays();\n\n          ids[count] = expressId;\n          offsets[count] = startOffset;\n          lengths[count] = entityLength;\n          lines[count] = startLine;\n          types[count] = typeName;\n          count++;\n\n          pos++;\n          break;\n        } else if (c6 === 0x0A) {\n          line++;\n        }\n        pos++;\n      }\n    } else if (ch === 0x0A) {\n      line++;\n      pos++;\n    } else if (ch === 0x27) { // quote\n      // Consume a string literal whole. HEADER records carry no '#', so this\n      // loop walks them byte by byte, and a '/*' inside a description would\n      // otherwise open a comment that never closes and take DATA with it.\n      var sp = pos + 1;\n      while (sp < len) {\n        if (buf[sp] === 0x27) {\n          if (sp + 1 < len && buf[sp + 1] === 0x27) { sp += 2; continue; }\n          sp++;\n          break;\n        }\n        if (buf[sp] === 0x0A) { line++; }\n        sp++;\n      }\n      pos = sp;\n    } else if (ch === 0x2F && pos + 1 < len && buf[pos + 1] === 0x2A) {\n      // Skip a /* */ region. A record that is commented out is still a\n      // well-formed #id = TYPE(...), so every check above accepts it and only\n      // skipping the region rejects it. Kept byte-identical to\n      // step-lexing.ts, which this cannot import: the worker source is a\n      // string, so the third copy of this loop has to carry its own copy of\n      // the rule. Comments do not nest, per ISO 10303-21.\n      var cp = pos + 2;\n      var closed = false;\n      while (cp + 1 < len) {\n        if (buf[cp] === 0x2A && buf[cp + 1] === 0x2F) { closed = true; break; }\n        if (buf[cp] === 0x0A) { line++; }\n        cp++;\n      }\n      if (!closed) {\n        // Unterminated: everything to EOF is commented out.\n        pos = len;\n        break;\n      }\n      pos = cp + 2;\n    } else {\n      pos++;\n    }\n  }\n\n  // Trim arrays once, reuse for both message and transfer list\n  var needsTrim = ids.buffer.byteLength > count * 4;\n  var trimmedIds = needsTrim ? ids.slice(0, count) : ids;\n  var trimmedOffsets = needsTrim ? offsets.slice(0, count) : offsets;\n  var trimmedLengths = needsTrim ? lengths.slice(0, count) : lengths;\n  var trimmedLines = needsTrim ? lines.slice(0, count) : lines;\n  self.postMessage({\n    ids: trimmedIds.buffer,\n    offsets: trimmedOffsets.buffer,\n    lengths: trimmedLengths.buffer,\n    lines: trimmedLines.buffer,\n    types: types.slice(0, count),\n    count: count,\n  }, [\n    trimmedIds.buffer,\n    trimmedOffsets.buffer,\n    trimmedLengths.buffer,\n    trimmedLines.buffer,\n  ]);\n};\n";
+/** What one worker scan produced: the records it accepted, and how many it
+ *  refused for an out-of-contract express id (#3395). The second half is not
+ *  decoration — a guard that acts without reporting turns a corrupted index
+ *  into a silently short one, which reads exactly like success. */
+export interface EntityScanWorkerResult {
+    refs: EntityRefWorkerResult[];
+    oversizedIdCount: number;
+    /** See {@link StepTokenizer.malformedRecordCount} in tokenizer.ts — same
+     *  condition, same recovery, counted by this worker's own copy of the
+     *  scan loop. */
+    malformedRecordCount: number;
+}
+export { WORKER_CODE };
 /**
  * Scan IFC entities in a Web Worker (non-blocking).
  * Sends a structured clone of the buffer to the worker (browser handles copy).
  * Caller keeps the original buffer intact for columnar parsing.
  */
-export declare function scanEntitiesInWorker(buffer: ArrayBuffer | SharedArrayBuffer): Promise<EntityRefWorkerResult[]>;
+export declare function scanEntitiesInWorker(buffer: ArrayBuffer | SharedArrayBuffer): Promise<EntityScanWorkerResult>;
 //# sourceMappingURL=scan-worker-inline.d.ts.map

package/dist/scan-worker-inline.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"scan-worker-inline.d.ts","sourceRoot":"","sources":["../src/scan-worker-inline.ts"],"names":[],"mappings":"AAIA;;;;;;GAMG;AAEH,MAAM,WAAW,qBAAqB;IACpC,SAAS,EAAE,MAAM,CAAC;IAClB,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED;;;;GAIG;AACH;8DAC8D;AAC9D,eAAO,MAAM,WAAW,uqOAmOvB,CAAC;AAYF;;;;GAIG;AACH,wBAAgB,oBAAoB,CAClC,MAAM,EAAE,WAAW,GAAG,iBAAiB,GACtC,OAAO,CAAC,qBAAqB,EAAE,CAAC,CAsDlC"}
+{"version":3,"file":"scan-worker-inline.d.ts","sourceRoot":"","sources":["../src/scan-worker-inline.ts"],"names":[],"mappings":"AAIA;;;;;;GAMG;AAEH,OAAO,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AAEtD,MAAM,WAAW,qBAAqB;IACpC,SAAS,EAAE,MAAM,CAAC;IAClB,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED;;;mEAGmE;AACnE,MAAM,WAAW,sBAAsB;IACrC,IAAI,EAAE,qBAAqB,EAAE,CAAC;IAC9B,gBAAgB,EAAE,MAAM,CAAC;IACzB;;qBAEiB;IACjB,oBAAoB,EAAE,MAAM,CAAC;CAC9B;AAED,OAAO,EAAE,WAAW,EAAE,CAAC;AAYvB;;;;GAIG;AACH,wBAAgB,oBAAoB,CAClC,MAAM,EAAE,WAAW,GAAG,iBAAiB,GACtC,OAAO,CAAC,sBAAsB,CAAC,CAsDjC"}

package/dist/scan-worker-inline.js

@@ -2,240 +2,14 @@
  * License, v. 2.0. If a copy of the MPL was not distributed with this
  * file, You can obtain one at https://mozilla.org/MPL/2.0/. */
 /**
- * Self-contained entity scanner code (runs inside Web Worker).
- * This is the same algorithm as StepTokenizer.scanEntitiesFast() but
- * written as a standalone function for worker embedding.
+ * Inline Web Worker for IFC entity scanning.
+ *
+ * Moves the 7-8s entity scanning off the main thread so geometry streaming
+ * and UI remain responsive. The scanning logic is embedded as a string (see
+ * `scan-worker-source.ts`) to avoid bundler/import issues with Web Workers.
  */
-/** Exported for direct testing (run inside a mock `self`); the runtime path
- *  wraps it in a Blob worker via {@link getWorkerBlobUrl}. */
-export const WORKER_CODE = `
-'use strict';
-self.onmessage = function(e) {
-  var buf = new Uint8Array(e.data);
-  var len = buf.length;
-  var pos = 0;
-  var line = 1;
-
-  // Pre-allocate result array (estimate ~13,500 entities per MB)
-  var estimatedCount = Math.max((len / 1024 / 1024) * 13500, 1000) | 0;
-  // Pack results into typed arrays for fast transfer
-  var ids = new Uint32Array(estimatedCount);
-  var offsets = new Uint32Array(estimatedCount);
-  var lengths = new Uint32Array(estimatedCount);
-  var lines = new Uint32Array(estimatedCount);
-  // Type names stored separately (strings)
-  var types = new Array(estimatedCount);
-  var count = 0;
-
-  // Type name cache (IFC files have ~776 unique types across millions of entities)
-  var typeCache = new Map();
-
-  function growArrays() {
-    var newSize = (count * 2) | 0;
-    var newIds = new Uint32Array(newSize);
-    newIds.set(ids);
-    ids = newIds;
-    var newOffsets = new Uint32Array(newSize);
-    newOffsets.set(offsets);
-    offsets = newOffsets;
-    var newLengths = new Uint32Array(newSize);
-    newLengths.set(lengths);
-    lengths = newLengths;
-    var newLines = new Uint32Array(newSize);
-    newLines.set(lines);
-    lines = newLines;
-    types.length = newSize;
-  }
-
-  while (pos < len) {
-    var ch = buf[pos];
-
-    if (ch === 0x23) { // '#'
-      var startOffset = pos;
-      var startLine = line;
-      pos++;
-
-      // Read express ID
-      var expressId = 0;
-      var hasDigits = false;
-      while (pos < len) {
-        var c = buf[pos];
-        if (c >= 0x30 && c <= 0x39) {
-          expressId = expressId * 10 + (c - 0x30);
-          hasDigits = true;
-          pos++;
-        } else {
-          break;
-        }
-      }
-      if (!hasDigits) continue;
-
-      // Skip whitespace
-      while (pos < len) {
-        var c2 = buf[pos];
-        if (c2 === 0x20 || c2 === 0x09 || c2 === 0x0D) { pos++; }
-        else if (c2 === 0x0A) { line++; pos++; }
-        else break;
-      }
-
-      // Check for '='
-      if (pos >= len || buf[pos] !== 0x3D) continue;
-      pos++;
-
-      // Skip whitespace
-      while (pos < len) {
-        var c3 = buf[pos];
-        if (c3 === 0x20 || c3 === 0x09 || c3 === 0x0D) { pos++; }
-        else if (c3 === 0x0A) { line++; pos++; }
-        else break;
-      }
-
-      // Read type name
-      var typeStart = pos;
-      if (pos >= len || buf[pos] < 0x41 || buf[pos] > 0x5A) continue;
-
-      while (pos < len) {
-        var c4 = buf[pos];
-        if ((c4 >= 0x41 && c4 <= 0x5A) || (c4 >= 0x61 && c4 <= 0x7A) ||
-            (c4 >= 0x30 && c4 <= 0x39) || c4 === 0x5F) {
-          pos++;
-        } else {
-          break;
-        }
-      }
-      if (pos === typeStart) continue;
-
-      // Cache type name — use length + hash compound key and verify the actual
-      // bytes on a hit. Length alone can't disambiguate a 32-bit hash collision
-      // (e.g. "Aa"/"BB"), so without the byte compare a crafted/unlucky file
-      // could have one type silently misread as another. Mirrors tokenizer.ts.
-      var typeLen = pos - typeStart;
-      var typeHash = typeLen;
-      for (var i = typeStart; i < pos; i++) {
-        typeHash = (typeHash * 31 + buf[i]) | 0;
-      }
-      var cacheKey = typeLen + ':' + typeHash;
-      var typeName = typeCache.get(cacheKey);
-      var cacheHitMatches = false;
-      if (typeName !== undefined && typeName.length === typeLen) {
-        cacheHitMatches = true;
-        for (var v = 0; v < typeLen; v++) {
-          if (typeName.charCodeAt(v) !== buf[typeStart + v]) {
-            cacheHitMatches = false;
-            break;
-          }
-        }
-      }
-      if (typeName === undefined || !cacheHitMatches) {
-        typeName = String.fromCharCode.apply(null, buf.subarray(typeStart, pos));
-        typeCache.set(cacheKey, typeName);
-      }
-
-      // Skip whitespace
-      while (pos < len) {
-        var c5 = buf[pos];
-        if (c5 === 0x20 || c5 === 0x09 || c5 === 0x0D) { pos++; }
-        else if (c5 === 0x0A) { line++; pos++; }
-        else break;
-      }
-
-      // Check for '('
-      if (pos >= len || buf[pos] !== 0x28) continue;
-
-      // Skip to semicolon (handling strings)
-      var inString = false;
-      while (pos < len) {
-        var c6 = buf[pos];
-        if (c6 === 0x27) { // quote
-          if (inString && pos + 1 < len && buf[pos + 1] === 0x27) {
-            pos += 2;
-            continue;
-          }
-          inString = !inString;
-        } else if (c6 === 0x3B && !inString) { // semicolon
-          var entityLength = pos - startOffset + 1;
-
-          // Grow if needed
-          if (count >= ids.length) growArrays();
-
-          ids[count] = expressId;
-          offsets[count] = startOffset;
-          lengths[count] = entityLength;
-          lines[count] = startLine;
-          types[count] = typeName;
-          count++;
-
-          pos++;
-          break;
-        } else if (c6 === 0x0A) {
-          line++;
-        }
-        pos++;
-      }
-    } else if (ch === 0x0A) {
-      line++;
-      pos++;
-    } else if (ch === 0x27) { // quote
-      // Consume a string literal whole. HEADER records carry no '#', so this
-      // loop walks them byte by byte, and a '/*' inside a description would
-      // otherwise open a comment that never closes and take DATA with it.
-      var sp = pos + 1;
-      while (sp < len) {
-        if (buf[sp] === 0x27) {
-          if (sp + 1 < len && buf[sp + 1] === 0x27) { sp += 2; continue; }
-          sp++;
-          break;
-        }
-        if (buf[sp] === 0x0A) { line++; }
-        sp++;
-      }
-      pos = sp;
-    } else if (ch === 0x2F && pos + 1 < len && buf[pos + 1] === 0x2A) {
-      // Skip a /* */ region. A record that is commented out is still a
-      // well-formed #id = TYPE(...), so every check above accepts it and only
-      // skipping the region rejects it. Kept byte-identical to
-      // step-lexing.ts, which this cannot import: the worker source is a
-      // string, so the third copy of this loop has to carry its own copy of
-      // the rule. Comments do not nest, per ISO 10303-21.
-      var cp = pos + 2;
-      var closed = false;
-      while (cp + 1 < len) {
-        if (buf[cp] === 0x2A && buf[cp + 1] === 0x2F) { closed = true; break; }
-        if (buf[cp] === 0x0A) { line++; }
-        cp++;
-      }
-      if (!closed) {
-        // Unterminated: everything to EOF is commented out.
-        pos = len;
-        break;
-      }
-      pos = cp + 2;
-    } else {
-      pos++;
-    }
-  }
-
-  // Trim arrays once, reuse for both message and transfer list
-  var needsTrim = ids.buffer.byteLength > count * 4;
-  var trimmedIds = needsTrim ? ids.slice(0, count) : ids;
-  var trimmedOffsets = needsTrim ? offsets.slice(0, count) : offsets;
-  var trimmedLengths = needsTrim ? lengths.slice(0, count) : lengths;
-  var trimmedLines = needsTrim ? lines.slice(0, count) : lines;
-  self.postMessage({
-    ids: trimmedIds.buffer,
-    offsets: trimmedOffsets.buffer,
-    lengths: trimmedLengths.buffer,
-    lines: trimmedLines.buffer,
-    types: types.slice(0, count),
-    count: count,
-  }, [
-    trimmedIds.buffer,
-    trimmedOffsets.buffer,
-    trimmedLengths.buffer,
-    trimmedLines.buffer,
-  ]);
-};
-`;
+import { WORKER_CODE } from './scan-worker-source.js';
+export { WORKER_CODE };
 let workerBlobUrl = null;
 function getWorkerBlobUrl() {
     if (!workerBlobUrl) {
@@ -268,7 +42,7 @@ export function scanEntitiesInWorker(buffer) {
             // checker.
             const activeWorker = worker;
             activeWorker.onmessage = (e) => {
-                const { ids, offsets, lengths, lines, types, count } = e.data;
+                const { ids, offsets, lengths, lines, types, count, oversizedIds, malformedRecords } = e.data;
                 const idArr = new Uint32Array(ids);
                 const offsetArr = new Uint32Array(offsets);
                 const lengthArr = new Uint32Array(lengths);
@@ -284,7 +58,7 @@ export function scanEntitiesInWorker(buffer) {
                     };
                 }
                 activeWorker.terminate();
-                resolve(refs);
+                resolve({ refs, oversizedIdCount: oversizedIds, malformedRecordCount: malformedRecords ?? 0 });
             };
             activeWorker.onerror = (e) => {
                 activeWorker.terminate();

package/dist/scan-worker-inline.js.map

@@ -1 +1 @@
-{"version":3,"file":"scan-worker-inline.js","sourceRoot":"","sources":["../src/scan-worker-inline.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAkB/D;;;;GAIG;AACH;8DAC8D;AAC9D,MAAM,CAAC,MAAM,WAAW,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAmO1B,CAAC;AAEF,IAAI,aAAa,GAAkB,IAAI,CAAC;AAExC,SAAS,gBAAgB;IACvB,IAAI,CAAC,aAAa,EAAE,CAAC;QACnB,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,IAAI,EAAE,wBAAwB,EAAE,CAAC,CAAC;QACzE,aAAa,GAAG,GAAG,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;IAC5C,CAAC;IACD,OAAO,aAAa,CAAC;AACvB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,oBAAoB,CAClC,MAAuC;IAEvC,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;QACrC,wEAAwE;QACxE,wEAAwE;QACxE,wEAAwE;QACxE,uEAAuE;QACvE,mEAAmE;QACnE,6DAA6D;QAC7D,IAAI,MAA0B,CAAC;QAC/B,IAAI,CAAC;YACH,MAAM,GAAG,IAAI,MAAM,CAAC,gBAAgB,EAAE,CAAC,CAAC;YACxC,oEAAoE;YACpE,+DAA+D;YAC/D,oEAAoE;YACpE,qEAAqE;YACrE,mEAAmE;YACnE,WAAW;YACX,MAAM,YAAY,GAAG,MAAM,CAAC;YAE5B,YAAY,CAAC,SAAS,GAAG,CAAC,CAAe,EAAE,EAAE;gBAC3C,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC;gBAC9D,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,GAAG,CAAC,CAAC;gBACnC,MAAM,SAAS,GAAG,IAAI,WAAW,CAAC,OAAO,CAAC,CAAC;gBAC3C,MAAM,SAAS,GAAG,IAAI,WAAW,CAAC,OAAO,CAAC,CAAC;gBAC3C,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC;gBAEvC,MAAM,IAAI,GAA4B,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC;gBACvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC/B,IAAI,CAAC,CAAC,CAAC,GAAG;wBACR,SAAS,EAAE,KAAK,CAAC,CAAC,CAAC;wBACnB,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;wBACd,UAAU,EAAE,SAAS,CAAC,CAAC,CAAC;wBACxB,UAAU,EAAE,SAAS,CAAC,CAAC,CAAC;wBACxB,UAAU,EAAE,OAAO,CAAC,CAAC,CAAC;qBACvB,CAAC;gBACJ,CAAC;gBAED,YAAY,CAAC,SAAS,EAAE,CAAC;gBACzB,OAAO,CAAC,IAAI,CAAC,CAAC;YAChB,CAAC,CAAC;YAEF,YAAY,CAAC,OAAO,GAAG,CAAC,CAAC,EAAE,EAAE;gBAC3B,YAAY,CAAC,SAAS,EAAE,CAAC;gBACzB,MAAM,CAAC,IAAI,KAAK,CAAC,sBAAsB,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;YACvD,CAAC,CAAC;YAEF,8EAA8E;YAC9E,0EAA0E;YAC1E,YAAY,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QACnC,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,MAAM,EAAE,SAAS,EAAE,CAAC;YACpB,MAAM,CAAC,GAAG,CAAC,CAAC;QACd,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC"}
+{"version":3,"file":"scan-worker-inline.js","sourceRoot":"","sources":["../src/scan-worker-inline.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAE/D;;;;;;GAMG;AAEH,OAAO,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AAuBtD,OAAO,EAAE,WAAW,EAAE,CAAC;AAEvB,IAAI,aAAa,GAAkB,IAAI,CAAC;AAExC,SAAS,gBAAgB;IACvB,IAAI,CAAC,aAAa,EAAE,CAAC;QACnB,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,IAAI,EAAE,wBAAwB,EAAE,CAAC,CAAC;QACzE,aAAa,GAAG,GAAG,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;IAC5C,CAAC;IACD,OAAO,aAAa,CAAC;AACvB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,oBAAoB,CAClC,MAAuC;IAEvC,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;QACrC,wEAAwE;QACxE,wEAAwE;QACxE,wEAAwE;QACxE,uEAAuE;QACvE,mEAAmE;QACnE,6DAA6D;QAC7D,IAAI,MAA0B,CAAC;QAC/B,IAAI,CAAC;YACH,MAAM,GAAG,IAAI,MAAM,CAAC,gBAAgB,EAAE,CAAC,CAAC;YACxC,oEAAoE;YACpE,+DAA+D;YAC/D,oEAAoE;YACpE,qEAAqE;YACrE,mEAAmE;YACnE,WAAW;YACX,MAAM,YAAY,GAAG,MAAM,CAAC;YAE5B,YAAY,CAAC,SAAS,GAAG,CAAC,CAAe,EAAE,EAAE;gBAC3C,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,YAAY,EAAE,gBAAgB,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC;gBAC9F,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,GAAG,CAAC,CAAC;gBACnC,MAAM,SAAS,GAAG,IAAI,WAAW,CAAC,OAAO,CAAC,CAAC;gBAC3C,MAAM,SAAS,GAAG,IAAI,WAAW,CAAC,OAAO,CAAC,CAAC;gBAC3C,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC;gBAEvC,MAAM,IAAI,GAA4B,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC;gBACvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC/B,IAAI,CAAC,CAAC,CAAC,GAAG;wBACR,SAAS,EAAE,KAAK,CAAC,CAAC,CAAC;wBACnB,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;wBACd,UAAU,EAAE,SAAS,CAAC,CAAC,CAAC;wBACxB,UAAU,EAAE,SAAS,CAAC,CAAC,CAAC;wBACxB,UAAU,EAAE,OAAO,CAAC,CAAC,CAAC;qBACvB,CAAC;gBACJ,CAAC;gBAED,YAAY,CAAC,SAAS,EAAE,CAAC;gBACzB,OAAO,CAAC,EAAE,IAAI,EAAE,gBAAgB,EAAE,YAAY,EAAE,oBAAoB,EAAE,gBAAgB,IAAI,CAAC,EAAE,CAAC,CAAC;YACjG,CAAC,CAAC;YAEF,YAAY,CAAC,OAAO,GAAG,CAAC,CAAC,EAAE,EAAE;gBAC3B,YAAY,CAAC,SAAS,EAAE,CAAC;gBACzB,MAAM,CAAC,IAAI,KAAK,CAAC,sBAAsB,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;YACvD,CAAC,CAAC;YAEF,8EAA8E;YAC9E,0EAA0E;YAC1E,YAAY,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QACnC,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,MAAM,EAAE,SAAS,EAAE,CAAC;YACpB,MAAM,CAAC,GAAG,CAAC,CAAC;QACd,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC"}