Vihren Atlas

pieceTreeBase.ts ×5

Code frontier

unlabeled · c_f66e9e4ac927

16 tests · 39363 LOC · 238 files · introduces 0 tests · 37 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
5 ranges37 lines · 1 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
4615 ranges39363 lines · 238 files · Browse complete extent
All tests (intent)
16 testsBrowse complete intent

Neighbourhood graph

The orange circle is the focus. Violet and green circles are every ancestor and descendant, broader and narrower, at any distance; blue squares and pink diamonds are the introduced files and exact introduced tests of every visible concept, not only the focus's. Arrows point from broader to narrower concepts and bridge only concepts omitted from this view. Undirected links show source or test introduction. Concept and file size follows LOC; exact test nodes use test-count units.

Introduced files, introduced tests, and structurally relevant concept specialization

In the embedded map, ordinary wheel input scrolls the page; use the visible controls to zoom and drag to pan. Open the full-screen map for canvas navigation: wheel pans, Ctrl/Command plus wheel zooms, and arrow keys pan when this region is focused. On touch screens, open the full-screen map to pan or pinch. If JavaScript or WebGL is unavailable, use the native relationship evidence on this page.

Graph controls are ready.

Interactive rendering requires JavaScript and WebGL. Use the native relationship evidence on this page while the interactive map is unavailable.

Native relationship evidence

Every exact file and test below is linked only from the concept that introduces it.

Introduced tests

Every collected test enters the hierarchy at exactly one concept.

No tests are introduced at this concept. Its intent tests are introduced by other concepts.

Introduced code

Every collected source range enters the hierarchy at exactly one concept.

1 file ranked by introduced lines: 37 introduced LOC across 5 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

src/vs/editor/common/model/pieceTreeTextBuffer/pieceTreeBase.ts 37 introduced LOC · 5 ranges

Open complete file

861 piece.end.column === this._lastChangeBufferPos.column &&
862 (nodeStartOffset + piece.length === offset) &&
863 > value.length < AverageBufferSize pieceTreeBase.ts
864 ) {
865 > // changed buffer pieceTreeBase.ts
866 > this.appendToNode(node, value);
867 > this.computeBufferMetadata();
868 > return;
869 > }
870
871 if (nodeStartOffset === offset) {
1454
1455 private appendToNode(node: TreeNode, value: string): void {
1456 > if (this.adjustCarriageReturnFromNext(value, node)) { pieceTreeBase.ts
1457 value += '\n';
1458 }
1459 > pieceTreeBase.ts
1460 > const hitCRLF = this.shouldCheckCRLF() && this.startWithLF(value) && this.endWithCR(node);
1461 > const startOffset = this._buffers[0].buffer.length;
1462 > this._buffers[0].buffer += value;
1463 > const lineStarts = createLineStartsFast(value, false);
1464 > for (let i = 0; i < lineStarts.length; i++) {
1465 > lineStarts[i] += startOffset;
1466 > }
1467 > if (hitCRLF) {
1468 const prevStartOffset = this._buffers[0].lineStarts[this._buffers[0].lineStarts.length - 2];
1469 (<number[]>this._buffers[0].lineStarts).pop();
1471 this._lastChangeBufferPos = { line: this._lastChangeBufferPos.line - 1, column: startOffset - prevStartOffset };
1472 }
1473 > pieceTreeBase.ts
1474 > this._buffers[0].lineStarts = (<number[]>this._buffers[0].lineStarts).concat(<number[]>lineStarts.slice(1));
1475 > const endIndex = this._buffers[0].lineStarts.length - 1;
1476 > const endColumn = this._buffers[0].buffer.length - this._buffers[0].lineStarts[endIndex];
1477 > const newEnd = { line: endIndex, column: endColumn };
1478 > const newLength = node.piece.length + value.length;
1479 > const oldLineFeedCnt = node.piece.lineFeedCnt;
1480 > const newLineFeedCnt = this.getLineFeedCnt(0, node.piece.start, newEnd);
1481 > const lf_delta = newLineFeedCnt - oldLineFeedCnt;
1482 >
1483 > node.piece = new Piece(
1484 > node.piece.bufferIndex,
1485 > node.piece.start,
1486 > newEnd,
1487 > newLineFeedCnt,
1488 > newLength
1489 > );
1490 >
1491 > this._lastChangeBufferPos = newEnd;
1492 > updateTreeMetadata(this, node, value.length, lf_delta);
1493 > }
1494
1495 private nodeAt(offset: number): NodePosition {

Direct hierarchy

Parents

Children