Vihren Atlas

map.ts ×8

Code frontier

unlabeled · c_b29a57f96b44

347 tests · 3406 LOC · 18 files · introduces 0 tests · 22 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
8 ranges22 lines · 1 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
489 ranges3406 lines · 18 files · Browse complete extent
All tests (intent)
347 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: 22 introduced LOC across 8 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

src/vs/base/common/map.ts 22 introduced LOC · 8 ranges

Open complete file

284
285 set(key: K, value: V, touch: Touch = Touch.None): this {
286 > let item = this._map.get(key); map.ts
287 > if (item) {
288 item.value = value;
289 if (touch !== Touch.None) {
290 this.touch(item, touch);
291 }
292 > } else { map.ts
293 > item = { key, value, next: undefined, previous: undefined };
294 > switch (touch) {
295 > case Touch.None:
296 this.addItemLast(item);
297 break;
298 > case Touch.AsOld: map.ts
299 this.addItemFirst(item);
300 break;
301 > case Touch.AsNew: map.ts
302 this.addItemLast(item);
303 break;
304 > default: map.ts
305 this.addItemLast(item);
306 break;
307 > } map.ts
308 > this._map.set(key, item);
309 > this._size++;
310 > }
311 > return this;
312 > }
313
314 delete(key: K): boolean {
497
498 private addItemLast(item: Item<K, V>): void {
499 > // First time Insert map.ts
500 > if (!this._head && !this._tail) {
501 > this._head = item;
502 > } else if (!this._tail) {
503 throw new Error('Invalid list');
504 } else {
506 this._tail.next = item;
507 }
508 > this._tail = item; map.ts
509 > this._state++;
510 > }
511
512 private removeItem(item: Item<K, V>): void {

Direct hierarchy

Parents

Children