@kusto/monaco-kusto
Version:
CSL, KQL plugin for the Monaco Editor
100 lines (99 loc) • 5.79 kB
JavaScript
var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
return new (P || (P = Promise))(function (resolve, reject) {
function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
step((generator = generator.apply(thisArg, _arguments || [])).next());
});
};
var __generator = (this && this.__generator) || function (thisArg, body) {
var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
function verb(n) { return function (v) { return step([n, v]); }; }
function step(op) {
if (f) throw new TypeError("Generator is already executing.");
while (g && (g = 0, op[0] && (_ = 0)), _) try {
if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
if (y = 0, t) op = [op[0] & 2, t.value];
switch (op[0]) {
case 0: case 1: t = op; break;
case 4: _.label++; return { value: op[1], done: false };
case 5: _.label++; y = op[1]; op = [0]; continue;
case 7: op = _.ops.pop(); _.trys.pop(); continue;
default:
if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
if (t[2]) _.ops.pop();
_.trys.pop(); continue;
}
op = body.call(thisArg, _);
} catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
}
};
import { tokenTypes } from './types';
var SemanticTokensProvider = /** @class */ (function () {
function SemanticTokensProvider(classificationsGetter) {
this.classificationsGetter = classificationsGetter;
}
SemanticTokensProvider.prototype.getLegend = function () {
return { tokenTypes: tokenTypes, tokenModifiers: [] };
};
SemanticTokensProvider.prototype.provideDocumentSemanticTokens = function (model) {
return __awaiter(this, void 0, void 0, function () {
var resource, classifications, tokens, prevLine, prevChar, _i, classifications_1, classification, parts, _a, parts_1, part, absLine, absChar, length_1, kind, modifiers, deltaLine, deltaChar;
return __generator(this, function (_b) {
switch (_b.label) {
case 0:
resource = model.uri;
return [4 /*yield*/, this.classificationsGetter(resource)];
case 1:
classifications = _b.sent();
tokens = [];
prevLine = 0;
prevChar = 0;
for (_i = 0, classifications_1 = classifications; _i < classifications_1.length; _i++) {
classification = classifications_1[_i];
parts = toSemanticTokens(classification, model);
for (_a = 0, parts_1 = parts; _a < parts_1.length; _a++) {
part = parts_1[_a];
absLine = part[0], absChar = part[1], length_1 = part[2], kind = part[3], modifiers = part[4];
deltaLine = absLine - prevLine;
deltaChar = deltaLine === 0 ? absChar - prevChar : absChar;
tokens.push([deltaLine, deltaChar, length_1, kind, modifiers]);
prevLine = absLine;
prevChar = absChar;
}
}
return [2 /*return*/, {
data: new Uint32Array(tokens.flat(2)),
resultId: model.getVersionId().toString(),
}];
}
});
});
};
SemanticTokensProvider.prototype.releaseDocumentSemanticTokens = function () { };
return SemanticTokensProvider;
}());
export { SemanticTokensProvider };
function toSemanticTokens(classification, model) {
var line = classification.line, character = classification.character, length = classification.length, kind = classification.kind;
var tokens = [];
var remainingLength = length;
var currentLine = line;
var currentChar = character;
while (remainingLength > 0 && currentLine < model.getLineCount()) {
var lineLength = model.getLineLength(currentLine + 1);
var available = lineLength - currentChar + 1;
var tokenLength = Math.min(remainingLength, available);
tokens.push([currentLine, currentChar, tokenLength, kind, 0]);
remainingLength -= tokenLength;
currentLine++;
currentChar = 0; // reset for next line
}
return tokens;
}