Vihren Atlas

path.ts ×7

Code frontier

unlabeled · c_a93ae1fd9609

64 tests · 3420 LOC · 18 files · introduces 0 tests · 25 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
7 ranges25 lines · 1 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
494 ranges3420 lines · 18 files · Browse complete extent
All tests (intent)
64 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 7 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

src/vs/base/common/path.ts 25 introduced LOC · 7 ranges

Open complete file

1359
1360 if (suffix !== undefined && suffix.length > 0 && suffix.length <= path.length) {
1361 > if (suffix === path) { path.ts
1362 return '';
1363 }
1364 > let extIdx = suffix.length - 1; path.ts
1365 > let firstNonSlashEnd = -1;
1366 > for (i = path.length - 1; i >= 0; --i) {
1367 > const code = path.charCodeAt(i);
1368 > if (code === CHAR_FORWARD_SLASH) {
1369 // If we reached a path separator that was not part of a set of path
1370 // separators at the end of the string, stop now
1373 break;
1374 }
1375 > } else { path.ts
1376 > if (firstNonSlashEnd === -1) {
1377 > // We saw the first non-path separator, remember this index in case
1378 > // we need it if the extension ends up not matching
1379 > matchedSlash = false;
1380 > firstNonSlashEnd = i + 1;
1381 > }
1382 > if (extIdx >= 0) {
1383 > // Try to match the explicit extension
1384 > if (code === suffix.charCodeAt(extIdx)) {
1385 if (--extIdx === -1) {
1386 // We matched the extension, so mark this as the end of our path
1388 end = i;
1389 }
1390 > } else { path.ts
1391 // Extension does not match, so our result is the entire path
1392 // component
1394 end = firstNonSlashEnd;
1395 }
1396 > } path.ts
1397 > }
1398 > }
1399 >
1400 > if (start === end) {
1401 end = firstNonSlashEnd;
1402 > } else if (end === -1) { path.ts
1403 end = path.length;
1404 }
1405 > return path.slice(start, end); path.ts
1406 > }
1407 for (i = path.length - 1; i >= 0; --i) {
1408 if (path.charCodeAt(i) === CHAR_FORWARD_SLASH) {

Direct hierarchy

Parents

Children