1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
|
/*---------------------------------------------------------------------------------------------
* Copyright (c) Microsoft Corporation. All rights reserved.
* Licensed under the MIT License. See License.txt in the project root for license information.
*--------------------------------------------------------------------------------------------*/
import { IIdentityProvider } from 'vs/base/browser/ui/list/list';
import { ObjectTree } from 'vs/base/browser/ui/tree/objectTree';
import { ITreeElement } from 'vs/base/browser/ui/tree/tree';
import { IActionableTestTreeElement, TestExplorerTreeElement, TestItemTreeElement, TestTreeErrorMessage } from 'vs/workbench/contrib/testing/browser/explorerProjections/index';
export const testIdentityProvider: IIdentityProvider<TestExplorerTreeElement> = {
getId(element) {
return element.treeId + '\0' + (element instanceof TestTreeErrorMessage ? 'error' : element.test.expand);
}
};
/**
* Removes nodes from the set whose parents don't exist in the tree. This is
* useful to remove nodes that are queued to be updated or rendered, who will
* be rendered by a call to setChildren.
*/
export const pruneNodesWithParentsNotInTree = <T extends TestItemTreeElement>(nodes: Set<T | null>, tree: ObjectTree<TestExplorerTreeElement, any>) => {
for (const node of nodes) {
if (node && node.parent && !tree.hasElement(node.parent)) {
nodes.delete(node);
}
}
};
/**
* Returns whether there are any children for other nodes besides this one
* in the tree.
*
* This is used for omitting test provider nodes if there's only a single
* test provider in the workspace (the common case)
*/
export const peersHaveChildren = (node: IActionableTestTreeElement, roots: () => Iterable<IActionableTestTreeElement>) => {
for (const child of node.parent ? node.parent.children : roots()) {
if (child !== node && child.children.size) {
return true;
}
}
return false;
};
export const enum NodeRenderDirective {
/** Omit node and all its children */
Omit,
/** Concat children with parent */
Concat
}
export type NodeRenderFn = (
n: TestExplorerTreeElement,
recurse: (items: Iterable<TestExplorerTreeElement>) => Iterable<ITreeElement<TestExplorerTreeElement>>,
) => ITreeElement<TestExplorerTreeElement> | NodeRenderDirective;
const pruneNodesNotInTree = (nodes: Set<TestExplorerTreeElement | null>, tree: ObjectTree<TestExplorerTreeElement, any>) => {
for (const node of nodes) {
if (node && !tree.hasElement(node)) {
nodes.delete(node);
}
}
};
/**
* Helper to gather and bulk-apply tree updates.
*/
export class NodeChangeList<T extends TestItemTreeElement> {
private changedParents = new Set<T | null>();
private updatedNodes = new Set<TestExplorerTreeElement>();
private omittedNodes = new WeakSet<TestExplorerTreeElement>();
private isFirstApply = true;
public updated(node: TestExplorerTreeElement) {
this.updatedNodes.add(node);
}
public addedOrRemoved(node: TestExplorerTreeElement) {
this.changedParents.add(this.getNearestNotOmittedParent(node));
}
public applyTo(
tree: ObjectTree<TestExplorerTreeElement, any>,
renderNode: NodeRenderFn,
roots: () => Iterable<T>,
) {
pruneNodesNotInTree(this.changedParents, tree);
pruneNodesNotInTree(this.updatedNodes, tree);
const diffDepth = this.isFirstApply ? Infinity : 0;
this.isFirstApply = false;
for (let parent of this.changedParents) {
while (parent && typeof renderNode(parent, () => []) !== 'object') {
parent = parent.parent as T | null;
}
if (parent === null || tree.hasElement(parent)) {
tree.setChildren(
parent,
this.renderNodeList(renderNode, parent === null ? roots() : parent.children),
{ diffIdentityProvider: testIdentityProvider, diffDepth },
);
}
}
for (const node of this.updatedNodes) {
if (tree.hasElement(node)) {
tree.rerender(node);
}
}
this.changedParents.clear();
this.updatedNodes.clear();
}
private getNearestNotOmittedParent(node: TestExplorerTreeElement | null) {
let parent = node && node.parent;
while (parent && this.omittedNodes.has(parent)) {
parent = parent.parent;
}
return parent as T;
}
private *renderNodeList(renderNode: NodeRenderFn, nodes: Iterable<TestExplorerTreeElement>): Iterable<ITreeElement<TestExplorerTreeElement>> {
for (const node of nodes) {
const rendered = renderNode(node, this.renderNodeList.bind(this, renderNode));
if (rendered === NodeRenderDirective.Omit) {
this.omittedNodes.add(node);
} else if (rendered === NodeRenderDirective.Concat) {
this.omittedNodes.add(node);
if ('children' in node) {
for (const nested of this.renderNodeList(renderNode, node.children)) {
yield nested;
}
}
} else {
this.omittedNodes.delete(node);
yield rendered;
}
}
}
}
|
