Vihren Atlas

path.ts ×5

Joint frontier

unlabeled · c_cb6948dd72ed

1 test · 3544 LOC · 18 files · introduces 1 test · 86 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
5 ranges86 lines · 1 files
Tests
1 test

Contains — complete concept membership

All code (extent)
512 ranges3544 lines · 18 files · Browse complete extent
All tests (intent)
1 testBrowse 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.

Introduced files, introduced tests, and structurally relevant concept specializationpath.ts ×1 · 6 introduced LOCpath.ts ×1path.ts ×1 · 5 introduced LOCpath.ts ×1path.ts ×7 · 25 introduced LOCpath.ts ×7path.ts ×1 · 2 introduced LOCpath.ts ×1path.ts ×1 · 2 introduced LOCpath.ts ×1path.ts ×1 · 1 introduced LOCpath.ts ×1path.ts ×2 · 3 introduced LOCpath.ts ×2path.ts ×1 · 3 introduced LOCpath.ts ×1uri.test|title=URI URI#file, win-speciale|occurrence=1, charCode.test|title=CharCode has good values|occurrence=1, +2 · 0 introduced LOCuri.test|title=URI URI#f…path.ts ×1 · 6 introduced LOCpath.ts ×1utils.ts ×3 · 9 introduced LOCutils.ts ×3path.ts ×3 · 9 introduced LOCpath.ts ×3path.ts ×2 · 3 introduced LOCpath.ts ×2path.ts ×3 · 10 introduced LOCpath.ts ×3lifecycle.ts ×2 · 4 introduced LOClifecycle.ts ×2lifecycle.ts ×1 · 2 introduced LOClifecycle.ts ×1lifecycle.ts ×4 · 8 introduced LOClifecycle.ts ×4lifecycle.ts ×6 · 16 introduced LOClifecycle.ts ×6lifecycle.ts ×1 · 2 introduced LOClifecycle.ts ×1lifecycle.ts ×1 · 2 introduced LOClifecycle.ts ×1path.ts ×2 · 3 introduced LOCpath.ts ×2lifecycle.ts ×1 · 3 introduced LOClifecycle.ts ×1map.ts ×97 · 3334 introduced LOCmap.ts ×97src/vs/base/common/arrays.ts · 949 LOCcommon/arrays.tssrc/vs/base/common/arraysFind.ts · 226 LOCcommon/arraysFind.tssrc/vs/base/common/assert.ts · 91 LOCcommon/assert.tssrc/vs/base/common/charCode.ts · 450 LOCcommon/charCode.tssrc/vs/base/common/collections.ts · 176 LOCcommon/collections.tssrc/vs/base/common/errors.ts · 357 LOCcommon/errors.tssrc/vs/base/common/functional.ts · 32 LOCcommon/functional.tssrc/vs/base/common/iterator.ts · 194 LOCcommon/iterator.tssrc/vs/base/common/lifecycle.ts · 974 LOCcommon/lifecycle.tssrc/vs/base/common/map.ts · 1016 LOCcommon/map.tssrc/vs/base/common/marshallingIds.ts · 33 LOCcommon/marshallingIds.tssrc/vs/base/common/path.ts · 1589 LOCcommon/path.tssrc/vs/base/common/platform.ts · 281 LOCcommon/platform.tssrc/vs/base/common/process.ts · 76 LOCcommon/process.tssrc/vs/base/common/types.ts · 410 LOCcommon/types.tssrc/vs/base/common/uri.ts · 754 LOCcommon/uri.tssrc/vs/base/test/common/utils.ts · 107 LOCcommon/utils.tssrc/vs/nls.ts · 244 LOCvs/nls.tscharCode.test|title=CharCode has good values|occurrence=1 · introduced test · mocha:v1|namespace=vscode@05c208e9e28d8c1c723fa08f85e2b7a96092e8e5|file=vs/base/test/common/charCode.test|title=CharCode has good values|occurrence=1charCode.test|title=Char…path.test|title=Paths (Node Implementation) basename|occurrence=1 · introduced test · mocha:v1|namespace=vscode@05c208e9e28d8c1c723fa08f85e2b7a96092e8e5|file=vs/base/test/common/path.test|title=Paths (Node Implementation) basename|occurrence=1path.test|title=Paths (N…path.test|title=Paths (Node Implementation) path|occurrence=1 · introduced test · mocha:v1|namespace=vscode@05c208e9e28d8c1c723fa08f85e2b7a96092e8e5|file=vs/base/test/common/path.test|title=Paths (Node Implementation) path|occurrence=1path.test|title=Paths (N…uri.test|title=URI File paths containing apostrophes break URI parsing and cannot be opened #276075|occurrence=1 · introduced test · mocha:v1|namespace=vscode@05c208e9e28d8c1c723fa08f85e2b7a96092e8e5|file=vs/base/test/common/uri.test|title=URI File paths containing apostrophes break URI parsing and cannot be opened #276075|occurrence=1uri.test|title=URI File …uri.test|title=URI URI#file, win-speciale|occurrence=1 · introduced test · mocha:v1|namespace=vscode@05c208e9e28d8c1c723fa08f85e2b7a96092e8e5|file=vs/base/test/common/uri.test|title=URI URI#file, win-speciale|occurrence=1uri.test|title=URI URI#f…Focused concept · path.ts ×5 · 86 introduced LOCpath.ts ×5

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.

