@theia/markers 1.45.1 → 1.46.0-next.72
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.
- package/README.md +33 -33
- package/lib/browser/index.d.ts +2 -2
- package/lib/browser/index.js +29 -29
- package/lib/browser/marker-manager.d.ts +47 -47
- package/lib/browser/marker-manager.js +187 -187
- package/lib/browser/marker-tree-label-provider.d.ts +15 -15
- package/lib/browser/marker-tree-label-provider.js +84 -84
- package/lib/browser/marker-tree-label-provider.spec.d.ts +1 -1
- package/lib/browser/marker-tree-label-provider.spec.js +201 -201
- package/lib/browser/marker-tree-model.d.ts +12 -12
- package/lib/browser/marker-tree-model.js +60 -60
- package/lib/browser/marker-tree.d.ts +42 -42
- package/lib/browser/marker-tree.js +143 -143
- package/lib/browser/problem/problem-composite-tree-node.d.ts +11 -11
- package/lib/browser/problem/problem-composite-tree-node.js +76 -76
- package/lib/browser/problem/problem-composite-tree-node.spec.d.ts +1 -1
- package/lib/browser/problem/problem-composite-tree-node.spec.js +238 -238
- package/lib/browser/problem/problem-container.d.ts +8 -8
- package/lib/browser/problem/problem-container.js +46 -46
- package/lib/browser/problem/problem-contribution.d.ts +51 -51
- package/lib/browser/problem/problem-contribution.js +247 -247
- package/lib/browser/problem/problem-decorations-provider.d.ts +21 -21
- package/lib/browser/problem/problem-decorations-provider.js +95 -95
- package/lib/browser/problem/problem-decorator.d.ts +57 -57
- package/lib/browser/problem/problem-decorator.js +233 -233
- package/lib/browser/problem/problem-frontend-module.d.ts +4 -4
- package/lib/browser/problem/problem-frontend-module.js +55 -55
- package/lib/browser/problem/problem-layout-migrations.d.ts +5 -5
- package/lib/browser/problem/problem-layout-migrations.js +43 -43
- package/lib/browser/problem/problem-manager.d.ts +11 -11
- package/lib/browser/problem/problem-manager.js +53 -53
- package/lib/browser/problem/problem-manager.spec.d.ts +1 -1
- package/lib/browser/problem/problem-manager.spec.js +167 -167
- package/lib/browser/problem/problem-preferences.d.ts +13 -13
- package/lib/browser/problem/problem-preferences.js +56 -56
- package/lib/browser/problem/problem-selection.d.ts +12 -12
- package/lib/browser/problem/problem-selection.js +34 -34
- package/lib/browser/problem/problem-tabbar-decorator.d.ts +42 -42
- package/lib/browser/problem/problem-tabbar-decorator.js +160 -160
- package/lib/browser/problem/problem-tree-model.d.ts +32 -32
- package/lib/browser/problem/problem-tree-model.js +131 -131
- package/lib/browser/problem/problem-tree-model.spec.d.ts +1 -1
- package/lib/browser/problem/problem-tree-model.spec.js +172 -172
- package/lib/browser/problem/problem-utils.d.ts +44 -44
- package/lib/browser/problem/problem-utils.js +84 -84
- package/lib/browser/problem/problem-widget-tab-bar-decorator.d.ts +14 -14
- package/lib/browser/problem/problem-widget-tab-bar-decorator.js +69 -69
- package/lib/browser/problem/problem-widget.d.ts +46 -46
- package/lib/browser/problem/problem-widget.js +235 -235
- package/lib/common/marker.d.ts +16 -16
- package/lib/common/marker.js +31 -31
- package/lib/common/problem-marker.d.ts +9 -9
- package/lib/common/problem-marker.js +27 -27
- package/package.json +6 -6
- package/src/browser/index.ts +18 -18
- package/src/browser/marker-manager.ts +205 -205
- package/src/browser/marker-tree-label-provider.spec.ts +245 -245
- package/src/browser/marker-tree-label-provider.ts +75 -75
- package/src/browser/marker-tree-model.ts +47 -47
- package/src/browser/marker-tree.ts +154 -154
- package/src/browser/problem/problem-composite-tree-node.spec.ts +277 -277
- package/src/browser/problem/problem-composite-tree-node.ts +81 -81
- package/src/browser/problem/problem-container.ts +47 -47
- package/src/browser/problem/problem-contribution.ts +247 -247
- package/src/browser/problem/problem-decorations-provider.ts +72 -72
- package/src/browser/problem/problem-decorator.ts +222 -222
- package/src/browser/problem/problem-frontend-module.ts +64 -64
- package/src/browser/problem/problem-layout-migrations.ts +32 -32
- package/src/browser/problem/problem-manager.spec.ts +216 -216
- package/src/browser/problem/problem-manager.ts +51 -51
- package/src/browser/problem/problem-preferences.ts +64 -64
- package/src/browser/problem/problem-selection.ts +45 -45
- package/src/browser/problem/problem-tabbar-decorator.ts +151 -151
- package/src/browser/problem/problem-tree-model.spec.ts +189 -189
- package/src/browser/problem/problem-tree-model.ts +124 -124
- package/src/browser/problem/problem-utils.ts +90 -90
- package/src/browser/problem/problem-widget-tab-bar-decorator.ts +55 -55
- package/src/browser/problem/problem-widget.tsx +246 -246
- package/src/browser/style/index.css +92 -92
- package/src/common/marker.ts +53 -53
- package/src/common/problem-marker.ts +30 -30
|
@@ -1,173 +1,173 @@
|
|
|
1
|
-
"use strict";
|
|
2
|
-
// *****************************************************************************
|
|
3
|
-
// Copyright (C) 2020 Ericsson 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
|
-
disableJSDOM();
|
|
34
|
-
let problemTree;
|
|
35
|
-
before(() => {
|
|
36
|
-
disableJSDOM = (0, jsdom_1.enableJSDOM)();
|
|
37
|
-
const testContainer = new inversify_1.Container();
|
|
38
|
-
testContainer.bind(marker_manager_1.MarkerManager).toSelf().inSingletonScope();
|
|
39
|
-
testContainer.bind(problem_manager_1.ProblemManager).toSelf();
|
|
40
|
-
testContainer.bind(marker_tree_1.MarkerOptions).toConstantValue(problem_container_1.PROBLEM_OPTIONS);
|
|
41
|
-
testContainer.bind(file_service_1.FileService).toConstantValue({
|
|
42
|
-
onDidFilesChange: event_1.Event.None
|
|
43
|
-
});
|
|
44
|
-
testContainer.bind(problem_tree_model_1.ProblemTree).toSelf().inSingletonScope();
|
|
45
|
-
problemTree = testContainer.get(problem_tree_model_1.ProblemTree);
|
|
46
|
-
});
|
|
47
|
-
after(() => {
|
|
48
|
-
disableJSDOM();
|
|
49
|
-
});
|
|
50
|
-
describe('Problem Tree', () => {
|
|
51
|
-
describe('#sortMarkers', () => {
|
|
52
|
-
describe('should sort markers based on the highest severity', () => {
|
|
53
|
-
it('should sort errors higher than warnings', () => {
|
|
54
|
-
const markerA = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Error);
|
|
55
|
-
const markerB = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Warning);
|
|
56
|
-
const nodeA = createMockMarkerNode(markerA);
|
|
57
|
-
const nodeB = createMockMarkerNode(markerB);
|
|
58
|
-
(0, chai_1.expect)(problemTree['sortMarkers'](nodeA, nodeB)).equals(-1);
|
|
59
|
-
(0, chai_1.expect)(problemTree['sortMarkers'](nodeB, nodeA)).equals(1);
|
|
60
|
-
});
|
|
61
|
-
it('should sort errors higher than infos', () => {
|
|
62
|
-
const markerA = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Error);
|
|
63
|
-
const markerB = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Information);
|
|
64
|
-
const nodeA = createMockMarkerNode(markerA);
|
|
65
|
-
const nodeB = createMockMarkerNode(markerB);
|
|
66
|
-
(0, chai_1.expect)(problemTree['sortMarkers'](nodeA, nodeB)).equals(-2);
|
|
67
|
-
(0, chai_1.expect)(problemTree['sortMarkers'](nodeB, nodeA)).equals(2);
|
|
68
|
-
});
|
|
69
|
-
it('should sort errors higher than hints', () => {
|
|
70
|
-
const markerA = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Error);
|
|
71
|
-
const markerB = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Hint);
|
|
72
|
-
const nodeA = createMockMarkerNode(markerA);
|
|
73
|
-
const nodeB = createMockMarkerNode(markerB);
|
|
74
|
-
(0, chai_1.expect)(problemTree['sortMarkers'](nodeA, nodeB)).equals(-3);
|
|
75
|
-
(0, chai_1.expect)(problemTree['sortMarkers'](nodeB, nodeA)).equals(3);
|
|
76
|
-
});
|
|
77
|
-
it('should sort warnings higher than infos', () => {
|
|
78
|
-
const markerA = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Warning);
|
|
79
|
-
const markerB = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Information);
|
|
80
|
-
const nodeA = createMockMarkerNode(markerA);
|
|
81
|
-
const nodeB = createMockMarkerNode(markerB);
|
|
82
|
-
(0, chai_1.expect)(problemTree['sortMarkers'](nodeA, nodeB)).equals(-1);
|
|
83
|
-
(0, chai_1.expect)(problemTree['sortMarkers'](nodeB, nodeA)).equals(1);
|
|
84
|
-
});
|
|
85
|
-
it('should sort warnings higher than hints', () => {
|
|
86
|
-
const markerA = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Warning);
|
|
87
|
-
const markerB = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Hint);
|
|
88
|
-
const nodeA = createMockMarkerNode(markerA);
|
|
89
|
-
const nodeB = createMockMarkerNode(markerB);
|
|
90
|
-
(0, chai_1.expect)(problemTree['sortMarkers'](nodeA, nodeB)).equals(-2);
|
|
91
|
-
(0, chai_1.expect)(problemTree['sortMarkers'](nodeB, nodeA)).equals(2);
|
|
92
|
-
});
|
|
93
|
-
it('should sort infos higher than hints', () => {
|
|
94
|
-
const markerA = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Information);
|
|
95
|
-
const markerB = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Hint);
|
|
96
|
-
const nodeA = createMockMarkerNode(markerA);
|
|
97
|
-
const nodeB = createMockMarkerNode(markerB);
|
|
98
|
-
(0, chai_1.expect)(problemTree['sortMarkers'](nodeA, nodeB)).equals(-1);
|
|
99
|
-
(0, chai_1.expect)(problemTree['sortMarkers'](nodeB, nodeA)).equals(1);
|
|
100
|
-
});
|
|
101
|
-
});
|
|
102
|
-
it('should sort markers based on lowest line number if their severities are equal', () => {
|
|
103
|
-
const markerA = createMockMarker({ start: { line: 1, character: 10 }, end: { line: 1, character: 20 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Error);
|
|
104
|
-
const markerB = createMockMarker({ start: { line: 5, character: 10 }, end: { line: 5, character: 20 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Error);
|
|
105
|
-
const nodeA = createMockMarkerNode(markerA);
|
|
106
|
-
const nodeB = createMockMarkerNode(markerB);
|
|
107
|
-
(0, chai_1.expect)(problemTree['sortMarkers'](nodeA, nodeB)).equals(-4);
|
|
108
|
-
(0, chai_1.expect)(problemTree['sortMarkers'](nodeB, nodeA)).equals(4);
|
|
109
|
-
});
|
|
110
|
-
it('should sort markers based on lowest column number if their severities and line numbers are equal', () => {
|
|
111
|
-
const markerA = createMockMarker({ start: { line: 1, character: 10 }, end: { line: 1, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Error);
|
|
112
|
-
const markerB = createMockMarker({ start: { line: 1, character: 20 }, end: { line: 1, character: 20 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Error);
|
|
113
|
-
const nodeA = createMockMarkerNode(markerA);
|
|
114
|
-
const nodeB = createMockMarkerNode(markerB);
|
|
115
|
-
(0, chai_1.expect)(problemTree['sortMarkers'](nodeA, nodeB)).equals(-10);
|
|
116
|
-
(0, chai_1.expect)(problemTree['sortMarkers'](nodeB, nodeA)).equals(10);
|
|
117
|
-
});
|
|
118
|
-
it('should sort markers based on owner if their severities, line numbers and columns are equal', () => {
|
|
119
|
-
const markerA = createMockMarker({ start: { line: 1, character: 10 }, end: { line: 1, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Error, 'A');
|
|
120
|
-
const markerB = createMockMarker({ start: { line: 1, character: 10 }, end: { line: 1, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Error, 'B');
|
|
121
|
-
const nodeA = createMockMarkerNode(markerA);
|
|
122
|
-
const nodeB = createMockMarkerNode(markerB);
|
|
123
|
-
(0, chai_1.expect)(problemTree['sortMarkers'](nodeA, nodeB)).equals(-1);
|
|
124
|
-
(0, chai_1.expect)(problemTree['sortMarkers'](nodeB, nodeA)).equals(1);
|
|
125
|
-
});
|
|
126
|
-
it('should not sort if markers are equal', () => {
|
|
127
|
-
const markerA = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Error);
|
|
128
|
-
const markerB = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Error);
|
|
129
|
-
const nodeA = createMockMarkerNode(markerA);
|
|
130
|
-
const nodeB = createMockMarkerNode(markerB);
|
|
131
|
-
(0, chai_1.expect)(problemTree['sortMarkers'](nodeA, nodeB)).equals(0);
|
|
132
|
-
(0, chai_1.expect)(problemTree['sortMarkers'](nodeB, nodeA)).equals(0);
|
|
133
|
-
});
|
|
134
|
-
});
|
|
135
|
-
});
|
|
136
|
-
/**
|
|
137
|
-
* Create a mock marker node with the given diagnostic marker.
|
|
138
|
-
* @param marker the diagnostic marker.
|
|
139
|
-
*
|
|
140
|
-
* @returns a mock marker node.
|
|
141
|
-
*/
|
|
142
|
-
function createMockMarkerNode(marker) {
|
|
143
|
-
return {
|
|
144
|
-
id: 'id',
|
|
145
|
-
name: 'marker',
|
|
146
|
-
parent: undefined,
|
|
147
|
-
selected: false,
|
|
148
|
-
uri: new uri_1.default(''),
|
|
149
|
-
marker
|
|
150
|
-
};
|
|
151
|
-
}
|
|
152
|
-
/**
|
|
153
|
-
* Create a mock diagnostic marker.
|
|
154
|
-
* @param range the diagnostic range.
|
|
155
|
-
* @param severity the diagnostic severity.
|
|
156
|
-
* @param owner the optional owner of the diagnostic
|
|
157
|
-
*
|
|
158
|
-
* @returns a mock diagnostic marker.
|
|
159
|
-
*/
|
|
160
|
-
function createMockMarker(range, severity, owner) {
|
|
161
|
-
const data = {
|
|
162
|
-
range: range,
|
|
163
|
-
severity: severity,
|
|
164
|
-
message: 'message'
|
|
165
|
-
};
|
|
166
|
-
return Object.freeze({
|
|
167
|
-
uri: 'uri',
|
|
168
|
-
kind: 'marker',
|
|
169
|
-
owner: owner !== null && owner !== void 0 ? owner : 'owner',
|
|
170
|
-
data
|
|
171
|
-
});
|
|
172
|
-
}
|
|
1
|
+
"use strict";
|
|
2
|
+
// *****************************************************************************
|
|
3
|
+
// Copyright (C) 2020 Ericsson 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
|
+
disableJSDOM();
|
|
34
|
+
let problemTree;
|
|
35
|
+
before(() => {
|
|
36
|
+
disableJSDOM = (0, jsdom_1.enableJSDOM)();
|
|
37
|
+
const testContainer = new inversify_1.Container();
|
|
38
|
+
testContainer.bind(marker_manager_1.MarkerManager).toSelf().inSingletonScope();
|
|
39
|
+
testContainer.bind(problem_manager_1.ProblemManager).toSelf();
|
|
40
|
+
testContainer.bind(marker_tree_1.MarkerOptions).toConstantValue(problem_container_1.PROBLEM_OPTIONS);
|
|
41
|
+
testContainer.bind(file_service_1.FileService).toConstantValue({
|
|
42
|
+
onDidFilesChange: event_1.Event.None
|
|
43
|
+
});
|
|
44
|
+
testContainer.bind(problem_tree_model_1.ProblemTree).toSelf().inSingletonScope();
|
|
45
|
+
problemTree = testContainer.get(problem_tree_model_1.ProblemTree);
|
|
46
|
+
});
|
|
47
|
+
after(() => {
|
|
48
|
+
disableJSDOM();
|
|
49
|
+
});
|
|
50
|
+
describe('Problem Tree', () => {
|
|
51
|
+
describe('#sortMarkers', () => {
|
|
52
|
+
describe('should sort markers based on the highest severity', () => {
|
|
53
|
+
it('should sort errors higher than warnings', () => {
|
|
54
|
+
const markerA = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Error);
|
|
55
|
+
const markerB = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Warning);
|
|
56
|
+
const nodeA = createMockMarkerNode(markerA);
|
|
57
|
+
const nodeB = createMockMarkerNode(markerB);
|
|
58
|
+
(0, chai_1.expect)(problemTree['sortMarkers'](nodeA, nodeB)).equals(-1);
|
|
59
|
+
(0, chai_1.expect)(problemTree['sortMarkers'](nodeB, nodeA)).equals(1);
|
|
60
|
+
});
|
|
61
|
+
it('should sort errors higher than infos', () => {
|
|
62
|
+
const markerA = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Error);
|
|
63
|
+
const markerB = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Information);
|
|
64
|
+
const nodeA = createMockMarkerNode(markerA);
|
|
65
|
+
const nodeB = createMockMarkerNode(markerB);
|
|
66
|
+
(0, chai_1.expect)(problemTree['sortMarkers'](nodeA, nodeB)).equals(-2);
|
|
67
|
+
(0, chai_1.expect)(problemTree['sortMarkers'](nodeB, nodeA)).equals(2);
|
|
68
|
+
});
|
|
69
|
+
it('should sort errors higher than hints', () => {
|
|
70
|
+
const markerA = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Error);
|
|
71
|
+
const markerB = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Hint);
|
|
72
|
+
const nodeA = createMockMarkerNode(markerA);
|
|
73
|
+
const nodeB = createMockMarkerNode(markerB);
|
|
74
|
+
(0, chai_1.expect)(problemTree['sortMarkers'](nodeA, nodeB)).equals(-3);
|
|
75
|
+
(0, chai_1.expect)(problemTree['sortMarkers'](nodeB, nodeA)).equals(3);
|
|
76
|
+
});
|
|
77
|
+
it('should sort warnings higher than infos', () => {
|
|
78
|
+
const markerA = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Warning);
|
|
79
|
+
const markerB = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Information);
|
|
80
|
+
const nodeA = createMockMarkerNode(markerA);
|
|
81
|
+
const nodeB = createMockMarkerNode(markerB);
|
|
82
|
+
(0, chai_1.expect)(problemTree['sortMarkers'](nodeA, nodeB)).equals(-1);
|
|
83
|
+
(0, chai_1.expect)(problemTree['sortMarkers'](nodeB, nodeA)).equals(1);
|
|
84
|
+
});
|
|
85
|
+
it('should sort warnings higher than hints', () => {
|
|
86
|
+
const markerA = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Warning);
|
|
87
|
+
const markerB = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Hint);
|
|
88
|
+
const nodeA = createMockMarkerNode(markerA);
|
|
89
|
+
const nodeB = createMockMarkerNode(markerB);
|
|
90
|
+
(0, chai_1.expect)(problemTree['sortMarkers'](nodeA, nodeB)).equals(-2);
|
|
91
|
+
(0, chai_1.expect)(problemTree['sortMarkers'](nodeB, nodeA)).equals(2);
|
|
92
|
+
});
|
|
93
|
+
it('should sort infos higher than hints', () => {
|
|
94
|
+
const markerA = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Information);
|
|
95
|
+
const markerB = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Hint);
|
|
96
|
+
const nodeA = createMockMarkerNode(markerA);
|
|
97
|
+
const nodeB = createMockMarkerNode(markerB);
|
|
98
|
+
(0, chai_1.expect)(problemTree['sortMarkers'](nodeA, nodeB)).equals(-1);
|
|
99
|
+
(0, chai_1.expect)(problemTree['sortMarkers'](nodeB, nodeA)).equals(1);
|
|
100
|
+
});
|
|
101
|
+
});
|
|
102
|
+
it('should sort markers based on lowest line number if their severities are equal', () => {
|
|
103
|
+
const markerA = createMockMarker({ start: { line: 1, character: 10 }, end: { line: 1, character: 20 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Error);
|
|
104
|
+
const markerB = createMockMarker({ start: { line: 5, character: 10 }, end: { line: 5, character: 20 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Error);
|
|
105
|
+
const nodeA = createMockMarkerNode(markerA);
|
|
106
|
+
const nodeB = createMockMarkerNode(markerB);
|
|
107
|
+
(0, chai_1.expect)(problemTree['sortMarkers'](nodeA, nodeB)).equals(-4);
|
|
108
|
+
(0, chai_1.expect)(problemTree['sortMarkers'](nodeB, nodeA)).equals(4);
|
|
109
|
+
});
|
|
110
|
+
it('should sort markers based on lowest column number if their severities and line numbers are equal', () => {
|
|
111
|
+
const markerA = createMockMarker({ start: { line: 1, character: 10 }, end: { line: 1, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Error);
|
|
112
|
+
const markerB = createMockMarker({ start: { line: 1, character: 20 }, end: { line: 1, character: 20 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Error);
|
|
113
|
+
const nodeA = createMockMarkerNode(markerA);
|
|
114
|
+
const nodeB = createMockMarkerNode(markerB);
|
|
115
|
+
(0, chai_1.expect)(problemTree['sortMarkers'](nodeA, nodeB)).equals(-10);
|
|
116
|
+
(0, chai_1.expect)(problemTree['sortMarkers'](nodeB, nodeA)).equals(10);
|
|
117
|
+
});
|
|
118
|
+
it('should sort markers based on owner if their severities, line numbers and columns are equal', () => {
|
|
119
|
+
const markerA = createMockMarker({ start: { line: 1, character: 10 }, end: { line: 1, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Error, 'A');
|
|
120
|
+
const markerB = createMockMarker({ start: { line: 1, character: 10 }, end: { line: 1, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Error, 'B');
|
|
121
|
+
const nodeA = createMockMarkerNode(markerA);
|
|
122
|
+
const nodeB = createMockMarkerNode(markerB);
|
|
123
|
+
(0, chai_1.expect)(problemTree['sortMarkers'](nodeA, nodeB)).equals(-1);
|
|
124
|
+
(0, chai_1.expect)(problemTree['sortMarkers'](nodeB, nodeA)).equals(1);
|
|
125
|
+
});
|
|
126
|
+
it('should not sort if markers are equal', () => {
|
|
127
|
+
const markerA = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Error);
|
|
128
|
+
const markerB = createMockMarker({ start: { line: 0, character: 10 }, end: { line: 0, character: 10 } }, vscode_languageserver_protocol_1.DiagnosticSeverity.Error);
|
|
129
|
+
const nodeA = createMockMarkerNode(markerA);
|
|
130
|
+
const nodeB = createMockMarkerNode(markerB);
|
|
131
|
+
(0, chai_1.expect)(problemTree['sortMarkers'](nodeA, nodeB)).equals(0);
|
|
132
|
+
(0, chai_1.expect)(problemTree['sortMarkers'](nodeB, nodeA)).equals(0);
|
|
133
|
+
});
|
|
134
|
+
});
|
|
135
|
+
});
|
|
136
|
+
/**
|
|
137
|
+
* Create a mock marker node with the given diagnostic marker.
|
|
138
|
+
* @param marker the diagnostic marker.
|
|
139
|
+
*
|
|
140
|
+
* @returns a mock marker node.
|
|
141
|
+
*/
|
|
142
|
+
function createMockMarkerNode(marker) {
|
|
143
|
+
return {
|
|
144
|
+
id: 'id',
|
|
145
|
+
name: 'marker',
|
|
146
|
+
parent: undefined,
|
|
147
|
+
selected: false,
|
|
148
|
+
uri: new uri_1.default(''),
|
|
149
|
+
marker
|
|
150
|
+
};
|
|
151
|
+
}
|
|
152
|
+
/**
|
|
153
|
+
* Create a mock diagnostic marker.
|
|
154
|
+
* @param range the diagnostic range.
|
|
155
|
+
* @param severity the diagnostic severity.
|
|
156
|
+
* @param owner the optional owner of the diagnostic
|
|
157
|
+
*
|
|
158
|
+
* @returns a mock diagnostic marker.
|
|
159
|
+
*/
|
|
160
|
+
function createMockMarker(range, severity, owner) {
|
|
161
|
+
const data = {
|
|
162
|
+
range: range,
|
|
163
|
+
severity: severity,
|
|
164
|
+
message: 'message'
|
|
165
|
+
};
|
|
166
|
+
return Object.freeze({
|
|
167
|
+
uri: 'uri',
|
|
168
|
+
kind: 'marker',
|
|
169
|
+
owner: owner !== null && owner !== void 0 ? owner : 'owner',
|
|
170
|
+
data
|
|
171
|
+
});
|
|
172
|
+
}
|
|
173
173
|
//# sourceMappingURL=problem-tree-model.spec.js.map
|
|
@@ -1,45 +1,45 @@
|
|
|
1
|
-
import { Marker } from '../../common/marker';
|
|
2
|
-
import { Diagnostic, DiagnosticSeverity } from '@theia/core/shared/vscode-languageserver-protocol';
|
|
3
|
-
export declare namespace ProblemUtils {
|
|
4
|
-
/**
|
|
5
|
-
* Comparator for severity.
|
|
6
|
-
* - The highest severity (`error`) come first followed by others.
|
|
7
|
-
* - `undefined` severities are treated as the last ones.
|
|
8
|
-
* @param a the first marker for comparison.
|
|
9
|
-
* @param b the second marker for comparison.
|
|
10
|
-
*/
|
|
11
|
-
const severityCompareMarker: (a: Marker<Diagnostic>, b: Marker<Diagnostic>) => number;
|
|
12
|
-
/**
|
|
13
|
-
* Comparator for severity.
|
|
14
|
-
* - The highest severity (`error`) come first followed by others.
|
|
15
|
-
* - `undefined` severities are treated as the last ones.
|
|
16
|
-
* @param a the first severity for comparison.
|
|
17
|
-
* @param b the second severity for comparison.
|
|
18
|
-
*/
|
|
19
|
-
const severityCompare: (a: DiagnosticSeverity | undefined, b: DiagnosticSeverity | undefined) => number;
|
|
20
|
-
/**
|
|
21
|
-
* Comparator for line numbers.
|
|
22
|
-
* - The lowest line number comes first.
|
|
23
|
-
* @param a the first marker for comparison.
|
|
24
|
-
* @param b the second marker for comparison.
|
|
25
|
-
*/
|
|
26
|
-
const lineNumberCompare: (a: Marker<Diagnostic>, b: Marker<Diagnostic>) => number;
|
|
27
|
-
/**
|
|
28
|
-
* Comparator for column numbers.
|
|
29
|
-
* - The lowest column number comes first.
|
|
30
|
-
* @param a the first marker for comparison.
|
|
31
|
-
* @param b the second marker for comparison.
|
|
32
|
-
*/
|
|
33
|
-
const columnNumberCompare: (a: Marker<Diagnostic>, b: Marker<Diagnostic>) => number;
|
|
34
|
-
/**
|
|
35
|
-
* Comparator for marker owner (source).
|
|
36
|
-
* - The order is alphabetical.
|
|
37
|
-
* @param a the first marker for comparison.
|
|
38
|
-
* @param b the second marker for comparison.
|
|
39
|
-
*/
|
|
40
|
-
const ownerCompare: (a: Marker<Diagnostic>, b: Marker<Diagnostic>) => number;
|
|
41
|
-
function getPriority(marker: Marker<Diagnostic>): number;
|
|
42
|
-
function getColor(marker: Marker<Diagnostic>): string;
|
|
43
|
-
function filterMarker(marker: Marker<Diagnostic>): boolean;
|
|
44
|
-
}
|
|
1
|
+
import { Marker } from '../../common/marker';
|
|
2
|
+
import { Diagnostic, DiagnosticSeverity } from '@theia/core/shared/vscode-languageserver-protocol';
|
|
3
|
+
export declare namespace ProblemUtils {
|
|
4
|
+
/**
|
|
5
|
+
* Comparator for severity.
|
|
6
|
+
* - The highest severity (`error`) come first followed by others.
|
|
7
|
+
* - `undefined` severities are treated as the last ones.
|
|
8
|
+
* @param a the first marker for comparison.
|
|
9
|
+
* @param b the second marker for comparison.
|
|
10
|
+
*/
|
|
11
|
+
const severityCompareMarker: (a: Marker<Diagnostic>, b: Marker<Diagnostic>) => number;
|
|
12
|
+
/**
|
|
13
|
+
* Comparator for severity.
|
|
14
|
+
* - The highest severity (`error`) come first followed by others.
|
|
15
|
+
* - `undefined` severities are treated as the last ones.
|
|
16
|
+
* @param a the first severity for comparison.
|
|
17
|
+
* @param b the second severity for comparison.
|
|
18
|
+
*/
|
|
19
|
+
const severityCompare: (a: DiagnosticSeverity | undefined, b: DiagnosticSeverity | undefined) => number;
|
|
20
|
+
/**
|
|
21
|
+
* Comparator for line numbers.
|
|
22
|
+
* - The lowest line number comes first.
|
|
23
|
+
* @param a the first marker for comparison.
|
|
24
|
+
* @param b the second marker for comparison.
|
|
25
|
+
*/
|
|
26
|
+
const lineNumberCompare: (a: Marker<Diagnostic>, b: Marker<Diagnostic>) => number;
|
|
27
|
+
/**
|
|
28
|
+
* Comparator for column numbers.
|
|
29
|
+
* - The lowest column number comes first.
|
|
30
|
+
* @param a the first marker for comparison.
|
|
31
|
+
* @param b the second marker for comparison.
|
|
32
|
+
*/
|
|
33
|
+
const columnNumberCompare: (a: Marker<Diagnostic>, b: Marker<Diagnostic>) => number;
|
|
34
|
+
/**
|
|
35
|
+
* Comparator for marker owner (source).
|
|
36
|
+
* - The order is alphabetical.
|
|
37
|
+
* @param a the first marker for comparison.
|
|
38
|
+
* @param b the second marker for comparison.
|
|
39
|
+
*/
|
|
40
|
+
const ownerCompare: (a: Marker<Diagnostic>, b: Marker<Diagnostic>) => number;
|
|
41
|
+
function getPriority(marker: Marker<Diagnostic>): number;
|
|
42
|
+
function getColor(marker: Marker<Diagnostic>): string;
|
|
43
|
+
function filterMarker(marker: Marker<Diagnostic>): boolean;
|
|
44
|
+
}
|
|
45
45
|
//# sourceMappingURL=problem-utils.d.ts.map
|
|
@@ -1,85 +1,85 @@
|
|
|
1
|
-
"use strict";
|
|
2
|
-
// *****************************************************************************
|
|
3
|
-
// Copyright (C) 2020 Ericsson 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.ProblemUtils = void 0;
|
|
19
|
-
const vscode_languageserver_protocol_1 = require("@theia/core/shared/vscode-languageserver-protocol");
|
|
20
|
-
var ProblemUtils;
|
|
21
|
-
(function (ProblemUtils) {
|
|
22
|
-
/**
|
|
23
|
-
* Comparator for severity.
|
|
24
|
-
* - The highest severity (`error`) come first followed by others.
|
|
25
|
-
* - `undefined` severities are treated as the last ones.
|
|
26
|
-
* @param a the first marker for comparison.
|
|
27
|
-
* @param b the second marker for comparison.
|
|
28
|
-
*/
|
|
29
|
-
ProblemUtils.severityCompareMarker = (a, b) => (a.data.severity || Number.MAX_SAFE_INTEGER) - (b.data.severity || Number.MAX_SAFE_INTEGER);
|
|
30
|
-
/**
|
|
31
|
-
* Comparator for severity.
|
|
32
|
-
* - The highest severity (`error`) come first followed by others.
|
|
33
|
-
* - `undefined` severities are treated as the last ones.
|
|
34
|
-
* @param a the first severity for comparison.
|
|
35
|
-
* @param b the second severity for comparison.
|
|
36
|
-
*/
|
|
37
|
-
ProblemUtils.severityCompare = (a, b) => (a || Number.MAX_SAFE_INTEGER) - (b || Number.MAX_SAFE_INTEGER);
|
|
38
|
-
/**
|
|
39
|
-
* Comparator for line numbers.
|
|
40
|
-
* - The lowest line number comes first.
|
|
41
|
-
* @param a the first marker for comparison.
|
|
42
|
-
* @param b the second marker for comparison.
|
|
43
|
-
*/
|
|
44
|
-
ProblemUtils.lineNumberCompare = (a, b) => a.data.range.start.line - b.data.range.start.line;
|
|
45
|
-
/**
|
|
46
|
-
* Comparator for column numbers.
|
|
47
|
-
* - The lowest column number comes first.
|
|
48
|
-
* @param a the first marker for comparison.
|
|
49
|
-
* @param b the second marker for comparison.
|
|
50
|
-
*/
|
|
51
|
-
ProblemUtils.columnNumberCompare = (a, b) => a.data.range.start.character - b.data.range.start.character;
|
|
52
|
-
/**
|
|
53
|
-
* Comparator for marker owner (source).
|
|
54
|
-
* - The order is alphabetical.
|
|
55
|
-
* @param a the first marker for comparison.
|
|
56
|
-
* @param b the second marker for comparison.
|
|
57
|
-
*/
|
|
58
|
-
ProblemUtils.ownerCompare = (a, b) => a.owner.localeCompare(b.owner);
|
|
59
|
-
function getPriority(marker) {
|
|
60
|
-
const { severity } = marker.data;
|
|
61
|
-
switch (severity) {
|
|
62
|
-
case vscode_languageserver_protocol_1.DiagnosticSeverity.Error: return 30;
|
|
63
|
-
case vscode_languageserver_protocol_1.DiagnosticSeverity.Warning: return 20;
|
|
64
|
-
case vscode_languageserver_protocol_1.DiagnosticSeverity.Information: return 10;
|
|
65
|
-
default: return 0;
|
|
66
|
-
}
|
|
67
|
-
}
|
|
68
|
-
ProblemUtils.getPriority = getPriority;
|
|
69
|
-
function getColor(marker) {
|
|
70
|
-
const { severity } = marker.data;
|
|
71
|
-
switch (severity) {
|
|
72
|
-
case vscode_languageserver_protocol_1.DiagnosticSeverity.Error: return 'list.errorForeground';
|
|
73
|
-
case vscode_languageserver_protocol_1.DiagnosticSeverity.Warning: return 'list.warningForeground';
|
|
74
|
-
default: return ''; // other severities should not be decorated.
|
|
75
|
-
}
|
|
76
|
-
}
|
|
77
|
-
ProblemUtils.getColor = getColor;
|
|
78
|
-
function filterMarker(marker) {
|
|
79
|
-
const { severity } = marker.data;
|
|
80
|
-
return severity === vscode_languageserver_protocol_1.DiagnosticSeverity.Error
|
|
81
|
-
|| severity === vscode_languageserver_protocol_1.DiagnosticSeverity.Warning;
|
|
82
|
-
}
|
|
83
|
-
ProblemUtils.filterMarker = filterMarker;
|
|
84
|
-
})(ProblemUtils = exports.ProblemUtils || (exports.ProblemUtils = {}));
|
|
1
|
+
"use strict";
|
|
2
|
+
// *****************************************************************************
|
|
3
|
+
// Copyright (C) 2020 Ericsson 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.ProblemUtils = void 0;
|
|
19
|
+
const vscode_languageserver_protocol_1 = require("@theia/core/shared/vscode-languageserver-protocol");
|
|
20
|
+
var ProblemUtils;
|
|
21
|
+
(function (ProblemUtils) {
|
|
22
|
+
/**
|
|
23
|
+
* Comparator for severity.
|
|
24
|
+
* - The highest severity (`error`) come first followed by others.
|
|
25
|
+
* - `undefined` severities are treated as the last ones.
|
|
26
|
+
* @param a the first marker for comparison.
|
|
27
|
+
* @param b the second marker for comparison.
|
|
28
|
+
*/
|
|
29
|
+
ProblemUtils.severityCompareMarker = (a, b) => (a.data.severity || Number.MAX_SAFE_INTEGER) - (b.data.severity || Number.MAX_SAFE_INTEGER);
|
|
30
|
+
/**
|
|
31
|
+
* Comparator for severity.
|
|
32
|
+
* - The highest severity (`error`) come first followed by others.
|
|
33
|
+
* - `undefined` severities are treated as the last ones.
|
|
34
|
+
* @param a the first severity for comparison.
|
|
35
|
+
* @param b the second severity for comparison.
|
|
36
|
+
*/
|
|
37
|
+
ProblemUtils.severityCompare = (a, b) => (a || Number.MAX_SAFE_INTEGER) - (b || Number.MAX_SAFE_INTEGER);
|
|
38
|
+
/**
|
|
39
|
+
* Comparator for line numbers.
|
|
40
|
+
* - The lowest line number comes first.
|
|
41
|
+
* @param a the first marker for comparison.
|
|
42
|
+
* @param b the second marker for comparison.
|
|
43
|
+
*/
|
|
44
|
+
ProblemUtils.lineNumberCompare = (a, b) => a.data.range.start.line - b.data.range.start.line;
|
|
45
|
+
/**
|
|
46
|
+
* Comparator for column numbers.
|
|
47
|
+
* - The lowest column number comes first.
|
|
48
|
+
* @param a the first marker for comparison.
|
|
49
|
+
* @param b the second marker for comparison.
|
|
50
|
+
*/
|
|
51
|
+
ProblemUtils.columnNumberCompare = (a, b) => a.data.range.start.character - b.data.range.start.character;
|
|
52
|
+
/**
|
|
53
|
+
* Comparator for marker owner (source).
|
|
54
|
+
* - The order is alphabetical.
|
|
55
|
+
* @param a the first marker for comparison.
|
|
56
|
+
* @param b the second marker for comparison.
|
|
57
|
+
*/
|
|
58
|
+
ProblemUtils.ownerCompare = (a, b) => a.owner.localeCompare(b.owner);
|
|
59
|
+
function getPriority(marker) {
|
|
60
|
+
const { severity } = marker.data;
|
|
61
|
+
switch (severity) {
|
|
62
|
+
case vscode_languageserver_protocol_1.DiagnosticSeverity.Error: return 30;
|
|
63
|
+
case vscode_languageserver_protocol_1.DiagnosticSeverity.Warning: return 20;
|
|
64
|
+
case vscode_languageserver_protocol_1.DiagnosticSeverity.Information: return 10;
|
|
65
|
+
default: return 0;
|
|
66
|
+
}
|
|
67
|
+
}
|
|
68
|
+
ProblemUtils.getPriority = getPriority;
|
|
69
|
+
function getColor(marker) {
|
|
70
|
+
const { severity } = marker.data;
|
|
71
|
+
switch (severity) {
|
|
72
|
+
case vscode_languageserver_protocol_1.DiagnosticSeverity.Error: return 'list.errorForeground';
|
|
73
|
+
case vscode_languageserver_protocol_1.DiagnosticSeverity.Warning: return 'list.warningForeground';
|
|
74
|
+
default: return ''; // other severities should not be decorated.
|
|
75
|
+
}
|
|
76
|
+
}
|
|
77
|
+
ProblemUtils.getColor = getColor;
|
|
78
|
+
function filterMarker(marker) {
|
|
79
|
+
const { severity } = marker.data;
|
|
80
|
+
return severity === vscode_languageserver_protocol_1.DiagnosticSeverity.Error
|
|
81
|
+
|| severity === vscode_languageserver_protocol_1.DiagnosticSeverity.Warning;
|
|
82
|
+
}
|
|
83
|
+
ProblemUtils.filterMarker = filterMarker;
|
|
84
|
+
})(ProblemUtils = exports.ProblemUtils || (exports.ProblemUtils = {}));
|
|
85
85
|
//# sourceMappingURL=problem-utils.js.map
|