Vihren Atlas

pieceTreeBase.ts ×6

Code frontier

unlabeled · c_4e8ac52ce25e

215 tests · 39238 LOC · 238 files · introduces 0 tests · 25 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
6 ranges25 lines · 1 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
4569 ranges39238 lines · 238 files · Browse complete extent
All tests (intent)
215 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: 25 introduced LOC across 6 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

src/vs/editor/common/model/pieceTreeTextBuffer/pieceTreeBase.ts 25 introduced LOC · 6 ranges

Open complete file

417
418 public getPositionAt(offset: number): Position {
419 > offset = Math.floor(offset); pieceTreeBase.ts
420 > offset = Math.max(0, offset);
421 >
422 > let x = this.root;
423 > let lfCnt = 0;
424 > const originalOffset = offset;
425 >
426 > while (x !== SENTINEL) {
427 > if (x.size_left !== 0 && x.size_left >= offset) {
428 x = x.left;
429 > } else if (x.size_left + x.piece.length >= offset) { pieceTreeBase.ts
430 > const out = this.getIndexOf(x, offset - x.size_left);
431 >
432 > lfCnt += x.lf_left + out.index;
433 >
434 > if (out.index === 0) {
435 const lineStartOffset = this.getOffsetAt(lfCnt + 1, 1);
436 const column = originalOffset - lineStartOffset;
452 }
453 }
454 > } pieceTreeBase.ts
455
456 return new Position(1, 1);
457 > } pieceTreeBase.ts
458
459 public getValueInRange(range: Range, eol?: string): string {
1342 // #region node operations
1343 private getIndexOf(node: TreeNode, accumulatedValue: number): { index: number; remainder: number } {
1344 > const piece = node.piece; pieceTreeBase.ts
1345 > const pos = this.positionInBuffer(node, accumulatedValue);
1346 > const lineCnt = pos.line - piece.start.line;
1347 >
1348 > if (this.offsetInBuffer(piece.bufferIndex, piece.end) - this.offsetInBuffer(piece.bufferIndex, piece.start) === accumulatedValue) {
1349 // we are checking the end of this node, so a CRLF check is necessary.
1350 const realLineCnt = this.getLineFeedCnt(node.piece.bufferIndex, piece.start, pos);
1354 }
1355 }
1356 > pieceTreeBase.ts
1357 > return { index: lineCnt, remainder: pos.column };
1358 > }
1359
1360 private getAccumulatedValue(node: TreeNode, index: number) {

Direct hierarchy

Parents

Children