Method _findInLine

src/server/web/public/terminal.js:6525–6548

(e3, t3, i2 = {}, s2 = false)

            this._linesCache = void 0, this._linesCacheDisposables.clear(), this._linesCacheTimeoutId && (window.clearTimeout(this._linesCacheTimeoutId), this._linesCacheTimeoutId = 0);
          }
          _isWholeWord(e3, t3, i2) {
            return (0 === e3 || o.includes(t3[e3 - 1])) && (e3 + i2.length === t3.length || o.includes(t3[e3 + i2.length]));
          }
          _findInLine(e3, t3, i2 = {}, s2 = false) {
            var _a;
            const r2 = this._terminal, o2 = t3.startRow, n2 = t3.startCol, h = r2.buffer.active.getLine(o2);
            if (h == null ? void 0 : h.isWrapped) return s2 ? void (t3.startCol += r2.cols) : (t3.startRow--, t3.startCol += r2.cols, this._findInLine(e3, t3, i2));
            let a = (_a = this._linesCache) == null ? void 0 : _a[o2];
            a || (a = this._translateBufferLineToStringWithWrap(o2, true), this._linesCache && (this._linesCache[o2] = a));
            const [l, c] = a, d = this._bufferColsToStringOffset(o2, n2), _ = i2.caseSensitive ? e3 : e3.toLowerCase(), u = i2.caseSensitive ? l : l.toLowerCase();
            let f = -1;
            if (i2.regex) {
              const t4 = RegExp(_, "g");
              let i3;
              if (s2) for (; i3 = t4.exec(u.slice(0, d)); ) f = t4.lastIndex - i3[0].length, e3 = i3[0], t4.lastIndex -= e3.length - 1;
              else i3 = t4.exec(u.slice(d)), i3 && i3[0].length > 0 && (f = d + (t4.lastIndex - i3[0].length), e3 = i3[0]);
            } else s2 ? d - _.length >= 0 && (f = u.lastIndexOf(_, d - _.length)) : f = u.indexOf(_, d);
            if (f >= 0) {
              if (i2.wholeWord && !this._isWholeWord(f, u, e3)) return;
              let t4 = 0;
              for (; t4 < c.length - 1 && f >= c[t4 + 1]; ) t4++;
              let s3 = t4;
              for (; s3 < c.length - 1 && f + e3.length >= c[s3 + 1]; ) s3++;
              const n3 = f - c[t4], h2 = f + e3.length - c[s3], a2 = this._stringLengthToBufferSize(o2 + t4, n3);
              return { term: e3, col: a2, row: o2 + t4, size: this._stringLengthToBufferSize(o2 + s3, h2) - a2 + r2.cols * (s3 - t4) };
            }
          }