@theia/markers 1.67.0-next.56 → 1.67.0-next.86

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (109) hide show
  1. package/lib/browser/index.d.ts +3 -0
  2. package/lib/browser/index.d.ts.map +1 -0
  3. package/lib/browser/index.js +21 -0
  4. package/lib/browser/index.js.map +1 -0
  5. package/lib/browser/marker-manager.d.ts +48 -0
  6. package/lib/browser/marker-manager.d.ts.map +1 -0
  7. package/lib/browser/marker-manager.js +180 -0
  8. package/lib/browser/marker-manager.js.map +1 -0
  9. package/lib/browser/marker-tree-label-provider.d.ts +16 -0
  10. package/lib/browser/marker-tree-label-provider.d.ts.map +1 -0
  11. package/lib/browser/marker-tree-label-provider.js +77 -0
  12. package/lib/browser/marker-tree-label-provider.js.map +1 -0
  13. package/lib/browser/marker-tree-label-provider.spec.d.ts +2 -0
  14. package/lib/browser/marker-tree-label-provider.spec.d.ts.map +1 -0
  15. package/lib/browser/marker-tree-label-provider.spec.js +202 -0
  16. package/lib/browser/marker-tree-label-provider.spec.js.map +1 -0
  17. package/lib/browser/marker-tree-model.d.ts +13 -0
  18. package/lib/browser/marker-tree-model.d.ts.map +1 -0
  19. package/lib/browser/marker-tree-model.js +53 -0
  20. package/lib/browser/marker-tree-model.js.map +1 -0
  21. package/lib/browser/marker-tree.d.ts +43 -0
  22. package/lib/browser/marker-tree.d.ts.map +1 -0
  23. package/lib/browser/marker-tree.js +138 -0
  24. package/lib/browser/marker-tree.js.map +1 -0
  25. package/lib/browser/problem/problem-composite-tree-node.d.ts +13 -0
  26. package/lib/browser/problem/problem-composite-tree-node.d.ts.map +1 -0
  27. package/lib/browser/problem/problem-composite-tree-node.js +77 -0
  28. package/lib/browser/problem/problem-composite-tree-node.js.map +1 -0
  29. package/lib/browser/problem/problem-composite-tree-node.spec.d.ts +2 -0
  30. package/lib/browser/problem/problem-composite-tree-node.spec.d.ts.map +1 -0
  31. package/lib/browser/problem/problem-composite-tree-node.spec.js +239 -0
  32. package/lib/browser/problem/problem-composite-tree-node.spec.js.map +1 -0
  33. package/lib/browser/problem/problem-container.d.ts +9 -0
  34. package/lib/browser/problem/problem-container.d.ts.map +1 -0
  35. package/lib/browser/problem/problem-container.js +47 -0
  36. package/lib/browser/problem/problem-container.js.map +1 -0
  37. package/lib/browser/problem/problem-contribution.d.ts +52 -0
  38. package/lib/browser/problem/problem-contribution.d.ts.map +1 -0
  39. package/lib/browser/problem/problem-contribution.js +240 -0
  40. package/lib/browser/problem/problem-contribution.js.map +1 -0
  41. package/lib/browser/problem/problem-decorations-provider.d.ts +22 -0
  42. package/lib/browser/problem/problem-decorations-provider.d.ts.map +1 -0
  43. package/lib/browser/problem/problem-decorations-provider.js +88 -0
  44. package/lib/browser/problem/problem-decorations-provider.js.map +1 -0
  45. package/lib/browser/problem/problem-decorator.d.ts +58 -0
  46. package/lib/browser/problem/problem-decorator.d.ts.map +1 -0
  47. package/lib/browser/problem/problem-decorator.js +222 -0
  48. package/lib/browser/problem/problem-decorator.js.map +1 -0
  49. package/lib/browser/problem/problem-frontend-module.d.ts +5 -0
  50. package/lib/browser/problem/problem-frontend-module.d.ts.map +1 -0
  51. package/lib/browser/problem/problem-frontend-module.js +56 -0
  52. package/lib/browser/problem/problem-frontend-module.js.map +1 -0
  53. package/lib/browser/problem/problem-layout-migrations.d.ts +6 -0
  54. package/lib/browser/problem/problem-layout-migrations.d.ts.map +1 -0
  55. package/lib/browser/problem/problem-layout-migrations.js +39 -0
  56. package/lib/browser/problem/problem-layout-migrations.js.map +1 -0
  57. package/lib/browser/problem/problem-manager.d.ts +12 -0
  58. package/lib/browser/problem/problem-manager.d.ts.map +1 -0
  59. package/lib/browser/problem/problem-manager.js +49 -0
  60. package/lib/browser/problem/problem-manager.js.map +1 -0
  61. package/lib/browser/problem/problem-manager.spec.d.ts +2 -0
  62. package/lib/browser/problem/problem-manager.spec.d.ts.map +1 -0
  63. package/lib/browser/problem/problem-manager.spec.js +168 -0
  64. package/lib/browser/problem/problem-manager.spec.js.map +1 -0
  65. package/lib/browser/problem/problem-selection.d.ts +13 -0
  66. package/lib/browser/problem/problem-selection.d.ts.map +1 -0
  67. package/lib/browser/problem/problem-selection.js +35 -0
  68. package/lib/browser/problem/problem-selection.js.map +1 -0
  69. package/lib/browser/problem/problem-tabbar-decorator.d.ts +43 -0
  70. package/lib/browser/problem/problem-tabbar-decorator.d.ts.map +1 -0
  71. package/lib/browser/problem/problem-tabbar-decorator.js +153 -0
  72. package/lib/browser/problem/problem-tabbar-decorator.js.map +1 -0
  73. package/lib/browser/problem/problem-tree-model.d.ts +31 -0
  74. package/lib/browser/problem/problem-tree-model.d.ts.map +1 -0
  75. package/lib/browser/problem/problem-tree-model.js +129 -0
  76. package/lib/browser/problem/problem-tree-model.js.map +1 -0
  77. package/lib/browser/problem/problem-tree-model.spec.d.ts +2 -0
  78. package/lib/browser/problem/problem-tree-model.spec.d.ts.map +1 -0
  79. package/lib/browser/problem/problem-tree-model.spec.js +173 -0
  80. package/lib/browser/problem/problem-tree-model.spec.js.map +1 -0
  81. package/lib/browser/problem/problem-utils.d.ts +45 -0
  82. package/lib/browser/problem/problem-utils.d.ts.map +1 -0
  83. package/lib/browser/problem/problem-utils.js +85 -0
  84. package/lib/browser/problem/problem-utils.js.map +1 -0
  85. package/lib/browser/problem/problem-widget-tab-bar-decorator.d.ts +15 -0
  86. package/lib/browser/problem/problem-widget-tab-bar-decorator.d.ts.map +1 -0
  87. package/lib/browser/problem/problem-widget-tab-bar-decorator.js +62 -0
  88. package/lib/browser/problem/problem-widget-tab-bar-decorator.js.map +1 -0
  89. package/lib/browser/problem/problem-widget.d.ts +47 -0
  90. package/lib/browser/problem/problem-widget.d.ts.map +1 -0
  91. package/lib/browser/problem/problem-widget.js +225 -0
  92. package/lib/browser/problem/problem-widget.js.map +1 -0
  93. package/lib/common/marker.d.ts +17 -0
  94. package/lib/common/marker.d.ts.map +1 -0
  95. package/lib/common/marker.js +32 -0
  96. package/lib/common/marker.js.map +1 -0
  97. package/lib/common/problem-marker.d.ts +10 -0
  98. package/lib/common/problem-marker.d.ts.map +1 -0
  99. package/lib/common/problem-marker.js +28 -0
  100. package/lib/common/problem-marker.js.map +1 -0
  101. package/lib/common/problem-preferences.d.ts +14 -0
  102. package/lib/common/problem-preferences.d.ts.map +1 -0
  103. package/lib/common/problem-preferences.js +56 -0
  104. package/lib/common/problem-preferences.js.map +1 -0
  105. package/lib/node/problem-backend-module.d.ts +4 -0
  106. package/lib/node/problem-backend-module.d.ts.map +1 -0
  107. package/lib/node/problem-backend-module.js +23 -0
  108. package/lib/node/problem-backend-module.js.map +1 -0
  109. package/package.json +5 -5
