Vihren Atlas

path.ts ×8

Code frontier

unlabeled · c_23947639467e

2 tests · 3558 LOC · 18 files · introduces 0 tests · 101 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
8 ranges101 lines · 1 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
510 ranges3558 lines · 18 files · Browse complete extent
All tests (intent)
2 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.

Introduced files, introduced tests, and structurally relevant concept specializationpath.ts ×7 · 104 introduced LOCpath.ts ×7path.ts ×3 · 9 introduced LOCpath.ts ×3path.ts ×3 · 28 introduced LOCpath.ts ×3path.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…utils.ts ×3 · 9 introduced LOCutils.ts ×3path.ts ×1 · 2 introduced LOCpath.ts ×1path.ts ×3 · 10 introduced LOCpath.ts ×3lifecycle.ts ×2 · 4 introduced LOClifecycle.ts ×2path.ts ×1 · 1 introduced LOCpath.ts ×1lifecycle.ts ×1 · 2 introduced LOClifecycle.ts ×1path.ts ×6 · 24 introduced LOCpath.ts ×6lifecycle.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) 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…path.test|title=Paths (Node Implementation) relative|occurrence=1 · introduced test · mocha:v1|namespace=vscode@05c208e9e28d8c1c723fa08f85e2b7a96092e8e5|file=vs/base/test/common/path.test|title=Paths (Node Implementation) relative|occurrence=1path.test|title=Paths (N…path.test|title=Paths (Node Implementation) resolve|occurrence=1 · introduced test · mocha:v1|namespace=vscode@05c208e9e28d8c1c723fa08f85e2b7a96092e8e5|file=vs/base/test/common/path.test|title=Paths (Node Implementation) resolve|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 ×8 · 101 introduced LOCpath.ts ×8

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: 101 introduced LOC across 8 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

src/vs/base/common/path.ts 101 introduced LOC · 8 ranges

Open complete file

208 // path.resolve([from ...], to)
209 resolve(...pathSegments: string[]): string {
210 > let resolvedDevice = ''; path.ts
211 > let resolvedTail = '';
212 > let resolvedAbsolute = false;
213 >
214 > for (let i = pathSegments.length - 1; i >= -1; i--) {
215 > let path;
216 > if (i >= 0) {
217 > path = pathSegments[i];
218 > validateString(path, `paths[${i}]`);
219 >
220 > // Skip empty entries
221 > if (path.length === 0) {
222 continue;
223 }
224 > } else if (resolvedDevice.length === 0) { path.ts
225 path = process.cwd();
226 } else {
240 }
241 }
242 > path.ts
243 > const len = path.length;
244 > let rootEnd = 0;
245 > let device = '';
246 > let isAbsolute = false;
247 > const code = path.charCodeAt(0);
248 >
249 > // Try to match a root
250 > if (len === 1) {
251 if (isPathSeparator(code)) {
252 // `path` contains just a path separator
254 isAbsolute = true;
255 }
256 > } else if (isPathSeparator(code)) { path.ts
257 > // Possible UNC root
258 >
259 > // If we started with a separator, we know we at least have an
260 > // absolute path of some kind (UNC or otherwise)
261 > isAbsolute = true;
262 >
263 > if (isPathSeparator(path.charCodeAt(1))) {
264 > // Matched double path separator at beginning
265 > let j = 2;
266 > let last = j;
267 > // Match 1 or more non-path separators
268 > while (j < len && !isPathSeparator(path.charCodeAt(j))) {
269 > j++;
270 > }
271 > if (j < len && j !== last) {
272 > const firstPart = path.slice(last, j);
273 > // Matched!
274 > last = j;
275 > // Match 1 or more path separators
276 > while (j < len && isPathSeparator(path.charCodeAt(j))) {
277 > j++;
278 > }
279 > if (j < len && j !== last) {
280 > // Matched!
281 > last = j;
282 > // Match 1 or more non-path separators
283 > while (j < len && !isPathSeparator(path.charCodeAt(j))) {
284 > j++;
285 > }
286 > if (j === len || j !== last) {
287 > // We matched a UNC root
288 > device = `\\\\${firstPart}\\${path.slice(last, j)}`;
289 > rootEnd = j;
290 > }
291 > }
292 > }
293 > } else {
294 rootEnd = 1;
295 }
296 > } else if (isWindowsDeviceRoot(code) && path.ts
297 > path.charCodeAt(1) === CHAR_COLON) {
298 > // Possible device root
299 > device = path.slice(0, 2);
300 > rootEnd = 2;
301 > if (len > 2 && isPathSeparator(path.charCodeAt(2))) {
302 > // Treat separator following drive name as an absolute path
303 > // indicator
304 > isAbsolute = true;
305 > rootEnd = 3;
306 > }
307 > }
308 >
309 > if (device.length > 0) {
310 > if (resolvedDevice.length > 0) {
311 if (device.toLowerCase() !== resolvedDevice.toLowerCase()) {
312 // This path points to another device so it is not applicable
313 continue;
314 }
315 > } else { path.ts
316 > resolvedDevice = device;
317 > }
318 > }
319 >
320 > if (resolvedAbsolute) {
321 if (resolvedDevice.length > 0) {
322 break;
323 }
324 > } else { path.ts
325 > resolvedTail = `${path.slice(rootEnd)}\\${resolvedTail}`;
326 > resolvedAbsolute = isAbsolute;
327 > if (isAbsolute && resolvedDevice.length > 0) {
328 > break;
329 > }
330 > }
331 > }
332 >
333 > // At this point the path should be resolved to a full absolute path,
334 > // but handle relative paths to be safe (might happen when process.cwd()
335 > // fails)
336 >
337 > // Normalize the tail path
338 > resolvedTail = normalizeString(resolvedTail, !resolvedAbsolute, '\\',
339 > isPathSeparator);
340 >
341 > return resolvedAbsolute ?
342 > `${resolvedDevice}\\${resolvedTail}` :
343 `${resolvedDevice}${resolvedTail}` || '.';
344 > }, path.ts
345
346 normalize(path: string): string {

Direct hierarchy

Parents

Children