1 test introduced at this concept.

Introduced code

Every collected source range enters the hierarchy at exactly one concept.

1 file ranked by introduced lines: 86 introduced LOC across 5 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

src/vs/base/common/path.ts 86 introduced LOC · 5 ranges

Open complete file

820
821 basename(path: string, suffix?: string): string {
822 > if (suffix !== undefined) { path.ts
823 > validateString(suffix, 'suffix');
824 > }
825 > validateString(path, 'path');
826 > let start = 0;
827 > let end = -1;
828 > let matchedSlash = true;
829 > let i;
830 >
831 > // Check for a drive letter prefix so as not to mistake the following
832 > // path separator as an extra separator at the end of the path that can be
833 > // disregarded
834 > if (path.length >= 2 &&
835 > isWindowsDeviceRoot(path.charCodeAt(0)) &&
836 > path.charCodeAt(1) === CHAR_COLON) {
837 > start = 2;
838 > }
839 >
840 > if (suffix !== undefined && suffix.length > 0 && suffix.length <= path.length) {
841 > if (suffix === path) {
842 > return '';
843 > }
844 > let extIdx = suffix.length - 1;
845 > let firstNonSlashEnd = -1;
846 > for (i = path.length - 1; i >= start; --i) {
847 > const code = path.charCodeAt(i);
848 > if (isPathSeparator(code)) {
849 > // If we reached a path separator that was not part of a set of path
850 > // separators at the end of the string, stop now
851 > if (!matchedSlash) {
852 > start = i + 1;
853 > break;
854 > }
855 > } else {
856 > if (firstNonSlashEnd === -1) {
857 > // We saw the first non-path separator, remember this index in case
858 > // we need it if the extension ends up not matching
859 > matchedSlash = false;
860 > firstNonSlashEnd = i + 1;
861 > }
862 > if (extIdx >= 0) {
863 > // Try to match the explicit extension
864 > if (code === suffix.charCodeAt(extIdx)) {
865 > if (--extIdx === -1) {
866 > // We matched the extension, so mark this as the end of our path
867 > // component
868 > end = i;
869 > }
870 > } else {
871 // Extension does not match, so our result is the entire path
872 // component
874 end = firstNonSlashEnd;
875 }
876 > } path.ts
877 > }
878 > }
879 >
880 > if (start === end) {
881 > end = firstNonSlashEnd;
882 > } else if (end === -1) {
883 > end = path.length;
884 > }
885 > return path.slice(start, end);
886 > }
887 > for (i = path.length - 1; i >= start; --i) {
888 > if (isPathSeparator(path.charCodeAt(i))) {
889 > // If we reached a path separator that was not part of a set of path
890 > // separators at the end of the string, stop now
891 > if (!matchedSlash) {
892 > start = i + 1;
893 > break;
894 > }
895 > } else if (end === -1) {
896 > // We saw the first non-path separator, mark this as the end of our
897 > // path component
898 > matchedSlash = false;
899 > end = i + 1;
900 > }
901 > }
902 >
903 > if (end === -1) {
904 > return '';
905 > }
906 > return path.slice(start, end);
907 > },
908
909 extname(path: string): string {
1360 if (suffix !== undefined && suffix.length > 0 && suffix.length <= path.length) {
1361 if (suffix === path) {
1362 > return ''; path.ts
1363 > }
1364 let extIdx = suffix.length - 1;
1365 let firstNonSlashEnd = -1;
1399
1400 if (start === end) {
1401 > end = firstNonSlashEnd; path.ts
1402 } else if (end === -1) {
1403 > end = path.length; path.ts
1404 > }
1405 return path.slice(start, end);
1406 }

Direct hierarchy

Children