@@ -0,0 +1,53 @@
1
+ "use strict";
2
+ // *****************************************************************************
3
+ // Copyright (C) 2017 TypeFox and others.
4
+ //
5
+ // This program and the accompanying materials are made available under the
6
+ // terms of the Eclipse Public License v. 2.0 which is available at
7
+ // http://www.eclipse.org/legal/epl-2.0.
8
+ //
9
+ // This Source Code may also be made available under the following Secondary
10
+ // Licenses when the conditions for such availability set forth in the Eclipse
11
+ // Public License v. 2.0 are satisfied: GNU General Public License, version 2
12
+ // with the GNU Classpath Exception which is available at
13
+ // https://www.gnu.org/software/classpath/license.html.
14
+ //
15
+ // SPDX-License-Identifier: EPL-2.0 OR GPL-2.0-only WITH Classpath-exception-2.0
16
+ // *****************************************************************************
17
+ Object.defineProperty(exports, "__esModule", { value: true });
18
+ exports.MarkerTreeModel = void 0;
19
+ const tslib_1 = require("tslib");
20
+ const inversify_1 = require("@theia/core/shared/inversify");
21
+ const marker_tree_1 = require("./marker-tree");
22
+ const browser_1 = require("@theia/core/lib/browser");
23
+ let MarkerTreeModel = class MarkerTreeModel extends browser_1.TreeModelImpl {
24
+ doOpenNode(node) {
25
+ if (marker_tree_1.MarkerNode.is(node)) {
26
+ (0, browser_1.open)(this.openerService, node.uri, this.getOpenerOptionsByMarker(node));
27
+ }
28
+ else {
29
+ super.doOpenNode(node);
30
+ }
31
+ }
32
+ getOpenerOptionsByMarker(node) {
33
+ return undefined;
34
+ }
35
+ /**
36
+ * Reveal the corresponding node at the marker.
37
+ * @param node {TreeNode} the tree node.
38
+ */
39
+ revealNode(node) {
40
+ if (marker_tree_1.MarkerNode.is(node)) {
41
+ (0, browser_1.open)(this.openerService, node.uri, { ...this.getOpenerOptionsByMarker(node), mode: 'reveal' });
42
+ }
43
+ }
44
+ };
45
+ exports.MarkerTreeModel = MarkerTreeModel;
46
+ tslib_1.__decorate([
47
+ (0, inversify_1.inject)(browser_1.OpenerService),
48
+ tslib_1.__metadata("design:type", Object)
49
+ ], MarkerTreeModel.prototype, "openerService", void 0);
50
+ exports.MarkerTreeModel = MarkerTreeModel = tslib_1.__decorate([
51
+ (0, inversify_1.injectable)()
52
+ ], MarkerTreeModel);
53
+ //# sourceMappingURL=marker-tree-model.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"marker-tree-model.js","sourceRoot":"","sources":["../../src/browser/marker-tree-model.ts"],"names":[],"mappings":";AAAA,gFAAgF;AAChF,yCAAyC;AACzC,EAAE;AACF,2EAA2E;AAC3E,mEAAmE;AACnE,wCAAwC;AACxC,EAAE;AACF,4EAA4E;AAC5E,8EAA8E;AAC9E,6EAA6E;AAC7E,yDAAyD;AACzD,uDAAuD;AACvD,EAAE;AACF,gFAAgF;AAChF,gFAAgF;;;;AAEhF,4DAAkE;AAClE,+CAA2C;AAC3C,qDAAsG;AAG/F,IAAM,eAAe,GAArB,MAAM,eAAgB,SAAQ,uBAAa;IAI3B,UAAU,CAAC,IAAc;QACxC,IAAI,wBAAU,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACtB,IAAA,cAAI,EAAC,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,CAAC,CAAC;QAC5E,CAAC;aAAM,CAAC;YACJ,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QAC3B,CAAC;IACL,CAAC;IAES,wBAAwB,CAAC,IAAgB;QAC/C,OAAO,SAAS,CAAC;IACrB,CAAC;IAED;;;OAGG;IACH,UAAU,CAAC,IAAc;QACrB,IAAI,wBAAU,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACtB,IAAA,cAAI,EAAC,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,GAAG,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;QACnG,CAAC;IACL,CAAC;CACJ,CAAA;AAzBY,0CAAe;AAEkB;IAAzC,IAAA,kBAAM,EAAC,uBAAa,CAAC;;sDAAiD;0BAF9D,eAAe;IAD3B,IAAA,sBAAU,GAAE;GACA,eAAe,CAyB3B"}
@@ -0,0 +1,43 @@
1
+ import { TreeImpl, CompositeTreeNode, TreeNode, SelectableTreeNode, ExpandableTreeNode } from '@theia/core/lib/browser';
2
+ import { MarkerManager } from './marker-manager';
3
+ import { Marker } from '../common/marker';
4
+ import { UriSelection } from '@theia/core/lib/common/selection';
5
+ import URI from '@theia/core/lib/common/uri';
6
+ import { ProblemSelection } from './problem/problem-selection';
7
+ import { DiagnosticSeverity } from '@theia/core/shared/vscode-languageserver-protocol';
8
+ export declare const MarkerOptions: unique symbol;
9
+ export interface MarkerOptions {
10
+ readonly kind: string;
11
+ }
12
+ export declare abstract class MarkerTree<T extends object> extends TreeImpl {
13
+ protected readonly markerManager: MarkerManager<T>;
14
+ protected readonly markerOptions: MarkerOptions;
15
+ constructor(markerManager: MarkerManager<T>, markerOptions: MarkerOptions);
16
+ protected refreshMarkerInfo(uri: URI): Promise<void>;
17
+ protected insertNodeWithMarkers(node: MarkerInfoNode, markers: Marker<T>[]): void;
18
+ protected resolveChildren(parent: CompositeTreeNode): Promise<TreeNode[]>;
19
+ protected createMarkerInfo(id: string, uri: URI): MarkerInfoNode;
20
+ protected getMarkerNodes(parent: MarkerInfoNode, markers: Marker<T>[]): MarkerNode[];
21
+ protected createMarkerNode(marker: Marker<T>, index: number, parent: MarkerInfoNode): MarkerNode;
22
+ }
23
+ export interface MarkerNode extends UriSelection, SelectableTreeNode, ProblemSelection {
24
+ marker: Marker<object>;
25
+ }
26
+ export declare namespace MarkerNode {
27
+ function is(node: TreeNode | undefined): node is MarkerNode;
28
+ }
29
+ export interface MarkerInfoNode extends UriSelection, SelectableTreeNode, ExpandableTreeNode {
30
+ parent: MarkerRootNode;
31
+ numberOfMarkers: number;
32
+ severity?: DiagnosticSeverity;
33
+ }
34
+ export declare namespace MarkerInfoNode {
35
+ function is(node: unknown): node is MarkerInfoNode;
36
+ }
37
+ export interface MarkerRootNode extends CompositeTreeNode {
38
+ kind: string;
39
+ }
40
+ export declare namespace MarkerRootNode {
41
+ function is(node: TreeNode | undefined): node is MarkerRootNode;
42
+ }
43
+ //# sourceMappingURL=marker-tree.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"marker-tree.d.ts","sourceRoot":"","sources":["../../src/browser/marker-tree.ts"],"names":[],"mappings":"AAiBA,OAAO,EAAE,QAAQ,EAAE,iBAAiB,EAAE,QAAQ,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,MAAM,yBAAyB,CAAC;AACxH,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AAC1C,OAAO,EAAE,YAAY,EAAE,MAAM,kCAAkC,CAAC;AAChE,OAAO,GAAG,MAAM,4BAA4B,CAAC;AAC7C,OAAO,EAAE,gBAAgB,EAAE,MAAM,6BAA6B,CAAC;AAC/D,OAAO,EAAE,kBAAkB,EAAE,MAAM,mDAAmD,CAAC;AAEvF,eAAO,MAAM,aAAa,eAA0B,CAAC;AACrD,MAAM,WAAW,aAAa;IAC1B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACzB;AAED,8BACsB,UAAU,CAAC,CAAC,SAAS,MAAM,CAAE,SAAQ,QAAQ;IAG9C,SAAS,CAAC,QAAQ,CAAC,aAAa,EAAE,aAAa,CAAC,CAAC,CAAC;IAClD,SAAS,CAAC,QAAQ,CAAC,aAAa,EAAE,aAAa;gBAD5B,aAAa,EAAE,aAAa,CAAC,CAAC,CAAC,EAC/B,aAAa,EAAE,aAAa;cAgBhD,iBAAiB,CAAC,GAAG,EAAE,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC;IAgB1D,SAAS,CAAC,qBAAqB,CAAC,IAAI,EAAE,cAAc,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI;cAOxD,eAAe,CAAC,MAAM,EAAE,iBAAiB,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;IAiBxF,SAAS,CAAC,gBAAgB,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,GAAG,cAAc;IAYhE,SAAS,CAAC,cAAc,CAAC,MAAM,EAAE,cAAc,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,UAAU,EAAE;IAKpF,SAAS,CAAC,gBAAgB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,cAAc,GAAG,UAAU;CAgBnG;AAED,MAAM,WAAW,UAAW,SAAQ,YAAY,EAAE,kBAAkB,EAAE,gBAAgB;IAClF,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;CAC1B;AACD,yBAAiB,UAAU,CAAC;IACxB,SAAgB,EAAE,CAAC,IAAI,EAAE,QAAQ,GAAG,SAAS,GAAG,IAAI,IAAI,UAAU,CAEjE;CACJ;AAED,MAAM,WAAW,cAAe,SAAQ,YAAY,EAAE,kBAAkB,EAAE,kBAAkB;IACxF,MAAM,EAAE,cAAc,CAAC;IACvB,eAAe,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,EAAE,kBAAkB,CAAC;CACjC;AACD,yBAAiB,cAAc,CAAC;IAC5B,SAAgB,EAAE,CAAC,IAAI,EAAE,OAAO,GAAG,IAAI,IAAI,cAAc,CAExD;CACJ;AAED,MAAM,WAAW,cAAe,SAAQ,iBAAiB;IACrD,IAAI,EAAE,MAAM,CAAC;CAChB;AACD,yBAAiB,cAAc,CAAC;IAC5B,SAAgB,EAAE,CAAC,IAAI,EAAE,QAAQ,GAAG,SAAS,GAAG,IAAI,IAAI,cAAc,CAErE;CACJ"}
@@ -0,0 +1,138 @@
1
+ "use strict";
2
+ // *****************************************************************************
3
+ // Copyright (C) 2017 TypeFox and others.
4
+ //
5
+ // This program and the accompanying materials are made available under the
6
+ // terms of the Eclipse Public License v. 2.0 which is available at
7
+ // http://www.eclipse.org/legal/epl-2.0.
8
+ //
9
+ // This Source Code may also be made available under the following Secondary
10
+ // Licenses when the conditions for such availability set forth in the Eclipse
11
+ // Public License v. 2.0 are satisfied: GNU General Public License, version 2
12
+ // with the GNU Classpath Exception which is available at
13
+ // https://www.gnu.org/software/classpath/license.html.
14
+ //
15
+ // SPDX-License-Identifier: EPL-2.0 OR GPL-2.0-only WITH Classpath-exception-2.0
16
+ // *****************************************************************************
17
+ Object.defineProperty(exports, "__esModule", { value: true });
18
+ exports.MarkerRootNode = exports.MarkerInfoNode = exports.MarkerNode = exports.MarkerTree = exports.MarkerOptions = void 0;
19
+ const tslib_1 = require("tslib");
20
+ const inversify_1 = require("@theia/core/shared/inversify");
21
+ const browser_1 = require("@theia/core/lib/browser");
22
+ const marker_manager_1 = require("./marker-manager");
23
+ const selection_1 = require("@theia/core/lib/common/selection");
24
+ const uri_1 = require("@theia/core/lib/common/uri");
25
+ const problem_selection_1 = require("./problem/problem-selection");
26
+ exports.MarkerOptions = Symbol('MarkerOptions');
27
+ let MarkerTree = class MarkerTree extends browser_1.TreeImpl {
28
+ constructor(markerManager, markerOptions) {
29
+ super();
30
+ this.markerManager = markerManager;
31
+ this.markerOptions = markerOptions;
32
+ this.toDispose.push(markerManager.onDidChangeMarkers(uri => this.refreshMarkerInfo(uri)));
33
+ this.root = {
34
+ visible: false,
35
+ id: 'theia-' + markerOptions.kind + '-marker-widget',
36
+ name: 'MarkerTree',
37
+ kind: markerOptions.kind,
38
+ children: [],
39
+ parent: undefined
40
+ };
41
+ }
42
+ async refreshMarkerInfo(uri) {
43
+ const id = uri.toString();
44
+ const existing = this.getNode(id);
45
+ const markers = this.markerManager.findMarkers({ uri });
46
+ if (markers.length <= 0) {
47
+ if (MarkerInfoNode.is(existing)) {
48
+ browser_1.CompositeTreeNode.removeChild(existing.parent, existing);
49
+ this.removeNode(existing);
50
+ this.fireChanged();
51
+ }
52
+ return;
53
+ }
54
+ const node = MarkerInfoNode.is(existing) ? existing : this.createMarkerInfo(id, uri);
55
+ this.insertNodeWithMarkers(node, markers);
56
+ }
57
+ insertNodeWithMarkers(node, markers) {
58
+ browser_1.CompositeTreeNode.addChild(node.parent, node);
59
+ const children = this.getMarkerNodes(node, markers);
60
+ node.numberOfMarkers = markers.length;
61
+ this.setChildren(node, children);
62
+ }
63
+ async resolveChildren(parent) {
64
+ if (MarkerRootNode.is(parent)) {
65
+ const nodes = [];
66
+ for (const id of this.markerManager.getUris()) {
67
+ const uri = new uri_1.default(id);
68
+ const existing = this.getNode(id);
69
+ const markers = this.markerManager.findMarkers({ uri });
70
+ const node = MarkerInfoNode.is(existing) ? existing : this.createMarkerInfo(id, uri);
71
+ node.children = this.getMarkerNodes(node, markers);
72
+ node.numberOfMarkers = node.children.length;
73
+ nodes.push(node);
74
+ }
75
+ return nodes;
76
+ }
77
+ return super.resolveChildren(parent);
78
+ }
79
+ createMarkerInfo(id, uri) {
80
+ return {
81
+ children: [],
82
+ expanded: true,
83
+ uri,
84
+ id,
85
+ parent: this.root,
86
+ selected: false,
87
+ numberOfMarkers: 0
88
+ };
89
+ }
90
+ getMarkerNodes(parent, markers) {
91
+ return markers.map((marker, index) => this.createMarkerNode(marker, index, parent));
92
+ }
93
+ createMarkerNode(marker, index, parent) {
94
+ const id = parent.id + '_' + index;
95
+ const existing = this.getNode(id);
96
+ if (MarkerNode.is(existing)) {
97
+ existing.marker = marker;
98
+ return existing;
99
+ }
100
+ return {
101
+ id,
102
+ name: 'marker',
103
+ parent,
104
+ selected: false,
105
+ uri: parent.uri,
106
+ marker
107
+ };
108
+ }
109
+ };
110
+ exports.MarkerTree = MarkerTree;
111
+ exports.MarkerTree = MarkerTree = tslib_1.__decorate([
112
+ (0, inversify_1.injectable)(),
113
+ tslib_1.__param(0, (0, inversify_1.unmanaged)()),
114
+ tslib_1.__param(1, (0, inversify_1.unmanaged)()),
115
+ tslib_1.__metadata("design:paramtypes", [marker_manager_1.MarkerManager, Object])
116
+ ], MarkerTree);
117
+ var MarkerNode;
118
+ (function (MarkerNode) {
119
+ function is(node) {
120
+ return selection_1.UriSelection.is(node) && browser_1.SelectableTreeNode.is(node) && problem_selection_1.ProblemSelection.is(node);
121
+ }
122
+ MarkerNode.is = is;
123
+ })(MarkerNode || (exports.MarkerNode = MarkerNode = {}));
124
+ var MarkerInfoNode;
125
+ (function (MarkerInfoNode) {
126
+ function is(node) {
127
+ return browser_1.ExpandableTreeNode.is(node) && selection_1.UriSelection.is(node) && 'numberOfMarkers' in node;
128
+ }
129
+ MarkerInfoNode.is = is;
130
+ })(MarkerInfoNode || (exports.MarkerInfoNode = MarkerInfoNode = {}));
131
+ var MarkerRootNode;
132
+ (function (MarkerRootNode) {
133
+ function is(node) {
134
+ return browser_1.CompositeTreeNode.is(node) && 'kind' in node;
135
+ }
136
+ MarkerRootNode.is = is;
137
+ })(MarkerRootNode || (exports.MarkerRootNode = MarkerRootNode = {}));
138
+ //# sourceMappingURL=marker-tree.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"marker-tree.js","sourceRoot":"","sources":["../../src/browser/marker-tree.ts"],"names":[],"mappings":";AAAA,gFAAgF;AAChF,yCAAyC;AACzC,EAAE;AACF,2EAA2E;AAC3E,mEAAmE;AACnE,wCAAwC;AACxC,EAAE;AACF,4EAA4E;AAC5E,8EAA8E;AAC9E,6EAA6E;AAC7E,yDAAyD;AACzD,uDAAuD;AACvD,EAAE;AACF,gFAAgF;AAChF,gFAAgF;;;;AAEhF,4DAAqE;AACrE,qDAAwH;AACxH,qDAAiD;AAEjD,gEAAgE;AAChE,oDAA6C;AAC7C,mEAA+D;AAGlD,QAAA,aAAa,GAAG,MAAM,CAAC,eAAe,CAAC,CAAC;AAM9C,IAAe,UAAU,GAAzB,MAAe,UAA6B,SAAQ,kBAAQ;IAE/D,YACoC,aAA+B,EAC/B,aAA4B;QAE5D,KAAK,EAAE,CAAC;QAHwB,kBAAa,GAAb,aAAa,CAAkB;QAC/B,kBAAa,GAAb,aAAa,CAAe;QAI5D,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,aAAa,CAAC,kBAAkB,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAE1F,IAAI,CAAC,IAAI,GAAmB;YACxB,OAAO,EAAE,KAAK;YACd,EAAE,EAAE,QAAQ,GAAG,aAAa,CAAC,IAAI,GAAG,gBAAgB;YACpD,IAAI,EAAE,YAAY;YAClB,IAAI,EAAE,aAAa,CAAC,IAAI;YACxB,QAAQ,EAAE,EAAE;YACZ,MAAM,EAAE,SAAS;SACpB,CAAC;IACN,CAAC;IAES,KAAK,CAAC,iBAAiB,CAAC,GAAQ;QACtC,MAAM,EAAE,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC1B,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAClC,MAAM,OAAO,GAAG,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;QACxD,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YACtB,IAAI,cAAc,CAAC,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC9B,2BAAiB,CAAC,WAAW,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;gBACzD,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;gBAC1B,IAAI,CAAC,WAAW,EAAE,CAAC;YACvB,CAAC;YACD,OAAO;QACX,CAAC;QACD,MAAM,IAAI,GAAG,cAAc,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACrF,IAAI,CAAC,qBAAqB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IAC9C,CAAC;IAES,qBAAqB,CAAC,IAAoB,EAAE,OAAoB;QACtE,2BAAiB,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAC9C,MAAM,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACpD,IAAI,CAAC,eAAe,GAAG,OAAO,CAAC,MAAM,CAAC;QACtC,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IACrC,CAAC;IAEkB,KAAK,CAAC,eAAe,CAAC,MAAyB;QAC9D,IAAI,cAAc,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC;YAC5B,MAAM,KAAK,GAAqB,EAAE,CAAC;YACnC,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,aAAa,CAAC,OAAO,EAAE,EAAE,CAAC;gBAC5C,MAAM,GAAG,GAAG,IAAI,aAAG,CAAC,EAAE,CAAC,CAAC;gBACxB,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;gBAClC,MAAM,OAAO,GAAG,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;gBACxD,MAAM,IAAI,GAAG,cAAc,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;gBACrF,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;gBACnD,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;gBAC5C,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACrB,CAAC;YACD,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,OAAO,KAAK,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;IACzC,CAAC;IAES,gBAAgB,CAAC,EAAU,EAAE,GAAQ;QAC3C,OAAO;YACH,QAAQ,EAAE,EAAE;YACZ,QAAQ,EAAE,IAAI;YACd,GAAG;YACH,EAAE;YACF,MAAM,EAAE,IAAI,CAAC,IAAsB;YACnC,QAAQ,EAAE,KAAK;YACf,eAAe,EAAE,CAAC;SACrB,CAAC;IACN,CAAC;IAES,cAAc,CAAC,MAAsB,EAAE,OAAoB;QACjE,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CACjC,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,CAC/C,CAAC;IACN,CAAC;IACS,gBAAgB,CAAC,MAAiB,EAAE,KAAa,EAAE,MAAsB;QAC/E,MAAM,EAAE,GAAG,MAAM,CAAC,EAAE,GAAG,GAAG,GAAG,KAAK,CAAC;QACnC,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAClC,IAAI,UAAU,CAAC,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC1B,QAAQ,CAAC,MAAM,GAAG,MAAM,CAAC;YACzB,OAAO,QAAQ,CAAC;QACpB,CAAC;QACD,OAAO;YACH,EAAE;YACF,IAAI,EAAE,QAAQ;YACd,MAAM;YACN,QAAQ,EAAE,KAAK;YACf,GAAG,EAAE,MAAM,CAAC,GAAG;YACf,MAAM;SACT,CAAC;IACN,CAAC;CACJ,CAAA;AA7FqB,gCAAU;qBAAV,UAAU;IAD/B,IAAA,sBAAU,GAAE;IAIJ,mBAAA,IAAA,qBAAS,GAAE,CAAA;IACX,mBAAA,IAAA,qBAAS,GAAE,CAAA;6CADmC,8BAAa;GAH9C,UAAU,CA6F/B;AAKD,IAAiB,UAAU,CAI1B;AAJD,WAAiB,UAAU;IACvB,SAAgB,EAAE,CAAC,IAA0B;QACzC,OAAO,wBAAY,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,4BAAkB,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,oCAAgB,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;IAC7F,CAAC;IAFe,aAAE,KAEjB,CAAA;AACL,CAAC,EAJgB,UAAU,0BAAV,UAAU,QAI1B;AAOD,IAAiB,cAAc,CAI9B;AAJD,WAAiB,cAAc;IAC3B,SAAgB,EAAE,CAAC,IAAa;QAC5B,OAAO,4BAAkB,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,wBAAY,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,iBAAiB,IAAI,IAAI,CAAC;IAC7F,CAAC;IAFe,iBAAE,KAEjB,CAAA;AACL,CAAC,EAJgB,cAAc,8BAAd,cAAc,QAI9B;AAKD,IAAiB,cAAc,CAI9B;AAJD,WAAiB,cAAc;IAC3B,SAAgB,EAAE,CAAC,IAA0B;QACzC,OAAO,2BAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,MAAM,IAAI,IAAI,CAAC;IACxD,CAAC;IAFe,iBAAE,KAEjB,CAAA;AACL,CAAC,EAJgB,cAAc,8BAAd,cAAc,QAI9B"}
@@ -0,0 +1,13 @@
1
+ import { CompositeTreeNode } from '@theia/core/lib/browser/tree/tree';
2
+ import { MarkerInfoNode } from '../marker-tree';
3
+ import { Marker } from '../../common/marker';
4
+ import { Diagnostic } from '@theia/core/shared/vscode-languageserver-protocol';
5
+ export declare namespace ProblemCompositeTreeNode {
6
+ interface Child {
7
+ node: MarkerInfoNode;
8
+ markers: Marker<Diagnostic>[];
9
+ }
10
+ function setSeverity(parent: MarkerInfoNode, markers: Marker<Diagnostic>[]): void;
11
+ function addChildren(parent: CompositeTreeNode, insertChildren: ProblemCompositeTreeNode.Child[]): void;
12
+ }
13
+ //# sourceMappingURL=problem-composite-tree-node.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"problem-composite-tree-node.d.ts","sourceRoot":"","sources":["../../../src/browser/problem/problem-composite-tree-node.ts"],"names":[],"mappings":"AAgBA,OAAO,EAAE,iBAAiB,EAAE,MAAM,mCAAmC,CAAC;AACtE,OAAO,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAEhD,OAAO,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAC7C,OAAO,EAAE,UAAU,EAAsB,MAAM,mDAAmD,CAAC;AAGnG,yBAAiB,wBAAwB,CAAC;IAEtC,UAAiB,KAAK;QAClB,IAAI,EAAE,cAAc,CAAC;QACrB,OAAO,EAAE,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC;KACjC;IAED,SAAgB,WAAW,CAAC,MAAM,EAAE,cAAc,EAAE,OAAO,EAAE,MAAM,CAAC,UAAU,CAAC,EAAE,GAAG,IAAI,CAQvF;IAED,SAAgB,WAAW,CAAC,MAAM,EAAE,iBAAiB,EAAE,cAAc,EAAE,wBAAwB,CAAC,KAAK,EAAE,GAAG,IAAI,CAwC7G;CAKJ"}
@@ -0,0 +1,77 @@
1
+ "use strict";
2
+ // *****************************************************************************
3
+ // Copyright (C) 2021 EclipseSource and others.
4
+ //
5
+ // This program and the accompanying materials are made available under the
6
+ // terms of the Eclipse Public License v. 2.0 which is available at
7
+ // http://www.eclipse.org/legal/epl-2.0.
8
+ //
9
+ // This Source Code may also be made available under the following Secondary
10
+ // Licenses when the conditions for such availability set forth in the Eclipse
11
+ // Public License v. 2.0 are satisfied: GNU General Public License, version 2
12
+ // with the GNU Classpath Exception which is available at
13
+ // https://www.gnu.org/software/classpath/license.html.
14
+ //
15
+ // SPDX-License-Identifier: EPL-2.0 OR GPL-2.0-only WITH Classpath-exception-2.0
16
+ // *****************************************************************************
17
+ Object.defineProperty(exports, "__esModule", { value: true });
18
+ exports.ProblemCompositeTreeNode = void 0;
19
+ const tree_1 = require("@theia/core/lib/browser/tree/tree");
20
+ const problem_utils_1 = require("./problem-utils");
21
+ var ProblemCompositeTreeNode;
22
+ (function (ProblemCompositeTreeNode) {
23
+ function setSeverity(parent, markers) {
24
+ let maxSeverity;
25
+ markers.forEach(marker => {
26
+ if (problem_utils_1.ProblemUtils.severityCompare(marker.data.severity, maxSeverity) < 0) {
27
+ maxSeverity = marker.data.severity;
28
+ }
29
+ });
30
+ parent.severity = maxSeverity;
31
+ }
32
+ ProblemCompositeTreeNode.setSeverity = setSeverity;
33
+ ;
34
+ function addChildren(parent, insertChildren) {
35
+ for (const { node, markers } of insertChildren) {
36
+ ProblemCompositeTreeNode.setSeverity(node, markers);
37
+ }
38
+ const sortedInsertChildren = insertChildren.sort((a, b) => (problem_utils_1.ProblemUtils.severityCompare(a.node.severity, b.node.severity) || compareURI(a.node.uri, b.node.uri)));
39
+ let startIndex = 0;
40
+ const children = parent.children;
41
+ for (const { node } of sortedInsertChildren) {
42
+ const index = children.findIndex(value => value.id === node.id);
43
+ if (index !== -1) {
44
+ tree_1.CompositeTreeNode.removeChild(parent, node);
45
+ }
46
+ if (children.length === 0) {
47
+ children.push(node);
48
+ startIndex = 1;
49
+ tree_1.CompositeTreeNode.setParent(node, 0, parent);
50
+ }
51
+ else {
52
+ let inserted = false;
53
+ for (let i = startIndex; i < children.length; i++) {
54
+ // sort by severity, equal severity => sort by URI
55
+ if (problem_utils_1.ProblemUtils.severityCompare(node.severity, children[i].severity) < 0
56
+ || (problem_utils_1.ProblemUtils.severityCompare(node.severity, children[i].severity) === 0 && compareURI(node.uri, children[i].uri) < 0)) {
57
+ children.splice(i, 0, node);
58
+ inserted = true;
59
+ startIndex = i + 1;
60
+ tree_1.CompositeTreeNode.setParent(node, i, parent);
61
+ break;
62
+ }
63
+ ;
64
+ }
65
+ if (inserted === false) {
66
+ children.push(node);
67
+ startIndex = children.length;
68
+ tree_1.CompositeTreeNode.setParent(node, children.length - 1, parent);
69
+ }
70
+ }
71
+ }
72
+ }
73
+ ProblemCompositeTreeNode.addChildren = addChildren;
74
+ const compareURI = (uri1, uri2) => uri1.toString().localeCompare(uri2.toString(), undefined, { sensitivity: 'base' });
75
+ ;
76
+ })(ProblemCompositeTreeNode || (exports.ProblemCompositeTreeNode = ProblemCompositeTreeNode = {}));
77
+ //# sourceMappingURL=problem-composite-tree-node.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"problem-composite-tree-node.js","sourceRoot":"","sources":["../../../src/browser/problem/problem-composite-tree-node.ts"],"names":[],"mappings":";AAAA,gFAAgF;AAChF,+CAA+C;AAC/C,EAAE;AACF,2EAA2E;AAC3E,mEAAmE;AACnE,wCAAwC;AACxC,EAAE;AACF,4EAA4E;AAC5E,8EAA8E;AAC9E,6EAA6E;AAC7E,yDAAyD;AACzD,uDAAuD;AACvD,EAAE;AACF,gFAAgF;AAChF,gFAAgF;;;AAEhF,4DAAsE;AAKtE,mDAA+C;AAE/C,IAAiB,wBAAwB,CA8DxC;AA9DD,WAAiB,wBAAwB;IAOrC,SAAgB,WAAW,CAAC,MAAsB,EAAE,OAA6B;QAC7E,IAAI,WAA2C,CAAC;QAChD,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;YACrB,IAAI,4BAAY,CAAC,eAAe,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC;gBACtE,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC;YACvC,CAAC;QACL,CAAC,CAAC,CAAC;QACH,MAAM,CAAC,QAAQ,GAAG,WAAW,CAAC;IAClC,CAAC;IARe,oCAAW,cAQ1B,CAAA;IAAA,CAAC;IAEF,SAAgB,WAAW,CAAC,MAAyB,EAAE,cAAgD;QACnG,KAAK,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,cAAc,EAAE,CAAC;YAC7C,wBAAwB,CAAC,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACxD,CAAC;QAED,MAAM,oBAAoB,GAAG,cAAc,CAAC,IAAI,CAC5C,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,4BAAY,CAAC,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CACnH,CAAC;QAEF,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,MAAM,QAAQ,GAAG,MAAM,CAAC,QAA4B,CAAC;QACrD,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,oBAAoB,EAAE,CAAC;YAC1C,MAAM,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC;YAChE,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;gBACf,wBAAiB,CAAC,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAChD,CAAC;YACD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACxB,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACpB,UAAU,GAAG,CAAC,CAAC;gBACf,wBAAiB,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;YACjD,CAAC;iBAAM,CAAC;gBACJ,IAAI,QAAQ,GAAG,KAAK,CAAC;gBACrB,KAAK,IAAI,CAAC,GAAG,UAAU,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAChD,kDAAkD;oBAClD,IAAI,4BAAY,CAAC,eAAe,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC;2BAClE,CAAC,4BAAY,CAAC,eAAe,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;wBAC5H,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;wBAC5B,QAAQ,GAAG,IAAI,CAAC;wBAChB,UAAU,GAAG,CAAC,GAAG,CAAC,CAAC;wBACnB,wBAAiB,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;wBAC7C,MAAM;oBACV,CAAC;oBAAA,CAAC;gBACN,CAAC;gBACD,IAAI,QAAQ,KAAK,KAAK,EAAE,CAAC;oBACrB,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACpB,UAAU,GAAG,QAAQ,CAAC,MAAM,CAAC;oBAC7B,wBAAiB,CAAC,SAAS,CAAC,IAAI,EAAE,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;gBACnE,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAxCe,oCAAW,cAwC1B,CAAA;IAED,MAAM,UAAU,GAAG,CAAC,IAAS,EAAE,IAAS,EAAU,EAAE,CAChD,IAAI,CAAC,QAAQ,EAAE,CAAC,aAAa,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,SAAS,EAAE,EAAE,WAAW,EAAE,MAAM,EAAE,CAAC,CAAC;IACvF,CAAC;AACL,CAAC,EA9DgB,wBAAwB,wCAAxB,wBAAwB,QA8DxC"}
@@ -0,0 +1,2 @@
1
+ export {};
2
+ //# sourceMappingURL=problem-composite-tree-node.spec.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"problem-composite-tree-node.spec.d.ts","sourceRoot":"","sources":["../../../src/browser/problem/problem-composite-tree-node.spec.ts"],"names":[],"mappings":""}
@@ -0,0 +1,239 @@
1
+ "use strict";
2
+ // *****************************************************************************
3
+ // Copyright (C) 2021 EclipseSource and others.
4
+ //
5
+ // This program and the accompanying materials are made available under the
6
+ // terms of the Eclipse Public License v. 2.0 which is available at
7
+ // http://www.eclipse.org/legal/epl-2.0.
8
+ //
9
+ // This Source Code may also be made available under the following Secondary
10
+ // Licenses when the conditions for such availability set forth in the Eclipse
11
+ // Public License v. 2.0 are satisfied: GNU General Public License, version 2
12
+ // with the GNU Classpath Exception which is available at
13
+ // https://www.gnu.org/software/classpath/license.html.
14
+ //
15
+ // SPDX-License-Identifier: EPL-2.0 OR GPL-2.0-only WITH Classpath-exception-2.0
16
+ // *****************************************************************************
17
+ Object.defineProperty(exports, "__esModule", { value: true });
18
+ const jsdom_1 = require("@theia/core/lib/browser/test/jsdom");
19
+ let disableJSDOM = (0, jsdom_1.enableJSDOM)();
20
+ const frontend_application_config_provider_1 = require("@theia/core/lib/browser/frontend-application-config-provider");
21
+ frontend_application_config_provider_1.FrontendApplicationConfigProvider.set({});
22
+ const uri_1 = require("@theia/core/lib/common/uri");
23
+ const chai_1 = require("chai");
24
+ const inversify_1 = require("@theia/core/shared/inversify");
25
+ const vscode_languageserver_protocol_1 = require("@theia/core/shared/vscode-languageserver-protocol");
26
+ const event_1 = require("@theia/core/lib/common/event");
27
+ const marker_manager_1 = require("../marker-manager");
28
+ const marker_tree_1 = require("../marker-tree");
29
+ const problem_container_1 = require("./problem-container");
30
+ const problem_manager_1 = require("./problem-manager");
31
+ const problem_tree_model_1 = require("./problem-tree-model");
32
+ const file_service_1 = require("@theia/filesystem/lib/browser/file-service");
33
+ const problem_composite_tree_node_1 = require("./problem-composite-tree-node");
34
+ disableJSDOM();
35
+ let rootNode;
36
+ before(() => {
37
+ disableJSDOM = (0, jsdom_1.enableJSDOM)();
38
+ const testContainer = new inversify_1.Container();
39
+ testContainer.bind(marker_manager_1.MarkerManager).toSelf().inSingletonScope();
40
+ testContainer.bind(problem_manager_1.ProblemManager).toSelf();
41
+ testContainer.bind(marker_tree_1.MarkerOptions).toConstantValue(problem_container_1.PROBLEM_OPTIONS);
42
+ testContainer.bind(file_service_1.FileService).toConstantValue({
43
+ onDidFilesChange: event_1.Event.None
44
+ });
45
+ testContainer.bind(problem_tree_model_1.ProblemTree).toSelf().inSingletonScope();
46
+ });
47
+ beforeEach(() => {
48
+ rootNode = getRootNode('theia-problem-marker-widget');
49
+ });
50
+ after(() => {
51
+ disableJSDOM();
52
+ });
53
+ describe('problem-composite-tree-node', () => {
54
+ describe('#sortMarkersInfo', () => {
55
+ describe('should sort markersInfo based on the highest severity', () => {
56
+ function testSeveritySorting(high, low) {
57
+ const highMarker = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, high);
58
+ const lowMarker = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, low);
59
+ const highNode = createMockMarkerNode(highMarker);
60
+ const lowNode = createMockMarkerNode(lowMarker);
61
+ const highMarkerNode = createMarkerInfo('1', new uri_1.default('a'), [highNode]);
62
+ const lowMarkerNode = createMarkerInfo('2', new uri_1.default('b'), [lowNode]);
63
+ const highFirstRoot = getRootNode('highFirstRoot');
64
+ problem_composite_tree_node_1.ProblemCompositeTreeNode.addChildren(highFirstRoot, [
65
+ { node: highMarkerNode, markers: [highMarker] },
66
+ { node: lowMarkerNode, markers: [lowMarker] },
67
+ ]);
68
+ expectCorrectOrdering(highFirstRoot);
69
+ const lowFirstRoot = getRootNode('lowFirstRoot');
70
+ problem_composite_tree_node_1.ProblemCompositeTreeNode.addChildren(lowFirstRoot, [
71
+ { node: lowMarkerNode, markers: [lowMarker] },
72
+ { node: highMarkerNode, markers: [highMarker] },
73
+ ]);
74
+ expectCorrectOrdering(lowFirstRoot);
75
+ function expectCorrectOrdering(root) {
76
+ (0, chai_1.expect)(root.children.length).to.equal(2);
77
+ (0, chai_1.expect)(root.children[0]).to.equal(highMarkerNode);
78
+ (0, chai_1.expect)(highMarkerNode.nextSibling).to.equal(lowMarkerNode);
79
+ (0, chai_1.expect)(root.children[1]).to.equal(lowMarkerNode);
80
+ (0, chai_1.expect)(lowMarkerNode.previousSibling).to.equal(highMarkerNode);
81
+ }
82
+ }
83
+ it('should sort error higher than warnings', () => {
84
+ testSeveritySorting(vscode_languageserver_protocol_1.DiagnosticSeverity.Error, vscode_languageserver_protocol_1.DiagnosticSeverity.Warning);
85
+ });
86
+ it('should sort errors higher than infos', () => {
87
+ testSeveritySorting(vscode_languageserver_protocol_1.DiagnosticSeverity.Error, vscode_languageserver_protocol_1.DiagnosticSeverity.Information);
88
+ });
89
+ it('should sort errors higher than hints', () => {
90
+ testSeveritySorting(vscode_languageserver_protocol_1.DiagnosticSeverity.Error, vscode_languageserver_protocol_1.DiagnosticSeverity.Hint);
91
+ });
92
+ it('should sort warnings higher than infos', () => {
93
+ testSeveritySorting(vscode_languageserver_protocol_1.DiagnosticSeverity.Warning, vscode_languageserver_protocol_1.DiagnosticSeverity.Information);
94
+ });
95
+ it('should sort warnings higher than hints', () => {
96
+ testSeveritySorting(vscode_languageserver_protocol_1.DiagnosticSeverity.Warning, vscode_languageserver_protocol_1.DiagnosticSeverity.Hint);
97
+ });
98
+ it('should sort infos higher than hints', () => {
99
+ testSeveritySorting(vscode_languageserver_protocol_1.DiagnosticSeverity.Information, vscode_languageserver_protocol_1.DiagnosticSeverity.Hint);
100
+ });
101
+ });
102
+ it('should sort markersInfo based on URI if severities are equal', () => {
103
+ const markerA = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Error);
104
+ const markerB = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Error);
105
+ const nodeA = createMockMarkerNode(markerA);
106
+ const nodeB = createMockMarkerNode(markerB);
107
+ const markerInfoNodeA = createMarkerInfo('1', new uri_1.default('a'), [nodeA]);
108
+ const markerInfoNodeB = createMarkerInfo('2', new uri_1.default('b'), [nodeB]);
109
+ problem_composite_tree_node_1.ProblemCompositeTreeNode.addChildren(rootNode, [
110
+ { node: markerInfoNodeA, markers: [markerA] },
111
+ { node: markerInfoNodeB, markers: [markerB] },
112
+ ]);
113
+ (0, chai_1.expect)(rootNode.children.length).to.equal(2);
114
+ (0, chai_1.expect)(rootNode.children[0]).to.equal(markerInfoNodeA);
115
+ (0, chai_1.expect)(markerInfoNodeA.nextSibling).to.equal(markerInfoNodeB);
116
+ (0, chai_1.expect)(rootNode.children[1]).to.equal(markerInfoNodeB);
117
+ (0, chai_1.expect)(markerInfoNodeB.previousSibling).to.equal(markerInfoNodeA);
118
+ });
119
+ it('changing marker content should lead to update in ProblemCompositeTree', () => {
120
+ const markerA = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Error);
121
+ const nodeA = createMockMarkerNode(markerA);
122
+ const markerInfoNodeA = createMarkerInfo('1', new uri_1.default('a'), [nodeA]);
123
+ problem_composite_tree_node_1.ProblemCompositeTreeNode.addChildren(rootNode, [
124
+ { node: markerInfoNodeA, markers: [markerA] }
125
+ ]);
126
+ markerA.data.severity = vscode_languageserver_protocol_1.DiagnosticSeverity.Hint;
127
+ problem_composite_tree_node_1.ProblemCompositeTreeNode.addChildren(rootNode, [
128
+ { node: markerInfoNodeA, markers: [markerA] }
129
+ ]);
130
+ (0, chai_1.expect)(rootNode.children.length).to.equal(1);
131
+ (0, chai_1.expect)(rootNode.children[0]).to.equal(markerInfoNodeA);
132
+ });
133
+ it('changing marker content from error to hint should lead to lower rank', () => {
134
+ const markerA = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Error);
135
+ const nodeA = createMockMarkerNode(markerA);
136
+ const markerInfoNodeA = createMarkerInfo('1', new uri_1.default('a'), [nodeA]);
137
+ problem_composite_tree_node_1.ProblemCompositeTreeNode.addChildren(rootNode, [
138
+ { node: markerInfoNodeA, markers: [markerA] }
139
+ ]);
140
+ const markerB = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Error);
141
+ const nodeB = createMockMarkerNode(markerB);
142
+ const markerInfoNodeB = createMarkerInfo('2', new uri_1.default('b'), [nodeB]);
143
+ problem_composite_tree_node_1.ProblemCompositeTreeNode.addChildren(rootNode, [
144
+ { node: markerInfoNodeB, markers: [markerB] }
145
+ ]);
146
+ markerA.data.severity = vscode_languageserver_protocol_1.DiagnosticSeverity.Hint;
147
+ problem_composite_tree_node_1.ProblemCompositeTreeNode.addChildren(rootNode, [
148
+ { node: markerInfoNodeA, markers: [markerA] }
149
+ ]);
150
+ (0, chai_1.expect)(rootNode.children.length).to.equal(2);
151
+ (0, chai_1.expect)(rootNode.children[0]).to.equal(markerInfoNodeB);
152
+ (0, chai_1.expect)(markerInfoNodeB.nextSibling).to.equal(markerInfoNodeA);
153
+ (0, chai_1.expect)(rootNode.children[1]).to.equal(markerInfoNodeA);
154
+ (0, chai_1.expect)(markerInfoNodeA.previousSibling).to.equal(markerInfoNodeB);
155
+ });
156
+ it('changing marker content from error to hint should lead to higher rank', () => {
157
+ const markerA = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Hint);
158
+ const nodeA = createMockMarkerNode(markerA);
159
+ const markerInfoNodeA = createMarkerInfo('1', new uri_1.default('a'), [nodeA]);
160
+ problem_composite_tree_node_1.ProblemCompositeTreeNode.addChildren(rootNode, [
161
+ { node: markerInfoNodeA, markers: [markerA] }
162
+ ]);
163
+ const markerB = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Error);
164
+ const nodeB = createMockMarkerNode(markerB);
165
+ const markerInfoNodeB = createMarkerInfo('2', new uri_1.default('b'), [nodeB]);
166
+ problem_composite_tree_node_1.ProblemCompositeTreeNode.addChildren(rootNode, [
167
+ { node: markerInfoNodeB, markers: [markerB] }
168
+ ]);
169
+ markerA.data.severity = vscode_languageserver_protocol_1.DiagnosticSeverity.Error;
170
+ problem_composite_tree_node_1.ProblemCompositeTreeNode.addChildren(rootNode, [
171
+ { node: markerInfoNodeA, markers: [markerA] }
172
+ ]);
173
+ (0, chai_1.expect)(rootNode.children.length).to.equal(2);
174
+ (0, chai_1.expect)(rootNode.children[0]).to.equal(markerInfoNodeA);
175
+ (0, chai_1.expect)(markerInfoNodeA.nextSibling).to.equal(markerInfoNodeB);
176
+ (0, chai_1.expect)(rootNode.children[1]).to.equal(markerInfoNodeB);
177
+ (0, chai_1.expect)(markerInfoNodeB.previousSibling).to.equal(markerInfoNodeA);
178
+ });
179
+ });
180
+ });
181
+ function createMarkerInfo(id, uri, marker) {
182
+ return {
183
+ children: marker ? marker : [],
184
+ expanded: true,
185
+ uri,
186
+ id,
187
+ parent: rootNode,
188
+ selected: false,
189
+ numberOfMarkers: marker ? marker.length : 0
190
+ };
191
+ }
192
+ /**
193
+ * Create a mock marker node with the given diagnostic marker.
194
+ * @param marker the diagnostic marker.
195
+ *
196
+ * @returns a mock marker node.
197
+ */
198
+ function createMockMarkerNode(marker) {
199
+ return {
200
+ id: 'id',
201
+ name: 'marker',
202
+ parent: undefined,
203
+ selected: false,
204
+ uri: new uri_1.default(''),
205
+ marker
206
+ };
207
+ }
208
+ /**
209
+ * Create a mock diagnostic marker.
210
+ * @param range the diagnostic range.
211
+ * @param severity the diagnostic severity.
212
+ * @param owner the optional owner of the diagnostic
213
+ *
214
+ * @returns a mock diagnostic marker.
215
+ */
216
+ function createMockMarker(range, severity, owner) {
217
+ const data = {
218
+ range: range,
219
+ severity: severity,
220
+ message: 'message'
221
+ };
222
+ return Object.freeze({
223
+ uri: 'uri',
224
+ kind: 'marker',
225
+ owner: owner !== null && owner !== void 0 ? owner : 'owner',
226
+ data
227
+ });
228
+ }
229
+ function getRootNode(id) {
230
+ return {
231
+ visible: false,
232
+ id: id,
233
+ name: 'MarkerTree',
234
+ kind: 'problem',
235
+ children: [],
236
+ parent: undefined
237
+ };
238
+ }
239
+ //# sourceMappingURL=problem-composite-tree-node.spec.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"problem-composite-tree-node.spec.js","sourceRoot":"","sources":["../../../src/browser/problem/problem-composite-tree-node.spec.ts"],"names":[],"mappings":";AAAA,gFAAgF;AAChF,+CAA+C;AAC/C,EAAE;AACF,2EAA2E;AAC3E,mEAAmE;AACnE,wCAAwC;AACxC,EAAE;AACF,4EAA4E;AAC5E,8EAA8E;AAC9E,6EAA6E;AAC7E,yDAAyD;AACzD,uDAAuD;AACvD,EAAE;AACF,gFAAgF;AAChF,gFAAgF;;AAEhF,8DAAiE;AACjE,IAAI,YAAY,GAAG,IAAA,mBAAW,GAAE,CAAC;AAEjC,uHAAiH;AACjH,wEAAiC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;AAE1C,oDAA6C;AAC7C,+BAA8B;AAC9B,4DAAyD;AACzD,sGAA0G;AAC1G,wDAAqD;AACrD,sDAAkD;AAClD,gDAA2F;AAC3F,2DAAsD;AACtD,uDAAmD;AACnD,6DAAmD;AACnD,6EAAyE;AACzE,+EAAyE;AAGzE,YAAY,EAAE,CAAC;AAEf,IAAI,QAAwB,CAAC;AAE7B,MAAM,CAAC,GAAG,EAAE;IACR,YAAY,GAAG,IAAA,mBAAW,GAAE,CAAC;IAC7B,MAAM,aAAa,GAAG,IAAI,qBAAS,EAAE,CAAC;IAEtC,aAAa,CAAC,IAAI,CAAC,8BAAa,CAAC,CAAC,MAAM,EAAE,CAAC,gBAAgB,EAAE,CAAC;IAC9D,aAAa,CAAC,IAAI,CAAC,gCAAc,CAAC,CAAC,MAAM,EAAE,CAAC;IAC5C,aAAa,CAAC,IAAI,CAAC,2BAAa,CAAC,CAAC,eAAe,CAAC,mCAAe,CAAC,CAAC;IACnE,aAAa,CAAC,IAAI,CAAC,0BAAW,CAAC,CAAC,eAAe,CAAc;QACzD,gBAAgB,EAAE,aAAK,CAAC,IAAI;KAC/B,CAAC,CAAC;IAEH,aAAa,CAAC,IAAI,CAAC,gCAAW,CAAC,CAAC,MAAM,EAAE,CAAC,gBAAgB,EAAE,CAAC;AAChE,CAAC,CAAC,CAAC;AAEH,UAAU,CAAC,GAAG,EAAE;IACZ,QAAQ,GAAG,WAAW,CAAC,6BAA6B,CAAC,CAAC;AAC1D,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,GAAG,EAAE;IACP,YAAY,EAAE,CAAC;AACnB,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,6BAA6B,EAAE,GAAG,EAAE;IAEzC,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;QAE9B,QAAQ,CAAC,uDAAuD,EAAE,GAAG,EAAE;YAEnE,SAAS,mBAAmB,CAAC,IAAwB,EAAE,GAAuB;gBAC1E,MAAM,UAAU,GAAG,gBAAgB,CAAC,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;gBAClH,MAAM,SAAS,GAAG,gBAAgB,CAAC,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC;gBAChH,MAAM,QAAQ,GAAG,oBAAoB,CAAC,UAAU,CAAC,CAAC;gBAClD,MAAM,OAAO,GAAG,oBAAoB,CAAC,SAAS,CAAC,CAAC;gBAChD,MAAM,cAAc,GAAG,gBAAgB,CAAC,GAAG,EAAE,IAAI,aAAG,CAAC,GAAG,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;gBACvE,MAAM,aAAa,GAAG,gBAAgB,CAAC,GAAG,EAAE,IAAI,aAAG,CAAC,GAAG,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;gBAErE,MAAM,aAAa,GAAG,WAAW,CAAC,eAAe,CAAC,CAAC;gBACnD,sDAAwB,CAAC,WAAW,CAAC,aAAa,EAAE;oBAChD,EAAE,IAAI,EAAE,cAAc,EAAE,OAAO,EAAE,CAAC,UAAU,CAAC,EAAE;oBAC/C,EAAE,IAAI,EAAE,aAAa,EAAE,OAAO,EAAE,CAAC,SAAS,CAAC,EAAE;iBAChD,CAAC,CAAC;gBACH,qBAAqB,CAAC,aAAa,CAAC,CAAC;gBACrC,MAAM,YAAY,GAAG,WAAW,CAAC,cAAc,CAAC,CAAC;gBACjD,sDAAwB,CAAC,WAAW,CAAC,YAAY,EAAE;oBAC/C,EAAE,IAAI,EAAE,aAAa,EAAE,OAAO,EAAE,CAAC,SAAS,CAAC,EAAE;oBAC7C,EAAE,IAAI,EAAE,cAAc,EAAE,OAAO,EAAE,CAAC,UAAU,CAAC,EAAE;iBAClD,CAAC,CAAC;gBACH,qBAAqB,CAAC,YAAY,CAAC,CAAC;gBAEpC,SAAS,qBAAqB,CAAC,IAAoB;oBAC/C,IAAA,aAAM,EAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;oBACzC,IAAA,aAAM,EAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;oBAClD,IAAA,aAAM,EAAC,cAAc,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;oBAC3D,IAAA,aAAM,EAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;oBACjD,IAAA,aAAM,EAAC,aAAa,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;gBACnE,CAAC;YACL,CAAC;YAED,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;gBAC9C,mBAAmB,CAAC,mDAAkB,CAAC,KAAK,EAAE,mDAAkB,CAAC,OAAO,CAAC,CAAC;YAC9E,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;gBAC5C,mBAAmB,CAAC,mDAAkB,CAAC,KAAK,EAAE,mDAAkB,CAAC,WAAW,CAAC,CAAC;YAClF,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;gBAC5C,mBAAmB,CAAC,mDAAkB,CAAC,KAAK,EAAE,mDAAkB,CAAC,IAAI,CAAC,CAAC;YAC3E,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;gBAC9C,mBAAmB,CAAC,mDAAkB,CAAC,OAAO,EAAE,mDAAkB,CAAC,WAAW,CAAC,CAAC;YACpF,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;gBAC9C,mBAAmB,CAAC,mDAAkB,CAAC,OAAO,EAAE,mDAAkB,CAAC,IAAI,CAAC,CAAC;YAC7E,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;gBAC3C,mBAAmB,CAAC,mDAAkB,CAAC,WAAW,EAAE,mDAAkB,CAAC,IAAI,CAAC,CAAC;YACjF,CAAC,CAAC,CAAC;QACP,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,8DAA8D,EAAE,GAAG,EAAE;YACpE,MAAM,OAAO,GAAG,gBAAgB,CAAC,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,EAAE,mDAAkB,CAAC,KAAK,CAAC,CAAC;YACnI,MAAM,OAAO,GAAG,gBAAgB,CAAC,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,EAAE,mDAAkB,CAAC,KAAK,CAAC,CAAC;YACnI,MAAM,KAAK,GAAG,oBAAoB,CAAC,OAAO,CAAC,CAAC;YAC5C,MAAM,KAAK,GAAG,oBAAoB,CAAC,OAAO,CAAC,CAAC;YAC5C,MAAM,eAAe,GAAG,gBAAgB,CAAC,GAAG,EAAE,IAAI,aAAG,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;YACrE,MAAM,eAAe,GAAG,gBAAgB,CAAC,GAAG,EAAE,IAAI,aAAG,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;YACrE,sDAAwB,CAAC,WAAW,CAAC,QAAQ,EAAE;gBAC3C,EAAE,IAAI,EAAE,eAAe,EAAE,OAAO,EAAE,CAAC,OAAO,CAAC,EAAE;gBAC7C,EAAE,IAAI,EAAE,eAAe,EAAE,OAAO,EAAE,CAAC,OAAO,CAAC,EAAE;aAChD,CAAC,CAAC;YAEH,IAAA,aAAM,EAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC7C,IAAA,aAAM,EAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;YACvD,IAAA,aAAM,EAAC,eAAe,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;YAC9D,IAAA,aAAM,EAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;YACvD,IAAA,aAAM,EAAC,eAAe,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;QACtE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,uEAAuE,EAAE,GAAG,EAAE;YAC7E,MAAM,OAAO,GAAG,gBAAgB,CAAC,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,EAAE,mDAAkB,CAAC,KAAK,CAAC,CAAC;YACnI,MAAM,KAAK,GAAG,oBAAoB,CAAC,OAAO,CAAC,CAAC;YAC5C,MAAM,eAAe,GAAG,gBAAgB,CAAC,GAAG,EAAE,IAAI,aAAG,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;YACrE,sDAAwB,CAAC,WAAW,CAAC,QAAQ,EAAE;gBAC3C,EAAE,IAAI,EAAE,eAAe,EAAE,OAAO,EAAE,CAAC,OAAO,CAAC,EAAE;aAChD,CAAC,CAAC;YAEH,OAAO,CAAC,IAAI,CAAC,QAAQ,GAAG,mDAAkB,CAAC,IAAI,CAAC;YAChD,sDAAwB,CAAC,WAAW,CAAC,QAAQ,EAAE;gBAC3C,EAAE,IAAI,EAAE,eAAe,EAAE,OAAO,EAAE,CAAC,OAAO,CAAC,EAAE;aAChD,CAAC,CAAC;YAEH,IAAA,aAAM,EAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC7C,IAAA,aAAM,EAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;QAC3D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,sEAAsE,EAAE,GAAG,EAAE;YAC5E,MAAM,OAAO,GAAG,gBAAgB,CAAC,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,EAAE,mDAAkB,CAAC,KAAK,CAAC,CAAC;YACnI,MAAM,KAAK,GAAG,oBAAoB,CAAC,OAAO,CAAC,CAAC;YAC5C,MAAM,eAAe,GAAG,gBAAgB,CAAC,GAAG,EAAE,IAAI,aAAG,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;YACrE,sDAAwB,CAAC,WAAW,CAAC,QAAQ,EAAE;gBAC3C,EAAE,IAAI,EAAE,eAAe,EAAE,OAAO,EAAE,CAAC,OAAO,CAAC,EAAE;aAChD,CAAC,CAAC;YAEH,MAAM,OAAO,GAAG,gBAAgB,CAAC,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,EAAE,mDAAkB,CAAC,KAAK,CAAC,CAAC;YACnI,MAAM,KAAK,GAAG,oBAAoB,CAAC,OAAO,CAAC,CAAC;YAC5C,MAAM,eAAe,GAAG,gBAAgB,CAAC,GAAG,EAAE,IAAI,aAAG,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;YACrE,sDAAwB,CAAC,WAAW,CAAC,QAAQ,EAAE;gBAC3C,EAAE,IAAI,EAAE,eAAe,EAAE,OAAO,EAAE,CAAC,OAAO,CAAC,EAAE;aAChD,CAAC,CAAC;YAEH,OAAO,CAAC,IAAI,CAAC,QAAQ,GAAG,mDAAkB,CAAC,IAAI,CAAC;YAChD,sDAAwB,CAAC,WAAW,CAAC,QAAQ,EAAE;gBAC3C,EAAE,IAAI,EAAE,eAAe,EAAE,OAAO,EAAE,CAAC,OAAO,CAAC,EAAE;aAChD,CAAC,CAAC;YAEH,IAAA,aAAM,EAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC7C,IAAA,aAAM,EAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;YACvD,IAAA,aAAM,EAAC,eAAe,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;YAC9D,IAAA,aAAM,EAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;YACvD,IAAA,aAAM,EAAC,eAAe,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;QACtE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,uEAAuE,EAAE,GAAG,EAAE;YAC7E,MAAM,OAAO,GAAG,gBAAgB,CAAC,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,EAAE,mDAAkB,CAAC,IAAI,CAAC,CAAC;YAClI,MAAM,KAAK,GAAG,oBAAoB,CAAC,OAAO,CAAC,CAAC;YAC5C,MAAM,eAAe,GAAG,gBAAgB,CAAC,GAAG,EAAE,IAAI,aAAG,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;YACrE,sDAAwB,CAAC,WAAW,CAAC,QAAQ,EAAE;gBAC3C,EAAE,IAAI,EAAE,eAAe,EAAE,OAAO,EAAE,CAAC,OAAO,CAAC,EAAE;aAChD,CAAC,CAAC;YAEH,MAAM,OAAO,GAAG,gBAAgB,CAAC,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,EAAE,mDAAkB,CAAC,KAAK,CAAC,CAAC;YACnI,MAAM,KAAK,GAAG,oBAAoB,CAAC,OAAO,CAAC,CAAC;YAC5C,MAAM,eAAe,GAAG,gBAAgB,CAAC,GAAG,EAAE,IAAI,aAAG,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;YACrE,sDAAwB,CAAC,WAAW,CAAC,QAAQ,EAAE;gBAC3C,EAAE,IAAI,EAAE,eAAe,EAAE,OAAO,EAAE,CAAC,OAAO,CAAC,EAAE;aAChD,CAAC,CAAC;YAEH,OAAO,CAAC,IAAI,CAAC,QAAQ,GAAG,mDAAkB,CAAC,KAAK,CAAC;YACjD,sDAAwB,CAAC,WAAW,CAAC,QAAQ,EAAE;gBAC3C,EAAE,IAAI,EAAE,eAAe,EAAE,OAAO,EAAE,CAAC,OAAO,CAAC,EAAE;aAChD,CAAC,CAAC;YAEH,IAAA,aAAM,EAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC7C,IAAA,aAAM,EAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;YACvD,IAAA,aAAM,EAAC,eAAe,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;YAC9D,IAAA,aAAM,EAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;YACvD,IAAA,aAAM,EAAC,eAAe,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;QACtE,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;AACP,CAAC,CAAC,CAAC;AAEH,SAAS,gBAAgB,CAAC,EAAU,EAAE,GAAQ,EAAE,MAAoB;IAChE,OAAO;QACH,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE;QAC9B,QAAQ,EAAE,IAAI;QACd,GAAG;QACH,EAAE;QACF,MAAM,EAAE,QAAQ;QAChB,QAAQ,EAAE,KAAK;QACf,eAAe,EAAE,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;KAC9C,CAAC;AACN,CAAC;AAED;;;;;GAKG;AACH,SAAS,oBAAoB,CAAC,MAA0B;IACpD,OAAO;QACH,EAAE,EAAE,IAAI;QACR,IAAI,EAAE,QAAQ;QACd,MAAM,EAAE,SAAS;QACjB,QAAQ,EAAE,KAAK;QACf,GAAG,EAAE,IAAI,aAAG,CAAC,EAAE,CAAC;QAChB,MAAM;KACT,CAAC;AACN,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,gBAAgB,CAAC,KAAY,EAAE,QAA4B,EAAE,KAAc;IAChF,MAAM,IAAI,GAAe;QACrB,KAAK,EAAE,KAAK;QACZ,QAAQ,EAAE,QAAQ;QAClB,OAAO,EAAE,SAAS;KACrB,CAAC;IACF,OAAO,MAAM,CAAC,MAAM,CAAC;QACjB,GAAG,EAAE,KAAK;QACV,IAAI,EAAE,QAAQ;QACd,KAAK,EAAE,KAAK,aAAL,KAAK,cAAL,KAAK,GAAI,OAAO;QACvB,IAAI;KACP,CAAC,CAAC;AACP,CAAC;AAED,SAAS,WAAW,CAAC,EAAU;IAC3B,OAAO;QACH,OAAO,EAAE,KAAK;QACd,EAAE,EAAE,EAAE;QACN,IAAI,EAAE,YAAY;QAClB,IAAI,EAAE,SAAS;QACf,QAAQ,EAAE,EAAE;QACZ,MAAM,EAAE,SAAS;KACpB,CAAC;AACN,CAAC"}
@@ -0,0 +1,9 @@
1
+ import { interfaces, Container } from '@theia/core/shared/inversify';
2
+ import { MarkerOptions } from '../marker-tree';
3
+ import { ProblemWidget } from './problem-widget';
4
+ import { TreeProps } from '@theia/core/lib/browser';
5
+ export declare const PROBLEM_TREE_PROPS: TreeProps;
6
+ export declare const PROBLEM_OPTIONS: MarkerOptions;
7
+ export declare function createProblemTreeContainer(parent: interfaces.Container): Container;
8
+ export declare function createProblemWidget(parent: interfaces.Container): ProblemWidget;
9
+ //# sourceMappingURL=problem-container.d.ts.map