Vihren Atlas

graph.ts ×12

Code frontier

unlabeled · c_0598b7cca7ab

3058 tests · 3391 LOC · 19 files · introduces 0 tests · 42 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
12 ranges42 lines · 1 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
481 ranges3391 lines · 19 files · Browse complete extent
All tests (intent)
3058 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: 42 introduced LOC across 12 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

src/vs/platform/instantiation/common/graph.ts 42 introduced LOC · 12 ranges

Open complete file

1 > /*--------------------------------------------------------------------------------------------- graph.ts
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 > export class Node<T> {
7 >
8 >
9 > readonly incoming = new Map<string, Node<T>>();
10 > readonly outgoing = new Map<string, Node<T>>();
11 >
12 > constructor(
13 readonly key: string,
14 readonly data: T
15 ) { }
16 > } graph.ts
17 >
18 > export class Graph<T> {
19 >
20 > private readonly _nodes = new Map<string, Node<T>>();
21 >
22 > constructor(private readonly _hashFn: (element: T) => string) {
23 // empty
24 }
25 > graph.ts
26 > roots(): Node<T>[] {
27 const ret: Node<T>[] = [];
28 for (const node of this._nodes.values()) {
33 return ret;
34 }
35 > graph.ts
36 > insertEdge(from: T, to: T): void {
37 const fromNode = this.lookupOrInsertNode(from);
38 const toNode = this.lookupOrInsertNode(to);
41 toNode.incoming.set(fromNode.key, fromNode);
42 }
43 > graph.ts
44 > removeNode(data: T): void {
45 const key = this._hashFn(data);
46 this._nodes.delete(key);
50 }
51 }
52 > graph.ts
53 > lookupOrInsertNode(data: T): Node<T> {
54 const key = this._hashFn(data);
55 let node = this._nodes.get(key);
62 return node;
63 }
64 > graph.ts
65 > lookup(data: T): Node<T> | undefined {
66 return this._nodes.get(this._hashFn(data));
67 }
68 > graph.ts
69 > isEmpty(): boolean {
70 return this._nodes.size === 0;
71 }
72 > graph.ts
73 > toString(): string {
74 const data: string[] = [];
75 for (const [key, value] of this._nodes) {
79 return data.join('\n');
80 }
81 > graph.ts
82 > /**
83 > * This is brute force and slow and **only** be used
84 > * to trouble shoot.
85 > */
86 > findCycleSlow() {
87 for (const [id, node] of this._nodes) {
88 const seen = new Set<string>([id]);
94 return undefined;
95 }
96 > graph.ts
97 > private _findCycle(node: Node<T>, seen: Set<string>): string | undefined {
98 for (const [id, outgoing] of node.outgoing) {
99 if (seen.has(id)) {
109 return undefined;
110 }
111 > } graph.ts

Direct hierarchy

Parents

Children