Vihren Atlas

pieceTreeBase.ts ×2

Code frontier

unlabeled · c_d395d16f6322

177 tests · 39299 LOC · 238 files · introduces 0 tests · 39 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
2 ranges39 lines · 1 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
4586 ranges39299 lines · 238 files · Browse complete extent
All tests (intent)
177 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: 39 introduced LOC across 2 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

src/vs/editor/common/model/pieceTreeTextBuffer/pieceTreeBase.ts 39 introduced LOC · 2 ranges

Open complete file

983 return;
984 }
985 > pieceTreeBase.ts
986 > // delete content in the middle, this node will be splitted to nodes
987 > this.shrinkNode(startNode, startSplitPosInBuffer, endSplitPosInBuffer);
988 > this.computeBufferMetadata();
989 > return;
990 > }
991
992 const nodesToDel: TreeNode[] = [];
1419
1420 private shrinkNode(node: TreeNode, start: BufferCursor, end: BufferCursor) {
1421 > const piece = node.piece; pieceTreeBase.ts
1422 > const originalStartPos = piece.start;
1423 > const originalEndPos = piece.end;
1424 >
1425 > // old piece, originalStartPos, start
1426 > const oldLength = piece.length;
1427 > const oldLFCnt = piece.lineFeedCnt;
1428 > const newEnd = start;
1429 > const newLineFeedCnt = this.getLineFeedCnt(piece.bufferIndex, piece.start, newEnd);
1430 > const newLength = this.offsetInBuffer(piece.bufferIndex, start) - this.offsetInBuffer(piece.bufferIndex, originalStartPos);
1431 >
1432 > node.piece = new Piece(
1433 > piece.bufferIndex,
1434 > piece.start,
1435 > newEnd,
1436 > newLineFeedCnt,
1437 > newLength
1438 > );
1439 >
1440 > updateTreeMetadata(this, node, newLength - oldLength, newLineFeedCnt - oldLFCnt);
1441 >
1442 > // new right piece, end, originalEndPos
1443 > const newPiece = new Piece(
1444 > piece.bufferIndex,
1445 > end,
1446 > originalEndPos,
1447 > this.getLineFeedCnt(piece.bufferIndex, end, originalEndPos),
1448 > this.offsetInBuffer(piece.bufferIndex, originalEndPos) - this.offsetInBuffer(piece.bufferIndex, end)
1449 > );
1450 >
1451 > const newNode = this.rbInsertRight(node, newPiece);
1452 > this.validateCRLFWithPrevNode(newNode);
1453 > }
1454
1455 private appendToNode(node: TreeNode, value: string): void {

Direct hierarchy

Parents

Children