Vihren Atlas

src/vs/platform/uriIdentity/common/uriIdentityService.ts

128 LOC · 113 covered · 15 uncovered · 18 ranges · 812 concepts · 6 introducers · 494 tests

File neighbourhood

The centred file is linked to every concept that introduces one of its ranges, every test that runs code from the file, and the gray connector concepts standing between those tests and the file's own introducer concepts. Undirected links join concepts to every file where they introduce source and concepts to the tests they introduce; arrows show specialization between the displayed concepts and bridge only concepts omitted from this view. Concept colors match the source ranges below; connector concepts have no source color and are shown in gray.

Focused file, its introducer and connector concepts, their introduced files, and tests that run code from the file

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 related-file, concept, and source links on this page.

Graph controls are ready.

Interactive rendering requires JavaScript and WebGL. Use the related-file, concept, and source links on this page while the interactive map is unavailable.

Files with a broader (ancestor) concept 35

These files introduce code for a direct ancestor — a broader, larger-extent concept — of a concept that introduces code here.

Files with a narrower (descendant) concept 9

These files introduce code for a direct descendant — a narrower, larger-intent concept — of a concept that introduces code here.

1 > /*--------------------------------------------------------------------------------------------- uriIdentityService.ts ×6
2 > * Copyright (c) Microsoft Corporation. All rights reserved.
3 > * Licensed under the MIT License. See License.txt in the project root for license information.
4 > *--------------------------------------------------------------------------------------------*/
5 >
6 > import { IUriIdentityService } from './uriIdentity.js';
7 > import { URI } from '../../../base/common/uri.js';
8 > import { InstantiationType, registerSingleton } from '../../instantiation/common/extensions.js';
9 > import { IFileService, FileSystemProviderCapabilities, IFileSystemProviderCapabilitiesChangeEvent, IFileSystemProviderRegistrationEvent } from '../../files/common/files.js';
10 > import { ExtUri, IExtUri, normalizePath } from '../../../base/common/resources.js';
11 > import { Event } from '../../../base/common/event.js';
12 > import { DisposableStore } from '../../../base/common/lifecycle.js';
13 > import { quickSelect } from '../../../base/common/arrays.js';
14 >
15 > class Entry {
16 > static _clock = 0;
17 > time: number = Entry._clock++;
18 > constructor(readonly uri: URI) { }
19 > touch() {
20 > this.time = Entry._clock++; uriIdentityService.ts ×2
21 > return this;
22 > }
23 > } uriIdentityService.ts ×6
24 >
25 > export class UriIdentityService implements IUriIdentityService {
26 >
27 > declare readonly _serviceBrand: undefined;
28 >
29 > readonly extUri: IExtUri;
30 >
31 > private readonly _dispooables = new DisposableStore();
32 > private readonly _canonicalUris: Map<string, Entry>;
33 > private readonly _limit = 2 ** 16;
34 >
35 > constructor(@IFileService private readonly _fileService: IFileService) {
36 > uriIdentityService.ts ×4
37 > const schemeIgnoresPathCasingCache = new Map<string, boolean>();
38 >
39 > // assume path casing matters unless the file system provider spec'ed the opposite.
40 > // for all other cases path casing matters, e.g for
41 > // * virtual documents
42 > // * in-memory uris
43 > // * all kind of "private" schemes
44 > const ignorePathCasing = (uri: URI): boolean => {
45 > let ignorePathCasing = schemeIgnoresPathCasingCache.get(uri.scheme); uriIdentityService.ts ×1
46 > if (ignorePathCasing === undefined) {
47 > // retrieve once and then case per scheme until a change happens
48 > ignorePathCasing = _fileService.hasProvider(uri) && !this._fileService.hasCapability(uri, FileSystemProviderCapabilities.PathCaseSensitive);
49 > schemeIgnoresPathCasingCache.set(uri.scheme, ignorePathCasing);
50 > }
51 > return ignorePathCasing;
52 > };
53 > this._dispooables.add(Event.any<IFileSystemProviderCapabilitiesChangeEvent | IFileSystemProviderRegistrationEvent>( uriIdentityService.ts ×4
54 > _fileService.onDidChangeFileSystemProviderRegistrations,
55 > _fileService.onDidChangeFileSystemProviderCapabilities
56 > )(e => {
57 const oldIgnorePathCasingValue = schemeIgnoresPathCasingCache.get(e.scheme);
58 if (oldIgnorePathCasingValue === undefined) {
59 return;
60 }
61 schemeIgnoresPathCasingCache.delete(e.scheme);
62 const newIgnorePathCasingValue = ignorePathCasing(URI.from({ scheme: e.scheme }));
63 if (newIgnorePathCasingValue === newIgnorePathCasingValue) {
64 return;
65 }
66 for (const [key, entry] of this._canonicalUris.entries()) {
67 if (entry.uri.scheme !== e.scheme) {
68 continue;
69 }
70 this._canonicalUris.delete(key);
71 }
72 > })); uriIdentityService.ts ×4
73 >
74 > this.extUri = new ExtUri(ignorePathCasing);
75 > this._canonicalUris = new Map();
76 > }
77 > uriIdentityService.ts ×6
78 > dispose(): void {
79 > this._dispooables.dispose(); uriIdentityService.ts ×4
80 > this._canonicalUris.clear();
81 > }
82 > uriIdentityService.ts ×6
83 > asCanonicalUri(uri: URI): URI {
84 > uriIdentityService.ts ×4
85 > // (1) normalize URI
86 > if (this._fileService.hasProvider(uri)) {
87 > uri = normalizePath(uri);
88 > }
89 >
90 > // (2) find the uri in its canonical form or use this uri to define it
91 > const uriKey = this.extUri.getComparisonKey(uri, true);
92 > const item = this._canonicalUris.get(uriKey);
93 > if (item) {
94 > return item.touch().uri.with({ fragment: uri.fragment }); uriIdentityService.ts ×2
95 > }
96 > uriIdentityService.ts ×4
97 > // this uri is first and defines the canonical form
98 > this._canonicalUris.set(uriKey, new Entry(uri));
99 > this._checkTrim();
100 >
101 > return uri;
102 > }
103 > uriIdentityService.ts ×6
104 > private _checkTrim(): void {
105 > if (this._canonicalUris.size < this._limit) { uriIdentityService.ts ×4
106 > return;
107 > }
108 > uriIdentityService.ts ×1
109 > Entry._clock = 1;
110 > const times = [...this._canonicalUris.values()].map(e => e.time);
111 > const median = quickSelect(
112 > Math.floor(times.length / 2),
113 > times,
114 > (a, b) => a - b);
115 > for (const [key, entry] of this._canonicalUris.entries()) {
116 > // Its important to remove the median value here (<= not <).
117 > // If we have not touched any items since the last trim, the
118 > // median will be 0 and no items will be removed otherwise.
119 > if (entry.time <= median) {
120 > this._canonicalUris.delete(key);
121 > } else {
122 > entry.time = 0;
123 > }
124 > }
125 > } uriIdentityService.ts ×4
126 > } uriIdentityService.ts ×6
127 >
128 > registerSingleton(IUriIdentityService, UriIdentityService, InstantiationType.Delayed);