@pierre/diffs 1.3.0-beta.2 → 1.3.0-beta.4

package/dist/editor/pieceTable.js

@@ -59,6 +59,7 @@ var PieceTable = class {
 	#length = 0;
 	#lineCount = 0;
 	#lastVisitedLine = null;
+	#lastVisitedLineLength = null;
 	constructor(originalText) {
 		this.#original = new TextBuffer(originalText);
 		this.#setPieces([this.#createPiece(Piece.Original, 0, originalText.length)]);
@@ -72,14 +73,48 @@ var PieceTable = class {
 		const end = this.offsetAt(range.end);
 		return this.getTextSlice(start, end);
 	}
-	getLineText(line, trimEOF = true) {
-		if (this.#lastVisitedLine !== null && this.#lastVisitedLine[0] === line) return this.#lastVisitedLine[1];
+	getLineText(line, includeLineBreak = false) {
+		if (this.#lastVisitedLine !== null && this.#lastVisitedLine[0] === line && this.#lastVisitedLine[1] === includeLineBreak) return this.#lastVisitedLine[2];
 		const offset = this.#getLineOffset(line);
 		if (offset === void 0) throw new Error(`Line index out of range: ${line}`);
-		const text = this.getTextSlice(offset[0], offset[1], trimEOF);
-		this.#lastVisitedLine = [line, text];
+		const text = this.getTextSlice(offset[0], offset[1], !includeLineBreak);
+		this.#lastVisitedLine = [
+			line,
+			includeLineBreak,
+			text
+		];
+		this.#lastVisitedLineLength = [
+			line,
+			includeLineBreak,
+			text.length
+		];
 		return text;
 	}
+	getLineLength(line, includeLineBreak = false) {
+		const lastVisitedLineLength = this.#lastVisitedLineLength;
+		const lastVisitedLine = this.#lastVisitedLine;
+		if (lastVisitedLineLength !== null && lastVisitedLineLength[0] === line && lastVisitedLineLength[1] === includeLineBreak) return lastVisitedLineLength[2];
+		if (lastVisitedLine !== null && lastVisitedLine[0] === line && lastVisitedLine[1] === includeLineBreak) {
+			const length$1 = lastVisitedLine[2].length;
+			this.#lastVisitedLineLength = [
+				line,
+				includeLineBreak,
+				length$1
+			];
+			return length$1;
+		}
+		const offset = this.#getLineOffset(line);
+		if (offset === void 0) throw new Error(`Line index out of range: ${line}`);
+		const [start, end] = offset;
+		let length = end - start;
+		if (!includeLineBreak) while (length > 0 && isEOL(this.charAt(start + length - 1).charCodeAt(0))) length--;
+		this.#lastVisitedLineLength = [
+			line,
+			includeLineBreak,
+			length
+		];
+		return length;
+	}
 	getTextSlice(start, end, trimEOF = false) {
 		if (start >= end) return "";
 		const sliceStart = clamp(start, 0, this.#length);
@@ -159,7 +194,7 @@ var PieceTable = class {
 		});
 		return foundOffset ?? wrappedOffset;
 	}
-	search(kind, searchParams, range) {
+	search(searchParams) {
 		if (searchParams.text.length === 0 || this.#length === 0) return [];
 		if (searchParams.text.includes("\n") || searchParams.text.includes("\r") || searchParams.regex && (searchParams.text.includes("\\n") || searchParams.text.includes("\\r"))) return [];
 		let pattern;
@@ -168,21 +203,7 @@ var PieceTable = class {
 		} catch {
 			return [];
 		}
-		const matches = this.#collectSearchMatchesLineByLine(pattern, searchParams.wholeWord, MAX_FIND_MATCHES);
-		if (kind === "findAll" || kind === "replaceAll") return matches;
-		const caretOffset = range === void 0 ? 0 : kind === "findPrevious" ? this.offsetAt(range?.start) : this.offsetAt(range?.end);
-		if (kind === "findPrevious") {
-			const refOffset = getSearchFindPreviousReferenceOffset(range, (p) => this.offsetAt(p));
-			let best;
-			for (const m of matches) if (m[1] <= refOffset) best = m;
-			else break;
-			if (best !== void 0) return [best];
-			const last = matches[matches.length - 1];
-			return last !== void 0 ? [last] : [];
-		}
-		for (const m of matches) if (m[0] >= caretOffset) return [m];
-		const first = matches[0];
-		return first !== void 0 ? [first] : [];
+		return this.#collectSearchMatchesLineByLine(pattern, searchParams.wholeWord, MAX_FIND_MATCHES);
 	}
 	#collectSearchMatchesLineByLine(pattern, wholeWord, limit) {
 		const out = [];
@@ -237,6 +258,7 @@ var PieceTable = class {
 		if (!inserted) nextPieces.push(insertedPiece);
 		this.#setPieces(nextPieces);
 		this.#lastVisitedLine = null;
+		this.#lastVisitedLineLength = null;
 	}
 	delete(offset, length) {
 		if (length <= 0 || this.#length === 0) return;
@@ -256,6 +278,7 @@ var PieceTable = class {
 		}
 		this.#setPieces(nextPieces);
 		this.#lastVisitedLine = null;
+		this.#lastVisitedLineLength = null;
 	}
 	applyEdits(edits) {
 		if (edits.length === 0) return;
@@ -299,6 +322,7 @@ var PieceTable = class {
 		appendRange(copyCursor, this.#length);
 		this.#setPieces(nextPieces);
 		this.#lastVisitedLine = null;
+		this.#lastVisitedLineLength = null;
 	}
 	positionAt(offset) {
 		const clampedOffset = clamp(offset, 0, this.#length);
@@ -330,13 +354,6 @@ var PieceTable = class {
 		const character = clamp(position.character, 0, offset[1] - offset[0]);
 		return offset[0] + character;
 	}
-	offsetsAt(positions) {
-		const offsets = Array.from({ length: positions.length });
-		if (positions.length === 0) return offsets;
-		if (this.#length === 0) return offsets.fill(0);
-		for (let i = 0; i < positions.length; i++) offsets[i] = this.offsetAt(positions[i]);
-		return offsets;
-	}
 	#findPieceAtOffset(offset) {
 		if (offset < 0 || offset >= this.#length) return;
 		let node = this.#root;
@@ -578,12 +595,6 @@ function advancePastEmptyMatch(text, index) {
 	}
 	return index + 1;
 }
-function getSearchFindPreviousReferenceOffset(selection, offsetAt) {
-	if (selection === void 0) return 0;
-	const a = offsetAt(selection.start);
-	const b = offsetAt(selection.end);
-	return Math.min(a, b);
-}
 
 //#endregion
 export { PieceTable };

package/dist/editor/pieceTable.js.map

@@ -1 +1 @@
-{"version":3,"file":"pieceTable.js","names":["source: number","offset: number","length: number","lineOffsetStart: number","lineOffsetEnd: number","text: string","piece: Piece","subtreeLength: number","subtreeLineBreakCount: number","#original","#setPieces","#createPiece","#lineCount","#textFromPieces","#lastVisitedLine","#getLineOffset","#length","#findPieceAtOffset","chunks: string[]","#bufferFor","start","end","#nextNode","#forEachPieceSegment","wrappedOffset: number | undefined","foundOffset: number | undefined","pattern: RegExp","#collectSearchMatchesLineByLine","best: [number, number] | undefined","out: [number, number][]","match: RegExpExecArray | null","#add","#pieces","nextPieces: Piece[]","#lineAtOffset","#lineBreakOffset","positions: Position[]","offsets: number[]","#root","#walk","#piecesCache","#buildBalancedTree","normalized: [start: number, end: number][]","merged: [start: number, end: number][]","coalescedPieces: Piece[]"],"sources":["../../src/editor/pieceTable.ts"],"sourcesContent":["import { computeLineOffsets } from '../utils/computeFileOffsets';\nimport type { SearchParams } from './searchPanel';\nimport type { Position, Range, ResolvedTextEdit } from './textDocument';\n\nconst MAX_FIND_MATCHES = 100000;\n// TODO(ije): use Intl.Segmenter instead of regex for word separators\nconst WORD_SEPARATORS = '`~!@#$%^&*()-=+[{]}\\\\|;:\\'\",.<>/?' as const;\n\n// A piece is a segment of text that is either original or added.\nclass Piece {\n  static Original = 0;\n  static Added = 1;\n\n  constructor(\n    public readonly source: number,\n    public readonly offset: number,\n    public readonly length: number,\n    public readonly lineOffsetStart: number,\n    public readonly lineOffsetEnd: number\n  ) {}\n\n  get lineBreakCount(): number {\n    return this.lineOffsetEnd - this.lineOffsetStart;\n  }\n}\n\n// A text buffer is a string with its line offsets.\nclass TextBuffer {\n  lineOffsets: number[];\n\n  constructor(public text: string) {\n    this.lineOffsets = computeLineOffsets(text);\n  }\n\n  // the append operation is efficient because it only appends\n  // elements to the lineOffsets array in the end\n  append(text: string): number {\n    const offset = this.text.length;\n    const appendedLineOffsets = computeLineOffsets(text);\n    for (let i = 1; i < appendedLineOffsets.length; i++) {\n      this.lineOffsets.push(offset + appendedLineOffsets[i]);\n    }\n    this.text += text;\n    return offset;\n  }\n}\n\n// A node in the balanced piece tree.\nclass PieceNode {\n  left: PieceNode | null = null;\n  right: PieceNode | null = null;\n  parent: PieceNode | null = null;\n\n  constructor(\n    public piece: Piece,\n    public subtreeLength: number = piece.length,\n    public subtreeLineBreakCount: number = piece.lineBreakCount\n  ) {}\n\n  updateSubtreeLength(): void {\n    this.subtreeLength =\n      (this.left?.subtreeLength ?? 0) +\n      this.piece.length +\n      (this.right?.subtreeLength ?? 0);\n    this.subtreeLineBreakCount =\n      (this.left?.subtreeLineBreakCount ?? 0) +\n      this.piece.lineBreakCount +\n      (this.right?.subtreeLineBreakCount ?? 0);\n  }\n}\n\n/**\n * A piece table is a data structure that allows for efficient insertion and deletion of text.\n * It is a tree of pieces, where each piece is a segment of text that is either original or added.\n * The tree is rebuilt as a balanced tree after edits to keep lookups efficient.\n * Inspired by https://code.visualstudio.com/blogs/2018/03/23/text-buffer-reimplementation\n */\nexport class PieceTable {\n  #original: TextBuffer;\n  #add = new TextBuffer('');\n  #root: PieceNode | null = null;\n  #piecesCache: Piece[] = [];\n  #length = 0;\n  #lineCount = 0;\n  #lastVisitedLine: [number, string] | null = null;\n\n  constructor(originalText: string) {\n    this.#original = new TextBuffer(originalText);\n    this.#setPieces([\n      this.#createPiece(Piece.Original, 0, originalText.length),\n    ]);\n  }\n\n  get lineCount(): number {\n    return this.#lineCount;\n  }\n\n  getText(range?: Range): string {\n    if (range === undefined) {\n      return this.#textFromPieces();\n    }\n    const start = this.offsetAt(range.start);\n    const end = this.offsetAt(range.end);\n    return this.getTextSlice(start, end);\n  }\n\n  getLineText(line: number, trimEOF = true): string {\n    if (this.#lastVisitedLine !== null && this.#lastVisitedLine[0] === line) {\n      return this.#lastVisitedLine[1];\n    }\n    const offset = this.#getLineOffset(line);\n    if (offset === undefined) {\n      throw new Error(`Line index out of range: ${line}`);\n    }\n    const text = this.getTextSlice(offset[0], offset[1], trimEOF);\n    this.#lastVisitedLine = [line, text];\n    return text;\n  }\n\n  getTextSlice(start: number, end: number, trimEOF = false): string {\n    if (start >= end) {\n      return '';\n    }\n\n    const sliceStart = clamp(start, 0, this.#length);\n    const sliceEnd = clamp(end, sliceStart, this.#length);\n    if (sliceStart >= sliceEnd) {\n      return '';\n    }\n\n    const location = this.#findPieceAtOffset(sliceStart);\n    if (location === undefined) {\n      return '';\n    }\n\n    const chunks: string[] = [];\n    let [node, offsetInPiece] = location as [PieceNode | null, number];\n    let remaining = sliceEnd - sliceStart;\n    while (node !== null && remaining > 0) {\n      const takeLength = Math.min(node.piece.length - offsetInPiece, remaining);\n      const buffer = this.#bufferFor(node.piece.source);\n      const start = node.piece.offset + offsetInPiece;\n      let end = start + takeLength;\n      if (trimEOF) {\n        while (end > start && isEOL(buffer.text.charCodeAt(end - 1))) {\n          end--;\n        }\n      }\n      chunks.push(buffer.text.slice(start, end));\n      remaining -= takeLength;\n      offsetInPiece = 0;\n      node = this.#nextNode(node);\n    }\n\n    return chunks.join('');\n  }\n\n  charAt(offset: number): string {\n    const location = this.#findPieceAtOffset(offset);\n    if (location === undefined) {\n      return '';\n    }\n\n    const [node, offsetInPiece] = location;\n    const buffer = this.#bufferFor(node.piece.source);\n    return buffer.text.charAt(node.piece.offset + offsetInPiece);\n  }\n\n  includes(needle: string): boolean {\n    if (needle.length === 0) {\n      return true;\n    }\n\n    const prefixTable = createPrefixTable(needle);\n    let matched = 0;\n    let found = false;\n    this.#forEachPieceSegment((segment) => {\n      for (let offset = segment.start; offset < segment.end; offset++) {\n        const charCode = segment.text.charCodeAt(offset);\n        while (matched > 0 && charCode !== needle.charCodeAt(matched)) {\n          matched = prefixTable[matched - 1];\n        }\n        if (charCode === needle.charCodeAt(matched)) {\n          matched++;\n        }\n        if (matched === needle.length) {\n          found = true;\n          return false;\n        }\n      }\n      return true;\n    });\n    return found;\n  }\n\n  findNextNonOverlappingSubstring(\n    needle: string,\n    occupied: readonly [start: number, end: number][]\n  ): number | undefined {\n    if (needle.length === 0 || needle.length > this.#length) {\n      return undefined;\n    }\n\n    const ranges = normalizeRanges(occupied, this.#length);\n    const pivot = ranges.reduce((max, [, end]) => Math.max(max, end), 0);\n    const prefixTable = createPrefixTable(needle);\n    let matched = 0;\n    let documentOffset = 0;\n    let wrappedOffset: number | undefined;\n    let foundOffset: number | undefined;\n\n    this.#forEachPieceSegment((segment) => {\n      for (let offset = segment.start; offset < segment.end; offset++) {\n        const charCode = segment.text.charCodeAt(offset);\n        while (matched > 0 && charCode !== needle.charCodeAt(matched)) {\n          matched = prefixTable[matched - 1];\n        }\n        if (charCode === needle.charCodeAt(matched)) {\n          matched++;\n        }\n        if (matched === needle.length) {\n          const start = documentOffset - needle.length + 1;\n          if (!rangeOverlaps(ranges, start, start + needle.length)) {\n            if (start >= pivot) {\n              foundOffset = start;\n              return false;\n            }\n            wrappedOffset ??= start;\n          }\n          matched = prefixTable[matched - 1];\n        }\n        documentOffset++;\n      }\n      return true;\n    });\n\n    return foundOffset ?? wrappedOffset;\n  }\n\n  search(\n    kind: 'findNext' | 'findPrevious' | 'findAll' | 'replace' | 'replaceAll',\n    searchParams: SearchParams,\n    range?: Range\n  ): [start: number, end: number][] {\n    if (searchParams.text.length === 0 || this.#length === 0) {\n      return [];\n    }\n    // Search currently operates line-by-line, so newline-spanning patterns are unsupported.\n    if (\n      searchParams.text.includes('\\n') ||\n      searchParams.text.includes('\\r') ||\n      (searchParams.regex &&\n        (searchParams.text.includes('\\\\n') ||\n          searchParams.text.includes('\\\\r')))\n    ) {\n      return [];\n    }\n\n    let pattern: RegExp;\n    try {\n      pattern = compileSearchRegExp(\n        searchParams.text,\n        searchParams.regex,\n        searchParams.caseSensitive\n      );\n    } catch {\n      return [];\n    }\n\n    const matches = this.#collectSearchMatchesLineByLine(\n      pattern,\n      searchParams.wholeWord,\n      MAX_FIND_MATCHES\n    );\n\n    if (kind === 'findAll' || kind === 'replaceAll') {\n      return matches;\n    }\n\n    const caretOffset =\n      range === undefined\n        ? 0\n        : kind === 'findPrevious'\n          ? this.offsetAt(range?.start)\n          : this.offsetAt(range?.end);\n\n    if (kind === 'findPrevious') {\n      const refOffset = getSearchFindPreviousReferenceOffset(range, (p) =>\n        this.offsetAt(p)\n      );\n      let best: [number, number] | undefined;\n      for (const m of matches) {\n        if (m[1] <= refOffset) {\n          best = m;\n        } else {\n          break;\n        }\n      }\n      if (best !== undefined) {\n        return [best];\n      }\n      const last = matches[matches.length - 1];\n      return last !== undefined ? [last] : [];\n    }\n\n    // findNext, replace — forward from caret with wrap\n    for (const m of matches) {\n      if (m[0] >= caretOffset) {\n        return [m];\n      }\n    }\n    const first = matches[0];\n    return first !== undefined ? [first] : [];\n  }\n\n  #collectSearchMatchesLineByLine(\n    pattern: RegExp,\n    wholeWord: boolean,\n    limit: number\n  ): [number, number][] {\n    const out: [number, number][] = [];\n    const docLength = this.#length;\n    const charAt = (offset: number) => this.charAt(offset);\n\n    for (let line = 0; line < this.#lineCount; line++) {\n      const lineText = this.getLineText(line);\n      const lineStart = this.offsetAt({ line, character: 0 });\n      const re = new RegExp(pattern.source, pattern.flags);\n      re.lastIndex = 0;\n      let match: RegExpExecArray | null;\n      while ((match = re.exec(lineText)) !== null) {\n        const rel = match.index;\n        const fragment = match[0];\n        if (fragment.length === 0) {\n          re.lastIndex = advancePastEmptyMatch(lineText, rel);\n          continue;\n        }\n        const docStart = lineStart + rel;\n        if (\n          !wholeWord ||\n          isWholeWordAtDocOffsets(docStart, fragment.length, docLength, charAt)\n        ) {\n          out.push([docStart, docStart + fragment.length]);\n          if (out.length >= limit) {\n            return out;\n          }\n        }\n        if (rel === re.lastIndex) {\n          re.lastIndex = advancePastEmptyMatch(lineText, rel);\n        }\n      }\n    }\n    return out;\n  }\n\n  insert(text: string, offset: number): void {\n    if (text.length === 0) {\n      return;\n    }\n\n    const insertOffset = clamp(offset, 0, this.#length);\n    const addOffset = this.#add.append(text);\n    const insertedPiece = this.#createPiece(\n      Piece.Added,\n      addOffset,\n      text.length\n    );\n    const pieces = this.#pieces();\n    const nextPieces: Piece[] = [];\n\n    let cursor = 0;\n    let inserted = false;\n\n    for (const piece of pieces) {\n      const pieceEnd = cursor + piece.length;\n      if (!inserted && insertOffset <= pieceEnd) {\n        const splitOffset = insertOffset - cursor;\n        if (splitOffset > 0) {\n          nextPieces.push(\n            this.#createPiece(piece.source, piece.offset, splitOffset)\n          );\n        }\n        nextPieces.push(insertedPiece);\n        if (splitOffset < piece.length) {\n          nextPieces.push(\n            this.#createPiece(\n              piece.source,\n              piece.offset + splitOffset,\n              piece.length - splitOffset\n            )\n          );\n        }\n        inserted = true;\n      } else {\n        nextPieces.push(piece);\n      }\n      cursor = pieceEnd;\n    }\n\n    if (!inserted) {\n      nextPieces.push(insertedPiece);\n    }\n\n    this.#setPieces(nextPieces);\n    this.#lastVisitedLine = null;\n  }\n\n  delete(offset: number, length: number): void {\n    if (length <= 0 || this.#length === 0) {\n      return;\n    }\n\n    const start = clamp(offset, 0, this.#length);\n    const end = clamp(start + length, start, this.#length);\n    if (start === end) {\n      return;\n    }\n\n    const nextPieces: Piece[] = [];\n    let cursor = 0;\n    for (const piece of this.#pieces()) {\n      const pieceStart = cursor;\n      const pieceEnd = cursor + piece.length;\n      const keepBefore = clamp(start - pieceStart, 0, piece.length);\n      const keepAfter = clamp(pieceEnd - end, 0, piece.length);\n\n      if (keepBefore > 0) {\n        nextPieces.push(\n          this.#createPiece(piece.source, piece.offset, keepBefore)\n        );\n      }\n      if (keepAfter > 0) {\n        nextPieces.push(\n          this.#createPiece(\n            piece.source,\n            piece.offset + piece.length - keepAfter,\n            keepAfter\n          )\n        );\n      }\n      cursor = pieceEnd;\n    }\n\n    this.#setPieces(nextPieces);\n    this.#lastVisitedLine = null;\n  }\n\n  applyEdits(edits: readonly ResolvedTextEdit[]): void {\n    if (edits.length === 0) {\n      return;\n    }\n\n    let pieceIndex = 0;\n    let pieceStart = 0;\n    let copyCursor = 0;\n\n    const pieces = this.#pieces();\n    const insertedPieces = edits.map((edit) =>\n      edit.text.length === 0\n        ? undefined\n        : this.#createPiece(\n            Piece.Added,\n            this.#add.append(edit.text),\n            edit.text.length\n          )\n    );\n    const nextPieces: Piece[] = [];\n\n    const advancePiece = () => {\n      const piece = pieces[pieceIndex];\n      if (piece !== undefined) {\n        pieceStart += piece.length;\n        pieceIndex++;\n      }\n    };\n\n    const appendRange = (start: number, end: number) => {\n      let rangeStart = clamp(start, 0, this.#length);\n      const rangeEnd = clamp(end, rangeStart, this.#length);\n      while (\n        pieceIndex < pieces.length &&\n        pieceStart + pieces[pieceIndex].length <= rangeStart\n      ) {\n        advancePiece();\n      }\n      while (pieceIndex < pieces.length && rangeStart < rangeEnd) {\n        const piece = pieces[pieceIndex];\n        const pieceEnd = pieceStart + piece.length;\n        const offsetInPiece = clamp(rangeStart - pieceStart, 0, piece.length);\n        const takeEnd = Math.min(pieceEnd, rangeEnd);\n        const takeLength = takeEnd - (pieceStart + offsetInPiece);\n        if (takeLength > 0) {\n          nextPieces.push(\n            offsetInPiece === 0 && takeLength === piece.length\n              ? piece\n              : this.#createPiece(\n                  piece.source,\n                  piece.offset + offsetInPiece,\n                  takeLength\n                )\n          );\n        }\n        rangeStart = takeEnd;\n        if (rangeStart >= pieceEnd) {\n          advancePiece();\n        }\n      }\n    };\n\n    for (let i = 0; i < edits.length; i++) {\n      const edit = edits[i];\n      const start = clamp(edit.start, copyCursor, this.#length);\n      const end = clamp(edit.end, start, this.#length);\n      appendRange(copyCursor, start);\n\n      const insertedPiece = insertedPieces[i];\n      if (insertedPiece !== undefined) {\n        nextPieces.push(insertedPiece);\n      }\n      copyCursor = end;\n    }\n    appendRange(copyCursor, this.#length);\n\n    this.#setPieces(nextPieces);\n    this.#lastVisitedLine = null;\n  }\n\n  positionAt(offset: number): Position {\n    const clampedOffset = clamp(offset, 0, this.#length);\n    if (this.#length === 0) {\n      return { line: 0, character: 0 };\n    }\n    const line = this.#lineAtOffset(clampedOffset);\n    const lineStart = line === 0 ? 0 : this.#lineBreakOffset(line - 1);\n    return {\n      line,\n      character: clampedOffset - lineStart,\n    };\n  }\n\n  positionsAt(offsets: readonly number[]): Position[] {\n    const positions: Position[] = Array.from({ length: offsets.length });\n    if (offsets.length === 0) {\n      return positions;\n    }\n    if (this.#length === 0) {\n      return positions.fill({ line: 0, character: 0 });\n    }\n\n    for (let i = 0; i < offsets.length; i++) {\n      positions[i] = this.positionAt(offsets[i]);\n    }\n\n    return positions;\n  }\n\n  offsetAt(position: Position): number {\n    if (position.line < 0 || this.#length === 0) {\n      return 0;\n    }\n    if (position.line >= this.#lineCount) {\n      throw new Error(`Line index out of range: ${position.line}`);\n    }\n    const offset = this.#getLineOffset(position.line);\n    if (offset === undefined) {\n      throw new Error(`Line index out of range: ${position.line}`);\n    }\n    const character = clamp(position.character, 0, offset[1] - offset[0]);\n    return offset[0] + character;\n  }\n\n  offsetsAt(positions: readonly Position[]): number[] {\n    const offsets: number[] = Array.from({ length: positions.length });\n    if (positions.length === 0) {\n      return offsets;\n    }\n    if (this.#length === 0) {\n      return offsets.fill(0);\n    }\n\n    for (let i = 0; i < positions.length; i++) {\n      offsets[i] = this.offsetAt(positions[i]);\n    }\n\n    return offsets;\n  }\n\n  #findPieceAtOffset(\n    offset: number\n  ): [node: PieceNode, offsetInPiece: number] | undefined {\n    if (offset < 0 || offset >= this.#length) {\n      return undefined;\n    }\n\n    let node = this.#root;\n    let remaining = offset;\n    while (node !== null) {\n      const leftLength = node.left?.subtreeLength ?? 0;\n      if (remaining < leftLength) {\n        node = node.left;\n        continue;\n      }\n\n      remaining -= leftLength;\n      if (remaining < node.piece.length) {\n        return [node, remaining];\n      }\n\n      remaining -= node.piece.length;\n      node = node.right;\n    }\n\n    return undefined;\n  }\n\n  #nextNode(node: PieceNode): PieceNode | null {\n    if (node.right !== null) {\n      let next = node.right;\n      while (next.left !== null) {\n        next = next.left;\n      }\n      return next;\n    }\n\n    let current = node;\n    while (current.parent !== null && current === current.parent.right) {\n      current = current.parent;\n    }\n    return current.parent;\n  }\n\n  #getLineOffset(line: number): [start: number, end: number] | undefined {\n    if (line < 0) {\n      throw new Error(`Line index out of range: ${line}`);\n    }\n    if (this.#length === 0) {\n      if (line === 0) {\n        return [0, 0];\n      }\n      throw new Error(`Line index out of range: ${line}`);\n    }\n    if (line >= this.#lineCount) {\n      throw new Error(`Line index out of range: ${line}`);\n    }\n\n    const start = line === 0 ? 0 : this.#lineBreakOffset(line - 1);\n    const end =\n      line < this.#lineCount - 1 ? this.#lineBreakOffset(line) : this.#length;\n    return [start, end];\n  }\n\n  #lineAtOffset(offset: number): number {\n    let node = this.#root;\n    let remaining = clamp(offset, 0, this.#length);\n    let line = 0;\n\n    while (node !== null) {\n      const leftLength = node.left?.subtreeLength ?? 0;\n      if (remaining < leftLength) {\n        node = node.left;\n        continue;\n      }\n\n      line += node.left?.subtreeLineBreakCount ?? 0;\n      remaining -= leftLength;\n      if (remaining <= node.piece.length) {\n        const buffer = this.#bufferFor(node.piece.source);\n        line +=\n          upperBound(buffer.lineOffsets, node.piece.offset + remaining) -\n          node.piece.lineOffsetStart;\n        return line;\n      }\n\n      line += node.piece.lineBreakCount;\n      remaining -= node.piece.length;\n      node = node.right;\n    }\n\n    return this.#lineCount - 1;\n  }\n\n  #lineBreakOffset(lineBreakIndex: number): number {\n    let node = this.#root;\n    let remaining = lineBreakIndex;\n    let documentOffset = 0;\n\n    while (node !== null) {\n      const leftLineBreakCount = node.left?.subtreeLineBreakCount ?? 0;\n      if (remaining < leftLineBreakCount) {\n        node = node.left;\n        continue;\n      }\n\n      const leftLength = node.left?.subtreeLength ?? 0;\n      documentOffset += leftLength;\n      remaining -= leftLineBreakCount;\n\n      if (remaining < node.piece.lineBreakCount) {\n        const bufferLineOffset = this.#bufferFor(node.piece.source).lineOffsets[\n          node.piece.lineOffsetStart + remaining\n        ];\n        return documentOffset + (bufferLineOffset - node.piece.offset);\n      }\n\n      documentOffset += node.piece.length;\n      remaining -= node.piece.lineBreakCount;\n      node = node.right;\n    }\n\n    return this.#length;\n  }\n\n  #textFromPieces(): string {\n    const chunks: string[] = [];\n    this.#forEachPieceSegment((segment) => {\n      chunks.push(segment.text.slice(segment.start, segment.end));\n    });\n    return chunks.join('');\n  }\n\n  #forEachPieceSegment(\n    callback: (segment: {\n      readonly start: number;\n      readonly end: number;\n      readonly text: string;\n      readonly lineOffsets: number[];\n      readonly lineOffsetStart: number;\n      readonly lineOffsetEnd: number;\n    }) => boolean | void\n  ): void {\n    this.#walk(this.#root, (node) => {\n      const buffer = this.#bufferFor(node.piece.source);\n      return callback({\n        text: buffer.text,\n        lineOffsets: buffer.lineOffsets,\n        lineOffsetStart: node.piece.lineOffsetStart,\n        lineOffsetEnd: node.piece.lineOffsetEnd,\n        start: node.piece.offset,\n        end: node.piece.offset + node.piece.length,\n      });\n    });\n  }\n\n  #bufferFor(source: number): TextBuffer {\n    return source === Piece.Original ? this.#original : this.#add;\n  }\n\n  #createPiece(source: number, offset: number, length: number): Piece {\n    const buffer = this.#bufferFor(source);\n    return new Piece(\n      source,\n      offset,\n      length,\n      upperBound(buffer.lineOffsets, offset),\n      upperBound(buffer.lineOffsets, offset + length)\n    );\n  }\n\n  #pieces(): Piece[] {\n    return this.#piecesCache;\n  }\n\n  #setPieces(pieces: Piece[]): void {\n    const coalescedPieces = coalescePieces(pieces);\n    this.#piecesCache = coalescedPieces;\n    let length = 0;\n    let lineBreakCount = 0;\n    for (const piece of coalescedPieces) {\n      length += piece.length;\n      lineBreakCount += piece.lineBreakCount;\n    }\n    this.#root = this.#buildBalancedTree(\n      coalescedPieces,\n      0,\n      coalescedPieces.length,\n      null\n    );\n    this.#length = length;\n    this.#lineCount = lineBreakCount + 1;\n  }\n\n  #buildBalancedTree(\n    pieces: Piece[],\n    start: number,\n    end: number,\n    parent: PieceNode | null\n  ): PieceNode | null {\n    if (start >= end) {\n      return null;\n    }\n\n    const middle = start + Math.floor((end - start) / 2);\n    const node = new PieceNode(pieces[middle]);\n    node.parent = parent;\n    node.left = this.#buildBalancedTree(pieces, start, middle, node);\n    node.right = this.#buildBalancedTree(pieces, middle + 1, end, node);\n    node.updateSubtreeLength();\n    return node;\n  }\n\n  #walk(\n    node: PieceNode | null,\n    visit: (node: PieceNode) => boolean | void\n  ): boolean {\n    if (node === null) {\n      return true;\n    }\n    if (!this.#walk(node.left, visit)) {\n      return false;\n    }\n    if (visit(node) === false) {\n      return false;\n    }\n    return this.#walk(node.right, visit);\n  }\n}\n\nfunction isEOL(charCode: number): boolean {\n  return charCode === /* \\n */ 10 || charCode === /* \\r */ 13;\n}\n\nfunction clamp(value: number, min: number, max: number): number {\n  return Math.min(Math.max(value, min), max);\n}\n\nfunction createPrefixTable(text: string): number[] {\n  const table = Array.from<number>({ length: text.length }).fill(0);\n  let matched = 0;\n  for (let i = 1; i < text.length; i++) {\n    const charCode = text.charCodeAt(i);\n    while (matched > 0 && charCode !== text.charCodeAt(matched)) {\n      matched = table[matched - 1];\n    }\n    if (charCode === text.charCodeAt(matched)) {\n      matched++;\n    }\n    table[i] = matched;\n  }\n  return table;\n}\n\nfunction normalizeRanges(\n  ranges: readonly [start: number, end: number][],\n  length: number\n): [start: number, end: number][] {\n  const normalized: [start: number, end: number][] = [];\n  for (const [rawStart, rawEnd] of ranges) {\n    const start = clamp(rawStart, 0, length);\n    const end = clamp(rawEnd, start, length);\n    if (start < end) {\n      normalized.push([start, end]);\n    }\n  }\n  normalized.sort((a, b) => a[0] - b[0]);\n\n  const merged: [start: number, end: number][] = [];\n  for (const range of normalized) {\n    const previous = merged[merged.length - 1];\n    if (previous !== undefined && range[0] <= previous[1]) {\n      previous[1] = Math.max(previous[1], range[1]);\n      continue;\n    }\n    merged.push(range);\n  }\n  return merged;\n}\n\nfunction rangeOverlaps(\n  ranges: readonly [start: number, end: number][],\n  start: number,\n  end: number\n): boolean {\n  let low = 0;\n  let high = ranges.length;\n  while (low < high) {\n    const mid = low + Math.floor((high - low) / 2);\n    if (ranges[mid][1] <= start) {\n      low = mid + 1;\n    } else {\n      high = mid;\n    }\n  }\n\n  const range = ranges[low];\n  return range !== undefined && range[0] < end;\n}\n\n// Keeps the table compact after repeated edits by joining neighboring pieces\n// that already point at contiguous text in the same backing buffer.\nfunction coalescePieces(pieces: Piece[]): Piece[] {\n  const coalescedPieces: Piece[] = [];\n  for (const piece of pieces) {\n    if (piece.length === 0) {\n      continue;\n    }\n\n    const previous = coalescedPieces[coalescedPieces.length - 1];\n    if (\n      previous !== undefined &&\n      previous.source === piece.source &&\n      previous.offset + previous.length === piece.offset\n    ) {\n      coalescedPieces[coalescedPieces.length - 1] = new Piece(\n        previous.source,\n        previous.offset,\n        previous.length + piece.length,\n        previous.lineOffsetStart,\n        piece.lineOffsetEnd\n      );\n      continue;\n    }\n\n    coalescedPieces.push(piece);\n  }\n  return coalescedPieces;\n}\n\n// Returns the index of the first element in the array that is greater than the target.\nfunction upperBound(values: number[], target: number): number {\n  let lo = 0;\n  let hi = values.length;\n  while (lo < hi) {\n    const mid = lo + Math.floor((hi - lo) / 2);\n    if (values[mid] <= target) {\n      lo = mid + 1;\n    } else {\n      hi = mid;\n    }\n  }\n  return lo;\n}\n\nfunction escapeRegExp(text: string): string {\n  return text.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\$&');\n}\n\nfunction isWordSeparatorCharCode(charCode: number): boolean {\n  if (charCode <= 32 || charCode === 127) {\n    return true;\n  }\n  const ch = String.fromCharCode(charCode);\n  return WORD_SEPARATORS.includes(ch);\n}\n\n// Checks if the given text is a whole word by checking if the\n// characters before and after are word separators.\nfunction isWholeWordAtDocOffsets(\n  docStart: number,\n  length: number,\n  docLength: number,\n  charAt: (offset: number) => string\n): boolean {\n  const beforeOk =\n    docStart <= 0 ||\n    isWordSeparatorCharCode(charCodeUnitAt(charAt, docStart - 1));\n  const afterOk =\n    docStart + length >= docLength ||\n    isWordSeparatorCharCode(charCodeUnitAt(charAt, docStart + length));\n  return beforeOk && afterOk;\n}\n\nfunction charCodeUnitAt(\n  charAt: (offset: number) => string,\n  offset: number\n): number {\n  const unit = charAt(offset);\n  return unit.length === 0 ? 0 : unit.charCodeAt(0);\n}\n\nfunction compileSearchRegExp(\n  source: string,\n  isRegex: boolean,\n  caseSensitive: boolean\n): RegExp {\n  const body = isRegex ? source : escapeRegExp(source);\n  const flags = `g${caseSensitive ? '' : 'i'}${isRegex ? 'm' : ''}`;\n  return new RegExp(body, flags);\n}\n\nfunction advancePastEmptyMatch(text: string, index: number): number {\n  if (index + 1 < text.length) {\n    const first = text.charCodeAt(index);\n    const second = text.charCodeAt(index + 1);\n    if (\n      first >= 0xd800 &&\n      first <= 0xdbff &&\n      second >= 0xdc00 &&\n      second <= 0xdfff\n    ) {\n      return index + 2;\n    }\n  }\n  return index + 1;\n}\n\n// Returns the leftmost UTF-16 offset of the selection; used for find-previous\n// so we skip the current match.\nfunction getSearchFindPreviousReferenceOffset(\n  selection: Range | undefined,\n  offsetAt: (p: Position) => number\n): number {\n  if (selection === undefined) {\n    return 0;\n  }\n  const a = offsetAt(selection.start);\n  const b = offsetAt(selection.end);\n  return Math.min(a, b);\n}\n"],"mappings":";;;AAIA,MAAM,mBAAmB;AAEzB,MAAM,kBAAkB;AAGxB,IAAM,QAAN,MAAY;CACV,OAAO,WAAW;CAClB,OAAO,QAAQ;CAEf,YACE,AAAgBA,QAChB,AAAgBC,QAChB,AAAgBC,QAChB,AAAgBC,iBAChB,AAAgBC,eAChB;EALgB;EACA;EACA;EACA;EACA;;CAGlB,IAAI,iBAAyB;AAC3B,SAAO,KAAK,gBAAgB,KAAK;;;AAKrC,IAAM,aAAN,MAAiB;CACf;CAEA,YAAY,AAAOC,MAAc;EAAd;AACjB,OAAK,cAAc,mBAAmB,KAAK;;CAK7C,OAAO,MAAsB;EAC3B,MAAM,SAAS,KAAK,KAAK;EACzB,MAAM,sBAAsB,mBAAmB,KAAK;AACpD,OAAK,IAAI,IAAI,GAAG,IAAI,oBAAoB,QAAQ,IAC9C,MAAK,YAAY,KAAK,SAAS,oBAAoB,GAAG;AAExD,OAAK,QAAQ;AACb,SAAO;;;AAKX,IAAM,YAAN,MAAgB;CACd,OAAyB;CACzB,QAA0B;CAC1B,SAA2B;CAE3B,YACE,AAAOC,OACP,AAAOC,gBAAwB,MAAM,QACrC,AAAOC,wBAAgC,MAAM,gBAC7C;EAHO;EACA;EACA;;CAGT,sBAA4B;AAC1B,OAAK,iBACF,KAAK,MAAM,iBAAiB,KAC7B,KAAK,MAAM,UACV,KAAK,OAAO,iBAAiB;AAChC,OAAK,yBACF,KAAK,MAAM,yBAAyB,KACrC,KAAK,MAAM,kBACV,KAAK,OAAO,yBAAyB;;;;;;;;;AAU5C,IAAa,aAAb,MAAwB;CACtB;CACA,OAAO,IAAI,WAAW,GAAG;CACzB,QAA0B;CAC1B,eAAwB,EAAE;CAC1B,UAAU;CACV,aAAa;CACb,mBAA4C;CAE5C,YAAY,cAAsB;AAChC,QAAKC,WAAY,IAAI,WAAW,aAAa;AAC7C,QAAKC,UAAW,CACd,MAAKC,YAAa,MAAM,UAAU,GAAG,aAAa,OAAO,CAC1D,CAAC;;CAGJ,IAAI,YAAoB;AACtB,SAAO,MAAKC;;CAGd,QAAQ,OAAuB;AAC7B,MAAI,UAAU,OACZ,QAAO,MAAKC,gBAAiB;EAE/B,MAAM,QAAQ,KAAK,SAAS,MAAM,MAAM;EACxC,MAAM,MAAM,KAAK,SAAS,MAAM,IAAI;AACpC,SAAO,KAAK,aAAa,OAAO,IAAI;;CAGtC,YAAY,MAAc,UAAU,MAAc;AAChD,MAAI,MAAKC,oBAAqB,QAAQ,MAAKA,gBAAiB,OAAO,KACjE,QAAO,MAAKA,gBAAiB;EAE/B,MAAM,SAAS,MAAKC,cAAe,KAAK;AACxC,MAAI,WAAW,OACb,OAAM,IAAI,MAAM,4BAA4B,OAAO;EAErD,MAAM,OAAO,KAAK,aAAa,OAAO,IAAI,OAAO,IAAI,QAAQ;AAC7D,QAAKD,kBAAmB,CAAC,MAAM,KAAK;AACpC,SAAO;;CAGT,aAAa,OAAe,KAAa,UAAU,OAAe;AAChE,MAAI,SAAS,IACX,QAAO;EAGT,MAAM,aAAa,MAAM,OAAO,GAAG,MAAKE,OAAQ;EAChD,MAAM,WAAW,MAAM,KAAK,YAAY,MAAKA,OAAQ;AACrD,MAAI,cAAc,SAChB,QAAO;EAGT,MAAM,WAAW,MAAKC,kBAAmB,WAAW;AACpD,MAAI,aAAa,OACf,QAAO;EAGT,MAAMC,SAAmB,EAAE;EAC3B,IAAI,CAAC,MAAM,iBAAiB;EAC5B,IAAI,YAAY,WAAW;AAC3B,SAAO,SAAS,QAAQ,YAAY,GAAG;GACrC,MAAM,aAAa,KAAK,IAAI,KAAK,MAAM,SAAS,eAAe,UAAU;GACzE,MAAM,SAAS,MAAKC,UAAW,KAAK,MAAM,OAAO;GACjD,MAAMC,UAAQ,KAAK,MAAM,SAAS;GAClC,IAAIC,QAAMD,UAAQ;AAClB,OAAI,QACF,QAAOC,QAAMD,WAAS,MAAM,OAAO,KAAK,WAAWC,QAAM,EAAE,CAAC,CAC1D;AAGJ,UAAO,KAAK,OAAO,KAAK,MAAMD,SAAOC,MAAI,CAAC;AAC1C,gBAAa;AACb,mBAAgB;AAChB,UAAO,MAAKC,SAAU,KAAK;;AAG7B,SAAO,OAAO,KAAK,GAAG;;CAGxB,OAAO,QAAwB;EAC7B,MAAM,WAAW,MAAKL,kBAAmB,OAAO;AAChD,MAAI,aAAa,OACf,QAAO;EAGT,MAAM,CAAC,MAAM,iBAAiB;AAE9B,SADe,MAAKE,UAAW,KAAK,MAAM,OAAO,CACnC,KAAK,OAAO,KAAK,MAAM,SAAS,cAAc;;CAG9D,SAAS,QAAyB;AAChC,MAAI,OAAO,WAAW,EACpB,QAAO;EAGT,MAAM,cAAc,kBAAkB,OAAO;EAC7C,IAAI,UAAU;EACd,IAAI,QAAQ;AACZ,QAAKI,qBAAsB,YAAY;AACrC,QAAK,IAAI,SAAS,QAAQ,OAAO,SAAS,QAAQ,KAAK,UAAU;IAC/D,MAAM,WAAW,QAAQ,KAAK,WAAW,OAAO;AAChD,WAAO,UAAU,KAAK,aAAa,OAAO,WAAW,QAAQ,CAC3D,WAAU,YAAY,UAAU;AAElC,QAAI,aAAa,OAAO,WAAW,QAAQ,CACzC;AAEF,QAAI,YAAY,OAAO,QAAQ;AAC7B,aAAQ;AACR,YAAO;;;AAGX,UAAO;IACP;AACF,SAAO;;CAGT,gCACE,QACA,UACoB;AACpB,MAAI,OAAO,WAAW,KAAK,OAAO,SAAS,MAAKP,OAC9C;EAGF,MAAM,SAAS,gBAAgB,UAAU,MAAKA,OAAQ;EACtD,MAAM,QAAQ,OAAO,QAAQ,KAAK,GAAG,SAAS,KAAK,IAAI,KAAK,IAAI,EAAE,EAAE;EACpE,MAAM,cAAc,kBAAkB,OAAO;EAC7C,IAAI,UAAU;EACd,IAAI,iBAAiB;EACrB,IAAIQ;EACJ,IAAIC;AAEJ,QAAKF,qBAAsB,YAAY;AACrC,QAAK,IAAI,SAAS,QAAQ,OAAO,SAAS,QAAQ,KAAK,UAAU;IAC/D,MAAM,WAAW,QAAQ,KAAK,WAAW,OAAO;AAChD,WAAO,UAAU,KAAK,aAAa,OAAO,WAAW,QAAQ,CAC3D,WAAU,YAAY,UAAU;AAElC,QAAI,aAAa,OAAO,WAAW,QAAQ,CACzC;AAEF,QAAI,YAAY,OAAO,QAAQ;KAC7B,MAAM,QAAQ,iBAAiB,OAAO,SAAS;AAC/C,SAAI,CAAC,cAAc,QAAQ,OAAO,QAAQ,OAAO,OAAO,EAAE;AACxD,UAAI,SAAS,OAAO;AAClB,qBAAc;AACd,cAAO;;AAET,wBAAkB;;AAEpB,eAAU,YAAY,UAAU;;AAElC;;AAEF,UAAO;IACP;AAEF,SAAO,eAAe;;CAGxB,OACE,MACA,cACA,OACgC;AAChC,MAAI,aAAa,KAAK,WAAW,KAAK,MAAKP,WAAY,EACrD,QAAO,EAAE;AAGX,MACE,aAAa,KAAK,SAAS,KAAK,IAChC,aAAa,KAAK,SAAS,KAAK,IAC/B,aAAa,UACX,aAAa,KAAK,SAAS,MAAM,IAChC,aAAa,KAAK,SAAS,MAAM,EAErC,QAAO,EAAE;EAGX,IAAIU;AACJ,MAAI;AACF,aAAU,oBACR,aAAa,MACb,aAAa,OACb,aAAa,cACd;UACK;AACN,UAAO,EAAE;;EAGX,MAAM,UAAU,MAAKC,+BACnB,SACA,aAAa,WACb,iBACD;AAED,MAAI,SAAS,aAAa,SAAS,aACjC,QAAO;EAGT,MAAM,cACJ,UAAU,SACN,IACA,SAAS,iBACP,KAAK,SAAS,OAAO,MAAM,GAC3B,KAAK,SAAS,OAAO,IAAI;AAEjC,MAAI,SAAS,gBAAgB;GAC3B,MAAM,YAAY,qCAAqC,QAAQ,MAC7D,KAAK,SAAS,EAAE,CACjB;GACD,IAAIC;AACJ,QAAK,MAAM,KAAK,QACd,KAAI,EAAE,MAAM,UACV,QAAO;OAEP;AAGJ,OAAI,SAAS,OACX,QAAO,CAAC,KAAK;GAEf,MAAM,OAAO,QAAQ,QAAQ,SAAS;AACtC,UAAO,SAAS,SAAY,CAAC,KAAK,GAAG,EAAE;;AAIzC,OAAK,MAAM,KAAK,QACd,KAAI,EAAE,MAAM,YACV,QAAO,CAAC,EAAE;EAGd,MAAM,QAAQ,QAAQ;AACtB,SAAO,UAAU,SAAY,CAAC,MAAM,GAAG,EAAE;;CAG3C,gCACE,SACA,WACA,OACoB;EACpB,MAAMC,MAA0B,EAAE;EAClC,MAAM,YAAY,MAAKb;EACvB,MAAM,UAAU,WAAmB,KAAK,OAAO,OAAO;AAEtD,OAAK,IAAI,OAAO,GAAG,OAAO,MAAKJ,WAAY,QAAQ;GACjD,MAAM,WAAW,KAAK,YAAY,KAAK;GACvC,MAAM,YAAY,KAAK,SAAS;IAAE;IAAM,WAAW;IAAG,CAAC;GACvD,MAAM,KAAK,IAAI,OAAO,QAAQ,QAAQ,QAAQ,MAAM;AACpD,MAAG,YAAY;GACf,IAAIkB;AACJ,WAAQ,QAAQ,GAAG,KAAK,SAAS,MAAM,MAAM;IAC3C,MAAM,MAAM,MAAM;IAClB,MAAM,WAAW,MAAM;AACvB,QAAI,SAAS,WAAW,GAAG;AACzB,QAAG,YAAY,sBAAsB,UAAU,IAAI;AACnD;;IAEF,MAAM,WAAW,YAAY;AAC7B,QACE,CAAC,aACD,wBAAwB,UAAU,SAAS,QAAQ,WAAW,OAAO,EACrE;AACA,SAAI,KAAK,CAAC,UAAU,WAAW,SAAS,OAAO,CAAC;AAChD,SAAI,IAAI,UAAU,MAChB,QAAO;;AAGX,QAAI,QAAQ,GAAG,UACb,IAAG,YAAY,sBAAsB,UAAU,IAAI;;;AAIzD,SAAO;;CAGT,OAAO,MAAc,QAAsB;AACzC,MAAI,KAAK,WAAW,EAClB;EAGF,MAAM,eAAe,MAAM,QAAQ,GAAG,MAAKd,OAAQ;EACnD,MAAM,YAAY,MAAKe,IAAK,OAAO,KAAK;EACxC,MAAM,gBAAgB,MAAKpB,YACzB,MAAM,OACN,WACA,KAAK,OACN;EACD,MAAM,SAAS,MAAKqB,QAAS;EAC7B,MAAMC,aAAsB,EAAE;EAE9B,IAAI,SAAS;EACb,IAAI,WAAW;AAEf,OAAK,MAAM,SAAS,QAAQ;GAC1B,MAAM,WAAW,SAAS,MAAM;AAChC,OAAI,CAAC,YAAY,gBAAgB,UAAU;IACzC,MAAM,cAAc,eAAe;AACnC,QAAI,cAAc,EAChB,YAAW,KACT,MAAKtB,YAAa,MAAM,QAAQ,MAAM,QAAQ,YAAY,CAC3D;AAEH,eAAW,KAAK,cAAc;AAC9B,QAAI,cAAc,MAAM,OACtB,YAAW,KACT,MAAKA,YACH,MAAM,QACN,MAAM,SAAS,aACf,MAAM,SAAS,YAChB,CACF;AAEH,eAAW;SAEX,YAAW,KAAK,MAAM;AAExB,YAAS;;AAGX,MAAI,CAAC,SACH,YAAW,KAAK,cAAc;AAGhC,QAAKD,UAAW,WAAW;AAC3B,QAAKI,kBAAmB;;CAG1B,OAAO,QAAgB,QAAsB;AAC3C,MAAI,UAAU,KAAK,MAAKE,WAAY,EAClC;EAGF,MAAM,QAAQ,MAAM,QAAQ,GAAG,MAAKA,OAAQ;EAC5C,MAAM,MAAM,MAAM,QAAQ,QAAQ,OAAO,MAAKA,OAAQ;AACtD,MAAI,UAAU,IACZ;EAGF,MAAMiB,aAAsB,EAAE;EAC9B,IAAI,SAAS;AACb,OAAK,MAAM,SAAS,MAAKD,QAAS,EAAE;GAClC,MAAM,aAAa;GACnB,MAAM,WAAW,SAAS,MAAM;GAChC,MAAM,aAAa,MAAM,QAAQ,YAAY,GAAG,MAAM,OAAO;GAC7D,MAAM,YAAY,MAAM,WAAW,KAAK,GAAG,MAAM,OAAO;AAExD,OAAI,aAAa,EACf,YAAW,KACT,MAAKrB,YAAa,MAAM,QAAQ,MAAM,QAAQ,WAAW,CAC1D;AAEH,OAAI,YAAY,EACd,YAAW,KACT,MAAKA,YACH,MAAM,QACN,MAAM,SAAS,MAAM,SAAS,WAC9B,UACD,CACF;AAEH,YAAS;;AAGX,QAAKD,UAAW,WAAW;AAC3B,QAAKI,kBAAmB;;CAG1B,WAAW,OAA0C;AACnD,MAAI,MAAM,WAAW,EACnB;EAGF,IAAI,aAAa;EACjB,IAAI,aAAa;EACjB,IAAI,aAAa;EAEjB,MAAM,SAAS,MAAKkB,QAAS;EAC7B,MAAM,iBAAiB,MAAM,KAAK,SAChC,KAAK,KAAK,WAAW,IACjB,SACA,MAAKrB,YACH,MAAM,OACN,MAAKoB,IAAK,OAAO,KAAK,KAAK,EAC3B,KAAK,KAAK,OACX,CACN;EACD,MAAME,aAAsB,EAAE;EAE9B,MAAM,qBAAqB;GACzB,MAAM,QAAQ,OAAO;AACrB,OAAI,UAAU,QAAW;AACvB,kBAAc,MAAM;AACpB;;;EAIJ,MAAM,eAAe,OAAe,QAAgB;GAClD,IAAI,aAAa,MAAM,OAAO,GAAG,MAAKjB,OAAQ;GAC9C,MAAM,WAAW,MAAM,KAAK,YAAY,MAAKA,OAAQ;AACrD,UACE,aAAa,OAAO,UACpB,aAAa,OAAO,YAAY,UAAU,WAE1C,eAAc;AAEhB,UAAO,aAAa,OAAO,UAAU,aAAa,UAAU;IAC1D,MAAM,QAAQ,OAAO;IACrB,MAAM,WAAW,aAAa,MAAM;IACpC,MAAM,gBAAgB,MAAM,aAAa,YAAY,GAAG,MAAM,OAAO;IACrE,MAAM,UAAU,KAAK,IAAI,UAAU,SAAS;IAC5C,MAAM,aAAa,WAAW,aAAa;AAC3C,QAAI,aAAa,EACf,YAAW,KACT,kBAAkB,KAAK,eAAe,MAAM,SACxC,QACA,MAAKL,YACH,MAAM,QACN,MAAM,SAAS,eACf,WACD,CACN;AAEH,iBAAa;AACb,QAAI,cAAc,SAChB,eAAc;;;AAKpB,OAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;GACrC,MAAM,OAAO,MAAM;GACnB,MAAM,QAAQ,MAAM,KAAK,OAAO,YAAY,MAAKK,OAAQ;GACzD,MAAM,MAAM,MAAM,KAAK,KAAK,OAAO,MAAKA,OAAQ;AAChD,eAAY,YAAY,MAAM;GAE9B,MAAM,gBAAgB,eAAe;AACrC,OAAI,kBAAkB,OACpB,YAAW,KAAK,cAAc;AAEhC,gBAAa;;AAEf,cAAY,YAAY,MAAKA,OAAQ;AAErC,QAAKN,UAAW,WAAW;AAC3B,QAAKI,kBAAmB;;CAG1B,WAAW,QAA0B;EACnC,MAAM,gBAAgB,MAAM,QAAQ,GAAG,MAAKE,OAAQ;AACpD,MAAI,MAAKA,WAAY,EACnB,QAAO;GAAE,MAAM;GAAG,WAAW;GAAG;EAElC,MAAM,OAAO,MAAKkB,aAAc,cAAc;AAE9C,SAAO;GACL;GACA,WAAW,iBAHK,SAAS,IAAI,IAAI,MAAKC,gBAAiB,OAAO,EAAE;GAIjE;;CAGH,YAAY,SAAwC;EAClD,MAAMC,YAAwB,MAAM,KAAK,EAAE,QAAQ,QAAQ,QAAQ,CAAC;AACpE,MAAI,QAAQ,WAAW,EACrB,QAAO;AAET,MAAI,MAAKpB,WAAY,EACnB,QAAO,UAAU,KAAK;GAAE,MAAM;GAAG,WAAW;GAAG,CAAC;AAGlD,OAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,IAClC,WAAU,KAAK,KAAK,WAAW,QAAQ,GAAG;AAG5C,SAAO;;CAGT,SAAS,UAA4B;AACnC,MAAI,SAAS,OAAO,KAAK,MAAKA,WAAY,EACxC,QAAO;AAET,MAAI,SAAS,QAAQ,MAAKJ,UACxB,OAAM,IAAI,MAAM,4BAA4B,SAAS,OAAO;EAE9D,MAAM,SAAS,MAAKG,cAAe,SAAS,KAAK;AACjD,MAAI,WAAW,OACb,OAAM,IAAI,MAAM,4BAA4B,SAAS,OAAO;EAE9D,MAAM,YAAY,MAAM,SAAS,WAAW,GAAG,OAAO,KAAK,OAAO,GAAG;AACrE,SAAO,OAAO,KAAK;;CAGrB,UAAU,WAA0C;EAClD,MAAMsB,UAAoB,MAAM,KAAK,EAAE,QAAQ,UAAU,QAAQ,CAAC;AAClE,MAAI,UAAU,WAAW,EACvB,QAAO;AAET,MAAI,MAAKrB,WAAY,EACnB,QAAO,QAAQ,KAAK,EAAE;AAGxB,OAAK,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,IACpC,SAAQ,KAAK,KAAK,SAAS,UAAU,GAAG;AAG1C,SAAO;;CAGT,mBACE,QACsD;AACtD,MAAI,SAAS,KAAK,UAAU,MAAKA,OAC/B;EAGF,IAAI,OAAO,MAAKsB;EAChB,IAAI,YAAY;AAChB,SAAO,SAAS,MAAM;GACpB,MAAM,aAAa,KAAK,MAAM,iBAAiB;AAC/C,OAAI,YAAY,YAAY;AAC1B,WAAO,KAAK;AACZ;;AAGF,gBAAa;AACb,OAAI,YAAY,KAAK,MAAM,OACzB,QAAO,CAAC,MAAM,UAAU;AAG1B,gBAAa,KAAK,MAAM;AACxB,UAAO,KAAK;;;CAMhB,UAAU,MAAmC;AAC3C,MAAI,KAAK,UAAU,MAAM;GACvB,IAAI,OAAO,KAAK;AAChB,UAAO,KAAK,SAAS,KACnB,QAAO,KAAK;AAEd,UAAO;;EAGT,IAAI,UAAU;AACd,SAAO,QAAQ,WAAW,QAAQ,YAAY,QAAQ,OAAO,MAC3D,WAAU,QAAQ;AAEpB,SAAO,QAAQ;;CAGjB,eAAe,MAAwD;AACrE,MAAI,OAAO,EACT,OAAM,IAAI,MAAM,4BAA4B,OAAO;AAErD,MAAI,MAAKtB,WAAY,GAAG;AACtB,OAAI,SAAS,EACX,QAAO,CAAC,GAAG,EAAE;AAEf,SAAM,IAAI,MAAM,4BAA4B,OAAO;;AAErD,MAAI,QAAQ,MAAKJ,UACf,OAAM,IAAI,MAAM,4BAA4B,OAAO;AAMrD,SAAO,CAHO,SAAS,IAAI,IAAI,MAAKuB,gBAAiB,OAAO,EAAE,EAE5D,OAAO,MAAKvB,YAAa,IAAI,MAAKuB,gBAAiB,KAAK,GAAG,MAAKnB,OAC/C;;CAGrB,cAAc,QAAwB;EACpC,IAAI,OAAO,MAAKsB;EAChB,IAAI,YAAY,MAAM,QAAQ,GAAG,MAAKtB,OAAQ;EAC9C,IAAI,OAAO;AAEX,SAAO,SAAS,MAAM;GACpB,MAAM,aAAa,KAAK,MAAM,iBAAiB;AAC/C,OAAI,YAAY,YAAY;AAC1B,WAAO,KAAK;AACZ;;AAGF,WAAQ,KAAK,MAAM,yBAAyB;AAC5C,gBAAa;AACb,OAAI,aAAa,KAAK,MAAM,QAAQ;IAClC,MAAM,SAAS,MAAKG,UAAW,KAAK,MAAM,OAAO;AACjD,YACE,WAAW,OAAO,aAAa,KAAK,MAAM,SAAS,UAAU,GAC7D,KAAK,MAAM;AACb,WAAO;;AAGT,WAAQ,KAAK,MAAM;AACnB,gBAAa,KAAK,MAAM;AACxB,UAAO,KAAK;;AAGd,SAAO,MAAKP,YAAa;;CAG3B,iBAAiB,gBAAgC;EAC/C,IAAI,OAAO,MAAK0B;EAChB,IAAI,YAAY;EAChB,IAAI,iBAAiB;AAErB,SAAO,SAAS,MAAM;GACpB,MAAM,qBAAqB,KAAK,MAAM,yBAAyB;AAC/D,OAAI,YAAY,oBAAoB;AAClC,WAAO,KAAK;AACZ;;GAGF,MAAM,aAAa,KAAK,MAAM,iBAAiB;AAC/C,qBAAkB;AAClB,gBAAa;AAEb,OAAI,YAAY,KAAK,MAAM,gBAAgB;IACzC,MAAM,mBAAmB,MAAKnB,UAAW,KAAK,MAAM,OAAO,CAAC,YAC1D,KAAK,MAAM,kBAAkB;AAE/B,WAAO,kBAAkB,mBAAmB,KAAK,MAAM;;AAGzD,qBAAkB,KAAK,MAAM;AAC7B,gBAAa,KAAK,MAAM;AACxB,UAAO,KAAK;;AAGd,SAAO,MAAKH;;CAGd,kBAA0B;EACxB,MAAME,SAAmB,EAAE;AAC3B,QAAKK,qBAAsB,YAAY;AACrC,UAAO,KAAK,QAAQ,KAAK,MAAM,QAAQ,OAAO,QAAQ,IAAI,CAAC;IAC3D;AACF,SAAO,OAAO,KAAK,GAAG;;CAGxB,qBACE,UAQM;AACN,QAAKgB,KAAM,MAAKD,OAAQ,SAAS;GAC/B,MAAM,SAAS,MAAKnB,UAAW,KAAK,MAAM,OAAO;AACjD,UAAO,SAAS;IACd,MAAM,OAAO;IACb,aAAa,OAAO;IACpB,iBAAiB,KAAK,MAAM;IAC5B,eAAe,KAAK,MAAM;IAC1B,OAAO,KAAK,MAAM;IAClB,KAAK,KAAK,MAAM,SAAS,KAAK,MAAM;IACrC,CAAC;IACF;;CAGJ,WAAW,QAA4B;AACrC,SAAO,WAAW,MAAM,WAAW,MAAKV,WAAY,MAAKsB;;CAG3D,aAAa,QAAgB,QAAgB,QAAuB;EAClE,MAAM,SAAS,MAAKZ,UAAW,OAAO;AACtC,SAAO,IAAI,MACT,QACA,QACA,QACA,WAAW,OAAO,aAAa,OAAO,EACtC,WAAW,OAAO,aAAa,SAAS,OAAO,CAChD;;CAGH,UAAmB;AACjB,SAAO,MAAKqB;;CAGd,WAAW,QAAuB;EAChC,MAAM,kBAAkB,eAAe,OAAO;AAC9C,QAAKA,cAAe;EACpB,IAAI,SAAS;EACb,IAAI,iBAAiB;AACrB,OAAK,MAAM,SAAS,iBAAiB;AACnC,aAAU,MAAM;AAChB,qBAAkB,MAAM;;AAE1B,QAAKF,OAAQ,MAAKG,kBAChB,iBACA,GACA,gBAAgB,QAChB,KACD;AACD,QAAKzB,SAAU;AACf,QAAKJ,YAAa,iBAAiB;;CAGrC,mBACE,QACA,OACA,KACA,QACkB;AAClB,MAAI,SAAS,IACX,QAAO;EAGT,MAAM,SAAS,QAAQ,KAAK,OAAO,MAAM,SAAS,EAAE;EACpD,MAAM,OAAO,IAAI,UAAU,OAAO,QAAQ;AAC1C,OAAK,SAAS;AACd,OAAK,OAAO,MAAK6B,kBAAmB,QAAQ,OAAO,QAAQ,KAAK;AAChE,OAAK,QAAQ,MAAKA,kBAAmB,QAAQ,SAAS,GAAG,KAAK,KAAK;AACnE,OAAK,qBAAqB;AAC1B,SAAO;;CAGT,MACE,MACA,OACS;AACT,MAAI,SAAS,KACX,QAAO;AAET,MAAI,CAAC,MAAKF,KAAM,KAAK,MAAM,MAAM,CAC/B,QAAO;AAET,MAAI,MAAM,KAAK,KAAK,MAClB,QAAO;AAET,SAAO,MAAKA,KAAM,KAAK,OAAO,MAAM;;;AAIxC,SAAS,MAAM,UAA2B;AACxC,QAAO,aAAsB,MAAM,aAAsB;;AAG3D,SAAS,MAAM,OAAe,KAAa,KAAqB;AAC9D,QAAO,KAAK,IAAI,KAAK,IAAI,OAAO,IAAI,EAAE,IAAI;;AAG5C,SAAS,kBAAkB,MAAwB;CACjD,MAAM,QAAQ,MAAM,KAAa,EAAE,QAAQ,KAAK,QAAQ,CAAC,CAAC,KAAK,EAAE;CACjE,IAAI,UAAU;AACd,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;EACpC,MAAM,WAAW,KAAK,WAAW,EAAE;AACnC,SAAO,UAAU,KAAK,aAAa,KAAK,WAAW,QAAQ,CACzD,WAAU,MAAM,UAAU;AAE5B,MAAI,aAAa,KAAK,WAAW,QAAQ,CACvC;AAEF,QAAM,KAAK;;AAEb,QAAO;;AAGT,SAAS,gBACP,QACA,QACgC;CAChC,MAAMG,aAA6C,EAAE;AACrD,MAAK,MAAM,CAAC,UAAU,WAAW,QAAQ;EACvC,MAAM,QAAQ,MAAM,UAAU,GAAG,OAAO;EACxC,MAAM,MAAM,MAAM,QAAQ,OAAO,OAAO;AACxC,MAAI,QAAQ,IACV,YAAW,KAAK,CAAC,OAAO,IAAI,CAAC;;AAGjC,YAAW,MAAM,GAAG,MAAM,EAAE,KAAK,EAAE,GAAG;CAEtC,MAAMC,SAAyC,EAAE;AACjD,MAAK,MAAM,SAAS,YAAY;EAC9B,MAAM,WAAW,OAAO,OAAO,SAAS;AACxC,MAAI,aAAa,UAAa,MAAM,MAAM,SAAS,IAAI;AACrD,YAAS,KAAK,KAAK,IAAI,SAAS,IAAI,MAAM,GAAG;AAC7C;;AAEF,SAAO,KAAK,MAAM;;AAEpB,QAAO;;AAGT,SAAS,cACP,QACA,OACA,KACS;CACT,IAAI,MAAM;CACV,IAAI,OAAO,OAAO;AAClB,QAAO,MAAM,MAAM;EACjB,MAAM,MAAM,MAAM,KAAK,OAAO,OAAO,OAAO,EAAE;AAC9C,MAAI,OAAO,KAAK,MAAM,MACpB,OAAM,MAAM;MAEZ,QAAO;;CAIX,MAAM,QAAQ,OAAO;AACrB,QAAO,UAAU,UAAa,MAAM,KAAK;;AAK3C,SAAS,eAAe,QAA0B;CAChD,MAAMC,kBAA2B,EAAE;AACnC,MAAK,MAAM,SAAS,QAAQ;AAC1B,MAAI,MAAM,WAAW,EACnB;EAGF,MAAM,WAAW,gBAAgB,gBAAgB,SAAS;AAC1D,MACE,aAAa,UACb,SAAS,WAAW,MAAM,UAC1B,SAAS,SAAS,SAAS,WAAW,MAAM,QAC5C;AACA,mBAAgB,gBAAgB,SAAS,KAAK,IAAI,MAChD,SAAS,QACT,SAAS,QACT,SAAS,SAAS,MAAM,QACxB,SAAS,iBACT,MAAM,cACP;AACD;;AAGF,kBAAgB,KAAK,MAAM;;AAE7B,QAAO;;AAIT,SAAS,WAAW,QAAkB,QAAwB;CAC5D,IAAI,KAAK;CACT,IAAI,KAAK,OAAO;AAChB,QAAO,KAAK,IAAI;EACd,MAAM,MAAM,KAAK,KAAK,OAAO,KAAK,MAAM,EAAE;AAC1C,MAAI,OAAO,QAAQ,OACjB,MAAK,MAAM;MAEX,MAAK;;AAGT,QAAO;;AAGT,SAAS,aAAa,MAAsB;AAC1C,QAAO,KAAK,QAAQ,uBAAuB,OAAO;;AAGpD,SAAS,wBAAwB,UAA2B;AAC1D,KAAI,YAAY,MAAM,aAAa,IACjC,QAAO;CAET,MAAM,KAAK,OAAO,aAAa,SAAS;AACxC,QAAO,gBAAgB,SAAS,GAAG;;AAKrC,SAAS,wBACP,UACA,QACA,WACA,QACS;CACT,MAAM,WACJ,YAAY,KACZ,wBAAwB,eAAe,QAAQ,WAAW,EAAE,CAAC;CAC/D,MAAM,UACJ,WAAW,UAAU,aACrB,wBAAwB,eAAe,QAAQ,WAAW,OAAO,CAAC;AACpE,QAAO,YAAY;;AAGrB,SAAS,eACP,QACA,QACQ;CACR,MAAM,OAAO,OAAO,OAAO;AAC3B,QAAO,KAAK,WAAW,IAAI,IAAI,KAAK,WAAW,EAAE;;AAGnD,SAAS,oBACP,QACA,SACA,eACQ;CACR,MAAM,OAAO,UAAU,SAAS,aAAa,OAAO;CACpD,MAAM,QAAQ,IAAI,gBAAgB,KAAK,MAAM,UAAU,MAAM;AAC7D,QAAO,IAAI,OAAO,MAAM,MAAM;;AAGhC,SAAS,sBAAsB,MAAc,OAAuB;AAClE,KAAI,QAAQ,IAAI,KAAK,QAAQ;EAC3B,MAAM,QAAQ,KAAK,WAAW,MAAM;EACpC,MAAM,SAAS,KAAK,WAAW,QAAQ,EAAE;AACzC,MACE,SAAS,SACT,SAAS,SACT,UAAU,SACV,UAAU,MAEV,QAAO,QAAQ;;AAGnB,QAAO,QAAQ;;AAKjB,SAAS,qCACP,WACA,UACQ;AACR,KAAI,cAAc,OAChB,QAAO;CAET,MAAM,IAAI,SAAS,UAAU,MAAM;CACnC,MAAM,IAAI,SAAS,UAAU,IAAI;AACjC,QAAO,KAAK,IAAI,GAAG,EAAE"}
+{"version":3,"file":"pieceTable.js","names":["source: number","offset: number","length: number","lineOffsetStart: number","lineOffsetEnd: number","text: string","piece: Piece","subtreeLength: number","subtreeLineBreakCount: number","#original","#setPieces","#createPiece","#lineCount","#textFromPieces","#lastVisitedLine","#getLineOffset","#lastVisitedLineLength","length","#length","#findPieceAtOffset","chunks: string[]","#bufferFor","start","end","#nextNode","#forEachPieceSegment","wrappedOffset: number | undefined","foundOffset: number | undefined","pattern: RegExp","#collectSearchMatchesLineByLine","out: [number, number][]","match: RegExpExecArray | null","#add","#pieces","nextPieces: Piece[]","#lineAtOffset","#lineBreakOffset","positions: Position[]","#root","#walk","#piecesCache","#buildBalancedTree","normalized: [start: number, end: number][]","merged: [start: number, end: number][]","coalescedPieces: Piece[]"],"sources":["../../src/editor/pieceTable.ts"],"sourcesContent":["import { computeLineOffsets } from '../utils/computeFileOffsets';\nimport type { SearchParams } from './searchPanel';\nimport type { Position, Range, ResolvedTextEdit } from './textDocument';\n\nconst MAX_FIND_MATCHES = 100000;\n// TODO(ije): use Intl.Segmenter instead of regex for word separators\nconst WORD_SEPARATORS = '`~!@#$%^&*()-=+[{]}\\\\|;:\\'\",.<>/?' as const;\n\n// A piece is a segment of text that is either original or added.\nclass Piece {\n  static Original = 0;\n  static Added = 1;\n\n  constructor(\n    public readonly source: number,\n    public readonly offset: number,\n    public readonly length: number,\n    public readonly lineOffsetStart: number,\n    public readonly lineOffsetEnd: number\n  ) {}\n\n  get lineBreakCount(): number {\n    return this.lineOffsetEnd - this.lineOffsetStart;\n  }\n}\n\n// A text buffer is a string with its line offsets.\nclass TextBuffer {\n  lineOffsets: number[];\n\n  constructor(public text: string) {\n    this.lineOffsets = computeLineOffsets(text);\n  }\n\n  // the append operation is efficient because it only appends\n  // elements to the lineOffsets array in the end\n  append(text: string): number {\n    const offset = this.text.length;\n    const appendedLineOffsets = computeLineOffsets(text);\n    for (let i = 1; i < appendedLineOffsets.length; i++) {\n      this.lineOffsets.push(offset + appendedLineOffsets[i]);\n    }\n    this.text += text;\n    return offset;\n  }\n}\n\n// A node in the balanced piece tree.\nclass PieceNode {\n  left: PieceNode | null = null;\n  right: PieceNode | null = null;\n  parent: PieceNode | null = null;\n\n  constructor(\n    public piece: Piece,\n    public subtreeLength: number = piece.length,\n    public subtreeLineBreakCount: number = piece.lineBreakCount\n  ) {}\n\n  updateSubtreeLength(): void {\n    this.subtreeLength =\n      (this.left?.subtreeLength ?? 0) +\n      this.piece.length +\n      (this.right?.subtreeLength ?? 0);\n    this.subtreeLineBreakCount =\n      (this.left?.subtreeLineBreakCount ?? 0) +\n      this.piece.lineBreakCount +\n      (this.right?.subtreeLineBreakCount ?? 0);\n  }\n}\n\n/**\n * A piece table is a data structure that allows for efficient insertion and deletion of text.\n * It is a tree of pieces, where each piece is a segment of text that is either original or added.\n * The tree is rebuilt as a balanced tree after edits to keep lookups efficient.\n * Inspired by https://code.visualstudio.com/blogs/2018/03/23/text-buffer-reimplementation\n */\nexport class PieceTable {\n  #original: TextBuffer;\n  #add = new TextBuffer('');\n  #root: PieceNode | null = null;\n  #piecesCache: Piece[] = [];\n  #length = 0;\n  #lineCount = 0;\n  #lastVisitedLine: [number, boolean, string] | null = null;\n  #lastVisitedLineLength: [number, boolean, number] | null = null;\n\n  constructor(originalText: string) {\n    this.#original = new TextBuffer(originalText);\n    this.#setPieces([\n      this.#createPiece(Piece.Original, 0, originalText.length),\n    ]);\n  }\n\n  get lineCount(): number {\n    return this.#lineCount;\n  }\n\n  getText(range?: Range): string {\n    if (range === undefined) {\n      return this.#textFromPieces();\n    }\n    const start = this.offsetAt(range.start);\n    const end = this.offsetAt(range.end);\n    return this.getTextSlice(start, end);\n  }\n\n  getLineText(line: number, includeLineBreak = false): string {\n    if (\n      this.#lastVisitedLine !== null &&\n      this.#lastVisitedLine[0] === line &&\n      this.#lastVisitedLine[1] === includeLineBreak\n    ) {\n      return this.#lastVisitedLine[2];\n    }\n    const offset = this.#getLineOffset(line);\n    if (offset === undefined) {\n      throw new Error(`Line index out of range: ${line}`);\n    }\n    const text = this.getTextSlice(offset[0], offset[1], !includeLineBreak);\n    this.#lastVisitedLine = [line, includeLineBreak, text];\n    this.#lastVisitedLineLength = [line, includeLineBreak, text.length];\n    return text;\n  }\n\n  getLineLength(line: number, includeLineBreak = false): number {\n    const lastVisitedLineLength = this.#lastVisitedLineLength;\n    const lastVisitedLine = this.#lastVisitedLine;\n    if (\n      lastVisitedLineLength !== null &&\n      lastVisitedLineLength[0] === line &&\n      lastVisitedLineLength[1] === includeLineBreak\n    ) {\n      return lastVisitedLineLength[2];\n    }\n    if (\n      lastVisitedLine !== null &&\n      lastVisitedLine[0] === line &&\n      lastVisitedLine[1] === includeLineBreak\n    ) {\n      const length = lastVisitedLine[2].length;\n      this.#lastVisitedLineLength = [line, includeLineBreak, length];\n      return length;\n    }\n    const offset = this.#getLineOffset(line);\n    if (offset === undefined) {\n      throw new Error(`Line index out of range: ${line}`);\n    }\n    const [start, end] = offset;\n    let length = end - start;\n    if (!includeLineBreak) {\n      while (\n        length > 0 &&\n        isEOL(this.charAt(start + length - 1).charCodeAt(0))\n      ) {\n        length--;\n      }\n    }\n    this.#lastVisitedLineLength = [line, includeLineBreak, length];\n    return length;\n  }\n\n  getTextSlice(start: number, end: number, trimEOF = false): string {\n    if (start >= end) {\n      return '';\n    }\n\n    const sliceStart = clamp(start, 0, this.#length);\n    const sliceEnd = clamp(end, sliceStart, this.#length);\n    if (sliceStart >= sliceEnd) {\n      return '';\n    }\n\n    const location = this.#findPieceAtOffset(sliceStart);\n    if (location === undefined) {\n      return '';\n    }\n\n    const chunks: string[] = [];\n    let [node, offsetInPiece] = location as [PieceNode | null, number];\n    let remaining = sliceEnd - sliceStart;\n    while (node !== null && remaining > 0) {\n      const takeLength = Math.min(node.piece.length - offsetInPiece, remaining);\n      const buffer = this.#bufferFor(node.piece.source);\n      const start = node.piece.offset + offsetInPiece;\n      let end = start + takeLength;\n      if (trimEOF) {\n        while (end > start && isEOL(buffer.text.charCodeAt(end - 1))) {\n          end--;\n        }\n      }\n      chunks.push(buffer.text.slice(start, end));\n      remaining -= takeLength;\n      offsetInPiece = 0;\n      node = this.#nextNode(node);\n    }\n\n    return chunks.join('');\n  }\n\n  charAt(offset: number): string {\n    const location = this.#findPieceAtOffset(offset);\n    if (location === undefined) {\n      return '';\n    }\n\n    const [node, offsetInPiece] = location;\n    const buffer = this.#bufferFor(node.piece.source);\n    return buffer.text.charAt(node.piece.offset + offsetInPiece);\n  }\n\n  includes(needle: string): boolean {\n    if (needle.length === 0) {\n      return true;\n    }\n\n    const prefixTable = createPrefixTable(needle);\n    let matched = 0;\n    let found = false;\n    this.#forEachPieceSegment((segment) => {\n      for (let offset = segment.start; offset < segment.end; offset++) {\n        const charCode = segment.text.charCodeAt(offset);\n        while (matched > 0 && charCode !== needle.charCodeAt(matched)) {\n          matched = prefixTable[matched - 1];\n        }\n        if (charCode === needle.charCodeAt(matched)) {\n          matched++;\n        }\n        if (matched === needle.length) {\n          found = true;\n          return false;\n        }\n      }\n      return true;\n    });\n    return found;\n  }\n\n  findNextNonOverlappingSubstring(\n    needle: string,\n    occupied: readonly [start: number, end: number][]\n  ): number | undefined {\n    if (needle.length === 0 || needle.length > this.#length) {\n      return undefined;\n    }\n\n    const ranges = normalizeRanges(occupied, this.#length);\n    const pivot = ranges.reduce((max, [, end]) => Math.max(max, end), 0);\n    const prefixTable = createPrefixTable(needle);\n    let matched = 0;\n    let documentOffset = 0;\n    let wrappedOffset: number | undefined;\n    let foundOffset: number | undefined;\n\n    this.#forEachPieceSegment((segment) => {\n      for (let offset = segment.start; offset < segment.end; offset++) {\n        const charCode = segment.text.charCodeAt(offset);\n        while (matched > 0 && charCode !== needle.charCodeAt(matched)) {\n          matched = prefixTable[matched - 1];\n        }\n        if (charCode === needle.charCodeAt(matched)) {\n          matched++;\n        }\n        if (matched === needle.length) {\n          const start = documentOffset - needle.length + 1;\n          if (!rangeOverlaps(ranges, start, start + needle.length)) {\n            if (start >= pivot) {\n              foundOffset = start;\n              return false;\n            }\n            wrappedOffset ??= start;\n          }\n          matched = prefixTable[matched - 1];\n        }\n        documentOffset++;\n      }\n      return true;\n    });\n\n    return foundOffset ?? wrappedOffset;\n  }\n\n  search(searchParams: SearchParams): [start: number, end: number][] {\n    if (searchParams.text.length === 0 || this.#length === 0) {\n      return [];\n    }\n\n    // Search currently operates line-by-line, so newline-spanning patterns are unsupported.\n    if (\n      searchParams.text.includes('\\n') ||\n      searchParams.text.includes('\\r') ||\n      (searchParams.regex &&\n        (searchParams.text.includes('\\\\n') ||\n          searchParams.text.includes('\\\\r')))\n    ) {\n      return [];\n    }\n\n    let pattern: RegExp;\n    try {\n      pattern = compileSearchRegExp(\n        searchParams.text,\n        searchParams.regex,\n        searchParams.caseSensitive\n      );\n    } catch {\n      return [];\n    }\n\n    return this.#collectSearchMatchesLineByLine(\n      pattern,\n      searchParams.wholeWord,\n      MAX_FIND_MATCHES\n    );\n  }\n\n  #collectSearchMatchesLineByLine(\n    pattern: RegExp,\n    wholeWord: boolean,\n    limit: number\n  ): [number, number][] {\n    const out: [number, number][] = [];\n    const docLength = this.#length;\n    const charAt = (offset: number) => this.charAt(offset);\n\n    for (let line = 0; line < this.#lineCount; line++) {\n      const lineText = this.getLineText(line);\n      const lineStart = this.offsetAt({ line, character: 0 });\n      const re = new RegExp(pattern.source, pattern.flags);\n      re.lastIndex = 0;\n      let match: RegExpExecArray | null;\n      while ((match = re.exec(lineText)) !== null) {\n        const rel = match.index;\n        const fragment = match[0];\n        if (fragment.length === 0) {\n          re.lastIndex = advancePastEmptyMatch(lineText, rel);\n          continue;\n        }\n        const docStart = lineStart + rel;\n        if (\n          !wholeWord ||\n          isWholeWordAtDocOffsets(docStart, fragment.length, docLength, charAt)\n        ) {\n          out.push([docStart, docStart + fragment.length]);\n          if (out.length >= limit) {\n            return out;\n          }\n        }\n        if (rel === re.lastIndex) {\n          re.lastIndex = advancePastEmptyMatch(lineText, rel);\n        }\n      }\n    }\n    return out;\n  }\n\n  insert(text: string, offset: number): void {\n    if (text.length === 0) {\n      return;\n    }\n\n    const insertOffset = clamp(offset, 0, this.#length);\n    const addOffset = this.#add.append(text);\n    const insertedPiece = this.#createPiece(\n      Piece.Added,\n      addOffset,\n      text.length\n    );\n    const pieces = this.#pieces();\n    const nextPieces: Piece[] = [];\n\n    let cursor = 0;\n    let inserted = false;\n\n    for (const piece of pieces) {\n      const pieceEnd = cursor + piece.length;\n      if (!inserted && insertOffset <= pieceEnd) {\n        const splitOffset = insertOffset - cursor;\n        if (splitOffset > 0) {\n          nextPieces.push(\n            this.#createPiece(piece.source, piece.offset, splitOffset)\n          );\n        }\n        nextPieces.push(insertedPiece);\n        if (splitOffset < piece.length) {\n          nextPieces.push(\n            this.#createPiece(\n              piece.source,\n              piece.offset + splitOffset,\n              piece.length - splitOffset\n            )\n          );\n        }\n        inserted = true;\n      } else {\n        nextPieces.push(piece);\n      }\n      cursor = pieceEnd;\n    }\n\n    if (!inserted) {\n      nextPieces.push(insertedPiece);\n    }\n\n    this.#setPieces(nextPieces);\n    this.#lastVisitedLine = null;\n    this.#lastVisitedLineLength = null;\n  }\n\n  delete(offset: number, length: number): void {\n    if (length <= 0 || this.#length === 0) {\n      return;\n    }\n\n    const start = clamp(offset, 0, this.#length);\n    const end = clamp(start + length, start, this.#length);\n    if (start === end) {\n      return;\n    }\n\n    const nextPieces: Piece[] = [];\n    let cursor = 0;\n    for (const piece of this.#pieces()) {\n      const pieceStart = cursor;\n      const pieceEnd = cursor + piece.length;\n      const keepBefore = clamp(start - pieceStart, 0, piece.length);\n      const keepAfter = clamp(pieceEnd - end, 0, piece.length);\n\n      if (keepBefore > 0) {\n        nextPieces.push(\n          this.#createPiece(piece.source, piece.offset, keepBefore)\n        );\n      }\n      if (keepAfter > 0) {\n        nextPieces.push(\n          this.#createPiece(\n            piece.source,\n            piece.offset + piece.length - keepAfter,\n            keepAfter\n          )\n        );\n      }\n      cursor = pieceEnd;\n    }\n\n    this.#setPieces(nextPieces);\n    this.#lastVisitedLine = null;\n    this.#lastVisitedLineLength = null;\n  }\n\n  applyEdits(edits: readonly ResolvedTextEdit[]): void {\n    if (edits.length === 0) {\n      return;\n    }\n\n    let pieceIndex = 0;\n    let pieceStart = 0;\n    let copyCursor = 0;\n\n    const pieces = this.#pieces();\n    const insertedPieces = edits.map((edit) =>\n      edit.text.length === 0\n        ? undefined\n        : this.#createPiece(\n            Piece.Added,\n            this.#add.append(edit.text),\n            edit.text.length\n          )\n    );\n    const nextPieces: Piece[] = [];\n\n    const advancePiece = () => {\n      const piece = pieces[pieceIndex];\n      if (piece !== undefined) {\n        pieceStart += piece.length;\n        pieceIndex++;\n      }\n    };\n\n    const appendRange = (start: number, end: number) => {\n      let rangeStart = clamp(start, 0, this.#length);\n      const rangeEnd = clamp(end, rangeStart, this.#length);\n      while (\n        pieceIndex < pieces.length &&\n        pieceStart + pieces[pieceIndex].length <= rangeStart\n      ) {\n        advancePiece();\n      }\n      while (pieceIndex < pieces.length && rangeStart < rangeEnd) {\n        const piece = pieces[pieceIndex];\n        const pieceEnd = pieceStart + piece.length;\n        const offsetInPiece = clamp(rangeStart - pieceStart, 0, piece.length);\n        const takeEnd = Math.min(pieceEnd, rangeEnd);\n        const takeLength = takeEnd - (pieceStart + offsetInPiece);\n        if (takeLength > 0) {\n          nextPieces.push(\n            offsetInPiece === 0 && takeLength === piece.length\n              ? piece\n              : this.#createPiece(\n                  piece.source,\n                  piece.offset + offsetInPiece,\n                  takeLength\n                )\n          );\n        }\n        rangeStart = takeEnd;\n        if (rangeStart >= pieceEnd) {\n          advancePiece();\n        }\n      }\n    };\n\n    for (let i = 0; i < edits.length; i++) {\n      const edit = edits[i];\n      const start = clamp(edit.start, copyCursor, this.#length);\n      const end = clamp(edit.end, start, this.#length);\n      appendRange(copyCursor, start);\n\n      const insertedPiece = insertedPieces[i];\n      if (insertedPiece !== undefined) {\n        nextPieces.push(insertedPiece);\n      }\n      copyCursor = end;\n    }\n    appendRange(copyCursor, this.#length);\n\n    this.#setPieces(nextPieces);\n    this.#lastVisitedLine = null;\n    this.#lastVisitedLineLength = null;\n  }\n\n  positionAt(offset: number): Position {\n    const clampedOffset = clamp(offset, 0, this.#length);\n    if (this.#length === 0) {\n      return { line: 0, character: 0 };\n    }\n    const line = this.#lineAtOffset(clampedOffset);\n    const lineStart = line === 0 ? 0 : this.#lineBreakOffset(line - 1);\n    return {\n      line,\n      character: clampedOffset - lineStart,\n    };\n  }\n\n  positionsAt(offsets: readonly number[]): Position[] {\n    const positions: Position[] = Array.from({ length: offsets.length });\n    if (offsets.length === 0) {\n      return positions;\n    }\n    if (this.#length === 0) {\n      return positions.fill({ line: 0, character: 0 });\n    }\n\n    for (let i = 0; i < offsets.length; i++) {\n      positions[i] = this.positionAt(offsets[i]);\n    }\n\n    return positions;\n  }\n\n  offsetAt(position: Position): number {\n    if (position.line < 0 || this.#length === 0) {\n      return 0;\n    }\n    if (position.line >= this.#lineCount) {\n      throw new Error(`Line index out of range: ${position.line}`);\n    }\n    const offset = this.#getLineOffset(position.line);\n    if (offset === undefined) {\n      throw new Error(`Line index out of range: ${position.line}`);\n    }\n    const character = clamp(position.character, 0, offset[1] - offset[0]);\n    return offset[0] + character;\n  }\n\n  #findPieceAtOffset(\n    offset: number\n  ): [node: PieceNode, offsetInPiece: number] | undefined {\n    if (offset < 0 || offset >= this.#length) {\n      return undefined;\n    }\n\n    let node = this.#root;\n    let remaining = offset;\n    while (node !== null) {\n      const leftLength = node.left?.subtreeLength ?? 0;\n      if (remaining < leftLength) {\n        node = node.left;\n        continue;\n      }\n\n      remaining -= leftLength;\n      if (remaining < node.piece.length) {\n        return [node, remaining];\n      }\n\n      remaining -= node.piece.length;\n      node = node.right;\n    }\n\n    return undefined;\n  }\n\n  #nextNode(node: PieceNode): PieceNode | null {\n    if (node.right !== null) {\n      let next = node.right;\n      while (next.left !== null) {\n        next = next.left;\n      }\n      return next;\n    }\n\n    let current = node;\n    while (current.parent !== null && current === current.parent.right) {\n      current = current.parent;\n    }\n    return current.parent;\n  }\n\n  #getLineOffset(line: number): [start: number, end: number] | undefined {\n    if (line < 0) {\n      throw new Error(`Line index out of range: ${line}`);\n    }\n    if (this.#length === 0) {\n      if (line === 0) {\n        return [0, 0];\n      }\n      throw new Error(`Line index out of range: ${line}`);\n    }\n    if (line >= this.#lineCount) {\n      throw new Error(`Line index out of range: ${line}`);\n    }\n\n    const start = line === 0 ? 0 : this.#lineBreakOffset(line - 1);\n    const end =\n      line < this.#lineCount - 1 ? this.#lineBreakOffset(line) : this.#length;\n    return [start, end];\n  }\n\n  #lineAtOffset(offset: number): number {\n    let node = this.#root;\n    let remaining = clamp(offset, 0, this.#length);\n    let line = 0;\n\n    while (node !== null) {\n      const leftLength = node.left?.subtreeLength ?? 0;\n      if (remaining < leftLength) {\n        node = node.left;\n        continue;\n      }\n\n      line += node.left?.subtreeLineBreakCount ?? 0;\n      remaining -= leftLength;\n      if (remaining <= node.piece.length) {\n        const buffer = this.#bufferFor(node.piece.source);\n        line +=\n          upperBound(buffer.lineOffsets, node.piece.offset + remaining) -\n          node.piece.lineOffsetStart;\n        return line;\n      }\n\n      line += node.piece.lineBreakCount;\n      remaining -= node.piece.length;\n      node = node.right;\n    }\n\n    return this.#lineCount - 1;\n  }\n\n  #lineBreakOffset(lineBreakIndex: number): number {\n    let node = this.#root;\n    let remaining = lineBreakIndex;\n    let documentOffset = 0;\n\n    while (node !== null) {\n      const leftLineBreakCount = node.left?.subtreeLineBreakCount ?? 0;\n      if (remaining < leftLineBreakCount) {\n        node = node.left;\n        continue;\n      }\n\n      const leftLength = node.left?.subtreeLength ?? 0;\n      documentOffset += leftLength;\n      remaining -= leftLineBreakCount;\n\n      if (remaining < node.piece.lineBreakCount) {\n        const bufferLineOffset = this.#bufferFor(node.piece.source).lineOffsets[\n          node.piece.lineOffsetStart + remaining\n        ];\n        return documentOffset + (bufferLineOffset - node.piece.offset);\n      }\n\n      documentOffset += node.piece.length;\n      remaining -= node.piece.lineBreakCount;\n      node = node.right;\n    }\n\n    return this.#length;\n  }\n\n  #textFromPieces(): string {\n    const chunks: string[] = [];\n    this.#forEachPieceSegment((segment) => {\n      chunks.push(segment.text.slice(segment.start, segment.end));\n    });\n    return chunks.join('');\n  }\n\n  #forEachPieceSegment(\n    callback: (segment: {\n      readonly start: number;\n      readonly end: number;\n      readonly text: string;\n      readonly lineOffsets: number[];\n      readonly lineOffsetStart: number;\n      readonly lineOffsetEnd: number;\n    }) => boolean | void\n  ): void {\n    this.#walk(this.#root, (node) => {\n      const buffer = this.#bufferFor(node.piece.source);\n      return callback({\n        text: buffer.text,\n        lineOffsets: buffer.lineOffsets,\n        lineOffsetStart: node.piece.lineOffsetStart,\n        lineOffsetEnd: node.piece.lineOffsetEnd,\n        start: node.piece.offset,\n        end: node.piece.offset + node.piece.length,\n      });\n    });\n  }\n\n  #bufferFor(source: number): TextBuffer {\n    return source === Piece.Original ? this.#original : this.#add;\n  }\n\n  #createPiece(source: number, offset: number, length: number): Piece {\n    const buffer = this.#bufferFor(source);\n    return new Piece(\n      source,\n      offset,\n      length,\n      upperBound(buffer.lineOffsets, offset),\n      upperBound(buffer.lineOffsets, offset + length)\n    );\n  }\n\n  #pieces(): Piece[] {\n    return this.#piecesCache;\n  }\n\n  #setPieces(pieces: Piece[]): void {\n    const coalescedPieces = coalescePieces(pieces);\n    this.#piecesCache = coalescedPieces;\n    let length = 0;\n    let lineBreakCount = 0;\n    for (const piece of coalescedPieces) {\n      length += piece.length;\n      lineBreakCount += piece.lineBreakCount;\n    }\n    this.#root = this.#buildBalancedTree(\n      coalescedPieces,\n      0,\n      coalescedPieces.length,\n      null\n    );\n    this.#length = length;\n    this.#lineCount = lineBreakCount + 1;\n  }\n\n  #buildBalancedTree(\n    pieces: Piece[],\n    start: number,\n    end: number,\n    parent: PieceNode | null\n  ): PieceNode | null {\n    if (start >= end) {\n      return null;\n    }\n\n    const middle = start + Math.floor((end - start) / 2);\n    const node = new PieceNode(pieces[middle]);\n    node.parent = parent;\n    node.left = this.#buildBalancedTree(pieces, start, middle, node);\n    node.right = this.#buildBalancedTree(pieces, middle + 1, end, node);\n    node.updateSubtreeLength();\n    return node;\n  }\n\n  #walk(\n    node: PieceNode | null,\n    visit: (node: PieceNode) => boolean | void\n  ): boolean {\n    if (node === null) {\n      return true;\n    }\n    if (!this.#walk(node.left, visit)) {\n      return false;\n    }\n    if (visit(node) === false) {\n      return false;\n    }\n    return this.#walk(node.right, visit);\n  }\n}\n\nfunction isEOL(charCode: number): boolean {\n  return charCode === /* \\n */ 10 || charCode === /* \\r */ 13;\n}\n\nfunction clamp(value: number, min: number, max: number): number {\n  return Math.min(Math.max(value, min), max);\n}\n\nfunction createPrefixTable(text: string): number[] {\n  const table = Array.from<number>({ length: text.length }).fill(0);\n  let matched = 0;\n  for (let i = 1; i < text.length; i++) {\n    const charCode = text.charCodeAt(i);\n    while (matched > 0 && charCode !== text.charCodeAt(matched)) {\n      matched = table[matched - 1];\n    }\n    if (charCode === text.charCodeAt(matched)) {\n      matched++;\n    }\n    table[i] = matched;\n  }\n  return table;\n}\n\nfunction normalizeRanges(\n  ranges: readonly [start: number, end: number][],\n  length: number\n): [start: number, end: number][] {\n  const normalized: [start: number, end: number][] = [];\n  for (const [rawStart, rawEnd] of ranges) {\n    const start = clamp(rawStart, 0, length);\n    const end = clamp(rawEnd, start, length);\n    if (start < end) {\n      normalized.push([start, end]);\n    }\n  }\n  normalized.sort((a, b) => a[0] - b[0]);\n\n  const merged: [start: number, end: number][] = [];\n  for (const range of normalized) {\n    const previous = merged[merged.length - 1];\n    if (previous !== undefined && range[0] <= previous[1]) {\n      previous[1] = Math.max(previous[1], range[1]);\n      continue;\n    }\n    merged.push(range);\n  }\n  return merged;\n}\n\nfunction rangeOverlaps(\n  ranges: readonly [start: number, end: number][],\n  start: number,\n  end: number\n): boolean {\n  let low = 0;\n  let high = ranges.length;\n  while (low < high) {\n    const mid = low + Math.floor((high - low) / 2);\n    if (ranges[mid][1] <= start) {\n      low = mid + 1;\n    } else {\n      high = mid;\n    }\n  }\n\n  const range = ranges[low];\n  return range !== undefined && range[0] < end;\n}\n\n// Keeps the table compact after repeated edits by joining neighboring pieces\n// that already point at contiguous text in the same backing buffer.\nfunction coalescePieces(pieces: Piece[]): Piece[] {\n  const coalescedPieces: Piece[] = [];\n  for (const piece of pieces) {\n    if (piece.length === 0) {\n      continue;\n    }\n\n    const previous = coalescedPieces[coalescedPieces.length - 1];\n    if (\n      previous !== undefined &&\n      previous.source === piece.source &&\n      previous.offset + previous.length === piece.offset\n    ) {\n      coalescedPieces[coalescedPieces.length - 1] = new Piece(\n        previous.source,\n        previous.offset,\n        previous.length + piece.length,\n        previous.lineOffsetStart,\n        piece.lineOffsetEnd\n      );\n      continue;\n    }\n\n    coalescedPieces.push(piece);\n  }\n  return coalescedPieces;\n}\n\n// Returns the index of the first element in the array that is greater than the target.\nfunction upperBound(values: number[], target: number): number {\n  let lo = 0;\n  let hi = values.length;\n  while (lo < hi) {\n    const mid = lo + Math.floor((hi - lo) / 2);\n    if (values[mid] <= target) {\n      lo = mid + 1;\n    } else {\n      hi = mid;\n    }\n  }\n  return lo;\n}\n\nfunction escapeRegExp(text: string): string {\n  return text.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\$&');\n}\n\nfunction isWordSeparatorCharCode(charCode: number): boolean {\n  if (charCode <= 32 || charCode === 127) {\n    return true;\n  }\n  const ch = String.fromCharCode(charCode);\n  return WORD_SEPARATORS.includes(ch);\n}\n\n// Checks if the given text is a whole word by checking if the\n// characters before and after are word separators.\nfunction isWholeWordAtDocOffsets(\n  docStart: number,\n  length: number,\n  docLength: number,\n  charAt: (offset: number) => string\n): boolean {\n  const beforeOk =\n    docStart <= 0 ||\n    isWordSeparatorCharCode(charCodeUnitAt(charAt, docStart - 1));\n  const afterOk =\n    docStart + length >= docLength ||\n    isWordSeparatorCharCode(charCodeUnitAt(charAt, docStart + length));\n  return beforeOk && afterOk;\n}\n\nfunction charCodeUnitAt(\n  charAt: (offset: number) => string,\n  offset: number\n): number {\n  const unit = charAt(offset);\n  return unit.length === 0 ? 0 : unit.charCodeAt(0);\n}\n\nfunction compileSearchRegExp(\n  source: string,\n  isRegex: boolean,\n  caseSensitive: boolean\n): RegExp {\n  const body = isRegex ? source : escapeRegExp(source);\n  const flags = `g${caseSensitive ? '' : 'i'}${isRegex ? 'm' : ''}`;\n  return new RegExp(body, flags);\n}\n\nfunction advancePastEmptyMatch(text: string, index: number): number {\n  if (index + 1 < text.length) {\n    const first = text.charCodeAt(index);\n    const second = text.charCodeAt(index + 1);\n    if (\n      first >= 0xd800 &&\n      first <= 0xdbff &&\n      second >= 0xdc00 &&\n      second <= 0xdfff\n    ) {\n      return index + 2;\n    }\n  }\n  return index + 1;\n}\n"],"mappings":";;;AAIA,MAAM,mBAAmB;AAEzB,MAAM,kBAAkB;AAGxB,IAAM,QAAN,MAAY;CACV,OAAO,WAAW;CAClB,OAAO,QAAQ;CAEf,YACE,AAAgBA,QAChB,AAAgBC,QAChB,AAAgBC,QAChB,AAAgBC,iBAChB,AAAgBC,eAChB;EALgB;EACA;EACA;EACA;EACA;;CAGlB,IAAI,iBAAyB;AAC3B,SAAO,KAAK,gBAAgB,KAAK;;;AAKrC,IAAM,aAAN,MAAiB;CACf;CAEA,YAAY,AAAOC,MAAc;EAAd;AACjB,OAAK,cAAc,mBAAmB,KAAK;;CAK7C,OAAO,MAAsB;EAC3B,MAAM,SAAS,KAAK,KAAK;EACzB,MAAM,sBAAsB,mBAAmB,KAAK;AACpD,OAAK,IAAI,IAAI,GAAG,IAAI,oBAAoB,QAAQ,IAC9C,MAAK,YAAY,KAAK,SAAS,oBAAoB,GAAG;AAExD,OAAK,QAAQ;AACb,SAAO;;;AAKX,IAAM,YAAN,MAAgB;CACd,OAAyB;CACzB,QAA0B;CAC1B,SAA2B;CAE3B,YACE,AAAOC,OACP,AAAOC,gBAAwB,MAAM,QACrC,AAAOC,wBAAgC,MAAM,gBAC7C;EAHO;EACA;EACA;;CAGT,sBAA4B;AAC1B,OAAK,iBACF,KAAK,MAAM,iBAAiB,KAC7B,KAAK,MAAM,UACV,KAAK,OAAO,iBAAiB;AAChC,OAAK,yBACF,KAAK,MAAM,yBAAyB,KACrC,KAAK,MAAM,kBACV,KAAK,OAAO,yBAAyB;;;;;;;;;AAU5C,IAAa,aAAb,MAAwB;CACtB;CACA,OAAO,IAAI,WAAW,GAAG;CACzB,QAA0B;CAC1B,eAAwB,EAAE;CAC1B,UAAU;CACV,aAAa;CACb,mBAAqD;CACrD,yBAA2D;CAE3D,YAAY,cAAsB;AAChC,QAAKC,WAAY,IAAI,WAAW,aAAa;AAC7C,QAAKC,UAAW,CACd,MAAKC,YAAa,MAAM,UAAU,GAAG,aAAa,OAAO,CAC1D,CAAC;;CAGJ,IAAI,YAAoB;AACtB,SAAO,MAAKC;;CAGd,QAAQ,OAAuB;AAC7B,MAAI,UAAU,OACZ,QAAO,MAAKC,gBAAiB;EAE/B,MAAM,QAAQ,KAAK,SAAS,MAAM,MAAM;EACxC,MAAM,MAAM,KAAK,SAAS,MAAM,IAAI;AACpC,SAAO,KAAK,aAAa,OAAO,IAAI;;CAGtC,YAAY,MAAc,mBAAmB,OAAe;AAC1D,MACE,MAAKC,oBAAqB,QAC1B,MAAKA,gBAAiB,OAAO,QAC7B,MAAKA,gBAAiB,OAAO,iBAE7B,QAAO,MAAKA,gBAAiB;EAE/B,MAAM,SAAS,MAAKC,cAAe,KAAK;AACxC,MAAI,WAAW,OACb,OAAM,IAAI,MAAM,4BAA4B,OAAO;EAErD,MAAM,OAAO,KAAK,aAAa,OAAO,IAAI,OAAO,IAAI,CAAC,iBAAiB;AACvE,QAAKD,kBAAmB;GAAC;GAAM;GAAkB;GAAK;AACtD,QAAKE,wBAAyB;GAAC;GAAM;GAAkB,KAAK;GAAO;AACnE,SAAO;;CAGT,cAAc,MAAc,mBAAmB,OAAe;EAC5D,MAAM,wBAAwB,MAAKA;EACnC,MAAM,kBAAkB,MAAKF;AAC7B,MACE,0BAA0B,QAC1B,sBAAsB,OAAO,QAC7B,sBAAsB,OAAO,iBAE7B,QAAO,sBAAsB;AAE/B,MACE,oBAAoB,QACpB,gBAAgB,OAAO,QACvB,gBAAgB,OAAO,kBACvB;GACA,MAAMG,WAAS,gBAAgB,GAAG;AAClC,SAAKD,wBAAyB;IAAC;IAAM;IAAkBC;IAAO;AAC9D,UAAOA;;EAET,MAAM,SAAS,MAAKF,cAAe,KAAK;AACxC,MAAI,WAAW,OACb,OAAM,IAAI,MAAM,4BAA4B,OAAO;EAErD,MAAM,CAAC,OAAO,OAAO;EACrB,IAAI,SAAS,MAAM;AACnB,MAAI,CAAC,iBACH,QACE,SAAS,KACT,MAAM,KAAK,OAAO,QAAQ,SAAS,EAAE,CAAC,WAAW,EAAE,CAAC,CAEpD;AAGJ,QAAKC,wBAAyB;GAAC;GAAM;GAAkB;GAAO;AAC9D,SAAO;;CAGT,aAAa,OAAe,KAAa,UAAU,OAAe;AAChE,MAAI,SAAS,IACX,QAAO;EAGT,MAAM,aAAa,MAAM,OAAO,GAAG,MAAKE,OAAQ;EAChD,MAAM,WAAW,MAAM,KAAK,YAAY,MAAKA,OAAQ;AACrD,MAAI,cAAc,SAChB,QAAO;EAGT,MAAM,WAAW,MAAKC,kBAAmB,WAAW;AACpD,MAAI,aAAa,OACf,QAAO;EAGT,MAAMC,SAAmB,EAAE;EAC3B,IAAI,CAAC,MAAM,iBAAiB;EAC5B,IAAI,YAAY,WAAW;AAC3B,SAAO,SAAS,QAAQ,YAAY,GAAG;GACrC,MAAM,aAAa,KAAK,IAAI,KAAK,MAAM,SAAS,eAAe,UAAU;GACzE,MAAM,SAAS,MAAKC,UAAW,KAAK,MAAM,OAAO;GACjD,MAAMC,UAAQ,KAAK,MAAM,SAAS;GAClC,IAAIC,QAAMD,UAAQ;AAClB,OAAI,QACF,QAAOC,QAAMD,WAAS,MAAM,OAAO,KAAK,WAAWC,QAAM,EAAE,CAAC,CAC1D;AAGJ,UAAO,KAAK,OAAO,KAAK,MAAMD,SAAOC,MAAI,CAAC;AAC1C,gBAAa;AACb,mBAAgB;AAChB,UAAO,MAAKC,SAAU,KAAK;;AAG7B,SAAO,OAAO,KAAK,GAAG;;CAGxB,OAAO,QAAwB;EAC7B,MAAM,WAAW,MAAKL,kBAAmB,OAAO;AAChD,MAAI,aAAa,OACf,QAAO;EAGT,MAAM,CAAC,MAAM,iBAAiB;AAE9B,SADe,MAAKE,UAAW,KAAK,MAAM,OAAO,CACnC,KAAK,OAAO,KAAK,MAAM,SAAS,cAAc;;CAG9D,SAAS,QAAyB;AAChC,MAAI,OAAO,WAAW,EACpB,QAAO;EAGT,MAAM,cAAc,kBAAkB,OAAO;EAC7C,IAAI,UAAU;EACd,IAAI,QAAQ;AACZ,QAAKI,qBAAsB,YAAY;AACrC,QAAK,IAAI,SAAS,QAAQ,OAAO,SAAS,QAAQ,KAAK,UAAU;IAC/D,MAAM,WAAW,QAAQ,KAAK,WAAW,OAAO;AAChD,WAAO,UAAU,KAAK,aAAa,OAAO,WAAW,QAAQ,CAC3D,WAAU,YAAY,UAAU;AAElC,QAAI,aAAa,OAAO,WAAW,QAAQ,CACzC;AAEF,QAAI,YAAY,OAAO,QAAQ;AAC7B,aAAQ;AACR,YAAO;;;AAGX,UAAO;IACP;AACF,SAAO;;CAGT,gCACE,QACA,UACoB;AACpB,MAAI,OAAO,WAAW,KAAK,OAAO,SAAS,MAAKP,OAC9C;EAGF,MAAM,SAAS,gBAAgB,UAAU,MAAKA,OAAQ;EACtD,MAAM,QAAQ,OAAO,QAAQ,KAAK,GAAG,SAAS,KAAK,IAAI,KAAK,IAAI,EAAE,EAAE;EACpE,MAAM,cAAc,kBAAkB,OAAO;EAC7C,IAAI,UAAU;EACd,IAAI,iBAAiB;EACrB,IAAIQ;EACJ,IAAIC;AAEJ,QAAKF,qBAAsB,YAAY;AACrC,QAAK,IAAI,SAAS,QAAQ,OAAO,SAAS,QAAQ,KAAK,UAAU;IAC/D,MAAM,WAAW,QAAQ,KAAK,WAAW,OAAO;AAChD,WAAO,UAAU,KAAK,aAAa,OAAO,WAAW,QAAQ,CAC3D,WAAU,YAAY,UAAU;AAElC,QAAI,aAAa,OAAO,WAAW,QAAQ,CACzC;AAEF,QAAI,YAAY,OAAO,QAAQ;KAC7B,MAAM,QAAQ,iBAAiB,OAAO,SAAS;AAC/C,SAAI,CAAC,cAAc,QAAQ,OAAO,QAAQ,OAAO,OAAO,EAAE;AACxD,UAAI,SAAS,OAAO;AAClB,qBAAc;AACd,cAAO;;AAET,wBAAkB;;AAEpB,eAAU,YAAY,UAAU;;AAElC;;AAEF,UAAO;IACP;AAEF,SAAO,eAAe;;CAGxB,OAAO,cAA4D;AACjE,MAAI,aAAa,KAAK,WAAW,KAAK,MAAKP,WAAY,EACrD,QAAO,EAAE;AAIX,MACE,aAAa,KAAK,SAAS,KAAK,IAChC,aAAa,KAAK,SAAS,KAAK,IAC/B,aAAa,UACX,aAAa,KAAK,SAAS,MAAM,IAChC,aAAa,KAAK,SAAS,MAAM,EAErC,QAAO,EAAE;EAGX,IAAIU;AACJ,MAAI;AACF,aAAU,oBACR,aAAa,MACb,aAAa,OACb,aAAa,cACd;UACK;AACN,UAAO,EAAE;;AAGX,SAAO,MAAKC,+BACV,SACA,aAAa,WACb,iBACD;;CAGH,gCACE,SACA,WACA,OACoB;EACpB,MAAMC,MAA0B,EAAE;EAClC,MAAM,YAAY,MAAKZ;EACvB,MAAM,UAAU,WAAmB,KAAK,OAAO,OAAO;AAEtD,OAAK,IAAI,OAAO,GAAG,OAAO,MAAKN,WAAY,QAAQ;GACjD,MAAM,WAAW,KAAK,YAAY,KAAK;GACvC,MAAM,YAAY,KAAK,SAAS;IAAE;IAAM,WAAW;IAAG,CAAC;GACvD,MAAM,KAAK,IAAI,OAAO,QAAQ,QAAQ,QAAQ,MAAM;AACpD,MAAG,YAAY;GACf,IAAImB;AACJ,WAAQ,QAAQ,GAAG,KAAK,SAAS,MAAM,MAAM;IAC3C,MAAM,MAAM,MAAM;IAClB,MAAM,WAAW,MAAM;AACvB,QAAI,SAAS,WAAW,GAAG;AACzB,QAAG,YAAY,sBAAsB,UAAU,IAAI;AACnD;;IAEF,MAAM,WAAW,YAAY;AAC7B,QACE,CAAC,aACD,wBAAwB,UAAU,SAAS,QAAQ,WAAW,OAAO,EACrE;AACA,SAAI,KAAK,CAAC,UAAU,WAAW,SAAS,OAAO,CAAC;AAChD,SAAI,IAAI,UAAU,MAChB,QAAO;;AAGX,QAAI,QAAQ,GAAG,UACb,IAAG,YAAY,sBAAsB,UAAU,IAAI;;;AAIzD,SAAO;;CAGT,OAAO,MAAc,QAAsB;AACzC,MAAI,KAAK,WAAW,EAClB;EAGF,MAAM,eAAe,MAAM,QAAQ,GAAG,MAAKb,OAAQ;EACnD,MAAM,YAAY,MAAKc,IAAK,OAAO,KAAK;EACxC,MAAM,gBAAgB,MAAKrB,YACzB,MAAM,OACN,WACA,KAAK,OACN;EACD,MAAM,SAAS,MAAKsB,QAAS;EAC7B,MAAMC,aAAsB,EAAE;EAE9B,IAAI,SAAS;EACb,IAAI,WAAW;AAEf,OAAK,MAAM,SAAS,QAAQ;GAC1B,MAAM,WAAW,SAAS,MAAM;AAChC,OAAI,CAAC,YAAY,gBAAgB,UAAU;IACzC,MAAM,cAAc,eAAe;AACnC,QAAI,cAAc,EAChB,YAAW,KACT,MAAKvB,YAAa,MAAM,QAAQ,MAAM,QAAQ,YAAY,CAC3D;AAEH,eAAW,KAAK,cAAc;AAC9B,QAAI,cAAc,MAAM,OACtB,YAAW,KACT,MAAKA,YACH,MAAM,QACN,MAAM,SAAS,aACf,MAAM,SAAS,YAChB,CACF;AAEH,eAAW;SAEX,YAAW,KAAK,MAAM;AAExB,YAAS;;AAGX,MAAI,CAAC,SACH,YAAW,KAAK,cAAc;AAGhC,QAAKD,UAAW,WAAW;AAC3B,QAAKI,kBAAmB;AACxB,QAAKE,wBAAyB;;CAGhC,OAAO,QAAgB,QAAsB;AAC3C,MAAI,UAAU,KAAK,MAAKE,WAAY,EAClC;EAGF,MAAM,QAAQ,MAAM,QAAQ,GAAG,MAAKA,OAAQ;EAC5C,MAAM,MAAM,MAAM,QAAQ,QAAQ,OAAO,MAAKA,OAAQ;AACtD,MAAI,UAAU,IACZ;EAGF,MAAMgB,aAAsB,EAAE;EAC9B,IAAI,SAAS;AACb,OAAK,MAAM,SAAS,MAAKD,QAAS,EAAE;GAClC,MAAM,aAAa;GACnB,MAAM,WAAW,SAAS,MAAM;GAChC,MAAM,aAAa,MAAM,QAAQ,YAAY,GAAG,MAAM,OAAO;GAC7D,MAAM,YAAY,MAAM,WAAW,KAAK,GAAG,MAAM,OAAO;AAExD,OAAI,aAAa,EACf,YAAW,KACT,MAAKtB,YAAa,MAAM,QAAQ,MAAM,QAAQ,WAAW,CAC1D;AAEH,OAAI,YAAY,EACd,YAAW,KACT,MAAKA,YACH,MAAM,QACN,MAAM,SAAS,MAAM,SAAS,WAC9B,UACD,CACF;AAEH,YAAS;;AAGX,QAAKD,UAAW,WAAW;AAC3B,QAAKI,kBAAmB;AACxB,QAAKE,wBAAyB;;CAGhC,WAAW,OAA0C;AACnD,MAAI,MAAM,WAAW,EACnB;EAGF,IAAI,aAAa;EACjB,IAAI,aAAa;EACjB,IAAI,aAAa;EAEjB,MAAM,SAAS,MAAKiB,QAAS;EAC7B,MAAM,iBAAiB,MAAM,KAAK,SAChC,KAAK,KAAK,WAAW,IACjB,SACA,MAAKtB,YACH,MAAM,OACN,MAAKqB,IAAK,OAAO,KAAK,KAAK,EAC3B,KAAK,KAAK,OACX,CACN;EACD,MAAME,aAAsB,EAAE;EAE9B,MAAM,qBAAqB;GACzB,MAAM,QAAQ,OAAO;AACrB,OAAI,UAAU,QAAW;AACvB,kBAAc,MAAM;AACpB;;;EAIJ,MAAM,eAAe,OAAe,QAAgB;GAClD,IAAI,aAAa,MAAM,OAAO,GAAG,MAAKhB,OAAQ;GAC9C,MAAM,WAAW,MAAM,KAAK,YAAY,MAAKA,OAAQ;AACrD,UACE,aAAa,OAAO,UACpB,aAAa,OAAO,YAAY,UAAU,WAE1C,eAAc;AAEhB,UAAO,aAAa,OAAO,UAAU,aAAa,UAAU;IAC1D,MAAM,QAAQ,OAAO;IACrB,MAAM,WAAW,aAAa,MAAM;IACpC,MAAM,gBAAgB,MAAM,aAAa,YAAY,GAAG,MAAM,OAAO;IACrE,MAAM,UAAU,KAAK,IAAI,UAAU,SAAS;IAC5C,MAAM,aAAa,WAAW,aAAa;AAC3C,QAAI,aAAa,EACf,YAAW,KACT,kBAAkB,KAAK,eAAe,MAAM,SACxC,QACA,MAAKP,YACH,MAAM,QACN,MAAM,SAAS,eACf,WACD,CACN;AAEH,iBAAa;AACb,QAAI,cAAc,SAChB,eAAc;;;AAKpB,OAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;GACrC,MAAM,OAAO,MAAM;GACnB,MAAM,QAAQ,MAAM,KAAK,OAAO,YAAY,MAAKO,OAAQ;GACzD,MAAM,MAAM,MAAM,KAAK,KAAK,OAAO,MAAKA,OAAQ;AAChD,eAAY,YAAY,MAAM;GAE9B,MAAM,gBAAgB,eAAe;AACrC,OAAI,kBAAkB,OACpB,YAAW,KAAK,cAAc;AAEhC,gBAAa;;AAEf,cAAY,YAAY,MAAKA,OAAQ;AAErC,QAAKR,UAAW,WAAW;AAC3B,QAAKI,kBAAmB;AACxB,QAAKE,wBAAyB;;CAGhC,WAAW,QAA0B;EACnC,MAAM,gBAAgB,MAAM,QAAQ,GAAG,MAAKE,OAAQ;AACpD,MAAI,MAAKA,WAAY,EACnB,QAAO;GAAE,MAAM;GAAG,WAAW;GAAG;EAElC,MAAM,OAAO,MAAKiB,aAAc,cAAc;AAE9C,SAAO;GACL;GACA,WAAW,iBAHK,SAAS,IAAI,IAAI,MAAKC,gBAAiB,OAAO,EAAE;GAIjE;;CAGH,YAAY,SAAwC;EAClD,MAAMC,YAAwB,MAAM,KAAK,EAAE,QAAQ,QAAQ,QAAQ,CAAC;AACpE,MAAI,QAAQ,WAAW,EACrB,QAAO;AAET,MAAI,MAAKnB,WAAY,EACnB,QAAO,UAAU,KAAK;GAAE,MAAM;GAAG,WAAW;GAAG,CAAC;AAGlD,OAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,IAClC,WAAU,KAAK,KAAK,WAAW,QAAQ,GAAG;AAG5C,SAAO;;CAGT,SAAS,UAA4B;AACnC,MAAI,SAAS,OAAO,KAAK,MAAKA,WAAY,EACxC,QAAO;AAET,MAAI,SAAS,QAAQ,MAAKN,UACxB,OAAM,IAAI,MAAM,4BAA4B,SAAS,OAAO;EAE9D,MAAM,SAAS,MAAKG,cAAe,SAAS,KAAK;AACjD,MAAI,WAAW,OACb,OAAM,IAAI,MAAM,4BAA4B,SAAS,OAAO;EAE9D,MAAM,YAAY,MAAM,SAAS,WAAW,GAAG,OAAO,KAAK,OAAO,GAAG;AACrE,SAAO,OAAO,KAAK;;CAGrB,mBACE,QACsD;AACtD,MAAI,SAAS,KAAK,UAAU,MAAKG,OAC/B;EAGF,IAAI,OAAO,MAAKoB;EAChB,IAAI,YAAY;AAChB,SAAO,SAAS,MAAM;GACpB,MAAM,aAAa,KAAK,MAAM,iBAAiB;AAC/C,OAAI,YAAY,YAAY;AAC1B,WAAO,KAAK;AACZ;;AAGF,gBAAa;AACb,OAAI,YAAY,KAAK,MAAM,OACzB,QAAO,CAAC,MAAM,UAAU;AAG1B,gBAAa,KAAK,MAAM;AACxB,UAAO,KAAK;;;CAMhB,UAAU,MAAmC;AAC3C,MAAI,KAAK,UAAU,MAAM;GACvB,IAAI,OAAO,KAAK;AAChB,UAAO,KAAK,SAAS,KACnB,QAAO,KAAK;AAEd,UAAO;;EAGT,IAAI,UAAU;AACd,SAAO,QAAQ,WAAW,QAAQ,YAAY,QAAQ,OAAO,MAC3D,WAAU,QAAQ;AAEpB,SAAO,QAAQ;;CAGjB,eAAe,MAAwD;AACrE,MAAI,OAAO,EACT,OAAM,IAAI,MAAM,4BAA4B,OAAO;AAErD,MAAI,MAAKpB,WAAY,GAAG;AACtB,OAAI,SAAS,EACX,QAAO,CAAC,GAAG,EAAE;AAEf,SAAM,IAAI,MAAM,4BAA4B,OAAO;;AAErD,MAAI,QAAQ,MAAKN,UACf,OAAM,IAAI,MAAM,4BAA4B,OAAO;AAMrD,SAAO,CAHO,SAAS,IAAI,IAAI,MAAKwB,gBAAiB,OAAO,EAAE,EAE5D,OAAO,MAAKxB,YAAa,IAAI,MAAKwB,gBAAiB,KAAK,GAAG,MAAKlB,OAC/C;;CAGrB,cAAc,QAAwB;EACpC,IAAI,OAAO,MAAKoB;EAChB,IAAI,YAAY,MAAM,QAAQ,GAAG,MAAKpB,OAAQ;EAC9C,IAAI,OAAO;AAEX,SAAO,SAAS,MAAM;GACpB,MAAM,aAAa,KAAK,MAAM,iBAAiB;AAC/C,OAAI,YAAY,YAAY;AAC1B,WAAO,KAAK;AACZ;;AAGF,WAAQ,KAAK,MAAM,yBAAyB;AAC5C,gBAAa;AACb,OAAI,aAAa,KAAK,MAAM,QAAQ;IAClC,MAAM,SAAS,MAAKG,UAAW,KAAK,MAAM,OAAO;AACjD,YACE,WAAW,OAAO,aAAa,KAAK,MAAM,SAAS,UAAU,GAC7D,KAAK,MAAM;AACb,WAAO;;AAGT,WAAQ,KAAK,MAAM;AACnB,gBAAa,KAAK,MAAM;AACxB,UAAO,KAAK;;AAGd,SAAO,MAAKT,YAAa;;CAG3B,iBAAiB,gBAAgC;EAC/C,IAAI,OAAO,MAAK0B;EAChB,IAAI,YAAY;EAChB,IAAI,iBAAiB;AAErB,SAAO,SAAS,MAAM;GACpB,MAAM,qBAAqB,KAAK,MAAM,yBAAyB;AAC/D,OAAI,YAAY,oBAAoB;AAClC,WAAO,KAAK;AACZ;;GAGF,MAAM,aAAa,KAAK,MAAM,iBAAiB;AAC/C,qBAAkB;AAClB,gBAAa;AAEb,OAAI,YAAY,KAAK,MAAM,gBAAgB;IACzC,MAAM,mBAAmB,MAAKjB,UAAW,KAAK,MAAM,OAAO,CAAC,YAC1D,KAAK,MAAM,kBAAkB;AAE/B,WAAO,kBAAkB,mBAAmB,KAAK,MAAM;;AAGzD,qBAAkB,KAAK,MAAM;AAC7B,gBAAa,KAAK,MAAM;AACxB,UAAO,KAAK;;AAGd,SAAO,MAAKH;;CAGd,kBAA0B;EACxB,MAAME,SAAmB,EAAE;AAC3B,QAAKK,qBAAsB,YAAY;AACrC,UAAO,KAAK,QAAQ,KAAK,MAAM,QAAQ,OAAO,QAAQ,IAAI,CAAC;IAC3D;AACF,SAAO,OAAO,KAAK,GAAG;;CAGxB,qBACE,UAQM;AACN,QAAKc,KAAM,MAAKD,OAAQ,SAAS;GAC/B,MAAM,SAAS,MAAKjB,UAAW,KAAK,MAAM,OAAO;AACjD,UAAO,SAAS;IACd,MAAM,OAAO;IACb,aAAa,OAAO;IACpB,iBAAiB,KAAK,MAAM;IAC5B,eAAe,KAAK,MAAM;IAC1B,OAAO,KAAK,MAAM;IAClB,KAAK,KAAK,MAAM,SAAS,KAAK,MAAM;IACrC,CAAC;IACF;;CAGJ,WAAW,QAA4B;AACrC,SAAO,WAAW,MAAM,WAAW,MAAKZ,WAAY,MAAKuB;;CAG3D,aAAa,QAAgB,QAAgB,QAAuB;EAClE,MAAM,SAAS,MAAKX,UAAW,OAAO;AACtC,SAAO,IAAI,MACT,QACA,QACA,QACA,WAAW,OAAO,aAAa,OAAO,EACtC,WAAW,OAAO,aAAa,SAAS,OAAO,CAChD;;CAGH,UAAmB;AACjB,SAAO,MAAKmB;;CAGd,WAAW,QAAuB;EAChC,MAAM,kBAAkB,eAAe,OAAO;AAC9C,QAAKA,cAAe;EACpB,IAAI,SAAS;EACb,IAAI,iBAAiB;AACrB,OAAK,MAAM,SAAS,iBAAiB;AACnC,aAAU,MAAM;AAChB,qBAAkB,MAAM;;AAE1B,QAAKF,OAAQ,MAAKG,kBAChB,iBACA,GACA,gBAAgB,QAChB,KACD;AACD,QAAKvB,SAAU;AACf,QAAKN,YAAa,iBAAiB;;CAGrC,mBACE,QACA,OACA,KACA,QACkB;AAClB,MAAI,SAAS,IACX,QAAO;EAGT,MAAM,SAAS,QAAQ,KAAK,OAAO,MAAM,SAAS,EAAE;EACpD,MAAM,OAAO,IAAI,UAAU,OAAO,QAAQ;AAC1C,OAAK,SAAS;AACd,OAAK,OAAO,MAAK6B,kBAAmB,QAAQ,OAAO,QAAQ,KAAK;AAChE,OAAK,QAAQ,MAAKA,kBAAmB,QAAQ,SAAS,GAAG,KAAK,KAAK;AACnE,OAAK,qBAAqB;AAC1B,SAAO;;CAGT,MACE,MACA,OACS;AACT,MAAI,SAAS,KACX,QAAO;AAET,MAAI,CAAC,MAAKF,KAAM,KAAK,MAAM,MAAM,CAC/B,QAAO;AAET,MAAI,MAAM,KAAK,KAAK,MAClB,QAAO;AAET,SAAO,MAAKA,KAAM,KAAK,OAAO,MAAM;;;AAIxC,SAAS,MAAM,UAA2B;AACxC,QAAO,aAAsB,MAAM,aAAsB;;AAG3D,SAAS,MAAM,OAAe,KAAa,KAAqB;AAC9D,QAAO,KAAK,IAAI,KAAK,IAAI,OAAO,IAAI,EAAE,IAAI;;AAG5C,SAAS,kBAAkB,MAAwB;CACjD,MAAM,QAAQ,MAAM,KAAa,EAAE,QAAQ,KAAK,QAAQ,CAAC,CAAC,KAAK,EAAE;CACjE,IAAI,UAAU;AACd,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;EACpC,MAAM,WAAW,KAAK,WAAW,EAAE;AACnC,SAAO,UAAU,KAAK,aAAa,KAAK,WAAW,QAAQ,CACzD,WAAU,MAAM,UAAU;AAE5B,MAAI,aAAa,KAAK,WAAW,QAAQ,CACvC;AAEF,QAAM,KAAK;;AAEb,QAAO;;AAGT,SAAS,gBACP,QACA,QACgC;CAChC,MAAMG,aAA6C,EAAE;AACrD,MAAK,MAAM,CAAC,UAAU,WAAW,QAAQ;EACvC,MAAM,QAAQ,MAAM,UAAU,GAAG,OAAO;EACxC,MAAM,MAAM,MAAM,QAAQ,OAAO,OAAO;AACxC,MAAI,QAAQ,IACV,YAAW,KAAK,CAAC,OAAO,IAAI,CAAC;;AAGjC,YAAW,MAAM,GAAG,MAAM,EAAE,KAAK,EAAE,GAAG;CAEtC,MAAMC,SAAyC,EAAE;AACjD,MAAK,MAAM,SAAS,YAAY;EAC9B,MAAM,WAAW,OAAO,OAAO,SAAS;AACxC,MAAI,aAAa,UAAa,MAAM,MAAM,SAAS,IAAI;AACrD,YAAS,KAAK,KAAK,IAAI,SAAS,IAAI,MAAM,GAAG;AAC7C;;AAEF,SAAO,KAAK,MAAM;;AAEpB,QAAO;;AAGT,SAAS,cACP,QACA,OACA,KACS;CACT,IAAI,MAAM;CACV,IAAI,OAAO,OAAO;AAClB,QAAO,MAAM,MAAM;EACjB,MAAM,MAAM,MAAM,KAAK,OAAO,OAAO,OAAO,EAAE;AAC9C,MAAI,OAAO,KAAK,MAAM,MACpB,OAAM,MAAM;MAEZ,QAAO;;CAIX,MAAM,QAAQ,OAAO;AACrB,QAAO,UAAU,UAAa,MAAM,KAAK;;AAK3C,SAAS,eAAe,QAA0B;CAChD,MAAMC,kBAA2B,EAAE;AACnC,MAAK,MAAM,SAAS,QAAQ;AAC1B,MAAI,MAAM,WAAW,EACnB;EAGF,MAAM,WAAW,gBAAgB,gBAAgB,SAAS;AAC1D,MACE,aAAa,UACb,SAAS,WAAW,MAAM,UAC1B,SAAS,SAAS,SAAS,WAAW,MAAM,QAC5C;AACA,mBAAgB,gBAAgB,SAAS,KAAK,IAAI,MAChD,SAAS,QACT,SAAS,QACT,SAAS,SAAS,MAAM,QACxB,SAAS,iBACT,MAAM,cACP;AACD;;AAGF,kBAAgB,KAAK,MAAM;;AAE7B,QAAO;;AAIT,SAAS,WAAW,QAAkB,QAAwB;CAC5D,IAAI,KAAK;CACT,IAAI,KAAK,OAAO;AAChB,QAAO,KAAK,IAAI;EACd,MAAM,MAAM,KAAK,KAAK,OAAO,KAAK,MAAM,EAAE;AAC1C,MAAI,OAAO,QAAQ,OACjB,MAAK,MAAM;MAEX,MAAK;;AAGT,QAAO;;AAGT,SAAS,aAAa,MAAsB;AAC1C,QAAO,KAAK,QAAQ,uBAAuB,OAAO;;AAGpD,SAAS,wBAAwB,UAA2B;AAC1D,KAAI,YAAY,MAAM,aAAa,IACjC,QAAO;CAET,MAAM,KAAK,OAAO,aAAa,SAAS;AACxC,QAAO,gBAAgB,SAAS,GAAG;;AAKrC,SAAS,wBACP,UACA,QACA,WACA,QACS;CACT,MAAM,WACJ,YAAY,KACZ,wBAAwB,eAAe,QAAQ,WAAW,EAAE,CAAC;CAC/D,MAAM,UACJ,WAAW,UAAU,aACrB,wBAAwB,eAAe,QAAQ,WAAW,OAAO,CAAC;AACpE,QAAO,YAAY;;AAGrB,SAAS,eACP,QACA,QACQ;CACR,MAAM,OAAO,OAAO,OAAO;AAC3B,QAAO,KAAK,WAAW,IAAI,IAAI,KAAK,WAAW,EAAE;;AAGnD,SAAS,oBACP,QACA,SACA,eACQ;CACR,MAAM,OAAO,UAAU,SAAS,aAAa,OAAO;CACpD,MAAM,QAAQ,IAAI,gBAAgB,KAAK,MAAM,UAAU,MAAM;AAC7D,QAAO,IAAI,OAAO,MAAM,MAAM;;AAGhC,SAAS,sBAAsB,MAAc,OAAuB;AAClE,KAAI,QAAQ,IAAI,KAAK,QAAQ;EAC3B,MAAM,QAAQ,KAAK,WAAW,MAAM;EACpC,MAAM,SAAS,KAAK,WAAW,QAAQ,EAAE;AACzC,MACE,SAAS,SACT,SAAS,SACT,UAAU,SACV,UAAU,MAEV,QAAO,QAAQ;;AAGnB,QAAO,QAAQ"}

package/dist/editor/searchPanel.d.ts

@@ -1,7 +1,7 @@
-import { Range, TextDocument } from "./textDocument.js";
+import { TextDocument } from "./textDocument.js";
 
 //#region src/editor/searchPanel.d.ts
-type SearchKind = 'findNext' | 'findPrevious' | 'findAll' | 'replace' | 'replaceAll';
+type MatchRange = [startOffset: number, endOffset: number];
 interface SearchParams {
   text: string;
   replaceText: string;
@@ -13,18 +13,17 @@ interface SearchPanelOptions {
   textDocument: TextDocument<unknown>;
   containerElement: HTMLElement;
   defaultQuery: string;
-  initialMatch?: [number, number];
-  postSearch: (kind: SearchKind, match: [number, number], retainFocus?: boolean) => void;
-  getCurrentSearchRange: () => Range | undefined;
+  initialMatch?: MatchRange;
+  scrollToMatch: (nextMatch: MatchRange, retainFocus: boolean) => void;
+  onUpdate: (matches: MatchRange[]) => MatchRange | undefined;
   onClose: () => void;
 }
 declare class SearchPanelWidget {
   #private;
   constructor(options: SearchPanelOptions);
-  updateMatches(currentMatch?: [number, number]): void;
   focus(): void;
   cleanup(): void;
 }
 //#endregion
-export { SearchKind, SearchPanelOptions, SearchPanelWidget, SearchParams };
+export { MatchRange, SearchPanelOptions, SearchPanelWidget, SearchParams };
 //# sourceMappingURL=searchPanel.d.ts.map

package/dist/editor/searchPanel.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"searchPanel.d.ts","names":["Range","TextDocument","SearchKind","SearchParams","SearchPanelOptions","HTMLElement","SearchPanelWidget"],"sources":["../../src/editor/searchPanel.d.ts"],"sourcesContent":["import type { Range, TextDocument } from './textDocument';\nexport type SearchKind = 'findNext' | 'findPrevious' | 'findAll' | 'replace' | 'replaceAll';\nexport interface SearchParams {\n    text: string;\n    replaceText: string;\n    caseSensitive: boolean;\n    wholeWord: boolean;\n    regex: boolean;\n}\nexport interface SearchPanelOptions {\n    textDocument: TextDocument<unknown>;\n    containerElement: HTMLElement;\n    defaultQuery: string;\n    initialMatch?: [number, number];\n    postSearch: (kind: SearchKind, match: [number, number], retainFocus?: boolean) => void;\n    getCurrentSearchRange: () => Range | undefined;\n    onClose: () => void;\n}\nexport declare class SearchPanelWidget {\n    #private;\n    constructor(options: SearchPanelOptions);\n    updateMatches(currentMatch?: [number, number]): void;\n    focus(): void;\n    cleanup(): void;\n}\n//# sourceMappingURL=searchPanel.d.ts.map"],"mappings":";;;KACYE,UAAAA;UACKC,YAAAA;EADLD,IAAAA,EAAAA,MAAAA;EACKC,WAAAA,EAAAA,MAAY;EAOZC,aAAAA,EAAAA,OAAkB;EACjBH,SAAAA,EAAAA,OAAAA;EACII,KAAAA,EAAAA,OAAAA;;AAIWL,UANhBI,kBAAAA,CAMgBJ;EAAK,YAAA,EALpBC,YAKoB,CAAA,OAAA,CAAA;EAGjBK,gBAAAA,EAPCD,WAOgB;;;qBAJfH;+BACUF;;;cAGZM,iBAAAA;;uBAEIF"}
+{"version":3,"file":"searchPanel.d.ts","names":["TextDocument","MatchRange","SearchParams","SearchPanelOptions","HTMLElement","SearchPanelWidget"],"sources":["../../src/editor/searchPanel.d.ts"],"sourcesContent":["import type { TextDocument } from './textDocument';\nexport type MatchRange = [startOffset: number, endOffset: number];\nexport interface SearchParams {\n    text: string;\n    replaceText: string;\n    caseSensitive: boolean;\n    wholeWord: boolean;\n    regex: boolean;\n}\nexport interface SearchPanelOptions {\n    textDocument: TextDocument<unknown>;\n    containerElement: HTMLElement;\n    defaultQuery: string;\n    initialMatch?: MatchRange;\n    scrollToMatch: (nextMatch: MatchRange, retainFocus: boolean) => void;\n    onUpdate: (matches: MatchRange[]) => MatchRange | undefined;\n    onClose: () => void;\n}\nexport declare class SearchPanelWidget {\n    #private;\n    constructor(options: SearchPanelOptions);\n    focus(): void;\n    cleanup(): void;\n}\n//# sourceMappingURL=searchPanel.d.ts.map"],"mappings":";;;KACYC,UAAAA;UACKC,YAAAA;EADLD,IAAAA,EAAAA,MAAAA;EACKC,WAAAA,EAAAA,MAAY;EAOZC,aAAAA,EAAAA,OAAkB;EACjBH,SAAAA,EAAAA,OAAAA;EACII,KAAAA,EAAAA,OAAAA;;AAGSH,UALdE,kBAAAA,CAKcF;EACPA,YAAAA,EALND,YAKMC,CAAAA,OAAAA,CAAAA;EAAiBA,gBAAAA,EAJnBG,WAImBH;EAAU,YAAA,EAAA,MAAA;EAG9BI,YAAAA,CAAAA,EALFJ,UAKmB;6BAJPA;sBACPA,iBAAiBA;;;cAGpBI,iBAAAA;;uBAEIF"}