Vihren Atlas

pieceTreeBase.ts ×4

Code frontier

unlabeled · c_7e2f923737ac

170 tests · 39368 LOC · 238 files · introduces 0 tests · 26 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
4 ranges26 lines · 1 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
4608 ranges39368 lines · 238 files · Browse complete extent
All tests (intent)
170 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: 26 introduced LOC across 4 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

src/vs/editor/common/model/pieceTreeTextBuffer/pieceTreeBase.ts 26 introduced LOC · 4 ranges

Open complete file

873 this._searchCache.validate(offset);
874 } else if (nodeStartOffset + node.piece.length > offset) {
875 > // we are inserting into the middle of a node. pieceTreeBase.ts
876 > const nodesToDel: TreeNode[] = [];
877 > let newRightPiece = new Piece(
878 > piece.bufferIndex,
879 > insertPosInBuffer,
880 > piece.end,
881 > this.getLineFeedCnt(piece.bufferIndex, insertPosInBuffer, piece.end),
882 > this.offsetInBuffer(bufferIndex, piece.end) - this.offsetInBuffer(bufferIndex, insertPosInBuffer)
883 > );
884 >
885 > if (this.shouldCheckCRLF() && this.endWithCR(value)) {
886 const headOfRight = this.nodeCharCodeAt(node, remainder);
887
899 }
900 }
901 > pieceTreeBase.ts
902 > // reuse node for content before insertion point.
903 > if (this.shouldCheckCRLF() && this.startWithLF(value)) {
904 const tailOfLeft = this.nodeCharCodeAt(node, remainder - 1);
905 if (tailOfLeft === 13 /** \r */) {
914 this.deleteNodeTail(node, insertPosInBuffer);
915 }
916 > } else { pieceTreeBase.ts
917 this.deleteNodeTail(node, insertPosInBuffer);
918 }
919 > pieceTreeBase.ts
920 > const newPieces = this.createNewPieces(value);
921 > if (newRightPiece.length > 0) {
922 > this.rbInsertRight(node, newRightPiece);
923 > }
924 >
925 > let tmpNode = node;
926 > for (let k = 0; k < newPieces.length; k++) {
927 > tmpNode = this.rbInsertRight(tmpNode, newPieces[k]);
928 > }
929 > this.deleteNodes(nodesToDel);
930 } else {
931 this.insertContentToNodeRight(value, node);

Direct hierarchy

Parents

Children