@pierre/diffs 1.3.0-beta.1 → 1.3.0-beta.10

package/dist/editor/matchBrackets.js

@@ -0,0 +1,138 @@
+//#region src/editor/matchBrackets.ts
+const OPEN_BRACKETS = /* @__PURE__ */ new Map([
+	["(", ")"],
+	["[", "]"],
+	["{", "}"]
+]);
+const CLOSE_BRACKETS = new Map([...OPEN_BRACKETS].map(([open, close]) => [close, open]));
+const MAX_BRACKET_SCAN_LINES = 1e3;
+const MAX_BRACKET_SCAN_CHARACTERS = 5e4;
+function findBracketMatchRanges(textDocument, tokenizer, position) {
+	const bracketPosition = findAdjacentBracket(textDocument, tokenizer, textDocument.normalizePosition(position));
+	if (bracketPosition === void 0) return;
+	const closingBracket = OPEN_BRACKETS.get(bracketPosition.char);
+	const openingBracket = CLOSE_BRACKETS.get(bracketPosition.char);
+	if (closingBracket !== void 0) return createBracketMatchRanges(bracketPosition, findClosingBracket(textDocument, tokenizer, bracketPosition, closingBracket));
+	if (openingBracket !== void 0) return createBracketMatchRanges(findOpeningBracket(textDocument, tokenizer, bracketPosition, openingBracket), bracketPosition);
+}
+function findAdjacentBracket(textDocument, tokenizer, position) {
+	const previousPosition = getPreviousCharacterPosition(position);
+	if (previousPosition !== void 0) {
+		const previousBracket = getBracketAtPosition(textDocument, tokenizer, previousPosition);
+		if (previousBracket !== void 0) return previousBracket;
+	}
+	return getBracketAtPosition(textDocument, tokenizer, position);
+}
+function getPreviousCharacterPosition(position) {
+	if (position.character > 0) return {
+		line: position.line,
+		character: position.character - 1
+	};
+}
+function getBracketAtPosition(textDocument, tokenizer, position) {
+	const char = textDocument.getLineText(position.line)[position.character];
+	if (char === void 0 || !OPEN_BRACKETS.has(char) && !CLOSE_BRACKETS.has(char) || isInIgnoredTokenRange(tokenizer, position)) return;
+	return {
+		...position,
+		char
+	};
+}
+function findClosingBracket(textDocument, tokenizer, bracketPosition, closingBracket) {
+	let depth = 0;
+	let scannedLines = 0;
+	let scannedCharacters = 0;
+	for (let line = bracketPosition.line; line < textDocument.lineCount; line++) {
+		if (scannedLines >= MAX_BRACKET_SCAN_LINES) return;
+		scannedLines++;
+		const lineText = textDocument.getLineText(line);
+		const ignoredRanges = tokenizer.getStringCommentRegexpRangesInLine(line);
+		const ignoredRangeCursor = { index: 0 };
+		const startCharacter = line === bracketPosition.line ? bracketPosition.character : 0;
+		for (let character = startCharacter; character < lineText.length; character++) {
+			if (scannedCharacters >= MAX_BRACKET_SCAN_CHARACTERS) return;
+			scannedCharacters++;
+			if (isCharacterIgnoredForward(ignoredRanges, character, ignoredRangeCursor)) continue;
+			const char = lineText[character];
+			if (char === bracketPosition.char) depth++;
+			else if (char === closingBracket) {
+				depth--;
+				if (depth === 0) return {
+					line,
+					character,
+					char
+				};
+			}
+		}
+	}
+}
+function findOpeningBracket(textDocument, tokenizer, bracketPosition, openingBracket) {
+	let depth = 0;
+	let scannedLines = 0;
+	let scannedCharacters = 0;
+	for (let line = bracketPosition.line; line >= 0; line--) {
+		if (scannedLines >= MAX_BRACKET_SCAN_LINES) return;
+		scannedLines++;
+		const lineText = textDocument.getLineText(line);
+		const ignoredRanges = tokenizer.getStringCommentRegexpRangesInLine(line);
+		const ignoredRangeCursor = { index: ignoredRanges === null ? -1 : ignoredRanges.length - 1 };
+		const startCharacter = line === bracketPosition.line ? bracketPosition.character : lineText.length - 1;
+		for (let character = startCharacter; character >= 0; character--) {
+			if (scannedCharacters >= MAX_BRACKET_SCAN_CHARACTERS) return;
+			scannedCharacters++;
+			if (isCharacterIgnoredBackward(ignoredRanges, character, ignoredRangeCursor)) continue;
+			const char = lineText[character];
+			if (char === bracketPosition.char) depth++;
+			else if (char === openingBracket) {
+				depth--;
+				if (depth === 0) return {
+					line,
+					character,
+					char
+				};
+			}
+		}
+	}
+}
+function isInIgnoredTokenRange(tokenizer, position) {
+	return isCharacterInIgnoredRanges(tokenizer.getStringCommentRegexpRangesInLine(position.line), position.character);
+}
+function isCharacterInIgnoredRanges(ranges, character) {
+	if (ranges === null) return false;
+	for (const [start, end] of ranges) {
+		if (character < start) return false;
+		if (character < end) return true;
+	}
+	return false;
+}
+function isCharacterIgnoredForward(ranges, character, cursor) {
+	if (ranges === null) return false;
+	while (cursor.index < ranges.length && character >= ranges[cursor.index][1]) cursor.index++;
+	const range = ranges[cursor.index];
+	return range !== void 0 && character >= range[0];
+}
+function isCharacterIgnoredBackward(ranges, character, cursor) {
+	if (ranges === null) return false;
+	while (cursor.index >= 0 && character < ranges[cursor.index][0]) cursor.index--;
+	const range = ranges[cursor.index];
+	return range !== void 0 && character < range[1];
+}
+function createBracketMatchRanges(firstPosition, secondPosition) {
+	if (firstPosition === void 0 || secondPosition === void 0) return;
+	return [createCharacterRange(firstPosition), createCharacterRange(secondPosition)];
+}
+function createCharacterRange(position) {
+	return {
+		start: {
+			line: position.line,
+			character: position.character
+		},
+		end: {
+			line: position.line,
+			character: position.character + 1
+		}
+	};
+}
+//#endregion
+export { findBracketMatchRanges };
+
+//# sourceMappingURL=matchBrackets.js.map

