Vihren Atlas

instantiationService.ts ×8

Code frontier

unlabeled · c_c4371a52af17

544 tests · 7309 LOC · 36 files · introduces 0 tests · 39 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
8 ranges39 lines · 1 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
1076 ranges7309 lines · 36 files · Browse complete extent
All tests (intent)
544 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: 39 introduced LOC across 8 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

src/vs/platform/instantiation/common/instantiationService.ts 39 introduced LOC · 8 ranges

Open complete file

188 const thing = this._getServiceInstanceOrDescriptor(id);
189 if (thing instanceof SyncDescriptor) {
190 > return this._safeCreateAndCacheServiceInstance(id, thing, _trace.branch(id, true)); instantiationService.ts
191 } else {
192 _trace.branch(id, false);
199
200 private _safeCreateAndCacheServiceInstance<T>(id: ServiceIdentifier<T>, desc: SyncDescriptor<T>, _trace: Trace): T {
201 > if (this._activeInstantiations.has(id)) { instantiationService.ts
202 throw new Error(`illegal state - RECURSIVELY instantiating service '${id}'`);
203 }
204 > this._activeInstantiations.add(id); instantiationService.ts
205 > try {
206 > return this._createAndCacheServiceInstance(id, desc, _trace);
207 > } finally {
208 > this._activeInstantiations.delete(id);
209 > }
210 > }
211
212 private _createAndCacheServiceInstance<T>(id: ServiceIdentifier<T>, desc: SyncDescriptor<T>, _trace: Trace): T {
213 > instantiationService.ts
214 > type Triple = { id: ServiceIdentifier<any>; desc: SyncDescriptor<any>; _trace: Trace };
215 > const graph = new Graph<Triple>(data => data.id.toString());
216 >
217 > let cycleCount = 0;
218 > const stack = [{ id, desc, _trace }];
219 > const seen = new Set<string>();
220 > while (stack.length) {
221 > const item = stack.pop()!;
222 >
223 > if (seen.has(String(item.id))) {
224 continue;
225 }
226 > seen.add(String(item.id)); instantiationService.ts
227 >
228 > graph.lookupOrInsertNode(item);
229 >
230 > // a weak but working heuristic for cycle checks
231 > if (cycleCount++ > 1000) {
232 throw new CyclicDependencyError(graph);
233 }
234 > instantiationService.ts
235 > // check all dependencies for existence and if they need to be created first
236 > for (const dependency of _util.getServiceDependencies(item.desc.ctor)) {
237
238 const instanceOrDesc = this._getServiceInstanceOrDescriptor(dependency.id);
250 }
251 }
252 > } instantiationService.ts
253 >
254 > while (true) {
255 > const roots = graph.roots();
256 >
257 > // if there is no more roots but still
258 > // nodes in the graph we have a cycle
259 > if (roots.length === 0) {
260 > if (!graph.isEmpty()) {
261 throw new CyclicDependencyError(graph);
262 }
278 }
279 return <T>this._getServiceInstanceOrDescriptor(id);
280 > } instantiationService.ts
281
282 private _createServiceInstanceWithOwner<T>(id: ServiceIdentifier<T>, ctor: any, args: unknown[] = [], supportsDelayedInstantiation: boolean, _trace: Trace): T {

Direct hierarchy

Parents

Children