@theia/task 1.45.0 → 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 +193 -193
- package/lib/browser/index.d.ts +6 -6
- package/lib/browser/index.js +33 -33
- package/lib/browser/process/process-task-contribution.d.ts +6 -6
- package/lib/browser/process/process-task-contribution.js +43 -43
- package/lib/browser/process/process-task-frontend-module.d.ts +2 -2
- package/lib/browser/process/process-task-frontend-module.js +27 -27
- package/lib/browser/process/process-task-resolver.d.ts +17 -17
- package/lib/browser/process/process-task-resolver.js +101 -101
- package/lib/browser/provided-task-configurations.d.ts +43 -43
- package/lib/browser/provided-task-configurations.js +213 -213
- package/lib/browser/provided-task-configurations.spec.d.ts +1 -1
- package/lib/browser/provided-task-configurations.spec.js +43 -43
- package/lib/browser/quick-open-task.d.ts +144 -144
- package/lib/browser/quick-open-task.d.ts.map +1 -1
- package/lib/browser/quick-open-task.js +752 -748
- package/lib/browser/quick-open-task.js.map +1 -1
- package/lib/browser/task-configuration-manager.d.ts +64 -64
- package/lib/browser/task-configuration-manager.js +261 -261
- package/lib/browser/task-configuration-model.d.ts +32 -32
- package/lib/browser/task-configuration-model.js +79 -79
- package/lib/browser/task-configurations.d.ts +127 -127
- package/lib/browser/task-configurations.js +486 -486
- package/lib/browser/task-contribution.d.ts +182 -182
- package/lib/browser/task-contribution.js +206 -206
- package/lib/browser/task-definition-registry.d.ts +38 -38
- package/lib/browser/task-definition-registry.js +134 -134
- package/lib/browser/task-definition-registry.spec.d.ts +1 -1
- package/lib/browser/task-definition-registry.spec.js +170 -170
- package/lib/browser/task-frontend-contribution.d.ts +56 -56
- package/lib/browser/task-frontend-contribution.js +358 -358
- package/lib/browser/task-frontend-module.d.ts +5 -5
- package/lib/browser/task-frontend-module.js +79 -79
- package/lib/browser/task-name-resolver.d.ts +13 -13
- package/lib/browser/task-name-resolver.js +67 -67
- package/lib/browser/task-node.d.ts +9 -9
- package/lib/browser/task-node.js +17 -17
- package/lib/browser/task-preferences.d.ts +4 -4
- package/lib/browser/task-preferences.js +40 -40
- package/lib/browser/task-problem-matcher-registry.d.ts +40 -40
- package/lib/browser/task-problem-matcher-registry.js +309 -309
- package/lib/browser/task-problem-pattern-registry.d.ts +23 -23
- package/lib/browser/task-problem-pattern-registry.js +210 -210
- package/lib/browser/task-schema-updater.d.ts +58 -58
- package/lib/browser/task-schema-updater.js +688 -688
- package/lib/browser/task-service.d.ts +279 -279
- package/lib/browser/task-service.js +1119 -1119
- package/lib/browser/task-source-resolver.d.ts +9 -9
- package/lib/browser/task-source-resolver.js +51 -51
- package/lib/browser/task-templates.d.ts +13 -13
- package/lib/browser/task-templates.js +161 -161
- package/lib/browser/task-terminal-widget-manager.d.ts +44 -44
- package/lib/browser/task-terminal-widget-manager.js +228 -228
- package/lib/browser/tasks-monaco-contribution.d.ts +1 -1
- package/lib/browser/tasks-monaco-contribution.js +27 -27
- package/lib/common/index.d.ts +4 -4
- package/lib/common/index.js +31 -31
- package/lib/common/problem-matcher-protocol.d.ts +124 -124
- package/lib/common/problem-matcher-protocol.js +132 -132
- package/lib/common/process/task-protocol.d.ts +68 -68
- package/lib/common/process/task-protocol.js +33 -33
- package/lib/common/task-common-module.d.ts +7 -7
- package/lib/common/task-common-module.js +33 -33
- package/lib/common/task-protocol.d.ts +192 -192
- package/lib/common/task-protocol.js +137 -137
- package/lib/common/task-util.d.ts +22 -22
- package/lib/common/task-util.js +46 -46
- package/lib/common/task-watcher.d.ts +17 -17
- package/lib/common/task-watcher.js +86 -86
- package/lib/node/custom/custom-task-runner-backend-module.d.ts +2 -2
- package/lib/node/custom/custom-task-runner-backend-module.js +36 -36
- package/lib/node/custom/custom-task-runner-contribution.d.ts +6 -6
- package/lib/node/custom/custom-task-runner-contribution.js +42 -42
- package/lib/node/custom/custom-task-runner.d.ts +15 -15
- package/lib/node/custom/custom-task-runner.js +69 -69
- package/lib/node/custom/custom-task.d.ts +20 -20
- package/lib/node/custom/custom-task.js +78 -78
- package/lib/node/index.d.ts +3 -3
- package/lib/node/index.js +30 -30
- package/lib/node/process/process-task-runner-backend-module.d.ts +2 -2
- package/lib/node/process/process-task-runner-backend-module.js +36 -36
- package/lib/node/process/process-task-runner-contribution.d.ts +6 -6
- package/lib/node/process/process-task-runner-contribution.js +43 -43
- package/lib/node/process/process-task-runner.d.ts +60 -60
- package/lib/node/process/process-task-runner.js +355 -355
- package/lib/node/process/process-task.d.ts +26 -26
- package/lib/node/process/process-task.js +135 -135
- package/lib/node/process/process-task.spec.d.ts +1 -1
- package/lib/node/process/process-task.spec.js +29 -29
- package/lib/node/task-abstract-line-matcher.d.ts +49 -49
- package/lib/node/task-abstract-line-matcher.js +273 -273
- package/lib/node/task-backend-application-contribution.d.ts +8 -8
- package/lib/node/task-backend-application-contribution.js +48 -48
- package/lib/node/task-backend-module.d.ts +3 -3
- package/lib/node/task-backend-module.js +50 -50
- package/lib/node/task-line-matchers.d.ts +27 -27
- package/lib/node/task-line-matchers.js +121 -121
- package/lib/node/task-manager.d.ts +55 -55
- package/lib/node/task-manager.js +135 -135
- package/lib/node/task-problem-collector.d.ts +10 -10
- package/lib/node/task-problem-collector.js +57 -57
- package/lib/node/task-problem-collector.spec.d.ts +1 -1
- package/lib/node/task-problem-collector.spec.js +310 -310
- package/lib/node/task-runner-protocol.d.ts +16 -16
- package/lib/node/task-runner-protocol.js +19 -19
- package/lib/node/task-runner.d.ts +50 -50
- package/lib/node/task-runner.js +97 -97
- package/lib/node/task-server.d.ts +39 -39
- package/lib/node/task-server.js +237 -237
- package/lib/node/task-server.slow-spec.d.ts +1 -1
- package/lib/node/task-server.slow-spec.js +395 -395
- package/lib/node/task.d.ts +50 -50
- package/lib/node/task.js +77 -77
- package/lib/node/test/task-test-container.d.ts +2 -2
- package/lib/node/test/task-test-container.js +58 -58
- package/package.json +14 -14
- package/src/browser/index.ts +22 -22
- package/src/browser/process/process-task-contribution.ts +31 -31
- package/src/browser/process/process-task-frontend-module.ts +27 -27
- package/src/browser/process/process-task-resolver.ts +89 -89
- package/src/browser/provided-task-configurations.spec.ts +46 -46
- package/src/browser/provided-task-configurations.ts +213 -213
- package/src/browser/quick-open-task.ts +831 -827
- package/src/browser/style/index.css +19 -19
- package/src/browser/task-configuration-manager.ts +256 -256
- package/src/browser/task-configuration-model.ts +101 -101
- package/src/browser/task-configurations.ts +508 -508
- package/src/browser/task-contribution.ts +266 -266
- package/src/browser/task-definition-registry.spec.ts +203 -203
- package/src/browser/task-definition-registry.ts +131 -131
- package/src/browser/task-frontend-contribution.ts +402 -402
- package/src/browser/task-frontend-module.ts +86 -86
- package/src/browser/task-name-resolver.ts +55 -55
- package/src/browser/task-node.ts +37 -37
- package/src/browser/task-preferences.ts +40 -40
- package/src/browser/task-problem-matcher-registry.ts +308 -308
- package/src/browser/task-problem-pattern-registry.ts +196 -196
- package/src/browser/task-schema-updater.ts +701 -701
- package/src/browser/task-service.ts +1164 -1164
- package/src/browser/task-source-resolver.ts +36 -36
- package/src/browser/task-templates.ts +168 -168
- package/src/browser/task-terminal-widget-manager.ts +224 -224
- package/src/browser/tasks-monaco-contribution.ts +27 -27
- package/src/common/index.ts +20 -20
- package/src/common/problem-matcher-protocol.ts +234 -234
- package/src/common/process/task-protocol.ts +97 -97
- package/src/common/task-common-module.ts +34 -34
- package/src/common/task-protocol.ts +317 -317
- package/src/common/task-util.ts +43 -43
- package/src/common/task-watcher.ts +78 -78
- package/src/node/custom/custom-task-runner-backend-module.ts +37 -37
- package/src/node/custom/custom-task-runner-contribution.ts +30 -30
- package/src/node/custom/custom-task-runner.ts +60 -60
- package/src/node/custom/custom-task.ts +73 -73
- package/src/node/index.ts +19 -19
- package/src/node/process/process-task-runner-backend-module.ts +37 -37
- package/src/node/process/process-task-runner-contribution.ts +31 -31
- package/src/node/process/process-task-runner.ts +371 -371
- package/src/node/process/process-task.spec.ts +30 -30
- package/src/node/process/process-task.ts +144 -144
- package/src/node/task-abstract-line-matcher.ts +312 -312
- package/src/node/task-backend-application-contribution.ts +36 -36
- package/src/node/task-backend-module.ts +57 -57
- package/src/node/task-line-matchers.ts +127 -127
- package/src/node/task-manager.ts +129 -129
- package/src/node/task-problem-collector.spec.ts +338 -338
- package/src/node/task-problem-collector.ts +62 -62
- package/src/node/task-runner-protocol.ts +33 -33
- package/src/node/task-runner.ts +96 -96
- package/src/node/task-server.slow-spec.ts +444 -444
- package/src/node/task-server.ts +263 -263
- package/src/node/task.ts +103 -103
- package/src/node/test/task-test-container.ts +63 -63
|
@@ -1,274 +1,274 @@
|
|
|
1
|
-
"use strict";
|
|
2
|
-
// *****************************************************************************
|
|
3
|
-
// Copyright (C) 2019 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.AbstractLineMatcher = void 0;
|
|
19
|
-
/*---------------------------------------------------------------------------------------------
|
|
20
|
-
* Copyright (c) Microsoft Corporation. All rights reserved.
|
|
21
|
-
* Licensed under the MIT License. See License.txt in the project root for license information.
|
|
22
|
-
*--------------------------------------------------------------------------------------------*/
|
|
23
|
-
const os_1 = require("@theia/core/lib/common/os");
|
|
24
|
-
const vscode_languageserver_protocol_1 = require("@theia/core/shared/vscode-languageserver-protocol");
|
|
25
|
-
const problem_matcher_protocol_1 = require("../common/problem-matcher-protocol");
|
|
26
|
-
const uri_1 = require("@theia/core/lib/common/uri");
|
|
27
|
-
const severity_1 = require("@theia/core/lib/common/severity");
|
|
28
|
-
const numbers_1 = require("@theia/core/lib/common/numbers");
|
|
29
|
-
const path_1 = require("path");
|
|
30
|
-
const endOfLine = os_1.EOL;
|
|
31
|
-
class AbstractLineMatcher {
|
|
32
|
-
constructor(matcher) {
|
|
33
|
-
this.matcher = matcher;
|
|
34
|
-
this.patterns = [];
|
|
35
|
-
this.activePatternIndex = 0;
|
|
36
|
-
if (Array.isArray(matcher.pattern)) {
|
|
37
|
-
this.patterns = matcher.pattern;
|
|
38
|
-
}
|
|
39
|
-
else {
|
|
40
|
-
this.patterns = [matcher.pattern];
|
|
41
|
-
}
|
|
42
|
-
this.cachedProblemData = this.getEmptyProblemData();
|
|
43
|
-
if (this.patterns.slice(0, this.patternCount - 1).some(p => !!p.loop)) {
|
|
44
|
-
console.error('Problem Matcher: Only the last pattern can loop');
|
|
45
|
-
}
|
|
46
|
-
}
|
|
47
|
-
/**
|
|
48
|
-
* Number of problem patterns that the line matcher uses.
|
|
49
|
-
*/
|
|
50
|
-
get patternCount() {
|
|
51
|
-
return this.patterns.length;
|
|
52
|
-
}
|
|
53
|
-
getEmptyProblemData() {
|
|
54
|
-
// eslint-disable-next-line no-null/no-null
|
|
55
|
-
return Object.create(null);
|
|
56
|
-
}
|
|
57
|
-
fillProblemData(data, pattern, matches) {
|
|
58
|
-
if (data) {
|
|
59
|
-
this.fillProperty(data, 'file', pattern, matches, true);
|
|
60
|
-
this.appendProperty(data, 'message', pattern, matches, true);
|
|
61
|
-
this.fillProperty(data, 'code', pattern, matches, true);
|
|
62
|
-
this.fillProperty(data, 'severity', pattern, matches, true);
|
|
63
|
-
this.fillProperty(data, 'location', pattern, matches, true);
|
|
64
|
-
this.fillProperty(data, 'line', pattern, matches);
|
|
65
|
-
this.fillProperty(data, 'character', pattern, matches);
|
|
66
|
-
this.fillProperty(data, 'endLine', pattern, matches);
|
|
67
|
-
this.fillProperty(data, 'endCharacter', pattern, matches);
|
|
68
|
-
return true;
|
|
69
|
-
}
|
|
70
|
-
return false;
|
|
71
|
-
}
|
|
72
|
-
appendProperty(data, property, pattern, matches, trim = false) {
|
|
73
|
-
const patternProperty = pattern[property];
|
|
74
|
-
if (data[property] === undefined) {
|
|
75
|
-
this.fillProperty(data, property, pattern, matches, trim);
|
|
76
|
-
}
|
|
77
|
-
else if (patternProperty !== undefined && patternProperty < matches.length) {
|
|
78
|
-
let value = matches[patternProperty];
|
|
79
|
-
if (trim) {
|
|
80
|
-
value = value.trim();
|
|
81
|
-
}
|
|
82
|
-
data[property] += endOfLine + value;
|
|
83
|
-
}
|
|
84
|
-
}
|
|
85
|
-
fillProperty(data, property, pattern, matches, trim = false) {
|
|
86
|
-
const patternAtProperty = pattern[property];
|
|
87
|
-
if (data[property] === undefined && patternAtProperty !== undefined && patternAtProperty < matches.length) {
|
|
88
|
-
let value = matches[patternAtProperty];
|
|
89
|
-
if (value !== undefined) {
|
|
90
|
-
if (trim) {
|
|
91
|
-
value = value.trim();
|
|
92
|
-
}
|
|
93
|
-
data[property] = value;
|
|
94
|
-
}
|
|
95
|
-
}
|
|
96
|
-
}
|
|
97
|
-
getMarkerMatch(data) {
|
|
98
|
-
try {
|
|
99
|
-
const location = this.getLocation(data);
|
|
100
|
-
if (data.file && location && data.message) {
|
|
101
|
-
const marker = {
|
|
102
|
-
severity: this.getSeverity(data),
|
|
103
|
-
range: location,
|
|
104
|
-
message: data.message
|
|
105
|
-
};
|
|
106
|
-
if (data.code !== undefined) {
|
|
107
|
-
marker.code = data.code;
|
|
108
|
-
}
|
|
109
|
-
if (this.matcher.source !== undefined) {
|
|
110
|
-
marker.source = this.matcher.source;
|
|
111
|
-
}
|
|
112
|
-
return {
|
|
113
|
-
description: this.matcher,
|
|
114
|
-
resource: this.getResource(data.file, this.matcher),
|
|
115
|
-
marker
|
|
116
|
-
};
|
|
117
|
-
}
|
|
118
|
-
return {
|
|
119
|
-
description: this.matcher
|
|
120
|
-
};
|
|
121
|
-
}
|
|
122
|
-
catch (err) {
|
|
123
|
-
console.error(`Failed to convert problem data into match: ${JSON.stringify(data)}`);
|
|
124
|
-
}
|
|
125
|
-
return undefined;
|
|
126
|
-
}
|
|
127
|
-
getLocation(data) {
|
|
128
|
-
if (data.kind === problem_matcher_protocol_1.ProblemLocationKind.File) {
|
|
129
|
-
return this.createRange(0, 0, 0, 0);
|
|
130
|
-
}
|
|
131
|
-
if (data.location) {
|
|
132
|
-
return this.parseLocationInfo(data.location);
|
|
133
|
-
}
|
|
134
|
-
if (!data.line) {
|
|
135
|
-
// eslint-disable-next-line no-null/no-null
|
|
136
|
-
return null;
|
|
137
|
-
}
|
|
138
|
-
const startLine = parseInt(data.line);
|
|
139
|
-
const startColumn = data.character ? parseInt(data.character) : undefined;
|
|
140
|
-
const endLine = data.endLine ? parseInt(data.endLine) : undefined;
|
|
141
|
-
const endColumn = data.endCharacter ? parseInt(data.endCharacter) : undefined;
|
|
142
|
-
return this.createRange(startLine, startColumn, endLine, endColumn);
|
|
143
|
-
}
|
|
144
|
-
parseLocationInfo(value) {
|
|
145
|
-
if (!value || !value.match(/(\d+|\d+,\d+|\d+,\d+,\d+,\d+)/)) {
|
|
146
|
-
// eslint-disable-next-line no-null/no-null
|
|
147
|
-
return null;
|
|
148
|
-
}
|
|
149
|
-
const parts = value.split(',');
|
|
150
|
-
const startLine = parseInt(parts[0]);
|
|
151
|
-
const startColumn = parts.length > 1 ? parseInt(parts[1]) : undefined;
|
|
152
|
-
if (parts.length > 3) {
|
|
153
|
-
return this.createRange(startLine, startColumn, parseInt(parts[2]), parseInt(parts[3]));
|
|
154
|
-
}
|
|
155
|
-
else {
|
|
156
|
-
return this.createRange(startLine, startColumn, undefined, undefined);
|
|
157
|
-
}
|
|
158
|
-
}
|
|
159
|
-
createRange(startLine, startColumn, endLine, endColumn) {
|
|
160
|
-
let range;
|
|
161
|
-
if (startColumn !== undefined) {
|
|
162
|
-
if (endColumn !== undefined) {
|
|
163
|
-
range = vscode_languageserver_protocol_1.Range.create(startLine, startColumn, endLine || startLine, endColumn);
|
|
164
|
-
}
|
|
165
|
-
else {
|
|
166
|
-
range = vscode_languageserver_protocol_1.Range.create(startLine, startColumn, startLine, startColumn);
|
|
167
|
-
}
|
|
168
|
-
}
|
|
169
|
-
else {
|
|
170
|
-
range = vscode_languageserver_protocol_1.Range.create(startLine, 1, startLine, numbers_1.MAX_SAFE_INTEGER);
|
|
171
|
-
}
|
|
172
|
-
// range indexes should be zero-based
|
|
173
|
-
return vscode_languageserver_protocol_1.Range.create(this.getZeroBasedRangeIndex(range.start.line), this.getZeroBasedRangeIndex(range.start.character), this.getZeroBasedRangeIndex(range.end.line), this.getZeroBasedRangeIndex(range.end.character));
|
|
174
|
-
}
|
|
175
|
-
getZeroBasedRangeIndex(ind) {
|
|
176
|
-
return ind === 0 ? ind : ind - 1;
|
|
177
|
-
}
|
|
178
|
-
getSeverity(data) {
|
|
179
|
-
// eslint-disable-next-line no-null/no-null
|
|
180
|
-
let result = null;
|
|
181
|
-
if (data.severity) {
|
|
182
|
-
const value = data.severity;
|
|
183
|
-
if (value) {
|
|
184
|
-
result = severity_1.Severity.fromValue(value);
|
|
185
|
-
if (result === severity_1.Severity.Ignore) {
|
|
186
|
-
if (value === 'E') {
|
|
187
|
-
result = severity_1.Severity.Error;
|
|
188
|
-
}
|
|
189
|
-
else if (value === 'W') {
|
|
190
|
-
result = severity_1.Severity.Warning;
|
|
191
|
-
}
|
|
192
|
-
else if (value === 'I') {
|
|
193
|
-
result = severity_1.Severity.Info;
|
|
194
|
-
}
|
|
195
|
-
else if (value.toLowerCase() === 'hint') {
|
|
196
|
-
result = severity_1.Severity.Info;
|
|
197
|
-
}
|
|
198
|
-
else if (value.toLowerCase() === 'note') {
|
|
199
|
-
result = severity_1.Severity.Info;
|
|
200
|
-
}
|
|
201
|
-
}
|
|
202
|
-
}
|
|
203
|
-
}
|
|
204
|
-
// eslint-disable-next-line no-null/no-null
|
|
205
|
-
if (result === null || result === severity_1.Severity.Ignore) {
|
|
206
|
-
result = this.matcher.severity || severity_1.Severity.Error;
|
|
207
|
-
}
|
|
208
|
-
return severity_1.Severity.toDiagnosticSeverity(result);
|
|
209
|
-
}
|
|
210
|
-
getResource(filename, matcher) {
|
|
211
|
-
const kind = matcher.fileLocation;
|
|
212
|
-
let fullPath;
|
|
213
|
-
if (kind === problem_matcher_protocol_1.FileLocationKind.Absolute) {
|
|
214
|
-
fullPath = filename;
|
|
215
|
-
}
|
|
216
|
-
else if ((kind === problem_matcher_protocol_1.FileLocationKind.Relative) && matcher.filePrefix) {
|
|
217
|
-
let relativeFileName = filename.replace(/\\/g, '/');
|
|
218
|
-
if (relativeFileName.startsWith('./')) {
|
|
219
|
-
relativeFileName = relativeFileName.slice(2);
|
|
220
|
-
}
|
|
221
|
-
fullPath = (0, path_1.join)(matcher.filePrefix, relativeFileName);
|
|
222
|
-
}
|
|
223
|
-
if (fullPath === undefined) {
|
|
224
|
-
throw new Error('FileLocationKind is not actionable. Does the matcher have a filePrefix? This should never happen.');
|
|
225
|
-
}
|
|
226
|
-
if (matcher.uriProvider !== undefined) {
|
|
227
|
-
return matcher.uriProvider(fullPath);
|
|
228
|
-
}
|
|
229
|
-
else {
|
|
230
|
-
return uri_1.default.fromFilePath(fullPath);
|
|
231
|
-
}
|
|
232
|
-
}
|
|
233
|
-
resetActivePatternIndex(defaultIndex) {
|
|
234
|
-
if (defaultIndex === undefined) {
|
|
235
|
-
defaultIndex = 0;
|
|
236
|
-
}
|
|
237
|
-
this.activePatternIndex = defaultIndex;
|
|
238
|
-
this.activePattern = this.patterns[defaultIndex];
|
|
239
|
-
}
|
|
240
|
-
nextProblemPattern() {
|
|
241
|
-
this.activePatternIndex++;
|
|
242
|
-
if (this.activePatternIndex > this.patternCount - 1) {
|
|
243
|
-
this.resetActivePatternIndex();
|
|
244
|
-
}
|
|
245
|
-
else {
|
|
246
|
-
this.activePattern = this.patterns[this.activePatternIndex];
|
|
247
|
-
}
|
|
248
|
-
}
|
|
249
|
-
doOneLineMatch(line) {
|
|
250
|
-
var _a;
|
|
251
|
-
var _b;
|
|
252
|
-
if (this.activePattern) {
|
|
253
|
-
const regexp = new RegExp(this.activePattern.regexp);
|
|
254
|
-
const regexMatches = regexp.exec(line);
|
|
255
|
-
if (regexMatches) {
|
|
256
|
-
(_a = (_b = this.cachedProblemData).kind) !== null && _a !== void 0 ? _a : (_b.kind = this.activePattern.kind);
|
|
257
|
-
return this.fillProblemData(this.cachedProblemData, this.activePattern, regexMatches);
|
|
258
|
-
}
|
|
259
|
-
}
|
|
260
|
-
return false;
|
|
261
|
-
}
|
|
262
|
-
// check if active pattern is the last pattern
|
|
263
|
-
isUsingTheLastPattern() {
|
|
264
|
-
return this.patternCount > 0 && this.activePatternIndex === this.patternCount - 1;
|
|
265
|
-
}
|
|
266
|
-
isLastPatternLoop() {
|
|
267
|
-
return this.patternCount > 0 && !!this.patterns[this.patternCount - 1].loop;
|
|
268
|
-
}
|
|
269
|
-
resetCachedProblemData() {
|
|
270
|
-
this.cachedProblemData = this.getEmptyProblemData();
|
|
271
|
-
}
|
|
272
|
-
}
|
|
273
|
-
exports.AbstractLineMatcher = AbstractLineMatcher;
|
|
1
|
+
"use strict";
|
|
2
|
+
// *****************************************************************************
|
|
3
|
+
// Copyright (C) 2019 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.AbstractLineMatcher = void 0;
|
|
19
|
+
/*---------------------------------------------------------------------------------------------
|
|
20
|
+
* Copyright (c) Microsoft Corporation. All rights reserved.
|
|
21
|
+
* Licensed under the MIT License. See License.txt in the project root for license information.
|
|
22
|
+
*--------------------------------------------------------------------------------------------*/
|
|
23
|
+
const os_1 = require("@theia/core/lib/common/os");
|
|
24
|
+
const vscode_languageserver_protocol_1 = require("@theia/core/shared/vscode-languageserver-protocol");
|
|
25
|
+
const problem_matcher_protocol_1 = require("../common/problem-matcher-protocol");
|
|
26
|
+
const uri_1 = require("@theia/core/lib/common/uri");
|
|
27
|
+
const severity_1 = require("@theia/core/lib/common/severity");
|
|
28
|
+
const numbers_1 = require("@theia/core/lib/common/numbers");
|
|
29
|
+
const path_1 = require("path");
|
|
30
|
+
const endOfLine = os_1.EOL;
|
|
31
|
+
class AbstractLineMatcher {
|
|
32
|
+
constructor(matcher) {
|
|
33
|
+
this.matcher = matcher;
|
|
34
|
+
this.patterns = [];
|
|
35
|
+
this.activePatternIndex = 0;
|
|
36
|
+
if (Array.isArray(matcher.pattern)) {
|
|
37
|
+
this.patterns = matcher.pattern;
|
|
38
|
+
}
|
|
39
|
+
else {
|
|
40
|
+
this.patterns = [matcher.pattern];
|
|
41
|
+
}
|
|
42
|
+
this.cachedProblemData = this.getEmptyProblemData();
|
|
43
|
+
if (this.patterns.slice(0, this.patternCount - 1).some(p => !!p.loop)) {
|
|
44
|
+
console.error('Problem Matcher: Only the last pattern can loop');
|
|
45
|
+
}
|
|
46
|
+
}
|
|
47
|
+
/**
|
|
48
|
+
* Number of problem patterns that the line matcher uses.
|
|
49
|
+
*/
|
|
50
|
+
get patternCount() {
|
|
51
|
+
return this.patterns.length;
|
|
52
|
+
}
|
|
53
|
+
getEmptyProblemData() {
|
|
54
|
+
// eslint-disable-next-line no-null/no-null
|
|
55
|
+
return Object.create(null);
|
|
56
|
+
}
|
|
57
|
+
fillProblemData(data, pattern, matches) {
|
|
58
|
+
if (data) {
|
|
59
|
+
this.fillProperty(data, 'file', pattern, matches, true);
|
|
60
|
+
this.appendProperty(data, 'message', pattern, matches, true);
|
|
61
|
+
this.fillProperty(data, 'code', pattern, matches, true);
|
|
62
|
+
this.fillProperty(data, 'severity', pattern, matches, true);
|
|
63
|
+
this.fillProperty(data, 'location', pattern, matches, true);
|
|
64
|
+
this.fillProperty(data, 'line', pattern, matches);
|
|
65
|
+
this.fillProperty(data, 'character', pattern, matches);
|
|
66
|
+
this.fillProperty(data, 'endLine', pattern, matches);
|
|
67
|
+
this.fillProperty(data, 'endCharacter', pattern, matches);
|
|
68
|
+
return true;
|
|
69
|
+
}
|
|
70
|
+
return false;
|
|
71
|
+
}
|
|
72
|
+
appendProperty(data, property, pattern, matches, trim = false) {
|
|
73
|
+
const patternProperty = pattern[property];
|
|
74
|
+
if (data[property] === undefined) {
|
|
75
|
+
this.fillProperty(data, property, pattern, matches, trim);
|
|
76
|
+
}
|
|
77
|
+
else if (patternProperty !== undefined && patternProperty < matches.length) {
|
|
78
|
+
let value = matches[patternProperty];
|
|
79
|
+
if (trim) {
|
|
80
|
+
value = value.trim();
|
|
81
|
+
}
|
|
82
|
+
data[property] += endOfLine + value;
|
|
83
|
+
}
|
|
84
|
+
}
|
|
85
|
+
fillProperty(data, property, pattern, matches, trim = false) {
|
|
86
|
+
const patternAtProperty = pattern[property];
|
|
87
|
+
if (data[property] === undefined && patternAtProperty !== undefined && patternAtProperty < matches.length) {
|
|
88
|
+
let value = matches[patternAtProperty];
|
|
89
|
+
if (value !== undefined) {
|
|
90
|
+
if (trim) {
|
|
91
|
+
value = value.trim();
|
|
92
|
+
}
|
|
93
|
+
data[property] = value;
|
|
94
|
+
}
|
|
95
|
+
}
|
|
96
|
+
}
|
|
97
|
+
getMarkerMatch(data) {
|
|
98
|
+
try {
|
|
99
|
+
const location = this.getLocation(data);
|
|
100
|
+
if (data.file && location && data.message) {
|
|
101
|
+
const marker = {
|
|
102
|
+
severity: this.getSeverity(data),
|
|
103
|
+
range: location,
|
|
104
|
+
message: data.message
|
|
105
|
+
};
|
|
106
|
+
if (data.code !== undefined) {
|
|
107
|
+
marker.code = data.code;
|
|
108
|
+
}
|
|
109
|
+
if (this.matcher.source !== undefined) {
|
|
110
|
+
marker.source = this.matcher.source;
|
|
111
|
+
}
|
|
112
|
+
return {
|
|
113
|
+
description: this.matcher,
|
|
114
|
+
resource: this.getResource(data.file, this.matcher),
|
|
115
|
+
marker
|
|
116
|
+
};
|
|
117
|
+
}
|
|
118
|
+
return {
|
|
119
|
+
description: this.matcher
|
|
120
|
+
};
|
|
121
|
+
}
|
|
122
|
+
catch (err) {
|
|
123
|
+
console.error(`Failed to convert problem data into match: ${JSON.stringify(data)}`);
|
|
124
|
+
}
|
|
125
|
+
return undefined;
|
|
126
|
+
}
|
|
127
|
+
getLocation(data) {
|
|
128
|
+
if (data.kind === problem_matcher_protocol_1.ProblemLocationKind.File) {
|
|
129
|
+
return this.createRange(0, 0, 0, 0);
|
|
130
|
+
}
|
|
131
|
+
if (data.location) {
|
|
132
|
+
return this.parseLocationInfo(data.location);
|
|
133
|
+
}
|
|
134
|
+
if (!data.line) {
|
|
135
|
+
// eslint-disable-next-line no-null/no-null
|
|
136
|
+
return null;
|
|
137
|
+
}
|
|
138
|
+
const startLine = parseInt(data.line);
|
|
139
|
+
const startColumn = data.character ? parseInt(data.character) : undefined;
|
|
140
|
+
const endLine = data.endLine ? parseInt(data.endLine) : undefined;
|
|
141
|
+
const endColumn = data.endCharacter ? parseInt(data.endCharacter) : undefined;
|
|
142
|
+
return this.createRange(startLine, startColumn, endLine, endColumn);
|
|
143
|
+
}
|
|
144
|
+
parseLocationInfo(value) {
|
|
145
|
+
if (!value || !value.match(/(\d+|\d+,\d+|\d+,\d+,\d+,\d+)/)) {
|
|
146
|
+
// eslint-disable-next-line no-null/no-null
|
|
147
|
+
return null;
|
|
148
|
+
}
|
|
149
|
+
const parts = value.split(',');
|
|
150
|
+
const startLine = parseInt(parts[0]);
|
|
151
|
+
const startColumn = parts.length > 1 ? parseInt(parts[1]) : undefined;
|
|
152
|
+
if (parts.length > 3) {
|
|
153
|
+
return this.createRange(startLine, startColumn, parseInt(parts[2]), parseInt(parts[3]));
|
|
154
|
+
}
|
|
155
|
+
else {
|
|
156
|
+
return this.createRange(startLine, startColumn, undefined, undefined);
|
|
157
|
+
}
|
|
158
|
+
}
|
|
159
|
+
createRange(startLine, startColumn, endLine, endColumn) {
|
|
160
|
+
let range;
|
|
161
|
+
if (startColumn !== undefined) {
|
|
162
|
+
if (endColumn !== undefined) {
|
|
163
|
+
range = vscode_languageserver_protocol_1.Range.create(startLine, startColumn, endLine || startLine, endColumn);
|
|
164
|
+
}
|
|
165
|
+
else {
|
|
166
|
+
range = vscode_languageserver_protocol_1.Range.create(startLine, startColumn, startLine, startColumn);
|
|
167
|
+
}
|
|
168
|
+
}
|
|
169
|
+
else {
|
|
170
|
+
range = vscode_languageserver_protocol_1.Range.create(startLine, 1, startLine, numbers_1.MAX_SAFE_INTEGER);
|
|
171
|
+
}
|
|
172
|
+
// range indexes should be zero-based
|
|
173
|
+
return vscode_languageserver_protocol_1.Range.create(this.getZeroBasedRangeIndex(range.start.line), this.getZeroBasedRangeIndex(range.start.character), this.getZeroBasedRangeIndex(range.end.line), this.getZeroBasedRangeIndex(range.end.character));
|
|
174
|
+
}
|
|
175
|
+
getZeroBasedRangeIndex(ind) {
|
|
176
|
+
return ind === 0 ? ind : ind - 1;
|
|
177
|
+
}
|
|
178
|
+
getSeverity(data) {
|
|
179
|
+
// eslint-disable-next-line no-null/no-null
|
|
180
|
+
let result = null;
|
|
181
|
+
if (data.severity) {
|
|
182
|
+
const value = data.severity;
|
|
183
|
+
if (value) {
|
|
184
|
+
result = severity_1.Severity.fromValue(value);
|
|
185
|
+
if (result === severity_1.Severity.Ignore) {
|
|
186
|
+
if (value === 'E') {
|
|
187
|
+
result = severity_1.Severity.Error;
|
|
188
|
+
}
|
|
189
|
+
else if (value === 'W') {
|
|
190
|
+
result = severity_1.Severity.Warning;
|
|
191
|
+
}
|
|
192
|
+
else if (value === 'I') {
|
|
193
|
+
result = severity_1.Severity.Info;
|
|
194
|
+
}
|
|
195
|
+
else if (value.toLowerCase() === 'hint') {
|
|
196
|
+
result = severity_1.Severity.Info;
|
|
197
|
+
}
|
|
198
|
+
else if (value.toLowerCase() === 'note') {
|
|
199
|
+
result = severity_1.Severity.Info;
|
|
200
|
+
}
|
|
201
|
+
}
|
|
202
|
+
}
|
|
203
|
+
}
|
|
204
|
+
// eslint-disable-next-line no-null/no-null
|
|
205
|
+
if (result === null || result === severity_1.Severity.Ignore) {
|
|
206
|
+
result = this.matcher.severity || severity_1.Severity.Error;
|
|
207
|
+
}
|
|
208
|
+
return severity_1.Severity.toDiagnosticSeverity(result);
|
|
209
|
+
}
|
|
210
|
+
getResource(filename, matcher) {
|
|
211
|
+
const kind = matcher.fileLocation;
|
|
212
|
+
let fullPath;
|
|
213
|
+
if (kind === problem_matcher_protocol_1.FileLocationKind.Absolute) {
|
|
214
|
+
fullPath = filename;
|
|
215
|
+
}
|
|
216
|
+
else if ((kind === problem_matcher_protocol_1.FileLocationKind.Relative) && matcher.filePrefix) {
|
|
217
|
+
let relativeFileName = filename.replace(/\\/g, '/');
|
|
218
|
+
if (relativeFileName.startsWith('./')) {
|
|
219
|
+
relativeFileName = relativeFileName.slice(2);
|
|
220
|
+
}
|
|
221
|
+
fullPath = (0, path_1.join)(matcher.filePrefix, relativeFileName);
|
|
222
|
+
}
|
|
223
|
+
if (fullPath === undefined) {
|
|
224
|
+
throw new Error('FileLocationKind is not actionable. Does the matcher have a filePrefix? This should never happen.');
|
|
225
|
+
}
|
|
226
|
+
if (matcher.uriProvider !== undefined) {
|
|
227
|
+
return matcher.uriProvider(fullPath);
|
|
228
|
+
}
|
|
229
|
+
else {
|
|
230
|
+
return uri_1.default.fromFilePath(fullPath);
|
|
231
|
+
}
|
|
232
|
+
}
|
|
233
|
+
resetActivePatternIndex(defaultIndex) {
|
|
234
|
+
if (defaultIndex === undefined) {
|
|
235
|
+
defaultIndex = 0;
|
|
236
|
+
}
|
|
237
|
+
this.activePatternIndex = defaultIndex;
|
|
238
|
+
this.activePattern = this.patterns[defaultIndex];
|
|
239
|
+
}
|
|
240
|
+
nextProblemPattern() {
|
|
241
|
+
this.activePatternIndex++;
|
|
242
|
+
if (this.activePatternIndex > this.patternCount - 1) {
|
|
243
|
+
this.resetActivePatternIndex();
|
|
244
|
+
}
|
|
245
|
+
else {
|
|
246
|
+
this.activePattern = this.patterns[this.activePatternIndex];
|
|
247
|
+
}
|
|
248
|
+
}
|
|
249
|
+
doOneLineMatch(line) {
|
|
250
|
+
var _a;
|
|
251
|
+
var _b;
|
|
252
|
+
if (this.activePattern) {
|
|
253
|
+
const regexp = new RegExp(this.activePattern.regexp);
|
|
254
|
+
const regexMatches = regexp.exec(line);
|
|
255
|
+
if (regexMatches) {
|
|
256
|
+
(_a = (_b = this.cachedProblemData).kind) !== null && _a !== void 0 ? _a : (_b.kind = this.activePattern.kind);
|
|
257
|
+
return this.fillProblemData(this.cachedProblemData, this.activePattern, regexMatches);
|
|
258
|
+
}
|
|
259
|
+
}
|
|
260
|
+
return false;
|
|
261
|
+
}
|
|
262
|
+
// check if active pattern is the last pattern
|
|
263
|
+
isUsingTheLastPattern() {
|
|
264
|
+
return this.patternCount > 0 && this.activePatternIndex === this.patternCount - 1;
|
|
265
|
+
}
|
|
266
|
+
isLastPatternLoop() {
|
|
267
|
+
return this.patternCount > 0 && !!this.patterns[this.patternCount - 1].loop;
|
|
268
|
+
}
|
|
269
|
+
resetCachedProblemData() {
|
|
270
|
+
this.cachedProblemData = this.getEmptyProblemData();
|
|
271
|
+
}
|
|
272
|
+
}
|
|
273
|
+
exports.AbstractLineMatcher = AbstractLineMatcher;
|
|
274
274
|
//# sourceMappingURL=task-abstract-line-matcher.js.map
|
|
@@ -1,9 +1,9 @@
|
|
|
1
|
-
import { ContributionProvider } from '@theia/core';
|
|
2
|
-
import { BackendApplicationContribution } from '@theia/core/lib/node';
|
|
3
|
-
import { TaskRunnerContribution, TaskRunnerRegistry } from './task-runner';
|
|
4
|
-
export declare class TaskBackendApplicationContribution implements BackendApplicationContribution {
|
|
5
|
-
protected readonly contributionProvider: ContributionProvider<TaskRunnerContribution>;
|
|
6
|
-
protected readonly taskRunnerRegistry: TaskRunnerRegistry;
|
|
7
|
-
onStart(): void;
|
|
8
|
-
}
|
|
1
|
+
import { ContributionProvider } from '@theia/core';
|
|
2
|
+
import { BackendApplicationContribution } from '@theia/core/lib/node';
|
|
3
|
+
import { TaskRunnerContribution, TaskRunnerRegistry } from './task-runner';
|
|
4
|
+
export declare class TaskBackendApplicationContribution implements BackendApplicationContribution {
|
|
5
|
+
protected readonly contributionProvider: ContributionProvider<TaskRunnerContribution>;
|
|
6
|
+
protected readonly taskRunnerRegistry: TaskRunnerRegistry;
|
|
7
|
+
onStart(): void;
|
|
8
|
+
}
|
|
9
9
|
//# sourceMappingURL=task-backend-application-contribution.d.ts.map
|