package/dist/editor/matchBrackets.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"matchBrackets.js","names":[],"sources":["../../src/editor/matchBrackets.ts"],"sourcesContent":["import type { Position, Range } from '../types';\nimport type { TextDocument } from './textDocument';\nimport type { EditorTokenizer } from './tokenizer';\n\nconst OPEN_BRACKETS = new Map([\n  ['(', ')'],\n  ['[', ']'],\n  ['{', '}'],\n]);\n\nconst CLOSE_BRACKETS = new Map(\n  [...OPEN_BRACKETS].map(([open, close]) => [close, open])\n);\n\nconst MAX_BRACKET_SCAN_LINES = 1_000;\nconst MAX_BRACKET_SCAN_CHARACTERS = 50_000;\n\ninterface BracketPosition extends Position {\n  char: string;\n}\n\nexport function findBracketMatchRanges<LAnnotation>(\n  textDocument: TextDocument<LAnnotation>,\n  tokenizer: EditorTokenizer,\n  position: Position\n): [open: Range, close: Range] | undefined {\n  const bracketPosition = findAdjacentBracket(\n    textDocument,\n    tokenizer,\n    textDocument.normalizePosition(position)\n  );\n  if (bracketPosition === undefined) {\n    return undefined;\n  }\n\n  const closingBracket = OPEN_BRACKETS.get(bracketPosition.char);\n  const openingBracket = CLOSE_BRACKETS.get(bracketPosition.char);\n  if (closingBracket !== undefined) {\n    const matchPosition = findClosingBracket(\n      textDocument,\n      tokenizer,\n      bracketPosition,\n      closingBracket\n    );\n    return createBracketMatchRanges(bracketPosition, matchPosition);\n  }\n  if (openingBracket !== undefined) {\n    const matchPosition = findOpeningBracket(\n      textDocument,\n      tokenizer,\n      bracketPosition,\n      openingBracket\n    );\n    return createBracketMatchRanges(matchPosition, bracketPosition);\n  }\n  return undefined;\n}\n\nfunction findAdjacentBracket<LAnnotation>(\n  textDocument: TextDocument<LAnnotation>,\n  tokenizer: EditorTokenizer,\n  position: Position\n): BracketPosition | undefined {\n  const previousPosition = getPreviousCharacterPosition(position);\n  if (previousPosition !== undefined) {\n    const previousBracket = getBracketAtPosition(\n      textDocument,\n      tokenizer,\n      previousPosition\n    );\n    if (previousBracket !== undefined) {\n      return previousBracket;\n    }\n  }\n  return getBracketAtPosition(textDocument, tokenizer, position);\n}\n\nfunction getPreviousCharacterPosition(\n  position: Position\n): Position | undefined {\n  if (position.character > 0) {\n    return { line: position.line, character: position.character - 1 };\n  }\n  // Bracket adjacency is line-local: column-zero carets are not visually next to\n  // the previous line's last character.\n  return undefined;\n}\n\nfunction getBracketAtPosition<LAnnotation>(\n  textDocument: TextDocument<LAnnotation>,\n  tokenizer: EditorTokenizer,\n  position: Position\n): BracketPosition | undefined {\n  const lineText = textDocument.getLineText(position.line);\n  const char = lineText[position.character];\n  if (\n    char === undefined ||\n    (!OPEN_BRACKETS.has(char) && !CLOSE_BRACKETS.has(char)) ||\n    isInIgnoredTokenRange(tokenizer, position)\n  ) {\n    return undefined;\n  }\n  return { ...position, char };\n}\n\nfunction findClosingBracket<LAnnotation>(\n  textDocument: TextDocument<LAnnotation>,\n  tokenizer: EditorTokenizer,\n  bracketPosition: BracketPosition,\n  closingBracket: string\n): BracketPosition | undefined {\n  let depth = 0;\n  let scannedLines = 0;\n  let scannedCharacters = 0;\n  for (let line = bracketPosition.line; line < textDocument.lineCount; line++) {\n    if (scannedLines >= MAX_BRACKET_SCAN_LINES) {\n      return undefined;\n    }\n    scannedLines++;\n    const lineText = textDocument.getLineText(line);\n    const ignoredRanges = tokenizer.getStringCommentRegexpRangesInLine(line);\n    const ignoredRangeCursor = { index: 0 };\n    const startCharacter =\n      line === bracketPosition.line ? bracketPosition.character : 0;\n    for (\n      let character = startCharacter;\n      character < lineText.length;\n      character++\n    ) {\n      if (scannedCharacters >= MAX_BRACKET_SCAN_CHARACTERS) {\n        return undefined;\n      }\n      scannedCharacters++;\n      if (\n        isCharacterIgnoredForward(ignoredRanges, character, ignoredRangeCursor)\n      ) {\n        continue;\n      }\n      const char = lineText[character];\n      if (char === bracketPosition.char) {\n        depth++;\n      } else if (char === closingBracket) {\n        depth--;\n        if (depth === 0) {\n          return { line, character, char };\n        }\n      }\n    }\n  }\n  return undefined;\n}\n\nfunction findOpeningBracket<LAnnotation>(\n  textDocument: TextDocument<LAnnotation>,\n  tokenizer: EditorTokenizer,\n  bracketPosition: BracketPosition,\n  openingBracket: string\n): BracketPosition | undefined {\n  let depth = 0;\n  let scannedLines = 0;\n  let scannedCharacters = 0;\n  for (let line = bracketPosition.line; line >= 0; line--) {\n    if (scannedLines >= MAX_BRACKET_SCAN_LINES) {\n      return undefined;\n    }\n    scannedLines++;\n    const lineText = textDocument.getLineText(line);\n    const ignoredRanges = tokenizer.getStringCommentRegexpRangesInLine(line);\n    const ignoredRangeCursor = {\n      index: ignoredRanges === null ? -1 : ignoredRanges.length - 1,\n    };\n    const startCharacter =\n      line === bracketPosition.line\n        ? bracketPosition.character\n        : lineText.length - 1;\n    for (let character = startCharacter; character >= 0; character--) {\n      if (scannedCharacters >= MAX_BRACKET_SCAN_CHARACTERS) {\n        return undefined;\n      }\n      scannedCharacters++;\n      if (\n        isCharacterIgnoredBackward(ignoredRanges, character, ignoredRangeCursor)\n      ) {\n        continue;\n      }\n      const char = lineText[character];\n      if (char === bracketPosition.char) {\n        depth++;\n      } else if (char === openingBracket) {\n        depth--;\n        if (depth === 0) {\n          return { line, character, char };\n        }\n      }\n    }\n  }\n  return undefined;\n}\n\nfunction isInIgnoredTokenRange(\n  tokenizer: EditorTokenizer,\n  position: Position\n): boolean {\n  const ranges = tokenizer.getStringCommentRegexpRangesInLine(position.line);\n  return isCharacterInIgnoredRanges(ranges, position.character);\n}\n\nfunction isCharacterInIgnoredRanges(\n  ranges: [start: number, end: number][] | null,\n  character: number\n): boolean {\n  if (ranges === null) {\n    return false;\n  }\n  for (const [start, end] of ranges) {\n    if (character < start) {\n      return false;\n    }\n    if (character < end) {\n      return true;\n    }\n  }\n  return false;\n}\n\nfunction isCharacterIgnoredForward(\n  ranges: [start: number, end: number][] | null,\n  character: number,\n  cursor: { index: number }\n): boolean {\n  if (ranges === null) {\n    return false;\n  }\n  while (cursor.index < ranges.length && character >= ranges[cursor.index][1]) {\n    cursor.index++;\n  }\n  const range = ranges[cursor.index];\n  return range !== undefined && character >= range[0];\n}\n\nfunction isCharacterIgnoredBackward(\n  ranges: [start: number, end: number][] | null,\n  character: number,\n  cursor: { index: number }\n): boolean {\n  if (ranges === null) {\n    return false;\n  }\n  while (cursor.index >= 0 && character < ranges[cursor.index][0]) {\n    cursor.index--;\n  }\n  const range = ranges[cursor.index];\n  return range !== undefined && character < range[1];\n}\n\nfunction createBracketMatchRanges(\n  firstPosition: Position | undefined,\n  secondPosition: Position | undefined\n): [open: Range, close: Range] | undefined {\n  if (firstPosition === undefined || secondPosition === undefined) {\n    return;\n  }\n  return [\n    createCharacterRange(firstPosition),\n    createCharacterRange(secondPosition),\n  ];\n}\n\nfunction createCharacterRange(position: Position): Range {\n  return {\n    start: { line: position.line, character: position.character },\n    end: { line: position.line, character: position.character + 1 },\n  };\n}\n"],"mappings":";AAIA,MAAM,gCAAgB,IAAI,IAAI;CAC5B,CAAC,KAAK,GAAG;CACT,CAAC,KAAK,GAAG;CACT,CAAC,KAAK,GAAG;AACX,CAAC;AAED,MAAM,iBAAiB,IAAI,IACzB,CAAC,GAAG,aAAa,CAAC,CAAC,KAAK,CAAC,MAAM,WAAW,CAAC,OAAO,IAAI,CAAC,CACzD;AAEA,MAAM,yBAAyB;AAC/B,MAAM,8BAA8B;AAMpC,SAAgB,uBACd,cACA,WACA,UACyC;CACzC,MAAM,kBAAkB,oBACtB,cACA,WACA,aAAa,kBAAkB,QAAQ,CACzC;CACA,IAAI,oBAAoB,KAAA,GACtB;CAGF,MAAM,iBAAiB,cAAc,IAAI,gBAAgB,IAAI;CAC7D,MAAM,iBAAiB,eAAe,IAAI,gBAAgB,IAAI;CAC9D,IAAI,mBAAmB,KAAA,GAOrB,OAAO,yBAAyB,iBANV,mBACpB,cACA,WACA,iBACA,cAE2D,CAAC;CAEhE,IAAI,mBAAmB,KAAA,GAOrB,OAAO,yBANe,mBACpB,cACA,WACA,iBACA,cAE0C,GAAG,eAAe;AAGlE;AAEA,SAAS,oBACP,cACA,WACA,UAC6B;CAC7B,MAAM,mBAAmB,6BAA6B,QAAQ;CAC9D,IAAI,qBAAqB,KAAA,GAAW;EAClC,MAAM,kBAAkB,qBACtB,cACA,WACA,gBACF;EACA,IAAI,oBAAoB,KAAA,GACtB,OAAO;CAEX;CACA,OAAO,qBAAqB,cAAc,WAAW,QAAQ;AAC/D;AAEA,SAAS,6BACP,UACsB;CACtB,IAAI,SAAS,YAAY,GACvB,OAAO;EAAE,MAAM,SAAS;EAAM,WAAW,SAAS,YAAY;CAAE;AAKpE;AAEA,SAAS,qBACP,cACA,WACA,UAC6B;CAE7B,MAAM,OADW,aAAa,YAAY,SAAS,IAC/B,CAAC,CAAC,SAAS;CAC/B,IACE,SAAS,KAAA,KACR,CAAC,cAAc,IAAI,IAAI,KAAK,CAAC,eAAe,IAAI,IAAI,KACrD,sBAAsB,WAAW,QAAQ,GAEzC;CAEF,OAAO;EAAE,GAAG;EAAU;CAAK;AAC7B;AAEA,SAAS,mBACP,cACA,WACA,iBACA,gBAC6B;CAC7B,IAAI,QAAQ;CACZ,IAAI,eAAe;CACnB,IAAI,oBAAoB;CACxB,KAAK,IAAI,OAAO,gBAAgB,MAAM,OAAO,aAAa,WAAW,QAAQ;EAC3E,IAAI,gBAAgB,wBAClB;EAEF;EACA,MAAM,WAAW,aAAa,YAAY,IAAI;EAC9C,MAAM,gBAAgB,UAAU,mCAAmC,IAAI;EACvE,MAAM,qBAAqB,EAAE,OAAO,EAAE;EACtC,MAAM,iBACJ,SAAS,gBAAgB,OAAO,gBAAgB,YAAY;EAC9D,KACE,IAAI,YAAY,gBAChB,YAAY,SAAS,QACrB,aACA;GACA,IAAI,qBAAqB,6BACvB;GAEF;GACA,IACE,0BAA0B,eAAe,WAAW,kBAAkB,GAEtE;GAEF,MAAM,OAAO,SAAS;GACtB,IAAI,SAAS,gBAAgB,MAC3B;QACK,IAAI,SAAS,gBAAgB;IAClC;IACA,IAAI,UAAU,GACZ,OAAO;KAAE;KAAM;KAAW;IAAK;GAEnC;EACF;CACF;AAEF;AAEA,SAAS,mBACP,cACA,WACA,iBACA,gBAC6B;CAC7B,IAAI,QAAQ;CACZ,IAAI,eAAe;CACnB,IAAI,oBAAoB;CACxB,KAAK,IAAI,OAAO,gBAAgB,MAAM,QAAQ,GAAG,QAAQ;EACvD,IAAI,gBAAgB,wBAClB;EAEF;EACA,MAAM,WAAW,aAAa,YAAY,IAAI;EAC9C,MAAM,gBAAgB,UAAU,mCAAmC,IAAI;EACvE,MAAM,qBAAqB,EACzB,OAAO,kBAAkB,OAAO,KAAK,cAAc,SAAS,EAC9D;EACA,MAAM,iBACJ,SAAS,gBAAgB,OACrB,gBAAgB,YAChB,SAAS,SAAS;EACxB,KAAK,IAAI,YAAY,gBAAgB,aAAa,GAAG,aAAa;GAChE,IAAI,qBAAqB,6BACvB;GAEF;GACA,IACE,2BAA2B,eAAe,WAAW,kBAAkB,GAEvE;GAEF,MAAM,OAAO,SAAS;GACtB,IAAI,SAAS,gBAAgB,MAC3B;QACK,IAAI,SAAS,gBAAgB;IAClC;IACA,IAAI,UAAU,GACZ,OAAO;KAAE;KAAM;KAAW;IAAK;GAEnC;EACF;CACF;AAEF;AAEA,SAAS,sBACP,WACA,UACS;CAET,OAAO,2BADQ,UAAU,mCAAmC,SAAS,IAC9B,GAAG,SAAS,SAAS;AAC9D;AAEA,SAAS,2BACP,QACA,WACS;CACT,IAAI,WAAW,MACb,OAAO;CAET,KAAK,MAAM,CAAC,OAAO,QAAQ,QAAQ;EACjC,IAAI,YAAY,OACd,OAAO;EAET,IAAI,YAAY,KACd,OAAO;CAEX;CACA,OAAO;AACT;AAEA,SAAS,0BACP,QACA,WACA,QACS;CACT,IAAI,WAAW,MACb,OAAO;CAET,OAAO,OAAO,QAAQ,OAAO,UAAU,aAAa,OAAO,OAAO,MAAM,CAAC,IACvE,OAAO;CAET,MAAM,QAAQ,OAAO,OAAO;CAC5B,OAAO,UAAU,KAAA,KAAa,aAAa,MAAM;AACnD;AAEA,SAAS,2BACP,QACA,WACA,QACS;CACT,IAAI,WAAW,MACb,OAAO;CAET,OAAO,OAAO,SAAS,KAAK,YAAY,OAAO,OAAO,MAAM,CAAC,IAC3D,OAAO;CAET,MAAM,QAAQ,OAAO,OAAO;CAC5B,OAAO,UAAU,KAAA,KAAa,YAAY,MAAM;AAClD;AAEA,SAAS,yBACP,eACA,gBACyC;CACzC,IAAI,kBAAkB,KAAA,KAAa,mBAAmB,KAAA,GACpD;CAEF,OAAO,CACL,qBAAqB,aAAa,GAClC,qBAAqB,cAAc,CACrC;AACF;AAEA,SAAS,qBAAqB,UAA2B;CACvD,OAAO;EACL,OAAO;GAAE,MAAM,SAAS;GAAM,WAAW,SAAS;EAAU;EAC5D,KAAK;GAAE,MAAM,SAAS;GAAM,WAAW,SAAS,YAAY;EAAE;CAChE;AACF"}

