Vihren Atlas

pieceTreeBase.ts ×9

Code frontier

unlabeled · c_da8e129c6c8d

335 tests · 39204 LOC · 238 files · introduces 0 tests · 41 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
9 ranges41 lines · 1 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
4564 ranges39204 lines · 238 files · Browse complete extent
All tests (intent)
335 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: 41 introduced LOC across 9 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

src/vs/editor/common/model/pieceTreeTextBuffer/pieceTreeBase.ts 41 introduced LOC · 9 ranges

Open complete file

58 return createUintArray(r);
59 } else {
60 > return r; pieceTreeBase.ts
61 > }
62 }
63
848 // #region Piece Table
849 public insert(offset: number, value: string, eolNormalized: boolean = false): void {
850 > this._EOLNormalized = this._EOLNormalized && eolNormalized; pieceTreeBase.ts
851 > this._lastVisitedLine.lineNumber = 0;
852 > this._lastVisitedLine.value = '';
853 >
854 > if (this.root !== SENTINEL) {
855 const { node, remainder, nodeStartOffset } = this.nodeAt(offset);
856 const piece = node.piece;
931 this.insertContentToNodeRight(value, node);
932 }
933 > } else { pieceTreeBase.ts
934 // insert new node
935 const pieces = this.createNewPieces(value);
940 }
941 }
942 > pieceTreeBase.ts
943 > // todo, this is too brutal. Total line feed count should be updated the same way as lf_left.
944 > this.computeBufferMetadata();
945 > }
946
947 public delete(offset: number, cnt: number): void {
1163
1164 private createNewPieces(text: string): Piece[] {
1165 > if (text.length > AverageBufferSize) { pieceTreeBase.ts
1166 // the content is large, operations like substring, charCode becomes slow
1167 // so here we split it into smaller chunks, just like what we did for CR/LF normalization
1202 return newPieces;
1203 }
1204 > pieceTreeBase.ts
1205 > let startOffset = this._buffers[0].buffer.length;
1206 > const lineStarts = createLineStartsFast(text, false);
1207 >
1208 > let start = this._lastChangeBufferPos;
1209 > if (this._buffers[0].lineStarts[this._buffers[0].lineStarts.length - 1] === startOffset
1210 > && startOffset !== 0
1211 && this.startWithLF(text)
1212 && this.endWithCR(this._buffers[0].buffer) // todo, we can check this._lastChangeBufferPos's column as it's the last one
1213 > ) { pieceTreeBase.ts
1214 this._lastChangeBufferPos = { line: this._lastChangeBufferPos.line, column: this._lastChangeBufferPos.column + 1 };
1215 start = this._lastChangeBufferPos;
1222 this._buffers[0].buffer += '_' + text;
1223 startOffset += 1;
1224 > } else { pieceTreeBase.ts
1225 > if (startOffset !== 0) {
1226 for (let i = 0; i < lineStarts.length; i++) {
1227 lineStarts[i] += startOffset;
1228 }
1229 }
1230 > this._buffers[0].lineStarts = (<number[]>this._buffers[0].lineStarts).concat(<number[]>lineStarts.slice(1)); pieceTreeBase.ts
1231 > this._buffers[0].buffer += text;
1232 > }
1233 >
1234 > const endOffset = this._buffers[0].buffer.length;
1235 > const endIndex = this._buffers[0].lineStarts.length - 1;
1236 > const endColumn = endOffset - this._buffers[0].lineStarts[endIndex];
1237 > const endPos = { line: endIndex, column: endColumn };
1238 > const newPiece = new Piece(
1239 > 0, /** todo@peng */
1240 > start,
1241 > endPos,
1242 > this.getLineFeedCnt(0, start, endPos),
1243 > endOffset - startOffset
1244 > );
1245 > this._lastChangeBufferPos = endPos;
1246 > return [newPiece];
1247 > }
1248
1249 public getLinesRawContent(): string {

Direct hierarchy

Parents

Children