package/dist/editor/pieceTable.d.ts

@@ -1,12 +1,15 @@
+import { Position, Range } from "../types.js";
 import { SearchParams } from "./searchPanel.js";
-import { Position, Range, ResolvedTextEdit } from "./textDocument.js";
+import { ResolvedTextEdit } from "./textDocument.js";
 
 //#region src/editor/pieceTable.d.ts
-
 /**
  * A piece table is a data structure that allows for efficient insertion and deletion of text.
  * It is a tree of pieces, where each piece is a segment of text that is either original or added.
- * The tree is rebuilt as a balanced tree after edits to keep lookups efficient.
+ * The tree is a treap (a binary search tree that also keeps each node's random priority in heap
+ * order, which keeps the tree balanced without an explicit rebalancing pass). Each edit reshapes
+ * only the nodes along one root-to-leaf path via split and merge in O(log P), instead of
+ * rebuilding all P pieces.
  * Inspired by https://code.visualstudio.com/blogs/2018/03/23/text-buffer-reimplementation
  */
 declare class PieceTable {
@@ -14,20 +17,25 @@ declare class PieceTable {
   constructor(originalText: string);
   get lineCount(): number;
   getText(range?: Range): string;
-  getLineText(line: number, trimEOF?: boolean): string;
+  getLineText(line: number, includeLineBreak?: boolean): string;
+  getLineLength(line: number, includeLineBreak?: boolean): number;
   getTextSlice(start: number, end: number, trimEOF?: boolean): string;
   charAt(offset: number): string;
   includes(needle: string): boolean;
   findNextNonOverlappingSubstring(needle: string, occupied: readonly [start: number, end: number][]): number | undefined;
-  search(kind: 'findNext' | 'findPrevious' | 'findAll' | 'replace' | 'replaceAll', searchParams: SearchParams, range?: Range): [start: number, end: number][];
+  search(searchParams: SearchParams): [start: number, end: number][];
   insert(text: string, offset: number): void;
   delete(offset: number, length: number): void;
   applyEdits(edits: readonly ResolvedTextEdit[]): void;
   positionAt(offset: number): Position;
   positionsAt(offsets: readonly number[]): Position[];
   offsetAt(position: Position): number;
-  offsetsAt(positions: readonly Position[]): number[];
 }
+/**
+ * Builds the text to insert for one search match, including regex capture
+ * substitution when regex mode is enabled.
+ */
+declare function buildSearchReplacementText(positionAt: (offset: number) => Position, offsetAt: (position: Position) => number, getLineText: (line: number) => string, searchParams: SearchParams, matchStart: number, matchEnd: number): string;
 //#endregion
-export { PieceTable };
+export { PieceTable, buildSearchReplacementText };
 //# sourceMappingURL=pieceTable.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"pieceTable.d.ts","names":["SearchParams","Position","Range","ResolvedTextEdit","PieceTable"],"sources":["../../src/editor/pieceTable.d.ts"],"sourcesContent":["import type { SearchParams } from './searchPanel';\nimport type { Position, Range, ResolvedTextEdit } from './textDocument';\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 declare class PieceTable {\n    #private;\n    constructor(originalText: string);\n    get lineCount(): number;\n    getText(range?: Range): string;\n    getLineText(line: number, trimEOF?: boolean): string;\n    getTextSlice(start: number, end: number, trimEOF?: boolean): string;\n    charAt(offset: number): string;\n    includes(needle: string): boolean;\n    findNextNonOverlappingSubstring(needle: string, occupied: readonly [start: number, end: number][]): number | undefined;\n    search(kind: 'findNext' | 'findPrevious' | 'findAll' | 'replace' | 'replaceAll', searchParams: SearchParams, range?: Range): [start: number, end: number][];\n    insert(text: string, offset: number): void;\n    delete(offset: number, length: number): void;\n    applyEdits(edits: readonly ResolvedTextEdit[]): void;\n    positionAt(offset: number): Position;\n    positionsAt(offsets: readonly number[]): Position[];\n    offsetAt(position: Position): number;\n    offsetsAt(positions: readonly Position[]): number[];\n}\n//# sourceMappingURL=pieceTable.d.ts.map"],"mappings":";;;;;;;AAQA;;;;AAa+BG,cAbVC,UAAAA,CAaUD;EACCF,CAAAA,OAAAA;EACaA,WAAAA,CAAAA,YAAAA,EAAAA,MAAAA;EACtBA,IAAAA,SAAAA,CAAAA,CAAAA,EAAAA,MAAAA;EACWA,OAAAA,CAAAA,KAAAA,CAAAA,EAbdC,KAacD,CAAAA,EAAAA,MAAAA;EAAQ,WAAA,CAAA,IAAA,EAAA,MAAA,EAAA,OAAA,CAAA,EAAA,OAAA,CAAA,EAAA,MAAA;;;;;iGAPyDD,sBAAsBE;;;6BAG1FC;8BACCF;2CACaA;qBACtBA;gCACWA"}
+{"version":3,"file":"pieceTable.d.ts","names":[],"sources":["../../src/editor/pieceTable.ts"],"mappings":";;;;;;;AA6GA;;;;;;;cAAa,UAAA;EAAA;EAcX,WAAA,CAAY,YAAA;EAAA,IAQR,SAAA;EAIJ,OAAA,CAAQ,KAAA,GAAQ,KAAA;EAShB,WAAA,CAAY,IAAA,UAAc,gBAAA;EAkB1B,aAAA,CAAc,IAAA,UAAc,gBAAA;EAqC5B,YAAA,CAAa,KAAA,UAAe,GAAA,UAAa,OAAA;EAsCzC,MAAA,CAAO,MAAA;EAWP,QAAA,CAAS,MAAA;EA2BT,+BAAA,CACE,MAAA,UACA,QAAA,YAAoB,KAAA,UAAe,GAAA;EA0CrC,MAAA,CAAO,YAAA,EAAc,YAAA,IAAgB,KAAA,UAAe,GAAA;EA4EpD,MAAA,CAAO,IAAA,UAAc,MAAA;EAQrB,MAAA,CAAO,MAAA,UAAgB,MAAA;EAYvB,UAAA,CAAW,KAAA,WAAgB,gBAAA;EAgB3B,UAAA,CAAW,MAAA,WAAiB,QAAA;EAa5B,WAAA,CAAY,OAAA,sBAA6B,QAAA;EAgBzC,QAAA,CAAS,QAAA,EAAU,QAAA;AAAA;;;;;iBAioBL,0BAAA,CACd,UAAA,GAAa,MAAA,aAAmB,QAAA,EAChC,QAAA,GAAW,QAAA,EAAU,QAAA,aACrB,WAAA,GAAc,IAAA,qBACd,YAAA,EAAc,YAAA,EACd,UAAA,UACA,QAAA"}