diff --git a/.gitignore b/.gitignore index bf8594c..ccf7db9 100644 --- a/.gitignore +++ b/.gitignore @@ -5,3 +5,4 @@ yarn-error.log dist .DS_Store public/static/monaco/*.worker.js.map +.tool-versions diff --git a/components/Form.tsx b/components/Form.tsx index 00d5ff4..ba38ca9 100644 --- a/components/Form.tsx +++ b/components/Form.tsx @@ -1,10 +1,11 @@ import React from "react"; import { Formik, FormikProps } from "formik"; -import { Dialog, Heading, Pane, Switch, TextInput } from "evergreen-ui"; +import { Dialog, Heading, Pane, Switch, TextInput, Select } from "evergreen-ui"; export enum InputType { SWITCH = 1, - TEXT_INPUT + TEXT_INPUT, + SELECT } interface FormProps { @@ -17,6 +18,7 @@ interface FormProps { label: string; isDisabled?: (values: T) => boolean; props?: any; + options?: { label: string; value: string | number }[]; }[]; open: boolean; toggle: () => void; @@ -50,10 +52,26 @@ const Form = ({ > <> {formsFields.map( - ({ type, key, label, isDisabled, props: _props }, i) => { - let FormField; + ( + { type, key, label, isDisabled, props: _props, options }, + i + ) => { + let FormField, select; if (type === InputType.TEXT_INPUT) FormField = TextInput; else if (type === InputType.SWITCH) FormField = Switch; + else if (type === InputType.SELECT) + select = ( + + ); const _isDisabled = isDisabled ? isDisabled(props.values) @@ -86,6 +104,8 @@ const Form = ({ disabled={_isDisabled} /> )} + + {select} ); } diff --git a/next.config.js b/next.config.js index a74966c..d2131e8 100644 --- a/next.config.js +++ b/next.config.js @@ -40,12 +40,7 @@ const config = { "java", "pug" ], - features: [ - "folding", - "goToDefinitionMouse", - "referenceSearch", - "coreCommands" - ] + features: ["folding", "goToSymbol", "coreCommands"] }) ); diff --git a/package.json b/package.json index 514bdb4..17f4571 100644 --- a/package.json +++ b/package.json @@ -43,10 +43,10 @@ "babel-plugin-json-to-proptypes": "^0.1.0", "babel-plugin-object-styles-to-template": "^0.2.2", "babel-standalone": "^6.26.0", - "clipboard-copy": "^3.0.0", + "clipboard-copy": "^3.1.0", "evergreen-ui": "^4.18.1", "flow-to-ts": "gist:3f49c8bd7a2b71429dcae28f2c2d1d97", - "flowgen": "^1.9.2", + "flowgen": "^1.10.0", "formik": "^1.5.8", "generate-schema": "^2.6.0", "gofmt.js": "^0.0.2", @@ -60,30 +60,30 @@ "json-schema-to-typescript": "^6.1.3", "json-to-go": "gist:0d0b8324131c80eeb7e1df20001be32f", "json-ts": "^1.6.4", - "json_typegen_wasm": "^0.3.3", + "json_typegen_wasm": "^0.4.0", "jsonld": "^1.6.2", "load-script": "^1.0.0", "lodash": "^4.17.15", "markdown": "^0.5.0", - "monaco-editor": "^0.17.1", - "next": "^9.1.1", + "monaco-editor": "^0.19.0", + "next": "^9.1.7", "nprogress": "^0.2.0", - "postcss": "^7.0.17", - "postcss-js": "^2.0.2", + "postcss": "^7.0.26", + "postcss-js": "^2.0.3", "qrcode.react": "^0.9.3", - "react": "^16.11.0", - "react-dom": "^16.11.0", - "react-ga": "^2.6.0", + "react": "^16.12.0", + "react-dom": "^16.12.0", + "react-ga": "^2.7.0", "rust-keywords": "^1.1.0", "sha1": "^1.1.1", "snack-sdk": "^2.3.1", "stringify-object": "^3.3.0", "svg-to-dataurl": "^1.0.0", - "svgo": "^1.3.0", + "svgo": "^1.3.2", "text-encoding-utf-8": "^1.0.2", "transform-json-types": "^0.7.0", "xml-js": "^1.6.11", - "yaml": "^1.6.0" + "yaml": "^1.7.2" }, "devDependencies": { "@next/bundle-analyzer": "^9.0.2", diff --git a/pages/json-to-rust-serde.tsx b/pages/json-to-rust-serde.tsx index df148cd..07a78e4 100644 --- a/pages/json-to-rust-serde.tsx +++ b/pages/json-to-rust-serde.tsx @@ -1,18 +1,70 @@ import ConversionPanel, { Transformer } from "@components/ConversionPanel"; import * as React from "react"; import { useCallback } from "react"; +import Form, { InputType } from "@components/Form"; +import { useSettings } from "@hooks/useSettings"; +import { EditorPanelProps } from "@components/EditorPanel"; +import { Settings } from "@constants/svgoConfig"; + +const formFields = [ + { + type: InputType.SELECT, + key: "property_name_format", + label: "Property Name Format", + options: [ + "PascalCase", + "camelCase", + "snake_case", + "SCREAMING_SNAKE_CASE", + "kebab-case", + "SCREAMING-KEBAB-CASE", + "UPPERCASE" + ].map(value => ({ + label: value, + value + })) + } +]; + +const defaultSettings = { + property_name_format: "camelCase" +}; export default function() { - const transformer = useCallback(async ({ value }) => { - const { run } = await import("json_typegen_wasm"); - return run( - "Root", - value, - JSON.stringify({ - output_mode: "rust" - }) - ); - }, []); + const name = "json-to-rust-serde"; + + const [settings, setSettings] = useSettings(name, defaultSettings); + + const transformer = useCallback( + async ({ value }) => { + const { run } = await import("json_typegen_wasm"); + return run( + "Root", + value, + JSON.stringify({ + output_mode: "rust", + property_name_format: settings.property_name_format + }) + ); + }, + [settings] + ); + + const getSettingsElement = useCallback( + ({ open, toggle }) => { + return ( + + title="JSON to Rust Serde" + onSubmit={setSettings} + open={open} + toggle={toggle} + formsFields={formFields} + initialValues={settings} + /> + ); + }, + [] + ); return ( ); } diff --git a/public/static/monaco/css.worker.js b/public/static/monaco/css.worker.js index be95db3..897ba0c 100644 --- a/public/static/monaco/css.worker.js +++ b/public/static/monaco/css.worker.js @@ -96,7 +96,7 @@ /*!*****************************************************************!*\ !*** ./node_modules/monaco-editor/esm/vs/base/common/arrays.js ***! \*****************************************************************/ -/*! exports provided: tail, tail2, equals, binarySearch, findFirstInSorted, mergeSort, groupBy, coalesce, isFalsyOrEmpty, isNonEmptyArray, distinct, distinctES6, firstIndex, first, flatten, range, arrayInsert, pushToStart, pushToEnd, asArray */ +/*! exports provided: tail, tail2, equals, binarySearch, findFirstInSorted, mergeSort, groupBy, coalesce, isFalsyOrEmpty, isNonEmptyArray, distinct, distinctES6, fromSet, firstIndex, first, firstOrDefault, flatten, range, arrayInsert, pushToStart, pushToEnd, find, asArray */ /***/ (function(module, __webpack_exports__, __webpack_require__) { "use strict"; @@ -113,270 +113,284 @@ __webpack_require__.r(__webpack_exports__); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "isNonEmptyArray", function() { return isNonEmptyArray; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "distinct", function() { return distinct; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "distinctES6", function() { return distinctES6; }); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "fromSet", function() { return fromSet; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "firstIndex", function() { return firstIndex; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "first", function() { return first; }); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "firstOrDefault", function() { return firstOrDefault; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "flatten", function() { return flatten; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "range", function() { return range; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "arrayInsert", function() { return arrayInsert; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "pushToStart", function() { return pushToStart; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "pushToEnd", function() { return pushToEnd; }); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "find", function() { return find; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "asArray", function() { return asArray; }); -/** - * Returns the last element of an array. - * @param array The array. - * @param n Which element from the end (default is zero). - */ -function tail(array, n) { - if (n === void 0) { n = 0; } - return array[array.length - (1 + n)]; -} -function tail2(arr) { - if (arr.length === 0) { - throw new Error('Invalid tail call'); - } - return [arr.slice(0, arr.length - 1), arr[arr.length - 1]]; -} -function equals(one, other, itemEquals) { - if (itemEquals === void 0) { itemEquals = function (a, b) { return a === b; }; } - if (one === other) { - return true; - } - if (!one || !other) { - return false; - } - if (one.length !== other.length) { - return false; - } - for (var i = 0, len = one.length; i < len; i++) { - if (!itemEquals(one[i], other[i])) { - return false; - } - } - return true; -} -function binarySearch(array, key, comparator) { - var low = 0, high = array.length - 1; - while (low <= high) { - var mid = ((low + high) / 2) | 0; - var comp = comparator(array[mid], key); - if (comp < 0) { - low = mid + 1; - } - else if (comp > 0) { - high = mid - 1; - } - else { - return mid; - } - } - return -(low + 1); -} -/** - * Takes a sorted array and a function p. The array is sorted in such a way that all elements where p(x) is false - * are located before all elements where p(x) is true. - * @returns the least x for which p(x) is true or array.length if no element fullfills the given function. - */ -function findFirstInSorted(array, p) { - var low = 0, high = array.length; - if (high === 0) { - return 0; // no children - } - while (low < high) { - var mid = Math.floor((low + high) / 2); - if (p(array[mid])) { - high = mid; - } - else { - low = mid + 1; - } - } - return low; -} -/** - * Like `Array#sort` but always stable. Usually runs a little slower `than Array#sort` - * so only use this when actually needing stable sort. - */ -function mergeSort(data, compare) { - _sort(data, compare, 0, data.length - 1, []); - return data; -} -function _merge(a, compare, lo, mid, hi, aux) { - var leftIdx = lo, rightIdx = mid + 1; - for (var i = lo; i <= hi; i++) { - aux[i] = a[i]; - } - for (var i = lo; i <= hi; i++) { - if (leftIdx > mid) { - // left side consumed - a[i] = aux[rightIdx++]; - } - else if (rightIdx > hi) { - // right side consumed - a[i] = aux[leftIdx++]; - } - else if (compare(aux[rightIdx], aux[leftIdx]) < 0) { - // right element is less -> comes first - a[i] = aux[rightIdx++]; - } - else { - // left element comes first (less or equal) - a[i] = aux[leftIdx++]; - } - } -} -function _sort(a, compare, lo, hi, aux) { - if (hi <= lo) { - return; - } - var mid = lo + ((hi - lo) / 2) | 0; - _sort(a, compare, lo, mid, aux); - _sort(a, compare, mid + 1, hi, aux); - if (compare(a[mid], a[mid + 1]) <= 0) { - // left and right are sorted and if the last-left element is less - // or equals than the first-right element there is nothing else - // to do - return; - } - _merge(a, compare, lo, mid, hi, aux); -} -function groupBy(data, compare) { - var result = []; - var currentGroup = undefined; - for (var _i = 0, _a = mergeSort(data.slice(0), compare); _i < _a.length; _i++) { - var element = _a[_i]; - if (!currentGroup || compare(currentGroup[0], element) !== 0) { - currentGroup = [element]; - result.push(currentGroup); - } - else { - currentGroup.push(element); - } - } - return result; -} -/** - * @returns a new array with all falsy values removed. The original array IS NOT modified. - */ -function coalesce(array) { - if (!array) { - return array; - } - return array.filter(function (e) { return !!e; }); -} -/** - * @returns false if the provided object is an array and not empty. - */ -function isFalsyOrEmpty(obj) { - return !Array.isArray(obj) || obj.length === 0; -} -/** - * @returns True if the provided object is an array and has at least one element. - */ -function isNonEmptyArray(obj) { - return Array.isArray(obj) && obj.length > 0; -} -/** - * Removes duplicates from the given array. The optional keyFn allows to specify - * how elements are checked for equalness by returning a unique string for each. - */ -function distinct(array, keyFn) { - if (!keyFn) { - return array.filter(function (element, position) { - return array.indexOf(element) === position; - }); - } - var seen = Object.create(null); - return array.filter(function (elem) { - var key = keyFn(elem); - if (seen[key]) { - return false; - } - seen[key] = true; - return true; - }); -} -function distinctES6(array) { - var seen = new Set(); - return array.filter(function (element) { - if (seen.has(element)) { - return false; - } - seen.add(element); - return true; - }); -} -function firstIndex(array, fn) { - for (var i = 0; i < array.length; i++) { - var element = array[i]; - if (fn(element)) { - return i; - } - } - return -1; -} -function first(array, fn, notFoundValue) { - if (notFoundValue === void 0) { notFoundValue = undefined; } - var index = firstIndex(array, fn); - return index < 0 ? notFoundValue : array[index]; -} -function flatten(arr) { - var _a; - return (_a = []).concat.apply(_a, arr); -} -function range(arg, to) { - var from = typeof to === 'number' ? arg : 0; - if (typeof to === 'number') { - from = arg; - } - else { - from = 0; - to = arg; - } - var result = []; - if (from <= to) { - for (var i = from; i < to; i++) { - result.push(i); - } - } - else { - for (var i = from; i > to; i--) { - result.push(i); - } - } - return result; -} -/** - * Insert `insertArr` inside `target` at `insertIndex`. - * Please don't touch unless you understand https://jsperf.com/inserting-an-array-within-an-array - */ -function arrayInsert(target, insertIndex, insertArr) { - var before = target.slice(0, insertIndex); - var after = target.slice(insertIndex); - return before.concat(insertArr, after); -} -/** - * Pushes an element to the start of the array, if found. - */ -function pushToStart(arr, value) { - var index = arr.indexOf(value); - if (index > -1) { - arr.splice(index, 1); - arr.unshift(value); - } -} -/** - * Pushes an element to the end of the array, if found. - */ -function pushToEnd(arr, value) { - var index = arr.indexOf(value); - if (index > -1) { - arr.splice(index, 1); - arr.push(value); - } -} -function asArray(x) { - return Array.isArray(x) ? x : [x]; -} +/** + * Returns the last element of an array. + * @param array The array. + * @param n Which element from the end (default is zero). + */ +function tail(array, n) { + if (n === void 0) { n = 0; } + return array[array.length - (1 + n)]; +} +function tail2(arr) { + if (arr.length === 0) { + throw new Error('Invalid tail call'); + } + return [arr.slice(0, arr.length - 1), arr[arr.length - 1]]; +} +function equals(one, other, itemEquals) { + if (itemEquals === void 0) { itemEquals = function (a, b) { return a === b; }; } + if (one === other) { + return true; + } + if (!one || !other) { + return false; + } + if (one.length !== other.length) { + return false; + } + for (var i = 0, len = one.length; i < len; i++) { + if (!itemEquals(one[i], other[i])) { + return false; + } + } + return true; +} +function binarySearch(array, key, comparator) { + var low = 0, high = array.length - 1; + while (low <= high) { + var mid = ((low + high) / 2) | 0; + var comp = comparator(array[mid], key); + if (comp < 0) { + low = mid + 1; + } + else if (comp > 0) { + high = mid - 1; + } + else { + return mid; + } + } + return -(low + 1); +} +/** + * Takes a sorted array and a function p. The array is sorted in such a way that all elements where p(x) is false + * are located before all elements where p(x) is true. + * @returns the least x for which p(x) is true or array.length if no element fullfills the given function. + */ +function findFirstInSorted(array, p) { + var low = 0, high = array.length; + if (high === 0) { + return 0; // no children + } + while (low < high) { + var mid = Math.floor((low + high) / 2); + if (p(array[mid])) { + high = mid; + } + else { + low = mid + 1; + } + } + return low; +} +/** + * Like `Array#sort` but always stable. Usually runs a little slower `than Array#sort` + * so only use this when actually needing stable sort. + */ +function mergeSort(data, compare) { + _sort(data, compare, 0, data.length - 1, []); + return data; +} +function _merge(a, compare, lo, mid, hi, aux) { + var leftIdx = lo, rightIdx = mid + 1; + for (var i = lo; i <= hi; i++) { + aux[i] = a[i]; + } + for (var i = lo; i <= hi; i++) { + if (leftIdx > mid) { + // left side consumed + a[i] = aux[rightIdx++]; + } + else if (rightIdx > hi) { + // right side consumed + a[i] = aux[leftIdx++]; + } + else if (compare(aux[rightIdx], aux[leftIdx]) < 0) { + // right element is less -> comes first + a[i] = aux[rightIdx++]; + } + else { + // left element comes first (less or equal) + a[i] = aux[leftIdx++]; + } + } +} +function _sort(a, compare, lo, hi, aux) { + if (hi <= lo) { + return; + } + var mid = lo + ((hi - lo) / 2) | 0; + _sort(a, compare, lo, mid, aux); + _sort(a, compare, mid + 1, hi, aux); + if (compare(a[mid], a[mid + 1]) <= 0) { + // left and right are sorted and if the last-left element is less + // or equals than the first-right element there is nothing else + // to do + return; + } + _merge(a, compare, lo, mid, hi, aux); +} +function groupBy(data, compare) { + var result = []; + var currentGroup = undefined; + for (var _i = 0, _a = mergeSort(data.slice(0), compare); _i < _a.length; _i++) { + var element = _a[_i]; + if (!currentGroup || compare(currentGroup[0], element) !== 0) { + currentGroup = [element]; + result.push(currentGroup); + } + else { + currentGroup.push(element); + } + } + return result; +} +/** + * @returns New array with all falsy values removed. The original array IS NOT modified. + */ +function coalesce(array) { + return array.filter(function (e) { return !!e; }); +} +/** + * @returns false if the provided object is an array and not empty. + */ +function isFalsyOrEmpty(obj) { + return !Array.isArray(obj) || obj.length === 0; +} +function isNonEmptyArray(obj) { + return Array.isArray(obj) && obj.length > 0; +} +/** + * Removes duplicates from the given array. The optional keyFn allows to specify + * how elements are checked for equalness by returning a unique string for each. + */ +function distinct(array, keyFn) { + if (!keyFn) { + return array.filter(function (element, position) { + return array.indexOf(element) === position; + }); + } + var seen = Object.create(null); + return array.filter(function (elem) { + var key = keyFn(elem); + if (seen[key]) { + return false; + } + seen[key] = true; + return true; + }); +} +function distinctES6(array) { + var seen = new Set(); + return array.filter(function (element) { + if (seen.has(element)) { + return false; + } + seen.add(element); + return true; + }); +} +function fromSet(set) { + var result = []; + set.forEach(function (o) { return result.push(o); }); + return result; +} +function firstIndex(array, fn) { + for (var i = 0; i < array.length; i++) { + var element = array[i]; + if (fn(element)) { + return i; + } + } + return -1; +} +function first(array, fn, notFoundValue) { + if (notFoundValue === void 0) { notFoundValue = undefined; } + var index = firstIndex(array, fn); + return index < 0 ? notFoundValue : array[index]; +} +function firstOrDefault(array, notFoundValue) { + return array.length > 0 ? array[0] : notFoundValue; +} +function flatten(arr) { + var _a; + return (_a = []).concat.apply(_a, arr); +} +function range(arg, to) { + var from = typeof to === 'number' ? arg : 0; + if (typeof to === 'number') { + from = arg; + } + else { + from = 0; + to = arg; + } + var result = []; + if (from <= to) { + for (var i = from; i < to; i++) { + result.push(i); + } + } + else { + for (var i = from; i > to; i--) { + result.push(i); + } + } + return result; +} +/** + * Insert `insertArr` inside `target` at `insertIndex`. + * Please don't touch unless you understand https://jsperf.com/inserting-an-array-within-an-array + */ +function arrayInsert(target, insertIndex, insertArr) { + var before = target.slice(0, insertIndex); + var after = target.slice(insertIndex); + return before.concat(insertArr, after); +} +/** + * Pushes an element to the start of the array, if found. + */ +function pushToStart(arr, value) { + var index = arr.indexOf(value); + if (index > -1) { + arr.splice(index, 1); + arr.unshift(value); + } +} +/** + * Pushes an element to the end of the array, if found. + */ +function pushToEnd(arr, value) { + var index = arr.indexOf(value); + if (index > -1) { + arr.splice(index, 1); + arr.push(value); + } +} +function find(arr, predicate) { + for (var i = 0; i < arr.length; i++) { + var element = arr[i]; + if (predicate(element, i, arr)) { + return element; + } + } + return undefined; +} +function asArray(x) { + return Array.isArray(x) ? x : [x]; +} /***/ }), @@ -393,128 +407,132 @@ __webpack_require__.r(__webpack_exports__); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "CancellationToken", function() { return CancellationToken; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "CancellationTokenSource", function() { return CancellationTokenSource; }); /* harmony import */ var _event_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./event.js */ "./node_modules/monaco-editor/esm/vs/base/common/event.js"); -/*--------------------------------------------------------------------------------------------- - * Copyright (c) Microsoft Corporation. All rights reserved. - * Licensed under the MIT License. See License.txt in the project root for license information. - *--------------------------------------------------------------------------------------------*/ - -var shortcutEvent = Object.freeze(function (callback, context) { - var handle = setTimeout(callback.bind(context), 0); - return { dispose: function () { clearTimeout(handle); } }; -}); -var CancellationToken; -(function (CancellationToken) { - function isCancellationToken(thing) { - if (thing === CancellationToken.None || thing === CancellationToken.Cancelled) { - return true; - } - if (thing instanceof MutableToken) { - return true; - } - if (!thing || typeof thing !== 'object') { - return false; - } - return typeof thing.isCancellationRequested === 'boolean' - && typeof thing.onCancellationRequested === 'function'; - } - CancellationToken.isCancellationToken = isCancellationToken; - CancellationToken.None = Object.freeze({ - isCancellationRequested: false, - onCancellationRequested: _event_js__WEBPACK_IMPORTED_MODULE_0__["Event"].None - }); - CancellationToken.Cancelled = Object.freeze({ - isCancellationRequested: true, - onCancellationRequested: shortcutEvent - }); -})(CancellationToken || (CancellationToken = {})); -var MutableToken = /** @class */ (function () { - function MutableToken() { - this._isCancelled = false; - this._emitter = null; - } - MutableToken.prototype.cancel = function () { - if (!this._isCancelled) { - this._isCancelled = true; - if (this._emitter) { - this._emitter.fire(undefined); - this.dispose(); - } - } - }; - Object.defineProperty(MutableToken.prototype, "isCancellationRequested", { - get: function () { - return this._isCancelled; - }, - enumerable: true, - configurable: true - }); - Object.defineProperty(MutableToken.prototype, "onCancellationRequested", { - get: function () { - if (this._isCancelled) { - return shortcutEvent; - } - if (!this._emitter) { - this._emitter = new _event_js__WEBPACK_IMPORTED_MODULE_0__["Emitter"](); - } - return this._emitter.event; - }, - enumerable: true, - configurable: true - }); - MutableToken.prototype.dispose = function () { - if (this._emitter) { - this._emitter.dispose(); - this._emitter = null; - } - }; - return MutableToken; -}()); -var CancellationTokenSource = /** @class */ (function () { - function CancellationTokenSource(parent) { - this._token = undefined; - this._parentListener = undefined; - this._parentListener = parent && parent.onCancellationRequested(this.cancel, this); - } - Object.defineProperty(CancellationTokenSource.prototype, "token", { - get: function () { - if (!this._token) { - // be lazy and create the token only when - // actually needed - this._token = new MutableToken(); - } - return this._token; - }, - enumerable: true, - configurable: true - }); - CancellationTokenSource.prototype.cancel = function () { - if (!this._token) { - // save an object by returning the default - // cancelled token when cancellation happens - // before someone asks for the token - this._token = CancellationToken.Cancelled; - } - else if (this._token instanceof MutableToken) { - // actually cancel - this._token.cancel(); - } - }; - CancellationTokenSource.prototype.dispose = function () { - if (this._parentListener) { - this._parentListener.dispose(); - } - if (!this._token) { - // ensure to initialize with an empty token if we had none - this._token = CancellationToken.None; - } - else if (this._token instanceof MutableToken) { - // actually dispose - this._token.dispose(); - } - }; - return CancellationTokenSource; -}()); - +/*--------------------------------------------------------------------------------------------- + * Copyright (c) Microsoft Corporation. All rights reserved. + * Licensed under the MIT License. See License.txt in the project root for license information. + *--------------------------------------------------------------------------------------------*/ + +var shortcutEvent = Object.freeze(function (callback, context) { + var handle = setTimeout(callback.bind(context), 0); + return { dispose: function () { clearTimeout(handle); } }; +}); +var CancellationToken; +(function (CancellationToken) { + function isCancellationToken(thing) { + if (thing === CancellationToken.None || thing === CancellationToken.Cancelled) { + return true; + } + if (thing instanceof MutableToken) { + return true; + } + if (!thing || typeof thing !== 'object') { + return false; + } + return typeof thing.isCancellationRequested === 'boolean' + && typeof thing.onCancellationRequested === 'function'; + } + CancellationToken.isCancellationToken = isCancellationToken; + CancellationToken.None = Object.freeze({ + isCancellationRequested: false, + onCancellationRequested: _event_js__WEBPACK_IMPORTED_MODULE_0__["Event"].None + }); + CancellationToken.Cancelled = Object.freeze({ + isCancellationRequested: true, + onCancellationRequested: shortcutEvent + }); +})(CancellationToken || (CancellationToken = {})); +var MutableToken = /** @class */ (function () { + function MutableToken() { + this._isCancelled = false; + this._emitter = null; + } + MutableToken.prototype.cancel = function () { + if (!this._isCancelled) { + this._isCancelled = true; + if (this._emitter) { + this._emitter.fire(undefined); + this.dispose(); + } + } + }; + Object.defineProperty(MutableToken.prototype, "isCancellationRequested", { + get: function () { + return this._isCancelled; + }, + enumerable: true, + configurable: true + }); + Object.defineProperty(MutableToken.prototype, "onCancellationRequested", { + get: function () { + if (this._isCancelled) { + return shortcutEvent; + } + if (!this._emitter) { + this._emitter = new _event_js__WEBPACK_IMPORTED_MODULE_0__["Emitter"](); + } + return this._emitter.event; + }, + enumerable: true, + configurable: true + }); + MutableToken.prototype.dispose = function () { + if (this._emitter) { + this._emitter.dispose(); + this._emitter = null; + } + }; + return MutableToken; +}()); +var CancellationTokenSource = /** @class */ (function () { + function CancellationTokenSource(parent) { + this._token = undefined; + this._parentListener = undefined; + this._parentListener = parent && parent.onCancellationRequested(this.cancel, this); + } + Object.defineProperty(CancellationTokenSource.prototype, "token", { + get: function () { + if (!this._token) { + // be lazy and create the token only when + // actually needed + this._token = new MutableToken(); + } + return this._token; + }, + enumerable: true, + configurable: true + }); + CancellationTokenSource.prototype.cancel = function () { + if (!this._token) { + // save an object by returning the default + // cancelled token when cancellation happens + // before someone asks for the token + this._token = CancellationToken.Cancelled; + } + else if (this._token instanceof MutableToken) { + // actually cancel + this._token.cancel(); + } + }; + CancellationTokenSource.prototype.dispose = function (cancel) { + if (cancel === void 0) { cancel = false; } + if (cancel) { + this.cancel(); + } + if (this._parentListener) { + this._parentListener.dispose(); + } + if (!this._token) { + // ensure to initialize with an empty token if we had none + this._token = CancellationToken.None; + } + else if (this._token instanceof MutableToken) { + // actually dispose + this._token.dispose(); + } + }; + return CancellationTokenSource; +}()); + /***/ }), @@ -523,804 +541,839 @@ var CancellationTokenSource = /** @class */ (function () { /*!********************************************************************!*\ !*** ./node_modules/monaco-editor/esm/vs/base/common/diff/diff.js ***! \********************************************************************/ -/*! exports provided: stringDiff, Debug, MyArray, LcsDiff */ +/*! exports provided: StringDiffSequence, stringDiff, Debug, MyArray, LcsDiff */ /***/ (function(module, __webpack_exports__, __webpack_require__) { "use strict"; __webpack_require__.r(__webpack_exports__); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "StringDiffSequence", function() { return StringDiffSequence; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "stringDiff", function() { return stringDiff; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "Debug", function() { return Debug; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "MyArray", function() { return MyArray; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "LcsDiff", function() { return LcsDiff; }); /* harmony import */ var _diffChange_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./diffChange.js */ "./node_modules/monaco-editor/esm/vs/base/common/diff/diffChange.js"); -/*--------------------------------------------------------------------------------------------- - * Copyright (c) Microsoft Corporation. All rights reserved. - * Licensed under the MIT License. See License.txt in the project root for license information. - *--------------------------------------------------------------------------------------------*/ - -function createStringSequence(a) { - return { - getLength: function () { return a.length; }, - getElementAtIndex: function (pos) { return a.charCodeAt(pos); } - }; -} -function stringDiff(original, modified, pretty) { - return new LcsDiff(createStringSequence(original), createStringSequence(modified)).ComputeDiff(pretty); -} -// -// The code below has been ported from a C# implementation in VS -// -var Debug = /** @class */ (function () { - function Debug() { - } - Debug.Assert = function (condition, message) { - if (!condition) { - throw new Error(message); - } - }; - return Debug; -}()); - -var MyArray = /** @class */ (function () { - function MyArray() { - } - /** - * Copies a range of elements from an Array starting at the specified source index and pastes - * them to another Array starting at the specified destination index. The length and the indexes - * are specified as 64-bit integers. - * sourceArray: - * The Array that contains the data to copy. - * sourceIndex: - * A 64-bit integer that represents the index in the sourceArray at which copying begins. - * destinationArray: - * The Array that receives the data. - * destinationIndex: - * A 64-bit integer that represents the index in the destinationArray at which storing begins. - * length: - * A 64-bit integer that represents the number of elements to copy. - */ - MyArray.Copy = function (sourceArray, sourceIndex, destinationArray, destinationIndex, length) { - for (var i = 0; i < length; i++) { - destinationArray[destinationIndex + i] = sourceArray[sourceIndex + i]; - } - }; - return MyArray; -}()); - -//***************************************************************************** -// LcsDiff.cs -// -// An implementation of the difference algorithm described in -// "An O(ND) Difference Algorithm and its variations" by Eugene W. Myers -// -// Copyright (C) 2008 Microsoft Corporation @minifier_do_not_preserve -//***************************************************************************** -// Our total memory usage for storing history is (worst-case): -// 2 * [(MaxDifferencesHistory + 1) * (MaxDifferencesHistory + 1) - 1] * sizeof(int) -// 2 * [1448*1448 - 1] * 4 = 16773624 = 16MB -var MaxDifferencesHistory = 1447; -//let MaxDifferencesHistory = 100; -/** - * A utility class which helps to create the set of DiffChanges from - * a difference operation. This class accepts original DiffElements and - * modified DiffElements that are involved in a particular change. The - * MarktNextChange() method can be called to mark the separation between - * distinct changes. At the end, the Changes property can be called to retrieve - * the constructed changes. - */ -var DiffChangeHelper = /** @class */ (function () { - /** - * Constructs a new DiffChangeHelper for the given DiffSequences. - */ - function DiffChangeHelper() { - this.m_changes = []; - this.m_originalStart = Number.MAX_VALUE; - this.m_modifiedStart = Number.MAX_VALUE; - this.m_originalCount = 0; - this.m_modifiedCount = 0; - } - /** - * Marks the beginning of the next change in the set of differences. - */ - DiffChangeHelper.prototype.MarkNextChange = function () { - // Only add to the list if there is something to add - if (this.m_originalCount > 0 || this.m_modifiedCount > 0) { - // Add the new change to our list - this.m_changes.push(new _diffChange_js__WEBPACK_IMPORTED_MODULE_0__["DiffChange"](this.m_originalStart, this.m_originalCount, this.m_modifiedStart, this.m_modifiedCount)); - } - // Reset for the next change - this.m_originalCount = 0; - this.m_modifiedCount = 0; - this.m_originalStart = Number.MAX_VALUE; - this.m_modifiedStart = Number.MAX_VALUE; - }; - /** - * Adds the original element at the given position to the elements - * affected by the current change. The modified index gives context - * to the change position with respect to the original sequence. - * @param originalIndex The index of the original element to add. - * @param modifiedIndex The index of the modified element that provides corresponding position in the modified sequence. - */ - DiffChangeHelper.prototype.AddOriginalElement = function (originalIndex, modifiedIndex) { - // The 'true' start index is the smallest of the ones we've seen - this.m_originalStart = Math.min(this.m_originalStart, originalIndex); - this.m_modifiedStart = Math.min(this.m_modifiedStart, modifiedIndex); - this.m_originalCount++; - }; - /** - * Adds the modified element at the given position to the elements - * affected by the current change. The original index gives context - * to the change position with respect to the modified sequence. - * @param originalIndex The index of the original element that provides corresponding position in the original sequence. - * @param modifiedIndex The index of the modified element to add. - */ - DiffChangeHelper.prototype.AddModifiedElement = function (originalIndex, modifiedIndex) { - // The 'true' start index is the smallest of the ones we've seen - this.m_originalStart = Math.min(this.m_originalStart, originalIndex); - this.m_modifiedStart = Math.min(this.m_modifiedStart, modifiedIndex); - this.m_modifiedCount++; - }; - /** - * Retrieves all of the changes marked by the class. - */ - DiffChangeHelper.prototype.getChanges = function () { - if (this.m_originalCount > 0 || this.m_modifiedCount > 0) { - // Finish up on whatever is left - this.MarkNextChange(); - } - return this.m_changes; - }; - /** - * Retrieves all of the changes marked by the class in the reverse order - */ - DiffChangeHelper.prototype.getReverseChanges = function () { - if (this.m_originalCount > 0 || this.m_modifiedCount > 0) { - // Finish up on whatever is left - this.MarkNextChange(); - } - this.m_changes.reverse(); - return this.m_changes; - }; - return DiffChangeHelper; -}()); -/** - * An implementation of the difference algorithm described in - * "An O(ND) Difference Algorithm and its variations" by Eugene W. Myers - */ -var LcsDiff = /** @class */ (function () { - /** - * Constructs the DiffFinder - */ - function LcsDiff(originalSequence, newSequence, continueProcessingPredicate) { - if (continueProcessingPredicate === void 0) { continueProcessingPredicate = null; } - this.OriginalSequence = originalSequence; - this.ModifiedSequence = newSequence; - this.ContinueProcessingPredicate = continueProcessingPredicate; - this.m_forwardHistory = []; - this.m_reverseHistory = []; - } - LcsDiff.prototype.ElementsAreEqual = function (originalIndex, newIndex) { - return (this.OriginalSequence.getElementAtIndex(originalIndex) === this.ModifiedSequence.getElementAtIndex(newIndex)); - }; - LcsDiff.prototype.OriginalElementsAreEqual = function (index1, index2) { - return (this.OriginalSequence.getElementAtIndex(index1) === this.OriginalSequence.getElementAtIndex(index2)); - }; - LcsDiff.prototype.ModifiedElementsAreEqual = function (index1, index2) { - return (this.ModifiedSequence.getElementAtIndex(index1) === this.ModifiedSequence.getElementAtIndex(index2)); - }; - LcsDiff.prototype.ComputeDiff = function (pretty) { - return this._ComputeDiff(0, this.OriginalSequence.getLength() - 1, 0, this.ModifiedSequence.getLength() - 1, pretty); - }; - /** - * Computes the differences between the original and modified input - * sequences on the bounded range. - * @returns An array of the differences between the two input sequences. - */ - LcsDiff.prototype._ComputeDiff = function (originalStart, originalEnd, modifiedStart, modifiedEnd, pretty) { - var quitEarlyArr = [false]; - var changes = this.ComputeDiffRecursive(originalStart, originalEnd, modifiedStart, modifiedEnd, quitEarlyArr); - if (pretty) { - // We have to clean up the computed diff to be more intuitive - // but it turns out this cannot be done correctly until the entire set - // of diffs have been computed - return this.PrettifyChanges(changes); - } - return changes; - }; - /** - * Private helper method which computes the differences on the bounded range - * recursively. - * @returns An array of the differences between the two input sequences. - */ - LcsDiff.prototype.ComputeDiffRecursive = function (originalStart, originalEnd, modifiedStart, modifiedEnd, quitEarlyArr) { - quitEarlyArr[0] = false; - // Find the start of the differences - while (originalStart <= originalEnd && modifiedStart <= modifiedEnd && this.ElementsAreEqual(originalStart, modifiedStart)) { - originalStart++; - modifiedStart++; - } - // Find the end of the differences - while (originalEnd >= originalStart && modifiedEnd >= modifiedStart && this.ElementsAreEqual(originalEnd, modifiedEnd)) { - originalEnd--; - modifiedEnd--; - } - // In the special case where we either have all insertions or all deletions or the sequences are identical - if (originalStart > originalEnd || modifiedStart > modifiedEnd) { - var changes = void 0; - if (modifiedStart <= modifiedEnd) { - Debug.Assert(originalStart === originalEnd + 1, 'originalStart should only be one more than originalEnd'); - // All insertions - changes = [ - new _diffChange_js__WEBPACK_IMPORTED_MODULE_0__["DiffChange"](originalStart, 0, modifiedStart, modifiedEnd - modifiedStart + 1) - ]; - } - else if (originalStart <= originalEnd) { - Debug.Assert(modifiedStart === modifiedEnd + 1, 'modifiedStart should only be one more than modifiedEnd'); - // All deletions - changes = [ - new _diffChange_js__WEBPACK_IMPORTED_MODULE_0__["DiffChange"](originalStart, originalEnd - originalStart + 1, modifiedStart, 0) - ]; - } - else { - Debug.Assert(originalStart === originalEnd + 1, 'originalStart should only be one more than originalEnd'); - Debug.Assert(modifiedStart === modifiedEnd + 1, 'modifiedStart should only be one more than modifiedEnd'); - // Identical sequences - No differences - changes = []; - } - return changes; - } - // This problem can be solved using the Divide-And-Conquer technique. - var midOriginalArr = [0], midModifiedArr = [0]; - var result = this.ComputeRecursionPoint(originalStart, originalEnd, modifiedStart, modifiedEnd, midOriginalArr, midModifiedArr, quitEarlyArr); - var midOriginal = midOriginalArr[0]; - var midModified = midModifiedArr[0]; - if (result !== null) { - // Result is not-null when there was enough memory to compute the changes while - // searching for the recursion point - return result; - } - else if (!quitEarlyArr[0]) { - // We can break the problem down recursively by finding the changes in the - // First Half: (originalStart, modifiedStart) to (midOriginal, midModified) - // Second Half: (midOriginal + 1, minModified + 1) to (originalEnd, modifiedEnd) - // NOTE: ComputeDiff() is inclusive, therefore the second range starts on the next point - var leftChanges = this.ComputeDiffRecursive(originalStart, midOriginal, modifiedStart, midModified, quitEarlyArr); - var rightChanges = []; - if (!quitEarlyArr[0]) { - rightChanges = this.ComputeDiffRecursive(midOriginal + 1, originalEnd, midModified + 1, modifiedEnd, quitEarlyArr); - } - else { - // We did't have time to finish the first half, so we don't have time to compute this half. - // Consider the entire rest of the sequence different. - rightChanges = [ - new _diffChange_js__WEBPACK_IMPORTED_MODULE_0__["DiffChange"](midOriginal + 1, originalEnd - (midOriginal + 1) + 1, midModified + 1, modifiedEnd - (midModified + 1) + 1) - ]; - } - return this.ConcatenateChanges(leftChanges, rightChanges); - } - // If we hit here, we quit early, and so can't return anything meaningful - return [ - new _diffChange_js__WEBPACK_IMPORTED_MODULE_0__["DiffChange"](originalStart, originalEnd - originalStart + 1, modifiedStart, modifiedEnd - modifiedStart + 1) - ]; - }; - LcsDiff.prototype.WALKTRACE = function (diagonalForwardBase, diagonalForwardStart, diagonalForwardEnd, diagonalForwardOffset, diagonalReverseBase, diagonalReverseStart, diagonalReverseEnd, diagonalReverseOffset, forwardPoints, reversePoints, originalIndex, originalEnd, midOriginalArr, modifiedIndex, modifiedEnd, midModifiedArr, deltaIsEven, quitEarlyArr) { - var forwardChanges = null, reverseChanges = null; - // First, walk backward through the forward diagonals history - var changeHelper = new DiffChangeHelper(); - var diagonalMin = diagonalForwardStart; - var diagonalMax = diagonalForwardEnd; - var diagonalRelative = (midOriginalArr[0] - midModifiedArr[0]) - diagonalForwardOffset; - var lastOriginalIndex = Number.MIN_VALUE; - var historyIndex = this.m_forwardHistory.length - 1; - var diagonal; - do { - // Get the diagonal index from the relative diagonal number - diagonal = diagonalRelative + diagonalForwardBase; - // Figure out where we came from - if (diagonal === diagonalMin || (diagonal < diagonalMax && forwardPoints[diagonal - 1] < forwardPoints[diagonal + 1])) { - // Vertical line (the element is an insert) - originalIndex = forwardPoints[diagonal + 1]; - modifiedIndex = originalIndex - diagonalRelative - diagonalForwardOffset; - if (originalIndex < lastOriginalIndex) { - changeHelper.MarkNextChange(); - } - lastOriginalIndex = originalIndex; - changeHelper.AddModifiedElement(originalIndex + 1, modifiedIndex); - diagonalRelative = (diagonal + 1) - diagonalForwardBase; //Setup for the next iteration - } - else { - // Horizontal line (the element is a deletion) - originalIndex = forwardPoints[diagonal - 1] + 1; - modifiedIndex = originalIndex - diagonalRelative - diagonalForwardOffset; - if (originalIndex < lastOriginalIndex) { - changeHelper.MarkNextChange(); - } - lastOriginalIndex = originalIndex - 1; - changeHelper.AddOriginalElement(originalIndex, modifiedIndex + 1); - diagonalRelative = (diagonal - 1) - diagonalForwardBase; //Setup for the next iteration - } - if (historyIndex >= 0) { - forwardPoints = this.m_forwardHistory[historyIndex]; - diagonalForwardBase = forwardPoints[0]; //We stored this in the first spot - diagonalMin = 1; - diagonalMax = forwardPoints.length - 1; - } - } while (--historyIndex >= -1); - // Ironically, we get the forward changes as the reverse of the - // order we added them since we technically added them backwards - forwardChanges = changeHelper.getReverseChanges(); - if (quitEarlyArr[0]) { - // TODO: Calculate a partial from the reverse diagonals. - // For now, just assume everything after the midOriginal/midModified point is a diff - var originalStartPoint = midOriginalArr[0] + 1; - var modifiedStartPoint = midModifiedArr[0] + 1; - if (forwardChanges !== null && forwardChanges.length > 0) { - var lastForwardChange = forwardChanges[forwardChanges.length - 1]; - originalStartPoint = Math.max(originalStartPoint, lastForwardChange.getOriginalEnd()); - modifiedStartPoint = Math.max(modifiedStartPoint, lastForwardChange.getModifiedEnd()); - } - reverseChanges = [ - new _diffChange_js__WEBPACK_IMPORTED_MODULE_0__["DiffChange"](originalStartPoint, originalEnd - originalStartPoint + 1, modifiedStartPoint, modifiedEnd - modifiedStartPoint + 1) - ]; - } - else { - // Now walk backward through the reverse diagonals history - changeHelper = new DiffChangeHelper(); - diagonalMin = diagonalReverseStart; - diagonalMax = diagonalReverseEnd; - diagonalRelative = (midOriginalArr[0] - midModifiedArr[0]) - diagonalReverseOffset; - lastOriginalIndex = Number.MAX_VALUE; - historyIndex = (deltaIsEven) ? this.m_reverseHistory.length - 1 : this.m_reverseHistory.length - 2; - do { - // Get the diagonal index from the relative diagonal number - diagonal = diagonalRelative + diagonalReverseBase; - // Figure out where we came from - if (diagonal === diagonalMin || (diagonal < diagonalMax && reversePoints[diagonal - 1] >= reversePoints[diagonal + 1])) { - // Horizontal line (the element is a deletion)) - originalIndex = reversePoints[diagonal + 1] - 1; - modifiedIndex = originalIndex - diagonalRelative - diagonalReverseOffset; - if (originalIndex > lastOriginalIndex) { - changeHelper.MarkNextChange(); - } - lastOriginalIndex = originalIndex + 1; - changeHelper.AddOriginalElement(originalIndex + 1, modifiedIndex + 1); - diagonalRelative = (diagonal + 1) - diagonalReverseBase; //Setup for the next iteration - } - else { - // Vertical line (the element is an insertion) - originalIndex = reversePoints[diagonal - 1]; - modifiedIndex = originalIndex - diagonalRelative - diagonalReverseOffset; - if (originalIndex > lastOriginalIndex) { - changeHelper.MarkNextChange(); - } - lastOriginalIndex = originalIndex; - changeHelper.AddModifiedElement(originalIndex + 1, modifiedIndex + 1); - diagonalRelative = (diagonal - 1) - diagonalReverseBase; //Setup for the next iteration - } - if (historyIndex >= 0) { - reversePoints = this.m_reverseHistory[historyIndex]; - diagonalReverseBase = reversePoints[0]; //We stored this in the first spot - diagonalMin = 1; - diagonalMax = reversePoints.length - 1; - } - } while (--historyIndex >= -1); - // There are cases where the reverse history will find diffs that - // are correct, but not intuitive, so we need shift them. - reverseChanges = changeHelper.getChanges(); - } - return this.ConcatenateChanges(forwardChanges, reverseChanges); - }; - /** - * Given the range to compute the diff on, this method finds the point: - * (midOriginal, midModified) - * that exists in the middle of the LCS of the two sequences and - * is the point at which the LCS problem may be broken down recursively. - * This method will try to keep the LCS trace in memory. If the LCS recursion - * point is calculated and the full trace is available in memory, then this method - * will return the change list. - * @param originalStart The start bound of the original sequence range - * @param originalEnd The end bound of the original sequence range - * @param modifiedStart The start bound of the modified sequence range - * @param modifiedEnd The end bound of the modified sequence range - * @param midOriginal The middle point of the original sequence range - * @param midModified The middle point of the modified sequence range - * @returns The diff changes, if available, otherwise null - */ - LcsDiff.prototype.ComputeRecursionPoint = function (originalStart, originalEnd, modifiedStart, modifiedEnd, midOriginalArr, midModifiedArr, quitEarlyArr) { - var originalIndex = 0, modifiedIndex = 0; - var diagonalForwardStart = 0, diagonalForwardEnd = 0; - var diagonalReverseStart = 0, diagonalReverseEnd = 0; - var numDifferences; - // To traverse the edit graph and produce the proper LCS, our actual - // start position is just outside the given boundary - originalStart--; - modifiedStart--; - // We set these up to make the compiler happy, but they will - // be replaced before we return with the actual recursion point - midOriginalArr[0] = 0; - midModifiedArr[0] = 0; - // Clear out the history - this.m_forwardHistory = []; - this.m_reverseHistory = []; - // Each cell in the two arrays corresponds to a diagonal in the edit graph. - // The integer value in the cell represents the originalIndex of the furthest - // reaching point found so far that ends in that diagonal. - // The modifiedIndex can be computed mathematically from the originalIndex and the diagonal number. - var maxDifferences = (originalEnd - originalStart) + (modifiedEnd - modifiedStart); - var numDiagonals = maxDifferences + 1; - var forwardPoints = new Array(numDiagonals); - var reversePoints = new Array(numDiagonals); - // diagonalForwardBase: Index into forwardPoints of the diagonal which passes through (originalStart, modifiedStart) - // diagonalReverseBase: Index into reversePoints of the diagonal which passes through (originalEnd, modifiedEnd) - var diagonalForwardBase = (modifiedEnd - modifiedStart); - var diagonalReverseBase = (originalEnd - originalStart); - // diagonalForwardOffset: Geometric offset which allows modifiedIndex to be computed from originalIndex and the - // diagonal number (relative to diagonalForwardBase) - // diagonalReverseOffset: Geometric offset which allows modifiedIndex to be computed from originalIndex and the - // diagonal number (relative to diagonalReverseBase) - var diagonalForwardOffset = (originalStart - modifiedStart); - var diagonalReverseOffset = (originalEnd - modifiedEnd); - // delta: The difference between the end diagonal and the start diagonal. This is used to relate diagonal numbers - // relative to the start diagonal with diagonal numbers relative to the end diagonal. - // The Even/Oddn-ness of this delta is important for determining when we should check for overlap - var delta = diagonalReverseBase - diagonalForwardBase; - var deltaIsEven = (delta % 2 === 0); - // Here we set up the start and end points as the furthest points found so far - // in both the forward and reverse directions, respectively - forwardPoints[diagonalForwardBase] = originalStart; - reversePoints[diagonalReverseBase] = originalEnd; - // Remember if we quit early, and thus need to do a best-effort result instead of a real result. - quitEarlyArr[0] = false; - // A couple of points: - // --With this method, we iterate on the number of differences between the two sequences. - // The more differences there actually are, the longer this will take. - // --Also, as the number of differences increases, we have to search on diagonals further - // away from the reference diagonal (which is diagonalForwardBase for forward, diagonalReverseBase for reverse). - // --We extend on even diagonals (relative to the reference diagonal) only when numDifferences - // is even and odd diagonals only when numDifferences is odd. - var diagonal, tempOriginalIndex; - for (numDifferences = 1; numDifferences <= (maxDifferences / 2) + 1; numDifferences++) { - var furthestOriginalIndex = 0; - var furthestModifiedIndex = 0; - // Run the algorithm in the forward direction - diagonalForwardStart = this.ClipDiagonalBound(diagonalForwardBase - numDifferences, numDifferences, diagonalForwardBase, numDiagonals); - diagonalForwardEnd = this.ClipDiagonalBound(diagonalForwardBase + numDifferences, numDifferences, diagonalForwardBase, numDiagonals); - for (diagonal = diagonalForwardStart; diagonal <= diagonalForwardEnd; diagonal += 2) { - // STEP 1: We extend the furthest reaching point in the present diagonal - // by looking at the diagonals above and below and picking the one whose point - // is further away from the start point (originalStart, modifiedStart) - if (diagonal === diagonalForwardStart || (diagonal < diagonalForwardEnd && forwardPoints[diagonal - 1] < forwardPoints[diagonal + 1])) { - originalIndex = forwardPoints[diagonal + 1]; - } - else { - originalIndex = forwardPoints[diagonal - 1] + 1; - } - modifiedIndex = originalIndex - (diagonal - diagonalForwardBase) - diagonalForwardOffset; - // Save the current originalIndex so we can test for false overlap in step 3 - tempOriginalIndex = originalIndex; - // STEP 2: We can continue to extend the furthest reaching point in the present diagonal - // so long as the elements are equal. - while (originalIndex < originalEnd && modifiedIndex < modifiedEnd && this.ElementsAreEqual(originalIndex + 1, modifiedIndex + 1)) { - originalIndex++; - modifiedIndex++; - } - forwardPoints[diagonal] = originalIndex; - if (originalIndex + modifiedIndex > furthestOriginalIndex + furthestModifiedIndex) { - furthestOriginalIndex = originalIndex; - furthestModifiedIndex = modifiedIndex; - } - // STEP 3: If delta is odd (overlap first happens on forward when delta is odd) - // and diagonal is in the range of reverse diagonals computed for numDifferences-1 - // (the previous iteration; we haven't computed reverse diagonals for numDifferences yet) - // then check for overlap. - if (!deltaIsEven && Math.abs(diagonal - diagonalReverseBase) <= (numDifferences - 1)) { - if (originalIndex >= reversePoints[diagonal]) { - midOriginalArr[0] = originalIndex; - midModifiedArr[0] = modifiedIndex; - if (tempOriginalIndex <= reversePoints[diagonal] && MaxDifferencesHistory > 0 && numDifferences <= (MaxDifferencesHistory + 1)) { - // BINGO! We overlapped, and we have the full trace in memory! - return this.WALKTRACE(diagonalForwardBase, diagonalForwardStart, diagonalForwardEnd, diagonalForwardOffset, diagonalReverseBase, diagonalReverseStart, diagonalReverseEnd, diagonalReverseOffset, forwardPoints, reversePoints, originalIndex, originalEnd, midOriginalArr, modifiedIndex, modifiedEnd, midModifiedArr, deltaIsEven, quitEarlyArr); - } - else { - // Either false overlap, or we didn't have enough memory for the full trace - // Just return the recursion point - return null; - } - } - } - } - // Check to see if we should be quitting early, before moving on to the next iteration. - var matchLengthOfLongest = ((furthestOriginalIndex - originalStart) + (furthestModifiedIndex - modifiedStart) - numDifferences) / 2; - if (this.ContinueProcessingPredicate !== null && !this.ContinueProcessingPredicate(furthestOriginalIndex, this.OriginalSequence, matchLengthOfLongest)) { - // We can't finish, so skip ahead to generating a result from what we have. - quitEarlyArr[0] = true; - // Use the furthest distance we got in the forward direction. - midOriginalArr[0] = furthestOriginalIndex; - midModifiedArr[0] = furthestModifiedIndex; - if (matchLengthOfLongest > 0 && MaxDifferencesHistory > 0 && numDifferences <= (MaxDifferencesHistory + 1)) { - // Enough of the history is in memory to walk it backwards - return this.WALKTRACE(diagonalForwardBase, diagonalForwardStart, diagonalForwardEnd, diagonalForwardOffset, diagonalReverseBase, diagonalReverseStart, diagonalReverseEnd, diagonalReverseOffset, forwardPoints, reversePoints, originalIndex, originalEnd, midOriginalArr, modifiedIndex, modifiedEnd, midModifiedArr, deltaIsEven, quitEarlyArr); - } - else { - // We didn't actually remember enough of the history. - //Since we are quiting the diff early, we need to shift back the originalStart and modified start - //back into the boundary limits since we decremented their value above beyond the boundary limit. - originalStart++; - modifiedStart++; - return [ - new _diffChange_js__WEBPACK_IMPORTED_MODULE_0__["DiffChange"](originalStart, originalEnd - originalStart + 1, modifiedStart, modifiedEnd - modifiedStart + 1) - ]; - } - } - // Run the algorithm in the reverse direction - diagonalReverseStart = this.ClipDiagonalBound(diagonalReverseBase - numDifferences, numDifferences, diagonalReverseBase, numDiagonals); - diagonalReverseEnd = this.ClipDiagonalBound(diagonalReverseBase + numDifferences, numDifferences, diagonalReverseBase, numDiagonals); - for (diagonal = diagonalReverseStart; diagonal <= diagonalReverseEnd; diagonal += 2) { - // STEP 1: We extend the furthest reaching point in the present diagonal - // by looking at the diagonals above and below and picking the one whose point - // is further away from the start point (originalEnd, modifiedEnd) - if (diagonal === diagonalReverseStart || (diagonal < diagonalReverseEnd && reversePoints[diagonal - 1] >= reversePoints[diagonal + 1])) { - originalIndex = reversePoints[diagonal + 1] - 1; - } - else { - originalIndex = reversePoints[diagonal - 1]; - } - modifiedIndex = originalIndex - (diagonal - diagonalReverseBase) - diagonalReverseOffset; - // Save the current originalIndex so we can test for false overlap - tempOriginalIndex = originalIndex; - // STEP 2: We can continue to extend the furthest reaching point in the present diagonal - // as long as the elements are equal. - while (originalIndex > originalStart && modifiedIndex > modifiedStart && this.ElementsAreEqual(originalIndex, modifiedIndex)) { - originalIndex--; - modifiedIndex--; - } - reversePoints[diagonal] = originalIndex; - // STEP 4: If delta is even (overlap first happens on reverse when delta is even) - // and diagonal is in the range of forward diagonals computed for numDifferences - // then check for overlap. - if (deltaIsEven && Math.abs(diagonal - diagonalForwardBase) <= numDifferences) { - if (originalIndex <= forwardPoints[diagonal]) { - midOriginalArr[0] = originalIndex; - midModifiedArr[0] = modifiedIndex; - if (tempOriginalIndex >= forwardPoints[diagonal] && MaxDifferencesHistory > 0 && numDifferences <= (MaxDifferencesHistory + 1)) { - // BINGO! We overlapped, and we have the full trace in memory! - return this.WALKTRACE(diagonalForwardBase, diagonalForwardStart, diagonalForwardEnd, diagonalForwardOffset, diagonalReverseBase, diagonalReverseStart, diagonalReverseEnd, diagonalReverseOffset, forwardPoints, reversePoints, originalIndex, originalEnd, midOriginalArr, modifiedIndex, modifiedEnd, midModifiedArr, deltaIsEven, quitEarlyArr); - } - else { - // Either false overlap, or we didn't have enough memory for the full trace - // Just return the recursion point - return null; - } - } - } - } - // Save current vectors to history before the next iteration - if (numDifferences <= MaxDifferencesHistory) { - // We are allocating space for one extra int, which we fill with - // the index of the diagonal base index - var temp = new Array(diagonalForwardEnd - diagonalForwardStart + 2); - temp[0] = diagonalForwardBase - diagonalForwardStart + 1; - MyArray.Copy(forwardPoints, diagonalForwardStart, temp, 1, diagonalForwardEnd - diagonalForwardStart + 1); - this.m_forwardHistory.push(temp); - temp = new Array(diagonalReverseEnd - diagonalReverseStart + 2); - temp[0] = diagonalReverseBase - diagonalReverseStart + 1; - MyArray.Copy(reversePoints, diagonalReverseStart, temp, 1, diagonalReverseEnd - diagonalReverseStart + 1); - this.m_reverseHistory.push(temp); - } - } - // If we got here, then we have the full trace in history. We just have to convert it to a change list - // NOTE: This part is a bit messy - return this.WALKTRACE(diagonalForwardBase, diagonalForwardStart, diagonalForwardEnd, diagonalForwardOffset, diagonalReverseBase, diagonalReverseStart, diagonalReverseEnd, diagonalReverseOffset, forwardPoints, reversePoints, originalIndex, originalEnd, midOriginalArr, modifiedIndex, modifiedEnd, midModifiedArr, deltaIsEven, quitEarlyArr); - }; - /** - * Shifts the given changes to provide a more intuitive diff. - * While the first element in a diff matches the first element after the diff, - * we shift the diff down. - * - * @param changes The list of changes to shift - * @returns The shifted changes - */ - LcsDiff.prototype.PrettifyChanges = function (changes) { - // Shift all the changes down first - for (var i = 0; i < changes.length; i++) { - var change = changes[i]; - var originalStop = (i < changes.length - 1) ? changes[i + 1].originalStart : this.OriginalSequence.getLength(); - var modifiedStop = (i < changes.length - 1) ? changes[i + 1].modifiedStart : this.ModifiedSequence.getLength(); - var checkOriginal = change.originalLength > 0; - var checkModified = change.modifiedLength > 0; - while (change.originalStart + change.originalLength < originalStop && - change.modifiedStart + change.modifiedLength < modifiedStop && - (!checkOriginal || this.OriginalElementsAreEqual(change.originalStart, change.originalStart + change.originalLength)) && - (!checkModified || this.ModifiedElementsAreEqual(change.modifiedStart, change.modifiedStart + change.modifiedLength))) { - change.originalStart++; - change.modifiedStart++; - } - var mergedChangeArr = [null]; - if (i < changes.length - 1 && this.ChangesOverlap(changes[i], changes[i + 1], mergedChangeArr)) { - changes[i] = mergedChangeArr[0]; - changes.splice(i + 1, 1); - i--; - continue; - } - } - // Shift changes back up until we hit empty or whitespace-only lines - for (var i = changes.length - 1; i >= 0; i--) { - var change = changes[i]; - var originalStop = 0; - var modifiedStop = 0; - if (i > 0) { - var prevChange = changes[i - 1]; - if (prevChange.originalLength > 0) { - originalStop = prevChange.originalStart + prevChange.originalLength; - } - if (prevChange.modifiedLength > 0) { - modifiedStop = prevChange.modifiedStart + prevChange.modifiedLength; - } - } - var checkOriginal = change.originalLength > 0; - var checkModified = change.modifiedLength > 0; - var bestDelta = 0; - var bestScore = this._boundaryScore(change.originalStart, change.originalLength, change.modifiedStart, change.modifiedLength); - for (var delta = 1;; delta++) { - var originalStart = change.originalStart - delta; - var modifiedStart = change.modifiedStart - delta; - if (originalStart < originalStop || modifiedStart < modifiedStop) { - break; - } - if (checkOriginal && !this.OriginalElementsAreEqual(originalStart, originalStart + change.originalLength)) { - break; - } - if (checkModified && !this.ModifiedElementsAreEqual(modifiedStart, modifiedStart + change.modifiedLength)) { - break; - } - var score = this._boundaryScore(originalStart, change.originalLength, modifiedStart, change.modifiedLength); - if (score > bestScore) { - bestScore = score; - bestDelta = delta; - } - } - change.originalStart -= bestDelta; - change.modifiedStart -= bestDelta; - } - return changes; - }; - LcsDiff.prototype._OriginalIsBoundary = function (index) { - if (index <= 0 || index >= this.OriginalSequence.getLength() - 1) { - return true; - } - var element = this.OriginalSequence.getElementAtIndex(index); - return (typeof element === 'string' && /^\s*$/.test(element)); - }; - LcsDiff.prototype._OriginalRegionIsBoundary = function (originalStart, originalLength) { - if (this._OriginalIsBoundary(originalStart) || this._OriginalIsBoundary(originalStart - 1)) { - return true; - } - if (originalLength > 0) { - var originalEnd = originalStart + originalLength; - if (this._OriginalIsBoundary(originalEnd - 1) || this._OriginalIsBoundary(originalEnd)) { - return true; - } - } - return false; - }; - LcsDiff.prototype._ModifiedIsBoundary = function (index) { - if (index <= 0 || index >= this.ModifiedSequence.getLength() - 1) { - return true; - } - var element = this.ModifiedSequence.getElementAtIndex(index); - return (typeof element === 'string' && /^\s*$/.test(element)); - }; - LcsDiff.prototype._ModifiedRegionIsBoundary = function (modifiedStart, modifiedLength) { - if (this._ModifiedIsBoundary(modifiedStart) || this._ModifiedIsBoundary(modifiedStart - 1)) { - return true; - } - if (modifiedLength > 0) { - var modifiedEnd = modifiedStart + modifiedLength; - if (this._ModifiedIsBoundary(modifiedEnd - 1) || this._ModifiedIsBoundary(modifiedEnd)) { - return true; - } - } - return false; - }; - LcsDiff.prototype._boundaryScore = function (originalStart, originalLength, modifiedStart, modifiedLength) { - var originalScore = (this._OriginalRegionIsBoundary(originalStart, originalLength) ? 1 : 0); - var modifiedScore = (this._ModifiedRegionIsBoundary(modifiedStart, modifiedLength) ? 1 : 0); - return (originalScore + modifiedScore); - }; - /** - * Concatenates the two input DiffChange lists and returns the resulting - * list. - * @param The left changes - * @param The right changes - * @returns The concatenated list - */ - LcsDiff.prototype.ConcatenateChanges = function (left, right) { - var mergedChangeArr = []; - if (left.length === 0 || right.length === 0) { - return (right.length > 0) ? right : left; - } - else if (this.ChangesOverlap(left[left.length - 1], right[0], mergedChangeArr)) { - // Since we break the problem down recursively, it is possible that we - // might recurse in the middle of a change thereby splitting it into - // two changes. Here in the combining stage, we detect and fuse those - // changes back together - var result = new Array(left.length + right.length - 1); - MyArray.Copy(left, 0, result, 0, left.length - 1); - result[left.length - 1] = mergedChangeArr[0]; - MyArray.Copy(right, 1, result, left.length, right.length - 1); - return result; - } - else { - var result = new Array(left.length + right.length); - MyArray.Copy(left, 0, result, 0, left.length); - MyArray.Copy(right, 0, result, left.length, right.length); - return result; - } - }; - /** - * Returns true if the two changes overlap and can be merged into a single - * change - * @param left The left change - * @param right The right change - * @param mergedChange The merged change if the two overlap, null otherwise - * @returns True if the two changes overlap - */ - LcsDiff.prototype.ChangesOverlap = function (left, right, mergedChangeArr) { - Debug.Assert(left.originalStart <= right.originalStart, 'Left change is not less than or equal to right change'); - Debug.Assert(left.modifiedStart <= right.modifiedStart, 'Left change is not less than or equal to right change'); - if (left.originalStart + left.originalLength >= right.originalStart || left.modifiedStart + left.modifiedLength >= right.modifiedStart) { - var originalStart = left.originalStart; - var originalLength = left.originalLength; - var modifiedStart = left.modifiedStart; - var modifiedLength = left.modifiedLength; - if (left.originalStart + left.originalLength >= right.originalStart) { - originalLength = right.originalStart + right.originalLength - left.originalStart; - } - if (left.modifiedStart + left.modifiedLength >= right.modifiedStart) { - modifiedLength = right.modifiedStart + right.modifiedLength - left.modifiedStart; - } - mergedChangeArr[0] = new _diffChange_js__WEBPACK_IMPORTED_MODULE_0__["DiffChange"](originalStart, originalLength, modifiedStart, modifiedLength); - return true; - } - else { - mergedChangeArr[0] = null; - return false; - } - }; - /** - * Helper method used to clip a diagonal index to the range of valid - * diagonals. This also decides whether or not the diagonal index, - * if it exceeds the boundary, should be clipped to the boundary or clipped - * one inside the boundary depending on the Even/Odd status of the boundary - * and numDifferences. - * @param diagonal The index of the diagonal to clip. - * @param numDifferences The current number of differences being iterated upon. - * @param diagonalBaseIndex The base reference diagonal. - * @param numDiagonals The total number of diagonals. - * @returns The clipped diagonal index. - */ - LcsDiff.prototype.ClipDiagonalBound = function (diagonal, numDifferences, diagonalBaseIndex, numDiagonals) { - if (diagonal >= 0 && diagonal < numDiagonals) { - // Nothing to clip, its in range - return diagonal; - } - // diagonalsBelow: The number of diagonals below the reference diagonal - // diagonalsAbove: The number of diagonals above the reference diagonal - var diagonalsBelow = diagonalBaseIndex; - var diagonalsAbove = numDiagonals - diagonalBaseIndex - 1; - var diffEven = (numDifferences % 2 === 0); - if (diagonal < 0) { - var lowerBoundEven = (diagonalsBelow % 2 === 0); - return (diffEven === lowerBoundEven) ? 0 : 1; - } - else { - var upperBoundEven = (diagonalsAbove % 2 === 0); - return (diffEven === upperBoundEven) ? numDiagonals - 1 : numDiagonals - 2; - } - }; - return LcsDiff; -}()); - +/* harmony import */ var _hash_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../hash.js */ "./node_modules/monaco-editor/esm/vs/base/common/hash.js"); +/*--------------------------------------------------------------------------------------------- + * Copyright (c) Microsoft Corporation. All rights reserved. + * Licensed under the MIT License. See License.txt in the project root for license information. + *--------------------------------------------------------------------------------------------*/ + + +var StringDiffSequence = /** @class */ (function () { + function StringDiffSequence(source) { + this.source = source; + } + StringDiffSequence.prototype.getElements = function () { + var source = this.source; + var characters = new Int32Array(source.length); + for (var i = 0, len = source.length; i < len; i++) { + characters[i] = source.charCodeAt(i); + } + return characters; + }; + return StringDiffSequence; +}()); + +function stringDiff(original, modified, pretty) { + return new LcsDiff(new StringDiffSequence(original), new StringDiffSequence(modified)).ComputeDiff(pretty).changes; +} +// +// The code below has been ported from a C# implementation in VS +// +var Debug = /** @class */ (function () { + function Debug() { + } + Debug.Assert = function (condition, message) { + if (!condition) { + throw new Error(message); + } + }; + return Debug; +}()); + +var MyArray = /** @class */ (function () { + function MyArray() { + } + /** + * Copies a range of elements from an Array starting at the specified source index and pastes + * them to another Array starting at the specified destination index. The length and the indexes + * are specified as 64-bit integers. + * sourceArray: + * The Array that contains the data to copy. + * sourceIndex: + * A 64-bit integer that represents the index in the sourceArray at which copying begins. + * destinationArray: + * The Array that receives the data. + * destinationIndex: + * A 64-bit integer that represents the index in the destinationArray at which storing begins. + * length: + * A 64-bit integer that represents the number of elements to copy. + */ + MyArray.Copy = function (sourceArray, sourceIndex, destinationArray, destinationIndex, length) { + for (var i = 0; i < length; i++) { + destinationArray[destinationIndex + i] = sourceArray[sourceIndex + i]; + } + }; + MyArray.Copy2 = function (sourceArray, sourceIndex, destinationArray, destinationIndex, length) { + for (var i = 0; i < length; i++) { + destinationArray[destinationIndex + i] = sourceArray[sourceIndex + i]; + } + }; + return MyArray; +}()); + +/** + * A utility class which helps to create the set of DiffChanges from + * a difference operation. This class accepts original DiffElements and + * modified DiffElements that are involved in a particular change. The + * MarktNextChange() method can be called to mark the separation between + * distinct changes. At the end, the Changes property can be called to retrieve + * the constructed changes. + */ +var DiffChangeHelper = /** @class */ (function () { + /** + * Constructs a new DiffChangeHelper for the given DiffSequences. + */ + function DiffChangeHelper() { + this.m_changes = []; + this.m_originalStart = 1073741824 /* MAX_SAFE_SMALL_INTEGER */; + this.m_modifiedStart = 1073741824 /* MAX_SAFE_SMALL_INTEGER */; + this.m_originalCount = 0; + this.m_modifiedCount = 0; + } + /** + * Marks the beginning of the next change in the set of differences. + */ + DiffChangeHelper.prototype.MarkNextChange = function () { + // Only add to the list if there is something to add + if (this.m_originalCount > 0 || this.m_modifiedCount > 0) { + // Add the new change to our list + this.m_changes.push(new _diffChange_js__WEBPACK_IMPORTED_MODULE_0__["DiffChange"](this.m_originalStart, this.m_originalCount, this.m_modifiedStart, this.m_modifiedCount)); + } + // Reset for the next change + this.m_originalCount = 0; + this.m_modifiedCount = 0; + this.m_originalStart = 1073741824 /* MAX_SAFE_SMALL_INTEGER */; + this.m_modifiedStart = 1073741824 /* MAX_SAFE_SMALL_INTEGER */; + }; + /** + * Adds the original element at the given position to the elements + * affected by the current change. The modified index gives context + * to the change position with respect to the original sequence. + * @param originalIndex The index of the original element to add. + * @param modifiedIndex The index of the modified element that provides corresponding position in the modified sequence. + */ + DiffChangeHelper.prototype.AddOriginalElement = function (originalIndex, modifiedIndex) { + // The 'true' start index is the smallest of the ones we've seen + this.m_originalStart = Math.min(this.m_originalStart, originalIndex); + this.m_modifiedStart = Math.min(this.m_modifiedStart, modifiedIndex); + this.m_originalCount++; + }; + /** + * Adds the modified element at the given position to the elements + * affected by the current change. The original index gives context + * to the change position with respect to the modified sequence. + * @param originalIndex The index of the original element that provides corresponding position in the original sequence. + * @param modifiedIndex The index of the modified element to add. + */ + DiffChangeHelper.prototype.AddModifiedElement = function (originalIndex, modifiedIndex) { + // The 'true' start index is the smallest of the ones we've seen + this.m_originalStart = Math.min(this.m_originalStart, originalIndex); + this.m_modifiedStart = Math.min(this.m_modifiedStart, modifiedIndex); + this.m_modifiedCount++; + }; + /** + * Retrieves all of the changes marked by the class. + */ + DiffChangeHelper.prototype.getChanges = function () { + if (this.m_originalCount > 0 || this.m_modifiedCount > 0) { + // Finish up on whatever is left + this.MarkNextChange(); + } + return this.m_changes; + }; + /** + * Retrieves all of the changes marked by the class in the reverse order + */ + DiffChangeHelper.prototype.getReverseChanges = function () { + if (this.m_originalCount > 0 || this.m_modifiedCount > 0) { + // Finish up on whatever is left + this.MarkNextChange(); + } + this.m_changes.reverse(); + return this.m_changes; + }; + return DiffChangeHelper; +}()); +/** + * An implementation of the difference algorithm described in + * "An O(ND) Difference Algorithm and its variations" by Eugene W. Myers + */ +var LcsDiff = /** @class */ (function () { + /** + * Constructs the DiffFinder + */ + function LcsDiff(originalSequence, modifiedSequence, continueProcessingPredicate) { + if (continueProcessingPredicate === void 0) { continueProcessingPredicate = null; } + this.ContinueProcessingPredicate = continueProcessingPredicate; + var _a = LcsDiff._getElements(originalSequence), originalStringElements = _a[0], originalElementsOrHash = _a[1], originalHasStrings = _a[2]; + var _b = LcsDiff._getElements(modifiedSequence), modifiedStringElements = _b[0], modifiedElementsOrHash = _b[1], modifiedHasStrings = _b[2]; + this._hasStrings = (originalHasStrings && modifiedHasStrings); + this._originalStringElements = originalStringElements; + this._originalElementsOrHash = originalElementsOrHash; + this._modifiedStringElements = modifiedStringElements; + this._modifiedElementsOrHash = modifiedElementsOrHash; + this.m_forwardHistory = []; + this.m_reverseHistory = []; + } + LcsDiff._isStringArray = function (arr) { + return (arr.length > 0 && typeof arr[0] === 'string'); + }; + LcsDiff._getElements = function (sequence) { + var elements = sequence.getElements(); + if (LcsDiff._isStringArray(elements)) { + var hashes = new Int32Array(elements.length); + for (var i = 0, len = elements.length; i < len; i++) { + hashes[i] = Object(_hash_js__WEBPACK_IMPORTED_MODULE_1__["stringHash"])(elements[i], 0); + } + return [elements, hashes, true]; + } + if (elements instanceof Int32Array) { + return [[], elements, false]; + } + return [[], new Int32Array(elements), false]; + }; + LcsDiff.prototype.ElementsAreEqual = function (originalIndex, newIndex) { + if (this._originalElementsOrHash[originalIndex] !== this._modifiedElementsOrHash[newIndex]) { + return false; + } + return (this._hasStrings ? this._originalStringElements[originalIndex] === this._modifiedStringElements[newIndex] : true); + }; + LcsDiff.prototype.OriginalElementsAreEqual = function (index1, index2) { + if (this._originalElementsOrHash[index1] !== this._originalElementsOrHash[index2]) { + return false; + } + return (this._hasStrings ? this._originalStringElements[index1] === this._originalStringElements[index2] : true); + }; + LcsDiff.prototype.ModifiedElementsAreEqual = function (index1, index2) { + if (this._modifiedElementsOrHash[index1] !== this._modifiedElementsOrHash[index2]) { + return false; + } + return (this._hasStrings ? this._modifiedStringElements[index1] === this._modifiedStringElements[index2] : true); + }; + LcsDiff.prototype.ComputeDiff = function (pretty) { + return this._ComputeDiff(0, this._originalElementsOrHash.length - 1, 0, this._modifiedElementsOrHash.length - 1, pretty); + }; + /** + * Computes the differences between the original and modified input + * sequences on the bounded range. + * @returns An array of the differences between the two input sequences. + */ + LcsDiff.prototype._ComputeDiff = function (originalStart, originalEnd, modifiedStart, modifiedEnd, pretty) { + var quitEarlyArr = [false]; + var changes = this.ComputeDiffRecursive(originalStart, originalEnd, modifiedStart, modifiedEnd, quitEarlyArr); + if (pretty) { + // We have to clean up the computed diff to be more intuitive + // but it turns out this cannot be done correctly until the entire set + // of diffs have been computed + changes = this.PrettifyChanges(changes); + } + return { + quitEarly: quitEarlyArr[0], + changes: changes + }; + }; + /** + * Private helper method which computes the differences on the bounded range + * recursively. + * @returns An array of the differences between the two input sequences. + */ + LcsDiff.prototype.ComputeDiffRecursive = function (originalStart, originalEnd, modifiedStart, modifiedEnd, quitEarlyArr) { + quitEarlyArr[0] = false; + // Find the start of the differences + while (originalStart <= originalEnd && modifiedStart <= modifiedEnd && this.ElementsAreEqual(originalStart, modifiedStart)) { + originalStart++; + modifiedStart++; + } + // Find the end of the differences + while (originalEnd >= originalStart && modifiedEnd >= modifiedStart && this.ElementsAreEqual(originalEnd, modifiedEnd)) { + originalEnd--; + modifiedEnd--; + } + // In the special case where we either have all insertions or all deletions or the sequences are identical + if (originalStart > originalEnd || modifiedStart > modifiedEnd) { + var changes = void 0; + if (modifiedStart <= modifiedEnd) { + Debug.Assert(originalStart === originalEnd + 1, 'originalStart should only be one more than originalEnd'); + // All insertions + changes = [ + new _diffChange_js__WEBPACK_IMPORTED_MODULE_0__["DiffChange"](originalStart, 0, modifiedStart, modifiedEnd - modifiedStart + 1) + ]; + } + else if (originalStart <= originalEnd) { + Debug.Assert(modifiedStart === modifiedEnd + 1, 'modifiedStart should only be one more than modifiedEnd'); + // All deletions + changes = [ + new _diffChange_js__WEBPACK_IMPORTED_MODULE_0__["DiffChange"](originalStart, originalEnd - originalStart + 1, modifiedStart, 0) + ]; + } + else { + Debug.Assert(originalStart === originalEnd + 1, 'originalStart should only be one more than originalEnd'); + Debug.Assert(modifiedStart === modifiedEnd + 1, 'modifiedStart should only be one more than modifiedEnd'); + // Identical sequences - No differences + changes = []; + } + return changes; + } + // This problem can be solved using the Divide-And-Conquer technique. + var midOriginalArr = [0]; + var midModifiedArr = [0]; + var result = this.ComputeRecursionPoint(originalStart, originalEnd, modifiedStart, modifiedEnd, midOriginalArr, midModifiedArr, quitEarlyArr); + var midOriginal = midOriginalArr[0]; + var midModified = midModifiedArr[0]; + if (result !== null) { + // Result is not-null when there was enough memory to compute the changes while + // searching for the recursion point + return result; + } + else if (!quitEarlyArr[0]) { + // We can break the problem down recursively by finding the changes in the + // First Half: (originalStart, modifiedStart) to (midOriginal, midModified) + // Second Half: (midOriginal + 1, minModified + 1) to (originalEnd, modifiedEnd) + // NOTE: ComputeDiff() is inclusive, therefore the second range starts on the next point + var leftChanges = this.ComputeDiffRecursive(originalStart, midOriginal, modifiedStart, midModified, quitEarlyArr); + var rightChanges = []; + if (!quitEarlyArr[0]) { + rightChanges = this.ComputeDiffRecursive(midOriginal + 1, originalEnd, midModified + 1, modifiedEnd, quitEarlyArr); + } + else { + // We did't have time to finish the first half, so we don't have time to compute this half. + // Consider the entire rest of the sequence different. + rightChanges = [ + new _diffChange_js__WEBPACK_IMPORTED_MODULE_0__["DiffChange"](midOriginal + 1, originalEnd - (midOriginal + 1) + 1, midModified + 1, modifiedEnd - (midModified + 1) + 1) + ]; + } + return this.ConcatenateChanges(leftChanges, rightChanges); + } + // If we hit here, we quit early, and so can't return anything meaningful + return [ + new _diffChange_js__WEBPACK_IMPORTED_MODULE_0__["DiffChange"](originalStart, originalEnd - originalStart + 1, modifiedStart, modifiedEnd - modifiedStart + 1) + ]; + }; + LcsDiff.prototype.WALKTRACE = function (diagonalForwardBase, diagonalForwardStart, diagonalForwardEnd, diagonalForwardOffset, diagonalReverseBase, diagonalReverseStart, diagonalReverseEnd, diagonalReverseOffset, forwardPoints, reversePoints, originalIndex, originalEnd, midOriginalArr, modifiedIndex, modifiedEnd, midModifiedArr, deltaIsEven, quitEarlyArr) { + var forwardChanges = null; + var reverseChanges = null; + // First, walk backward through the forward diagonals history + var changeHelper = new DiffChangeHelper(); + var diagonalMin = diagonalForwardStart; + var diagonalMax = diagonalForwardEnd; + var diagonalRelative = (midOriginalArr[0] - midModifiedArr[0]) - diagonalForwardOffset; + var lastOriginalIndex = -1073741824 /* MIN_SAFE_SMALL_INTEGER */; + var historyIndex = this.m_forwardHistory.length - 1; + do { + // Get the diagonal index from the relative diagonal number + var diagonal = diagonalRelative + diagonalForwardBase; + // Figure out where we came from + if (diagonal === diagonalMin || (diagonal < diagonalMax && forwardPoints[diagonal - 1] < forwardPoints[diagonal + 1])) { + // Vertical line (the element is an insert) + originalIndex = forwardPoints[diagonal + 1]; + modifiedIndex = originalIndex - diagonalRelative - diagonalForwardOffset; + if (originalIndex < lastOriginalIndex) { + changeHelper.MarkNextChange(); + } + lastOriginalIndex = originalIndex; + changeHelper.AddModifiedElement(originalIndex + 1, modifiedIndex); + diagonalRelative = (diagonal + 1) - diagonalForwardBase; //Setup for the next iteration + } + else { + // Horizontal line (the element is a deletion) + originalIndex = forwardPoints[diagonal - 1] + 1; + modifiedIndex = originalIndex - diagonalRelative - diagonalForwardOffset; + if (originalIndex < lastOriginalIndex) { + changeHelper.MarkNextChange(); + } + lastOriginalIndex = originalIndex - 1; + changeHelper.AddOriginalElement(originalIndex, modifiedIndex + 1); + diagonalRelative = (diagonal - 1) - diagonalForwardBase; //Setup for the next iteration + } + if (historyIndex >= 0) { + forwardPoints = this.m_forwardHistory[historyIndex]; + diagonalForwardBase = forwardPoints[0]; //We stored this in the first spot + diagonalMin = 1; + diagonalMax = forwardPoints.length - 1; + } + } while (--historyIndex >= -1); + // Ironically, we get the forward changes as the reverse of the + // order we added them since we technically added them backwards + forwardChanges = changeHelper.getReverseChanges(); + if (quitEarlyArr[0]) { + // TODO: Calculate a partial from the reverse diagonals. + // For now, just assume everything after the midOriginal/midModified point is a diff + var originalStartPoint = midOriginalArr[0] + 1; + var modifiedStartPoint = midModifiedArr[0] + 1; + if (forwardChanges !== null && forwardChanges.length > 0) { + var lastForwardChange = forwardChanges[forwardChanges.length - 1]; + originalStartPoint = Math.max(originalStartPoint, lastForwardChange.getOriginalEnd()); + modifiedStartPoint = Math.max(modifiedStartPoint, lastForwardChange.getModifiedEnd()); + } + reverseChanges = [ + new _diffChange_js__WEBPACK_IMPORTED_MODULE_0__["DiffChange"](originalStartPoint, originalEnd - originalStartPoint + 1, modifiedStartPoint, modifiedEnd - modifiedStartPoint + 1) + ]; + } + else { + // Now walk backward through the reverse diagonals history + changeHelper = new DiffChangeHelper(); + diagonalMin = diagonalReverseStart; + diagonalMax = diagonalReverseEnd; + diagonalRelative = (midOriginalArr[0] - midModifiedArr[0]) - diagonalReverseOffset; + lastOriginalIndex = 1073741824 /* MAX_SAFE_SMALL_INTEGER */; + historyIndex = (deltaIsEven) ? this.m_reverseHistory.length - 1 : this.m_reverseHistory.length - 2; + do { + // Get the diagonal index from the relative diagonal number + var diagonal = diagonalRelative + diagonalReverseBase; + // Figure out where we came from + if (diagonal === diagonalMin || (diagonal < diagonalMax && reversePoints[diagonal - 1] >= reversePoints[diagonal + 1])) { + // Horizontal line (the element is a deletion)) + originalIndex = reversePoints[diagonal + 1] - 1; + modifiedIndex = originalIndex - diagonalRelative - diagonalReverseOffset; + if (originalIndex > lastOriginalIndex) { + changeHelper.MarkNextChange(); + } + lastOriginalIndex = originalIndex + 1; + changeHelper.AddOriginalElement(originalIndex + 1, modifiedIndex + 1); + diagonalRelative = (diagonal + 1) - diagonalReverseBase; //Setup for the next iteration + } + else { + // Vertical line (the element is an insertion) + originalIndex = reversePoints[diagonal - 1]; + modifiedIndex = originalIndex - diagonalRelative - diagonalReverseOffset; + if (originalIndex > lastOriginalIndex) { + changeHelper.MarkNextChange(); + } + lastOriginalIndex = originalIndex; + changeHelper.AddModifiedElement(originalIndex + 1, modifiedIndex + 1); + diagonalRelative = (diagonal - 1) - diagonalReverseBase; //Setup for the next iteration + } + if (historyIndex >= 0) { + reversePoints = this.m_reverseHistory[historyIndex]; + diagonalReverseBase = reversePoints[0]; //We stored this in the first spot + diagonalMin = 1; + diagonalMax = reversePoints.length - 1; + } + } while (--historyIndex >= -1); + // There are cases where the reverse history will find diffs that + // are correct, but not intuitive, so we need shift them. + reverseChanges = changeHelper.getChanges(); + } + return this.ConcatenateChanges(forwardChanges, reverseChanges); + }; + /** + * Given the range to compute the diff on, this method finds the point: + * (midOriginal, midModified) + * that exists in the middle of the LCS of the two sequences and + * is the point at which the LCS problem may be broken down recursively. + * This method will try to keep the LCS trace in memory. If the LCS recursion + * point is calculated and the full trace is available in memory, then this method + * will return the change list. + * @param originalStart The start bound of the original sequence range + * @param originalEnd The end bound of the original sequence range + * @param modifiedStart The start bound of the modified sequence range + * @param modifiedEnd The end bound of the modified sequence range + * @param midOriginal The middle point of the original sequence range + * @param midModified The middle point of the modified sequence range + * @returns The diff changes, if available, otherwise null + */ + LcsDiff.prototype.ComputeRecursionPoint = function (originalStart, originalEnd, modifiedStart, modifiedEnd, midOriginalArr, midModifiedArr, quitEarlyArr) { + var originalIndex = 0, modifiedIndex = 0; + var diagonalForwardStart = 0, diagonalForwardEnd = 0; + var diagonalReverseStart = 0, diagonalReverseEnd = 0; + // To traverse the edit graph and produce the proper LCS, our actual + // start position is just outside the given boundary + originalStart--; + modifiedStart--; + // We set these up to make the compiler happy, but they will + // be replaced before we return with the actual recursion point + midOriginalArr[0] = 0; + midModifiedArr[0] = 0; + // Clear out the history + this.m_forwardHistory = []; + this.m_reverseHistory = []; + // Each cell in the two arrays corresponds to a diagonal in the edit graph. + // The integer value in the cell represents the originalIndex of the furthest + // reaching point found so far that ends in that diagonal. + // The modifiedIndex can be computed mathematically from the originalIndex and the diagonal number. + var maxDifferences = (originalEnd - originalStart) + (modifiedEnd - modifiedStart); + var numDiagonals = maxDifferences + 1; + var forwardPoints = new Int32Array(numDiagonals); + var reversePoints = new Int32Array(numDiagonals); + // diagonalForwardBase: Index into forwardPoints of the diagonal which passes through (originalStart, modifiedStart) + // diagonalReverseBase: Index into reversePoints of the diagonal which passes through (originalEnd, modifiedEnd) + var diagonalForwardBase = (modifiedEnd - modifiedStart); + var diagonalReverseBase = (originalEnd - originalStart); + // diagonalForwardOffset: Geometric offset which allows modifiedIndex to be computed from originalIndex and the + // diagonal number (relative to diagonalForwardBase) + // diagonalReverseOffset: Geometric offset which allows modifiedIndex to be computed from originalIndex and the + // diagonal number (relative to diagonalReverseBase) + var diagonalForwardOffset = (originalStart - modifiedStart); + var diagonalReverseOffset = (originalEnd - modifiedEnd); + // delta: The difference between the end diagonal and the start diagonal. This is used to relate diagonal numbers + // relative to the start diagonal with diagonal numbers relative to the end diagonal. + // The Even/Oddn-ness of this delta is important for determining when we should check for overlap + var delta = diagonalReverseBase - diagonalForwardBase; + var deltaIsEven = (delta % 2 === 0); + // Here we set up the start and end points as the furthest points found so far + // in both the forward and reverse directions, respectively + forwardPoints[diagonalForwardBase] = originalStart; + reversePoints[diagonalReverseBase] = originalEnd; + // Remember if we quit early, and thus need to do a best-effort result instead of a real result. + quitEarlyArr[0] = false; + // A couple of points: + // --With this method, we iterate on the number of differences between the two sequences. + // The more differences there actually are, the longer this will take. + // --Also, as the number of differences increases, we have to search on diagonals further + // away from the reference diagonal (which is diagonalForwardBase for forward, diagonalReverseBase for reverse). + // --We extend on even diagonals (relative to the reference diagonal) only when numDifferences + // is even and odd diagonals only when numDifferences is odd. + for (var numDifferences = 1; numDifferences <= (maxDifferences / 2) + 1; numDifferences++) { + var furthestOriginalIndex = 0; + var furthestModifiedIndex = 0; + // Run the algorithm in the forward direction + diagonalForwardStart = this.ClipDiagonalBound(diagonalForwardBase - numDifferences, numDifferences, diagonalForwardBase, numDiagonals); + diagonalForwardEnd = this.ClipDiagonalBound(diagonalForwardBase + numDifferences, numDifferences, diagonalForwardBase, numDiagonals); + for (var diagonal = diagonalForwardStart; diagonal <= diagonalForwardEnd; diagonal += 2) { + // STEP 1: We extend the furthest reaching point in the present diagonal + // by looking at the diagonals above and below and picking the one whose point + // is further away from the start point (originalStart, modifiedStart) + if (diagonal === diagonalForwardStart || (diagonal < diagonalForwardEnd && forwardPoints[diagonal - 1] < forwardPoints[diagonal + 1])) { + originalIndex = forwardPoints[diagonal + 1]; + } + else { + originalIndex = forwardPoints[diagonal - 1] + 1; + } + modifiedIndex = originalIndex - (diagonal - diagonalForwardBase) - diagonalForwardOffset; + // Save the current originalIndex so we can test for false overlap in step 3 + var tempOriginalIndex = originalIndex; + // STEP 2: We can continue to extend the furthest reaching point in the present diagonal + // so long as the elements are equal. + while (originalIndex < originalEnd && modifiedIndex < modifiedEnd && this.ElementsAreEqual(originalIndex + 1, modifiedIndex + 1)) { + originalIndex++; + modifiedIndex++; + } + forwardPoints[diagonal] = originalIndex; + if (originalIndex + modifiedIndex > furthestOriginalIndex + furthestModifiedIndex) { + furthestOriginalIndex = originalIndex; + furthestModifiedIndex = modifiedIndex; + } + // STEP 3: If delta is odd (overlap first happens on forward when delta is odd) + // and diagonal is in the range of reverse diagonals computed for numDifferences-1 + // (the previous iteration; we haven't computed reverse diagonals for numDifferences yet) + // then check for overlap. + if (!deltaIsEven && Math.abs(diagonal - diagonalReverseBase) <= (numDifferences - 1)) { + if (originalIndex >= reversePoints[diagonal]) { + midOriginalArr[0] = originalIndex; + midModifiedArr[0] = modifiedIndex; + if (tempOriginalIndex <= reversePoints[diagonal] && 1447 /* MaxDifferencesHistory */ > 0 && numDifferences <= (1447 /* MaxDifferencesHistory */ + 1)) { + // BINGO! We overlapped, and we have the full trace in memory! + return this.WALKTRACE(diagonalForwardBase, diagonalForwardStart, diagonalForwardEnd, diagonalForwardOffset, diagonalReverseBase, diagonalReverseStart, diagonalReverseEnd, diagonalReverseOffset, forwardPoints, reversePoints, originalIndex, originalEnd, midOriginalArr, modifiedIndex, modifiedEnd, midModifiedArr, deltaIsEven, quitEarlyArr); + } + else { + // Either false overlap, or we didn't have enough memory for the full trace + // Just return the recursion point + return null; + } + } + } + } + // Check to see if we should be quitting early, before moving on to the next iteration. + var matchLengthOfLongest = ((furthestOriginalIndex - originalStart) + (furthestModifiedIndex - modifiedStart) - numDifferences) / 2; + if (this.ContinueProcessingPredicate !== null && !this.ContinueProcessingPredicate(furthestOriginalIndex, matchLengthOfLongest)) { + // We can't finish, so skip ahead to generating a result from what we have. + quitEarlyArr[0] = true; + // Use the furthest distance we got in the forward direction. + midOriginalArr[0] = furthestOriginalIndex; + midModifiedArr[0] = furthestModifiedIndex; + if (matchLengthOfLongest > 0 && 1447 /* MaxDifferencesHistory */ > 0 && numDifferences <= (1447 /* MaxDifferencesHistory */ + 1)) { + // Enough of the history is in memory to walk it backwards + return this.WALKTRACE(diagonalForwardBase, diagonalForwardStart, diagonalForwardEnd, diagonalForwardOffset, diagonalReverseBase, diagonalReverseStart, diagonalReverseEnd, diagonalReverseOffset, forwardPoints, reversePoints, originalIndex, originalEnd, midOriginalArr, modifiedIndex, modifiedEnd, midModifiedArr, deltaIsEven, quitEarlyArr); + } + else { + // We didn't actually remember enough of the history. + //Since we are quiting the diff early, we need to shift back the originalStart and modified start + //back into the boundary limits since we decremented their value above beyond the boundary limit. + originalStart++; + modifiedStart++; + return [ + new _diffChange_js__WEBPACK_IMPORTED_MODULE_0__["DiffChange"](originalStart, originalEnd - originalStart + 1, modifiedStart, modifiedEnd - modifiedStart + 1) + ]; + } + } + // Run the algorithm in the reverse direction + diagonalReverseStart = this.ClipDiagonalBound(diagonalReverseBase - numDifferences, numDifferences, diagonalReverseBase, numDiagonals); + diagonalReverseEnd = this.ClipDiagonalBound(diagonalReverseBase + numDifferences, numDifferences, diagonalReverseBase, numDiagonals); + for (var diagonal = diagonalReverseStart; diagonal <= diagonalReverseEnd; diagonal += 2) { + // STEP 1: We extend the furthest reaching point in the present diagonal + // by looking at the diagonals above and below and picking the one whose point + // is further away from the start point (originalEnd, modifiedEnd) + if (diagonal === diagonalReverseStart || (diagonal < diagonalReverseEnd && reversePoints[diagonal - 1] >= reversePoints[diagonal + 1])) { + originalIndex = reversePoints[diagonal + 1] - 1; + } + else { + originalIndex = reversePoints[diagonal - 1]; + } + modifiedIndex = originalIndex - (diagonal - diagonalReverseBase) - diagonalReverseOffset; + // Save the current originalIndex so we can test for false overlap + var tempOriginalIndex = originalIndex; + // STEP 2: We can continue to extend the furthest reaching point in the present diagonal + // as long as the elements are equal. + while (originalIndex > originalStart && modifiedIndex > modifiedStart && this.ElementsAreEqual(originalIndex, modifiedIndex)) { + originalIndex--; + modifiedIndex--; + } + reversePoints[diagonal] = originalIndex; + // STEP 4: If delta is even (overlap first happens on reverse when delta is even) + // and diagonal is in the range of forward diagonals computed for numDifferences + // then check for overlap. + if (deltaIsEven && Math.abs(diagonal - diagonalForwardBase) <= numDifferences) { + if (originalIndex <= forwardPoints[diagonal]) { + midOriginalArr[0] = originalIndex; + midModifiedArr[0] = modifiedIndex; + if (tempOriginalIndex >= forwardPoints[diagonal] && 1447 /* MaxDifferencesHistory */ > 0 && numDifferences <= (1447 /* MaxDifferencesHistory */ + 1)) { + // BINGO! We overlapped, and we have the full trace in memory! + return this.WALKTRACE(diagonalForwardBase, diagonalForwardStart, diagonalForwardEnd, diagonalForwardOffset, diagonalReverseBase, diagonalReverseStart, diagonalReverseEnd, diagonalReverseOffset, forwardPoints, reversePoints, originalIndex, originalEnd, midOriginalArr, modifiedIndex, modifiedEnd, midModifiedArr, deltaIsEven, quitEarlyArr); + } + else { + // Either false overlap, or we didn't have enough memory for the full trace + // Just return the recursion point + return null; + } + } + } + } + // Save current vectors to history before the next iteration + if (numDifferences <= 1447 /* MaxDifferencesHistory */) { + // We are allocating space for one extra int, which we fill with + // the index of the diagonal base index + var temp = new Int32Array(diagonalForwardEnd - diagonalForwardStart + 2); + temp[0] = diagonalForwardBase - diagonalForwardStart + 1; + MyArray.Copy2(forwardPoints, diagonalForwardStart, temp, 1, diagonalForwardEnd - diagonalForwardStart + 1); + this.m_forwardHistory.push(temp); + temp = new Int32Array(diagonalReverseEnd - diagonalReverseStart + 2); + temp[0] = diagonalReverseBase - diagonalReverseStart + 1; + MyArray.Copy2(reversePoints, diagonalReverseStart, temp, 1, diagonalReverseEnd - diagonalReverseStart + 1); + this.m_reverseHistory.push(temp); + } + } + // If we got here, then we have the full trace in history. We just have to convert it to a change list + // NOTE: This part is a bit messy + return this.WALKTRACE(diagonalForwardBase, diagonalForwardStart, diagonalForwardEnd, diagonalForwardOffset, diagonalReverseBase, diagonalReverseStart, diagonalReverseEnd, diagonalReverseOffset, forwardPoints, reversePoints, originalIndex, originalEnd, midOriginalArr, modifiedIndex, modifiedEnd, midModifiedArr, deltaIsEven, quitEarlyArr); + }; + /** + * Shifts the given changes to provide a more intuitive diff. + * While the first element in a diff matches the first element after the diff, + * we shift the diff down. + * + * @param changes The list of changes to shift + * @returns The shifted changes + */ + LcsDiff.prototype.PrettifyChanges = function (changes) { + // Shift all the changes down first + for (var i = 0; i < changes.length; i++) { + var change = changes[i]; + var originalStop = (i < changes.length - 1) ? changes[i + 1].originalStart : this._originalElementsOrHash.length; + var modifiedStop = (i < changes.length - 1) ? changes[i + 1].modifiedStart : this._modifiedElementsOrHash.length; + var checkOriginal = change.originalLength > 0; + var checkModified = change.modifiedLength > 0; + while (change.originalStart + change.originalLength < originalStop && + change.modifiedStart + change.modifiedLength < modifiedStop && + (!checkOriginal || this.OriginalElementsAreEqual(change.originalStart, change.originalStart + change.originalLength)) && + (!checkModified || this.ModifiedElementsAreEqual(change.modifiedStart, change.modifiedStart + change.modifiedLength))) { + change.originalStart++; + change.modifiedStart++; + } + var mergedChangeArr = [null]; + if (i < changes.length - 1 && this.ChangesOverlap(changes[i], changes[i + 1], mergedChangeArr)) { + changes[i] = mergedChangeArr[0]; + changes.splice(i + 1, 1); + i--; + continue; + } + } + // Shift changes back up until we hit empty or whitespace-only lines + for (var i = changes.length - 1; i >= 0; i--) { + var change = changes[i]; + var originalStop = 0; + var modifiedStop = 0; + if (i > 0) { + var prevChange = changes[i - 1]; + if (prevChange.originalLength > 0) { + originalStop = prevChange.originalStart + prevChange.originalLength; + } + if (prevChange.modifiedLength > 0) { + modifiedStop = prevChange.modifiedStart + prevChange.modifiedLength; + } + } + var checkOriginal = change.originalLength > 0; + var checkModified = change.modifiedLength > 0; + var bestDelta = 0; + var bestScore = this._boundaryScore(change.originalStart, change.originalLength, change.modifiedStart, change.modifiedLength); + for (var delta = 1;; delta++) { + var originalStart = change.originalStart - delta; + var modifiedStart = change.modifiedStart - delta; + if (originalStart < originalStop || modifiedStart < modifiedStop) { + break; + } + if (checkOriginal && !this.OriginalElementsAreEqual(originalStart, originalStart + change.originalLength)) { + break; + } + if (checkModified && !this.ModifiedElementsAreEqual(modifiedStart, modifiedStart + change.modifiedLength)) { + break; + } + var score = this._boundaryScore(originalStart, change.originalLength, modifiedStart, change.modifiedLength); + if (score > bestScore) { + bestScore = score; + bestDelta = delta; + } + } + change.originalStart -= bestDelta; + change.modifiedStart -= bestDelta; + } + return changes; + }; + LcsDiff.prototype._OriginalIsBoundary = function (index) { + if (index <= 0 || index >= this._originalElementsOrHash.length - 1) { + return true; + } + return (this._hasStrings && /^\s*$/.test(this._originalStringElements[index])); + }; + LcsDiff.prototype._OriginalRegionIsBoundary = function (originalStart, originalLength) { + if (this._OriginalIsBoundary(originalStart) || this._OriginalIsBoundary(originalStart - 1)) { + return true; + } + if (originalLength > 0) { + var originalEnd = originalStart + originalLength; + if (this._OriginalIsBoundary(originalEnd - 1) || this._OriginalIsBoundary(originalEnd)) { + return true; + } + } + return false; + }; + LcsDiff.prototype._ModifiedIsBoundary = function (index) { + if (index <= 0 || index >= this._modifiedElementsOrHash.length - 1) { + return true; + } + return (this._hasStrings && /^\s*$/.test(this._modifiedStringElements[index])); + }; + LcsDiff.prototype._ModifiedRegionIsBoundary = function (modifiedStart, modifiedLength) { + if (this._ModifiedIsBoundary(modifiedStart) || this._ModifiedIsBoundary(modifiedStart - 1)) { + return true; + } + if (modifiedLength > 0) { + var modifiedEnd = modifiedStart + modifiedLength; + if (this._ModifiedIsBoundary(modifiedEnd - 1) || this._ModifiedIsBoundary(modifiedEnd)) { + return true; + } + } + return false; + }; + LcsDiff.prototype._boundaryScore = function (originalStart, originalLength, modifiedStart, modifiedLength) { + var originalScore = (this._OriginalRegionIsBoundary(originalStart, originalLength) ? 1 : 0); + var modifiedScore = (this._ModifiedRegionIsBoundary(modifiedStart, modifiedLength) ? 1 : 0); + return (originalScore + modifiedScore); + }; + /** + * Concatenates the two input DiffChange lists and returns the resulting + * list. + * @param The left changes + * @param The right changes + * @returns The concatenated list + */ + LcsDiff.prototype.ConcatenateChanges = function (left, right) { + var mergedChangeArr = []; + if (left.length === 0 || right.length === 0) { + return (right.length > 0) ? right : left; + } + else if (this.ChangesOverlap(left[left.length - 1], right[0], mergedChangeArr)) { + // Since we break the problem down recursively, it is possible that we + // might recurse in the middle of a change thereby splitting it into + // two changes. Here in the combining stage, we detect and fuse those + // changes back together + var result = new Array(left.length + right.length - 1); + MyArray.Copy(left, 0, result, 0, left.length - 1); + result[left.length - 1] = mergedChangeArr[0]; + MyArray.Copy(right, 1, result, left.length, right.length - 1); + return result; + } + else { + var result = new Array(left.length + right.length); + MyArray.Copy(left, 0, result, 0, left.length); + MyArray.Copy(right, 0, result, left.length, right.length); + return result; + } + }; + /** + * Returns true if the two changes overlap and can be merged into a single + * change + * @param left The left change + * @param right The right change + * @param mergedChange The merged change if the two overlap, null otherwise + * @returns True if the two changes overlap + */ + LcsDiff.prototype.ChangesOverlap = function (left, right, mergedChangeArr) { + Debug.Assert(left.originalStart <= right.originalStart, 'Left change is not less than or equal to right change'); + Debug.Assert(left.modifiedStart <= right.modifiedStart, 'Left change is not less than or equal to right change'); + if (left.originalStart + left.originalLength >= right.originalStart || left.modifiedStart + left.modifiedLength >= right.modifiedStart) { + var originalStart = left.originalStart; + var originalLength = left.originalLength; + var modifiedStart = left.modifiedStart; + var modifiedLength = left.modifiedLength; + if (left.originalStart + left.originalLength >= right.originalStart) { + originalLength = right.originalStart + right.originalLength - left.originalStart; + } + if (left.modifiedStart + left.modifiedLength >= right.modifiedStart) { + modifiedLength = right.modifiedStart + right.modifiedLength - left.modifiedStart; + } + mergedChangeArr[0] = new _diffChange_js__WEBPACK_IMPORTED_MODULE_0__["DiffChange"](originalStart, originalLength, modifiedStart, modifiedLength); + return true; + } + else { + mergedChangeArr[0] = null; + return false; + } + }; + /** + * Helper method used to clip a diagonal index to the range of valid + * diagonals. This also decides whether or not the diagonal index, + * if it exceeds the boundary, should be clipped to the boundary or clipped + * one inside the boundary depending on the Even/Odd status of the boundary + * and numDifferences. + * @param diagonal The index of the diagonal to clip. + * @param numDifferences The current number of differences being iterated upon. + * @param diagonalBaseIndex The base reference diagonal. + * @param numDiagonals The total number of diagonals. + * @returns The clipped diagonal index. + */ + LcsDiff.prototype.ClipDiagonalBound = function (diagonal, numDifferences, diagonalBaseIndex, numDiagonals) { + if (diagonal >= 0 && diagonal < numDiagonals) { + // Nothing to clip, its in range + return diagonal; + } + // diagonalsBelow: The number of diagonals below the reference diagonal + // diagonalsAbove: The number of diagonals above the reference diagonal + var diagonalsBelow = diagonalBaseIndex; + var diagonalsAbove = numDiagonals - diagonalBaseIndex - 1; + var diffEven = (numDifferences % 2 === 0); + if (diagonal < 0) { + var lowerBoundEven = (diagonalsBelow % 2 === 0); + return (diffEven === lowerBoundEven) ? 0 : 1; + } + else { + var upperBoundEven = (diagonalsAbove % 2 === 0); + return (diffEven === upperBoundEven) ? numDiagonals - 1 : numDiagonals - 2; + } + }; + return LcsDiff; +}()); + /***/ }), @@ -1335,40 +1388,40 @@ var LcsDiff = /** @class */ (function () { "use strict"; __webpack_require__.r(__webpack_exports__); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "DiffChange", function() { return DiffChange; }); -/*--------------------------------------------------------------------------------------------- - * Copyright (c) Microsoft Corporation. All rights reserved. - * Licensed under the MIT License. See License.txt in the project root for license information. - *--------------------------------------------------------------------------------------------*/ -/** - * Represents information about a specific difference between two sequences. - */ -var DiffChange = /** @class */ (function () { - /** - * Constructs a new DiffChange with the given sequence information - * and content. - */ - function DiffChange(originalStart, originalLength, modifiedStart, modifiedLength) { - //Debug.Assert(originalLength > 0 || modifiedLength > 0, "originalLength and modifiedLength cannot both be <= 0"); - this.originalStart = originalStart; - this.originalLength = originalLength; - this.modifiedStart = modifiedStart; - this.modifiedLength = modifiedLength; - } - /** - * The end point (exclusive) of the change in the original sequence. - */ - DiffChange.prototype.getOriginalEnd = function () { - return this.originalStart + this.originalLength; - }; - /** - * The end point (exclusive) of the change in the modified sequence. - */ - DiffChange.prototype.getModifiedEnd = function () { - return this.modifiedStart + this.modifiedLength; - }; - return DiffChange; -}()); - +/*--------------------------------------------------------------------------------------------- + * Copyright (c) Microsoft Corporation. All rights reserved. + * Licensed under the MIT License. See License.txt in the project root for license information. + *--------------------------------------------------------------------------------------------*/ +/** + * Represents information about a specific difference between two sequences. + */ +var DiffChange = /** @class */ (function () { + /** + * Constructs a new DiffChange with the given sequence information + * and content. + */ + function DiffChange(originalStart, originalLength, modifiedStart, modifiedLength) { + //Debug.Assert(originalLength > 0 || modifiedLength > 0, "originalLength and modifiedLength cannot both be <= 0"); + this.originalStart = originalStart; + this.originalLength = originalLength; + this.modifiedStart = modifiedStart; + this.modifiedLength = modifiedLength; + } + /** + * The end point (exclusive) of the change in the original sequence. + */ + DiffChange.prototype.getOriginalEnd = function () { + return this.originalStart + this.originalLength; + }; + /** + * The end point (exclusive) of the change in the modified sequence. + */ + DiffChange.prototype.getModifiedEnd = function () { + return this.modifiedStart + this.modifiedLength; + }; + return DiffChange; +}()); + /***/ }), @@ -1391,99 +1444,99 @@ __webpack_require__.r(__webpack_exports__); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "canceled", function() { return canceled; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "illegalArgument", function() { return illegalArgument; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "illegalState", function() { return illegalState; }); -/*--------------------------------------------------------------------------------------------- - * Copyright (c) Microsoft Corporation. All rights reserved. - * Licensed under the MIT License. See License.txt in the project root for license information. - *--------------------------------------------------------------------------------------------*/ -// Avoid circular dependency on EventEmitter by implementing a subset of the interface. -var ErrorHandler = /** @class */ (function () { - function ErrorHandler() { - this.listeners = []; - this.unexpectedErrorHandler = function (e) { - setTimeout(function () { - if (e.stack) { - throw new Error(e.message + '\n\n' + e.stack); - } - throw e; - }, 0); - }; - } - ErrorHandler.prototype.emit = function (e) { - this.listeners.forEach(function (listener) { - listener(e); - }); - }; - ErrorHandler.prototype.onUnexpectedError = function (e) { - this.unexpectedErrorHandler(e); - this.emit(e); - }; - // For external errors, we don't want the listeners to be called - ErrorHandler.prototype.onUnexpectedExternalError = function (e) { - this.unexpectedErrorHandler(e); - }; - return ErrorHandler; -}()); - -var errorHandler = new ErrorHandler(); -function onUnexpectedError(e) { - // ignore errors from cancelled promises - if (!isPromiseCanceledError(e)) { - errorHandler.onUnexpectedError(e); - } - return undefined; -} -function onUnexpectedExternalError(e) { - // ignore errors from cancelled promises - if (!isPromiseCanceledError(e)) { - errorHandler.onUnexpectedExternalError(e); - } - return undefined; -} -function transformErrorForSerialization(error) { - if (error instanceof Error) { - var name_1 = error.name, message = error.message; - var stack = error.stacktrace || error.stack; - return { - $isError: true, - name: name_1, - message: message, - stack: stack - }; - } - // return as is - return error; -} -var canceledName = 'Canceled'; -/** - * Checks if the given error is a promise in canceled state - */ -function isPromiseCanceledError(error) { - return error instanceof Error && error.name === canceledName && error.message === canceledName; -} -/** - * Returns an error that signals cancellation. - */ -function canceled() { - var error = new Error(canceledName); - error.name = error.message; - return error; -} -function illegalArgument(name) { - if (name) { - return new Error("Illegal argument: " + name); - } - else { - return new Error('Illegal argument'); - } -} -function illegalState(name) { - if (name) { - return new Error("Illegal state: " + name); - } - else { - return new Error('Illegal state'); - } -} +/*--------------------------------------------------------------------------------------------- + * Copyright (c) Microsoft Corporation. All rights reserved. + * Licensed under the MIT License. See License.txt in the project root for license information. + *--------------------------------------------------------------------------------------------*/ +// Avoid circular dependency on EventEmitter by implementing a subset of the interface. +var ErrorHandler = /** @class */ (function () { + function ErrorHandler() { + this.listeners = []; + this.unexpectedErrorHandler = function (e) { + setTimeout(function () { + if (e.stack) { + throw new Error(e.message + '\n\n' + e.stack); + } + throw e; + }, 0); + }; + } + ErrorHandler.prototype.emit = function (e) { + this.listeners.forEach(function (listener) { + listener(e); + }); + }; + ErrorHandler.prototype.onUnexpectedError = function (e) { + this.unexpectedErrorHandler(e); + this.emit(e); + }; + // For external errors, we don't want the listeners to be called + ErrorHandler.prototype.onUnexpectedExternalError = function (e) { + this.unexpectedErrorHandler(e); + }; + return ErrorHandler; +}()); + +var errorHandler = new ErrorHandler(); +function onUnexpectedError(e) { + // ignore errors from cancelled promises + if (!isPromiseCanceledError(e)) { + errorHandler.onUnexpectedError(e); + } + return undefined; +} +function onUnexpectedExternalError(e) { + // ignore errors from cancelled promises + if (!isPromiseCanceledError(e)) { + errorHandler.onUnexpectedExternalError(e); + } + return undefined; +} +function transformErrorForSerialization(error) { + if (error instanceof Error) { + var name_1 = error.name, message = error.message; + var stack = error.stacktrace || error.stack; + return { + $isError: true, + name: name_1, + message: message, + stack: stack + }; + } + // return as is + return error; +} +var canceledName = 'Canceled'; +/** + * Checks if the given error is a promise in canceled state + */ +function isPromiseCanceledError(error) { + return error instanceof Error && error.name === canceledName && error.message === canceledName; +} +/** + * Returns an error that signals cancellation. + */ +function canceled() { + var error = new Error(canceledName); + error.name = error.message; + return error; +} +function illegalArgument(name) { + if (name) { + return new Error("Illegal argument: " + name); + } + else { + return new Error('Illegal argument'); + } +} +function illegalState(name) { + if (name) { + return new Error("Illegal state: " + name); + } + else { + return new Error('Illegal state'); + } +} /***/ }), @@ -1507,712 +1560,734 @@ __webpack_require__.r(__webpack_exports__); /* harmony import */ var _functional_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./functional.js */ "./node_modules/monaco-editor/esm/vs/base/common/functional.js"); /* harmony import */ var _lifecycle_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./lifecycle.js */ "./node_modules/monaco-editor/esm/vs/base/common/lifecycle.js"); /* harmony import */ var _linkedList_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./linkedList.js */ "./node_modules/monaco-editor/esm/vs/base/common/linkedList.js"); -/*--------------------------------------------------------------------------------------------- - * Copyright (c) Microsoft Corporation. All rights reserved. - * Licensed under the MIT License. See License.txt in the project root for license information. - *--------------------------------------------------------------------------------------------*/ -var __extends = (undefined && undefined.__extends) || (function () { - var extendStatics = function (d, b) { - extendStatics = Object.setPrototypeOf || - ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) || - function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; }; - return extendStatics(d, b); - }; - return function (d, b) { - extendStatics(d, b); - function __() { this.constructor = d; } - d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __()); - }; -})(); - - - - -var Event; -(function (Event) { - var _disposable = { dispose: function () { } }; - Event.None = function () { return _disposable; }; - /** - * Given an event, returns another event which only fires once. - */ - function once(event) { - return function (listener, thisArgs, disposables) { - if (thisArgs === void 0) { thisArgs = null; } - // we need this, in case the event fires during the listener call - var didFire = false; - var result; - result = event(function (e) { - if (didFire) { - return; - } - else if (result) { - result.dispose(); - } - else { - didFire = true; - } - return listener.call(thisArgs, e); - }, null, disposables); - if (didFire) { - result.dispose(); - } - return result; - }; - } - Event.once = once; - /** - * Given an event and a `map` function, returns another event which maps each element - * throught the mapping function. - */ - function map(event, map) { - return snapshot(function (listener, thisArgs, disposables) { - if (thisArgs === void 0) { thisArgs = null; } - return event(function (i) { return listener.call(thisArgs, map(i)); }, null, disposables); - }); - } - Event.map = map; - /** - * Given an event and an `each` function, returns another identical event and calls - * the `each` function per each element. - */ - function forEach(event, each) { - return snapshot(function (listener, thisArgs, disposables) { - if (thisArgs === void 0) { thisArgs = null; } - return event(function (i) { each(i); listener.call(thisArgs, i); }, null, disposables); - }); - } - Event.forEach = forEach; - function filter(event, filter) { - return snapshot(function (listener, thisArgs, disposables) { - if (thisArgs === void 0) { thisArgs = null; } - return event(function (e) { return filter(e) && listener.call(thisArgs, e); }, null, disposables); - }); - } - Event.filter = filter; - /** - * Given an event, returns the same event but typed as `Event`. - */ - function signal(event) { - return event; - } - Event.signal = signal; - /** - * Given a collection of events, returns a single event which emits - * whenever any of the provided events emit. - */ - function any() { - var events = []; - for (var _i = 0; _i < arguments.length; _i++) { - events[_i] = arguments[_i]; - } - return function (listener, thisArgs, disposables) { - if (thisArgs === void 0) { thisArgs = null; } - return Object(_lifecycle_js__WEBPACK_IMPORTED_MODULE_2__["combinedDisposable"])(events.map(function (event) { return event(function (e) { return listener.call(thisArgs, e); }, null, disposables); })); - }; - } - Event.any = any; - /** - * Given an event and a `merge` function, returns another event which maps each element - * and the cummulative result throught the `merge` function. Similar to `map`, but with memory. - */ - function reduce(event, merge, initial) { - var output = initial; - return map(event, function (e) { - output = merge(output, e); - return output; - }); - } - Event.reduce = reduce; - /** - * Given a chain of event processing functions (filter, map, etc), each - * function will be invoked per event & per listener. Snapshotting an event - * chain allows each function to be invoked just once per event. - */ - function snapshot(event) { - var listener; - var emitter = new Emitter({ - onFirstListenerAdd: function () { - listener = event(emitter.fire, emitter); - }, - onLastListenerRemove: function () { - listener.dispose(); - } - }); - return emitter.event; - } - Event.snapshot = snapshot; - function debounce(event, merge, delay, leading, leakWarningThreshold) { - if (delay === void 0) { delay = 100; } - if (leading === void 0) { leading = false; } - var subscription; - var output = undefined; - var handle = undefined; - var numDebouncedCalls = 0; - var emitter = new Emitter({ - leakWarningThreshold: leakWarningThreshold, - onFirstListenerAdd: function () { - subscription = event(function (cur) { - numDebouncedCalls++; - output = merge(output, cur); - if (leading && !handle) { - emitter.fire(output); - } - clearTimeout(handle); - handle = setTimeout(function () { - var _output = output; - output = undefined; - handle = undefined; - if (!leading || numDebouncedCalls > 1) { - emitter.fire(_output); - } - numDebouncedCalls = 0; - }, delay); - }); - }, - onLastListenerRemove: function () { - subscription.dispose(); - } - }); - return emitter.event; - } - Event.debounce = debounce; - /** - * Given an event, it returns another event which fires only once and as soon as - * the input event emits. The event data is the number of millis it took for the - * event to fire. - */ - function stopwatch(event) { - var start = new Date().getTime(); - return map(once(event), function (_) { return new Date().getTime() - start; }); - } - Event.stopwatch = stopwatch; - /** - * Given an event, it returns another event which fires only when the event - * element changes. - */ - function latch(event) { - var firstCall = true; - var cache; - return filter(event, function (value) { - var shouldEmit = firstCall || value !== cache; - firstCall = false; - cache = value; - return shouldEmit; - }); - } - Event.latch = latch; - /** - * Buffers the provided event until a first listener comes - * along, at which point fire all the events at once and - * pipe the event from then on. - * - * ```typescript - * const emitter = new Emitter(); - * const event = emitter.event; - * const bufferedEvent = buffer(event); - * - * emitter.fire(1); - * emitter.fire(2); - * emitter.fire(3); - * // nothing... - * - * const listener = bufferedEvent(num => console.log(num)); - * // 1, 2, 3 - * - * emitter.fire(4); - * // 4 - * ``` - */ - function buffer(event, nextTick, _buffer) { - if (nextTick === void 0) { nextTick = false; } - if (_buffer === void 0) { _buffer = []; } - var buffer = _buffer.slice(); - var listener = event(function (e) { - if (buffer) { - buffer.push(e); - } - else { - emitter.fire(e); - } - }); - var flush = function () { - if (buffer) { - buffer.forEach(function (e) { return emitter.fire(e); }); - } - buffer = null; - }; - var emitter = new Emitter({ - onFirstListenerAdd: function () { - if (!listener) { - listener = event(function (e) { return emitter.fire(e); }); - } - }, - onFirstListenerDidAdd: function () { - if (buffer) { - if (nextTick) { - setTimeout(flush); - } - else { - flush(); - } - } - }, - onLastListenerRemove: function () { - if (listener) { - listener.dispose(); - } - listener = null; - } - }); - return emitter.event; - } - Event.buffer = buffer; - var ChainableEvent = /** @class */ (function () { - function ChainableEvent(event) { - this.event = event; - } - ChainableEvent.prototype.map = function (fn) { - return new ChainableEvent(map(this.event, fn)); - }; - ChainableEvent.prototype.forEach = function (fn) { - return new ChainableEvent(forEach(this.event, fn)); - }; - ChainableEvent.prototype.filter = function (fn) { - return new ChainableEvent(filter(this.event, fn)); - }; - ChainableEvent.prototype.reduce = function (merge, initial) { - return new ChainableEvent(reduce(this.event, merge, initial)); - }; - ChainableEvent.prototype.latch = function () { - return new ChainableEvent(latch(this.event)); - }; - ChainableEvent.prototype.on = function (listener, thisArgs, disposables) { - return this.event(listener, thisArgs, disposables); - }; - ChainableEvent.prototype.once = function (listener, thisArgs, disposables) { - return once(this.event)(listener, thisArgs, disposables); - }; - return ChainableEvent; - }()); - function chain(event) { - return new ChainableEvent(event); - } - Event.chain = chain; - function fromNodeEventEmitter(emitter, eventName, map) { - if (map === void 0) { map = function (id) { return id; }; } - var fn = function () { - var args = []; - for (var _i = 0; _i < arguments.length; _i++) { - args[_i] = arguments[_i]; - } - return result.fire(map.apply(void 0, args)); - }; - var onFirstListenerAdd = function () { return emitter.on(eventName, fn); }; - var onLastListenerRemove = function () { return emitter.removeListener(eventName, fn); }; - var result = new Emitter({ onFirstListenerAdd: onFirstListenerAdd, onLastListenerRemove: onLastListenerRemove }); - return result.event; - } - Event.fromNodeEventEmitter = fromNodeEventEmitter; - function fromPromise(promise) { - var emitter = new Emitter(); - var shouldEmit = false; - promise - .then(undefined, function () { return null; }) - .then(function () { - if (!shouldEmit) { - setTimeout(function () { return emitter.fire(undefined); }, 0); - } - else { - emitter.fire(undefined); - } - }); - shouldEmit = true; - return emitter.event; - } - Event.fromPromise = fromPromise; - function toPromise(event) { - return new Promise(function (c) { return once(event)(c); }); - } - Event.toPromise = toPromise; -})(Event || (Event = {})); -var _globalLeakWarningThreshold = -1; -var LeakageMonitor = /** @class */ (function () { - function LeakageMonitor(customThreshold, name) { - if (name === void 0) { name = Math.random().toString(18).slice(2, 5); } - this.customThreshold = customThreshold; - this.name = name; - this._warnCountdown = 0; - } - LeakageMonitor.prototype.dispose = function () { - if (this._stacks) { - this._stacks.clear(); - } - }; - LeakageMonitor.prototype.check = function (listenerCount) { - var _this = this; - var threshold = _globalLeakWarningThreshold; - if (typeof this.customThreshold === 'number') { - threshold = this.customThreshold; - } - if (threshold <= 0 || listenerCount < threshold) { - return undefined; - } - if (!this._stacks) { - this._stacks = new Map(); - } - var stack = new Error().stack.split('\n').slice(3).join('\n'); - var count = (this._stacks.get(stack) || 0); - this._stacks.set(stack, count + 1); - this._warnCountdown -= 1; - if (this._warnCountdown <= 0) { - // only warn on first exceed and then every time the limit - // is exceeded by 50% again - this._warnCountdown = threshold * 0.5; - // find most frequent listener and print warning - var topStack_1; - var topCount_1 = 0; - this._stacks.forEach(function (count, stack) { - if (!topStack_1 || topCount_1 < count) { - topStack_1 = stack; - topCount_1 = count; - } - }); - console.warn("[" + this.name + "] potential listener LEAK detected, having " + listenerCount + " listeners already. MOST frequent listener (" + topCount_1 + "):"); - console.warn(topStack_1); - } - return function () { - var count = (_this._stacks.get(stack) || 0); - _this._stacks.set(stack, count - 1); - }; - }; - return LeakageMonitor; -}()); -/** - * The Emitter can be used to expose an Event to the public - * to fire it from the insides. - * Sample: - class Document { - - private _onDidChange = new Emitter<(value:string)=>any>(); - - public onDidChange = this._onDidChange.event; - - // getter-style - // get onDidChange(): Event<(value:string)=>any> { - // return this._onDidChange.event; - // } - - private _doIt() { - //... - this._onDidChange.fire(value); - } - } - */ -var Emitter = /** @class */ (function () { - function Emitter(options) { - this._disposed = false; - this._options = options; - this._leakageMon = _globalLeakWarningThreshold > 0 - ? new LeakageMonitor(this._options && this._options.leakWarningThreshold) - : undefined; - } - Object.defineProperty(Emitter.prototype, "event", { - /** - * For the public to allow to subscribe - * to events from this Emitter - */ - get: function () { - var _this = this; - if (!this._event) { - this._event = function (listener, thisArgs, disposables) { - if (!_this._listeners) { - _this._listeners = new _linkedList_js__WEBPACK_IMPORTED_MODULE_3__["LinkedList"](); - } - var firstListener = _this._listeners.isEmpty(); - if (firstListener && _this._options && _this._options.onFirstListenerAdd) { - _this._options.onFirstListenerAdd(_this); - } - var remove = _this._listeners.push(!thisArgs ? listener : [listener, thisArgs]); - if (firstListener && _this._options && _this._options.onFirstListenerDidAdd) { - _this._options.onFirstListenerDidAdd(_this); - } - if (_this._options && _this._options.onListenerDidAdd) { - _this._options.onListenerDidAdd(_this, listener, thisArgs); - } - // check and record this emitter for potential leakage - var removeMonitor; - if (_this._leakageMon) { - removeMonitor = _this._leakageMon.check(_this._listeners.size); - } - var result; - result = { - dispose: function () { - if (removeMonitor) { - removeMonitor(); - } - result.dispose = Emitter._noop; - if (!_this._disposed) { - remove(); - if (_this._options && _this._options.onLastListenerRemove) { - var hasListeners = (_this._listeners && !_this._listeners.isEmpty()); - if (!hasListeners) { - _this._options.onLastListenerRemove(_this); - } - } - } - } - }; - if (Array.isArray(disposables)) { - disposables.push(result); - } - return result; - }; - } - return this._event; - }, - enumerable: true, - configurable: true - }); - /** - * To be kept private to fire an event to - * subscribers - */ - Emitter.prototype.fire = function (event) { - if (this._listeners) { - // put all [listener,event]-pairs into delivery queue - // then emit all event. an inner/nested event might be - // the driver of this - if (!this._deliveryQueue) { - this._deliveryQueue = new _linkedList_js__WEBPACK_IMPORTED_MODULE_3__["LinkedList"](); - } - for (var iter = this._listeners.iterator(), e = iter.next(); !e.done; e = iter.next()) { - this._deliveryQueue.push([e.value, event]); - } - while (this._deliveryQueue.size > 0) { - var _a = this._deliveryQueue.shift(), listener = _a[0], event_1 = _a[1]; - try { - if (typeof listener === 'function') { - listener.call(undefined, event_1); - } - else { - listener[0].call(listener[1], event_1); - } - } - catch (e) { - Object(_errors_js__WEBPACK_IMPORTED_MODULE_0__["onUnexpectedError"])(e); - } - } - } - }; - Emitter.prototype.dispose = function () { - if (this._listeners) { - this._listeners.clear(); - } - if (this._deliveryQueue) { - this._deliveryQueue.clear(); - } - if (this._leakageMon) { - this._leakageMon.dispose(); - } - this._disposed = true; - }; - Emitter._noop = function () { }; - return Emitter; -}()); - -var PauseableEmitter = /** @class */ (function (_super) { - __extends(PauseableEmitter, _super); - function PauseableEmitter(options) { - var _this = _super.call(this, options) || this; - _this._isPaused = 0; - _this._eventQueue = new _linkedList_js__WEBPACK_IMPORTED_MODULE_3__["LinkedList"](); - _this._mergeFn = options && options.merge; - return _this; - } - PauseableEmitter.prototype.pause = function () { - this._isPaused++; - }; - PauseableEmitter.prototype.resume = function () { - if (this._isPaused !== 0 && --this._isPaused === 0) { - if (this._mergeFn) { - // use the merge function to create a single composite - // event. make a copy in case firing pauses this emitter - var events = this._eventQueue.toArray(); - this._eventQueue.clear(); - _super.prototype.fire.call(this, this._mergeFn(events)); - } - else { - // no merging, fire each event individually and test - // that this emitter isn't paused halfway through - while (!this._isPaused && this._eventQueue.size !== 0) { - _super.prototype.fire.call(this, this._eventQueue.shift()); - } - } - } - }; - PauseableEmitter.prototype.fire = function (event) { - if (this._listeners) { - if (this._isPaused !== 0) { - this._eventQueue.push(event); - } - else { - _super.prototype.fire.call(this, event); - } - } - }; - return PauseableEmitter; -}(Emitter)); - -var EventMultiplexer = /** @class */ (function () { - function EventMultiplexer() { - var _this = this; - this.hasListeners = false; - this.events = []; - this.emitter = new Emitter({ - onFirstListenerAdd: function () { return _this.onFirstListenerAdd(); }, - onLastListenerRemove: function () { return _this.onLastListenerRemove(); } - }); - } - Object.defineProperty(EventMultiplexer.prototype, "event", { - get: function () { - return this.emitter.event; - }, - enumerable: true, - configurable: true - }); - EventMultiplexer.prototype.add = function (event) { - var _this = this; - var e = { event: event, listener: null }; - this.events.push(e); - if (this.hasListeners) { - this.hook(e); - } - var dispose = function () { - if (_this.hasListeners) { - _this.unhook(e); - } - var idx = _this.events.indexOf(e); - _this.events.splice(idx, 1); - }; - return Object(_lifecycle_js__WEBPACK_IMPORTED_MODULE_2__["toDisposable"])(Object(_functional_js__WEBPACK_IMPORTED_MODULE_1__["once"])(dispose)); - }; - EventMultiplexer.prototype.onFirstListenerAdd = function () { - var _this = this; - this.hasListeners = true; - this.events.forEach(function (e) { return _this.hook(e); }); - }; - EventMultiplexer.prototype.onLastListenerRemove = function () { - var _this = this; - this.hasListeners = false; - this.events.forEach(function (e) { return _this.unhook(e); }); - }; - EventMultiplexer.prototype.hook = function (e) { - var _this = this; - e.listener = e.event(function (r) { return _this.emitter.fire(r); }); - }; - EventMultiplexer.prototype.unhook = function (e) { - if (e.listener) { - e.listener.dispose(); - } - e.listener = null; - }; - EventMultiplexer.prototype.dispose = function () { - this.emitter.dispose(); - }; - return EventMultiplexer; -}()); - -/** - * The EventBufferer is useful in situations in which you want - * to delay firing your events during some code. - * You can wrap that code and be sure that the event will not - * be fired during that wrap. - * - * ``` - * const emitter: Emitter; - * const delayer = new EventDelayer(); - * const delayedEvent = delayer.wrapEvent(emitter.event); - * - * delayedEvent(console.log); - * - * delayer.bufferEvents(() => { - * emitter.fire(); // event will not be fired yet - * }); - * - * // event will only be fired at this point - * ``` - */ -var EventBufferer = /** @class */ (function () { - function EventBufferer() { - this.buffers = []; - } - EventBufferer.prototype.wrapEvent = function (event) { - var _this = this; - return function (listener, thisArgs, disposables) { - return event(function (i) { - var buffer = _this.buffers[_this.buffers.length - 1]; - if (buffer) { - buffer.push(function () { return listener.call(thisArgs, i); }); - } - else { - listener.call(thisArgs, i); - } - }, undefined, disposables); - }; - }; - EventBufferer.prototype.bufferEvents = function (fn) { - var buffer = []; - this.buffers.push(buffer); - var r = fn(); - this.buffers.pop(); - buffer.forEach(function (flush) { return flush(); }); - return r; - }; - return EventBufferer; -}()); - -/** - * A Relay is an event forwarder which functions as a replugabble event pipe. - * Once created, you can connect an input event to it and it will simply forward - * events from that input event through its own `event` property. The `input` - * can be changed at any point in time. - */ -var Relay = /** @class */ (function () { - function Relay() { - var _this = this; - this.listening = false; - this.inputEvent = Event.None; - this.inputEventListener = _lifecycle_js__WEBPACK_IMPORTED_MODULE_2__["Disposable"].None; - this.emitter = new Emitter({ - onFirstListenerDidAdd: function () { - _this.listening = true; - _this.inputEventListener = _this.inputEvent(_this.emitter.fire, _this.emitter); - }, - onLastListenerRemove: function () { - _this.listening = false; - _this.inputEventListener.dispose(); - } - }); - this.event = this.emitter.event; - } - Object.defineProperty(Relay.prototype, "input", { - set: function (event) { - this.inputEvent = event; - if (this.listening) { - this.inputEventListener.dispose(); - this.inputEventListener = event(this.emitter.fire, this.emitter); - } - }, - enumerable: true, - configurable: true - }); - Relay.prototype.dispose = function () { - this.inputEventListener.dispose(); - this.emitter.dispose(); - }; - return Relay; -}()); - +/*--------------------------------------------------------------------------------------------- + * Copyright (c) Microsoft Corporation. All rights reserved. + * Licensed under the MIT License. See License.txt in the project root for license information. + *--------------------------------------------------------------------------------------------*/ +var __extends = (undefined && undefined.__extends) || (function () { + var extendStatics = function (d, b) { + extendStatics = Object.setPrototypeOf || + ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) || + function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; }; + return extendStatics(d, b); + }; + return function (d, b) { + extendStatics(d, b); + function __() { this.constructor = d; } + d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __()); + }; +})(); + + + + +var Event; +(function (Event) { + Event.None = function () { return _lifecycle_js__WEBPACK_IMPORTED_MODULE_2__["Disposable"].None; }; + /** + * Given an event, returns another event which only fires once. + */ + function once(event) { + return function (listener, thisArgs, disposables) { + if (thisArgs === void 0) { thisArgs = null; } + // we need this, in case the event fires during the listener call + var didFire = false; + var result; + result = event(function (e) { + if (didFire) { + return; + } + else if (result) { + result.dispose(); + } + else { + didFire = true; + } + return listener.call(thisArgs, e); + }, null, disposables); + if (didFire) { + result.dispose(); + } + return result; + }; + } + Event.once = once; + /** + * Given an event and a `map` function, returns another event which maps each element + * through the mapping function. + */ + function map(event, map) { + return snapshot(function (listener, thisArgs, disposables) { + if (thisArgs === void 0) { thisArgs = null; } + return event(function (i) { return listener.call(thisArgs, map(i)); }, null, disposables); + }); + } + Event.map = map; + /** + * Given an event and an `each` function, returns another identical event and calls + * the `each` function per each element. + */ + function forEach(event, each) { + return snapshot(function (listener, thisArgs, disposables) { + if (thisArgs === void 0) { thisArgs = null; } + return event(function (i) { each(i); listener.call(thisArgs, i); }, null, disposables); + }); + } + Event.forEach = forEach; + function filter(event, filter) { + return snapshot(function (listener, thisArgs, disposables) { + if (thisArgs === void 0) { thisArgs = null; } + return event(function (e) { return filter(e) && listener.call(thisArgs, e); }, null, disposables); + }); + } + Event.filter = filter; + /** + * Given an event, returns the same event but typed as `Event`. + */ + function signal(event) { + return event; + } + Event.signal = signal; + /** + * Given a collection of events, returns a single event which emits + * whenever any of the provided events emit. + */ + function any() { + var events = []; + for (var _i = 0; _i < arguments.length; _i++) { + events[_i] = arguments[_i]; + } + return function (listener, thisArgs, disposables) { + if (thisArgs === void 0) { thisArgs = null; } + return _lifecycle_js__WEBPACK_IMPORTED_MODULE_2__["combinedDisposable"].apply(void 0, events.map(function (event) { return event(function (e) { return listener.call(thisArgs, e); }, null, disposables); })); + }; + } + Event.any = any; + /** + * Given an event and a `merge` function, returns another event which maps each element + * and the cumulative result through the `merge` function. Similar to `map`, but with memory. + */ + function reduce(event, merge, initial) { + var output = initial; + return map(event, function (e) { + output = merge(output, e); + return output; + }); + } + Event.reduce = reduce; + /** + * Given a chain of event processing functions (filter, map, etc), each + * function will be invoked per event & per listener. Snapshotting an event + * chain allows each function to be invoked just once per event. + */ + function snapshot(event) { + var listener; + var emitter = new Emitter({ + onFirstListenerAdd: function () { + listener = event(emitter.fire, emitter); + }, + onLastListenerRemove: function () { + listener.dispose(); + } + }); + return emitter.event; + } + Event.snapshot = snapshot; + function debounce(event, merge, delay, leading, leakWarningThreshold) { + if (delay === void 0) { delay = 100; } + if (leading === void 0) { leading = false; } + var subscription; + var output = undefined; + var handle = undefined; + var numDebouncedCalls = 0; + var emitter = new Emitter({ + leakWarningThreshold: leakWarningThreshold, + onFirstListenerAdd: function () { + subscription = event(function (cur) { + numDebouncedCalls++; + output = merge(output, cur); + if (leading && !handle) { + emitter.fire(output); + } + clearTimeout(handle); + handle = setTimeout(function () { + var _output = output; + output = undefined; + handle = undefined; + if (!leading || numDebouncedCalls > 1) { + emitter.fire(_output); + } + numDebouncedCalls = 0; + }, delay); + }); + }, + onLastListenerRemove: function () { + subscription.dispose(); + } + }); + return emitter.event; + } + Event.debounce = debounce; + /** + * Given an event, it returns another event which fires only once and as soon as + * the input event emits. The event data is the number of millis it took for the + * event to fire. + */ + function stopwatch(event) { + var start = new Date().getTime(); + return map(once(event), function (_) { return new Date().getTime() - start; }); + } + Event.stopwatch = stopwatch; + /** + * Given an event, it returns another event which fires only when the event + * element changes. + */ + function latch(event) { + var firstCall = true; + var cache; + return filter(event, function (value) { + var shouldEmit = firstCall || value !== cache; + firstCall = false; + cache = value; + return shouldEmit; + }); + } + Event.latch = latch; + /** + * Buffers the provided event until a first listener comes + * along, at which point fire all the events at once and + * pipe the event from then on. + * + * ```typescript + * const emitter = new Emitter(); + * const event = emitter.event; + * const bufferedEvent = buffer(event); + * + * emitter.fire(1); + * emitter.fire(2); + * emitter.fire(3); + * // nothing... + * + * const listener = bufferedEvent(num => console.log(num)); + * // 1, 2, 3 + * + * emitter.fire(4); + * // 4 + * ``` + */ + function buffer(event, nextTick, _buffer) { + if (nextTick === void 0) { nextTick = false; } + if (_buffer === void 0) { _buffer = []; } + var buffer = _buffer.slice(); + var listener = event(function (e) { + if (buffer) { + buffer.push(e); + } + else { + emitter.fire(e); + } + }); + var flush = function () { + if (buffer) { + buffer.forEach(function (e) { return emitter.fire(e); }); + } + buffer = null; + }; + var emitter = new Emitter({ + onFirstListenerAdd: function () { + if (!listener) { + listener = event(function (e) { return emitter.fire(e); }); + } + }, + onFirstListenerDidAdd: function () { + if (buffer) { + if (nextTick) { + setTimeout(flush); + } + else { + flush(); + } + } + }, + onLastListenerRemove: function () { + if (listener) { + listener.dispose(); + } + listener = null; + } + }); + return emitter.event; + } + Event.buffer = buffer; + var ChainableEvent = /** @class */ (function () { + function ChainableEvent(event) { + this.event = event; + } + ChainableEvent.prototype.map = function (fn) { + return new ChainableEvent(map(this.event, fn)); + }; + ChainableEvent.prototype.forEach = function (fn) { + return new ChainableEvent(forEach(this.event, fn)); + }; + ChainableEvent.prototype.filter = function (fn) { + return new ChainableEvent(filter(this.event, fn)); + }; + ChainableEvent.prototype.reduce = function (merge, initial) { + return new ChainableEvent(reduce(this.event, merge, initial)); + }; + ChainableEvent.prototype.latch = function () { + return new ChainableEvent(latch(this.event)); + }; + ChainableEvent.prototype.debounce = function (merge, delay, leading, leakWarningThreshold) { + if (delay === void 0) { delay = 100; } + if (leading === void 0) { leading = false; } + return new ChainableEvent(debounce(this.event, merge, delay, leading, leakWarningThreshold)); + }; + ChainableEvent.prototype.on = function (listener, thisArgs, disposables) { + return this.event(listener, thisArgs, disposables); + }; + ChainableEvent.prototype.once = function (listener, thisArgs, disposables) { + return once(this.event)(listener, thisArgs, disposables); + }; + return ChainableEvent; + }()); + function chain(event) { + return new ChainableEvent(event); + } + Event.chain = chain; + function fromNodeEventEmitter(emitter, eventName, map) { + if (map === void 0) { map = function (id) { return id; }; } + var fn = function () { + var args = []; + for (var _i = 0; _i < arguments.length; _i++) { + args[_i] = arguments[_i]; + } + return result.fire(map.apply(void 0, args)); + }; + var onFirstListenerAdd = function () { return emitter.on(eventName, fn); }; + var onLastListenerRemove = function () { return emitter.removeListener(eventName, fn); }; + var result = new Emitter({ onFirstListenerAdd: onFirstListenerAdd, onLastListenerRemove: onLastListenerRemove }); + return result.event; + } + Event.fromNodeEventEmitter = fromNodeEventEmitter; + function fromDOMEventEmitter(emitter, eventName, map) { + if (map === void 0) { map = function (id) { return id; }; } + var fn = function () { + var args = []; + for (var _i = 0; _i < arguments.length; _i++) { + args[_i] = arguments[_i]; + } + return result.fire(map.apply(void 0, args)); + }; + var onFirstListenerAdd = function () { return emitter.addEventListener(eventName, fn); }; + var onLastListenerRemove = function () { return emitter.removeEventListener(eventName, fn); }; + var result = new Emitter({ onFirstListenerAdd: onFirstListenerAdd, onLastListenerRemove: onLastListenerRemove }); + return result.event; + } + Event.fromDOMEventEmitter = fromDOMEventEmitter; + function fromPromise(promise) { + var emitter = new Emitter(); + var shouldEmit = false; + promise + .then(undefined, function () { return null; }) + .then(function () { + if (!shouldEmit) { + setTimeout(function () { return emitter.fire(undefined); }, 0); + } + else { + emitter.fire(undefined); + } + }); + shouldEmit = true; + return emitter.event; + } + Event.fromPromise = fromPromise; + function toPromise(event) { + return new Promise(function (c) { return once(event)(c); }); + } + Event.toPromise = toPromise; +})(Event || (Event = {})); +var _globalLeakWarningThreshold = -1; +var LeakageMonitor = /** @class */ (function () { + function LeakageMonitor(customThreshold, name) { + if (name === void 0) { name = Math.random().toString(18).slice(2, 5); } + this.customThreshold = customThreshold; + this.name = name; + this._warnCountdown = 0; + } + LeakageMonitor.prototype.dispose = function () { + if (this._stacks) { + this._stacks.clear(); + } + }; + LeakageMonitor.prototype.check = function (listenerCount) { + var _this = this; + var threshold = _globalLeakWarningThreshold; + if (typeof this.customThreshold === 'number') { + threshold = this.customThreshold; + } + if (threshold <= 0 || listenerCount < threshold) { + return undefined; + } + if (!this._stacks) { + this._stacks = new Map(); + } + var stack = new Error().stack.split('\n').slice(3).join('\n'); + var count = (this._stacks.get(stack) || 0); + this._stacks.set(stack, count + 1); + this._warnCountdown -= 1; + if (this._warnCountdown <= 0) { + // only warn on first exceed and then every time the limit + // is exceeded by 50% again + this._warnCountdown = threshold * 0.5; + // find most frequent listener and print warning + var topStack_1; + var topCount_1 = 0; + this._stacks.forEach(function (count, stack) { + if (!topStack_1 || topCount_1 < count) { + topStack_1 = stack; + topCount_1 = count; + } + }); + console.warn("[" + this.name + "] potential listener LEAK detected, having " + listenerCount + " listeners already. MOST frequent listener (" + topCount_1 + "):"); + console.warn(topStack_1); + } + return function () { + var count = (_this._stacks.get(stack) || 0); + _this._stacks.set(stack, count - 1); + }; + }; + return LeakageMonitor; +}()); +/** + * The Emitter can be used to expose an Event to the public + * to fire it from the insides. + * Sample: + class Document { + + private readonly _onDidChange = new Emitter<(value:string)=>any>(); + + public onDidChange = this._onDidChange.event; + + // getter-style + // get onDidChange(): Event<(value:string)=>any> { + // return this._onDidChange.event; + // } + + private _doIt() { + //... + this._onDidChange.fire(value); + } + } + */ +var Emitter = /** @class */ (function () { + function Emitter(options) { + this._disposed = false; + this._options = options; + this._leakageMon = _globalLeakWarningThreshold > 0 + ? new LeakageMonitor(this._options && this._options.leakWarningThreshold) + : undefined; + } + Object.defineProperty(Emitter.prototype, "event", { + /** + * For the public to allow to subscribe + * to events from this Emitter + */ + get: function () { + var _this = this; + if (!this._event) { + this._event = function (listener, thisArgs, disposables) { + if (!_this._listeners) { + _this._listeners = new _linkedList_js__WEBPACK_IMPORTED_MODULE_3__["LinkedList"](); + } + var firstListener = _this._listeners.isEmpty(); + if (firstListener && _this._options && _this._options.onFirstListenerAdd) { + _this._options.onFirstListenerAdd(_this); + } + var remove = _this._listeners.push(!thisArgs ? listener : [listener, thisArgs]); + if (firstListener && _this._options && _this._options.onFirstListenerDidAdd) { + _this._options.onFirstListenerDidAdd(_this); + } + if (_this._options && _this._options.onListenerDidAdd) { + _this._options.onListenerDidAdd(_this, listener, thisArgs); + } + // check and record this emitter for potential leakage + var removeMonitor; + if (_this._leakageMon) { + removeMonitor = _this._leakageMon.check(_this._listeners.size); + } + var result; + result = { + dispose: function () { + if (removeMonitor) { + removeMonitor(); + } + result.dispose = Emitter._noop; + if (!_this._disposed) { + remove(); + if (_this._options && _this._options.onLastListenerRemove) { + var hasListeners = (_this._listeners && !_this._listeners.isEmpty()); + if (!hasListeners) { + _this._options.onLastListenerRemove(_this); + } + } + } + } + }; + if (disposables instanceof _lifecycle_js__WEBPACK_IMPORTED_MODULE_2__["DisposableStore"]) { + disposables.add(result); + } + else if (Array.isArray(disposables)) { + disposables.push(result); + } + return result; + }; + } + return this._event; + }, + enumerable: true, + configurable: true + }); + /** + * To be kept private to fire an event to + * subscribers + */ + Emitter.prototype.fire = function (event) { + if (this._listeners) { + // put all [listener,event]-pairs into delivery queue + // then emit all event. an inner/nested event might be + // the driver of this + if (!this._deliveryQueue) { + this._deliveryQueue = new _linkedList_js__WEBPACK_IMPORTED_MODULE_3__["LinkedList"](); + } + for (var iter = this._listeners.iterator(), e = iter.next(); !e.done; e = iter.next()) { + this._deliveryQueue.push([e.value, event]); + } + while (this._deliveryQueue.size > 0) { + var _a = this._deliveryQueue.shift(), listener = _a[0], event_1 = _a[1]; + try { + if (typeof listener === 'function') { + listener.call(undefined, event_1); + } + else { + listener[0].call(listener[1], event_1); + } + } + catch (e) { + Object(_errors_js__WEBPACK_IMPORTED_MODULE_0__["onUnexpectedError"])(e); + } + } + } + }; + Emitter.prototype.dispose = function () { + if (this._listeners) { + this._listeners.clear(); + } + if (this._deliveryQueue) { + this._deliveryQueue.clear(); + } + if (this._leakageMon) { + this._leakageMon.dispose(); + } + this._disposed = true; + }; + Emitter._noop = function () { }; + return Emitter; +}()); + +var PauseableEmitter = /** @class */ (function (_super) { + __extends(PauseableEmitter, _super); + function PauseableEmitter(options) { + var _this = _super.call(this, options) || this; + _this._isPaused = 0; + _this._eventQueue = new _linkedList_js__WEBPACK_IMPORTED_MODULE_3__["LinkedList"](); + _this._mergeFn = options && options.merge; + return _this; + } + PauseableEmitter.prototype.pause = function () { + this._isPaused++; + }; + PauseableEmitter.prototype.resume = function () { + if (this._isPaused !== 0 && --this._isPaused === 0) { + if (this._mergeFn) { + // use the merge function to create a single composite + // event. make a copy in case firing pauses this emitter + var events = this._eventQueue.toArray(); + this._eventQueue.clear(); + _super.prototype.fire.call(this, this._mergeFn(events)); + } + else { + // no merging, fire each event individually and test + // that this emitter isn't paused halfway through + while (!this._isPaused && this._eventQueue.size !== 0) { + _super.prototype.fire.call(this, this._eventQueue.shift()); + } + } + } + }; + PauseableEmitter.prototype.fire = function (event) { + if (this._listeners) { + if (this._isPaused !== 0) { + this._eventQueue.push(event); + } + else { + _super.prototype.fire.call(this, event); + } + } + }; + return PauseableEmitter; +}(Emitter)); + +var EventMultiplexer = /** @class */ (function () { + function EventMultiplexer() { + var _this = this; + this.hasListeners = false; + this.events = []; + this.emitter = new Emitter({ + onFirstListenerAdd: function () { return _this.onFirstListenerAdd(); }, + onLastListenerRemove: function () { return _this.onLastListenerRemove(); } + }); + } + Object.defineProperty(EventMultiplexer.prototype, "event", { + get: function () { + return this.emitter.event; + }, + enumerable: true, + configurable: true + }); + EventMultiplexer.prototype.add = function (event) { + var _this = this; + var e = { event: event, listener: null }; + this.events.push(e); + if (this.hasListeners) { + this.hook(e); + } + var dispose = function () { + if (_this.hasListeners) { + _this.unhook(e); + } + var idx = _this.events.indexOf(e); + _this.events.splice(idx, 1); + }; + return Object(_lifecycle_js__WEBPACK_IMPORTED_MODULE_2__["toDisposable"])(Object(_functional_js__WEBPACK_IMPORTED_MODULE_1__["once"])(dispose)); + }; + EventMultiplexer.prototype.onFirstListenerAdd = function () { + var _this = this; + this.hasListeners = true; + this.events.forEach(function (e) { return _this.hook(e); }); + }; + EventMultiplexer.prototype.onLastListenerRemove = function () { + var _this = this; + this.hasListeners = false; + this.events.forEach(function (e) { return _this.unhook(e); }); + }; + EventMultiplexer.prototype.hook = function (e) { + var _this = this; + e.listener = e.event(function (r) { return _this.emitter.fire(r); }); + }; + EventMultiplexer.prototype.unhook = function (e) { + if (e.listener) { + e.listener.dispose(); + } + e.listener = null; + }; + EventMultiplexer.prototype.dispose = function () { + this.emitter.dispose(); + }; + return EventMultiplexer; +}()); + +/** + * The EventBufferer is useful in situations in which you want + * to delay firing your events during some code. + * You can wrap that code and be sure that the event will not + * be fired during that wrap. + * + * ``` + * const emitter: Emitter; + * const delayer = new EventDelayer(); + * const delayedEvent = delayer.wrapEvent(emitter.event); + * + * delayedEvent(console.log); + * + * delayer.bufferEvents(() => { + * emitter.fire(); // event will not be fired yet + * }); + * + * // event will only be fired at this point + * ``` + */ +var EventBufferer = /** @class */ (function () { + function EventBufferer() { + this.buffers = []; + } + EventBufferer.prototype.wrapEvent = function (event) { + var _this = this; + return function (listener, thisArgs, disposables) { + return event(function (i) { + var buffer = _this.buffers[_this.buffers.length - 1]; + if (buffer) { + buffer.push(function () { return listener.call(thisArgs, i); }); + } + else { + listener.call(thisArgs, i); + } + }, undefined, disposables); + }; + }; + EventBufferer.prototype.bufferEvents = function (fn) { + var buffer = []; + this.buffers.push(buffer); + var r = fn(); + this.buffers.pop(); + buffer.forEach(function (flush) { return flush(); }); + return r; + }; + return EventBufferer; +}()); + +/** + * A Relay is an event forwarder which functions as a replugabble event pipe. + * Once created, you can connect an input event to it and it will simply forward + * events from that input event through its own `event` property. The `input` + * can be changed at any point in time. + */ +var Relay = /** @class */ (function () { + function Relay() { + var _this = this; + this.listening = false; + this.inputEvent = Event.None; + this.inputEventListener = _lifecycle_js__WEBPACK_IMPORTED_MODULE_2__["Disposable"].None; + this.emitter = new Emitter({ + onFirstListenerDidAdd: function () { + _this.listening = true; + _this.inputEventListener = _this.inputEvent(_this.emitter.fire, _this.emitter); + }, + onLastListenerRemove: function () { + _this.listening = false; + _this.inputEventListener.dispose(); + } + }); + this.event = this.emitter.event; + } + Object.defineProperty(Relay.prototype, "input", { + set: function (event) { + this.inputEvent = event; + if (this.listening) { + this.inputEventListener.dispose(); + this.inputEventListener = event(this.emitter.fire, this.emitter); + } + }, + enumerable: true, + configurable: true + }); + Relay.prototype.dispose = function () { + this.inputEventListener.dispose(); + this.emitter.dispose(); + }; + return Relay; +}()); + /***/ }), @@ -2227,23 +2302,92 @@ var Relay = /** @class */ (function () { "use strict"; __webpack_require__.r(__webpack_exports__); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "once", function() { return once; }); -/*--------------------------------------------------------------------------------------------- - * Copyright (c) Microsoft Corporation. All rights reserved. - * Licensed under the MIT License. See License.txt in the project root for license information. - *--------------------------------------------------------------------------------------------*/ -function once(fn) { - var _this = this; - var didCall = false; - var result; - return function () { - if (didCall) { - return result; - } - didCall = true; - result = fn.apply(_this, arguments); - return result; - }; -} +/*--------------------------------------------------------------------------------------------- + * Copyright (c) Microsoft Corporation. All rights reserved. + * Licensed under the MIT License. See License.txt in the project root for license information. + *--------------------------------------------------------------------------------------------*/ +function once(fn) { + var _this = this; + var didCall = false; + var result; + return function () { + if (didCall) { + return result; + } + didCall = true; + result = fn.apply(_this, arguments); + return result; + }; +} + + +/***/ }), + +/***/ "./node_modules/monaco-editor/esm/vs/base/common/hash.js": +/*!***************************************************************!*\ + !*** ./node_modules/monaco-editor/esm/vs/base/common/hash.js ***! + \***************************************************************/ +/*! exports provided: hash, stringHash */ +/***/ (function(module, __webpack_exports__, __webpack_require__) { + +"use strict"; +__webpack_require__.r(__webpack_exports__); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "hash", function() { return hash; }); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "stringHash", function() { return stringHash; }); +/*--------------------------------------------------------------------------------------------- + * Copyright (c) Microsoft Corporation. All rights reserved. + * Licensed under the MIT License. See License.txt in the project root for license information. + *--------------------------------------------------------------------------------------------*/ +/** + * Return a hash value for an object. + */ +function hash(obj, hashVal) { + if (hashVal === void 0) { hashVal = 0; } + switch (typeof obj) { + case 'object': + if (obj === null) { + return numberHash(349, hashVal); + } + else if (Array.isArray(obj)) { + return arrayHash(obj, hashVal); + } + return objectHash(obj, hashVal); + case 'string': + return stringHash(obj, hashVal); + case 'boolean': + return booleanHash(obj, hashVal); + case 'number': + return numberHash(obj, hashVal); + case 'undefined': + return numberHash(0, 937); + default: + return numberHash(0, 617); + } +} +function numberHash(val, initialHashVal) { + return (((initialHashVal << 5) - initialHashVal) + val) | 0; // hashVal * 31 + ch, keep as int32 +} +function booleanHash(b, initialHashVal) { + return numberHash(b ? 433 : 863, initialHashVal); +} +function stringHash(s, hashVal) { + hashVal = numberHash(149417, hashVal); + for (var i = 0, length_1 = s.length; i < length_1; i++) { + hashVal = numberHash(s.charCodeAt(i), hashVal); + } + return hashVal; +} +function arrayHash(arr, initialHashVal) { + initialHashVal = numberHash(104579, initialHashVal); + return arr.reduce(function (hashVal, item) { return hash(item, hashVal); }, initialHashVal); +} +function objectHash(obj, initialHashVal) { + initialHashVal = numberHash(181387, initialHashVal); + return Object.keys(obj).sort().reduce(function (hashVal, key) { + hashVal = stringHash(key, hashVal); + return hash(obj[key], hashVal); + }, initialHashVal); +} /***/ }), @@ -2252,184 +2396,261 @@ function once(fn) { /*!*******************************************************************!*\ !*** ./node_modules/monaco-editor/esm/vs/base/common/iterator.js ***! \*******************************************************************/ -/*! exports provided: FIN, Iterator, getSequenceIterator, ArrayIterator, ArrayNavigator, MappedIterator */ +/*! exports provided: FIN, Iterator, ChainableIterator, getSequenceIterator, ArrayIterator, ArrayNavigator, MappedIterator */ /***/ (function(module, __webpack_exports__, __webpack_require__) { "use strict"; __webpack_require__.r(__webpack_exports__); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "FIN", function() { return FIN; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "Iterator", function() { return Iterator; }); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "ChainableIterator", function() { return ChainableIterator; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "getSequenceIterator", function() { return getSequenceIterator; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "ArrayIterator", function() { return ArrayIterator; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "ArrayNavigator", function() { return ArrayNavigator; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "MappedIterator", function() { return MappedIterator; }); -/*--------------------------------------------------------------------------------------------- - * Copyright (c) Microsoft Corporation. All rights reserved. - * Licensed under the MIT License. See License.txt in the project root for license information. - *--------------------------------------------------------------------------------------------*/ -var __extends = (undefined && undefined.__extends) || (function () { - var extendStatics = function (d, b) { - extendStatics = Object.setPrototypeOf || - ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) || - function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; }; - return extendStatics(d, b); - }; - return function (d, b) { - extendStatics(d, b); - function __() { this.constructor = d; } - d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __()); - }; -})(); -var FIN = { done: true, value: undefined }; -var Iterator; -(function (Iterator) { - var _empty = { - next: function () { - return FIN; - } - }; - function empty() { - return _empty; - } - Iterator.empty = empty; - function fromArray(array, index, length) { - if (index === void 0) { index = 0; } - if (length === void 0) { length = array.length; } - return { - next: function () { - if (index >= length) { - return FIN; - } - return { done: false, value: array[index++] }; - } - }; - } - Iterator.fromArray = fromArray; - function from(elements) { - if (!elements) { - return Iterator.empty(); - } - else if (Array.isArray(elements)) { - return Iterator.fromArray(elements); - } - else { - return elements; - } - } - Iterator.from = from; - function map(iterator, fn) { - return { - next: function () { - var element = iterator.next(); - if (element.done) { - return FIN; - } - else { - return { done: false, value: fn(element.value) }; - } - } - }; - } - Iterator.map = map; - function filter(iterator, fn) { - return { - next: function () { - while (true) { - var element = iterator.next(); - if (element.done) { - return FIN; - } - if (fn(element.value)) { - return { done: false, value: element.value }; - } - } - } - }; - } - Iterator.filter = filter; - function forEach(iterator, fn) { - for (var next = iterator.next(); !next.done; next = iterator.next()) { - fn(next.value); - } - } - Iterator.forEach = forEach; - function collect(iterator) { - var result = []; - forEach(iterator, function (value) { return result.push(value); }); - return result; - } - Iterator.collect = collect; -})(Iterator || (Iterator = {})); -function getSequenceIterator(arg) { - if (Array.isArray(arg)) { - return Iterator.fromArray(arg); - } - else { - return arg; - } -} -var ArrayIterator = /** @class */ (function () { - function ArrayIterator(items, start, end, index) { - if (start === void 0) { start = 0; } - if (end === void 0) { end = items.length; } - if (index === void 0) { index = start - 1; } - this.items = items; - this.start = start; - this.end = end; - this.index = index; - } - ArrayIterator.prototype.next = function () { - this.index = Math.min(this.index + 1, this.end); - return this.current(); - }; - ArrayIterator.prototype.current = function () { - if (this.index === this.start - 1 || this.index === this.end) { - return null; - } - return this.items[this.index]; - }; - return ArrayIterator; -}()); - -var ArrayNavigator = /** @class */ (function (_super) { - __extends(ArrayNavigator, _super); - function ArrayNavigator(items, start, end, index) { - if (start === void 0) { start = 0; } - if (end === void 0) { end = items.length; } - if (index === void 0) { index = start - 1; } - return _super.call(this, items, start, end, index) || this; - } - ArrayNavigator.prototype.current = function () { - return _super.prototype.current.call(this); - }; - ArrayNavigator.prototype.previous = function () { - this.index = Math.max(this.index - 1, this.start - 1); - return this.current(); - }; - ArrayNavigator.prototype.first = function () { - this.index = this.start; - return this.current(); - }; - ArrayNavigator.prototype.last = function () { - this.index = this.end - 1; - return this.current(); - }; - ArrayNavigator.prototype.parent = function () { - return null; - }; - return ArrayNavigator; -}(ArrayIterator)); - -var MappedIterator = /** @class */ (function () { - function MappedIterator(iterator, fn) { - this.iterator = iterator; - this.fn = fn; - // noop - } - MappedIterator.prototype.next = function () { return this.fn(this.iterator.next()); }; - return MappedIterator; -}()); - +/*--------------------------------------------------------------------------------------------- + * Copyright (c) Microsoft Corporation. All rights reserved. + * Licensed under the MIT License. See License.txt in the project root for license information. + *--------------------------------------------------------------------------------------------*/ +var __extends = (undefined && undefined.__extends) || (function () { + var extendStatics = function (d, b) { + extendStatics = Object.setPrototypeOf || + ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) || + function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; }; + return extendStatics(d, b); + }; + return function (d, b) { + extendStatics(d, b); + function __() { this.constructor = d; } + d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __()); + }; +})(); +var FIN = { done: true, value: undefined }; +var Iterator; +(function (Iterator) { + var _empty = { + next: function () { + return FIN; + } + }; + function empty() { + return _empty; + } + Iterator.empty = empty; + function single(value) { + var done = false; + return { + next: function () { + if (done) { + return FIN; + } + done = true; + return { done: false, value: value }; + } + }; + } + Iterator.single = single; + function fromArray(array, index, length) { + if (index === void 0) { index = 0; } + if (length === void 0) { length = array.length; } + return { + next: function () { + if (index >= length) { + return FIN; + } + return { done: false, value: array[index++] }; + } + }; + } + Iterator.fromArray = fromArray; + function fromNativeIterator(it) { + return { + next: function () { + var result = it.next(); + if (result.done) { + return FIN; + } + return { done: false, value: result.value }; + } + }; + } + Iterator.fromNativeIterator = fromNativeIterator; + function from(elements) { + if (!elements) { + return Iterator.empty(); + } + else if (Array.isArray(elements)) { + return Iterator.fromArray(elements); + } + else { + return elements; + } + } + Iterator.from = from; + function map(iterator, fn) { + return { + next: function () { + var element = iterator.next(); + if (element.done) { + return FIN; + } + else { + return { done: false, value: fn(element.value) }; + } + } + }; + } + Iterator.map = map; + function filter(iterator, fn) { + return { + next: function () { + while (true) { + var element = iterator.next(); + if (element.done) { + return FIN; + } + if (fn(element.value)) { + return { done: false, value: element.value }; + } + } + } + }; + } + Iterator.filter = filter; + function forEach(iterator, fn) { + for (var next = iterator.next(); !next.done; next = iterator.next()) { + fn(next.value); + } + } + Iterator.forEach = forEach; + function collect(iterator, atMost) { + if (atMost === void 0) { atMost = Number.POSITIVE_INFINITY; } + var result = []; + if (atMost === 0) { + return result; + } + var i = 0; + for (var next = iterator.next(); !next.done; next = iterator.next()) { + result.push(next.value); + if (++i >= atMost) { + break; + } + } + return result; + } + Iterator.collect = collect; + function concat() { + var iterators = []; + for (var _i = 0; _i < arguments.length; _i++) { + iterators[_i] = arguments[_i]; + } + var i = 0; + return { + next: function () { + if (i >= iterators.length) { + return FIN; + } + var iterator = iterators[i]; + var result = iterator.next(); + if (result.done) { + i++; + return this.next(); + } + return result; + } + }; + } + Iterator.concat = concat; + function chain(iterator) { + return new ChainableIterator(iterator); + } + Iterator.chain = chain; +})(Iterator || (Iterator = {})); +var ChainableIterator = /** @class */ (function () { + function ChainableIterator(it) { + this.it = it; + } + ChainableIterator.prototype.next = function () { return this.it.next(); }; + return ChainableIterator; +}()); + +function getSequenceIterator(arg) { + if (Array.isArray(arg)) { + return Iterator.fromArray(arg); + } + else if (!arg) { + return Iterator.empty(); + } + else { + return arg; + } +} +var ArrayIterator = /** @class */ (function () { + function ArrayIterator(items, start, end, index) { + if (start === void 0) { start = 0; } + if (end === void 0) { end = items.length; } + if (index === void 0) { index = start - 1; } + this.items = items; + this.start = start; + this.end = end; + this.index = index; + } + ArrayIterator.prototype.first = function () { + this.index = this.start; + return this.current(); + }; + ArrayIterator.prototype.next = function () { + this.index = Math.min(this.index + 1, this.end); + return this.current(); + }; + ArrayIterator.prototype.current = function () { + if (this.index === this.start - 1 || this.index === this.end) { + return null; + } + return this.items[this.index]; + }; + return ArrayIterator; +}()); + +var ArrayNavigator = /** @class */ (function (_super) { + __extends(ArrayNavigator, _super); + function ArrayNavigator(items, start, end, index) { + if (start === void 0) { start = 0; } + if (end === void 0) { end = items.length; } + if (index === void 0) { index = start - 1; } + return _super.call(this, items, start, end, index) || this; + } + ArrayNavigator.prototype.current = function () { + return _super.prototype.current.call(this); + }; + ArrayNavigator.prototype.previous = function () { + this.index = Math.max(this.index - 1, this.start - 1); + return this.current(); + }; + ArrayNavigator.prototype.first = function () { + this.index = this.start; + return this.current(); + }; + ArrayNavigator.prototype.last = function () { + this.index = this.end - 1; + return this.current(); + }; + ArrayNavigator.prototype.parent = function () { + return null; + }; + return ArrayNavigator; +}(ArrayIterator)); + +var MappedIterator = /** @class */ (function () { + function MappedIterator(iterator, fn) { + this.iterator = iterator; + this.fn = fn; + // noop + } + MappedIterator.prototype.next = function () { return this.fn(this.iterator.next()); }; + return MappedIterator; +}()); + /***/ }), @@ -2452,284 +2673,284 @@ __webpack_require__.r(__webpack_exports__); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "ResolvedKeybindingPart", function() { return ResolvedKeybindingPart; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "ResolvedKeybinding", function() { return ResolvedKeybinding; }); /* harmony import */ var _errors_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./errors.js */ "./node_modules/monaco-editor/esm/vs/base/common/errors.js"); -/*--------------------------------------------------------------------------------------------- - * Copyright (c) Microsoft Corporation. All rights reserved. - * Licensed under the MIT License. See License.txt in the project root for license information. - *--------------------------------------------------------------------------------------------*/ - -var KeyCodeStrMap = /** @class */ (function () { - function KeyCodeStrMap() { - this._keyCodeToStr = []; - this._strToKeyCode = Object.create(null); - } - KeyCodeStrMap.prototype.define = function (keyCode, str) { - this._keyCodeToStr[keyCode] = str; - this._strToKeyCode[str.toLowerCase()] = keyCode; - }; - KeyCodeStrMap.prototype.keyCodeToStr = function (keyCode) { - return this._keyCodeToStr[keyCode]; - }; - KeyCodeStrMap.prototype.strToKeyCode = function (str) { - return this._strToKeyCode[str.toLowerCase()] || 0 /* Unknown */; - }; - return KeyCodeStrMap; -}()); -var uiMap = new KeyCodeStrMap(); -var userSettingsUSMap = new KeyCodeStrMap(); -var userSettingsGeneralMap = new KeyCodeStrMap(); -(function () { - function define(keyCode, uiLabel, usUserSettingsLabel, generalUserSettingsLabel) { - if (usUserSettingsLabel === void 0) { usUserSettingsLabel = uiLabel; } - if (generalUserSettingsLabel === void 0) { generalUserSettingsLabel = usUserSettingsLabel; } - uiMap.define(keyCode, uiLabel); - userSettingsUSMap.define(keyCode, usUserSettingsLabel); - userSettingsGeneralMap.define(keyCode, generalUserSettingsLabel); - } - define(0 /* Unknown */, 'unknown'); - define(1 /* Backspace */, 'Backspace'); - define(2 /* Tab */, 'Tab'); - define(3 /* Enter */, 'Enter'); - define(4 /* Shift */, 'Shift'); - define(5 /* Ctrl */, 'Ctrl'); - define(6 /* Alt */, 'Alt'); - define(7 /* PauseBreak */, 'PauseBreak'); - define(8 /* CapsLock */, 'CapsLock'); - define(9 /* Escape */, 'Escape'); - define(10 /* Space */, 'Space'); - define(11 /* PageUp */, 'PageUp'); - define(12 /* PageDown */, 'PageDown'); - define(13 /* End */, 'End'); - define(14 /* Home */, 'Home'); - define(15 /* LeftArrow */, 'LeftArrow', 'Left'); - define(16 /* UpArrow */, 'UpArrow', 'Up'); - define(17 /* RightArrow */, 'RightArrow', 'Right'); - define(18 /* DownArrow */, 'DownArrow', 'Down'); - define(19 /* Insert */, 'Insert'); - define(20 /* Delete */, 'Delete'); - define(21 /* KEY_0 */, '0'); - define(22 /* KEY_1 */, '1'); - define(23 /* KEY_2 */, '2'); - define(24 /* KEY_3 */, '3'); - define(25 /* KEY_4 */, '4'); - define(26 /* KEY_5 */, '5'); - define(27 /* KEY_6 */, '6'); - define(28 /* KEY_7 */, '7'); - define(29 /* KEY_8 */, '8'); - define(30 /* KEY_9 */, '9'); - define(31 /* KEY_A */, 'A'); - define(32 /* KEY_B */, 'B'); - define(33 /* KEY_C */, 'C'); - define(34 /* KEY_D */, 'D'); - define(35 /* KEY_E */, 'E'); - define(36 /* KEY_F */, 'F'); - define(37 /* KEY_G */, 'G'); - define(38 /* KEY_H */, 'H'); - define(39 /* KEY_I */, 'I'); - define(40 /* KEY_J */, 'J'); - define(41 /* KEY_K */, 'K'); - define(42 /* KEY_L */, 'L'); - define(43 /* KEY_M */, 'M'); - define(44 /* KEY_N */, 'N'); - define(45 /* KEY_O */, 'O'); - define(46 /* KEY_P */, 'P'); - define(47 /* KEY_Q */, 'Q'); - define(48 /* KEY_R */, 'R'); - define(49 /* KEY_S */, 'S'); - define(50 /* KEY_T */, 'T'); - define(51 /* KEY_U */, 'U'); - define(52 /* KEY_V */, 'V'); - define(53 /* KEY_W */, 'W'); - define(54 /* KEY_X */, 'X'); - define(55 /* KEY_Y */, 'Y'); - define(56 /* KEY_Z */, 'Z'); - define(57 /* Meta */, 'Meta'); - define(58 /* ContextMenu */, 'ContextMenu'); - define(59 /* F1 */, 'F1'); - define(60 /* F2 */, 'F2'); - define(61 /* F3 */, 'F3'); - define(62 /* F4 */, 'F4'); - define(63 /* F5 */, 'F5'); - define(64 /* F6 */, 'F6'); - define(65 /* F7 */, 'F7'); - define(66 /* F8 */, 'F8'); - define(67 /* F9 */, 'F9'); - define(68 /* F10 */, 'F10'); - define(69 /* F11 */, 'F11'); - define(70 /* F12 */, 'F12'); - define(71 /* F13 */, 'F13'); - define(72 /* F14 */, 'F14'); - define(73 /* F15 */, 'F15'); - define(74 /* F16 */, 'F16'); - define(75 /* F17 */, 'F17'); - define(76 /* F18 */, 'F18'); - define(77 /* F19 */, 'F19'); - define(78 /* NumLock */, 'NumLock'); - define(79 /* ScrollLock */, 'ScrollLock'); - define(80 /* US_SEMICOLON */, ';', ';', 'OEM_1'); - define(81 /* US_EQUAL */, '=', '=', 'OEM_PLUS'); - define(82 /* US_COMMA */, ',', ',', 'OEM_COMMA'); - define(83 /* US_MINUS */, '-', '-', 'OEM_MINUS'); - define(84 /* US_DOT */, '.', '.', 'OEM_PERIOD'); - define(85 /* US_SLASH */, '/', '/', 'OEM_2'); - define(86 /* US_BACKTICK */, '`', '`', 'OEM_3'); - define(110 /* ABNT_C1 */, 'ABNT_C1'); - define(111 /* ABNT_C2 */, 'ABNT_C2'); - define(87 /* US_OPEN_SQUARE_BRACKET */, '[', '[', 'OEM_4'); - define(88 /* US_BACKSLASH */, '\\', '\\', 'OEM_5'); - define(89 /* US_CLOSE_SQUARE_BRACKET */, ']', ']', 'OEM_6'); - define(90 /* US_QUOTE */, '\'', '\'', 'OEM_7'); - define(91 /* OEM_8 */, 'OEM_8'); - define(92 /* OEM_102 */, 'OEM_102'); - define(93 /* NUMPAD_0 */, 'NumPad0'); - define(94 /* NUMPAD_1 */, 'NumPad1'); - define(95 /* NUMPAD_2 */, 'NumPad2'); - define(96 /* NUMPAD_3 */, 'NumPad3'); - define(97 /* NUMPAD_4 */, 'NumPad4'); - define(98 /* NUMPAD_5 */, 'NumPad5'); - define(99 /* NUMPAD_6 */, 'NumPad6'); - define(100 /* NUMPAD_7 */, 'NumPad7'); - define(101 /* NUMPAD_8 */, 'NumPad8'); - define(102 /* NUMPAD_9 */, 'NumPad9'); - define(103 /* NUMPAD_MULTIPLY */, 'NumPad_Multiply'); - define(104 /* NUMPAD_ADD */, 'NumPad_Add'); - define(105 /* NUMPAD_SEPARATOR */, 'NumPad_Separator'); - define(106 /* NUMPAD_SUBTRACT */, 'NumPad_Subtract'); - define(107 /* NUMPAD_DECIMAL */, 'NumPad_Decimal'); - define(108 /* NUMPAD_DIVIDE */, 'NumPad_Divide'); -})(); -var KeyCodeUtils; -(function (KeyCodeUtils) { - function toString(keyCode) { - return uiMap.keyCodeToStr(keyCode); - } - KeyCodeUtils.toString = toString; - function fromString(key) { - return uiMap.strToKeyCode(key); - } - KeyCodeUtils.fromString = fromString; - function toUserSettingsUS(keyCode) { - return userSettingsUSMap.keyCodeToStr(keyCode); - } - KeyCodeUtils.toUserSettingsUS = toUserSettingsUS; - function toUserSettingsGeneral(keyCode) { - return userSettingsGeneralMap.keyCodeToStr(keyCode); - } - KeyCodeUtils.toUserSettingsGeneral = toUserSettingsGeneral; - function fromUserSettings(key) { - return userSettingsUSMap.strToKeyCode(key) || userSettingsGeneralMap.strToKeyCode(key); - } - KeyCodeUtils.fromUserSettings = fromUserSettings; -})(KeyCodeUtils || (KeyCodeUtils = {})); -function KeyChord(firstPart, secondPart) { - var chordPart = ((secondPart & 0x0000FFFF) << 16) >>> 0; - return (firstPart | chordPart) >>> 0; -} -function createKeybinding(keybinding, OS) { - if (keybinding === 0) { - return null; - } - var firstPart = (keybinding & 0x0000FFFF) >>> 0; - var chordPart = (keybinding & 0xFFFF0000) >>> 16; - if (chordPart !== 0) { - return new ChordKeybinding([ - createSimpleKeybinding(firstPart, OS), - createSimpleKeybinding(chordPart, OS) - ]); - } - return new ChordKeybinding([createSimpleKeybinding(firstPart, OS)]); -} -function createSimpleKeybinding(keybinding, OS) { - var ctrlCmd = (keybinding & 2048 /* CtrlCmd */ ? true : false); - var winCtrl = (keybinding & 256 /* WinCtrl */ ? true : false); - var ctrlKey = (OS === 2 /* Macintosh */ ? winCtrl : ctrlCmd); - var shiftKey = (keybinding & 1024 /* Shift */ ? true : false); - var altKey = (keybinding & 512 /* Alt */ ? true : false); - var metaKey = (OS === 2 /* Macintosh */ ? ctrlCmd : winCtrl); - var keyCode = (keybinding & 255 /* KeyCode */); - return new SimpleKeybinding(ctrlKey, shiftKey, altKey, metaKey, keyCode); -} -var SimpleKeybinding = /** @class */ (function () { - function SimpleKeybinding(ctrlKey, shiftKey, altKey, metaKey, keyCode) { - this.ctrlKey = ctrlKey; - this.shiftKey = shiftKey; - this.altKey = altKey; - this.metaKey = metaKey; - this.keyCode = keyCode; - } - SimpleKeybinding.prototype.equals = function (other) { - return (this.ctrlKey === other.ctrlKey - && this.shiftKey === other.shiftKey - && this.altKey === other.altKey - && this.metaKey === other.metaKey - && this.keyCode === other.keyCode); - }; - SimpleKeybinding.prototype.isModifierKey = function () { - return (this.keyCode === 0 /* Unknown */ - || this.keyCode === 5 /* Ctrl */ - || this.keyCode === 57 /* Meta */ - || this.keyCode === 6 /* Alt */ - || this.keyCode === 4 /* Shift */); - }; - SimpleKeybinding.prototype.toChord = function () { - return new ChordKeybinding([this]); - }; - /** - * Does this keybinding refer to the key code of a modifier and it also has the modifier flag? - */ - SimpleKeybinding.prototype.isDuplicateModifierCase = function () { - return ((this.ctrlKey && this.keyCode === 5 /* Ctrl */) - || (this.shiftKey && this.keyCode === 4 /* Shift */) - || (this.altKey && this.keyCode === 6 /* Alt */) - || (this.metaKey && this.keyCode === 57 /* Meta */)); - }; - return SimpleKeybinding; -}()); - -var ChordKeybinding = /** @class */ (function () { - function ChordKeybinding(parts) { - if (parts.length === 0) { - throw Object(_errors_js__WEBPACK_IMPORTED_MODULE_0__["illegalArgument"])("parts"); - } - this.parts = parts; - } - ChordKeybinding.prototype.equals = function (other) { - if (other === null) { - return false; - } - if (this.parts.length !== other.parts.length) { - return false; - } - for (var i = 0; i < this.parts.length; i++) { - if (!this.parts[i].equals(other.parts[i])) { - return false; - } - } - return true; - }; - return ChordKeybinding; -}()); - -var ResolvedKeybindingPart = /** @class */ (function () { - function ResolvedKeybindingPart(ctrlKey, shiftKey, altKey, metaKey, kbLabel, kbAriaLabel) { - this.ctrlKey = ctrlKey; - this.shiftKey = shiftKey; - this.altKey = altKey; - this.metaKey = metaKey; - this.keyLabel = kbLabel; - this.keyAriaLabel = kbAriaLabel; - } - return ResolvedKeybindingPart; -}()); - -/** - * A resolved keybinding. Can be a simple keybinding or a chord keybinding. - */ -var ResolvedKeybinding = /** @class */ (function () { - function ResolvedKeybinding() { - } - return ResolvedKeybinding; -}()); - +/*--------------------------------------------------------------------------------------------- + * Copyright (c) Microsoft Corporation. All rights reserved. + * Licensed under the MIT License. See License.txt in the project root for license information. + *--------------------------------------------------------------------------------------------*/ + +var KeyCodeStrMap = /** @class */ (function () { + function KeyCodeStrMap() { + this._keyCodeToStr = []; + this._strToKeyCode = Object.create(null); + } + KeyCodeStrMap.prototype.define = function (keyCode, str) { + this._keyCodeToStr[keyCode] = str; + this._strToKeyCode[str.toLowerCase()] = keyCode; + }; + KeyCodeStrMap.prototype.keyCodeToStr = function (keyCode) { + return this._keyCodeToStr[keyCode]; + }; + KeyCodeStrMap.prototype.strToKeyCode = function (str) { + return this._strToKeyCode[str.toLowerCase()] || 0 /* Unknown */; + }; + return KeyCodeStrMap; +}()); +var uiMap = new KeyCodeStrMap(); +var userSettingsUSMap = new KeyCodeStrMap(); +var userSettingsGeneralMap = new KeyCodeStrMap(); +(function () { + function define(keyCode, uiLabel, usUserSettingsLabel, generalUserSettingsLabel) { + if (usUserSettingsLabel === void 0) { usUserSettingsLabel = uiLabel; } + if (generalUserSettingsLabel === void 0) { generalUserSettingsLabel = usUserSettingsLabel; } + uiMap.define(keyCode, uiLabel); + userSettingsUSMap.define(keyCode, usUserSettingsLabel); + userSettingsGeneralMap.define(keyCode, generalUserSettingsLabel); + } + define(0 /* Unknown */, 'unknown'); + define(1 /* Backspace */, 'Backspace'); + define(2 /* Tab */, 'Tab'); + define(3 /* Enter */, 'Enter'); + define(4 /* Shift */, 'Shift'); + define(5 /* Ctrl */, 'Ctrl'); + define(6 /* Alt */, 'Alt'); + define(7 /* PauseBreak */, 'PauseBreak'); + define(8 /* CapsLock */, 'CapsLock'); + define(9 /* Escape */, 'Escape'); + define(10 /* Space */, 'Space'); + define(11 /* PageUp */, 'PageUp'); + define(12 /* PageDown */, 'PageDown'); + define(13 /* End */, 'End'); + define(14 /* Home */, 'Home'); + define(15 /* LeftArrow */, 'LeftArrow', 'Left'); + define(16 /* UpArrow */, 'UpArrow', 'Up'); + define(17 /* RightArrow */, 'RightArrow', 'Right'); + define(18 /* DownArrow */, 'DownArrow', 'Down'); + define(19 /* Insert */, 'Insert'); + define(20 /* Delete */, 'Delete'); + define(21 /* KEY_0 */, '0'); + define(22 /* KEY_1 */, '1'); + define(23 /* KEY_2 */, '2'); + define(24 /* KEY_3 */, '3'); + define(25 /* KEY_4 */, '4'); + define(26 /* KEY_5 */, '5'); + define(27 /* KEY_6 */, '6'); + define(28 /* KEY_7 */, '7'); + define(29 /* KEY_8 */, '8'); + define(30 /* KEY_9 */, '9'); + define(31 /* KEY_A */, 'A'); + define(32 /* KEY_B */, 'B'); + define(33 /* KEY_C */, 'C'); + define(34 /* KEY_D */, 'D'); + define(35 /* KEY_E */, 'E'); + define(36 /* KEY_F */, 'F'); + define(37 /* KEY_G */, 'G'); + define(38 /* KEY_H */, 'H'); + define(39 /* KEY_I */, 'I'); + define(40 /* KEY_J */, 'J'); + define(41 /* KEY_K */, 'K'); + define(42 /* KEY_L */, 'L'); + define(43 /* KEY_M */, 'M'); + define(44 /* KEY_N */, 'N'); + define(45 /* KEY_O */, 'O'); + define(46 /* KEY_P */, 'P'); + define(47 /* KEY_Q */, 'Q'); + define(48 /* KEY_R */, 'R'); + define(49 /* KEY_S */, 'S'); + define(50 /* KEY_T */, 'T'); + define(51 /* KEY_U */, 'U'); + define(52 /* KEY_V */, 'V'); + define(53 /* KEY_W */, 'W'); + define(54 /* KEY_X */, 'X'); + define(55 /* KEY_Y */, 'Y'); + define(56 /* KEY_Z */, 'Z'); + define(57 /* Meta */, 'Meta'); + define(58 /* ContextMenu */, 'ContextMenu'); + define(59 /* F1 */, 'F1'); + define(60 /* F2 */, 'F2'); + define(61 /* F3 */, 'F3'); + define(62 /* F4 */, 'F4'); + define(63 /* F5 */, 'F5'); + define(64 /* F6 */, 'F6'); + define(65 /* F7 */, 'F7'); + define(66 /* F8 */, 'F8'); + define(67 /* F9 */, 'F9'); + define(68 /* F10 */, 'F10'); + define(69 /* F11 */, 'F11'); + define(70 /* F12 */, 'F12'); + define(71 /* F13 */, 'F13'); + define(72 /* F14 */, 'F14'); + define(73 /* F15 */, 'F15'); + define(74 /* F16 */, 'F16'); + define(75 /* F17 */, 'F17'); + define(76 /* F18 */, 'F18'); + define(77 /* F19 */, 'F19'); + define(78 /* NumLock */, 'NumLock'); + define(79 /* ScrollLock */, 'ScrollLock'); + define(80 /* US_SEMICOLON */, ';', ';', 'OEM_1'); + define(81 /* US_EQUAL */, '=', '=', 'OEM_PLUS'); + define(82 /* US_COMMA */, ',', ',', 'OEM_COMMA'); + define(83 /* US_MINUS */, '-', '-', 'OEM_MINUS'); + define(84 /* US_DOT */, '.', '.', 'OEM_PERIOD'); + define(85 /* US_SLASH */, '/', '/', 'OEM_2'); + define(86 /* US_BACKTICK */, '`', '`', 'OEM_3'); + define(110 /* ABNT_C1 */, 'ABNT_C1'); + define(111 /* ABNT_C2 */, 'ABNT_C2'); + define(87 /* US_OPEN_SQUARE_BRACKET */, '[', '[', 'OEM_4'); + define(88 /* US_BACKSLASH */, '\\', '\\', 'OEM_5'); + define(89 /* US_CLOSE_SQUARE_BRACKET */, ']', ']', 'OEM_6'); + define(90 /* US_QUOTE */, '\'', '\'', 'OEM_7'); + define(91 /* OEM_8 */, 'OEM_8'); + define(92 /* OEM_102 */, 'OEM_102'); + define(93 /* NUMPAD_0 */, 'NumPad0'); + define(94 /* NUMPAD_1 */, 'NumPad1'); + define(95 /* NUMPAD_2 */, 'NumPad2'); + define(96 /* NUMPAD_3 */, 'NumPad3'); + define(97 /* NUMPAD_4 */, 'NumPad4'); + define(98 /* NUMPAD_5 */, 'NumPad5'); + define(99 /* NUMPAD_6 */, 'NumPad6'); + define(100 /* NUMPAD_7 */, 'NumPad7'); + define(101 /* NUMPAD_8 */, 'NumPad8'); + define(102 /* NUMPAD_9 */, 'NumPad9'); + define(103 /* NUMPAD_MULTIPLY */, 'NumPad_Multiply'); + define(104 /* NUMPAD_ADD */, 'NumPad_Add'); + define(105 /* NUMPAD_SEPARATOR */, 'NumPad_Separator'); + define(106 /* NUMPAD_SUBTRACT */, 'NumPad_Subtract'); + define(107 /* NUMPAD_DECIMAL */, 'NumPad_Decimal'); + define(108 /* NUMPAD_DIVIDE */, 'NumPad_Divide'); +})(); +var KeyCodeUtils; +(function (KeyCodeUtils) { + function toString(keyCode) { + return uiMap.keyCodeToStr(keyCode); + } + KeyCodeUtils.toString = toString; + function fromString(key) { + return uiMap.strToKeyCode(key); + } + KeyCodeUtils.fromString = fromString; + function toUserSettingsUS(keyCode) { + return userSettingsUSMap.keyCodeToStr(keyCode); + } + KeyCodeUtils.toUserSettingsUS = toUserSettingsUS; + function toUserSettingsGeneral(keyCode) { + return userSettingsGeneralMap.keyCodeToStr(keyCode); + } + KeyCodeUtils.toUserSettingsGeneral = toUserSettingsGeneral; + function fromUserSettings(key) { + return userSettingsUSMap.strToKeyCode(key) || userSettingsGeneralMap.strToKeyCode(key); + } + KeyCodeUtils.fromUserSettings = fromUserSettings; +})(KeyCodeUtils || (KeyCodeUtils = {})); +function KeyChord(firstPart, secondPart) { + var chordPart = ((secondPart & 0x0000FFFF) << 16) >>> 0; + return (firstPart | chordPart) >>> 0; +} +function createKeybinding(keybinding, OS) { + if (keybinding === 0) { + return null; + } + var firstPart = (keybinding & 0x0000FFFF) >>> 0; + var chordPart = (keybinding & 0xFFFF0000) >>> 16; + if (chordPart !== 0) { + return new ChordKeybinding([ + createSimpleKeybinding(firstPart, OS), + createSimpleKeybinding(chordPart, OS) + ]); + } + return new ChordKeybinding([createSimpleKeybinding(firstPart, OS)]); +} +function createSimpleKeybinding(keybinding, OS) { + var ctrlCmd = (keybinding & 2048 /* CtrlCmd */ ? true : false); + var winCtrl = (keybinding & 256 /* WinCtrl */ ? true : false); + var ctrlKey = (OS === 2 /* Macintosh */ ? winCtrl : ctrlCmd); + var shiftKey = (keybinding & 1024 /* Shift */ ? true : false); + var altKey = (keybinding & 512 /* Alt */ ? true : false); + var metaKey = (OS === 2 /* Macintosh */ ? ctrlCmd : winCtrl); + var keyCode = (keybinding & 255 /* KeyCode */); + return new SimpleKeybinding(ctrlKey, shiftKey, altKey, metaKey, keyCode); +} +var SimpleKeybinding = /** @class */ (function () { + function SimpleKeybinding(ctrlKey, shiftKey, altKey, metaKey, keyCode) { + this.ctrlKey = ctrlKey; + this.shiftKey = shiftKey; + this.altKey = altKey; + this.metaKey = metaKey; + this.keyCode = keyCode; + } + SimpleKeybinding.prototype.equals = function (other) { + return (this.ctrlKey === other.ctrlKey + && this.shiftKey === other.shiftKey + && this.altKey === other.altKey + && this.metaKey === other.metaKey + && this.keyCode === other.keyCode); + }; + SimpleKeybinding.prototype.isModifierKey = function () { + return (this.keyCode === 0 /* Unknown */ + || this.keyCode === 5 /* Ctrl */ + || this.keyCode === 57 /* Meta */ + || this.keyCode === 6 /* Alt */ + || this.keyCode === 4 /* Shift */); + }; + SimpleKeybinding.prototype.toChord = function () { + return new ChordKeybinding([this]); + }; + /** + * Does this keybinding refer to the key code of a modifier and it also has the modifier flag? + */ + SimpleKeybinding.prototype.isDuplicateModifierCase = function () { + return ((this.ctrlKey && this.keyCode === 5 /* Ctrl */) + || (this.shiftKey && this.keyCode === 4 /* Shift */) + || (this.altKey && this.keyCode === 6 /* Alt */) + || (this.metaKey && this.keyCode === 57 /* Meta */)); + }; + return SimpleKeybinding; +}()); + +var ChordKeybinding = /** @class */ (function () { + function ChordKeybinding(parts) { + if (parts.length === 0) { + throw Object(_errors_js__WEBPACK_IMPORTED_MODULE_0__["illegalArgument"])("parts"); + } + this.parts = parts; + } + ChordKeybinding.prototype.equals = function (other) { + if (other === null) { + return false; + } + if (this.parts.length !== other.parts.length) { + return false; + } + for (var i = 0; i < this.parts.length; i++) { + if (!this.parts[i].equals(other.parts[i])) { + return false; + } + } + return true; + }; + return ChordKeybinding; +}()); + +var ResolvedKeybindingPart = /** @class */ (function () { + function ResolvedKeybindingPart(ctrlKey, shiftKey, altKey, metaKey, kbLabel, kbAriaLabel) { + this.ctrlKey = ctrlKey; + this.shiftKey = shiftKey; + this.altKey = altKey; + this.metaKey = metaKey; + this.keyLabel = kbLabel; + this.keyAriaLabel = kbAriaLabel; + } + return ResolvedKeybindingPart; +}()); + +/** + * A resolved keybinding. Can be a simple keybinding or a chord keybinding. + */ +var ResolvedKeybinding = /** @class */ (function () { + function ResolvedKeybinding() { + } + return ResolvedKeybinding; +}()); + /***/ }), @@ -2738,7 +2959,7 @@ var ResolvedKeybinding = /** @class */ (function () { /*!********************************************************************!*\ !*** ./node_modules/monaco-editor/esm/vs/base/common/lifecycle.js ***! \********************************************************************/ -/*! exports provided: isDisposable, dispose, combinedDisposable, toDisposable, Disposable, ImmortalReference */ +/*! exports provided: isDisposable, dispose, combinedDisposable, toDisposable, DisposableStore, Disposable, MutableDisposable, ImmortalReference */ /***/ (function(module, __webpack_exports__, __webpack_require__) { "use strict"; @@ -2747,71 +2968,199 @@ __webpack_require__.r(__webpack_exports__); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "dispose", function() { return dispose; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "combinedDisposable", function() { return combinedDisposable; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "toDisposable", function() { return toDisposable; }); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "DisposableStore", function() { return DisposableStore; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "Disposable", function() { return Disposable; }); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "MutableDisposable", function() { return MutableDisposable; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "ImmortalReference", function() { return ImmortalReference; }); -function isDisposable(thing) { - return typeof thing.dispose === 'function' - && thing.dispose.length === 0; -} -function dispose(first) { - var rest = []; - for (var _i = 1; _i < arguments.length; _i++) { - rest[_i - 1] = arguments[_i]; - } - if (Array.isArray(first)) { - first.forEach(function (d) { return d && d.dispose(); }); - return []; - } - else if (rest.length === 0) { - if (first) { - first.dispose(); - return first; - } - return undefined; - } - else { - dispose(first); - dispose(rest); - return []; - } -} -function combinedDisposable(disposables) { - return { dispose: function () { return dispose(disposables); } }; -} -function toDisposable(fn) { - return { dispose: function () { fn(); } }; -} -var Disposable = /** @class */ (function () { - function Disposable() { - this._toDispose = []; - this._lifecycle_disposable_isDisposed = false; - } - Disposable.prototype.dispose = function () { - this._lifecycle_disposable_isDisposed = true; - this._toDispose = dispose(this._toDispose); - }; - Disposable.prototype._register = function (t) { - if (this._lifecycle_disposable_isDisposed) { - console.warn('Registering disposable on object that has already been disposed.'); - t.dispose(); - } - else { - this._toDispose.push(t); - } - return t; - }; - Disposable.None = Object.freeze({ dispose: function () { } }); - return Disposable; -}()); - -var ImmortalReference = /** @class */ (function () { - function ImmortalReference(object) { - this.object = object; - } - ImmortalReference.prototype.dispose = function () { }; - return ImmortalReference; -}()); - +/** + * Enables logging of potentially leaked disposables. + * + * A disposable is considered leaked if it is not disposed or not registered as the child of + * another disposable. This tracking is very simple an only works for classes that either + * extend Disposable or use a DisposableStore. This means there are a lot of false positives. + */ +var TRACK_DISPOSABLES = false; +var __is_disposable_tracked__ = '__is_disposable_tracked__'; +function markTracked(x) { + if (!TRACK_DISPOSABLES) { + return; + } + if (x && x !== Disposable.None) { + try { + x[__is_disposable_tracked__] = true; + } + catch (_a) { + // noop + } + } +} +function trackDisposable(x) { + if (!TRACK_DISPOSABLES) { + return x; + } + var stack = new Error('Potentially leaked disposable').stack; + setTimeout(function () { + if (!x[__is_disposable_tracked__]) { + console.log(stack); + } + }, 3000); + return x; +} +function isDisposable(thing) { + return typeof thing.dispose === 'function' + && thing.dispose.length === 0; +} +function dispose(disposables) { + if (Array.isArray(disposables)) { + disposables.forEach(function (d) { + if (d) { + markTracked(d); + d.dispose(); + } + }); + return []; + } + else if (disposables) { + markTracked(disposables); + disposables.dispose(); + return disposables; + } + else { + return undefined; + } +} +function combinedDisposable() { + var disposables = []; + for (var _i = 0; _i < arguments.length; _i++) { + disposables[_i] = arguments[_i]; + } + disposables.forEach(markTracked); + return trackDisposable({ dispose: function () { return dispose(disposables); } }); +} +function toDisposable(fn) { + var self = trackDisposable({ + dispose: function () { + markTracked(self); + fn(); + } + }); + return self; +} +var DisposableStore = /** @class */ (function () { + function DisposableStore() { + this._toDispose = new Set(); + this._isDisposed = false; + } + /** + * Dispose of all registered disposables and mark this object as disposed. + * + * Any future disposables added to this object will be disposed of on `add`. + */ + DisposableStore.prototype.dispose = function () { + if (this._isDisposed) { + return; + } + markTracked(this); + this._isDisposed = true; + this.clear(); + }; + /** + * Dispose of all registered disposables but do not mark this object as disposed. + */ + DisposableStore.prototype.clear = function () { + this._toDispose.forEach(function (item) { return item.dispose(); }); + this._toDispose.clear(); + }; + DisposableStore.prototype.add = function (t) { + if (!t) { + return t; + } + if (t === this) { + throw new Error('Cannot register a disposable on itself!'); + } + markTracked(t); + if (this._isDisposed) { + console.warn(new Error('Trying to add a disposable to a DisposableStore that has already been disposed of. The added object will be leaked!').stack); + } + else { + this._toDispose.add(t); + } + return t; + }; + return DisposableStore; +}()); + +var Disposable = /** @class */ (function () { + function Disposable() { + this._store = new DisposableStore(); + trackDisposable(this); + } + Disposable.prototype.dispose = function () { + markTracked(this); + this._store.dispose(); + }; + Disposable.prototype._register = function (t) { + if (t === this) { + throw new Error('Cannot register a disposable on itself!'); + } + return this._store.add(t); + }; + Disposable.None = Object.freeze({ dispose: function () { } }); + return Disposable; +}()); + +/** + * Manages the lifecycle of a disposable value that may be changed. + * + * This ensures that when the the disposable value is changed, the previously held disposable is disposed of. You can + * also register a `MutableDisposable` on a `Disposable` to ensure it is automatically cleaned up. + */ +var MutableDisposable = /** @class */ (function () { + function MutableDisposable() { + this._isDisposed = false; + trackDisposable(this); + } + Object.defineProperty(MutableDisposable.prototype, "value", { + get: function () { + return this._isDisposed ? undefined : this._value; + }, + set: function (value) { + if (this._isDisposed || value === this._value) { + return; + } + if (this._value) { + this._value.dispose(); + } + if (value) { + markTracked(value); + } + this._value = value; + }, + enumerable: true, + configurable: true + }); + MutableDisposable.prototype.clear = function () { + this.value = undefined; + }; + MutableDisposable.prototype.dispose = function () { + this._isDisposed = true; + markTracked(this); + if (this._value) { + this._value.dispose(); + } + this._value = undefined; + }; + return MutableDisposable; +}()); + +var ImmortalReference = /** @class */ (function () { + function ImmortalReference(object) { + this.object = object; + } + ImmortalReference.prototype.dispose = function () { }; + return ImmortalReference; +}()); + /***/ }), @@ -2827,141 +3176,151 @@ var ImmortalReference = /** @class */ (function () { __webpack_require__.r(__webpack_exports__); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "LinkedList", function() { return LinkedList; }); /* harmony import */ var _iterator_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./iterator.js */ "./node_modules/monaco-editor/esm/vs/base/common/iterator.js"); -/*--------------------------------------------------------------------------------------------- - * Copyright (c) Microsoft Corporation. All rights reserved. - * Licensed under the MIT License. See License.txt in the project root for license information. - *--------------------------------------------------------------------------------------------*/ - -var Node = /** @class */ (function () { - function Node(element) { - this.element = element; - this.next = Node.Undefined; - this.prev = Node.Undefined; - } - Node.Undefined = new Node(undefined); - return Node; -}()); -var LinkedList = /** @class */ (function () { - function LinkedList() { - this._first = Node.Undefined; - this._last = Node.Undefined; - this._size = 0; - } - Object.defineProperty(LinkedList.prototype, "size", { - get: function () { - return this._size; - }, - enumerable: true, - configurable: true - }); - LinkedList.prototype.isEmpty = function () { - return this._first === Node.Undefined; - }; - LinkedList.prototype.clear = function () { - this._first = Node.Undefined; - this._last = Node.Undefined; - this._size = 0; - }; - LinkedList.prototype.unshift = function (element) { - return this._insert(element, false); - }; - LinkedList.prototype.push = function (element) { - return this._insert(element, true); - }; - LinkedList.prototype._insert = function (element, atTheEnd) { - var _this = this; - var newNode = new Node(element); - if (this._first === Node.Undefined) { - this._first = newNode; - this._last = newNode; - } - else if (atTheEnd) { - // push - var oldLast = this._last; - this._last = newNode; - newNode.prev = oldLast; - oldLast.next = newNode; - } - else { - // unshift - var oldFirst = this._first; - this._first = newNode; - newNode.next = oldFirst; - oldFirst.prev = newNode; - } - this._size += 1; - var didRemove = false; - return function () { - if (!didRemove) { - didRemove = true; - _this._remove(newNode); - } - }; - }; - LinkedList.prototype.shift = function () { - if (this._first === Node.Undefined) { - return undefined; - } - else { - var res = this._first.element; - this._remove(this._first); - return res; - } - }; - LinkedList.prototype._remove = function (node) { - if (node.prev !== Node.Undefined && node.next !== Node.Undefined) { - // middle - var anchor = node.prev; - anchor.next = node.next; - node.next.prev = anchor; - } - else if (node.prev === Node.Undefined && node.next === Node.Undefined) { - // only node - this._first = Node.Undefined; - this._last = Node.Undefined; - } - else if (node.next === Node.Undefined) { - // last - this._last = this._last.prev; - this._last.next = Node.Undefined; - } - else if (node.prev === Node.Undefined) { - // first - this._first = this._first.next; - this._first.prev = Node.Undefined; - } - // done - this._size -= 1; - }; - LinkedList.prototype.iterator = function () { - var element; - var node = this._first; - return { - next: function () { - if (node === Node.Undefined) { - return _iterator_js__WEBPACK_IMPORTED_MODULE_0__["FIN"]; - } - if (!element) { - element = { done: false, value: node.element }; - } - else { - element.value = node.element; - } - node = node.next; - return element; - } - }; - }; - LinkedList.prototype.toArray = function () { - var result = []; - for (var node = this._first; node !== Node.Undefined; node = node.next) { - result.push(node.element); - } - return result; - }; - return LinkedList; -}()); - +/*--------------------------------------------------------------------------------------------- + * Copyright (c) Microsoft Corporation. All rights reserved. + * Licensed under the MIT License. See License.txt in the project root for license information. + *--------------------------------------------------------------------------------------------*/ + +var Node = /** @class */ (function () { + function Node(element) { + this.element = element; + this.next = Node.Undefined; + this.prev = Node.Undefined; + } + Node.Undefined = new Node(undefined); + return Node; +}()); +var LinkedList = /** @class */ (function () { + function LinkedList() { + this._first = Node.Undefined; + this._last = Node.Undefined; + this._size = 0; + } + Object.defineProperty(LinkedList.prototype, "size", { + get: function () { + return this._size; + }, + enumerable: true, + configurable: true + }); + LinkedList.prototype.isEmpty = function () { + return this._first === Node.Undefined; + }; + LinkedList.prototype.clear = function () { + this._first = Node.Undefined; + this._last = Node.Undefined; + this._size = 0; + }; + LinkedList.prototype.unshift = function (element) { + return this._insert(element, false); + }; + LinkedList.prototype.push = function (element) { + return this._insert(element, true); + }; + LinkedList.prototype._insert = function (element, atTheEnd) { + var _this = this; + var newNode = new Node(element); + if (this._first === Node.Undefined) { + this._first = newNode; + this._last = newNode; + } + else if (atTheEnd) { + // push + var oldLast = this._last; + this._last = newNode; + newNode.prev = oldLast; + oldLast.next = newNode; + } + else { + // unshift + var oldFirst = this._first; + this._first = newNode; + newNode.next = oldFirst; + oldFirst.prev = newNode; + } + this._size += 1; + var didRemove = false; + return function () { + if (!didRemove) { + didRemove = true; + _this._remove(newNode); + } + }; + }; + LinkedList.prototype.shift = function () { + if (this._first === Node.Undefined) { + return undefined; + } + else { + var res = this._first.element; + this._remove(this._first); + return res; + } + }; + LinkedList.prototype.pop = function () { + if (this._last === Node.Undefined) { + return undefined; + } + else { + var res = this._last.element; + this._remove(this._last); + return res; + } + }; + LinkedList.prototype._remove = function (node) { + if (node.prev !== Node.Undefined && node.next !== Node.Undefined) { + // middle + var anchor = node.prev; + anchor.next = node.next; + node.next.prev = anchor; + } + else if (node.prev === Node.Undefined && node.next === Node.Undefined) { + // only node + this._first = Node.Undefined; + this._last = Node.Undefined; + } + else if (node.next === Node.Undefined) { + // last + this._last = this._last.prev; + this._last.next = Node.Undefined; + } + else if (node.prev === Node.Undefined) { + // first + this._first = this._first.next; + this._first.prev = Node.Undefined; + } + // done + this._size -= 1; + }; + LinkedList.prototype.iterator = function () { + var element; + var node = this._first; + return { + next: function () { + if (node === Node.Undefined) { + return _iterator_js__WEBPACK_IMPORTED_MODULE_0__["FIN"]; + } + if (!element) { + element = { done: false, value: node.element }; + } + else { + element.value = node.element; + } + node = node.next; + return element; + } + }; + }; + LinkedList.prototype.toArray = function () { + var result = []; + for (var node = this._first; node !== Node.Undefined; node = node.next) { + result.push(node.element); + } + return result; + }; + return LinkedList; +}()); + /***/ }), @@ -2970,7 +3329,7 @@ var LinkedList = /** @class */ (function () { /*!*******************************************************************!*\ !*** ./node_modules/monaco-editor/esm/vs/base/common/platform.js ***! \*******************************************************************/ -/*! exports provided: isWindows, isMacintosh, isLinux, isNative, isWeb, globals, setImmediate, OS */ +/*! exports provided: isWindows, isMacintosh, isLinux, isNative, isWeb, isIOS, globals, setImmediate, OS */ /***/ (function(module, __webpack_exports__, __webpack_require__) { "use strict"; @@ -2980,89 +3339,111 @@ __webpack_require__.r(__webpack_exports__); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "isLinux", function() { return isLinux; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "isNative", function() { return isNative; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "isWeb", function() { return isWeb; }); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "isIOS", function() { return isIOS; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "globals", function() { return globals; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "setImmediate", function() { return setImmediate; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "OS", function() { return OS; }); -/*--------------------------------------------------------------------------------------------- - * Copyright (c) Microsoft Corporation. All rights reserved. - * Licensed under the MIT License. See License.txt in the project root for license information. - *--------------------------------------------------------------------------------------------*/ -var LANGUAGE_DEFAULT = 'en'; -var _isWindows = false; -var _isMacintosh = false; -var _isLinux = false; -var _isNative = false; -var _isWeb = false; -var _locale = undefined; -var _language = LANGUAGE_DEFAULT; -var _translationsConfigFile = undefined; -var isElectronRenderer = (typeof process !== 'undefined' && typeof process.versions !== 'undefined' && typeof process.versions.electron !== 'undefined' && process.type === 'renderer'); -// OS detection -if (typeof navigator === 'object' && !isElectronRenderer) { - var userAgent = navigator.userAgent; - _isWindows = userAgent.indexOf('Windows') >= 0; - _isMacintosh = userAgent.indexOf('Macintosh') >= 0; - _isLinux = userAgent.indexOf('Linux') >= 0; - _isWeb = true; - _locale = navigator.language; - _language = _locale; -} -else if (typeof process === 'object') { - _isWindows = (process.platform === 'win32'); - _isMacintosh = (process.platform === 'darwin'); - _isLinux = (process.platform === 'linux'); - _locale = LANGUAGE_DEFAULT; - _language = LANGUAGE_DEFAULT; - var rawNlsConfig = process.env['VSCODE_NLS_CONFIG']; - if (rawNlsConfig) { - try { - var nlsConfig = JSON.parse(rawNlsConfig); - var resolved = nlsConfig.availableLanguages['*']; - _locale = nlsConfig.locale; - // VSCode's default language is 'en' - _language = resolved ? resolved : LANGUAGE_DEFAULT; - _translationsConfigFile = nlsConfig._translationsConfigFile; - } - catch (e) { - } - } - _isNative = true; -} -var _platform = 0 /* Web */; -if (_isNative) { - if (_isMacintosh) { - _platform = 1 /* Mac */; - } - else if (_isWindows) { - _platform = 3 /* Windows */; - } - else if (_isLinux) { - _platform = 2 /* Linux */; - } -} -var isWindows = _isWindows; -var isMacintosh = _isMacintosh; -var isLinux = _isLinux; -var isNative = _isNative; -var isWeb = _isWeb; -var _globals = (typeof self === 'object' ? self : typeof global === 'object' ? global : {}); -var globals = _globals; -var _setImmediate = null; -function setImmediate(callback) { - if (_setImmediate === null) { - if (globals.setImmediate) { - _setImmediate = globals.setImmediate.bind(globals); - } - else if (typeof process !== 'undefined' && typeof process.nextTick === 'function') { - _setImmediate = process.nextTick.bind(process); - } - else { - _setImmediate = globals.setTimeout.bind(globals); - } - } - return _setImmediate(callback); -} -var OS = (_isMacintosh ? 2 /* Macintosh */ : (_isWindows ? 1 /* Windows */ : 3 /* Linux */)); +/*--------------------------------------------------------------------------------------------- + * Copyright (c) Microsoft Corporation. All rights reserved. + * Licensed under the MIT License. See License.txt in the project root for license information. + *--------------------------------------------------------------------------------------------*/ +var LANGUAGE_DEFAULT = 'en'; +var _isWindows = false; +var _isMacintosh = false; +var _isLinux = false; +var _isNative = false; +var _isWeb = false; +var _isIOS = false; +var _locale = undefined; +var _language = LANGUAGE_DEFAULT; +var _translationsConfigFile = undefined; +var _userAgent = undefined; +var isElectronRenderer = (typeof process !== 'undefined' && typeof process.versions !== 'undefined' && typeof process.versions.electron !== 'undefined' && process.type === 'renderer'); +// OS detection +if (typeof navigator === 'object' && !isElectronRenderer) { + _userAgent = navigator.userAgent; + _isWindows = _userAgent.indexOf('Windows') >= 0; + _isMacintosh = _userAgent.indexOf('Macintosh') >= 0; + _isIOS = _userAgent.indexOf('Macintosh') >= 0 && !!navigator.maxTouchPoints && navigator.maxTouchPoints > 0; + _isLinux = _userAgent.indexOf('Linux') >= 0; + _isWeb = true; + _locale = navigator.language; + _language = _locale; +} +else if (typeof process === 'object') { + _isWindows = (process.platform === 'win32'); + _isMacintosh = (process.platform === 'darwin'); + _isLinux = (process.platform === 'linux'); + _locale = LANGUAGE_DEFAULT; + _language = LANGUAGE_DEFAULT; + var rawNlsConfig = process.env['VSCODE_NLS_CONFIG']; + if (rawNlsConfig) { + try { + var nlsConfig = JSON.parse(rawNlsConfig); + var resolved = nlsConfig.availableLanguages['*']; + _locale = nlsConfig.locale; + // VSCode's default language is 'en' + _language = resolved ? resolved : LANGUAGE_DEFAULT; + _translationsConfigFile = nlsConfig._translationsConfigFile; + } + catch (e) { + } + } + _isNative = true; +} +var _platform = 0 /* Web */; +if (_isMacintosh) { + _platform = 1 /* Mac */; +} +else if (_isWindows) { + _platform = 3 /* Windows */; +} +else if (_isLinux) { + _platform = 2 /* Linux */; +} +var isWindows = _isWindows; +var isMacintosh = _isMacintosh; +var isLinux = _isLinux; +var isNative = _isNative; +var isWeb = _isWeb; +var isIOS = _isIOS; +var _globals = (typeof self === 'object' ? self : typeof global === 'object' ? global : {}); +var globals = _globals; +var setImmediate = (function defineSetImmediate() { + if (globals.setImmediate) { + return globals.setImmediate.bind(globals); + } + if (typeof globals.postMessage === 'function' && !globals.importScripts) { + var pending_1 = []; + globals.addEventListener('message', function (e) { + if (e.data && e.data.vscodeSetImmediateId) { + for (var i = 0, len = pending_1.length; i < len; i++) { + var candidate = pending_1[i]; + if (candidate.id === e.data.vscodeSetImmediateId) { + pending_1.splice(i, 1); + candidate.callback(); + return; + } + } + } + }); + var lastId_1 = 0; + return function (callback) { + var myId = ++lastId_1; + pending_1.push({ + id: myId, + callback: callback + }); + globals.postMessage({ vscodeSetImmediateId: myId }, '*'); + }; + } + if (typeof process !== 'undefined' && typeof process.nextTick === 'function') { + return process.nextTick.bind(process); + } + var _promise = Promise.resolve(); + return function (callback) { return _promise.then(callback); }; +})(); +var OS = (_isMacintosh ? 2 /* Macintosh */ : (_isWindows ? 1 /* Windows */ : 3 /* Linux */)); /***/ }), @@ -3071,12 +3452,11 @@ var OS = (_isMacintosh ? 2 /* Macintosh */ : (_isWindows ? 1 /* Windows */ : 3 / /*!******************************************************************!*\ !*** ./node_modules/monaco-editor/esm/vs/base/common/strings.js ***! \******************************************************************/ -/*! exports provided: empty, isFalsyOrWhitespace, pad, format, escape, escapeRegExpCharacters, trim, ltrim, rtrim, convertSimple2RegExpPattern, startsWith, endsWith, createRegExp, regExpLeadsToEndlessLoop, regExpFlags, firstNonWhitespaceIndex, getLeadingWhitespace, lastNonWhitespaceIndex, compare, isLowerAsciiLetter, isUpperAsciiLetter, equalsIgnoreCase, startsWithIgnoreCase, commonPrefixLength, commonSuffixLength, isHighSurrogate, isLowSurrogate, containsRTL, containsEmoji, isBasicASCII, containsFullWidthCharacter, isFullWidthCharacter, UTF8_BOM_CHARACTER, startsWithUTF8BOM, safeBtoa, repeat */ +/*! exports provided: isFalsyOrWhitespace, pad, format, escape, escapeRegExpCharacters, trim, ltrim, rtrim, convertSimple2RegExpPattern, startsWith, endsWith, createRegExp, regExpLeadsToEndlessLoop, regExpFlags, firstNonWhitespaceIndex, getLeadingWhitespace, lastNonWhitespaceIndex, compare, compareIgnoreCase, isLowerAsciiLetter, isUpperAsciiLetter, equalsIgnoreCase, startsWithIgnoreCase, commonPrefixLength, commonSuffixLength, isHighSurrogate, isLowSurrogate, getNextCodePoint, nextCharLength, prevCharLength, getCharContainingOffset, containsRTL, containsEmoji, isBasicASCII, containsFullWidthCharacter, isFullWidthCharacter, isEmojiImprecise, UTF8_BOM_CHARACTER, startsWithUTF8BOM, safeBtoa, repeat, containsUppercaseCharacter, singleLetterHash, getGraphemeBreakType, breakBetweenGraphemeBreakType */ /***/ (function(module, __webpack_exports__, __webpack_require__) { "use strict"; __webpack_require__.r(__webpack_exports__); -/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "empty", function() { return empty; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "isFalsyOrWhitespace", function() { return isFalsyOrWhitespace; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "pad", function() { return pad; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "format", function() { return format; }); @@ -3095,6 +3475,7 @@ __webpack_require__.r(__webpack_exports__); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "getLeadingWhitespace", function() { return getLeadingWhitespace; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "lastNonWhitespaceIndex", function() { return lastNonWhitespaceIndex; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "compare", function() { return compare; }); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "compareIgnoreCase", function() { return compareIgnoreCase; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "isLowerAsciiLetter", function() { return isLowerAsciiLetter; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "isUpperAsciiLetter", function() { return isUpperAsciiLetter; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "equalsIgnoreCase", function() { return equalsIgnoreCase; }); @@ -3103,463 +3484,756 @@ __webpack_require__.r(__webpack_exports__); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "commonSuffixLength", function() { return commonSuffixLength; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "isHighSurrogate", function() { return isHighSurrogate; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "isLowSurrogate", function() { return isLowSurrogate; }); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "getNextCodePoint", function() { return getNextCodePoint; }); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "nextCharLength", function() { return nextCharLength; }); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "prevCharLength", function() { return prevCharLength; }); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "getCharContainingOffset", function() { return getCharContainingOffset; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "containsRTL", function() { return containsRTL; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "containsEmoji", function() { return containsEmoji; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "isBasicASCII", function() { return isBasicASCII; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "containsFullWidthCharacter", function() { return containsFullWidthCharacter; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "isFullWidthCharacter", function() { return isFullWidthCharacter; }); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "isEmojiImprecise", function() { return isEmojiImprecise; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "UTF8_BOM_CHARACTER", function() { return UTF8_BOM_CHARACTER; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "startsWithUTF8BOM", function() { return startsWithUTF8BOM; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "safeBtoa", function() { return safeBtoa; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "repeat", function() { return repeat; }); -/*--------------------------------------------------------------------------------------------- - * Copyright (c) Microsoft Corporation. All rights reserved. - * Licensed under the MIT License. See License.txt in the project root for license information. - *--------------------------------------------------------------------------------------------*/ -/** - * The empty string. - */ -var empty = ''; -function isFalsyOrWhitespace(str) { - if (!str || typeof str !== 'string') { - return true; - } - return str.trim().length === 0; -} -/** - * @returns the provided number with the given number of preceding zeros. - */ -function pad(n, l, char) { - if (char === void 0) { char = '0'; } - var str = '' + n; - var r = [str]; - for (var i = str.length; i < l; i++) { - r.push(char); - } - return r.reverse().join(''); -} -var _formatRegexp = /{(\d+)}/g; -/** - * Helper to produce a string with a variable number of arguments. Insert variable segments - * into the string using the {n} notation where N is the index of the argument following the string. - * @param value string to which formatting is applied - * @param args replacements for {n}-entries - */ -function format(value) { - var args = []; - for (var _i = 1; _i < arguments.length; _i++) { - args[_i - 1] = arguments[_i]; - } - if (args.length === 0) { - return value; - } - return value.replace(_formatRegexp, function (match, group) { - var idx = parseInt(group, 10); - return isNaN(idx) || idx < 0 || idx >= args.length ? - match : - args[idx]; - }); -} -/** - * Converts HTML characters inside the string to use entities instead. Makes the string safe from - * being used e.g. in HTMLElement.innerHTML. - */ -function escape(html) { - return html.replace(/[<>&]/g, function (match) { - switch (match) { - case '<': return '<'; - case '>': return '>'; - case '&': return '&'; - default: return match; - } - }); -} -/** - * Escapes regular expression characters in a given string - */ -function escapeRegExpCharacters(value) { - return value.replace(/[\-\\\{\}\*\+\?\|\^\$\.\[\]\(\)\#]/g, '\\$&'); -} -/** - * Removes all occurrences of needle from the beginning and end of haystack. - * @param haystack string to trim - * @param needle the thing to trim (default is a blank) - */ -function trim(haystack, needle) { - if (needle === void 0) { needle = ' '; } - var trimmed = ltrim(haystack, needle); - return rtrim(trimmed, needle); -} -/** - * Removes all occurrences of needle from the beginning of haystack. - * @param haystack string to trim - * @param needle the thing to trim - */ -function ltrim(haystack, needle) { - if (!haystack || !needle) { - return haystack; - } - var needleLen = needle.length; - if (needleLen === 0 || haystack.length === 0) { - return haystack; - } - var offset = 0; - while (haystack.indexOf(needle, offset) === offset) { - offset = offset + needleLen; - } - return haystack.substring(offset); -} -/** - * Removes all occurrences of needle from the end of haystack. - * @param haystack string to trim - * @param needle the thing to trim - */ -function rtrim(haystack, needle) { - if (!haystack || !needle) { - return haystack; - } - var needleLen = needle.length, haystackLen = haystack.length; - if (needleLen === 0 || haystackLen === 0) { - return haystack; - } - var offset = haystackLen, idx = -1; - while (true) { - idx = haystack.lastIndexOf(needle, offset - 1); - if (idx === -1 || idx + needleLen !== offset) { - break; - } - if (idx === 0) { - return ''; - } - offset = idx; - } - return haystack.substring(0, offset); -} -function convertSimple2RegExpPattern(pattern) { - return pattern.replace(/[\-\\\{\}\+\?\|\^\$\.\,\[\]\(\)\#\s]/g, '\\$&').replace(/[\*]/g, '.*'); -} -/** - * Determines if haystack starts with needle. - */ -function startsWith(haystack, needle) { - if (haystack.length < needle.length) { - return false; - } - if (haystack === needle) { - return true; - } - for (var i = 0; i < needle.length; i++) { - if (haystack[i] !== needle[i]) { - return false; - } - } - return true; -} -/** - * Determines if haystack ends with needle. - */ -function endsWith(haystack, needle) { - var diff = haystack.length - needle.length; - if (diff > 0) { - return haystack.indexOf(needle, diff) === diff; - } - else if (diff === 0) { - return haystack === needle; - } - else { - return false; - } -} -function createRegExp(searchString, isRegex, options) { - if (options === void 0) { options = {}; } - if (!searchString) { - throw new Error('Cannot create regex from empty string'); - } - if (!isRegex) { - searchString = escapeRegExpCharacters(searchString); - } - if (options.wholeWord) { - if (!/\B/.test(searchString.charAt(0))) { - searchString = '\\b' + searchString; - } - if (!/\B/.test(searchString.charAt(searchString.length - 1))) { - searchString = searchString + '\\b'; - } - } - var modifiers = ''; - if (options.global) { - modifiers += 'g'; - } - if (!options.matchCase) { - modifiers += 'i'; - } - if (options.multiline) { - modifiers += 'm'; - } - if (options.unicode) { - modifiers += 'u'; - } - return new RegExp(searchString, modifiers); -} -function regExpLeadsToEndlessLoop(regexp) { - // Exit early if it's one of these special cases which are meant to match - // against an empty string - if (regexp.source === '^' || regexp.source === '^$' || regexp.source === '$' || regexp.source === '^\\s*$') { - return false; - } - // We check against an empty string. If the regular expression doesn't advance - // (e.g. ends in an endless loop) it will match an empty string. - var match = regexp.exec(''); - return !!(match && regexp.lastIndex === 0); -} -function regExpFlags(regexp) { - return (regexp.global ? 'g' : '') - + (regexp.ignoreCase ? 'i' : '') - + (regexp.multiline ? 'm' : '') - + (regexp.unicode ? 'u' : ''); -} -/** - * Returns first index of the string that is not whitespace. - * If string is empty or contains only whitespaces, returns -1 - */ -function firstNonWhitespaceIndex(str) { - for (var i = 0, len = str.length; i < len; i++) { - var chCode = str.charCodeAt(i); - if (chCode !== 32 /* Space */ && chCode !== 9 /* Tab */) { - return i; - } - } - return -1; -} -/** - * Returns the leading whitespace of the string. - * If the string contains only whitespaces, returns entire string - */ -function getLeadingWhitespace(str, start, end) { - if (start === void 0) { start = 0; } - if (end === void 0) { end = str.length; } - for (var i = start; i < end; i++) { - var chCode = str.charCodeAt(i); - if (chCode !== 32 /* Space */ && chCode !== 9 /* Tab */) { - return str.substring(start, i); - } - } - return str.substring(start, end); -} -/** - * Returns last index of the string that is not whitespace. - * If string is empty or contains only whitespaces, returns -1 - */ -function lastNonWhitespaceIndex(str, startIndex) { - if (startIndex === void 0) { startIndex = str.length - 1; } - for (var i = startIndex; i >= 0; i--) { - var chCode = str.charCodeAt(i); - if (chCode !== 32 /* Space */ && chCode !== 9 /* Tab */) { - return i; - } - } - return -1; -} -function compare(a, b) { - if (a < b) { - return -1; - } - else if (a > b) { - return 1; - } - else { - return 0; - } -} -function isLowerAsciiLetter(code) { - return code >= 97 /* a */ && code <= 122 /* z */; -} -function isUpperAsciiLetter(code) { - return code >= 65 /* A */ && code <= 90 /* Z */; -} -function isAsciiLetter(code) { - return isLowerAsciiLetter(code) || isUpperAsciiLetter(code); -} -function equalsIgnoreCase(a, b) { - var len1 = a ? a.length : 0; - var len2 = b ? b.length : 0; - if (len1 !== len2) { - return false; - } - return doEqualsIgnoreCase(a, b); -} -function doEqualsIgnoreCase(a, b, stopAt) { - if (stopAt === void 0) { stopAt = a.length; } - if (typeof a !== 'string' || typeof b !== 'string') { - return false; - } - for (var i = 0; i < stopAt; i++) { - var codeA = a.charCodeAt(i); - var codeB = b.charCodeAt(i); - if (codeA === codeB) { - continue; - } - // a-z A-Z - if (isAsciiLetter(codeA) && isAsciiLetter(codeB)) { - var diff = Math.abs(codeA - codeB); - if (diff !== 0 && diff !== 32) { - return false; - } - } - // Any other charcode - else { - if (String.fromCharCode(codeA).toLowerCase() !== String.fromCharCode(codeB).toLowerCase()) { - return false; - } - } - } - return true; -} -function startsWithIgnoreCase(str, candidate) { - var candidateLength = candidate.length; - if (candidate.length > str.length) { - return false; - } - return doEqualsIgnoreCase(str, candidate, candidateLength); -} -/** - * @returns the length of the common prefix of the two strings. - */ -function commonPrefixLength(a, b) { - var i, len = Math.min(a.length, b.length); - for (i = 0; i < len; i++) { - if (a.charCodeAt(i) !== b.charCodeAt(i)) { - return i; - } - } - return len; -} -/** - * @returns the length of the common suffix of the two strings. - */ -function commonSuffixLength(a, b) { - var i, len = Math.min(a.length, b.length); - var aLastIndex = a.length - 1; - var bLastIndex = b.length - 1; - for (i = 0; i < len; i++) { - if (a.charCodeAt(aLastIndex - i) !== b.charCodeAt(bLastIndex - i)) { - return i; - } - } - return len; -} -// --- unicode -// http://en.wikipedia.org/wiki/Surrogate_pair -// Returns the code point starting at a specified index in a string -// Code points U+0000 to U+D7FF and U+E000 to U+FFFF are represented on a single character -// Code points U+10000 to U+10FFFF are represented on two consecutive characters -//export function getUnicodePoint(str:string, index:number, len:number):number { -// const chrCode = str.charCodeAt(index); -// if (0xD800 <= chrCode && chrCode <= 0xDBFF && index + 1 < len) { -// const nextChrCode = str.charCodeAt(index + 1); -// if (0xDC00 <= nextChrCode && nextChrCode <= 0xDFFF) { -// return (chrCode - 0xD800) << 10 + (nextChrCode - 0xDC00) + 0x10000; -// } -// } -// return chrCode; -//} -function isHighSurrogate(charCode) { - return (0xD800 <= charCode && charCode <= 0xDBFF); -} -function isLowSurrogate(charCode) { - return (0xDC00 <= charCode && charCode <= 0xDFFF); -} -/** - * Generated using https://github.com/alexandrudima/unicode-utils/blob/master/generate-rtl-test.js - */ -var CONTAINS_RTL = /(?:[\u05BE\u05C0\u05C3\u05C6\u05D0-\u05F4\u0608\u060B\u060D\u061B-\u064A\u066D-\u066F\u0671-\u06D5\u06E5\u06E6\u06EE\u06EF\u06FA-\u0710\u0712-\u072F\u074D-\u07A5\u07B1-\u07EA\u07F4\u07F5\u07FA-\u0815\u081A\u0824\u0828\u0830-\u0858\u085E-\u08BD\u200F\uFB1D\uFB1F-\uFB28\uFB2A-\uFD3D\uFD50-\uFDFC\uFE70-\uFEFC]|\uD802[\uDC00-\uDD1B\uDD20-\uDE00\uDE10-\uDE33\uDE40-\uDEE4\uDEEB-\uDF35\uDF40-\uDFFF]|\uD803[\uDC00-\uDCFF]|\uD83A[\uDC00-\uDCCF\uDD00-\uDD43\uDD50-\uDFFF]|\uD83B[\uDC00-\uDEBB])/; -/** - * Returns true if `str` contains any Unicode character that is classified as "R" or "AL". - */ -function containsRTL(str) { - return CONTAINS_RTL.test(str); -} -/** - * Generated using https://github.com/alexandrudima/unicode-utils/blob/master/generate-emoji-test.js - */ -var CONTAINS_EMOJI = /(?:[\u231A\u231B\u23F0\u23F3\u2600-\u27BF\u2B50\u2B55]|\uD83C[\uDDE6-\uDDFF\uDF00-\uDFFF]|\uD83D[\uDC00-\uDE4F\uDE80-\uDEF8]|\uD83E[\uDD00-\uDDE6])/; -function containsEmoji(str) { - return CONTAINS_EMOJI.test(str); -} -var IS_BASIC_ASCII = /^[\t\n\r\x20-\x7E]*$/; -/** - * Returns true if `str` contains only basic ASCII characters in the range 32 - 126 (including 32 and 126) or \n, \r, \t - */ -function isBasicASCII(str) { - return IS_BASIC_ASCII.test(str); -} -function containsFullWidthCharacter(str) { - for (var i = 0, len = str.length; i < len; i++) { - if (isFullWidthCharacter(str.charCodeAt(i))) { - return true; - } - } - return false; -} -function isFullWidthCharacter(charCode) { - // Do a cheap trick to better support wrapping of wide characters, treat them as 2 columns - // http://jrgraphix.net/research/unicode_blocks.php - // 2E80 — 2EFF CJK Radicals Supplement - // 2F00 — 2FDF Kangxi Radicals - // 2FF0 — 2FFF Ideographic Description Characters - // 3000 — 303F CJK Symbols and Punctuation - // 3040 — 309F Hiragana - // 30A0 — 30FF Katakana - // 3100 — 312F Bopomofo - // 3130 — 318F Hangul Compatibility Jamo - // 3190 — 319F Kanbun - // 31A0 — 31BF Bopomofo Extended - // 31F0 — 31FF Katakana Phonetic Extensions - // 3200 — 32FF Enclosed CJK Letters and Months - // 3300 — 33FF CJK Compatibility - // 3400 — 4DBF CJK Unified Ideographs Extension A - // 4DC0 — 4DFF Yijing Hexagram Symbols - // 4E00 — 9FFF CJK Unified Ideographs - // A000 — A48F Yi Syllables - // A490 — A4CF Yi Radicals - // AC00 — D7AF Hangul Syllables - // [IGNORE] D800 — DB7F High Surrogates - // [IGNORE] DB80 — DBFF High Private Use Surrogates - // [IGNORE] DC00 — DFFF Low Surrogates - // [IGNORE] E000 — F8FF Private Use Area - // F900 — FAFF CJK Compatibility Ideographs - // [IGNORE] FB00 — FB4F Alphabetic Presentation Forms - // [IGNORE] FB50 — FDFF Arabic Presentation Forms-A - // [IGNORE] FE00 — FE0F Variation Selectors - // [IGNORE] FE20 — FE2F Combining Half Marks - // [IGNORE] FE30 — FE4F CJK Compatibility Forms - // [IGNORE] FE50 — FE6F Small Form Variants - // [IGNORE] FE70 — FEFF Arabic Presentation Forms-B - // FF00 — FFEF Halfwidth and Fullwidth Forms - // [https://en.wikipedia.org/wiki/Halfwidth_and_fullwidth_forms] - // of which FF01 - FF5E fullwidth ASCII of 21 to 7E - // [IGNORE] and FF65 - FFDC halfwidth of Katakana and Hangul - // [IGNORE] FFF0 — FFFF Specials - charCode = +charCode; // @perf - return ((charCode >= 0x2E80 && charCode <= 0xD7AF) - || (charCode >= 0xF900 && charCode <= 0xFAFF) - || (charCode >= 0xFF01 && charCode <= 0xFF5E)); -} -// -- UTF-8 BOM -var UTF8_BOM_CHARACTER = String.fromCharCode(65279 /* UTF8_BOM */); -function startsWithUTF8BOM(str) { - return !!(str && str.length > 0 && str.charCodeAt(0) === 65279 /* UTF8_BOM */); -} -function safeBtoa(str) { - return btoa(encodeURIComponent(str)); // we use encodeURIComponent because btoa fails for non Latin 1 values -} -function repeat(s, count) { - var result = ''; - for (var i = 0; i < count; i++) { - result += s; - } - return result; -} +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "containsUppercaseCharacter", function() { return containsUppercaseCharacter; }); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "singleLetterHash", function() { return singleLetterHash; }); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "getGraphemeBreakType", function() { return getGraphemeBreakType; }); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "breakBetweenGraphemeBreakType", function() { return breakBetweenGraphemeBreakType; }); +/*--------------------------------------------------------------------------------------------- + * Copyright (c) Microsoft Corporation. All rights reserved. + * Licensed under the MIT License. See License.txt in the project root for license information. + *--------------------------------------------------------------------------------------------*/ +function isFalsyOrWhitespace(str) { + if (!str || typeof str !== 'string') { + return true; + } + return str.trim().length === 0; +} +/** + * @returns the provided number with the given number of preceding zeros. + */ +function pad(n, l, char) { + if (char === void 0) { char = '0'; } + var str = '' + n; + var r = [str]; + for (var i = str.length; i < l; i++) { + r.push(char); + } + return r.reverse().join(''); +} +var _formatRegexp = /{(\d+)}/g; +/** + * Helper to produce a string with a variable number of arguments. Insert variable segments + * into the string using the {n} notation where N is the index of the argument following the string. + * @param value string to which formatting is applied + * @param args replacements for {n}-entries + */ +function format(value) { + var args = []; + for (var _i = 1; _i < arguments.length; _i++) { + args[_i - 1] = arguments[_i]; + } + if (args.length === 0) { + return value; + } + return value.replace(_formatRegexp, function (match, group) { + var idx = parseInt(group, 10); + return isNaN(idx) || idx < 0 || idx >= args.length ? + match : + args[idx]; + }); +} +/** + * Converts HTML characters inside the string to use entities instead. Makes the string safe from + * being used e.g. in HTMLElement.innerHTML. + */ +function escape(html) { + return html.replace(/[<>&]/g, function (match) { + switch (match) { + case '<': return '<'; + case '>': return '>'; + case '&': return '&'; + default: return match; + } + }); +} +/** + * Escapes regular expression characters in a given string + */ +function escapeRegExpCharacters(value) { + return value.replace(/[\\\{\}\*\+\?\|\^\$\.\[\]\(\)]/g, '\\$&'); +} +/** + * Removes all occurrences of needle from the beginning and end of haystack. + * @param haystack string to trim + * @param needle the thing to trim (default is a blank) + */ +function trim(haystack, needle) { + if (needle === void 0) { needle = ' '; } + var trimmed = ltrim(haystack, needle); + return rtrim(trimmed, needle); +} +/** + * Removes all occurrences of needle from the beginning of haystack. + * @param haystack string to trim + * @param needle the thing to trim + */ +function ltrim(haystack, needle) { + if (!haystack || !needle) { + return haystack; + } + var needleLen = needle.length; + if (needleLen === 0 || haystack.length === 0) { + return haystack; + } + var offset = 0; + while (haystack.indexOf(needle, offset) === offset) { + offset = offset + needleLen; + } + return haystack.substring(offset); +} +/** + * Removes all occurrences of needle from the end of haystack. + * @param haystack string to trim + * @param needle the thing to trim + */ +function rtrim(haystack, needle) { + if (!haystack || !needle) { + return haystack; + } + var needleLen = needle.length, haystackLen = haystack.length; + if (needleLen === 0 || haystackLen === 0) { + return haystack; + } + var offset = haystackLen, idx = -1; + while (true) { + idx = haystack.lastIndexOf(needle, offset - 1); + if (idx === -1 || idx + needleLen !== offset) { + break; + } + if (idx === 0) { + return ''; + } + offset = idx; + } + return haystack.substring(0, offset); +} +function convertSimple2RegExpPattern(pattern) { + return pattern.replace(/[\-\\\{\}\+\?\|\^\$\.\,\[\]\(\)\#\s]/g, '\\$&').replace(/[\*]/g, '.*'); +} +/** + * Determines if haystack starts with needle. + */ +function startsWith(haystack, needle) { + if (haystack.length < needle.length) { + return false; + } + if (haystack === needle) { + return true; + } + for (var i = 0; i < needle.length; i++) { + if (haystack[i] !== needle[i]) { + return false; + } + } + return true; +} +/** + * Determines if haystack ends with needle. + */ +function endsWith(haystack, needle) { + var diff = haystack.length - needle.length; + if (diff > 0) { + return haystack.indexOf(needle, diff) === diff; + } + else if (diff === 0) { + return haystack === needle; + } + else { + return false; + } +} +function createRegExp(searchString, isRegex, options) { + if (options === void 0) { options = {}; } + if (!searchString) { + throw new Error('Cannot create regex from empty string'); + } + if (!isRegex) { + searchString = escapeRegExpCharacters(searchString); + } + if (options.wholeWord) { + if (!/\B/.test(searchString.charAt(0))) { + searchString = '\\b' + searchString; + } + if (!/\B/.test(searchString.charAt(searchString.length - 1))) { + searchString = searchString + '\\b'; + } + } + var modifiers = ''; + if (options.global) { + modifiers += 'g'; + } + if (!options.matchCase) { + modifiers += 'i'; + } + if (options.multiline) { + modifiers += 'm'; + } + if (options.unicode) { + modifiers += 'u'; + } + return new RegExp(searchString, modifiers); +} +function regExpLeadsToEndlessLoop(regexp) { + // Exit early if it's one of these special cases which are meant to match + // against an empty string + if (regexp.source === '^' || regexp.source === '^$' || regexp.source === '$' || regexp.source === '^\\s*$') { + return false; + } + // We check against an empty string. If the regular expression doesn't advance + // (e.g. ends in an endless loop) it will match an empty string. + var match = regexp.exec(''); + return !!(match && regexp.lastIndex === 0); +} +function regExpFlags(regexp) { + return (regexp.global ? 'g' : '') + + (regexp.ignoreCase ? 'i' : '') + + (regexp.multiline ? 'm' : '') + + (regexp.unicode ? 'u' : ''); +} +/** + * Returns first index of the string that is not whitespace. + * If string is empty or contains only whitespaces, returns -1 + */ +function firstNonWhitespaceIndex(str) { + for (var i = 0, len = str.length; i < len; i++) { + var chCode = str.charCodeAt(i); + if (chCode !== 32 /* Space */ && chCode !== 9 /* Tab */) { + return i; + } + } + return -1; +} +/** + * Returns the leading whitespace of the string. + * If the string contains only whitespaces, returns entire string + */ +function getLeadingWhitespace(str, start, end) { + if (start === void 0) { start = 0; } + if (end === void 0) { end = str.length; } + for (var i = start; i < end; i++) { + var chCode = str.charCodeAt(i); + if (chCode !== 32 /* Space */ && chCode !== 9 /* Tab */) { + return str.substring(start, i); + } + } + return str.substring(start, end); +} +/** + * Returns last index of the string that is not whitespace. + * If string is empty or contains only whitespaces, returns -1 + */ +function lastNonWhitespaceIndex(str, startIndex) { + if (startIndex === void 0) { startIndex = str.length - 1; } + for (var i = startIndex; i >= 0; i--) { + var chCode = str.charCodeAt(i); + if (chCode !== 32 /* Space */ && chCode !== 9 /* Tab */) { + return i; + } + } + return -1; +} +function compare(a, b) { + if (a < b) { + return -1; + } + else if (a > b) { + return 1; + } + else { + return 0; + } +} +function compareIgnoreCase(a, b) { + var len = Math.min(a.length, b.length); + for (var i = 0; i < len; i++) { + var codeA = a.charCodeAt(i); + var codeB = b.charCodeAt(i); + if (codeA === codeB) { + // equal + continue; + } + if (isUpperAsciiLetter(codeA)) { + codeA += 32; + } + if (isUpperAsciiLetter(codeB)) { + codeB += 32; + } + var diff = codeA - codeB; + if (diff === 0) { + // equal -> ignoreCase + continue; + } + else if (isLowerAsciiLetter(codeA) && isLowerAsciiLetter(codeB)) { + // + return diff; + } + else { + return compare(a.toLowerCase(), b.toLowerCase()); + } + } + if (a.length < b.length) { + return -1; + } + else if (a.length > b.length) { + return 1; + } + else { + return 0; + } +} +function isLowerAsciiLetter(code) { + return code >= 97 /* a */ && code <= 122 /* z */; +} +function isUpperAsciiLetter(code) { + return code >= 65 /* A */ && code <= 90 /* Z */; +} +function isAsciiLetter(code) { + return isLowerAsciiLetter(code) || isUpperAsciiLetter(code); +} +function equalsIgnoreCase(a, b) { + return a.length === b.length && doEqualsIgnoreCase(a, b); +} +function doEqualsIgnoreCase(a, b, stopAt) { + if (stopAt === void 0) { stopAt = a.length; } + for (var i = 0; i < stopAt; i++) { + var codeA = a.charCodeAt(i); + var codeB = b.charCodeAt(i); + if (codeA === codeB) { + continue; + } + // a-z A-Z + if (isAsciiLetter(codeA) && isAsciiLetter(codeB)) { + var diff = Math.abs(codeA - codeB); + if (diff !== 0 && diff !== 32) { + return false; + } + } + // Any other charcode + else { + if (String.fromCharCode(codeA).toLowerCase() !== String.fromCharCode(codeB).toLowerCase()) { + return false; + } + } + } + return true; +} +function startsWithIgnoreCase(str, candidate) { + var candidateLength = candidate.length; + if (candidate.length > str.length) { + return false; + } + return doEqualsIgnoreCase(str, candidate, candidateLength); +} +/** + * @returns the length of the common prefix of the two strings. + */ +function commonPrefixLength(a, b) { + var i, len = Math.min(a.length, b.length); + for (i = 0; i < len; i++) { + if (a.charCodeAt(i) !== b.charCodeAt(i)) { + return i; + } + } + return len; +} +/** + * @returns the length of the common suffix of the two strings. + */ +function commonSuffixLength(a, b) { + var i, len = Math.min(a.length, b.length); + var aLastIndex = a.length - 1; + var bLastIndex = b.length - 1; + for (i = 0; i < len; i++) { + if (a.charCodeAt(aLastIndex - i) !== b.charCodeAt(bLastIndex - i)) { + return i; + } + } + return len; +} +// --- unicode +// http://en.wikipedia.org/wiki/Surrogate_pair +// Returns the code point starting at a specified index in a string +// Code points U+0000 to U+D7FF and U+E000 to U+FFFF are represented on a single character +// Code points U+10000 to U+10FFFF are represented on two consecutive characters +//export function getUnicodePoint(str:string, index:number, len:number):number { +// const chrCode = str.charCodeAt(index); +// if (0xD800 <= chrCode && chrCode <= 0xDBFF && index + 1 < len) { +// const nextChrCode = str.charCodeAt(index + 1); +// if (0xDC00 <= nextChrCode && nextChrCode <= 0xDFFF) { +// return (chrCode - 0xD800) << 10 + (nextChrCode - 0xDC00) + 0x10000; +// } +// } +// return chrCode; +//} +function isHighSurrogate(charCode) { + return (0xD800 <= charCode && charCode <= 0xDBFF); +} +function isLowSurrogate(charCode) { + return (0xDC00 <= charCode && charCode <= 0xDFFF); +} +/** + * get the code point that begins at offset `offset` + */ +function getNextCodePoint(str, len, offset) { + var charCode = str.charCodeAt(offset); + if (isHighSurrogate(charCode) && offset + 1 < len) { + var nextCharCode = str.charCodeAt(offset + 1); + if (isLowSurrogate(nextCharCode)) { + return ((charCode - 0xD800) << 10) + (nextCharCode - 0xDC00) + 0x10000; + } + } + return charCode; +} +/** + * get the code point that ends right before offset `offset` + */ +function getPrevCodePoint(str, offset) { + var charCode = str.charCodeAt(offset - 1); + if (isLowSurrogate(charCode) && offset > 1) { + var prevCharCode = str.charCodeAt(offset - 2); + if (isHighSurrogate(prevCharCode)) { + return ((prevCharCode - 0xD800) << 10) + (charCode - 0xDC00) + 0x10000; + } + } + return charCode; +} +function nextCharLength(str, offset) { + var graphemeBreakTree = GraphemeBreakTree.getInstance(); + var initialOffset = offset; + var len = str.length; + var initialCodePoint = getNextCodePoint(str, len, offset); + offset += (initialCodePoint >= 65536 /* UNICODE_SUPPLEMENTARY_PLANE_BEGIN */ ? 2 : 1); + var graphemeBreakType = graphemeBreakTree.getGraphemeBreakType(initialCodePoint); + while (offset < len) { + var nextCodePoint = getNextCodePoint(str, len, offset); + var nextGraphemeBreakType = graphemeBreakTree.getGraphemeBreakType(nextCodePoint); + if (breakBetweenGraphemeBreakType(graphemeBreakType, nextGraphemeBreakType)) { + break; + } + offset += (nextCodePoint >= 65536 /* UNICODE_SUPPLEMENTARY_PLANE_BEGIN */ ? 2 : 1); + graphemeBreakType = nextGraphemeBreakType; + } + return (offset - initialOffset); +} +function prevCharLength(str, offset) { + var graphemeBreakTree = GraphemeBreakTree.getInstance(); + var initialOffset = offset; + var initialCodePoint = getPrevCodePoint(str, offset); + offset -= (initialCodePoint >= 65536 /* UNICODE_SUPPLEMENTARY_PLANE_BEGIN */ ? 2 : 1); + var graphemeBreakType = graphemeBreakTree.getGraphemeBreakType(initialCodePoint); + while (offset > 0) { + var prevCodePoint = getPrevCodePoint(str, offset); + var prevGraphemeBreakType = graphemeBreakTree.getGraphemeBreakType(prevCodePoint); + if (breakBetweenGraphemeBreakType(prevGraphemeBreakType, graphemeBreakType)) { + break; + } + offset -= (prevCodePoint >= 65536 /* UNICODE_SUPPLEMENTARY_PLANE_BEGIN */ ? 2 : 1); + graphemeBreakType = prevGraphemeBreakType; + } + return (initialOffset - offset); +} +function _getCharContainingOffset(str, offset) { + var graphemeBreakTree = GraphemeBreakTree.getInstance(); + var len = str.length; + var initialOffset = offset; + var initialCodePoint = getNextCodePoint(str, len, offset); + var initialGraphemeBreakType = graphemeBreakTree.getGraphemeBreakType(initialCodePoint); + offset += (initialCodePoint >= 65536 /* UNICODE_SUPPLEMENTARY_PLANE_BEGIN */ ? 2 : 1); + // extend to the right + var graphemeBreakType = initialGraphemeBreakType; + while (offset < len) { + var nextCodePoint = getNextCodePoint(str, len, offset); + var nextGraphemeBreakType = graphemeBreakTree.getGraphemeBreakType(nextCodePoint); + if (breakBetweenGraphemeBreakType(graphemeBreakType, nextGraphemeBreakType)) { + break; + } + offset += (nextCodePoint >= 65536 /* UNICODE_SUPPLEMENTARY_PLANE_BEGIN */ ? 2 : 1); + graphemeBreakType = nextGraphemeBreakType; + } + var endOffset = offset; + // extend to the left + offset = initialOffset; + graphemeBreakType = initialGraphemeBreakType; + while (offset > 0) { + var prevCodePoint = getPrevCodePoint(str, offset); + var prevGraphemeBreakType = graphemeBreakTree.getGraphemeBreakType(prevCodePoint); + if (breakBetweenGraphemeBreakType(prevGraphemeBreakType, graphemeBreakType)) { + break; + } + offset -= (prevCodePoint >= 65536 /* UNICODE_SUPPLEMENTARY_PLANE_BEGIN */ ? 2 : 1); + graphemeBreakType = prevGraphemeBreakType; + } + return [offset, endOffset]; +} +function getCharContainingOffset(str, offset) { + if (offset > 0 && isLowSurrogate(str.charCodeAt(offset))) { + return _getCharContainingOffset(str, offset - 1); + } + return _getCharContainingOffset(str, offset); +} +/** + * Generated using https://github.com/alexandrudima/unicode-utils/blob/master/generate-rtl-test.js + */ +var CONTAINS_RTL = /(?:[\u05BE\u05C0\u05C3\u05C6\u05D0-\u05F4\u0608\u060B\u060D\u061B-\u064A\u066D-\u066F\u0671-\u06D5\u06E5\u06E6\u06EE\u06EF\u06FA-\u0710\u0712-\u072F\u074D-\u07A5\u07B1-\u07EA\u07F4\u07F5\u07FA-\u0815\u081A\u0824\u0828\u0830-\u0858\u085E-\u08BD\u200F\uFB1D\uFB1F-\uFB28\uFB2A-\uFD3D\uFD50-\uFDFC\uFE70-\uFEFC]|\uD802[\uDC00-\uDD1B\uDD20-\uDE00\uDE10-\uDE33\uDE40-\uDEE4\uDEEB-\uDF35\uDF40-\uDFFF]|\uD803[\uDC00-\uDCFF]|\uD83A[\uDC00-\uDCCF\uDD00-\uDD43\uDD50-\uDFFF]|\uD83B[\uDC00-\uDEBB])/; +/** + * Returns true if `str` contains any Unicode character that is classified as "R" or "AL". + */ +function containsRTL(str) { + return CONTAINS_RTL.test(str); +} +/** + * Generated using https://github.com/alexandrudima/unicode-utils/blob/master/generate-emoji-test.js + */ +var CONTAINS_EMOJI = /(?:[\u231A\u231B\u23F0\u23F3\u2600-\u27BF\u2B50\u2B55]|\uD83C[\uDDE6-\uDDFF\uDF00-\uDFFF]|\uD83D[\uDC00-\uDE4F\uDE80-\uDEFC\uDFE0-\uDFEB]|\uD83E[\uDD00-\uDDFF\uDE70-\uDE73\uDE78-\uDE82\uDE90-\uDE95])/; +function containsEmoji(str) { + return CONTAINS_EMOJI.test(str); +} +var IS_BASIC_ASCII = /^[\t\n\r\x20-\x7E]*$/; +/** + * Returns true if `str` contains only basic ASCII characters in the range 32 - 126 (including 32 and 126) or \n, \r, \t + */ +function isBasicASCII(str) { + return IS_BASIC_ASCII.test(str); +} +function containsFullWidthCharacter(str) { + for (var i = 0, len = str.length; i < len; i++) { + if (isFullWidthCharacter(str.charCodeAt(i))) { + return true; + } + } + return false; +} +function isFullWidthCharacter(charCode) { + // Do a cheap trick to better support wrapping of wide characters, treat them as 2 columns + // http://jrgraphix.net/research/unicode_blocks.php + // 2E80 — 2EFF CJK Radicals Supplement + // 2F00 — 2FDF Kangxi Radicals + // 2FF0 — 2FFF Ideographic Description Characters + // 3000 — 303F CJK Symbols and Punctuation + // 3040 — 309F Hiragana + // 30A0 — 30FF Katakana + // 3100 — 312F Bopomofo + // 3130 — 318F Hangul Compatibility Jamo + // 3190 — 319F Kanbun + // 31A0 — 31BF Bopomofo Extended + // 31F0 — 31FF Katakana Phonetic Extensions + // 3200 — 32FF Enclosed CJK Letters and Months + // 3300 — 33FF CJK Compatibility + // 3400 — 4DBF CJK Unified Ideographs Extension A + // 4DC0 — 4DFF Yijing Hexagram Symbols + // 4E00 — 9FFF CJK Unified Ideographs + // A000 — A48F Yi Syllables + // A490 — A4CF Yi Radicals + // AC00 — D7AF Hangul Syllables + // [IGNORE] D800 — DB7F High Surrogates + // [IGNORE] DB80 — DBFF High Private Use Surrogates + // [IGNORE] DC00 — DFFF Low Surrogates + // [IGNORE] E000 — F8FF Private Use Area + // F900 — FAFF CJK Compatibility Ideographs + // [IGNORE] FB00 — FB4F Alphabetic Presentation Forms + // [IGNORE] FB50 — FDFF Arabic Presentation Forms-A + // [IGNORE] FE00 — FE0F Variation Selectors + // [IGNORE] FE20 — FE2F Combining Half Marks + // [IGNORE] FE30 — FE4F CJK Compatibility Forms + // [IGNORE] FE50 — FE6F Small Form Variants + // [IGNORE] FE70 — FEFF Arabic Presentation Forms-B + // FF00 — FFEF Halfwidth and Fullwidth Forms + // [https://en.wikipedia.org/wiki/Halfwidth_and_fullwidth_forms] + // of which FF01 - FF5E fullwidth ASCII of 21 to 7E + // [IGNORE] and FF65 - FFDC halfwidth of Katakana and Hangul + // [IGNORE] FFF0 — FFFF Specials + charCode = +charCode; // @perf + return ((charCode >= 0x2E80 && charCode <= 0xD7AF) + || (charCode >= 0xF900 && charCode <= 0xFAFF) + || (charCode >= 0xFF01 && charCode <= 0xFF5E)); +} +/** + * A fast function (therefore imprecise) to check if code points are emojis. + * Generated using https://github.com/alexandrudima/unicode-utils/blob/master/generate-emoji-test.js + */ +function isEmojiImprecise(x) { + return ((x >= 0x1F1E6 && x <= 0x1F1FF) || (x >= 9728 && x <= 10175) || (x >= 127744 && x <= 128591) + || (x >= 128640 && x <= 128764) || (x >= 128992 && x <= 129003) || (x >= 129280 && x <= 129535) + || (x >= 129648 && x <= 129651) || (x >= 129656 && x <= 129666) || (x >= 129680 && x <= 129685)); +} +// -- UTF-8 BOM +var UTF8_BOM_CHARACTER = String.fromCharCode(65279 /* UTF8_BOM */); +function startsWithUTF8BOM(str) { + return !!(str && str.length > 0 && str.charCodeAt(0) === 65279 /* UTF8_BOM */); +} +function safeBtoa(str) { + return btoa(encodeURIComponent(str)); // we use encodeURIComponent because btoa fails for non Latin 1 values +} +function repeat(s, count) { + var result = ''; + for (var i = 0; i < count; i++) { + result += s; + } + return result; +} +function containsUppercaseCharacter(target, ignoreEscapedChars) { + if (ignoreEscapedChars === void 0) { ignoreEscapedChars = false; } + if (!target) { + return false; + } + if (ignoreEscapedChars) { + target = target.replace(/\\./g, ''); + } + return target.toLowerCase() !== target; +} +/** + * Produces 'a'-'z', followed by 'A'-'Z'... followed by 'a'-'z', etc. + */ +function singleLetterHash(n) { + var LETTERS_CNT = (90 /* Z */ - 65 /* A */ + 1); + n = n % (2 * LETTERS_CNT); + if (n < LETTERS_CNT) { + return String.fromCharCode(97 /* a */ + n); + } + return String.fromCharCode(65 /* A */ + n - LETTERS_CNT); +} +//#region Unicode Grapheme Break +function getGraphemeBreakType(codePoint) { + var graphemeBreakTree = GraphemeBreakTree.getInstance(); + return graphemeBreakTree.getGraphemeBreakType(codePoint); +} +function breakBetweenGraphemeBreakType(breakTypeA, breakTypeB) { + // http://www.unicode.org/reports/tr29/#Grapheme_Cluster_Boundary_Rules + // !!! Let's make the common case a bit faster + if (breakTypeA === 0 /* Other */) { + // see https://www.unicode.org/Public/13.0.0/ucd/auxiliary/GraphemeBreakTest-13.0.0d10.html#table + return (breakTypeB !== 5 /* Extend */ && breakTypeB !== 7 /* SpacingMark */); + } + // Do not break between a CR and LF. Otherwise, break before and after controls. + // GB3 CR × LF + // GB4 (Control | CR | LF) ÷ + // GB5 ÷ (Control | CR | LF) + if (breakTypeA === 2 /* CR */) { + if (breakTypeB === 3 /* LF */) { + return false; // GB3 + } + } + if (breakTypeA === 4 /* Control */ || breakTypeA === 2 /* CR */ || breakTypeA === 3 /* LF */) { + return true; // GB4 + } + if (breakTypeB === 4 /* Control */ || breakTypeB === 2 /* CR */ || breakTypeB === 3 /* LF */) { + return true; // GB5 + } + // Do not break Hangul syllable sequences. + // GB6 L × (L | V | LV | LVT) + // GB7 (LV | V) × (V | T) + // GB8 (LVT | T) × T + if (breakTypeA === 8 /* L */) { + if (breakTypeB === 8 /* L */ || breakTypeB === 9 /* V */ || breakTypeB === 11 /* LV */ || breakTypeB === 12 /* LVT */) { + return false; // GB6 + } + } + if (breakTypeA === 11 /* LV */ || breakTypeA === 9 /* V */) { + if (breakTypeB === 9 /* V */ || breakTypeB === 10 /* T */) { + return false; // GB7 + } + } + if (breakTypeA === 12 /* LVT */ || breakTypeA === 10 /* T */) { + if (breakTypeB === 10 /* T */) { + return false; // GB8 + } + } + // Do not break before extending characters or ZWJ. + // GB9 × (Extend | ZWJ) + if (breakTypeB === 5 /* Extend */ || breakTypeB === 13 /* ZWJ */) { + return false; // GB9 + } + // The GB9a and GB9b rules only apply to extended grapheme clusters: + // Do not break before SpacingMarks, or after Prepend characters. + // GB9a × SpacingMark + // GB9b Prepend × + if (breakTypeB === 7 /* SpacingMark */) { + return false; // GB9a + } + if (breakTypeA === 1 /* Prepend */) { + return false; // GB9b + } + // Do not break within emoji modifier sequences or emoji zwj sequences. + // GB11 \p{Extended_Pictographic} Extend* ZWJ × \p{Extended_Pictographic} + if (breakTypeA === 13 /* ZWJ */ && breakTypeB === 14 /* Extended_Pictographic */) { + // Note: we are not implementing the rule entirely here to avoid introducing states + return false; // GB11 + } + // GB12 sot (RI RI)* RI × RI + // GB13 [^RI] (RI RI)* RI × RI + if (breakTypeA === 6 /* Regional_Indicator */ && breakTypeB === 6 /* Regional_Indicator */) { + // Note: we are not implementing the rule entirely here to avoid introducing states + return false; // GB12 & GB13 + } + // GB999 Any ÷ Any + return true; +} +var GraphemeBreakTree = /** @class */ (function () { + function GraphemeBreakTree() { + this._data = getGraphemeBreakRawData(); + } + GraphemeBreakTree.getInstance = function () { + if (!GraphemeBreakTree._INSTANCE) { + GraphemeBreakTree._INSTANCE = new GraphemeBreakTree(); + } + return GraphemeBreakTree._INSTANCE; + }; + GraphemeBreakTree.prototype.getGraphemeBreakType = function (codePoint) { + // !!! Let's make 7bit ASCII a bit faster: 0..31 + if (codePoint < 32) { + if (codePoint === 10 /* LineFeed */) { + return 3 /* LF */; + } + if (codePoint === 13 /* CarriageReturn */) { + return 2 /* CR */; + } + return 4 /* Control */; + } + // !!! Let's make 7bit ASCII a bit faster: 32..126 + if (codePoint < 127) { + return 0 /* Other */; + } + var data = this._data; + var nodeCount = data.length / 3; + var nodeIndex = 1; + while (nodeIndex <= nodeCount) { + if (codePoint < data[3 * nodeIndex]) { + // go left + nodeIndex = 2 * nodeIndex; + } + else if (codePoint > data[3 * nodeIndex + 1]) { + // go right + nodeIndex = 2 * nodeIndex + 1; + } + else { + // hit + return data[3 * nodeIndex + 2]; + } + } + return 0 /* Other */; + }; + GraphemeBreakTree._INSTANCE = null; + return GraphemeBreakTree; +}()); +function getGraphemeBreakRawData() { + // generated using https://github.com/alexandrudima/unicode-utils/blob/master/generate-grapheme-break.js + return JSON.parse('[0,0,0,51592,51592,11,44424,44424,11,72251,72254,5,7150,7150,7,48008,48008,11,55176,55176,11,128420,128420,14,3276,3277,5,9979,9980,14,46216,46216,11,49800,49800,11,53384,53384,11,70726,70726,5,122915,122916,5,129320,129327,14,2558,2558,5,5906,5908,5,9762,9763,14,43360,43388,8,45320,45320,11,47112,47112,11,48904,48904,11,50696,50696,11,52488,52488,11,54280,54280,11,70082,70083,1,71350,71350,7,73111,73111,5,127892,127893,14,128726,128727,14,129473,129474,14,2027,2035,5,2901,2902,5,3784,3789,5,6754,6754,5,8418,8420,5,9877,9877,14,11088,11088,14,44008,44008,5,44872,44872,11,45768,45768,11,46664,46664,11,47560,47560,11,48456,48456,11,49352,49352,11,50248,50248,11,51144,51144,11,52040,52040,11,52936,52936,11,53832,53832,11,54728,54728,11,69811,69814,5,70459,70460,5,71096,71099,7,71998,71998,5,72874,72880,5,119149,119149,7,127374,127374,14,128335,128335,14,128482,128482,14,128765,128767,14,129399,129400,14,129680,129685,14,1476,1477,5,2377,2380,7,2759,2760,5,3137,3140,7,3458,3459,7,4153,4154,5,6432,6434,5,6978,6978,5,7675,7679,5,9723,9726,14,9823,9823,14,9919,9923,14,10035,10036,14,42736,42737,5,43596,43596,5,44200,44200,11,44648,44648,11,45096,45096,11,45544,45544,11,45992,45992,11,46440,46440,11,46888,46888,11,47336,47336,11,47784,47784,11,48232,48232,11,48680,48680,11,49128,49128,11,49576,49576,11,50024,50024,11,50472,50472,11,50920,50920,11,51368,51368,11,51816,51816,11,52264,52264,11,52712,52712,11,53160,53160,11,53608,53608,11,54056,54056,11,54504,54504,11,54952,54952,11,68108,68111,5,69933,69940,5,70197,70197,7,70498,70499,7,70845,70845,5,71229,71229,5,71727,71735,5,72154,72155,5,72344,72345,5,73023,73029,5,94095,94098,5,121403,121452,5,126981,127182,14,127538,127546,14,127990,127990,14,128391,128391,14,128445,128449,14,128500,128505,14,128752,128752,14,129160,129167,14,129356,129356,14,129432,129442,14,129648,129651,14,129751,131069,14,173,173,4,1757,1757,1,2274,2274,1,2494,2494,5,2641,2641,5,2876,2876,5,3014,3016,7,3262,3262,7,3393,3396,5,3570,3571,7,3968,3972,5,4228,4228,7,6086,6086,5,6679,6680,5,6912,6915,5,7080,7081,5,7380,7392,5,8252,8252,14,9096,9096,14,9748,9749,14,9784,9786,14,9833,9850,14,9890,9894,14,9938,9938,14,9999,9999,14,10085,10087,14,12349,12349,14,43136,43137,7,43454,43456,7,43755,43755,7,44088,44088,11,44312,44312,11,44536,44536,11,44760,44760,11,44984,44984,11,45208,45208,11,45432,45432,11,45656,45656,11,45880,45880,11,46104,46104,11,46328,46328,11,46552,46552,11,46776,46776,11,47000,47000,11,47224,47224,11,47448,47448,11,47672,47672,11,47896,47896,11,48120,48120,11,48344,48344,11,48568,48568,11,48792,48792,11,49016,49016,11,49240,49240,11,49464,49464,11,49688,49688,11,49912,49912,11,50136,50136,11,50360,50360,11,50584,50584,11,50808,50808,11,51032,51032,11,51256,51256,11,51480,51480,11,51704,51704,11,51928,51928,11,52152,52152,11,52376,52376,11,52600,52600,11,52824,52824,11,53048,53048,11,53272,53272,11,53496,53496,11,53720,53720,11,53944,53944,11,54168,54168,11,54392,54392,11,54616,54616,11,54840,54840,11,55064,55064,11,65438,65439,5,69633,69633,5,69837,69837,1,70018,70018,7,70188,70190,7,70368,70370,7,70465,70468,7,70712,70719,5,70835,70840,5,70850,70851,5,71132,71133,5,71340,71340,7,71458,71461,5,71985,71989,7,72002,72002,7,72193,72202,5,72281,72283,5,72766,72766,7,72885,72886,5,73104,73105,5,92912,92916,5,113824,113827,4,119173,119179,5,121505,121519,5,125136,125142,5,127279,127279,14,127489,127490,14,127570,127743,14,127900,127901,14,128254,128254,14,128369,128370,14,128400,128400,14,128425,128432,14,128468,128475,14,128489,128494,14,128715,128720,14,128745,128745,14,128759,128760,14,129004,129023,14,129296,129304,14,129340,129342,14,129388,129392,14,129404,129407,14,129454,129455,14,129485,129487,14,129659,129663,14,129719,129727,14,917536,917631,5,13,13,2,1160,1161,5,1564,1564,4,1807,1807,1,2085,2087,5,2363,2363,7,2402,2403,5,2507,2508,7,2622,2624,7,2691,2691,7,2786,2787,5,2881,2884,5,3006,3006,5,3072,3072,5,3170,3171,5,3267,3268,7,3330,3331,7,3406,3406,1,3538,3540,5,3655,3662,5,3897,3897,5,4038,4038,5,4184,4185,5,4352,4447,8,6068,6069,5,6155,6157,5,6448,6449,7,6742,6742,5,6783,6783,5,6966,6970,5,7042,7042,7,7143,7143,7,7212,7219,5,7412,7412,5,8206,8207,4,8294,8303,4,8596,8601,14,9410,9410,14,9742,9742,14,9757,9757,14,9770,9770,14,9794,9794,14,9828,9828,14,9855,9855,14,9882,9882,14,9900,9903,14,9929,9933,14,9963,9967,14,9987,9988,14,10006,10006,14,10062,10062,14,10175,10175,14,11744,11775,5,42607,42607,5,43043,43044,7,43263,43263,5,43444,43445,7,43569,43570,5,43698,43700,5,43766,43766,5,44032,44032,11,44144,44144,11,44256,44256,11,44368,44368,11,44480,44480,11,44592,44592,11,44704,44704,11,44816,44816,11,44928,44928,11,45040,45040,11,45152,45152,11,45264,45264,11,45376,45376,11,45488,45488,11,45600,45600,11,45712,45712,11,45824,45824,11,45936,45936,11,46048,46048,11,46160,46160,11,46272,46272,11,46384,46384,11,46496,46496,11,46608,46608,11,46720,46720,11,46832,46832,11,46944,46944,11,47056,47056,11,47168,47168,11,47280,47280,11,47392,47392,11,47504,47504,11,47616,47616,11,47728,47728,11,47840,47840,11,47952,47952,11,48064,48064,11,48176,48176,11,48288,48288,11,48400,48400,11,48512,48512,11,48624,48624,11,48736,48736,11,48848,48848,11,48960,48960,11,49072,49072,11,49184,49184,11,49296,49296,11,49408,49408,11,49520,49520,11,49632,49632,11,49744,49744,11,49856,49856,11,49968,49968,11,50080,50080,11,50192,50192,11,50304,50304,11,50416,50416,11,50528,50528,11,50640,50640,11,50752,50752,11,50864,50864,11,50976,50976,11,51088,51088,11,51200,51200,11,51312,51312,11,51424,51424,11,51536,51536,11,51648,51648,11,51760,51760,11,51872,51872,11,51984,51984,11,52096,52096,11,52208,52208,11,52320,52320,11,52432,52432,11,52544,52544,11,52656,52656,11,52768,52768,11,52880,52880,11,52992,52992,11,53104,53104,11,53216,53216,11,53328,53328,11,53440,53440,11,53552,53552,11,53664,53664,11,53776,53776,11,53888,53888,11,54000,54000,11,54112,54112,11,54224,54224,11,54336,54336,11,54448,54448,11,54560,54560,11,54672,54672,11,54784,54784,11,54896,54896,11,55008,55008,11,55120,55120,11,64286,64286,5,66272,66272,5,68900,68903,5,69762,69762,7,69817,69818,5,69927,69931,5,70003,70003,5,70070,70078,5,70094,70094,7,70194,70195,7,70206,70206,5,70400,70401,5,70463,70463,7,70475,70477,7,70512,70516,5,70722,70724,5,70832,70832,5,70842,70842,5,70847,70848,5,71088,71089,7,71102,71102,7,71219,71226,5,71231,71232,5,71342,71343,7,71453,71455,5,71463,71467,5,71737,71738,5,71995,71996,5,72000,72000,7,72145,72147,7,72160,72160,5,72249,72249,7,72273,72278,5,72330,72342,5,72752,72758,5,72850,72871,5,72882,72883,5,73018,73018,5,73031,73031,5,73109,73109,5,73461,73462,7,94031,94031,5,94192,94193,7,119142,119142,7,119155,119162,4,119362,119364,5,121476,121476,5,122888,122904,5,123184,123190,5,126976,126979,14,127184,127231,14,127344,127345,14,127405,127461,14,127514,127514,14,127561,127567,14,127778,127779,14,127896,127896,14,127985,127986,14,127995,127999,5,128326,128328,14,128360,128366,14,128378,128378,14,128394,128397,14,128405,128406,14,128422,128423,14,128435,128443,14,128453,128464,14,128479,128480,14,128484,128487,14,128496,128498,14,128640,128709,14,128723,128724,14,128736,128741,14,128747,128748,14,128755,128755,14,128762,128762,14,128981,128991,14,129096,129103,14,129292,129292,14,129311,129311,14,129329,129330,14,129344,129349,14,129360,129374,14,129394,129394,14,129402,129402,14,129413,129425,14,129445,129450,14,129466,129471,14,129483,129483,14,129511,129535,14,129653,129655,14,129667,129670,14,129705,129711,14,129731,129743,14,917505,917505,4,917760,917999,5,10,10,3,127,159,4,768,879,5,1471,1471,5,1536,1541,1,1648,1648,5,1767,1768,5,1840,1866,5,2070,2073,5,2137,2139,5,2307,2307,7,2366,2368,7,2382,2383,7,2434,2435,7,2497,2500,5,2519,2519,5,2563,2563,7,2631,2632,5,2677,2677,5,2750,2752,7,2763,2764,7,2817,2817,5,2879,2879,5,2891,2892,7,2914,2915,5,3008,3008,5,3021,3021,5,3076,3076,5,3146,3149,5,3202,3203,7,3264,3265,7,3271,3272,7,3298,3299,5,3390,3390,5,3402,3404,7,3426,3427,5,3535,3535,5,3544,3550,7,3635,3635,7,3763,3763,7,3893,3893,5,3953,3966,5,3981,3991,5,4145,4145,7,4157,4158,5,4209,4212,5,4237,4237,5,4520,4607,10,5970,5971,5,6071,6077,5,6089,6099,5,6277,6278,5,6439,6440,5,6451,6456,7,6683,6683,5,6744,6750,5,6765,6770,7,6846,6846,5,6964,6964,5,6972,6972,5,7019,7027,5,7074,7077,5,7083,7085,5,7146,7148,7,7154,7155,7,7222,7223,5,7394,7400,5,7416,7417,5,8204,8204,5,8233,8233,4,8288,8292,4,8413,8416,5,8482,8482,14,8986,8987,14,9193,9203,14,9654,9654,14,9733,9733,14,9745,9745,14,9752,9752,14,9760,9760,14,9766,9766,14,9774,9775,14,9792,9792,14,9800,9811,14,9825,9826,14,9831,9831,14,9852,9853,14,9872,9873,14,9880,9880,14,9885,9887,14,9896,9897,14,9906,9916,14,9926,9927,14,9936,9936,14,9941,9960,14,9974,9974,14,9982,9985,14,9992,9997,14,10002,10002,14,10017,10017,14,10055,10055,14,10071,10071,14,10145,10145,14,11013,11015,14,11503,11505,5,12334,12335,5,12951,12951,14,42612,42621,5,43014,43014,5,43047,43047,7,43204,43205,5,43335,43345,5,43395,43395,7,43450,43451,7,43561,43566,5,43573,43574,5,43644,43644,5,43710,43711,5,43758,43759,7,44005,44005,5,44012,44012,7,44060,44060,11,44116,44116,11,44172,44172,11,44228,44228,11,44284,44284,11,44340,44340,11,44396,44396,11,44452,44452,11,44508,44508,11,44564,44564,11,44620,44620,11,44676,44676,11,44732,44732,11,44788,44788,11,44844,44844,11,44900,44900,11,44956,44956,11,45012,45012,11,45068,45068,11,45124,45124,11,45180,45180,11,45236,45236,11,45292,45292,11,45348,45348,11,45404,45404,11,45460,45460,11,45516,45516,11,45572,45572,11,45628,45628,11,45684,45684,11,45740,45740,11,45796,45796,11,45852,45852,11,45908,45908,11,45964,45964,11,46020,46020,11,46076,46076,11,46132,46132,11,46188,46188,11,46244,46244,11,46300,46300,11,46356,46356,11,46412,46412,11,46468,46468,11,46524,46524,11,46580,46580,11,46636,46636,11,46692,46692,11,46748,46748,11,46804,46804,11,46860,46860,11,46916,46916,11,46972,46972,11,47028,47028,11,47084,47084,11,47140,47140,11,47196,47196,11,47252,47252,11,47308,47308,11,47364,47364,11,47420,47420,11,47476,47476,11,47532,47532,11,47588,47588,11,47644,47644,11,47700,47700,11,47756,47756,11,47812,47812,11,47868,47868,11,47924,47924,11,47980,47980,11,48036,48036,11,48092,48092,11,48148,48148,11,48204,48204,11,48260,48260,11,48316,48316,11,48372,48372,11,48428,48428,11,48484,48484,11,48540,48540,11,48596,48596,11,48652,48652,11,48708,48708,11,48764,48764,11,48820,48820,11,48876,48876,11,48932,48932,11,48988,48988,11,49044,49044,11,49100,49100,11,49156,49156,11,49212,49212,11,49268,49268,11,49324,49324,11,49380,49380,11,49436,49436,11,49492,49492,11,49548,49548,11,49604,49604,11,49660,49660,11,49716,49716,11,49772,49772,11,49828,49828,11,49884,49884,11,49940,49940,11,49996,49996,11,50052,50052,11,50108,50108,11,50164,50164,11,50220,50220,11,50276,50276,11,50332,50332,11,50388,50388,11,50444,50444,11,50500,50500,11,50556,50556,11,50612,50612,11,50668,50668,11,50724,50724,11,50780,50780,11,50836,50836,11,50892,50892,11,50948,50948,11,51004,51004,11,51060,51060,11,51116,51116,11,51172,51172,11,51228,51228,11,51284,51284,11,51340,51340,11,51396,51396,11,51452,51452,11,51508,51508,11,51564,51564,11,51620,51620,11,51676,51676,11,51732,51732,11,51788,51788,11,51844,51844,11,51900,51900,11,51956,51956,11,52012,52012,11,52068,52068,11,52124,52124,11,52180,52180,11,52236,52236,11,52292,52292,11,52348,52348,11,52404,52404,11,52460,52460,11,52516,52516,11,52572,52572,11,52628,52628,11,52684,52684,11,52740,52740,11,52796,52796,11,52852,52852,11,52908,52908,11,52964,52964,11,53020,53020,11,53076,53076,11,53132,53132,11,53188,53188,11,53244,53244,11,53300,53300,11,53356,53356,11,53412,53412,11,53468,53468,11,53524,53524,11,53580,53580,11,53636,53636,11,53692,53692,11,53748,53748,11,53804,53804,11,53860,53860,11,53916,53916,11,53972,53972,11,54028,54028,11,54084,54084,11,54140,54140,11,54196,54196,11,54252,54252,11,54308,54308,11,54364,54364,11,54420,54420,11,54476,54476,11,54532,54532,11,54588,54588,11,54644,54644,11,54700,54700,11,54756,54756,11,54812,54812,11,54868,54868,11,54924,54924,11,54980,54980,11,55036,55036,11,55092,55092,11,55148,55148,11,55216,55238,9,65056,65071,5,65529,65531,4,68097,68099,5,68159,68159,5,69446,69456,5,69688,69702,5,69808,69810,7,69815,69816,7,69821,69821,1,69888,69890,5,69932,69932,7,69957,69958,7,70016,70017,5,70067,70069,7,70079,70080,7,70089,70092,5,70095,70095,5,70191,70193,5,70196,70196,5,70198,70199,5,70367,70367,5,70371,70378,5,70402,70403,7,70462,70462,5,70464,70464,5,70471,70472,7,70487,70487,5,70502,70508,5,70709,70711,7,70720,70721,7,70725,70725,7,70750,70750,5,70833,70834,7,70841,70841,7,70843,70844,7,70846,70846,7,70849,70849,7,71087,71087,5,71090,71093,5,71100,71101,5,71103,71104,5,71216,71218,7,71227,71228,7,71230,71230,7,71339,71339,5,71341,71341,5,71344,71349,5,71351,71351,5,71456,71457,7,71462,71462,7,71724,71726,7,71736,71736,7,71984,71984,5,71991,71992,7,71997,71997,7,71999,71999,1,72001,72001,1,72003,72003,5,72148,72151,5,72156,72159,7,72164,72164,7,72243,72248,5,72250,72250,1,72263,72263,5,72279,72280,7,72324,72329,1,72343,72343,7,72751,72751,7,72760,72765,5,72767,72767,5,72873,72873,7,72881,72881,7,72884,72884,7,73009,73014,5,73020,73021,5,73030,73030,1,73098,73102,7,73107,73108,7,73110,73110,7,73459,73460,5,78896,78904,4,92976,92982,5,94033,94087,7,94180,94180,5,113821,113822,5,119141,119141,5,119143,119145,5,119150,119154,5,119163,119170,5,119210,119213,5,121344,121398,5,121461,121461,5,121499,121503,5,122880,122886,5,122907,122913,5,122918,122922,5,123628,123631,5,125252,125258,5,126980,126980,14,127183,127183,14,127245,127247,14,127340,127343,14,127358,127359,14,127377,127386,14,127462,127487,6,127491,127503,14,127535,127535,14,127548,127551,14,127568,127569,14,127744,127777,14,127780,127891,14,127894,127895,14,127897,127899,14,127902,127984,14,127987,127989,14,127991,127994,14,128000,128253,14,128255,128317,14,128329,128334,14,128336,128359,14,128367,128368,14,128371,128377,14,128379,128390,14,128392,128393,14,128398,128399,14,128401,128404,14,128407,128419,14,128421,128421,14,128424,128424,14,128433,128434,14,128444,128444,14,128450,128452,14,128465,128467,14,128476,128478,14,128481,128481,14,128483,128483,14,128488,128488,14,128495,128495,14,128499,128499,14,128506,128591,14,128710,128714,14,128721,128722,14,128725,128725,14,128728,128735,14,128742,128744,14,128746,128746,14,128749,128751,14,128753,128754,14,128756,128758,14,128761,128761,14,128763,128764,14,128884,128895,14,128992,129003,14,129036,129039,14,129114,129119,14,129198,129279,14,129293,129295,14,129305,129310,14,129312,129319,14,129328,129328,14,129331,129338,14,129343,129343,14,129351,129355,14,129357,129359,14,129375,129387,14,129393,129393,14,129395,129398,14,129401,129401,14,129403,129403,14,129408,129412,14,129426,129431,14,129443,129444,14,129451,129453,14,129456,129465,14,129472,129472,14,129475,129482,14,129484,129484,14,129488,129510,14,129536,129647,14,129652,129652,14,129656,129658,14,129664,129666,14,129671,129679,14,129686,129704,14,129712,129718,14,129728,129730,14,129744,129750,14,917504,917504,4,917506,917535,4,917632,917759,4,918000,921599,4,0,9,4,11,12,4,14,31,4,169,169,14,174,174,14,1155,1159,5,1425,1469,5,1473,1474,5,1479,1479,5,1552,1562,5,1611,1631,5,1750,1756,5,1759,1764,5,1770,1773,5,1809,1809,5,1958,1968,5,2045,2045,5,2075,2083,5,2089,2093,5,2259,2273,5,2275,2306,5,2362,2362,5,2364,2364,5,2369,2376,5,2381,2381,5,2385,2391,5,2433,2433,5,2492,2492,5,2495,2496,7,2503,2504,7,2509,2509,5,2530,2531,5,2561,2562,5,2620,2620,5,2625,2626,5,2635,2637,5,2672,2673,5,2689,2690,5,2748,2748,5,2753,2757,5,2761,2761,7,2765,2765,5,2810,2815,5,2818,2819,7,2878,2878,5,2880,2880,7,2887,2888,7,2893,2893,5,2903,2903,5,2946,2946,5,3007,3007,7,3009,3010,7,3018,3020,7,3031,3031,5,3073,3075,7,3134,3136,5,3142,3144,5,3157,3158,5,3201,3201,5,3260,3260,5,3263,3263,5,3266,3266,5,3270,3270,5,3274,3275,7,3285,3286,5,3328,3329,5,3387,3388,5,3391,3392,7,3398,3400,7,3405,3405,5,3415,3415,5,3457,3457,5,3530,3530,5,3536,3537,7,3542,3542,5,3551,3551,5,3633,3633,5,3636,3642,5,3761,3761,5,3764,3772,5,3864,3865,5,3895,3895,5,3902,3903,7,3967,3967,7,3974,3975,5,3993,4028,5,4141,4144,5,4146,4151,5,4155,4156,7,4182,4183,7,4190,4192,5,4226,4226,5,4229,4230,5,4253,4253,5,4448,4519,9,4957,4959,5,5938,5940,5,6002,6003,5,6070,6070,7,6078,6085,7,6087,6088,7,6109,6109,5,6158,6158,4,6313,6313,5,6435,6438,7,6441,6443,7,6450,6450,5,6457,6459,5,6681,6682,7,6741,6741,7,6743,6743,7,6752,6752,5,6757,6764,5,6771,6780,5,6832,6845,5,6847,6848,5,6916,6916,7,6965,6965,5,6971,6971,7,6973,6977,7,6979,6980,7,7040,7041,5,7073,7073,7,7078,7079,7,7082,7082,7,7142,7142,5,7144,7145,5,7149,7149,5,7151,7153,5,7204,7211,7,7220,7221,7,7376,7378,5,7393,7393,7,7405,7405,5,7415,7415,7,7616,7673,5,8203,8203,4,8205,8205,13,8232,8232,4,8234,8238,4,8265,8265,14,8293,8293,4,8400,8412,5,8417,8417,5,8421,8432,5,8505,8505,14,8617,8618,14,9000,9000,14,9167,9167,14,9208,9210,14,9642,9643,14,9664,9664,14,9728,9732,14,9735,9741,14,9743,9744,14,9746,9746,14,9750,9751,14,9753,9756,14,9758,9759,14,9761,9761,14,9764,9765,14,9767,9769,14,9771,9773,14,9776,9783,14,9787,9791,14,9793,9793,14,9795,9799,14,9812,9822,14,9824,9824,14,9827,9827,14,9829,9830,14,9832,9832,14,9851,9851,14,9854,9854,14,9856,9861,14,9874,9876,14,9878,9879,14,9881,9881,14,9883,9884,14,9888,9889,14,9895,9895,14,9898,9899,14,9904,9905,14,9917,9918,14,9924,9925,14,9928,9928,14,9934,9935,14,9937,9937,14,9939,9940,14,9961,9962,14,9968,9973,14,9975,9978,14,9981,9981,14,9986,9986,14,9989,9989,14,9998,9998,14,10000,10001,14,10004,10004,14,10013,10013,14,10024,10024,14,10052,10052,14,10060,10060,14,10067,10069,14,10083,10084,14,10133,10135,14,10160,10160,14,10548,10549,14,11035,11036,14,11093,11093,14,11647,11647,5,12330,12333,5,12336,12336,14,12441,12442,5,12953,12953,14,42608,42610,5,42654,42655,5,43010,43010,5,43019,43019,5,43045,43046,5,43052,43052,5,43188,43203,7,43232,43249,5,43302,43309,5,43346,43347,7,43392,43394,5,43443,43443,5,43446,43449,5,43452,43453,5,43493,43493,5,43567,43568,7,43571,43572,7,43587,43587,5,43597,43597,7,43696,43696,5,43703,43704,5,43713,43713,5,43756,43757,5,43765,43765,7,44003,44004,7,44006,44007,7,44009,44010,7,44013,44013,5,44033,44059,12,44061,44087,12,44089,44115,12,44117,44143,12,44145,44171,12,44173,44199,12,44201,44227,12,44229,44255,12,44257,44283,12,44285,44311,12,44313,44339,12,44341,44367,12,44369,44395,12,44397,44423,12,44425,44451,12,44453,44479,12,44481,44507,12,44509,44535,12,44537,44563,12,44565,44591,12,44593,44619,12,44621,44647,12,44649,44675,12,44677,44703,12,44705,44731,12,44733,44759,12,44761,44787,12,44789,44815,12,44817,44843,12,44845,44871,12,44873,44899,12,44901,44927,12,44929,44955,12,44957,44983,12,44985,45011,12,45013,45039,12,45041,45067,12,45069,45095,12,45097,45123,12,45125,45151,12,45153,45179,12,45181,45207,12,45209,45235,12,45237,45263,12,45265,45291,12,45293,45319,12,45321,45347,12,45349,45375,12,45377,45403,12,45405,45431,12,45433,45459,12,45461,45487,12,45489,45515,12,45517,45543,12,45545,45571,12,45573,45599,12,45601,45627,12,45629,45655,12,45657,45683,12,45685,45711,12,45713,45739,12,45741,45767,12,45769,45795,12,45797,45823,12,45825,45851,12,45853,45879,12,45881,45907,12,45909,45935,12,45937,45963,12,45965,45991,12,45993,46019,12,46021,46047,12,46049,46075,12,46077,46103,12,46105,46131,12,46133,46159,12,46161,46187,12,46189,46215,12,46217,46243,12,46245,46271,12,46273,46299,12,46301,46327,12,46329,46355,12,46357,46383,12,46385,46411,12,46413,46439,12,46441,46467,12,46469,46495,12,46497,46523,12,46525,46551,12,46553,46579,12,46581,46607,12,46609,46635,12,46637,46663,12,46665,46691,12,46693,46719,12,46721,46747,12,46749,46775,12,46777,46803,12,46805,46831,12,46833,46859,12,46861,46887,12,46889,46915,12,46917,46943,12,46945,46971,12,46973,46999,12,47001,47027,12,47029,47055,12,47057,47083,12,47085,47111,12,47113,47139,12,47141,47167,12,47169,47195,12,47197,47223,12,47225,47251,12,47253,47279,12,47281,47307,12,47309,47335,12,47337,47363,12,47365,47391,12,47393,47419,12,47421,47447,12,47449,47475,12,47477,47503,12,47505,47531,12,47533,47559,12,47561,47587,12,47589,47615,12,47617,47643,12,47645,47671,12,47673,47699,12,47701,47727,12,47729,47755,12,47757,47783,12,47785,47811,12,47813,47839,12,47841,47867,12,47869,47895,12,47897,47923,12,47925,47951,12,47953,47979,12,47981,48007,12,48009,48035,12,48037,48063,12,48065,48091,12,48093,48119,12,48121,48147,12,48149,48175,12,48177,48203,12,48205,48231,12,48233,48259,12,48261,48287,12,48289,48315,12,48317,48343,12,48345,48371,12,48373,48399,12,48401,48427,12,48429,48455,12,48457,48483,12,48485,48511,12,48513,48539,12,48541,48567,12,48569,48595,12,48597,48623,12,48625,48651,12,48653,48679,12,48681,48707,12,48709,48735,12,48737,48763,12,48765,48791,12,48793,48819,12,48821,48847,12,48849,48875,12,48877,48903,12,48905,48931,12,48933,48959,12,48961,48987,12,48989,49015,12,49017,49043,12,49045,49071,12,49073,49099,12,49101,49127,12,49129,49155,12,49157,49183,12,49185,49211,12,49213,49239,12,49241,49267,12,49269,49295,12,49297,49323,12,49325,49351,12,49353,49379,12,49381,49407,12,49409,49435,12,49437,49463,12,49465,49491,12,49493,49519,12,49521,49547,12,49549,49575,12,49577,49603,12,49605,49631,12,49633,49659,12,49661,49687,12,49689,49715,12,49717,49743,12,49745,49771,12,49773,49799,12,49801,49827,12,49829,49855,12,49857,49883,12,49885,49911,12,49913,49939,12,49941,49967,12,49969,49995,12,49997,50023,12,50025,50051,12,50053,50079,12,50081,50107,12,50109,50135,12,50137,50163,12,50165,50191,12,50193,50219,12,50221,50247,12,50249,50275,12,50277,50303,12,50305,50331,12,50333,50359,12,50361,50387,12,50389,50415,12,50417,50443,12,50445,50471,12,50473,50499,12,50501,50527,12,50529,50555,12,50557,50583,12,50585,50611,12,50613,50639,12,50641,50667,12,50669,50695,12,50697,50723,12,50725,50751,12,50753,50779,12,50781,50807,12,50809,50835,12,50837,50863,12,50865,50891,12,50893,50919,12,50921,50947,12,50949,50975,12,50977,51003,12,51005,51031,12,51033,51059,12,51061,51087,12,51089,51115,12,51117,51143,12,51145,51171,12,51173,51199,12,51201,51227,12,51229,51255,12,51257,51283,12,51285,51311,12,51313,51339,12,51341,51367,12,51369,51395,12,51397,51423,12,51425,51451,12,51453,51479,12,51481,51507,12,51509,51535,12,51537,51563,12,51565,51591,12,51593,51619,12,51621,51647,12,51649,51675,12,51677,51703,12,51705,51731,12,51733,51759,12,51761,51787,12,51789,51815,12,51817,51843,12,51845,51871,12,51873,51899,12,51901,51927,12,51929,51955,12,51957,51983,12,51985,52011,12,52013,52039,12,52041,52067,12,52069,52095,12,52097,52123,12,52125,52151,12,52153,52179,12,52181,52207,12,52209,52235,12,52237,52263,12,52265,52291,12,52293,52319,12,52321,52347,12,52349,52375,12,52377,52403,12,52405,52431,12,52433,52459,12,52461,52487,12,52489,52515,12,52517,52543,12,52545,52571,12,52573,52599,12,52601,52627,12,52629,52655,12,52657,52683,12,52685,52711,12,52713,52739,12,52741,52767,12,52769,52795,12,52797,52823,12,52825,52851,12,52853,52879,12,52881,52907,12,52909,52935,12,52937,52963,12,52965,52991,12,52993,53019,12,53021,53047,12,53049,53075,12,53077,53103,12,53105,53131,12,53133,53159,12,53161,53187,12,53189,53215,12,53217,53243,12,53245,53271,12,53273,53299,12,53301,53327,12,53329,53355,12,53357,53383,12,53385,53411,12,53413,53439,12,53441,53467,12,53469,53495,12,53497,53523,12,53525,53551,12,53553,53579,12,53581,53607,12,53609,53635,12,53637,53663,12,53665,53691,12,53693,53719,12,53721,53747,12,53749,53775,12,53777,53803,12,53805,53831,12,53833,53859,12,53861,53887,12,53889,53915,12,53917,53943,12,53945,53971,12,53973,53999,12,54001,54027,12,54029,54055,12,54057,54083,12,54085,54111,12,54113,54139,12,54141,54167,12,54169,54195,12,54197,54223,12,54225,54251,12,54253,54279,12,54281,54307,12,54309,54335,12,54337,54363,12,54365,54391,12,54393,54419,12,54421,54447,12,54449,54475,12,54477,54503,12,54505,54531,12,54533,54559,12,54561,54587,12,54589,54615,12,54617,54643,12,54645,54671,12,54673,54699,12,54701,54727,12,54729,54755,12,54757,54783,12,54785,54811,12,54813,54839,12,54841,54867,12,54869,54895,12,54897,54923,12,54925,54951,12,54953,54979,12,54981,55007,12,55009,55035,12,55037,55063,12,55065,55091,12,55093,55119,12,55121,55147,12,55149,55175,12,55177,55203,12,55243,55291,10,65024,65039,5,65279,65279,4,65520,65528,4,66045,66045,5,66422,66426,5,68101,68102,5,68152,68154,5,68325,68326,5,69291,69292,5,69632,69632,7,69634,69634,7,69759,69761,5]'); +} +//#endregion /***/ }), @@ -3568,7 +4242,7 @@ function repeat(s, count) { /*!****************************************************************!*\ !*** ./node_modules/monaco-editor/esm/vs/base/common/types.js ***! \****************************************************************/ -/*! exports provided: isArray, isString, isObject, isNumber, isBoolean, isUndefined, isUndefinedOrNull, isEmptyObject, isFunction, validateConstraints, validateConstraint, getAllPropertyNames, withNullAsUndefined, withUndefinedAsNull */ +/*! exports provided: isArray, isString, isObject, isNumber, isBoolean, isUndefined, isUndefinedOrNull, assertType, isEmptyObject, isFunction, validateConstraints, validateConstraint, getAllPropertyNames, getAllMethodNames, createProxyObject, withNullAsUndefined, withUndefinedAsNull */ /***/ (function(module, __webpack_exports__, __webpack_require__) { "use strict"; @@ -3580,160 +4254,238 @@ __webpack_require__.r(__webpack_exports__); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "isBoolean", function() { return isBoolean; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "isUndefined", function() { return isUndefined; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "isUndefinedOrNull", function() { return isUndefinedOrNull; }); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "assertType", function() { return assertType; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "isEmptyObject", function() { return isEmptyObject; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "isFunction", function() { return isFunction; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "validateConstraints", function() { return validateConstraints; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "validateConstraint", function() { return validateConstraint; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "getAllPropertyNames", function() { return getAllPropertyNames; }); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "getAllMethodNames", function() { return getAllMethodNames; }); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "createProxyObject", function() { return createProxyObject; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "withNullAsUndefined", function() { return withNullAsUndefined; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "withUndefinedAsNull", function() { return withUndefinedAsNull; }); -/*--------------------------------------------------------------------------------------------- - * Copyright (c) Microsoft Corporation. All rights reserved. - * Licensed under the MIT License. See License.txt in the project root for license information. - *--------------------------------------------------------------------------------------------*/ -var _typeof = { - number: 'number', - string: 'string', - undefined: 'undefined', - object: 'object', - function: 'function' -}; -/** - * @returns whether the provided parameter is a JavaScript Array or not. - */ -function isArray(array) { - if (Array.isArray) { - return Array.isArray(array); - } - if (array && typeof (array.length) === _typeof.number && array.constructor === Array) { - return true; - } - return false; -} -/** - * @returns whether the provided parameter is a JavaScript String or not. - */ -function isString(str) { - if (typeof (str) === _typeof.string || str instanceof String) { - return true; - } - return false; -} -/** - * - * @returns whether the provided parameter is of type `object` but **not** - * `null`, an `array`, a `regexp`, nor a `date`. - */ -function isObject(obj) { - // The method can't do a type cast since there are type (like strings) which - // are subclasses of any put not positvely matched by the function. Hence type - // narrowing results in wrong results. - return typeof obj === _typeof.object - && obj !== null - && !Array.isArray(obj) - && !(obj instanceof RegExp) - && !(obj instanceof Date); -} -/** - * In **contrast** to just checking `typeof` this will return `false` for `NaN`. - * @returns whether the provided parameter is a JavaScript Number or not. - */ -function isNumber(obj) { - if ((typeof (obj) === _typeof.number || obj instanceof Number) && !isNaN(obj)) { - return true; - } - return false; -} -/** - * @returns whether the provided parameter is a JavaScript Boolean or not. - */ -function isBoolean(obj) { - return obj === true || obj === false; -} -/** - * @returns whether the provided parameter is undefined. - */ -function isUndefined(obj) { - return typeof (obj) === _typeof.undefined; -} -/** - * @returns whether the provided parameter is undefined or null. - */ -function isUndefinedOrNull(obj) { - return isUndefined(obj) || obj === null; -} -var hasOwnProperty = Object.prototype.hasOwnProperty; -/** - * @returns whether the provided parameter is an empty JavaScript Object or not. - */ -function isEmptyObject(obj) { - if (!isObject(obj)) { - return false; - } - for (var key in obj) { - if (hasOwnProperty.call(obj, key)) { - return false; - } - } - return true; -} -/** - * @returns whether the provided parameter is a JavaScript Function or not. - */ -function isFunction(obj) { - return typeof obj === _typeof.function; -} -function validateConstraints(args, constraints) { - var len = Math.min(args.length, constraints.length); - for (var i = 0; i < len; i++) { - validateConstraint(args[i], constraints[i]); - } -} -function validateConstraint(arg, constraint) { - if (isString(constraint)) { - if (typeof arg !== constraint) { - throw new Error("argument does not match constraint: typeof " + constraint); - } - } - else if (isFunction(constraint)) { - try { - if (arg instanceof constraint) { - return; - } - } - catch (_a) { - // ignore - } - if (!isUndefinedOrNull(arg) && arg.constructor === constraint) { - return; - } - if (constraint.length === 1 && constraint.call(undefined, arg) === true) { - return; - } - throw new Error("argument does not match one of these constraints: arg instanceof constraint, arg.constructor === constraint, nor constraint(arg) === true"); - } -} -function getAllPropertyNames(obj) { - var res = []; - var proto = Object.getPrototypeOf(obj); - while (Object.prototype !== proto) { - res = res.concat(Object.getOwnPropertyNames(proto)); - proto = Object.getPrototypeOf(proto); - } - return res; -} -/** - * Converts null to undefined, passes all other values through. - */ -function withNullAsUndefined(x) { - return x === null ? undefined : x; -} -/** - * Converts undefined to null, passes all other values through. - */ -function withUndefinedAsNull(x) { - return typeof x === 'undefined' ? null : x; -} +/*--------------------------------------------------------------------------------------------- + * Copyright (c) Microsoft Corporation. All rights reserved. + * Licensed under the MIT License. See License.txt in the project root for license information. + *--------------------------------------------------------------------------------------------*/ +var _typeof = { + number: 'number', + string: 'string', + undefined: 'undefined', + object: 'object', + function: 'function' +}; +/** + * @returns whether the provided parameter is a JavaScript Array or not. + */ +function isArray(array) { + if (Array.isArray) { + return Array.isArray(array); + } + if (array && typeof (array.length) === _typeof.number && array.constructor === Array) { + return true; + } + return false; +} +/** + * @returns whether the provided parameter is a JavaScript String or not. + */ +function isString(str) { + if (typeof (str) === _typeof.string || str instanceof String) { + return true; + } + return false; +} +/** + * + * @returns whether the provided parameter is of type `object` but **not** + * `null`, an `array`, a `regexp`, nor a `date`. + */ +function isObject(obj) { + // The method can't do a type cast since there are type (like strings) which + // are subclasses of any put not positvely matched by the function. Hence type + // narrowing results in wrong results. + return typeof obj === _typeof.object + && obj !== null + && !Array.isArray(obj) + && !(obj instanceof RegExp) + && !(obj instanceof Date); +} +/** + * In **contrast** to just checking `typeof` this will return `false` for `NaN`. + * @returns whether the provided parameter is a JavaScript Number or not. + */ +function isNumber(obj) { + if ((typeof (obj) === _typeof.number || obj instanceof Number) && !isNaN(obj)) { + return true; + } + return false; +} +/** + * @returns whether the provided parameter is a JavaScript Boolean or not. + */ +function isBoolean(obj) { + return obj === true || obj === false; +} +/** + * @returns whether the provided parameter is undefined. + */ +function isUndefined(obj) { + return typeof (obj) === _typeof.undefined; +} +/** + * @returns whether the provided parameter is undefined or null. + */ +function isUndefinedOrNull(obj) { + return isUndefined(obj) || obj === null; +} +function assertType(condition, type) { + if (!condition) { + throw new Error(type ? "Unexpected type, expected '" + type + "'" : 'Unexpected type'); + } +} +var hasOwnProperty = Object.prototype.hasOwnProperty; +/** + * @returns whether the provided parameter is an empty JavaScript Object or not. + */ +function isEmptyObject(obj) { + if (!isObject(obj)) { + return false; + } + for (var key in obj) { + if (hasOwnProperty.call(obj, key)) { + return false; + } + } + return true; +} +/** + * @returns whether the provided parameter is a JavaScript Function or not. + */ +function isFunction(obj) { + return typeof obj === _typeof.function; +} +function validateConstraints(args, constraints) { + var len = Math.min(args.length, constraints.length); + for (var i = 0; i < len; i++) { + validateConstraint(args[i], constraints[i]); + } +} +function validateConstraint(arg, constraint) { + if (isString(constraint)) { + if (typeof arg !== constraint) { + throw new Error("argument does not match constraint: typeof " + constraint); + } + } + else if (isFunction(constraint)) { + try { + if (arg instanceof constraint) { + return; + } + } + catch (_a) { + // ignore + } + if (!isUndefinedOrNull(arg) && arg.constructor === constraint) { + return; + } + if (constraint.length === 1 && constraint.call(undefined, arg) === true) { + return; + } + throw new Error("argument does not match one of these constraints: arg instanceof constraint, arg.constructor === constraint, nor constraint(arg) === true"); + } +} +function getAllPropertyNames(obj) { + var res = []; + var proto = Object.getPrototypeOf(obj); + while (Object.prototype !== proto) { + res = res.concat(Object.getOwnPropertyNames(proto)); + proto = Object.getPrototypeOf(proto); + } + return res; +} +function getAllMethodNames(obj) { + var methods = []; + for (var _i = 0, _a = getAllPropertyNames(obj); _i < _a.length; _i++) { + var prop = _a[_i]; + if (typeof obj[prop] === 'function') { + methods.push(prop); + } + } + return methods; +} +function createProxyObject(methodNames, invoke) { + var createProxyMethod = function (method) { + return function () { + var args = Array.prototype.slice.call(arguments, 0); + return invoke(method, args); + }; + }; + var result = {}; + for (var _i = 0, methodNames_1 = methodNames; _i < methodNames_1.length; _i++) { + var methodName = methodNames_1[_i]; + result[methodName] = createProxyMethod(methodName); + } + return result; +} +/** + * Converts null to undefined, passes all other values through. + */ +function withNullAsUndefined(x) { + return x === null ? undefined : x; +} +/** + * Converts undefined to null, passes all other values through. + */ +function withUndefinedAsNull(x) { + return typeof x === 'undefined' ? null : x; +} + + +/***/ }), + +/***/ "./node_modules/monaco-editor/esm/vs/base/common/uint.js": +/*!***************************************************************!*\ + !*** ./node_modules/monaco-editor/esm/vs/base/common/uint.js ***! + \***************************************************************/ +/*! exports provided: toUint8, toUint32, toUint32Array */ +/***/ (function(module, __webpack_exports__, __webpack_require__) { + +"use strict"; +__webpack_require__.r(__webpack_exports__); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "toUint8", function() { return toUint8; }); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "toUint32", function() { return toUint32; }); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "toUint32Array", function() { return toUint32Array; }); +/*--------------------------------------------------------------------------------------------- + * Copyright (c) Microsoft Corporation. All rights reserved. + * Licensed under the MIT License. See License.txt in the project root for license information. + *--------------------------------------------------------------------------------------------*/ +function toUint8(v) { + if (v < 0) { + return 0; + } + if (v > 255 /* MAX_UINT_8 */) { + return 255 /* MAX_UINT_8 */; + } + return v | 0; +} +function toUint32(v) { + if (v < 0) { + return 0; + } + if (v > 4294967295 /* MAX_UINT_32 */) { + return 4294967295 /* MAX_UINT_32 */; + } + return v | 0; +} +function toUint32Array(arr) { + var len = arr.length; + var r = new Uint32Array(len); + for (var i = 0; i < len; i++) { + r[i] = toUint32(arr[i]); + } + return r; +} /***/ }), @@ -3749,583 +4501,596 @@ function withUndefinedAsNull(x) { __webpack_require__.r(__webpack_exports__); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "URI", function() { return URI; }); /* harmony import */ var _platform_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./platform.js */ "./node_modules/monaco-editor/esm/vs/base/common/platform.js"); -/*--------------------------------------------------------------------------------------------- - * Copyright (c) Microsoft Corporation. All rights reserved. - * Licensed under the MIT License. See License.txt in the project root for license information. - *--------------------------------------------------------------------------------------------*/ -var __extends = (undefined && undefined.__extends) || (function () { - var extendStatics = function (d, b) { - extendStatics = Object.setPrototypeOf || - ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) || - function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; }; - return extendStatics(d, b); - }; - return function (d, b) { - extendStatics(d, b); - function __() { this.constructor = d; } - d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __()); - }; -})(); -var _a; - -var _schemePattern = /^\w[\w\d+.-]*$/; -var _singleSlashStart = /^\//; -var _doubleSlashStart = /^\/\//; -var _throwOnMissingSchema = true; -function _validateUri(ret, _strict) { - // scheme, must be set - if (!ret.scheme) { - if (_strict || _throwOnMissingSchema) { - throw new Error("[UriError]: Scheme is missing: {scheme: \"\", authority: \"" + ret.authority + "\", path: \"" + ret.path + "\", query: \"" + ret.query + "\", fragment: \"" + ret.fragment + "\"}"); - } - else { - console.warn("[UriError]: Scheme is missing: {scheme: \"\", authority: \"" + ret.authority + "\", path: \"" + ret.path + "\", query: \"" + ret.query + "\", fragment: \"" + ret.fragment + "\"}"); - } - } - // scheme, https://tools.ietf.org/html/rfc3986#section-3.1 - // ALPHA *( ALPHA / DIGIT / "+" / "-" / "." ) - if (ret.scheme && !_schemePattern.test(ret.scheme)) { - throw new Error('[UriError]: Scheme contains illegal characters.'); - } - // path, http://tools.ietf.org/html/rfc3986#section-3.3 - // If a URI contains an authority component, then the path component - // must either be empty or begin with a slash ("/") character. If a URI - // does not contain an authority component, then the path cannot begin - // with two slash characters ("//"). - if (ret.path) { - if (ret.authority) { - if (!_singleSlashStart.test(ret.path)) { - throw new Error('[UriError]: If a URI contains an authority component, then the path component must either be empty or begin with a slash ("/") character'); - } - } - else { - if (_doubleSlashStart.test(ret.path)) { - throw new Error('[UriError]: If a URI does not contain an authority component, then the path cannot begin with two slash characters ("//")'); - } - } - } -} -// for a while we allowed uris *without* schemes and this is the migration -// for them, e.g. an uri without scheme and without strict-mode warns and falls -// back to the file-scheme. that should cause the least carnage and still be a -// clear warning -function _schemeFix(scheme, _strict) { - if (_strict || _throwOnMissingSchema) { - return scheme || _empty; - } - if (!scheme) { - console.trace('BAD uri lacks scheme, falling back to file-scheme.'); - scheme = 'file'; - } - return scheme; -} -// implements a bit of https://tools.ietf.org/html/rfc3986#section-5 -function _referenceResolution(scheme, path) { - // the slash-character is our 'default base' as we don't - // support constructing URIs relative to other URIs. This - // also means that we alter and potentially break paths. - // see https://tools.ietf.org/html/rfc3986#section-5.1.4 - switch (scheme) { - case 'https': - case 'http': - case 'file': - if (!path) { - path = _slash; - } - else if (path[0] !== _slash) { - path = _slash + path; - } - break; - } - return path; -} -var _empty = ''; -var _slash = '/'; -var _regexp = /^(([^:/?#]+?):)?(\/\/([^/?#]*))?([^?#]*)(\?([^#]*))?(#(.*))?/; -/** - * Uniform Resource Identifier (URI) http://tools.ietf.org/html/rfc3986. - * This class is a simple parser which creates the basic component parts - * (http://tools.ietf.org/html/rfc3986#section-3) with minimal validation - * and encoding. - * - * foo://example.com:8042/over/there?name=ferret#nose - * \_/ \______________/\_________/ \_________/ \__/ - * | | | | | - * scheme authority path query fragment - * | _____________________|__ - * / \ / \ - * urn:example:animal:ferret:nose - */ -var URI = /** @class */ (function () { - /** - * @internal - */ - function URI(schemeOrData, authority, path, query, fragment, _strict) { - if (_strict === void 0) { _strict = false; } - if (typeof schemeOrData === 'object') { - this.scheme = schemeOrData.scheme || _empty; - this.authority = schemeOrData.authority || _empty; - this.path = schemeOrData.path || _empty; - this.query = schemeOrData.query || _empty; - this.fragment = schemeOrData.fragment || _empty; - // no validation because it's this URI - // that creates uri components. - // _validateUri(this); - } - else { - this.scheme = _schemeFix(schemeOrData, _strict); - this.authority = authority || _empty; - this.path = _referenceResolution(this.scheme, path || _empty); - this.query = query || _empty; - this.fragment = fragment || _empty; - _validateUri(this, _strict); - } - } - URI.isUri = function (thing) { - if (thing instanceof URI) { - return true; - } - if (!thing) { - return false; - } - return typeof thing.authority === 'string' - && typeof thing.fragment === 'string' - && typeof thing.path === 'string' - && typeof thing.query === 'string' - && typeof thing.scheme === 'string' - && typeof thing.fsPath === 'function' - && typeof thing.with === 'function' - && typeof thing.toString === 'function'; - }; - Object.defineProperty(URI.prototype, "fsPath", { - // ---- filesystem path ----------------------- - /** - * Returns a string representing the corresponding file system path of this URI. - * Will handle UNC paths, normalizes windows drive letters to lower-case, and uses the - * platform specific path separator. - * - * * Will *not* validate the path for invalid characters and semantics. - * * Will *not* look at the scheme of this URI. - * * The result shall *not* be used for display purposes but for accessing a file on disk. - * - * - * The *difference* to `URI#path` is the use of the platform specific separator and the handling - * of UNC paths. See the below sample of a file-uri with an authority (UNC path). - * - * ```ts - const u = URI.parse('file://server/c$/folder/file.txt') - u.authority === 'server' - u.path === '/shares/c$/file.txt' - u.fsPath === '\\server\c$\folder\file.txt' - ``` - * - * Using `URI#path` to read a file (using fs-apis) would not be enough because parts of the path, - * namely the server name, would be missing. Therefore `URI#fsPath` exists - it's sugar to ease working - * with URIs that represent files on disk (`file` scheme). - */ - get: function () { - // if (this.scheme !== 'file') { - // console.warn(`[UriError] calling fsPath with scheme ${this.scheme}`); - // } - return _makeFsPath(this); - }, - enumerable: true, - configurable: true - }); - // ---- modify to new ------------------------- - URI.prototype.with = function (change) { - if (!change) { - return this; - } - var scheme = change.scheme, authority = change.authority, path = change.path, query = change.query, fragment = change.fragment; - if (scheme === undefined) { - scheme = this.scheme; - } - else if (scheme === null) { - scheme = _empty; - } - if (authority === undefined) { - authority = this.authority; - } - else if (authority === null) { - authority = _empty; - } - if (path === undefined) { - path = this.path; - } - else if (path === null) { - path = _empty; - } - if (query === undefined) { - query = this.query; - } - else if (query === null) { - query = _empty; - } - if (fragment === undefined) { - fragment = this.fragment; - } - else if (fragment === null) { - fragment = _empty; - } - if (scheme === this.scheme - && authority === this.authority - && path === this.path - && query === this.query - && fragment === this.fragment) { - return this; - } - return new _URI(scheme, authority, path, query, fragment); - }; - // ---- parse & validate ------------------------ - /** - * Creates a new URI from a string, e.g. `http://www.msft.com/some/path`, - * `file:///usr/home`, or `scheme:with/path`. - * - * @param value A string which represents an URI (see `URI#toString`). - */ - URI.parse = function (value, _strict) { - if (_strict === void 0) { _strict = false; } - var match = _regexp.exec(value); - if (!match) { - return new _URI(_empty, _empty, _empty, _empty, _empty); - } - return new _URI(match[2] || _empty, decodeURIComponent(match[4] || _empty), decodeURIComponent(match[5] || _empty), decodeURIComponent(match[7] || _empty), decodeURIComponent(match[9] || _empty), _strict); - }; - /** - * Creates a new URI from a file system path, e.g. `c:\my\files`, - * `/usr/home`, or `\\server\share\some\path`. - * - * The *difference* between `URI#parse` and `URI#file` is that the latter treats the argument - * as path, not as stringified-uri. E.g. `URI.file(path)` is **not the same as** - * `URI.parse('file://' + path)` because the path might contain characters that are - * interpreted (# and ?). See the following sample: - * ```ts - const good = URI.file('/coding/c#/project1'); - good.scheme === 'file'; - good.path === '/coding/c#/project1'; - good.fragment === ''; - const bad = URI.parse('file://' + '/coding/c#/project1'); - bad.scheme === 'file'; - bad.path === '/coding/c'; // path is now broken - bad.fragment === '/project1'; - ``` - * - * @param path A file system path (see `URI#fsPath`) - */ - URI.file = function (path) { - var authority = _empty; - // normalize to fwd-slashes on windows, - // on other systems bwd-slashes are valid - // filename character, eg /f\oo/ba\r.txt - if (_platform_js__WEBPACK_IMPORTED_MODULE_0__["isWindows"]) { - path = path.replace(/\\/g, _slash); - } - // check for authority as used in UNC shares - // or use the path as given - if (path[0] === _slash && path[1] === _slash) { - var idx = path.indexOf(_slash, 2); - if (idx === -1) { - authority = path.substring(2); - path = _slash; - } - else { - authority = path.substring(2, idx); - path = path.substring(idx) || _slash; - } - } - return new _URI('file', authority, path, _empty, _empty); - }; - URI.from = function (components) { - return new _URI(components.scheme, components.authority, components.path, components.query, components.fragment); - }; - // ---- printing/externalize --------------------------- - /** - * Creates a string representation for this URI. It's guaranteed that calling - * `URI.parse` with the result of this function creates an URI which is equal - * to this URI. - * - * * The result shall *not* be used for display purposes but for externalization or transport. - * * The result will be encoded using the percentage encoding and encoding happens mostly - * ignore the scheme-specific encoding rules. - * - * @param skipEncoding Do not encode the result, default is `false` - */ - URI.prototype.toString = function (skipEncoding) { - if (skipEncoding === void 0) { skipEncoding = false; } - return _asFormatted(this, skipEncoding); - }; - URI.prototype.toJSON = function () { - return this; - }; - URI.revive = function (data) { - if (!data) { - return data; - } - else if (data instanceof URI) { - return data; - } - else { - var result = new _URI(data); - result._fsPath = data.fsPath; - result._formatted = data.external; - return result; - } - }; - return URI; -}()); - -// tslint:disable-next-line:class-name -var _URI = /** @class */ (function (_super) { - __extends(_URI, _super); - function _URI() { - var _this = _super !== null && _super.apply(this, arguments) || this; - _this._formatted = null; - _this._fsPath = null; - return _this; - } - Object.defineProperty(_URI.prototype, "fsPath", { - get: function () { - if (!this._fsPath) { - this._fsPath = _makeFsPath(this); - } - return this._fsPath; - }, - enumerable: true, - configurable: true - }); - _URI.prototype.toString = function (skipEncoding) { - if (skipEncoding === void 0) { skipEncoding = false; } - if (!skipEncoding) { - if (!this._formatted) { - this._formatted = _asFormatted(this, false); - } - return this._formatted; - } - else { - // we don't cache that - return _asFormatted(this, true); - } - }; - _URI.prototype.toJSON = function () { - var res = { - $mid: 1 - }; - // cached state - if (this._fsPath) { - res.fsPath = this._fsPath; - } - if (this._formatted) { - res.external = this._formatted; - } - // uri components - if (this.path) { - res.path = this.path; - } - if (this.scheme) { - res.scheme = this.scheme; - } - if (this.authority) { - res.authority = this.authority; - } - if (this.query) { - res.query = this.query; - } - if (this.fragment) { - res.fragment = this.fragment; - } - return res; - }; - return _URI; -}(URI)); -// reserved characters: https://tools.ietf.org/html/rfc3986#section-2.2 -var encodeTable = (_a = {}, - _a[58 /* Colon */] = '%3A', - _a[47 /* Slash */] = '%2F', - _a[63 /* QuestionMark */] = '%3F', - _a[35 /* Hash */] = '%23', - _a[91 /* OpenSquareBracket */] = '%5B', - _a[93 /* CloseSquareBracket */] = '%5D', - _a[64 /* AtSign */] = '%40', - _a[33 /* ExclamationMark */] = '%21', - _a[36 /* DollarSign */] = '%24', - _a[38 /* Ampersand */] = '%26', - _a[39 /* SingleQuote */] = '%27', - _a[40 /* OpenParen */] = '%28', - _a[41 /* CloseParen */] = '%29', - _a[42 /* Asterisk */] = '%2A', - _a[43 /* Plus */] = '%2B', - _a[44 /* Comma */] = '%2C', - _a[59 /* Semicolon */] = '%3B', - _a[61 /* Equals */] = '%3D', - _a[32 /* Space */] = '%20', - _a); -function encodeURIComponentFast(uriComponent, allowSlash) { - var res = undefined; - var nativeEncodePos = -1; - for (var pos = 0; pos < uriComponent.length; pos++) { - var code = uriComponent.charCodeAt(pos); - // unreserved characters: https://tools.ietf.org/html/rfc3986#section-2.3 - if ((code >= 97 /* a */ && code <= 122 /* z */) - || (code >= 65 /* A */ && code <= 90 /* Z */) - || (code >= 48 /* Digit0 */ && code <= 57 /* Digit9 */) - || code === 45 /* Dash */ - || code === 46 /* Period */ - || code === 95 /* Underline */ - || code === 126 /* Tilde */ - || (allowSlash && code === 47 /* Slash */)) { - // check if we are delaying native encode - if (nativeEncodePos !== -1) { - res += encodeURIComponent(uriComponent.substring(nativeEncodePos, pos)); - nativeEncodePos = -1; - } - // check if we write into a new string (by default we try to return the param) - if (res !== undefined) { - res += uriComponent.charAt(pos); - } - } - else { - // encoding needed, we need to allocate a new string - if (res === undefined) { - res = uriComponent.substr(0, pos); - } - // check with default table first - var escaped = encodeTable[code]; - if (escaped !== undefined) { - // check if we are delaying native encode - if (nativeEncodePos !== -1) { - res += encodeURIComponent(uriComponent.substring(nativeEncodePos, pos)); - nativeEncodePos = -1; - } - // append escaped variant to result - res += escaped; - } - else if (nativeEncodePos === -1) { - // use native encode only when needed - nativeEncodePos = pos; - } - } - } - if (nativeEncodePos !== -1) { - res += encodeURIComponent(uriComponent.substring(nativeEncodePos)); - } - return res !== undefined ? res : uriComponent; -} -function encodeURIComponentMinimal(path) { - var res = undefined; - for (var pos = 0; pos < path.length; pos++) { - var code = path.charCodeAt(pos); - if (code === 35 /* Hash */ || code === 63 /* QuestionMark */) { - if (res === undefined) { - res = path.substr(0, pos); - } - res += encodeTable[code]; - } - else { - if (res !== undefined) { - res += path[pos]; - } - } - } - return res !== undefined ? res : path; -} -/** - * Compute `fsPath` for the given uri - */ -function _makeFsPath(uri) { - var value; - if (uri.authority && uri.path.length > 1 && uri.scheme === 'file') { - // unc path: file://shares/c$/far/boo - value = "//" + uri.authority + uri.path; - } - else if (uri.path.charCodeAt(0) === 47 /* Slash */ - && (uri.path.charCodeAt(1) >= 65 /* A */ && uri.path.charCodeAt(1) <= 90 /* Z */ || uri.path.charCodeAt(1) >= 97 /* a */ && uri.path.charCodeAt(1) <= 122 /* z */) - && uri.path.charCodeAt(2) === 58 /* Colon */) { - // windows drive letter: file:///c:/far/boo - value = uri.path[1].toLowerCase() + uri.path.substr(2); - } - else { - // other path - value = uri.path; - } - if (_platform_js__WEBPACK_IMPORTED_MODULE_0__["isWindows"]) { - value = value.replace(/\//g, '\\'); - } - return value; -} -/** - * Create the external version of a uri - */ -function _asFormatted(uri, skipEncoding) { - var encoder = !skipEncoding - ? encodeURIComponentFast - : encodeURIComponentMinimal; - var res = ''; - var scheme = uri.scheme, authority = uri.authority, path = uri.path, query = uri.query, fragment = uri.fragment; - if (scheme) { - res += scheme; - res += ':'; - } - if (authority || scheme === 'file') { - res += _slash; - res += _slash; - } - if (authority) { - var idx = authority.indexOf('@'); - if (idx !== -1) { - // @ - var userinfo = authority.substr(0, idx); - authority = authority.substr(idx + 1); - idx = userinfo.indexOf(':'); - if (idx === -1) { - res += encoder(userinfo, false); - } - else { - // :@ - res += encoder(userinfo.substr(0, idx), false); - res += ':'; - res += encoder(userinfo.substr(idx + 1), false); - } - res += '@'; - } - authority = authority.toLowerCase(); - idx = authority.indexOf(':'); - if (idx === -1) { - res += encoder(authority, false); - } - else { - // : - res += encoder(authority.substr(0, idx), false); - res += authority.substr(idx); - } - } - if (path) { - // lower-case windows drive letters in /C:/fff or C:/fff - if (path.length >= 3 && path.charCodeAt(0) === 47 /* Slash */ && path.charCodeAt(2) === 58 /* Colon */) { - var code = path.charCodeAt(1); - if (code >= 65 /* A */ && code <= 90 /* Z */) { - path = "/" + String.fromCharCode(code + 32) + ":" + path.substr(3); // "/c:".length === 3 - } - } - else if (path.length >= 2 && path.charCodeAt(1) === 58 /* Colon */) { - var code = path.charCodeAt(0); - if (code >= 65 /* A */ && code <= 90 /* Z */) { - path = String.fromCharCode(code + 32) + ":" + path.substr(2); // "/c:".length === 3 - } - } - // encode the rest of the path - res += encoder(path, true); - } - if (query) { - res += '?'; - res += encoder(query, false); - } - if (fragment) { - res += '#'; - res += !skipEncoding ? encodeURIComponentFast(fragment, false) : fragment; - } - return res; -} +/*--------------------------------------------------------------------------------------------- + * Copyright (c) Microsoft Corporation. All rights reserved. + * Licensed under the MIT License. See License.txt in the project root for license information. + *--------------------------------------------------------------------------------------------*/ +var __extends = (undefined && undefined.__extends) || (function () { + var extendStatics = function (d, b) { + extendStatics = Object.setPrototypeOf || + ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) || + function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; }; + return extendStatics(d, b); + }; + return function (d, b) { + extendStatics(d, b); + function __() { this.constructor = d; } + d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __()); + }; +})(); +var _a; + +var _schemePattern = /^\w[\w\d+.-]*$/; +var _singleSlashStart = /^\//; +var _doubleSlashStart = /^\/\//; +function _validateUri(ret, _strict) { + // scheme, must be set + if (!ret.scheme && _strict) { + throw new Error("[UriError]: Scheme is missing: {scheme: \"\", authority: \"" + ret.authority + "\", path: \"" + ret.path + "\", query: \"" + ret.query + "\", fragment: \"" + ret.fragment + "\"}"); + } + // scheme, https://tools.ietf.org/html/rfc3986#section-3.1 + // ALPHA *( ALPHA / DIGIT / "+" / "-" / "." ) + if (ret.scheme && !_schemePattern.test(ret.scheme)) { + throw new Error('[UriError]: Scheme contains illegal characters.'); + } + // path, http://tools.ietf.org/html/rfc3986#section-3.3 + // If a URI contains an authority component, then the path component + // must either be empty or begin with a slash ("/") character. If a URI + // does not contain an authority component, then the path cannot begin + // with two slash characters ("//"). + if (ret.path) { + if (ret.authority) { + if (!_singleSlashStart.test(ret.path)) { + throw new Error('[UriError]: If a URI contains an authority component, then the path component must either be empty or begin with a slash ("/") character'); + } + } + else { + if (_doubleSlashStart.test(ret.path)) { + throw new Error('[UriError]: If a URI does not contain an authority component, then the path cannot begin with two slash characters ("//")'); + } + } + } +} +// for a while we allowed uris *without* schemes and this is the migration +// for them, e.g. an uri without scheme and without strict-mode warns and falls +// back to the file-scheme. that should cause the least carnage and still be a +// clear warning +function _schemeFix(scheme, _strict) { + if (!scheme && !_strict) { + return 'file'; + } + return scheme; +} +// implements a bit of https://tools.ietf.org/html/rfc3986#section-5 +function _referenceResolution(scheme, path) { + // the slash-character is our 'default base' as we don't + // support constructing URIs relative to other URIs. This + // also means that we alter and potentially break paths. + // see https://tools.ietf.org/html/rfc3986#section-5.1.4 + switch (scheme) { + case 'https': + case 'http': + case 'file': + if (!path) { + path = _slash; + } + else if (path[0] !== _slash) { + path = _slash + path; + } + break; + } + return path; +} +var _empty = ''; +var _slash = '/'; +var _regexp = /^(([^:/?#]+?):)?(\/\/([^/?#]*))?([^?#]*)(\?([^#]*))?(#(.*))?/; +/** + * Uniform Resource Identifier (URI) http://tools.ietf.org/html/rfc3986. + * This class is a simple parser which creates the basic component parts + * (http://tools.ietf.org/html/rfc3986#section-3) with minimal validation + * and encoding. + * + * foo://example.com:8042/over/there?name=ferret#nose + * \_/ \______________/\_________/ \_________/ \__/ + * | | | | | + * scheme authority path query fragment + * | _____________________|__ + * / \ / \ + * urn:example:animal:ferret:nose + */ +var URI = /** @class */ (function () { + /** + * @internal + */ + function URI(schemeOrData, authority, path, query, fragment, _strict) { + if (_strict === void 0) { _strict = false; } + if (typeof schemeOrData === 'object') { + this.scheme = schemeOrData.scheme || _empty; + this.authority = schemeOrData.authority || _empty; + this.path = schemeOrData.path || _empty; + this.query = schemeOrData.query || _empty; + this.fragment = schemeOrData.fragment || _empty; + // no validation because it's this URI + // that creates uri components. + // _validateUri(this); + } + else { + this.scheme = _schemeFix(schemeOrData, _strict); + this.authority = authority || _empty; + this.path = _referenceResolution(this.scheme, path || _empty); + this.query = query || _empty; + this.fragment = fragment || _empty; + _validateUri(this, _strict); + } + } + URI.isUri = function (thing) { + if (thing instanceof URI) { + return true; + } + if (!thing) { + return false; + } + return typeof thing.authority === 'string' + && typeof thing.fragment === 'string' + && typeof thing.path === 'string' + && typeof thing.query === 'string' + && typeof thing.scheme === 'string' + && typeof thing.fsPath === 'function' + && typeof thing.with === 'function' + && typeof thing.toString === 'function'; + }; + Object.defineProperty(URI.prototype, "fsPath", { + // ---- filesystem path ----------------------- + /** + * Returns a string representing the corresponding file system path of this URI. + * Will handle UNC paths, normalizes windows drive letters to lower-case, and uses the + * platform specific path separator. + * + * * Will *not* validate the path for invalid characters and semantics. + * * Will *not* look at the scheme of this URI. + * * The result shall *not* be used for display purposes but for accessing a file on disk. + * + * + * The *difference* to `URI#path` is the use of the platform specific separator and the handling + * of UNC paths. See the below sample of a file-uri with an authority (UNC path). + * + * ```ts + const u = URI.parse('file://server/c$/folder/file.txt') + u.authority === 'server' + u.path === '/shares/c$/file.txt' + u.fsPath === '\\server\c$\folder\file.txt' + ``` + * + * Using `URI#path` to read a file (using fs-apis) would not be enough because parts of the path, + * namely the server name, would be missing. Therefore `URI#fsPath` exists - it's sugar to ease working + * with URIs that represent files on disk (`file` scheme). + */ + get: function () { + // if (this.scheme !== 'file') { + // console.warn(`[UriError] calling fsPath with scheme ${this.scheme}`); + // } + return _makeFsPath(this); + }, + enumerable: true, + configurable: true + }); + // ---- modify to new ------------------------- + URI.prototype.with = function (change) { + if (!change) { + return this; + } + var scheme = change.scheme, authority = change.authority, path = change.path, query = change.query, fragment = change.fragment; + if (scheme === undefined) { + scheme = this.scheme; + } + else if (scheme === null) { + scheme = _empty; + } + if (authority === undefined) { + authority = this.authority; + } + else if (authority === null) { + authority = _empty; + } + if (path === undefined) { + path = this.path; + } + else if (path === null) { + path = _empty; + } + if (query === undefined) { + query = this.query; + } + else if (query === null) { + query = _empty; + } + if (fragment === undefined) { + fragment = this.fragment; + } + else if (fragment === null) { + fragment = _empty; + } + if (scheme === this.scheme + && authority === this.authority + && path === this.path + && query === this.query + && fragment === this.fragment) { + return this; + } + return new _URI(scheme, authority, path, query, fragment); + }; + // ---- parse & validate ------------------------ + /** + * Creates a new URI from a string, e.g. `http://www.msft.com/some/path`, + * `file:///usr/home`, or `scheme:with/path`. + * + * @param value A string which represents an URI (see `URI#toString`). + */ + URI.parse = function (value, _strict) { + if (_strict === void 0) { _strict = false; } + var match = _regexp.exec(value); + if (!match) { + return new _URI(_empty, _empty, _empty, _empty, _empty); + } + return new _URI(match[2] || _empty, percentDecode(match[4] || _empty), percentDecode(match[5] || _empty), percentDecode(match[7] || _empty), percentDecode(match[9] || _empty), _strict); + }; + /** + * Creates a new URI from a file system path, e.g. `c:\my\files`, + * `/usr/home`, or `\\server\share\some\path`. + * + * The *difference* between `URI#parse` and `URI#file` is that the latter treats the argument + * as path, not as stringified-uri. E.g. `URI.file(path)` is **not the same as** + * `URI.parse('file://' + path)` because the path might contain characters that are + * interpreted (# and ?). See the following sample: + * ```ts + const good = URI.file('/coding/c#/project1'); + good.scheme === 'file'; + good.path === '/coding/c#/project1'; + good.fragment === ''; + const bad = URI.parse('file://' + '/coding/c#/project1'); + bad.scheme === 'file'; + bad.path === '/coding/c'; // path is now broken + bad.fragment === '/project1'; + ``` + * + * @param path A file system path (see `URI#fsPath`) + */ + URI.file = function (path) { + var authority = _empty; + // normalize to fwd-slashes on windows, + // on other systems bwd-slashes are valid + // filename character, eg /f\oo/ba\r.txt + if (_platform_js__WEBPACK_IMPORTED_MODULE_0__["isWindows"]) { + path = path.replace(/\\/g, _slash); + } + // check for authority as used in UNC shares + // or use the path as given + if (path[0] === _slash && path[1] === _slash) { + var idx = path.indexOf(_slash, 2); + if (idx === -1) { + authority = path.substring(2); + path = _slash; + } + else { + authority = path.substring(2, idx); + path = path.substring(idx) || _slash; + } + } + return new _URI('file', authority, path, _empty, _empty); + }; + URI.from = function (components) { + return new _URI(components.scheme, components.authority, components.path, components.query, components.fragment); + }; + // ---- printing/externalize --------------------------- + /** + * Creates a string representation for this URI. It's guaranteed that calling + * `URI.parse` with the result of this function creates an URI which is equal + * to this URI. + * + * * The result shall *not* be used for display purposes but for externalization or transport. + * * The result will be encoded using the percentage encoding and encoding happens mostly + * ignore the scheme-specific encoding rules. + * + * @param skipEncoding Do not encode the result, default is `false` + */ + URI.prototype.toString = function (skipEncoding) { + if (skipEncoding === void 0) { skipEncoding = false; } + return _asFormatted(this, skipEncoding); + }; + URI.prototype.toJSON = function () { + return this; + }; + URI.revive = function (data) { + if (!data) { + return data; + } + else if (data instanceof URI) { + return data; + } + else { + var result = new _URI(data); + result._formatted = data.external; + result._fsPath = data._sep === _pathSepMarker ? data.fsPath : null; + return result; + } + }; + return URI; +}()); + +var _pathSepMarker = _platform_js__WEBPACK_IMPORTED_MODULE_0__["isWindows"] ? 1 : undefined; +// tslint:disable-next-line:class-name +var _URI = /** @class */ (function (_super) { + __extends(_URI, _super); + function _URI() { + var _this = _super !== null && _super.apply(this, arguments) || this; + _this._formatted = null; + _this._fsPath = null; + return _this; + } + Object.defineProperty(_URI.prototype, "fsPath", { + get: function () { + if (!this._fsPath) { + this._fsPath = _makeFsPath(this); + } + return this._fsPath; + }, + enumerable: true, + configurable: true + }); + _URI.prototype.toString = function (skipEncoding) { + if (skipEncoding === void 0) { skipEncoding = false; } + if (!skipEncoding) { + if (!this._formatted) { + this._formatted = _asFormatted(this, false); + } + return this._formatted; + } + else { + // we don't cache that + return _asFormatted(this, true); + } + }; + _URI.prototype.toJSON = function () { + var res = { + $mid: 1 + }; + // cached state + if (this._fsPath) { + res.fsPath = this._fsPath; + res._sep = _pathSepMarker; + } + if (this._formatted) { + res.external = this._formatted; + } + // uri components + if (this.path) { + res.path = this.path; + } + if (this.scheme) { + res.scheme = this.scheme; + } + if (this.authority) { + res.authority = this.authority; + } + if (this.query) { + res.query = this.query; + } + if (this.fragment) { + res.fragment = this.fragment; + } + return res; + }; + return _URI; +}(URI)); +// reserved characters: https://tools.ietf.org/html/rfc3986#section-2.2 +var encodeTable = (_a = {}, + _a[58 /* Colon */] = '%3A', + _a[47 /* Slash */] = '%2F', + _a[63 /* QuestionMark */] = '%3F', + _a[35 /* Hash */] = '%23', + _a[91 /* OpenSquareBracket */] = '%5B', + _a[93 /* CloseSquareBracket */] = '%5D', + _a[64 /* AtSign */] = '%40', + _a[33 /* ExclamationMark */] = '%21', + _a[36 /* DollarSign */] = '%24', + _a[38 /* Ampersand */] = '%26', + _a[39 /* SingleQuote */] = '%27', + _a[40 /* OpenParen */] = '%28', + _a[41 /* CloseParen */] = '%29', + _a[42 /* Asterisk */] = '%2A', + _a[43 /* Plus */] = '%2B', + _a[44 /* Comma */] = '%2C', + _a[59 /* Semicolon */] = '%3B', + _a[61 /* Equals */] = '%3D', + _a[32 /* Space */] = '%20', + _a); +function encodeURIComponentFast(uriComponent, allowSlash) { + var res = undefined; + var nativeEncodePos = -1; + for (var pos = 0; pos < uriComponent.length; pos++) { + var code = uriComponent.charCodeAt(pos); + // unreserved characters: https://tools.ietf.org/html/rfc3986#section-2.3 + if ((code >= 97 /* a */ && code <= 122 /* z */) + || (code >= 65 /* A */ && code <= 90 /* Z */) + || (code >= 48 /* Digit0 */ && code <= 57 /* Digit9 */) + || code === 45 /* Dash */ + || code === 46 /* Period */ + || code === 95 /* Underline */ + || code === 126 /* Tilde */ + || (allowSlash && code === 47 /* Slash */)) { + // check if we are delaying native encode + if (nativeEncodePos !== -1) { + res += encodeURIComponent(uriComponent.substring(nativeEncodePos, pos)); + nativeEncodePos = -1; + } + // check if we write into a new string (by default we try to return the param) + if (res !== undefined) { + res += uriComponent.charAt(pos); + } + } + else { + // encoding needed, we need to allocate a new string + if (res === undefined) { + res = uriComponent.substr(0, pos); + } + // check with default table first + var escaped = encodeTable[code]; + if (escaped !== undefined) { + // check if we are delaying native encode + if (nativeEncodePos !== -1) { + res += encodeURIComponent(uriComponent.substring(nativeEncodePos, pos)); + nativeEncodePos = -1; + } + // append escaped variant to result + res += escaped; + } + else if (nativeEncodePos === -1) { + // use native encode only when needed + nativeEncodePos = pos; + } + } + } + if (nativeEncodePos !== -1) { + res += encodeURIComponent(uriComponent.substring(nativeEncodePos)); + } + return res !== undefined ? res : uriComponent; +} +function encodeURIComponentMinimal(path) { + var res = undefined; + for (var pos = 0; pos < path.length; pos++) { + var code = path.charCodeAt(pos); + if (code === 35 /* Hash */ || code === 63 /* QuestionMark */) { + if (res === undefined) { + res = path.substr(0, pos); + } + res += encodeTable[code]; + } + else { + if (res !== undefined) { + res += path[pos]; + } + } + } + return res !== undefined ? res : path; +} +/** + * Compute `fsPath` for the given uri + */ +function _makeFsPath(uri) { + var value; + if (uri.authority && uri.path.length > 1 && uri.scheme === 'file') { + // unc path: file://shares/c$/far/boo + value = "//" + uri.authority + uri.path; + } + else if (uri.path.charCodeAt(0) === 47 /* Slash */ + && (uri.path.charCodeAt(1) >= 65 /* A */ && uri.path.charCodeAt(1) <= 90 /* Z */ || uri.path.charCodeAt(1) >= 97 /* a */ && uri.path.charCodeAt(1) <= 122 /* z */) + && uri.path.charCodeAt(2) === 58 /* Colon */) { + // windows drive letter: file:///c:/far/boo + value = uri.path[1].toLowerCase() + uri.path.substr(2); + } + else { + // other path + value = uri.path; + } + if (_platform_js__WEBPACK_IMPORTED_MODULE_0__["isWindows"]) { + value = value.replace(/\//g, '\\'); + } + return value; +} +/** + * Create the external version of a uri + */ +function _asFormatted(uri, skipEncoding) { + var encoder = !skipEncoding + ? encodeURIComponentFast + : encodeURIComponentMinimal; + var res = ''; + var scheme = uri.scheme, authority = uri.authority, path = uri.path, query = uri.query, fragment = uri.fragment; + if (scheme) { + res += scheme; + res += ':'; + } + if (authority || scheme === 'file') { + res += _slash; + res += _slash; + } + if (authority) { + var idx = authority.indexOf('@'); + if (idx !== -1) { + // @ + var userinfo = authority.substr(0, idx); + authority = authority.substr(idx + 1); + idx = userinfo.indexOf(':'); + if (idx === -1) { + res += encoder(userinfo, false); + } + else { + // :@ + res += encoder(userinfo.substr(0, idx), false); + res += ':'; + res += encoder(userinfo.substr(idx + 1), false); + } + res += '@'; + } + authority = authority.toLowerCase(); + idx = authority.indexOf(':'); + if (idx === -1) { + res += encoder(authority, false); + } + else { + // : + res += encoder(authority.substr(0, idx), false); + res += authority.substr(idx); + } + } + if (path) { + // lower-case windows drive letters in /C:/fff or C:/fff + if (path.length >= 3 && path.charCodeAt(0) === 47 /* Slash */ && path.charCodeAt(2) === 58 /* Colon */) { + var code = path.charCodeAt(1); + if (code >= 65 /* A */ && code <= 90 /* Z */) { + path = "/" + String.fromCharCode(code + 32) + ":" + path.substr(3); // "/c:".length === 3 + } + } + else if (path.length >= 2 && path.charCodeAt(1) === 58 /* Colon */) { + var code = path.charCodeAt(0); + if (code >= 65 /* A */ && code <= 90 /* Z */) { + path = String.fromCharCode(code + 32) + ":" + path.substr(2); // "/c:".length === 3 + } + } + // encode the rest of the path + res += encoder(path, true); + } + if (query) { + res += '?'; + res += encoder(query, false); + } + if (fragment) { + res += '#'; + res += !skipEncoding ? encodeURIComponentFast(fragment, false) : fragment; + } + return res; +} +// --- decode +function decodeURIComponentGraceful(str) { + try { + return decodeURIComponent(str); + } + catch (_a) { + if (str.length > 3) { + return str.substr(0, 3) + decodeURIComponentGraceful(str.substr(3)); + } + else { + return str; + } + } +} +var _rEncodedAsHex = /(%[0-9A-Za-z][0-9A-Za-z])+/g; +function percentDecode(str) { + if (!str.match(_rEncodedAsHex)) { + return str; + } + return str.replace(_rEncodedAsHex, function (match) { return decodeURIComponentGraceful(match); }); +} /***/ }), @@ -4347,316 +5112,306 @@ __webpack_require__.r(__webpack_exports__); /* harmony import */ var _lifecycle_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../lifecycle.js */ "./node_modules/monaco-editor/esm/vs/base/common/lifecycle.js"); /* harmony import */ var _platform_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../platform.js */ "./node_modules/monaco-editor/esm/vs/base/common/platform.js"); /* harmony import */ var _types_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../types.js */ "./node_modules/monaco-editor/esm/vs/base/common/types.js"); -/*--------------------------------------------------------------------------------------------- - * Copyright (c) Microsoft Corporation. All rights reserved. - * Licensed under the MIT License. See License.txt in the project root for license information. - *--------------------------------------------------------------------------------------------*/ -var __extends = (undefined && undefined.__extends) || (function () { - var extendStatics = function (d, b) { - extendStatics = Object.setPrototypeOf || - ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) || - function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; }; - return extendStatics(d, b); - }; - return function (d, b) { - extendStatics(d, b); - function __() { this.constructor = d; } - d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __()); - }; -})(); - - - - -var INITIALIZE = '$initialize'; -var webWorkerWarningLogged = false; -function logOnceWebWorkerWarning(err) { - if (!_platform_js__WEBPACK_IMPORTED_MODULE_2__["isWeb"]) { - // running tests - return; - } - if (!webWorkerWarningLogged) { - webWorkerWarningLogged = true; - console.warn('Could not create web worker(s). Falling back to loading web worker code in main thread, which might cause UI freezes. Please see https://github.com/Microsoft/monaco-editor#faq'); - } - console.warn(err.message); -} -var SimpleWorkerProtocol = /** @class */ (function () { - function SimpleWorkerProtocol(handler) { - this._workerId = -1; - this._handler = handler; - this._lastSentReq = 0; - this._pendingReplies = Object.create(null); - } - SimpleWorkerProtocol.prototype.setWorkerId = function (workerId) { - this._workerId = workerId; - }; - SimpleWorkerProtocol.prototype.sendMessage = function (method, args) { - var _this = this; - var req = String(++this._lastSentReq); - return new Promise(function (resolve, reject) { - _this._pendingReplies[req] = { - resolve: resolve, - reject: reject - }; - _this._send({ - vsWorker: _this._workerId, - req: req, - method: method, - args: args - }); - }); - }; - SimpleWorkerProtocol.prototype.handleMessage = function (serializedMessage) { - var message; - try { - message = JSON.parse(serializedMessage); - } - catch (e) { - // nothing - return; - } - if (!message || !message.vsWorker) { - return; - } - if (this._workerId !== -1 && message.vsWorker !== this._workerId) { - return; - } - this._handleMessage(message); - }; - SimpleWorkerProtocol.prototype._handleMessage = function (msg) { - var _this = this; - if (msg.seq) { - var replyMessage = msg; - if (!this._pendingReplies[replyMessage.seq]) { - console.warn('Got reply to unknown seq'); - return; - } - var reply = this._pendingReplies[replyMessage.seq]; - delete this._pendingReplies[replyMessage.seq]; - if (replyMessage.err) { - var err = replyMessage.err; - if (replyMessage.err.$isError) { - err = new Error(); - err.name = replyMessage.err.name; - err.message = replyMessage.err.message; - err.stack = replyMessage.err.stack; - } - reply.reject(err); - return; - } - reply.resolve(replyMessage.res); - return; - } - var requestMessage = msg; - var req = requestMessage.req; - var result = this._handler.handleMessage(requestMessage.method, requestMessage.args); - result.then(function (r) { - _this._send({ - vsWorker: _this._workerId, - seq: req, - res: r, - err: undefined - }); - }, function (e) { - if (e.detail instanceof Error) { - // Loading errors have a detail property that points to the actual error - e.detail = Object(_errors_js__WEBPACK_IMPORTED_MODULE_0__["transformErrorForSerialization"])(e.detail); - } - _this._send({ - vsWorker: _this._workerId, - seq: req, - res: undefined, - err: Object(_errors_js__WEBPACK_IMPORTED_MODULE_0__["transformErrorForSerialization"])(e) - }); - }); - }; - SimpleWorkerProtocol.prototype._send = function (msg) { - var strMsg = JSON.stringify(msg); - // console.log('SENDING: ' + strMsg); - this._handler.sendMessage(strMsg); - }; - return SimpleWorkerProtocol; -}()); -/** - * Main thread side - */ -var SimpleWorkerClient = /** @class */ (function (_super) { - __extends(SimpleWorkerClient, _super); - function SimpleWorkerClient(workerFactory, moduleId) { - var _this = _super.call(this) || this; - var lazyProxyReject = null; - _this._worker = _this._register(workerFactory.create('vs/base/common/worker/simpleWorker', function (msg) { - _this._protocol.handleMessage(msg); - }, function (err) { - // in Firefox, web workers fail lazily :( - // we will reject the proxy - if (lazyProxyReject) { - lazyProxyReject(err); - } - })); - _this._protocol = new SimpleWorkerProtocol({ - sendMessage: function (msg) { - _this._worker.postMessage(msg); - }, - handleMessage: function (method, args) { - // Intentionally not supporting worker -> main requests - return Promise.resolve(null); - } - }); - _this._protocol.setWorkerId(_this._worker.getId()); - // Gather loader configuration - var loaderConfiguration = null; - if (typeof self.require !== 'undefined' && typeof self.require.getConfig === 'function') { - // Get the configuration from the Monaco AMD Loader - loaderConfiguration = self.require.getConfig(); - } - else if (typeof self.requirejs !== 'undefined') { - // Get the configuration from requirejs - loaderConfiguration = self.requirejs.s.contexts._.config; - } - // Send initialize message - _this._onModuleLoaded = _this._protocol.sendMessage(INITIALIZE, [ - _this._worker.getId(), - moduleId, - loaderConfiguration - ]); - _this._lazyProxy = new Promise(function (resolve, reject) { - lazyProxyReject = reject; - _this._onModuleLoaded.then(function (availableMethods) { - var proxy = {}; - for (var _i = 0, availableMethods_1 = availableMethods; _i < availableMethods_1.length; _i++) { - var methodName = availableMethods_1[_i]; - proxy[methodName] = createProxyMethod(methodName, proxyMethodRequest); - } - resolve(proxy); - }, function (e) { - reject(e); - _this._onError('Worker failed to load ' + moduleId, e); - }); - }); - // Create proxy to loaded code - var proxyMethodRequest = function (method, args) { - return _this._request(method, args); - }; - var createProxyMethod = function (method, proxyMethodRequest) { - return function () { - var args = Array.prototype.slice.call(arguments, 0); - return proxyMethodRequest(method, args); - }; - }; - return _this; - } - SimpleWorkerClient.prototype.getProxyObject = function () { - return this._lazyProxy; - }; - SimpleWorkerClient.prototype._request = function (method, args) { - var _this = this; - return new Promise(function (resolve, reject) { - _this._onModuleLoaded.then(function () { - _this._protocol.sendMessage(method, args).then(resolve, reject); - }, reject); - }); - }; - SimpleWorkerClient.prototype._onError = function (message, error) { - console.error(message); - console.info(error); - }; - return SimpleWorkerClient; -}(_lifecycle_js__WEBPACK_IMPORTED_MODULE_1__["Disposable"])); - -/** - * Worker side - */ -var SimpleWorkerServer = /** @class */ (function () { - function SimpleWorkerServer(postSerializedMessage, requestHandler) { - var _this = this; - this._requestHandler = requestHandler; - this._protocol = new SimpleWorkerProtocol({ - sendMessage: function (msg) { - postSerializedMessage(msg); - }, - handleMessage: function (method, args) { return _this._handleMessage(method, args); } - }); - } - SimpleWorkerServer.prototype.onmessage = function (msg) { - this._protocol.handleMessage(msg); - }; - SimpleWorkerServer.prototype._handleMessage = function (method, args) { - if (method === INITIALIZE) { - return this.initialize(args[0], args[1], args[2]); - } - if (!this._requestHandler || typeof this._requestHandler[method] !== 'function') { - return Promise.reject(new Error('Missing requestHandler or method: ' + method)); - } - try { - return Promise.resolve(this._requestHandler[method].apply(this._requestHandler, args)); - } - catch (e) { - return Promise.reject(e); - } - }; - SimpleWorkerServer.prototype.initialize = function (workerId, moduleId, loaderConfig) { - var _this = this; - this._protocol.setWorkerId(workerId); - if (this._requestHandler) { - // static request handler - var methods = []; - for (var _i = 0, _a = Object(_types_js__WEBPACK_IMPORTED_MODULE_3__["getAllPropertyNames"])(this._requestHandler); _i < _a.length; _i++) { - var prop = _a[_i]; - if (typeof this._requestHandler[prop] === 'function') { - methods.push(prop); - } - } - return Promise.resolve(methods); - } - if (loaderConfig) { - // Remove 'baseUrl', handling it is beyond scope for now - if (typeof loaderConfig.baseUrl !== 'undefined') { - delete loaderConfig['baseUrl']; - } - if (typeof loaderConfig.paths !== 'undefined') { - if (typeof loaderConfig.paths.vs !== 'undefined') { - delete loaderConfig.paths['vs']; - } - } - // Since this is in a web worker, enable catching errors - loaderConfig.catchError = true; - self.require.config(loaderConfig); - } - return new Promise(function (resolve, reject) { - // Use the global require to be sure to get the global config - self.require([moduleId], function () { - var result = []; - for (var _i = 0; _i < arguments.length; _i++) { - result[_i] = arguments[_i]; - } - var handlerModule = result[0]; - _this._requestHandler = handlerModule.create(); - if (!_this._requestHandler) { - reject(new Error("No RequestHandler!")); - return; - } - var methods = []; - for (var _a = 0, _b = Object(_types_js__WEBPACK_IMPORTED_MODULE_3__["getAllPropertyNames"])(_this._requestHandler); _a < _b.length; _a++) { - var prop = _b[_a]; - if (typeof _this._requestHandler[prop] === 'function') { - methods.push(prop); - } - } - resolve(methods); - }, reject); - }); - }; - return SimpleWorkerServer; -}()); - -/** - * Called on the worker side - */ -function create(postMessage) { - return new SimpleWorkerServer(postMessage, null); -} +/*--------------------------------------------------------------------------------------------- + * Copyright (c) Microsoft Corporation. All rights reserved. + * Licensed under the MIT License. See License.txt in the project root for license information. + *--------------------------------------------------------------------------------------------*/ +var __extends = (undefined && undefined.__extends) || (function () { + var extendStatics = function (d, b) { + extendStatics = Object.setPrototypeOf || + ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) || + function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; }; + return extendStatics(d, b); + }; + return function (d, b) { + extendStatics(d, b); + function __() { this.constructor = d; } + d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __()); + }; +})(); + + + + +var INITIALIZE = '$initialize'; +var webWorkerWarningLogged = false; +function logOnceWebWorkerWarning(err) { + if (!_platform_js__WEBPACK_IMPORTED_MODULE_2__["isWeb"]) { + // running tests + return; + } + if (!webWorkerWarningLogged) { + webWorkerWarningLogged = true; + console.warn('Could not create web worker(s). Falling back to loading web worker code in main thread, which might cause UI freezes. Please see https://github.com/Microsoft/monaco-editor#faq'); + } + console.warn(err.message); +} +var SimpleWorkerProtocol = /** @class */ (function () { + function SimpleWorkerProtocol(handler) { + this._workerId = -1; + this._handler = handler; + this._lastSentReq = 0; + this._pendingReplies = Object.create(null); + } + SimpleWorkerProtocol.prototype.setWorkerId = function (workerId) { + this._workerId = workerId; + }; + SimpleWorkerProtocol.prototype.sendMessage = function (method, args) { + var _this = this; + var req = String(++this._lastSentReq); + return new Promise(function (resolve, reject) { + _this._pendingReplies[req] = { + resolve: resolve, + reject: reject + }; + _this._send({ + vsWorker: _this._workerId, + req: req, + method: method, + args: args + }); + }); + }; + SimpleWorkerProtocol.prototype.handleMessage = function (message) { + if (!message || !message.vsWorker) { + return; + } + if (this._workerId !== -1 && message.vsWorker !== this._workerId) { + return; + } + this._handleMessage(message); + }; + SimpleWorkerProtocol.prototype._handleMessage = function (msg) { + var _this = this; + if (msg.seq) { + var replyMessage = msg; + if (!this._pendingReplies[replyMessage.seq]) { + console.warn('Got reply to unknown seq'); + return; + } + var reply = this._pendingReplies[replyMessage.seq]; + delete this._pendingReplies[replyMessage.seq]; + if (replyMessage.err) { + var err = replyMessage.err; + if (replyMessage.err.$isError) { + err = new Error(); + err.name = replyMessage.err.name; + err.message = replyMessage.err.message; + err.stack = replyMessage.err.stack; + } + reply.reject(err); + return; + } + reply.resolve(replyMessage.res); + return; + } + var requestMessage = msg; + var req = requestMessage.req; + var result = this._handler.handleMessage(requestMessage.method, requestMessage.args); + result.then(function (r) { + _this._send({ + vsWorker: _this._workerId, + seq: req, + res: r, + err: undefined + }); + }, function (e) { + if (e.detail instanceof Error) { + // Loading errors have a detail property that points to the actual error + e.detail = Object(_errors_js__WEBPACK_IMPORTED_MODULE_0__["transformErrorForSerialization"])(e.detail); + } + _this._send({ + vsWorker: _this._workerId, + seq: req, + res: undefined, + err: Object(_errors_js__WEBPACK_IMPORTED_MODULE_0__["transformErrorForSerialization"])(e) + }); + }); + }; + SimpleWorkerProtocol.prototype._send = function (msg) { + var transfer = []; + if (msg.req) { + var m = msg; + for (var i = 0; i < m.args.length; i++) { + if (m.args[i] instanceof ArrayBuffer) { + transfer.push(m.args[i]); + } + } + } + else { + var m = msg; + if (m.res instanceof ArrayBuffer) { + transfer.push(m.res); + } + } + this._handler.sendMessage(msg, transfer); + }; + return SimpleWorkerProtocol; +}()); +/** + * Main thread side + */ +var SimpleWorkerClient = /** @class */ (function (_super) { + __extends(SimpleWorkerClient, _super); + function SimpleWorkerClient(workerFactory, moduleId, host) { + var _this = _super.call(this) || this; + var lazyProxyReject = null; + _this._worker = _this._register(workerFactory.create('vs/base/common/worker/simpleWorker', function (msg) { + _this._protocol.handleMessage(msg); + }, function (err) { + // in Firefox, web workers fail lazily :( + // we will reject the proxy + if (lazyProxyReject) { + lazyProxyReject(err); + } + })); + _this._protocol = new SimpleWorkerProtocol({ + sendMessage: function (msg, transfer) { + _this._worker.postMessage(msg, transfer); + }, + handleMessage: function (method, args) { + if (typeof host[method] !== 'function') { + return Promise.reject(new Error('Missing method ' + method + ' on main thread host.')); + } + try { + return Promise.resolve(host[method].apply(host, args)); + } + catch (e) { + return Promise.reject(e); + } + } + }); + _this._protocol.setWorkerId(_this._worker.getId()); + // Gather loader configuration + var loaderConfiguration = null; + if (typeof self.require !== 'undefined' && typeof self.require.getConfig === 'function') { + // Get the configuration from the Monaco AMD Loader + loaderConfiguration = self.require.getConfig(); + } + else if (typeof self.requirejs !== 'undefined') { + // Get the configuration from requirejs + loaderConfiguration = self.requirejs.s.contexts._.config; + } + var hostMethods = _types_js__WEBPACK_IMPORTED_MODULE_3__["getAllMethodNames"](host); + // Send initialize message + _this._onModuleLoaded = _this._protocol.sendMessage(INITIALIZE, [ + _this._worker.getId(), + JSON.parse(JSON.stringify(loaderConfiguration)), + moduleId, + hostMethods, + ]); + // Create proxy to loaded code + var proxyMethodRequest = function (method, args) { + return _this._request(method, args); + }; + _this._lazyProxy = new Promise(function (resolve, reject) { + lazyProxyReject = reject; + _this._onModuleLoaded.then(function (availableMethods) { + resolve(_types_js__WEBPACK_IMPORTED_MODULE_3__["createProxyObject"](availableMethods, proxyMethodRequest)); + }, function (e) { + reject(e); + _this._onError('Worker failed to load ' + moduleId, e); + }); + }); + return _this; + } + SimpleWorkerClient.prototype.getProxyObject = function () { + return this._lazyProxy; + }; + SimpleWorkerClient.prototype._request = function (method, args) { + var _this = this; + return new Promise(function (resolve, reject) { + _this._onModuleLoaded.then(function () { + _this._protocol.sendMessage(method, args).then(resolve, reject); + }, reject); + }); + }; + SimpleWorkerClient.prototype._onError = function (message, error) { + console.error(message); + console.info(error); + }; + return SimpleWorkerClient; +}(_lifecycle_js__WEBPACK_IMPORTED_MODULE_1__["Disposable"])); + +/** + * Worker side + */ +var SimpleWorkerServer = /** @class */ (function () { + function SimpleWorkerServer(postMessage, requestHandlerFactory) { + var _this = this; + this._requestHandlerFactory = requestHandlerFactory; + this._requestHandler = null; + this._protocol = new SimpleWorkerProtocol({ + sendMessage: function (msg, transfer) { + postMessage(msg, transfer); + }, + handleMessage: function (method, args) { return _this._handleMessage(method, args); } + }); + } + SimpleWorkerServer.prototype.onmessage = function (msg) { + this._protocol.handleMessage(msg); + }; + SimpleWorkerServer.prototype._handleMessage = function (method, args) { + if (method === INITIALIZE) { + return this.initialize(args[0], args[1], args[2], args[3]); + } + if (!this._requestHandler || typeof this._requestHandler[method] !== 'function') { + return Promise.reject(new Error('Missing requestHandler or method: ' + method)); + } + try { + return Promise.resolve(this._requestHandler[method].apply(this._requestHandler, args)); + } + catch (e) { + return Promise.reject(e); + } + }; + SimpleWorkerServer.prototype.initialize = function (workerId, loaderConfig, moduleId, hostMethods) { + var _this = this; + this._protocol.setWorkerId(workerId); + var proxyMethodRequest = function (method, args) { + return _this._protocol.sendMessage(method, args); + }; + var hostProxy = _types_js__WEBPACK_IMPORTED_MODULE_3__["createProxyObject"](hostMethods, proxyMethodRequest); + if (this._requestHandlerFactory) { + // static request handler + this._requestHandler = this._requestHandlerFactory(hostProxy); + return Promise.resolve(_types_js__WEBPACK_IMPORTED_MODULE_3__["getAllMethodNames"](this._requestHandler)); + } + if (loaderConfig) { + // Remove 'baseUrl', handling it is beyond scope for now + if (typeof loaderConfig.baseUrl !== 'undefined') { + delete loaderConfig['baseUrl']; + } + if (typeof loaderConfig.paths !== 'undefined') { + if (typeof loaderConfig.paths.vs !== 'undefined') { + delete loaderConfig.paths['vs']; + } + } + // Since this is in a web worker, enable catching errors + loaderConfig.catchError = true; + self.require.config(loaderConfig); + } + return new Promise(function (resolve, reject) { + // Use the global require to be sure to get the global config + self.require([moduleId], function (module) { + _this._requestHandler = module.create(hostProxy); + if (!_this._requestHandler) { + reject(new Error("No RequestHandler!")); + return; + } + resolve(_types_js__WEBPACK_IMPORTED_MODULE_3__["getAllMethodNames"](_this._requestHandler)); + }, reject); + }); + }; + return SimpleWorkerServer; +}()); + +/** + * Called on the worker side + */ +function create(postMessage) { + return new SimpleWorkerServer(postMessage, null); +} /***/ }), @@ -4672,62 +5427,62 @@ function create(postMessage) { __webpack_require__.r(__webpack_exports__); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "CharacterClassifier", function() { return CharacterClassifier; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "CharacterSet", function() { return CharacterSet; }); -/* harmony import */ var _uint_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./uint.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/uint.js"); -/*--------------------------------------------------------------------------------------------- - * Copyright (c) Microsoft Corporation. All rights reserved. - * Licensed under the MIT License. See License.txt in the project root for license information. - *--------------------------------------------------------------------------------------------*/ - -/** - * A fast character classifier that uses a compact array for ASCII values. - */ -var CharacterClassifier = /** @class */ (function () { - function CharacterClassifier(_defaultValue) { - var defaultValue = Object(_uint_js__WEBPACK_IMPORTED_MODULE_0__["toUint8"])(_defaultValue); - this._defaultValue = defaultValue; - this._asciiMap = CharacterClassifier._createAsciiMap(defaultValue); - this._map = new Map(); - } - CharacterClassifier._createAsciiMap = function (defaultValue) { - var asciiMap = new Uint8Array(256); - for (var i = 0; i < 256; i++) { - asciiMap[i] = defaultValue; - } - return asciiMap; - }; - CharacterClassifier.prototype.set = function (charCode, _value) { - var value = Object(_uint_js__WEBPACK_IMPORTED_MODULE_0__["toUint8"])(_value); - if (charCode >= 0 && charCode < 256) { - this._asciiMap[charCode] = value; - } - else { - this._map.set(charCode, value); - } - }; - CharacterClassifier.prototype.get = function (charCode) { - if (charCode >= 0 && charCode < 256) { - return this._asciiMap[charCode]; - } - else { - return (this._map.get(charCode) || this._defaultValue); - } - }; - return CharacterClassifier; -}()); - -var CharacterSet = /** @class */ (function () { - function CharacterSet() { - this._actual = new CharacterClassifier(0 /* False */); - } - CharacterSet.prototype.add = function (charCode) { - this._actual.set(charCode, 1 /* True */); - }; - CharacterSet.prototype.has = function (charCode) { - return (this._actual.get(charCode) === 1 /* True */); - }; - return CharacterSet; -}()); - +/* harmony import */ var _base_common_uint_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../../../base/common/uint.js */ "./node_modules/monaco-editor/esm/vs/base/common/uint.js"); +/*--------------------------------------------------------------------------------------------- + * Copyright (c) Microsoft Corporation. All rights reserved. + * Licensed under the MIT License. See License.txt in the project root for license information. + *--------------------------------------------------------------------------------------------*/ + +/** + * A fast character classifier that uses a compact array for ASCII values. + */ +var CharacterClassifier = /** @class */ (function () { + function CharacterClassifier(_defaultValue) { + var defaultValue = Object(_base_common_uint_js__WEBPACK_IMPORTED_MODULE_0__["toUint8"])(_defaultValue); + this._defaultValue = defaultValue; + this._asciiMap = CharacterClassifier._createAsciiMap(defaultValue); + this._map = new Map(); + } + CharacterClassifier._createAsciiMap = function (defaultValue) { + var asciiMap = new Uint8Array(256); + for (var i = 0; i < 256; i++) { + asciiMap[i] = defaultValue; + } + return asciiMap; + }; + CharacterClassifier.prototype.set = function (charCode, _value) { + var value = Object(_base_common_uint_js__WEBPACK_IMPORTED_MODULE_0__["toUint8"])(_value); + if (charCode >= 0 && charCode < 256) { + this._asciiMap[charCode] = value; + } + else { + this._map.set(charCode, value); + } + }; + CharacterClassifier.prototype.get = function (charCode) { + if (charCode >= 0 && charCode < 256) { + return this._asciiMap[charCode]; + } + else { + return (this._map.get(charCode) || this._defaultValue); + } + }; + return CharacterClassifier; +}()); + +var CharacterSet = /** @class */ (function () { + function CharacterSet() { + this._actual = new CharacterClassifier(0 /* False */); + } + CharacterSet.prototype.add = function (charCode) { + this._actual.set(charCode, 1 /* True */); + }; + CharacterSet.prototype.has = function (charCode) { + return (this._actual.get(charCode) === 1 /* True */); + }; + return CharacterSet; +}()); + /***/ }), @@ -4742,146 +5497,146 @@ var CharacterSet = /** @class */ (function () { "use strict"; __webpack_require__.r(__webpack_exports__); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "Position", function() { return Position; }); -/*--------------------------------------------------------------------------------------------- - * Copyright (c) Microsoft Corporation. All rights reserved. - * Licensed under the MIT License. See License.txt in the project root for license information. - *--------------------------------------------------------------------------------------------*/ -/** - * A position in the editor. - */ -var Position = /** @class */ (function () { - function Position(lineNumber, column) { - this.lineNumber = lineNumber; - this.column = column; - } - /** - * Create a new postion from this position. - * - * @param newLineNumber new line number - * @param newColumn new column - */ - Position.prototype.with = function (newLineNumber, newColumn) { - if (newLineNumber === void 0) { newLineNumber = this.lineNumber; } - if (newColumn === void 0) { newColumn = this.column; } - if (newLineNumber === this.lineNumber && newColumn === this.column) { - return this; - } - else { - return new Position(newLineNumber, newColumn); - } - }; - /** - * Derive a new position from this position. - * - * @param deltaLineNumber line number delta - * @param deltaColumn column delta - */ - Position.prototype.delta = function (deltaLineNumber, deltaColumn) { - if (deltaLineNumber === void 0) { deltaLineNumber = 0; } - if (deltaColumn === void 0) { deltaColumn = 0; } - return this.with(this.lineNumber + deltaLineNumber, this.column + deltaColumn); - }; - /** - * Test if this position equals other position - */ - Position.prototype.equals = function (other) { - return Position.equals(this, other); - }; - /** - * Test if position `a` equals position `b` - */ - Position.equals = function (a, b) { - if (!a && !b) { - return true; - } - return (!!a && - !!b && - a.lineNumber === b.lineNumber && - a.column === b.column); - }; - /** - * Test if this position is before other position. - * If the two positions are equal, the result will be false. - */ - Position.prototype.isBefore = function (other) { - return Position.isBefore(this, other); - }; - /** - * Test if position `a` is before position `b`. - * If the two positions are equal, the result will be false. - */ - Position.isBefore = function (a, b) { - if (a.lineNumber < b.lineNumber) { - return true; - } - if (b.lineNumber < a.lineNumber) { - return false; - } - return a.column < b.column; - }; - /** - * Test if this position is before other position. - * If the two positions are equal, the result will be true. - */ - Position.prototype.isBeforeOrEqual = function (other) { - return Position.isBeforeOrEqual(this, other); - }; - /** - * Test if position `a` is before position `b`. - * If the two positions are equal, the result will be true. - */ - Position.isBeforeOrEqual = function (a, b) { - if (a.lineNumber < b.lineNumber) { - return true; - } - if (b.lineNumber < a.lineNumber) { - return false; - } - return a.column <= b.column; - }; - /** - * A function that compares positions, useful for sorting - */ - Position.compare = function (a, b) { - var aLineNumber = a.lineNumber | 0; - var bLineNumber = b.lineNumber | 0; - if (aLineNumber === bLineNumber) { - var aColumn = a.column | 0; - var bColumn = b.column | 0; - return aColumn - bColumn; - } - return aLineNumber - bLineNumber; - }; - /** - * Clone this position. - */ - Position.prototype.clone = function () { - return new Position(this.lineNumber, this.column); - }; - /** - * Convert to a human-readable representation. - */ - Position.prototype.toString = function () { - return '(' + this.lineNumber + ',' + this.column + ')'; - }; - // --- - /** - * Create a `Position` from an `IPosition`. - */ - Position.lift = function (pos) { - return new Position(pos.lineNumber, pos.column); - }; - /** - * Test if `obj` is an `IPosition`. - */ - Position.isIPosition = function (obj) { - return (obj - && (typeof obj.lineNumber === 'number') - && (typeof obj.column === 'number')); - }; - return Position; -}()); - +/*--------------------------------------------------------------------------------------------- + * Copyright (c) Microsoft Corporation. All rights reserved. + * Licensed under the MIT License. See License.txt in the project root for license information. + *--------------------------------------------------------------------------------------------*/ +/** + * A position in the editor. + */ +var Position = /** @class */ (function () { + function Position(lineNumber, column) { + this.lineNumber = lineNumber; + this.column = column; + } + /** + * Create a new position from this position. + * + * @param newLineNumber new line number + * @param newColumn new column + */ + Position.prototype.with = function (newLineNumber, newColumn) { + if (newLineNumber === void 0) { newLineNumber = this.lineNumber; } + if (newColumn === void 0) { newColumn = this.column; } + if (newLineNumber === this.lineNumber && newColumn === this.column) { + return this; + } + else { + return new Position(newLineNumber, newColumn); + } + }; + /** + * Derive a new position from this position. + * + * @param deltaLineNumber line number delta + * @param deltaColumn column delta + */ + Position.prototype.delta = function (deltaLineNumber, deltaColumn) { + if (deltaLineNumber === void 0) { deltaLineNumber = 0; } + if (deltaColumn === void 0) { deltaColumn = 0; } + return this.with(this.lineNumber + deltaLineNumber, this.column + deltaColumn); + }; + /** + * Test if this position equals other position + */ + Position.prototype.equals = function (other) { + return Position.equals(this, other); + }; + /** + * Test if position `a` equals position `b` + */ + Position.equals = function (a, b) { + if (!a && !b) { + return true; + } + return (!!a && + !!b && + a.lineNumber === b.lineNumber && + a.column === b.column); + }; + /** + * Test if this position is before other position. + * If the two positions are equal, the result will be false. + */ + Position.prototype.isBefore = function (other) { + return Position.isBefore(this, other); + }; + /** + * Test if position `a` is before position `b`. + * If the two positions are equal, the result will be false. + */ + Position.isBefore = function (a, b) { + if (a.lineNumber < b.lineNumber) { + return true; + } + if (b.lineNumber < a.lineNumber) { + return false; + } + return a.column < b.column; + }; + /** + * Test if this position is before other position. + * If the two positions are equal, the result will be true. + */ + Position.prototype.isBeforeOrEqual = function (other) { + return Position.isBeforeOrEqual(this, other); + }; + /** + * Test if position `a` is before position `b`. + * If the two positions are equal, the result will be true. + */ + Position.isBeforeOrEqual = function (a, b) { + if (a.lineNumber < b.lineNumber) { + return true; + } + if (b.lineNumber < a.lineNumber) { + return false; + } + return a.column <= b.column; + }; + /** + * A function that compares positions, useful for sorting + */ + Position.compare = function (a, b) { + var aLineNumber = a.lineNumber | 0; + var bLineNumber = b.lineNumber | 0; + if (aLineNumber === bLineNumber) { + var aColumn = a.column | 0; + var bColumn = b.column | 0; + return aColumn - bColumn; + } + return aLineNumber - bLineNumber; + }; + /** + * Clone this position. + */ + Position.prototype.clone = function () { + return new Position(this.lineNumber, this.column); + }; + /** + * Convert to a human-readable representation. + */ + Position.prototype.toString = function () { + return '(' + this.lineNumber + ',' + this.column + ')'; + }; + // --- + /** + * Create a `Position` from an `IPosition`. + */ + Position.lift = function (pos) { + return new Position(pos.lineNumber, pos.column); + }; + /** + * Test if `obj` is an `IPosition`. + */ + Position.isIPosition = function (obj) { + return (obj + && (typeof obj.lineNumber === 'number') + && (typeof obj.column === 'number')); + }; + return Position; +}()); + /***/ }), @@ -4897,333 +5652,357 @@ var Position = /** @class */ (function () { __webpack_require__.r(__webpack_exports__); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "Range", function() { return Range; }); /* harmony import */ var _position_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./position.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/position.js"); -/*--------------------------------------------------------------------------------------------- - * Copyright (c) Microsoft Corporation. All rights reserved. - * Licensed under the MIT License. See License.txt in the project root for license information. - *--------------------------------------------------------------------------------------------*/ - -/** - * A range in the editor. (startLineNumber,startColumn) is <= (endLineNumber,endColumn) - */ -var Range = /** @class */ (function () { - function Range(startLineNumber, startColumn, endLineNumber, endColumn) { - if ((startLineNumber > endLineNumber) || (startLineNumber === endLineNumber && startColumn > endColumn)) { - this.startLineNumber = endLineNumber; - this.startColumn = endColumn; - this.endLineNumber = startLineNumber; - this.endColumn = startColumn; - } - else { - this.startLineNumber = startLineNumber; - this.startColumn = startColumn; - this.endLineNumber = endLineNumber; - this.endColumn = endColumn; - } - } - /** - * Test if this range is empty. - */ - Range.prototype.isEmpty = function () { - return Range.isEmpty(this); - }; - /** - * Test if `range` is empty. - */ - Range.isEmpty = function (range) { - return (range.startLineNumber === range.endLineNumber && range.startColumn === range.endColumn); - }; - /** - * Test if position is in this range. If the position is at the edges, will return true. - */ - Range.prototype.containsPosition = function (position) { - return Range.containsPosition(this, position); - }; - /** - * Test if `position` is in `range`. If the position is at the edges, will return true. - */ - Range.containsPosition = function (range, position) { - if (position.lineNumber < range.startLineNumber || position.lineNumber > range.endLineNumber) { - return false; - } - if (position.lineNumber === range.startLineNumber && position.column < range.startColumn) { - return false; - } - if (position.lineNumber === range.endLineNumber && position.column > range.endColumn) { - return false; - } - return true; - }; - /** - * Test if range is in this range. If the range is equal to this range, will return true. - */ - Range.prototype.containsRange = function (range) { - return Range.containsRange(this, range); - }; - /** - * Test if `otherRange` is in `range`. If the ranges are equal, will return true. - */ - Range.containsRange = function (range, otherRange) { - if (otherRange.startLineNumber < range.startLineNumber || otherRange.endLineNumber < range.startLineNumber) { - return false; - } - if (otherRange.startLineNumber > range.endLineNumber || otherRange.endLineNumber > range.endLineNumber) { - return false; - } - if (otherRange.startLineNumber === range.startLineNumber && otherRange.startColumn < range.startColumn) { - return false; - } - if (otherRange.endLineNumber === range.endLineNumber && otherRange.endColumn > range.endColumn) { - return false; - } - return true; - }; - /** - * A reunion of the two ranges. - * The smallest position will be used as the start point, and the largest one as the end point. - */ - Range.prototype.plusRange = function (range) { - return Range.plusRange(this, range); - }; - /** - * A reunion of the two ranges. - * The smallest position will be used as the start point, and the largest one as the end point. - */ - Range.plusRange = function (a, b) { - var startLineNumber; - var startColumn; - var endLineNumber; - var endColumn; - if (b.startLineNumber < a.startLineNumber) { - startLineNumber = b.startLineNumber; - startColumn = b.startColumn; - } - else if (b.startLineNumber === a.startLineNumber) { - startLineNumber = b.startLineNumber; - startColumn = Math.min(b.startColumn, a.startColumn); - } - else { - startLineNumber = a.startLineNumber; - startColumn = a.startColumn; - } - if (b.endLineNumber > a.endLineNumber) { - endLineNumber = b.endLineNumber; - endColumn = b.endColumn; - } - else if (b.endLineNumber === a.endLineNumber) { - endLineNumber = b.endLineNumber; - endColumn = Math.max(b.endColumn, a.endColumn); - } - else { - endLineNumber = a.endLineNumber; - endColumn = a.endColumn; - } - return new Range(startLineNumber, startColumn, endLineNumber, endColumn); - }; - /** - * A intersection of the two ranges. - */ - Range.prototype.intersectRanges = function (range) { - return Range.intersectRanges(this, range); - }; - /** - * A intersection of the two ranges. - */ - Range.intersectRanges = function (a, b) { - var resultStartLineNumber = a.startLineNumber; - var resultStartColumn = a.startColumn; - var resultEndLineNumber = a.endLineNumber; - var resultEndColumn = a.endColumn; - var otherStartLineNumber = b.startLineNumber; - var otherStartColumn = b.startColumn; - var otherEndLineNumber = b.endLineNumber; - var otherEndColumn = b.endColumn; - if (resultStartLineNumber < otherStartLineNumber) { - resultStartLineNumber = otherStartLineNumber; - resultStartColumn = otherStartColumn; - } - else if (resultStartLineNumber === otherStartLineNumber) { - resultStartColumn = Math.max(resultStartColumn, otherStartColumn); - } - if (resultEndLineNumber > otherEndLineNumber) { - resultEndLineNumber = otherEndLineNumber; - resultEndColumn = otherEndColumn; - } - else if (resultEndLineNumber === otherEndLineNumber) { - resultEndColumn = Math.min(resultEndColumn, otherEndColumn); - } - // Check if selection is now empty - if (resultStartLineNumber > resultEndLineNumber) { - return null; - } - if (resultStartLineNumber === resultEndLineNumber && resultStartColumn > resultEndColumn) { - return null; - } - return new Range(resultStartLineNumber, resultStartColumn, resultEndLineNumber, resultEndColumn); - }; - /** - * Test if this range equals other. - */ - Range.prototype.equalsRange = function (other) { - return Range.equalsRange(this, other); - }; - /** - * Test if range `a` equals `b`. - */ - Range.equalsRange = function (a, b) { - return (!!a && - !!b && - a.startLineNumber === b.startLineNumber && - a.startColumn === b.startColumn && - a.endLineNumber === b.endLineNumber && - a.endColumn === b.endColumn); - }; - /** - * Return the end position (which will be after or equal to the start position) - */ - Range.prototype.getEndPosition = function () { - return new _position_js__WEBPACK_IMPORTED_MODULE_0__["Position"](this.endLineNumber, this.endColumn); - }; - /** - * Return the start position (which will be before or equal to the end position) - */ - Range.prototype.getStartPosition = function () { - return new _position_js__WEBPACK_IMPORTED_MODULE_0__["Position"](this.startLineNumber, this.startColumn); - }; - /** - * Transform to a user presentable string representation. - */ - Range.prototype.toString = function () { - return '[' + this.startLineNumber + ',' + this.startColumn + ' -> ' + this.endLineNumber + ',' + this.endColumn + ']'; - }; - /** - * Create a new range using this range's start position, and using endLineNumber and endColumn as the end position. - */ - Range.prototype.setEndPosition = function (endLineNumber, endColumn) { - return new Range(this.startLineNumber, this.startColumn, endLineNumber, endColumn); - }; - /** - * Create a new range using this range's end position, and using startLineNumber and startColumn as the start position. - */ - Range.prototype.setStartPosition = function (startLineNumber, startColumn) { - return new Range(startLineNumber, startColumn, this.endLineNumber, this.endColumn); - }; - /** - * Create a new empty range using this range's start position. - */ - Range.prototype.collapseToStart = function () { - return Range.collapseToStart(this); - }; - /** - * Create a new empty range using this range's start position. - */ - Range.collapseToStart = function (range) { - return new Range(range.startLineNumber, range.startColumn, range.startLineNumber, range.startColumn); - }; - // --- - Range.fromPositions = function (start, end) { - if (end === void 0) { end = start; } - return new Range(start.lineNumber, start.column, end.lineNumber, end.column); - }; - Range.lift = function (range) { - if (!range) { - return null; - } - return new Range(range.startLineNumber, range.startColumn, range.endLineNumber, range.endColumn); - }; - /** - * Test if `obj` is an `IRange`. - */ - Range.isIRange = function (obj) { - return (obj - && (typeof obj.startLineNumber === 'number') - && (typeof obj.startColumn === 'number') - && (typeof obj.endLineNumber === 'number') - && (typeof obj.endColumn === 'number')); - }; - /** - * Test if the two ranges are touching in any way. - */ - Range.areIntersectingOrTouching = function (a, b) { - // Check if `a` is before `b` - if (a.endLineNumber < b.startLineNumber || (a.endLineNumber === b.startLineNumber && a.endColumn < b.startColumn)) { - return false; - } - // Check if `b` is before `a` - if (b.endLineNumber < a.startLineNumber || (b.endLineNumber === a.startLineNumber && b.endColumn < a.startColumn)) { - return false; - } - // These ranges must intersect - return true; - }; - /** - * Test if the two ranges are intersecting. If the ranges are touching it returns true. - */ - Range.areIntersecting = function (a, b) { - // Check if `a` is before `b` - if (a.endLineNumber < b.startLineNumber || (a.endLineNumber === b.startLineNumber && a.endColumn <= b.startColumn)) { - return false; - } - // Check if `b` is before `a` - if (b.endLineNumber < a.startLineNumber || (b.endLineNumber === a.startLineNumber && b.endColumn <= a.startColumn)) { - return false; - } - // These ranges must intersect - return true; - }; - /** - * A function that compares ranges, useful for sorting ranges - * It will first compare ranges on the startPosition and then on the endPosition - */ - Range.compareRangesUsingStarts = function (a, b) { - if (a && b) { - var aStartLineNumber = a.startLineNumber | 0; - var bStartLineNumber = b.startLineNumber | 0; - if (aStartLineNumber === bStartLineNumber) { - var aStartColumn = a.startColumn | 0; - var bStartColumn = b.startColumn | 0; - if (aStartColumn === bStartColumn) { - var aEndLineNumber = a.endLineNumber | 0; - var bEndLineNumber = b.endLineNumber | 0; - if (aEndLineNumber === bEndLineNumber) { - var aEndColumn = a.endColumn | 0; - var bEndColumn = b.endColumn | 0; - return aEndColumn - bEndColumn; - } - return aEndLineNumber - bEndLineNumber; - } - return aStartColumn - bStartColumn; - } - return aStartLineNumber - bStartLineNumber; - } - var aExists = (a ? 1 : 0); - var bExists = (b ? 1 : 0); - return aExists - bExists; - }; - /** - * A function that compares ranges, useful for sorting ranges - * It will first compare ranges on the endPosition and then on the startPosition - */ - Range.compareRangesUsingEnds = function (a, b) { - if (a.endLineNumber === b.endLineNumber) { - if (a.endColumn === b.endColumn) { - if (a.startLineNumber === b.startLineNumber) { - return a.startColumn - b.startColumn; - } - return a.startLineNumber - b.startLineNumber; - } - return a.endColumn - b.endColumn; - } - return a.endLineNumber - b.endLineNumber; - }; - /** - * Test if the range spans multiple lines. - */ - Range.spansMultipleLines = function (range) { - return range.endLineNumber > range.startLineNumber; - }; - return Range; -}()); - +/*--------------------------------------------------------------------------------------------- + * Copyright (c) Microsoft Corporation. All rights reserved. + * Licensed under the MIT License. See License.txt in the project root for license information. + *--------------------------------------------------------------------------------------------*/ + +/** + * A range in the editor. (startLineNumber,startColumn) is <= (endLineNumber,endColumn) + */ +var Range = /** @class */ (function () { + function Range(startLineNumber, startColumn, endLineNumber, endColumn) { + if ((startLineNumber > endLineNumber) || (startLineNumber === endLineNumber && startColumn > endColumn)) { + this.startLineNumber = endLineNumber; + this.startColumn = endColumn; + this.endLineNumber = startLineNumber; + this.endColumn = startColumn; + } + else { + this.startLineNumber = startLineNumber; + this.startColumn = startColumn; + this.endLineNumber = endLineNumber; + this.endColumn = endColumn; + } + } + /** + * Test if this range is empty. + */ + Range.prototype.isEmpty = function () { + return Range.isEmpty(this); + }; + /** + * Test if `range` is empty. + */ + Range.isEmpty = function (range) { + return (range.startLineNumber === range.endLineNumber && range.startColumn === range.endColumn); + }; + /** + * Test if position is in this range. If the position is at the edges, will return true. + */ + Range.prototype.containsPosition = function (position) { + return Range.containsPosition(this, position); + }; + /** + * Test if `position` is in `range`. If the position is at the edges, will return true. + */ + Range.containsPosition = function (range, position) { + if (position.lineNumber < range.startLineNumber || position.lineNumber > range.endLineNumber) { + return false; + } + if (position.lineNumber === range.startLineNumber && position.column < range.startColumn) { + return false; + } + if (position.lineNumber === range.endLineNumber && position.column > range.endColumn) { + return false; + } + return true; + }; + /** + * Test if range is in this range. If the range is equal to this range, will return true. + */ + Range.prototype.containsRange = function (range) { + return Range.containsRange(this, range); + }; + /** + * Test if `otherRange` is in `range`. If the ranges are equal, will return true. + */ + Range.containsRange = function (range, otherRange) { + if (otherRange.startLineNumber < range.startLineNumber || otherRange.endLineNumber < range.startLineNumber) { + return false; + } + if (otherRange.startLineNumber > range.endLineNumber || otherRange.endLineNumber > range.endLineNumber) { + return false; + } + if (otherRange.startLineNumber === range.startLineNumber && otherRange.startColumn < range.startColumn) { + return false; + } + if (otherRange.endLineNumber === range.endLineNumber && otherRange.endColumn > range.endColumn) { + return false; + } + return true; + }; + /** + * Test if `range` is strictly in this range. `range` must start after and end before this range for the result to be true. + */ + Range.prototype.strictContainsRange = function (range) { + return Range.strictContainsRange(this, range); + }; + /** + * Test if `otherRange` is strinctly in `range` (must start after, and end before). If the ranges are equal, will return false. + */ + Range.strictContainsRange = function (range, otherRange) { + if (otherRange.startLineNumber < range.startLineNumber || otherRange.endLineNumber < range.startLineNumber) { + return false; + } + if (otherRange.startLineNumber > range.endLineNumber || otherRange.endLineNumber > range.endLineNumber) { + return false; + } + if (otherRange.startLineNumber === range.startLineNumber && otherRange.startColumn <= range.startColumn) { + return false; + } + if (otherRange.endLineNumber === range.endLineNumber && otherRange.endColumn >= range.endColumn) { + return false; + } + return true; + }; + /** + * A reunion of the two ranges. + * The smallest position will be used as the start point, and the largest one as the end point. + */ + Range.prototype.plusRange = function (range) { + return Range.plusRange(this, range); + }; + /** + * A reunion of the two ranges. + * The smallest position will be used as the start point, and the largest one as the end point. + */ + Range.plusRange = function (a, b) { + var startLineNumber; + var startColumn; + var endLineNumber; + var endColumn; + if (b.startLineNumber < a.startLineNumber) { + startLineNumber = b.startLineNumber; + startColumn = b.startColumn; + } + else if (b.startLineNumber === a.startLineNumber) { + startLineNumber = b.startLineNumber; + startColumn = Math.min(b.startColumn, a.startColumn); + } + else { + startLineNumber = a.startLineNumber; + startColumn = a.startColumn; + } + if (b.endLineNumber > a.endLineNumber) { + endLineNumber = b.endLineNumber; + endColumn = b.endColumn; + } + else if (b.endLineNumber === a.endLineNumber) { + endLineNumber = b.endLineNumber; + endColumn = Math.max(b.endColumn, a.endColumn); + } + else { + endLineNumber = a.endLineNumber; + endColumn = a.endColumn; + } + return new Range(startLineNumber, startColumn, endLineNumber, endColumn); + }; + /** + * A intersection of the two ranges. + */ + Range.prototype.intersectRanges = function (range) { + return Range.intersectRanges(this, range); + }; + /** + * A intersection of the two ranges. + */ + Range.intersectRanges = function (a, b) { + var resultStartLineNumber = a.startLineNumber; + var resultStartColumn = a.startColumn; + var resultEndLineNumber = a.endLineNumber; + var resultEndColumn = a.endColumn; + var otherStartLineNumber = b.startLineNumber; + var otherStartColumn = b.startColumn; + var otherEndLineNumber = b.endLineNumber; + var otherEndColumn = b.endColumn; + if (resultStartLineNumber < otherStartLineNumber) { + resultStartLineNumber = otherStartLineNumber; + resultStartColumn = otherStartColumn; + } + else if (resultStartLineNumber === otherStartLineNumber) { + resultStartColumn = Math.max(resultStartColumn, otherStartColumn); + } + if (resultEndLineNumber > otherEndLineNumber) { + resultEndLineNumber = otherEndLineNumber; + resultEndColumn = otherEndColumn; + } + else if (resultEndLineNumber === otherEndLineNumber) { + resultEndColumn = Math.min(resultEndColumn, otherEndColumn); + } + // Check if selection is now empty + if (resultStartLineNumber > resultEndLineNumber) { + return null; + } + if (resultStartLineNumber === resultEndLineNumber && resultStartColumn > resultEndColumn) { + return null; + } + return new Range(resultStartLineNumber, resultStartColumn, resultEndLineNumber, resultEndColumn); + }; + /** + * Test if this range equals other. + */ + Range.prototype.equalsRange = function (other) { + return Range.equalsRange(this, other); + }; + /** + * Test if range `a` equals `b`. + */ + Range.equalsRange = function (a, b) { + return (!!a && + !!b && + a.startLineNumber === b.startLineNumber && + a.startColumn === b.startColumn && + a.endLineNumber === b.endLineNumber && + a.endColumn === b.endColumn); + }; + /** + * Return the end position (which will be after or equal to the start position) + */ + Range.prototype.getEndPosition = function () { + return new _position_js__WEBPACK_IMPORTED_MODULE_0__["Position"](this.endLineNumber, this.endColumn); + }; + /** + * Return the start position (which will be before or equal to the end position) + */ + Range.prototype.getStartPosition = function () { + return new _position_js__WEBPACK_IMPORTED_MODULE_0__["Position"](this.startLineNumber, this.startColumn); + }; + /** + * Transform to a user presentable string representation. + */ + Range.prototype.toString = function () { + return '[' + this.startLineNumber + ',' + this.startColumn + ' -> ' + this.endLineNumber + ',' + this.endColumn + ']'; + }; + /** + * Create a new range using this range's start position, and using endLineNumber and endColumn as the end position. + */ + Range.prototype.setEndPosition = function (endLineNumber, endColumn) { + return new Range(this.startLineNumber, this.startColumn, endLineNumber, endColumn); + }; + /** + * Create a new range using this range's end position, and using startLineNumber and startColumn as the start position. + */ + Range.prototype.setStartPosition = function (startLineNumber, startColumn) { + return new Range(startLineNumber, startColumn, this.endLineNumber, this.endColumn); + }; + /** + * Create a new empty range using this range's start position. + */ + Range.prototype.collapseToStart = function () { + return Range.collapseToStart(this); + }; + /** + * Create a new empty range using this range's start position. + */ + Range.collapseToStart = function (range) { + return new Range(range.startLineNumber, range.startColumn, range.startLineNumber, range.startColumn); + }; + // --- + Range.fromPositions = function (start, end) { + if (end === void 0) { end = start; } + return new Range(start.lineNumber, start.column, end.lineNumber, end.column); + }; + Range.lift = function (range) { + if (!range) { + return null; + } + return new Range(range.startLineNumber, range.startColumn, range.endLineNumber, range.endColumn); + }; + /** + * Test if `obj` is an `IRange`. + */ + Range.isIRange = function (obj) { + return (obj + && (typeof obj.startLineNumber === 'number') + && (typeof obj.startColumn === 'number') + && (typeof obj.endLineNumber === 'number') + && (typeof obj.endColumn === 'number')); + }; + /** + * Test if the two ranges are touching in any way. + */ + Range.areIntersectingOrTouching = function (a, b) { + // Check if `a` is before `b` + if (a.endLineNumber < b.startLineNumber || (a.endLineNumber === b.startLineNumber && a.endColumn < b.startColumn)) { + return false; + } + // Check if `b` is before `a` + if (b.endLineNumber < a.startLineNumber || (b.endLineNumber === a.startLineNumber && b.endColumn < a.startColumn)) { + return false; + } + // These ranges must intersect + return true; + }; + /** + * Test if the two ranges are intersecting. If the ranges are touching it returns true. + */ + Range.areIntersecting = function (a, b) { + // Check if `a` is before `b` + if (a.endLineNumber < b.startLineNumber || (a.endLineNumber === b.startLineNumber && a.endColumn <= b.startColumn)) { + return false; + } + // Check if `b` is before `a` + if (b.endLineNumber < a.startLineNumber || (b.endLineNumber === a.startLineNumber && b.endColumn <= a.startColumn)) { + return false; + } + // These ranges must intersect + return true; + }; + /** + * A function that compares ranges, useful for sorting ranges + * It will first compare ranges on the startPosition and then on the endPosition + */ + Range.compareRangesUsingStarts = function (a, b) { + if (a && b) { + var aStartLineNumber = a.startLineNumber | 0; + var bStartLineNumber = b.startLineNumber | 0; + if (aStartLineNumber === bStartLineNumber) { + var aStartColumn = a.startColumn | 0; + var bStartColumn = b.startColumn | 0; + if (aStartColumn === bStartColumn) { + var aEndLineNumber = a.endLineNumber | 0; + var bEndLineNumber = b.endLineNumber | 0; + if (aEndLineNumber === bEndLineNumber) { + var aEndColumn = a.endColumn | 0; + var bEndColumn = b.endColumn | 0; + return aEndColumn - bEndColumn; + } + return aEndLineNumber - bEndLineNumber; + } + return aStartColumn - bStartColumn; + } + return aStartLineNumber - bStartLineNumber; + } + var aExists = (a ? 1 : 0); + var bExists = (b ? 1 : 0); + return aExists - bExists; + }; + /** + * A function that compares ranges, useful for sorting ranges + * It will first compare ranges on the endPosition and then on the startPosition + */ + Range.compareRangesUsingEnds = function (a, b) { + if (a.endLineNumber === b.endLineNumber) { + if (a.endColumn === b.endColumn) { + if (a.startLineNumber === b.startLineNumber) { + return a.startColumn - b.startColumn; + } + return a.startLineNumber - b.startLineNumber; + } + return a.endColumn - b.endColumn; + } + return a.endLineNumber - b.endLineNumber; + }; + /** + * Test if the range spans multiple lines. + */ + Range.spansMultipleLines = function (range) { + return range.endLineNumber > range.startLineNumber; + }; + return Range; +}()); + /***/ }), @@ -5240,155 +6019,149 @@ __webpack_require__.r(__webpack_exports__); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "Selection", function() { return Selection; }); /* harmony import */ var _position_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./position.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/position.js"); /* harmony import */ var _range_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./range.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/range.js"); -/*--------------------------------------------------------------------------------------------- - * Copyright (c) Microsoft Corporation. All rights reserved. - * Licensed under the MIT License. See License.txt in the project root for license information. - *--------------------------------------------------------------------------------------------*/ -var __extends = (undefined && undefined.__extends) || (function () { - var extendStatics = function (d, b) { - extendStatics = Object.setPrototypeOf || - ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) || - function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; }; - return extendStatics(d, b); - }; - return function (d, b) { - extendStatics(d, b); - function __() { this.constructor = d; } - d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __()); - }; -})(); - - -/** - * A selection in the editor. - * The selection is a range that has an orientation. - */ -var Selection = /** @class */ (function (_super) { - __extends(Selection, _super); - function Selection(selectionStartLineNumber, selectionStartColumn, positionLineNumber, positionColumn) { - var _this = _super.call(this, selectionStartLineNumber, selectionStartColumn, positionLineNumber, positionColumn) || this; - _this.selectionStartLineNumber = selectionStartLineNumber; - _this.selectionStartColumn = selectionStartColumn; - _this.positionLineNumber = positionLineNumber; - _this.positionColumn = positionColumn; - return _this; - } - /** - * Clone this selection. - */ - Selection.prototype.clone = function () { - return new Selection(this.selectionStartLineNumber, this.selectionStartColumn, this.positionLineNumber, this.positionColumn); - }; - /** - * Transform to a human-readable representation. - */ - Selection.prototype.toString = function () { - return '[' + this.selectionStartLineNumber + ',' + this.selectionStartColumn + ' -> ' + this.positionLineNumber + ',' + this.positionColumn + ']'; - }; - /** - * Test if equals other selection. - */ - Selection.prototype.equalsSelection = function (other) { - return (Selection.selectionsEqual(this, other)); - }; - /** - * Test if the two selections are equal. - */ - Selection.selectionsEqual = function (a, b) { - return (a.selectionStartLineNumber === b.selectionStartLineNumber && - a.selectionStartColumn === b.selectionStartColumn && - a.positionLineNumber === b.positionLineNumber && - a.positionColumn === b.positionColumn); - }; - /** - * Get directions (LTR or RTL). - */ - Selection.prototype.getDirection = function () { - if (this.selectionStartLineNumber === this.startLineNumber && this.selectionStartColumn === this.startColumn) { - return 0 /* LTR */; - } - return 1 /* RTL */; - }; - /** - * Create a new selection with a different `positionLineNumber` and `positionColumn`. - */ - Selection.prototype.setEndPosition = function (endLineNumber, endColumn) { - if (this.getDirection() === 0 /* LTR */) { - return new Selection(this.startLineNumber, this.startColumn, endLineNumber, endColumn); - } - return new Selection(endLineNumber, endColumn, this.startLineNumber, this.startColumn); - }; - /** - * Get the position at `positionLineNumber` and `positionColumn`. - */ - Selection.prototype.getPosition = function () { - return new _position_js__WEBPACK_IMPORTED_MODULE_0__["Position"](this.positionLineNumber, this.positionColumn); - }; - /** - * Create a new selection with a different `selectionStartLineNumber` and `selectionStartColumn`. - */ - Selection.prototype.setStartPosition = function (startLineNumber, startColumn) { - if (this.getDirection() === 0 /* LTR */) { - return new Selection(startLineNumber, startColumn, this.endLineNumber, this.endColumn); - } - return new Selection(this.endLineNumber, this.endColumn, startLineNumber, startColumn); - }; - // ---- - /** - * Create a `Selection` from one or two positions - */ - Selection.fromPositions = function (start, end) { - if (end === void 0) { end = start; } - return new Selection(start.lineNumber, start.column, end.lineNumber, end.column); - }; - /** - * Create a `Selection` from an `ISelection`. - */ - Selection.liftSelection = function (sel) { - return new Selection(sel.selectionStartLineNumber, sel.selectionStartColumn, sel.positionLineNumber, sel.positionColumn); - }; - /** - * `a` equals `b`. - */ - Selection.selectionsArrEqual = function (a, b) { - if (a && !b || !a && b) { - return false; - } - if (!a && !b) { - return true; - } - if (a.length !== b.length) { - return false; - } - for (var i = 0, len = a.length; i < len; i++) { - if (!this.selectionsEqual(a[i], b[i])) { - return false; - } - } - return true; - }; - /** - * Test if `obj` is an `ISelection`. - */ - Selection.isISelection = function (obj) { - return (obj - && (typeof obj.selectionStartLineNumber === 'number') - && (typeof obj.selectionStartColumn === 'number') - && (typeof obj.positionLineNumber === 'number') - && (typeof obj.positionColumn === 'number')); - }; - /** - * Create with a direction. - */ - Selection.createWithDirection = function (startLineNumber, startColumn, endLineNumber, endColumn, direction) { - if (direction === 0 /* LTR */) { - return new Selection(startLineNumber, startColumn, endLineNumber, endColumn); - } - return new Selection(endLineNumber, endColumn, startLineNumber, startColumn); - }; - return Selection; -}(_range_js__WEBPACK_IMPORTED_MODULE_1__["Range"])); - +/*--------------------------------------------------------------------------------------------- + * Copyright (c) Microsoft Corporation. All rights reserved. + * Licensed under the MIT License. See License.txt in the project root for license information. + *--------------------------------------------------------------------------------------------*/ +var __extends = (undefined && undefined.__extends) || (function () { + var extendStatics = function (d, b) { + extendStatics = Object.setPrototypeOf || + ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) || + function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; }; + return extendStatics(d, b); + }; + return function (d, b) { + extendStatics(d, b); + function __() { this.constructor = d; } + d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __()); + }; +})(); + + +/** + * A selection in the editor. + * The selection is a range that has an orientation. + */ +var Selection = /** @class */ (function (_super) { + __extends(Selection, _super); + function Selection(selectionStartLineNumber, selectionStartColumn, positionLineNumber, positionColumn) { + var _this = _super.call(this, selectionStartLineNumber, selectionStartColumn, positionLineNumber, positionColumn) || this; + _this.selectionStartLineNumber = selectionStartLineNumber; + _this.selectionStartColumn = selectionStartColumn; + _this.positionLineNumber = positionLineNumber; + _this.positionColumn = positionColumn; + return _this; + } + /** + * Transform to a human-readable representation. + */ + Selection.prototype.toString = function () { + return '[' + this.selectionStartLineNumber + ',' + this.selectionStartColumn + ' -> ' + this.positionLineNumber + ',' + this.positionColumn + ']'; + }; + /** + * Test if equals other selection. + */ + Selection.prototype.equalsSelection = function (other) { + return (Selection.selectionsEqual(this, other)); + }; + /** + * Test if the two selections are equal. + */ + Selection.selectionsEqual = function (a, b) { + return (a.selectionStartLineNumber === b.selectionStartLineNumber && + a.selectionStartColumn === b.selectionStartColumn && + a.positionLineNumber === b.positionLineNumber && + a.positionColumn === b.positionColumn); + }; + /** + * Get directions (LTR or RTL). + */ + Selection.prototype.getDirection = function () { + if (this.selectionStartLineNumber === this.startLineNumber && this.selectionStartColumn === this.startColumn) { + return 0 /* LTR */; + } + return 1 /* RTL */; + }; + /** + * Create a new selection with a different `positionLineNumber` and `positionColumn`. + */ + Selection.prototype.setEndPosition = function (endLineNumber, endColumn) { + if (this.getDirection() === 0 /* LTR */) { + return new Selection(this.startLineNumber, this.startColumn, endLineNumber, endColumn); + } + return new Selection(endLineNumber, endColumn, this.startLineNumber, this.startColumn); + }; + /** + * Get the position at `positionLineNumber` and `positionColumn`. + */ + Selection.prototype.getPosition = function () { + return new _position_js__WEBPACK_IMPORTED_MODULE_0__["Position"](this.positionLineNumber, this.positionColumn); + }; + /** + * Create a new selection with a different `selectionStartLineNumber` and `selectionStartColumn`. + */ + Selection.prototype.setStartPosition = function (startLineNumber, startColumn) { + if (this.getDirection() === 0 /* LTR */) { + return new Selection(startLineNumber, startColumn, this.endLineNumber, this.endColumn); + } + return new Selection(this.endLineNumber, this.endColumn, startLineNumber, startColumn); + }; + // ---- + /** + * Create a `Selection` from one or two positions + */ + Selection.fromPositions = function (start, end) { + if (end === void 0) { end = start; } + return new Selection(start.lineNumber, start.column, end.lineNumber, end.column); + }; + /** + * Create a `Selection` from an `ISelection`. + */ + Selection.liftSelection = function (sel) { + return new Selection(sel.selectionStartLineNumber, sel.selectionStartColumn, sel.positionLineNumber, sel.positionColumn); + }; + /** + * `a` equals `b`. + */ + Selection.selectionsArrEqual = function (a, b) { + if (a && !b || !a && b) { + return false; + } + if (!a && !b) { + return true; + } + if (a.length !== b.length) { + return false; + } + for (var i = 0, len = a.length; i < len; i++) { + if (!this.selectionsEqual(a[i], b[i])) { + return false; + } + } + return true; + }; + /** + * Test if `obj` is an `ISelection`. + */ + Selection.isISelection = function (obj) { + return (obj + && (typeof obj.selectionStartLineNumber === 'number') + && (typeof obj.selectionStartColumn === 'number') + && (typeof obj.positionLineNumber === 'number') + && (typeof obj.positionColumn === 'number')); + }; + /** + * Create with a direction. + */ + Selection.createWithDirection = function (startLineNumber, startColumn, endLineNumber, endColumn, direction) { + if (direction === 0 /* LTR */) { + return new Selection(startLineNumber, startColumn, endLineNumber, endColumn); + } + return new Selection(endLineNumber, endColumn, startLineNumber, startColumn); + }; + return Selection; +}(_range_js__WEBPACK_IMPORTED_MODULE_1__["Range"])); + /***/ }), @@ -5405,104 +6178,38 @@ __webpack_require__.r(__webpack_exports__); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "Token", function() { return Token; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "TokenizationResult", function() { return TokenizationResult; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "TokenizationResult2", function() { return TokenizationResult2; }); -/*--------------------------------------------------------------------------------------------- - * Copyright (c) Microsoft Corporation. All rights reserved. - * Licensed under the MIT License. See License.txt in the project root for license information. - *--------------------------------------------------------------------------------------------*/ -var Token = /** @class */ (function () { - function Token(offset, type, language) { - this.offset = offset | 0; // @perf - this.type = type; - this.language = language; - } - Token.prototype.toString = function () { - return '(' + this.offset + ', ' + this.type + ')'; - }; - return Token; -}()); - -var TokenizationResult = /** @class */ (function () { - function TokenizationResult(tokens, endState) { - this.tokens = tokens; - this.endState = endState; - } - return TokenizationResult; -}()); - -var TokenizationResult2 = /** @class */ (function () { - function TokenizationResult2(tokens, endState) { - this.tokens = tokens; - this.endState = endState; - } - return TokenizationResult2; -}()); - - - -/***/ }), - -/***/ "./node_modules/monaco-editor/esm/vs/editor/common/core/uint.js": -/*!**********************************************************************!*\ - !*** ./node_modules/monaco-editor/esm/vs/editor/common/core/uint.js ***! - \**********************************************************************/ -/*! exports provided: Uint8Matrix, toUint8, toUint32, toUint32Array */ -/***/ (function(module, __webpack_exports__, __webpack_require__) { - -"use strict"; -__webpack_require__.r(__webpack_exports__); -/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "Uint8Matrix", function() { return Uint8Matrix; }); -/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "toUint8", function() { return toUint8; }); -/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "toUint32", function() { return toUint32; }); -/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "toUint32Array", function() { return toUint32Array; }); -/*--------------------------------------------------------------------------------------------- - * Copyright (c) Microsoft Corporation. All rights reserved. - * Licensed under the MIT License. See License.txt in the project root for license information. - *--------------------------------------------------------------------------------------------*/ -var Uint8Matrix = /** @class */ (function () { - function Uint8Matrix(rows, cols, defaultValue) { - var data = new Uint8Array(rows * cols); - for (var i = 0, len = rows * cols; i < len; i++) { - data[i] = defaultValue; - } - this._data = data; - this.rows = rows; - this.cols = cols; - } - Uint8Matrix.prototype.get = function (row, col) { - return this._data[row * this.cols + col]; - }; - Uint8Matrix.prototype.set = function (row, col, value) { - this._data[row * this.cols + col] = value; - }; - return Uint8Matrix; -}()); - -function toUint8(v) { - if (v < 0) { - return 0; - } - if (v > 255 /* MAX_UINT_8 */) { - return 255 /* MAX_UINT_8 */; - } - return v | 0; -} -function toUint32(v) { - if (v < 0) { - return 0; - } - if (v > 4294967295 /* MAX_UINT_32 */) { - return 4294967295 /* MAX_UINT_32 */; - } - return v | 0; -} -function toUint32Array(arr) { - var len = arr.length; - var r = new Uint32Array(len); - for (var i = 0; i < len; i++) { - r[i] = toUint32(arr[i]); - } - return r; -} +/*--------------------------------------------------------------------------------------------- + * Copyright (c) Microsoft Corporation. All rights reserved. + * Licensed under the MIT License. See License.txt in the project root for license information. + *--------------------------------------------------------------------------------------------*/ +var Token = /** @class */ (function () { + function Token(offset, type, language) { + this.offset = offset | 0; // @perf + this.type = type; + this.language = language; + } + Token.prototype.toString = function () { + return '(' + this.offset + ', ' + this.type + ')'; + }; + return Token; +}()); + +var TokenizationResult = /** @class */ (function () { + function TokenizationResult(tokens, endState) { + this.tokens = tokens; + this.endState = endState; + } + return TokenizationResult; +}()); + +var TokenizationResult2 = /** @class */ (function () { + function TokenizationResult2(tokens, endState) { + this.tokens = tokens; + this.endState = endState; + } + return TokenizationResult2; +}()); + /***/ }), @@ -5519,387 +6226,401 @@ __webpack_require__.r(__webpack_exports__); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "DiffComputer", function() { return DiffComputer; }); /* harmony import */ var _base_common_diff_diff_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../../../base/common/diff/diff.js */ "./node_modules/monaco-editor/esm/vs/base/common/diff/diff.js"); /* harmony import */ var _base_common_strings_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../../../base/common/strings.js */ "./node_modules/monaco-editor/esm/vs/base/common/strings.js"); -/*--------------------------------------------------------------------------------------------- - * Copyright (c) Microsoft Corporation. All rights reserved. - * Licensed under the MIT License. See License.txt in the project root for license information. - *--------------------------------------------------------------------------------------------*/ - - -var MAXIMUM_RUN_TIME = 5000; // 5 seconds -var MINIMUM_MATCHING_CHARACTER_LENGTH = 3; -function computeDiff(originalSequence, modifiedSequence, continueProcessingPredicate, pretty) { - var diffAlgo = new _base_common_diff_diff_js__WEBPACK_IMPORTED_MODULE_0__["LcsDiff"](originalSequence, modifiedSequence, continueProcessingPredicate); - return diffAlgo.ComputeDiff(pretty); -} -var LineMarkerSequence = /** @class */ (function () { - function LineMarkerSequence(lines) { - var startColumns = []; - var endColumns = []; - for (var i = 0, length_1 = lines.length; i < length_1; i++) { - startColumns[i] = LineMarkerSequence._getFirstNonBlankColumn(lines[i], 1); - endColumns[i] = LineMarkerSequence._getLastNonBlankColumn(lines[i], 1); - } - this._lines = lines; - this._startColumns = startColumns; - this._endColumns = endColumns; - } - LineMarkerSequence.prototype.getLength = function () { - return this._lines.length; - }; - LineMarkerSequence.prototype.getElementAtIndex = function (i) { - return this._lines[i].substring(this._startColumns[i] - 1, this._endColumns[i] - 1); - }; - LineMarkerSequence.prototype.getStartLineNumber = function (i) { - return i + 1; - }; - LineMarkerSequence.prototype.getEndLineNumber = function (i) { - return i + 1; - }; - LineMarkerSequence._getFirstNonBlankColumn = function (txt, defaultValue) { - var r = _base_common_strings_js__WEBPACK_IMPORTED_MODULE_1__["firstNonWhitespaceIndex"](txt); - if (r === -1) { - return defaultValue; - } - return r + 1; - }; - LineMarkerSequence._getLastNonBlankColumn = function (txt, defaultValue) { - var r = _base_common_strings_js__WEBPACK_IMPORTED_MODULE_1__["lastNonWhitespaceIndex"](txt); - if (r === -1) { - return defaultValue; - } - return r + 2; - }; - LineMarkerSequence.prototype.getCharSequence = function (shouldIgnoreTrimWhitespace, startIndex, endIndex) { - var charCodes = []; - var lineNumbers = []; - var columns = []; - var len = 0; - for (var index = startIndex; index <= endIndex; index++) { - var lineContent = this._lines[index]; - var startColumn = (shouldIgnoreTrimWhitespace ? this._startColumns[index] : 1); - var endColumn = (shouldIgnoreTrimWhitespace ? this._endColumns[index] : lineContent.length + 1); - for (var col = startColumn; col < endColumn; col++) { - charCodes[len] = lineContent.charCodeAt(col - 1); - lineNumbers[len] = index + 1; - columns[len] = col; - len++; - } - } - return new CharSequence(charCodes, lineNumbers, columns); - }; - return LineMarkerSequence; -}()); -var CharSequence = /** @class */ (function () { - function CharSequence(charCodes, lineNumbers, columns) { - this._charCodes = charCodes; - this._lineNumbers = lineNumbers; - this._columns = columns; - } - CharSequence.prototype.getLength = function () { - return this._charCodes.length; - }; - CharSequence.prototype.getElementAtIndex = function (i) { - return this._charCodes[i]; - }; - CharSequence.prototype.getStartLineNumber = function (i) { - return this._lineNumbers[i]; - }; - CharSequence.prototype.getStartColumn = function (i) { - return this._columns[i]; - }; - CharSequence.prototype.getEndLineNumber = function (i) { - return this._lineNumbers[i]; - }; - CharSequence.prototype.getEndColumn = function (i) { - return this._columns[i] + 1; - }; - return CharSequence; -}()); -var CharChange = /** @class */ (function () { - function CharChange(originalStartLineNumber, originalStartColumn, originalEndLineNumber, originalEndColumn, modifiedStartLineNumber, modifiedStartColumn, modifiedEndLineNumber, modifiedEndColumn) { - this.originalStartLineNumber = originalStartLineNumber; - this.originalStartColumn = originalStartColumn; - this.originalEndLineNumber = originalEndLineNumber; - this.originalEndColumn = originalEndColumn; - this.modifiedStartLineNumber = modifiedStartLineNumber; - this.modifiedStartColumn = modifiedStartColumn; - this.modifiedEndLineNumber = modifiedEndLineNumber; - this.modifiedEndColumn = modifiedEndColumn; - } - CharChange.createFromDiffChange = function (diffChange, originalCharSequence, modifiedCharSequence) { - var originalStartLineNumber; - var originalStartColumn; - var originalEndLineNumber; - var originalEndColumn; - var modifiedStartLineNumber; - var modifiedStartColumn; - var modifiedEndLineNumber; - var modifiedEndColumn; - if (diffChange.originalLength === 0) { - originalStartLineNumber = 0; - originalStartColumn = 0; - originalEndLineNumber = 0; - originalEndColumn = 0; - } - else { - originalStartLineNumber = originalCharSequence.getStartLineNumber(diffChange.originalStart); - originalStartColumn = originalCharSequence.getStartColumn(diffChange.originalStart); - originalEndLineNumber = originalCharSequence.getEndLineNumber(diffChange.originalStart + diffChange.originalLength - 1); - originalEndColumn = originalCharSequence.getEndColumn(diffChange.originalStart + diffChange.originalLength - 1); - } - if (diffChange.modifiedLength === 0) { - modifiedStartLineNumber = 0; - modifiedStartColumn = 0; - modifiedEndLineNumber = 0; - modifiedEndColumn = 0; - } - else { - modifiedStartLineNumber = modifiedCharSequence.getStartLineNumber(diffChange.modifiedStart); - modifiedStartColumn = modifiedCharSequence.getStartColumn(diffChange.modifiedStart); - modifiedEndLineNumber = modifiedCharSequence.getEndLineNumber(diffChange.modifiedStart + diffChange.modifiedLength - 1); - modifiedEndColumn = modifiedCharSequence.getEndColumn(diffChange.modifiedStart + diffChange.modifiedLength - 1); - } - return new CharChange(originalStartLineNumber, originalStartColumn, originalEndLineNumber, originalEndColumn, modifiedStartLineNumber, modifiedStartColumn, modifiedEndLineNumber, modifiedEndColumn); - }; - return CharChange; -}()); -function postProcessCharChanges(rawChanges) { - if (rawChanges.length <= 1) { - return rawChanges; - } - var result = [rawChanges[0]]; - var prevChange = result[0]; - for (var i = 1, len = rawChanges.length; i < len; i++) { - var currChange = rawChanges[i]; - var originalMatchingLength = currChange.originalStart - (prevChange.originalStart + prevChange.originalLength); - var modifiedMatchingLength = currChange.modifiedStart - (prevChange.modifiedStart + prevChange.modifiedLength); - // Both of the above should be equal, but the continueProcessingPredicate may prevent this from being true - var matchingLength = Math.min(originalMatchingLength, modifiedMatchingLength); - if (matchingLength < MINIMUM_MATCHING_CHARACTER_LENGTH) { - // Merge the current change into the previous one - prevChange.originalLength = (currChange.originalStart + currChange.originalLength) - prevChange.originalStart; - prevChange.modifiedLength = (currChange.modifiedStart + currChange.modifiedLength) - prevChange.modifiedStart; - } - else { - // Add the current change - result.push(currChange); - prevChange = currChange; - } - } - return result; -} -var LineChange = /** @class */ (function () { - function LineChange(originalStartLineNumber, originalEndLineNumber, modifiedStartLineNumber, modifiedEndLineNumber, charChanges) { - this.originalStartLineNumber = originalStartLineNumber; - this.originalEndLineNumber = originalEndLineNumber; - this.modifiedStartLineNumber = modifiedStartLineNumber; - this.modifiedEndLineNumber = modifiedEndLineNumber; - this.charChanges = charChanges; - } - LineChange.createFromDiffResult = function (shouldIgnoreTrimWhitespace, diffChange, originalLineSequence, modifiedLineSequence, continueProcessingPredicate, shouldComputeCharChanges, shouldPostProcessCharChanges) { - var originalStartLineNumber; - var originalEndLineNumber; - var modifiedStartLineNumber; - var modifiedEndLineNumber; - var charChanges = undefined; - if (diffChange.originalLength === 0) { - originalStartLineNumber = originalLineSequence.getStartLineNumber(diffChange.originalStart) - 1; - originalEndLineNumber = 0; - } - else { - originalStartLineNumber = originalLineSequence.getStartLineNumber(diffChange.originalStart); - originalEndLineNumber = originalLineSequence.getEndLineNumber(diffChange.originalStart + diffChange.originalLength - 1); - } - if (diffChange.modifiedLength === 0) { - modifiedStartLineNumber = modifiedLineSequence.getStartLineNumber(diffChange.modifiedStart) - 1; - modifiedEndLineNumber = 0; - } - else { - modifiedStartLineNumber = modifiedLineSequence.getStartLineNumber(diffChange.modifiedStart); - modifiedEndLineNumber = modifiedLineSequence.getEndLineNumber(diffChange.modifiedStart + diffChange.modifiedLength - 1); - } - if (shouldComputeCharChanges && diffChange.originalLength !== 0 && diffChange.modifiedLength !== 0 && continueProcessingPredicate()) { - var originalCharSequence = originalLineSequence.getCharSequence(shouldIgnoreTrimWhitespace, diffChange.originalStart, diffChange.originalStart + diffChange.originalLength - 1); - var modifiedCharSequence = modifiedLineSequence.getCharSequence(shouldIgnoreTrimWhitespace, diffChange.modifiedStart, diffChange.modifiedStart + diffChange.modifiedLength - 1); - var rawChanges = computeDiff(originalCharSequence, modifiedCharSequence, continueProcessingPredicate, true); - if (shouldPostProcessCharChanges) { - rawChanges = postProcessCharChanges(rawChanges); - } - charChanges = []; - for (var i = 0, length_2 = rawChanges.length; i < length_2; i++) { - charChanges.push(CharChange.createFromDiffChange(rawChanges[i], originalCharSequence, modifiedCharSequence)); - } - } - return new LineChange(originalStartLineNumber, originalEndLineNumber, modifiedStartLineNumber, modifiedEndLineNumber, charChanges); - }; - return LineChange; -}()); -var DiffComputer = /** @class */ (function () { - function DiffComputer(originalLines, modifiedLines, opts) { - this.shouldComputeCharChanges = opts.shouldComputeCharChanges; - this.shouldPostProcessCharChanges = opts.shouldPostProcessCharChanges; - this.shouldIgnoreTrimWhitespace = opts.shouldIgnoreTrimWhitespace; - this.shouldMakePrettyDiff = opts.shouldMakePrettyDiff; - this.maximumRunTimeMs = MAXIMUM_RUN_TIME; - this.originalLines = originalLines; - this.modifiedLines = modifiedLines; - this.original = new LineMarkerSequence(originalLines); - this.modified = new LineMarkerSequence(modifiedLines); - } - DiffComputer.prototype.computeDiff = function () { - if (this.original.getLength() === 1 && this.original.getElementAtIndex(0).length === 0) { - // empty original => fast path - return [{ - originalStartLineNumber: 1, - originalEndLineNumber: 1, - modifiedStartLineNumber: 1, - modifiedEndLineNumber: this.modified.getLength(), - charChanges: [{ - modifiedEndColumn: 0, - modifiedEndLineNumber: 0, - modifiedStartColumn: 0, - modifiedStartLineNumber: 0, - originalEndColumn: 0, - originalEndLineNumber: 0, - originalStartColumn: 0, - originalStartLineNumber: 0 - }] - }]; - } - if (this.modified.getLength() === 1 && this.modified.getElementAtIndex(0).length === 0) { - // empty modified => fast path - return [{ - originalStartLineNumber: 1, - originalEndLineNumber: this.original.getLength(), - modifiedStartLineNumber: 1, - modifiedEndLineNumber: 1, - charChanges: [{ - modifiedEndColumn: 0, - modifiedEndLineNumber: 0, - modifiedStartColumn: 0, - modifiedStartLineNumber: 0, - originalEndColumn: 0, - originalEndLineNumber: 0, - originalStartColumn: 0, - originalStartLineNumber: 0 - }] - }]; - } - this.computationStartTime = (new Date()).getTime(); - var rawChanges = computeDiff(this.original, this.modified, this._continueProcessingPredicate.bind(this), this.shouldMakePrettyDiff); - // The diff is always computed with ignoring trim whitespace - // This ensures we get the prettiest diff - if (this.shouldIgnoreTrimWhitespace) { - var lineChanges = []; - for (var i = 0, length_3 = rawChanges.length; i < length_3; i++) { - lineChanges.push(LineChange.createFromDiffResult(this.shouldIgnoreTrimWhitespace, rawChanges[i], this.original, this.modified, this._continueProcessingPredicate.bind(this), this.shouldComputeCharChanges, this.shouldPostProcessCharChanges)); - } - return lineChanges; - } - // Need to post-process and introduce changes where the trim whitespace is different - // Note that we are looping starting at -1 to also cover the lines before the first change - var result = []; - var originalLineIndex = 0; - var modifiedLineIndex = 0; - for (var i = -1 /* !!!! */, len = rawChanges.length; i < len; i++) { - var nextChange = (i + 1 < len ? rawChanges[i + 1] : null); - var originalStop = (nextChange ? nextChange.originalStart : this.originalLines.length); - var modifiedStop = (nextChange ? nextChange.modifiedStart : this.modifiedLines.length); - while (originalLineIndex < originalStop && modifiedLineIndex < modifiedStop) { - var originalLine = this.originalLines[originalLineIndex]; - var modifiedLine = this.modifiedLines[modifiedLineIndex]; - if (originalLine !== modifiedLine) { - // These lines differ only in trim whitespace - // Check the leading whitespace - { - var originalStartColumn = LineMarkerSequence._getFirstNonBlankColumn(originalLine, 1); - var modifiedStartColumn = LineMarkerSequence._getFirstNonBlankColumn(modifiedLine, 1); - while (originalStartColumn > 1 && modifiedStartColumn > 1) { - var originalChar = originalLine.charCodeAt(originalStartColumn - 2); - var modifiedChar = modifiedLine.charCodeAt(modifiedStartColumn - 2); - if (originalChar !== modifiedChar) { - break; - } - originalStartColumn--; - modifiedStartColumn--; - } - if (originalStartColumn > 1 || modifiedStartColumn > 1) { - this._pushTrimWhitespaceCharChange(result, originalLineIndex + 1, 1, originalStartColumn, modifiedLineIndex + 1, 1, modifiedStartColumn); - } - } - // Check the trailing whitespace - { - var originalEndColumn = LineMarkerSequence._getLastNonBlankColumn(originalLine, 1); - var modifiedEndColumn = LineMarkerSequence._getLastNonBlankColumn(modifiedLine, 1); - var originalMaxColumn = originalLine.length + 1; - var modifiedMaxColumn = modifiedLine.length + 1; - while (originalEndColumn < originalMaxColumn && modifiedEndColumn < modifiedMaxColumn) { - var originalChar = originalLine.charCodeAt(originalEndColumn - 1); - var modifiedChar = originalLine.charCodeAt(modifiedEndColumn - 1); - if (originalChar !== modifiedChar) { - break; - } - originalEndColumn++; - modifiedEndColumn++; - } - if (originalEndColumn < originalMaxColumn || modifiedEndColumn < modifiedMaxColumn) { - this._pushTrimWhitespaceCharChange(result, originalLineIndex + 1, originalEndColumn, originalMaxColumn, modifiedLineIndex + 1, modifiedEndColumn, modifiedMaxColumn); - } - } - } - originalLineIndex++; - modifiedLineIndex++; - } - if (nextChange) { - // Emit the actual change - result.push(LineChange.createFromDiffResult(this.shouldIgnoreTrimWhitespace, nextChange, this.original, this.modified, this._continueProcessingPredicate.bind(this), this.shouldComputeCharChanges, this.shouldPostProcessCharChanges)); - originalLineIndex += nextChange.originalLength; - modifiedLineIndex += nextChange.modifiedLength; - } - } - return result; - }; - DiffComputer.prototype._pushTrimWhitespaceCharChange = function (result, originalLineNumber, originalStartColumn, originalEndColumn, modifiedLineNumber, modifiedStartColumn, modifiedEndColumn) { - if (this._mergeTrimWhitespaceCharChange(result, originalLineNumber, originalStartColumn, originalEndColumn, modifiedLineNumber, modifiedStartColumn, modifiedEndColumn)) { - // Merged into previous - return; - } - var charChanges = undefined; - if (this.shouldComputeCharChanges) { - charChanges = [new CharChange(originalLineNumber, originalStartColumn, originalLineNumber, originalEndColumn, modifiedLineNumber, modifiedStartColumn, modifiedLineNumber, modifiedEndColumn)]; - } - result.push(new LineChange(originalLineNumber, originalLineNumber, modifiedLineNumber, modifiedLineNumber, charChanges)); - }; - DiffComputer.prototype._mergeTrimWhitespaceCharChange = function (result, originalLineNumber, originalStartColumn, originalEndColumn, modifiedLineNumber, modifiedStartColumn, modifiedEndColumn) { - var len = result.length; - if (len === 0) { - return false; - } - var prevChange = result[len - 1]; - if (prevChange.originalEndLineNumber === 0 || prevChange.modifiedEndLineNumber === 0) { - // Don't merge with inserts/deletes - return false; - } - if (prevChange.originalEndLineNumber + 1 === originalLineNumber && prevChange.modifiedEndLineNumber + 1 === modifiedLineNumber) { - prevChange.originalEndLineNumber = originalLineNumber; - prevChange.modifiedEndLineNumber = modifiedLineNumber; - if (this.shouldComputeCharChanges) { - prevChange.charChanges.push(new CharChange(originalLineNumber, originalStartColumn, originalLineNumber, originalEndColumn, modifiedLineNumber, modifiedStartColumn, modifiedLineNumber, modifiedEndColumn)); - } - return true; - } - return false; - }; - DiffComputer.prototype._continueProcessingPredicate = function () { - if (this.maximumRunTimeMs === 0) { - return true; - } - var now = (new Date()).getTime(); - return now - this.computationStartTime < this.maximumRunTimeMs; - }; - return DiffComputer; -}()); - +/*--------------------------------------------------------------------------------------------- + * Copyright (c) Microsoft Corporation. All rights reserved. + * Licensed under the MIT License. See License.txt in the project root for license information. + *--------------------------------------------------------------------------------------------*/ + + +var MINIMUM_MATCHING_CHARACTER_LENGTH = 3; +function computeDiff(originalSequence, modifiedSequence, continueProcessingPredicate, pretty) { + var diffAlgo = new _base_common_diff_diff_js__WEBPACK_IMPORTED_MODULE_0__["LcsDiff"](originalSequence, modifiedSequence, continueProcessingPredicate); + return diffAlgo.ComputeDiff(pretty); +} +var LineSequence = /** @class */ (function () { + function LineSequence(lines) { + var startColumns = []; + var endColumns = []; + for (var i = 0, length_1 = lines.length; i < length_1; i++) { + startColumns[i] = getFirstNonBlankColumn(lines[i], 1); + endColumns[i] = getLastNonBlankColumn(lines[i], 1); + } + this.lines = lines; + this._startColumns = startColumns; + this._endColumns = endColumns; + } + LineSequence.prototype.getElements = function () { + var elements = []; + for (var i = 0, len = this.lines.length; i < len; i++) { + elements[i] = this.lines[i].substring(this._startColumns[i] - 1, this._endColumns[i] - 1); + } + return elements; + }; + LineSequence.prototype.getStartLineNumber = function (i) { + return i + 1; + }; + LineSequence.prototype.getEndLineNumber = function (i) { + return i + 1; + }; + LineSequence.prototype.createCharSequence = function (shouldIgnoreTrimWhitespace, startIndex, endIndex) { + var charCodes = []; + var lineNumbers = []; + var columns = []; + var len = 0; + for (var index = startIndex; index <= endIndex; index++) { + var lineContent = this.lines[index]; + var startColumn = (shouldIgnoreTrimWhitespace ? this._startColumns[index] : 1); + var endColumn = (shouldIgnoreTrimWhitespace ? this._endColumns[index] : lineContent.length + 1); + for (var col = startColumn; col < endColumn; col++) { + charCodes[len] = lineContent.charCodeAt(col - 1); + lineNumbers[len] = index + 1; + columns[len] = col; + len++; + } + } + return new CharSequence(charCodes, lineNumbers, columns); + }; + return LineSequence; +}()); +var CharSequence = /** @class */ (function () { + function CharSequence(charCodes, lineNumbers, columns) { + this._charCodes = charCodes; + this._lineNumbers = lineNumbers; + this._columns = columns; + } + CharSequence.prototype.getElements = function () { + return this._charCodes; + }; + CharSequence.prototype.getStartLineNumber = function (i) { + return this._lineNumbers[i]; + }; + CharSequence.prototype.getStartColumn = function (i) { + return this._columns[i]; + }; + CharSequence.prototype.getEndLineNumber = function (i) { + return this._lineNumbers[i]; + }; + CharSequence.prototype.getEndColumn = function (i) { + return this._columns[i] + 1; + }; + return CharSequence; +}()); +var CharChange = /** @class */ (function () { + function CharChange(originalStartLineNumber, originalStartColumn, originalEndLineNumber, originalEndColumn, modifiedStartLineNumber, modifiedStartColumn, modifiedEndLineNumber, modifiedEndColumn) { + this.originalStartLineNumber = originalStartLineNumber; + this.originalStartColumn = originalStartColumn; + this.originalEndLineNumber = originalEndLineNumber; + this.originalEndColumn = originalEndColumn; + this.modifiedStartLineNumber = modifiedStartLineNumber; + this.modifiedStartColumn = modifiedStartColumn; + this.modifiedEndLineNumber = modifiedEndLineNumber; + this.modifiedEndColumn = modifiedEndColumn; + } + CharChange.createFromDiffChange = function (diffChange, originalCharSequence, modifiedCharSequence) { + var originalStartLineNumber; + var originalStartColumn; + var originalEndLineNumber; + var originalEndColumn; + var modifiedStartLineNumber; + var modifiedStartColumn; + var modifiedEndLineNumber; + var modifiedEndColumn; + if (diffChange.originalLength === 0) { + originalStartLineNumber = 0; + originalStartColumn = 0; + originalEndLineNumber = 0; + originalEndColumn = 0; + } + else { + originalStartLineNumber = originalCharSequence.getStartLineNumber(diffChange.originalStart); + originalStartColumn = originalCharSequence.getStartColumn(diffChange.originalStart); + originalEndLineNumber = originalCharSequence.getEndLineNumber(diffChange.originalStart + diffChange.originalLength - 1); + originalEndColumn = originalCharSequence.getEndColumn(diffChange.originalStart + diffChange.originalLength - 1); + } + if (diffChange.modifiedLength === 0) { + modifiedStartLineNumber = 0; + modifiedStartColumn = 0; + modifiedEndLineNumber = 0; + modifiedEndColumn = 0; + } + else { + modifiedStartLineNumber = modifiedCharSequence.getStartLineNumber(diffChange.modifiedStart); + modifiedStartColumn = modifiedCharSequence.getStartColumn(diffChange.modifiedStart); + modifiedEndLineNumber = modifiedCharSequence.getEndLineNumber(diffChange.modifiedStart + diffChange.modifiedLength - 1); + modifiedEndColumn = modifiedCharSequence.getEndColumn(diffChange.modifiedStart + diffChange.modifiedLength - 1); + } + return new CharChange(originalStartLineNumber, originalStartColumn, originalEndLineNumber, originalEndColumn, modifiedStartLineNumber, modifiedStartColumn, modifiedEndLineNumber, modifiedEndColumn); + }; + return CharChange; +}()); +function postProcessCharChanges(rawChanges) { + if (rawChanges.length <= 1) { + return rawChanges; + } + var result = [rawChanges[0]]; + var prevChange = result[0]; + for (var i = 1, len = rawChanges.length; i < len; i++) { + var currChange = rawChanges[i]; + var originalMatchingLength = currChange.originalStart - (prevChange.originalStart + prevChange.originalLength); + var modifiedMatchingLength = currChange.modifiedStart - (prevChange.modifiedStart + prevChange.modifiedLength); + // Both of the above should be equal, but the continueProcessingPredicate may prevent this from being true + var matchingLength = Math.min(originalMatchingLength, modifiedMatchingLength); + if (matchingLength < MINIMUM_MATCHING_CHARACTER_LENGTH) { + // Merge the current change into the previous one + prevChange.originalLength = (currChange.originalStart + currChange.originalLength) - prevChange.originalStart; + prevChange.modifiedLength = (currChange.modifiedStart + currChange.modifiedLength) - prevChange.modifiedStart; + } + else { + // Add the current change + result.push(currChange); + prevChange = currChange; + } + } + return result; +} +var LineChange = /** @class */ (function () { + function LineChange(originalStartLineNumber, originalEndLineNumber, modifiedStartLineNumber, modifiedEndLineNumber, charChanges) { + this.originalStartLineNumber = originalStartLineNumber; + this.originalEndLineNumber = originalEndLineNumber; + this.modifiedStartLineNumber = modifiedStartLineNumber; + this.modifiedEndLineNumber = modifiedEndLineNumber; + this.charChanges = charChanges; + } + LineChange.createFromDiffResult = function (shouldIgnoreTrimWhitespace, diffChange, originalLineSequence, modifiedLineSequence, continueCharDiff, shouldComputeCharChanges, shouldPostProcessCharChanges) { + var originalStartLineNumber; + var originalEndLineNumber; + var modifiedStartLineNumber; + var modifiedEndLineNumber; + var charChanges = undefined; + if (diffChange.originalLength === 0) { + originalStartLineNumber = originalLineSequence.getStartLineNumber(diffChange.originalStart) - 1; + originalEndLineNumber = 0; + } + else { + originalStartLineNumber = originalLineSequence.getStartLineNumber(diffChange.originalStart); + originalEndLineNumber = originalLineSequence.getEndLineNumber(diffChange.originalStart + diffChange.originalLength - 1); + } + if (diffChange.modifiedLength === 0) { + modifiedStartLineNumber = modifiedLineSequence.getStartLineNumber(diffChange.modifiedStart) - 1; + modifiedEndLineNumber = 0; + } + else { + modifiedStartLineNumber = modifiedLineSequence.getStartLineNumber(diffChange.modifiedStart); + modifiedEndLineNumber = modifiedLineSequence.getEndLineNumber(diffChange.modifiedStart + diffChange.modifiedLength - 1); + } + if (shouldComputeCharChanges && diffChange.originalLength > 0 && diffChange.originalLength < 20 && diffChange.modifiedLength > 0 && diffChange.modifiedLength < 20 && continueCharDiff()) { + // Compute character changes for diff chunks of at most 20 lines... + var originalCharSequence = originalLineSequence.createCharSequence(shouldIgnoreTrimWhitespace, diffChange.originalStart, diffChange.originalStart + diffChange.originalLength - 1); + var modifiedCharSequence = modifiedLineSequence.createCharSequence(shouldIgnoreTrimWhitespace, diffChange.modifiedStart, diffChange.modifiedStart + diffChange.modifiedLength - 1); + var rawChanges = computeDiff(originalCharSequence, modifiedCharSequence, continueCharDiff, true).changes; + if (shouldPostProcessCharChanges) { + rawChanges = postProcessCharChanges(rawChanges); + } + charChanges = []; + for (var i = 0, length_2 = rawChanges.length; i < length_2; i++) { + charChanges.push(CharChange.createFromDiffChange(rawChanges[i], originalCharSequence, modifiedCharSequence)); + } + } + return new LineChange(originalStartLineNumber, originalEndLineNumber, modifiedStartLineNumber, modifiedEndLineNumber, charChanges); + }; + return LineChange; +}()); +var DiffComputer = /** @class */ (function () { + function DiffComputer(originalLines, modifiedLines, opts) { + this.shouldComputeCharChanges = opts.shouldComputeCharChanges; + this.shouldPostProcessCharChanges = opts.shouldPostProcessCharChanges; + this.shouldIgnoreTrimWhitespace = opts.shouldIgnoreTrimWhitespace; + this.shouldMakePrettyDiff = opts.shouldMakePrettyDiff; + this.originalLines = originalLines; + this.modifiedLines = modifiedLines; + this.original = new LineSequence(originalLines); + this.modified = new LineSequence(modifiedLines); + this.continueLineDiff = createContinueProcessingPredicate(opts.maxComputationTime); + this.continueCharDiff = createContinueProcessingPredicate(opts.maxComputationTime === 0 ? 0 : Math.min(opts.maxComputationTime, 5000)); // never run after 5s for character changes... + } + DiffComputer.prototype.computeDiff = function () { + if (this.original.lines.length === 1 && this.original.lines[0].length === 0) { + // empty original => fast path + return { + quitEarly: false, + changes: [{ + originalStartLineNumber: 1, + originalEndLineNumber: 1, + modifiedStartLineNumber: 1, + modifiedEndLineNumber: this.modified.lines.length, + charChanges: [{ + modifiedEndColumn: 0, + modifiedEndLineNumber: 0, + modifiedStartColumn: 0, + modifiedStartLineNumber: 0, + originalEndColumn: 0, + originalEndLineNumber: 0, + originalStartColumn: 0, + originalStartLineNumber: 0 + }] + }] + }; + } + if (this.modified.lines.length === 1 && this.modified.lines[0].length === 0) { + // empty modified => fast path + return { + quitEarly: false, + changes: [{ + originalStartLineNumber: 1, + originalEndLineNumber: this.original.lines.length, + modifiedStartLineNumber: 1, + modifiedEndLineNumber: 1, + charChanges: [{ + modifiedEndColumn: 0, + modifiedEndLineNumber: 0, + modifiedStartColumn: 0, + modifiedStartLineNumber: 0, + originalEndColumn: 0, + originalEndLineNumber: 0, + originalStartColumn: 0, + originalStartLineNumber: 0 + }] + }] + }; + } + var diffResult = computeDiff(this.original, this.modified, this.continueLineDiff, this.shouldMakePrettyDiff); + var rawChanges = diffResult.changes; + var quitEarly = diffResult.quitEarly; + // The diff is always computed with ignoring trim whitespace + // This ensures we get the prettiest diff + if (this.shouldIgnoreTrimWhitespace) { + var lineChanges = []; + for (var i = 0, length_3 = rawChanges.length; i < length_3; i++) { + lineChanges.push(LineChange.createFromDiffResult(this.shouldIgnoreTrimWhitespace, rawChanges[i], this.original, this.modified, this.continueCharDiff, this.shouldComputeCharChanges, this.shouldPostProcessCharChanges)); + } + return { + quitEarly: quitEarly, + changes: lineChanges + }; + } + // Need to post-process and introduce changes where the trim whitespace is different + // Note that we are looping starting at -1 to also cover the lines before the first change + var result = []; + var originalLineIndex = 0; + var modifiedLineIndex = 0; + for (var i = -1 /* !!!! */, len = rawChanges.length; i < len; i++) { + var nextChange = (i + 1 < len ? rawChanges[i + 1] : null); + var originalStop = (nextChange ? nextChange.originalStart : this.originalLines.length); + var modifiedStop = (nextChange ? nextChange.modifiedStart : this.modifiedLines.length); + while (originalLineIndex < originalStop && modifiedLineIndex < modifiedStop) { + var originalLine = this.originalLines[originalLineIndex]; + var modifiedLine = this.modifiedLines[modifiedLineIndex]; + if (originalLine !== modifiedLine) { + // These lines differ only in trim whitespace + // Check the leading whitespace + { + var originalStartColumn = getFirstNonBlankColumn(originalLine, 1); + var modifiedStartColumn = getFirstNonBlankColumn(modifiedLine, 1); + while (originalStartColumn > 1 && modifiedStartColumn > 1) { + var originalChar = originalLine.charCodeAt(originalStartColumn - 2); + var modifiedChar = modifiedLine.charCodeAt(modifiedStartColumn - 2); + if (originalChar !== modifiedChar) { + break; + } + originalStartColumn--; + modifiedStartColumn--; + } + if (originalStartColumn > 1 || modifiedStartColumn > 1) { + this._pushTrimWhitespaceCharChange(result, originalLineIndex + 1, 1, originalStartColumn, modifiedLineIndex + 1, 1, modifiedStartColumn); + } + } + // Check the trailing whitespace + { + var originalEndColumn = getLastNonBlankColumn(originalLine, 1); + var modifiedEndColumn = getLastNonBlankColumn(modifiedLine, 1); + var originalMaxColumn = originalLine.length + 1; + var modifiedMaxColumn = modifiedLine.length + 1; + while (originalEndColumn < originalMaxColumn && modifiedEndColumn < modifiedMaxColumn) { + var originalChar = originalLine.charCodeAt(originalEndColumn - 1); + var modifiedChar = originalLine.charCodeAt(modifiedEndColumn - 1); + if (originalChar !== modifiedChar) { + break; + } + originalEndColumn++; + modifiedEndColumn++; + } + if (originalEndColumn < originalMaxColumn || modifiedEndColumn < modifiedMaxColumn) { + this._pushTrimWhitespaceCharChange(result, originalLineIndex + 1, originalEndColumn, originalMaxColumn, modifiedLineIndex + 1, modifiedEndColumn, modifiedMaxColumn); + } + } + } + originalLineIndex++; + modifiedLineIndex++; + } + if (nextChange) { + // Emit the actual change + result.push(LineChange.createFromDiffResult(this.shouldIgnoreTrimWhitespace, nextChange, this.original, this.modified, this.continueCharDiff, this.shouldComputeCharChanges, this.shouldPostProcessCharChanges)); + originalLineIndex += nextChange.originalLength; + modifiedLineIndex += nextChange.modifiedLength; + } + } + return { + quitEarly: quitEarly, + changes: result + }; + }; + DiffComputer.prototype._pushTrimWhitespaceCharChange = function (result, originalLineNumber, originalStartColumn, originalEndColumn, modifiedLineNumber, modifiedStartColumn, modifiedEndColumn) { + if (this._mergeTrimWhitespaceCharChange(result, originalLineNumber, originalStartColumn, originalEndColumn, modifiedLineNumber, modifiedStartColumn, modifiedEndColumn)) { + // Merged into previous + return; + } + var charChanges = undefined; + if (this.shouldComputeCharChanges) { + charChanges = [new CharChange(originalLineNumber, originalStartColumn, originalLineNumber, originalEndColumn, modifiedLineNumber, modifiedStartColumn, modifiedLineNumber, modifiedEndColumn)]; + } + result.push(new LineChange(originalLineNumber, originalLineNumber, modifiedLineNumber, modifiedLineNumber, charChanges)); + }; + DiffComputer.prototype._mergeTrimWhitespaceCharChange = function (result, originalLineNumber, originalStartColumn, originalEndColumn, modifiedLineNumber, modifiedStartColumn, modifiedEndColumn) { + var len = result.length; + if (len === 0) { + return false; + } + var prevChange = result[len - 1]; + if (prevChange.originalEndLineNumber === 0 || prevChange.modifiedEndLineNumber === 0) { + // Don't merge with inserts/deletes + return false; + } + if (prevChange.originalEndLineNumber + 1 === originalLineNumber && prevChange.modifiedEndLineNumber + 1 === modifiedLineNumber) { + prevChange.originalEndLineNumber = originalLineNumber; + prevChange.modifiedEndLineNumber = modifiedLineNumber; + if (this.shouldComputeCharChanges && prevChange.charChanges) { + prevChange.charChanges.push(new CharChange(originalLineNumber, originalStartColumn, originalLineNumber, originalEndColumn, modifiedLineNumber, modifiedStartColumn, modifiedLineNumber, modifiedEndColumn)); + } + return true; + } + return false; + }; + return DiffComputer; +}()); + +function getFirstNonBlankColumn(txt, defaultValue) { + var r = _base_common_strings_js__WEBPACK_IMPORTED_MODULE_1__["firstNonWhitespaceIndex"](txt); + if (r === -1) { + return defaultValue; + } + return r + 1; +} +function getLastNonBlankColumn(txt, defaultValue) { + var r = _base_common_strings_js__WEBPACK_IMPORTED_MODULE_1__["lastNonWhitespaceIndex"](txt); + if (r === -1) { + return defaultValue; + } + return r + 2; +} +function createContinueProcessingPredicate(maximumRuntime) { + if (maximumRuntime === 0) { + return function () { return true; }; + } + var startTime = Date.now(); + return function () { + return Date.now() - startTime < maximumRuntime; + }; +} /***/ }), @@ -5916,114 +6637,114 @@ __webpack_require__.r(__webpack_exports__); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "MirrorTextModel", function() { return MirrorTextModel; }); /* harmony import */ var _core_position_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../core/position.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/position.js"); /* harmony import */ var _viewModel_prefixSumComputer_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../viewModel/prefixSumComputer.js */ "./node_modules/monaco-editor/esm/vs/editor/common/viewModel/prefixSumComputer.js"); -/*--------------------------------------------------------------------------------------------- - * Copyright (c) Microsoft Corporation. All rights reserved. - * Licensed under the MIT License. See License.txt in the project root for license information. - *--------------------------------------------------------------------------------------------*/ - - -var MirrorTextModel = /** @class */ (function () { - function MirrorTextModel(uri, lines, eol, versionId) { - this._uri = uri; - this._lines = lines; - this._eol = eol; - this._versionId = versionId; - this._lineStarts = null; - } - MirrorTextModel.prototype.dispose = function () { - this._lines.length = 0; - }; - MirrorTextModel.prototype.getText = function () { - return this._lines.join(this._eol); - }; - MirrorTextModel.prototype.onEvents = function (e) { - if (e.eol && e.eol !== this._eol) { - this._eol = e.eol; - this._lineStarts = null; - } - // Update my lines - var changes = e.changes; - for (var _i = 0, changes_1 = changes; _i < changes_1.length; _i++) { - var change = changes_1[_i]; - this._acceptDeleteRange(change.range); - this._acceptInsertText(new _core_position_js__WEBPACK_IMPORTED_MODULE_0__["Position"](change.range.startLineNumber, change.range.startColumn), change.text); - } - this._versionId = e.versionId; - }; - MirrorTextModel.prototype._ensureLineStarts = function () { - if (!this._lineStarts) { - var eolLength = this._eol.length; - var linesLength = this._lines.length; - var lineStartValues = new Uint32Array(linesLength); - for (var i = 0; i < linesLength; i++) { - lineStartValues[i] = this._lines[i].length + eolLength; - } - this._lineStarts = new _viewModel_prefixSumComputer_js__WEBPACK_IMPORTED_MODULE_1__["PrefixSumComputer"](lineStartValues); - } - }; - /** - * All changes to a line's text go through this method - */ - MirrorTextModel.prototype._setLineText = function (lineIndex, newValue) { - this._lines[lineIndex] = newValue; - if (this._lineStarts) { - // update prefix sum - this._lineStarts.changeValue(lineIndex, this._lines[lineIndex].length + this._eol.length); - } - }; - MirrorTextModel.prototype._acceptDeleteRange = function (range) { - if (range.startLineNumber === range.endLineNumber) { - if (range.startColumn === range.endColumn) { - // Nothing to delete - return; - } - // Delete text on the affected line - this._setLineText(range.startLineNumber - 1, this._lines[range.startLineNumber - 1].substring(0, range.startColumn - 1) - + this._lines[range.startLineNumber - 1].substring(range.endColumn - 1)); - return; - } - // Take remaining text on last line and append it to remaining text on first line - this._setLineText(range.startLineNumber - 1, this._lines[range.startLineNumber - 1].substring(0, range.startColumn - 1) - + this._lines[range.endLineNumber - 1].substring(range.endColumn - 1)); - // Delete middle lines - this._lines.splice(range.startLineNumber, range.endLineNumber - range.startLineNumber); - if (this._lineStarts) { - // update prefix sum - this._lineStarts.removeValues(range.startLineNumber, range.endLineNumber - range.startLineNumber); - } - }; - MirrorTextModel.prototype._acceptInsertText = function (position, insertText) { - if (insertText.length === 0) { - // Nothing to insert - return; - } - var insertLines = insertText.split(/\r\n|\r|\n/); - if (insertLines.length === 1) { - // Inserting text on one line - this._setLineText(position.lineNumber - 1, this._lines[position.lineNumber - 1].substring(0, position.column - 1) - + insertLines[0] - + this._lines[position.lineNumber - 1].substring(position.column - 1)); - return; - } - // Append overflowing text from first line to the end of text to insert - insertLines[insertLines.length - 1] += this._lines[position.lineNumber - 1].substring(position.column - 1); - // Delete overflowing text from first line and insert text on first line - this._setLineText(position.lineNumber - 1, this._lines[position.lineNumber - 1].substring(0, position.column - 1) - + insertLines[0]); - // Insert new lines & store lengths - var newLengths = new Uint32Array(insertLines.length - 1); - for (var i = 1; i < insertLines.length; i++) { - this._lines.splice(position.lineNumber + i - 1, 0, insertLines[i]); - newLengths[i - 1] = insertLines[i].length + this._eol.length; - } - if (this._lineStarts) { - // update prefix sum - this._lineStarts.insertValues(position.lineNumber, newLengths); - } - }; - return MirrorTextModel; -}()); - +/*--------------------------------------------------------------------------------------------- + * Copyright (c) Microsoft Corporation. All rights reserved. + * Licensed under the MIT License. See License.txt in the project root for license information. + *--------------------------------------------------------------------------------------------*/ + + +var MirrorTextModel = /** @class */ (function () { + function MirrorTextModel(uri, lines, eol, versionId) { + this._uri = uri; + this._lines = lines; + this._eol = eol; + this._versionId = versionId; + this._lineStarts = null; + } + MirrorTextModel.prototype.dispose = function () { + this._lines.length = 0; + }; + MirrorTextModel.prototype.getText = function () { + return this._lines.join(this._eol); + }; + MirrorTextModel.prototype.onEvents = function (e) { + if (e.eol && e.eol !== this._eol) { + this._eol = e.eol; + this._lineStarts = null; + } + // Update my lines + var changes = e.changes; + for (var _i = 0, changes_1 = changes; _i < changes_1.length; _i++) { + var change = changes_1[_i]; + this._acceptDeleteRange(change.range); + this._acceptInsertText(new _core_position_js__WEBPACK_IMPORTED_MODULE_0__["Position"](change.range.startLineNumber, change.range.startColumn), change.text); + } + this._versionId = e.versionId; + }; + MirrorTextModel.prototype._ensureLineStarts = function () { + if (!this._lineStarts) { + var eolLength = this._eol.length; + var linesLength = this._lines.length; + var lineStartValues = new Uint32Array(linesLength); + for (var i = 0; i < linesLength; i++) { + lineStartValues[i] = this._lines[i].length + eolLength; + } + this._lineStarts = new _viewModel_prefixSumComputer_js__WEBPACK_IMPORTED_MODULE_1__["PrefixSumComputer"](lineStartValues); + } + }; + /** + * All changes to a line's text go through this method + */ + MirrorTextModel.prototype._setLineText = function (lineIndex, newValue) { + this._lines[lineIndex] = newValue; + if (this._lineStarts) { + // update prefix sum + this._lineStarts.changeValue(lineIndex, this._lines[lineIndex].length + this._eol.length); + } + }; + MirrorTextModel.prototype._acceptDeleteRange = function (range) { + if (range.startLineNumber === range.endLineNumber) { + if (range.startColumn === range.endColumn) { + // Nothing to delete + return; + } + // Delete text on the affected line + this._setLineText(range.startLineNumber - 1, this._lines[range.startLineNumber - 1].substring(0, range.startColumn - 1) + + this._lines[range.startLineNumber - 1].substring(range.endColumn - 1)); + return; + } + // Take remaining text on last line and append it to remaining text on first line + this._setLineText(range.startLineNumber - 1, this._lines[range.startLineNumber - 1].substring(0, range.startColumn - 1) + + this._lines[range.endLineNumber - 1].substring(range.endColumn - 1)); + // Delete middle lines + this._lines.splice(range.startLineNumber, range.endLineNumber - range.startLineNumber); + if (this._lineStarts) { + // update prefix sum + this._lineStarts.removeValues(range.startLineNumber, range.endLineNumber - range.startLineNumber); + } + }; + MirrorTextModel.prototype._acceptInsertText = function (position, insertText) { + if (insertText.length === 0) { + // Nothing to insert + return; + } + var insertLines = insertText.split(/\r\n|\r|\n/); + if (insertLines.length === 1) { + // Inserting text on one line + this._setLineText(position.lineNumber - 1, this._lines[position.lineNumber - 1].substring(0, position.column - 1) + + insertLines[0] + + this._lines[position.lineNumber - 1].substring(position.column - 1)); + return; + } + // Append overflowing text from first line to the end of text to insert + insertLines[insertLines.length - 1] += this._lines[position.lineNumber - 1].substring(position.column - 1); + // Delete overflowing text from first line and insert text on first line + this._setLineText(position.lineNumber - 1, this._lines[position.lineNumber - 1].substring(0, position.column - 1) + + insertLines[0]); + // Insert new lines & store lengths + var newLengths = new Uint32Array(insertLines.length - 1); + for (var i = 1; i < insertLines.length; i++) { + this._lines.splice(position.lineNumber + i - 1, 0, insertLines[i]); + newLengths[i - 1] = insertLines[i].length + this._eol.length; + } + if (this._lineStarts) { + // update prefix sum + this._lineStarts.insertValues(position.lineNumber, newLengths); + } + }; + return MirrorTextModel; +}()); + /***/ }), @@ -6041,118 +6762,118 @@ __webpack_require__.r(__webpack_exports__); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "DEFAULT_WORD_REGEXP", function() { return DEFAULT_WORD_REGEXP; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "ensureValidWordDefinition", function() { return ensureValidWordDefinition; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "getWordAtText", function() { return getWordAtText; }); -/*--------------------------------------------------------------------------------------------- - * Copyright (c) Microsoft Corporation. All rights reserved. - * Licensed under the MIT License. See License.txt in the project root for license information. - *--------------------------------------------------------------------------------------------*/ -var USUAL_WORD_SEPARATORS = '`~!@#$%^&*()-=+[{]}\\|;:\'",.<>/?'; -/** - * Create a word definition regular expression based on default word separators. - * Optionally provide allowed separators that should be included in words. - * - * The default would look like this: - * /(-?\d*\.\d\w*)|([^\`\~\!\@\#\$\%\^\&\*\(\)\-\=\+\[\{\]\}\\\|\;\:\'\"\,\.\<\>\/\?\s]+)/g - */ -function createWordRegExp(allowInWords) { - if (allowInWords === void 0) { allowInWords = ''; } - var source = '(-?\\d*\\.\\d\\w*)|([^'; - for (var _i = 0, USUAL_WORD_SEPARATORS_1 = USUAL_WORD_SEPARATORS; _i < USUAL_WORD_SEPARATORS_1.length; _i++) { - var sep = USUAL_WORD_SEPARATORS_1[_i]; - if (allowInWords.indexOf(sep) >= 0) { - continue; - } - source += '\\' + sep; - } - source += '\\s]+)'; - return new RegExp(source, 'g'); -} -// catches numbers (including floating numbers) in the first group, and alphanum in the second -var DEFAULT_WORD_REGEXP = createWordRegExp(); -function ensureValidWordDefinition(wordDefinition) { - var result = DEFAULT_WORD_REGEXP; - if (wordDefinition && (wordDefinition instanceof RegExp)) { - if (!wordDefinition.global) { - var flags = 'g'; - if (wordDefinition.ignoreCase) { - flags += 'i'; - } - if (wordDefinition.multiline) { - flags += 'm'; - } - if (wordDefinition.unicode) { - flags += 'u'; - } - result = new RegExp(wordDefinition.source, flags); - } - else { - result = wordDefinition; - } - } - result.lastIndex = 0; - return result; -} -function getWordAtPosFast(column, wordDefinition, text, textOffset) { - // find whitespace enclosed text around column and match from there - var pos = column - 1 - textOffset; - var start = text.lastIndexOf(' ', pos - 1) + 1; - wordDefinition.lastIndex = start; - var match; - while (match = wordDefinition.exec(text)) { - var matchIndex = match.index || 0; - if (matchIndex <= pos && wordDefinition.lastIndex >= pos) { - return { - word: match[0], - startColumn: textOffset + 1 + matchIndex, - endColumn: textOffset + 1 + wordDefinition.lastIndex - }; - } - } - return null; -} -function getWordAtPosSlow(column, wordDefinition, text, textOffset) { - // matches all words starting at the beginning - // of the input until it finds a match that encloses - // the desired column. slow but correct - var pos = column - 1 - textOffset; - wordDefinition.lastIndex = 0; - var match; - while (match = wordDefinition.exec(text)) { - var matchIndex = match.index || 0; - if (matchIndex > pos) { - // |nW -> matched only after the pos - return null; - } - else if (wordDefinition.lastIndex >= pos) { - // W|W -> match encloses pos - return { - word: match[0], - startColumn: textOffset + 1 + matchIndex, - endColumn: textOffset + 1 + wordDefinition.lastIndex - }; - } - } - return null; -} -function getWordAtText(column, wordDefinition, text, textOffset) { - // if `words` can contain whitespace character we have to use the slow variant - // otherwise we use the fast variant of finding a word - wordDefinition.lastIndex = 0; - var match = wordDefinition.exec(text); - if (!match) { - return null; - } - // todo@joh the `match` could already be the (first) word - var ret = match[0].indexOf(' ') >= 0 - // did match a word which contains a space character -> use slow word find - ? getWordAtPosSlow(column, wordDefinition, text, textOffset) - // sane word definition -> use fast word find - : getWordAtPosFast(column, wordDefinition, text, textOffset); - // both (getWordAtPosFast and getWordAtPosSlow) leave the wordDefinition-RegExp - // in an undefined state and to not confuse other users of the wordDefinition - // we reset the lastIndex - wordDefinition.lastIndex = 0; - return ret; -} +/*--------------------------------------------------------------------------------------------- + * Copyright (c) Microsoft Corporation. All rights reserved. + * Licensed under the MIT License. See License.txt in the project root for license information. + *--------------------------------------------------------------------------------------------*/ +var USUAL_WORD_SEPARATORS = '`~!@#$%^&*()-=+[{]}\\|;:\'",.<>/?'; +/** + * Create a word definition regular expression based on default word separators. + * Optionally provide allowed separators that should be included in words. + * + * The default would look like this: + * /(-?\d*\.\d\w*)|([^\`\~\!\@\#\$\%\^\&\*\(\)\-\=\+\[\{\]\}\\\|\;\:\'\"\,\.\<\>\/\?\s]+)/g + */ +function createWordRegExp(allowInWords) { + if (allowInWords === void 0) { allowInWords = ''; } + var source = '(-?\\d*\\.\\d\\w*)|([^'; + for (var _i = 0, USUAL_WORD_SEPARATORS_1 = USUAL_WORD_SEPARATORS; _i < USUAL_WORD_SEPARATORS_1.length; _i++) { + var sep = USUAL_WORD_SEPARATORS_1[_i]; + if (allowInWords.indexOf(sep) >= 0) { + continue; + } + source += '\\' + sep; + } + source += '\\s]+)'; + return new RegExp(source, 'g'); +} +// catches numbers (including floating numbers) in the first group, and alphanum in the second +var DEFAULT_WORD_REGEXP = createWordRegExp(); +function ensureValidWordDefinition(wordDefinition) { + var result = DEFAULT_WORD_REGEXP; + if (wordDefinition && (wordDefinition instanceof RegExp)) { + if (!wordDefinition.global) { + var flags = 'g'; + if (wordDefinition.ignoreCase) { + flags += 'i'; + } + if (wordDefinition.multiline) { + flags += 'm'; + } + if (wordDefinition.unicode) { + flags += 'u'; + } + result = new RegExp(wordDefinition.source, flags); + } + else { + result = wordDefinition; + } + } + result.lastIndex = 0; + return result; +} +function getWordAtPosFast(column, wordDefinition, text, textOffset) { + // find whitespace enclosed text around column and match from there + var pos = column - 1 - textOffset; + var start = text.lastIndexOf(' ', pos - 1) + 1; + wordDefinition.lastIndex = start; + var match; + while (match = wordDefinition.exec(text)) { + var matchIndex = match.index || 0; + if (matchIndex <= pos && wordDefinition.lastIndex >= pos) { + return { + word: match[0], + startColumn: textOffset + 1 + matchIndex, + endColumn: textOffset + 1 + wordDefinition.lastIndex + }; + } + } + return null; +} +function getWordAtPosSlow(column, wordDefinition, text, textOffset) { + // matches all words starting at the beginning + // of the input until it finds a match that encloses + // the desired column. slow but correct + var pos = column - 1 - textOffset; + wordDefinition.lastIndex = 0; + var match; + while (match = wordDefinition.exec(text)) { + var matchIndex = match.index || 0; + if (matchIndex > pos) { + // |nW -> matched only after the pos + return null; + } + else if (wordDefinition.lastIndex >= pos) { + // W|W -> match encloses pos + return { + word: match[0], + startColumn: textOffset + 1 + matchIndex, + endColumn: textOffset + 1 + wordDefinition.lastIndex + }; + } + } + return null; +} +function getWordAtText(column, wordDefinition, text, textOffset) { + // if `words` can contain whitespace character we have to use the slow variant + // otherwise we use the fast variant of finding a word + wordDefinition.lastIndex = 0; + var match = wordDefinition.exec(text); + if (!match) { + return null; + } + // todo@joh the `match` could already be the (first) word + var ret = match[0].indexOf(' ') >= 0 + // did match a word which contains a space character -> use slow word find + ? getWordAtPosSlow(column, wordDefinition, text, textOffset) + // sane word definition -> use fast word find + : getWordAtPosFast(column, wordDefinition, text, textOffset); + // both (getWordAtPosFast and getWordAtPosSlow) leave the wordDefinition-RegExp + // in an undefined state and to not confuse other users of the wordDefinition + // we reset the lastIndex + wordDefinition.lastIndex = 0; + return ret; +} /***/ }), @@ -6161,256 +6882,278 @@ function getWordAtText(column, wordDefinition, text, textOffset) { /*!*******************************************************************************!*\ !*** ./node_modules/monaco-editor/esm/vs/editor/common/modes/linkComputer.js ***! \*******************************************************************************/ -/*! exports provided: StateMachine, LinkComputer, computeLinks */ +/*! exports provided: Uint8Matrix, StateMachine, LinkComputer, computeLinks */ /***/ (function(module, __webpack_exports__, __webpack_require__) { "use strict"; __webpack_require__.r(__webpack_exports__); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "Uint8Matrix", function() { return Uint8Matrix; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "StateMachine", function() { return StateMachine; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "LinkComputer", function() { return LinkComputer; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "computeLinks", function() { return computeLinks; }); /* harmony import */ var _core_characterClassifier_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../core/characterClassifier.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/characterClassifier.js"); -/* harmony import */ var _core_uint_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../core/uint.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/uint.js"); -/*--------------------------------------------------------------------------------------------- - * Copyright (c) Microsoft Corporation. All rights reserved. - * Licensed under the MIT License. See License.txt in the project root for license information. - *--------------------------------------------------------------------------------------------*/ - - -var StateMachine = /** @class */ (function () { - function StateMachine(edges) { - var maxCharCode = 0; - var maxState = 0 /* Invalid */; - for (var i = 0, len = edges.length; i < len; i++) { - var _a = edges[i], from = _a[0], chCode = _a[1], to = _a[2]; - if (chCode > maxCharCode) { - maxCharCode = chCode; - } - if (from > maxState) { - maxState = from; - } - if (to > maxState) { - maxState = to; - } - } - maxCharCode++; - maxState++; - var states = new _core_uint_js__WEBPACK_IMPORTED_MODULE_1__["Uint8Matrix"](maxState, maxCharCode, 0 /* Invalid */); - for (var i = 0, len = edges.length; i < len; i++) { - var _b = edges[i], from = _b[0], chCode = _b[1], to = _b[2]; - states.set(from, chCode, to); - } - this._states = states; - this._maxCharCode = maxCharCode; - } - StateMachine.prototype.nextState = function (currentState, chCode) { - if (chCode < 0 || chCode >= this._maxCharCode) { - return 0 /* Invalid */; - } - return this._states.get(currentState, chCode); - }; - return StateMachine; -}()); - -// State machine for http:// or https:// or file:// -var _stateMachine = null; -function getStateMachine() { - if (_stateMachine === null) { - _stateMachine = new StateMachine([ - [1 /* Start */, 104 /* h */, 2 /* H */], - [1 /* Start */, 72 /* H */, 2 /* H */], - [1 /* Start */, 102 /* f */, 6 /* F */], - [1 /* Start */, 70 /* F */, 6 /* F */], - [2 /* H */, 116 /* t */, 3 /* HT */], - [2 /* H */, 84 /* T */, 3 /* HT */], - [3 /* HT */, 116 /* t */, 4 /* HTT */], - [3 /* HT */, 84 /* T */, 4 /* HTT */], - [4 /* HTT */, 112 /* p */, 5 /* HTTP */], - [4 /* HTT */, 80 /* P */, 5 /* HTTP */], - [5 /* HTTP */, 115 /* s */, 9 /* BeforeColon */], - [5 /* HTTP */, 83 /* S */, 9 /* BeforeColon */], - [5 /* HTTP */, 58 /* Colon */, 10 /* AfterColon */], - [6 /* F */, 105 /* i */, 7 /* FI */], - [6 /* F */, 73 /* I */, 7 /* FI */], - [7 /* FI */, 108 /* l */, 8 /* FIL */], - [7 /* FI */, 76 /* L */, 8 /* FIL */], - [8 /* FIL */, 101 /* e */, 9 /* BeforeColon */], - [8 /* FIL */, 69 /* E */, 9 /* BeforeColon */], - [9 /* BeforeColon */, 58 /* Colon */, 10 /* AfterColon */], - [10 /* AfterColon */, 47 /* Slash */, 11 /* AlmostThere */], - [11 /* AlmostThere */, 47 /* Slash */, 12 /* End */], - ]); - } - return _stateMachine; -} -var _classifier = null; -function getClassifier() { - if (_classifier === null) { - _classifier = new _core_characterClassifier_js__WEBPACK_IMPORTED_MODULE_0__["CharacterClassifier"](0 /* None */); - var FORCE_TERMINATION_CHARACTERS = ' \t<>\'\"、。。、,.:;?!@#$%&*‘“〈《「『【〔([{「」}])〕】』」》〉”’`~…'; - for (var i = 0; i < FORCE_TERMINATION_CHARACTERS.length; i++) { - _classifier.set(FORCE_TERMINATION_CHARACTERS.charCodeAt(i), 1 /* ForceTermination */); - } - var CANNOT_END_WITH_CHARACTERS = '.,;'; - for (var i = 0; i < CANNOT_END_WITH_CHARACTERS.length; i++) { - _classifier.set(CANNOT_END_WITH_CHARACTERS.charCodeAt(i), 2 /* CannotEndIn */); - } - } - return _classifier; -} -var LinkComputer = /** @class */ (function () { - function LinkComputer() { - } - LinkComputer._createLink = function (classifier, line, lineNumber, linkBeginIndex, linkEndIndex) { - // Do not allow to end link in certain characters... - var lastIncludedCharIndex = linkEndIndex - 1; - do { - var chCode = line.charCodeAt(lastIncludedCharIndex); - var chClass = classifier.get(chCode); - if (chClass !== 2 /* CannotEndIn */) { - break; - } - lastIncludedCharIndex--; - } while (lastIncludedCharIndex > linkBeginIndex); - // Handle links enclosed in parens, square brackets and curlys. - if (linkBeginIndex > 0) { - var charCodeBeforeLink = line.charCodeAt(linkBeginIndex - 1); - var lastCharCodeInLink = line.charCodeAt(lastIncludedCharIndex); - if ((charCodeBeforeLink === 40 /* OpenParen */ && lastCharCodeInLink === 41 /* CloseParen */) - || (charCodeBeforeLink === 91 /* OpenSquareBracket */ && lastCharCodeInLink === 93 /* CloseSquareBracket */) - || (charCodeBeforeLink === 123 /* OpenCurlyBrace */ && lastCharCodeInLink === 125 /* CloseCurlyBrace */)) { - // Do not end in ) if ( is before the link start - // Do not end in ] if [ is before the link start - // Do not end in } if { is before the link start - lastIncludedCharIndex--; - } - } - return { - range: { - startLineNumber: lineNumber, - startColumn: linkBeginIndex + 1, - endLineNumber: lineNumber, - endColumn: lastIncludedCharIndex + 2 - }, - url: line.substring(linkBeginIndex, lastIncludedCharIndex + 1) - }; - }; - LinkComputer.computeLinks = function (model, stateMachine) { - if (stateMachine === void 0) { stateMachine = getStateMachine(); } - var classifier = getClassifier(); - var result = []; - for (var i = 1, lineCount = model.getLineCount(); i <= lineCount; i++) { - var line = model.getLineContent(i); - var len = line.length; - var j = 0; - var linkBeginIndex = 0; - var linkBeginChCode = 0; - var state = 1 /* Start */; - var hasOpenParens = false; - var hasOpenSquareBracket = false; - var hasOpenCurlyBracket = false; - while (j < len) { - var resetStateMachine = false; - var chCode = line.charCodeAt(j); - if (state === 13 /* Accept */) { - var chClass = void 0; - switch (chCode) { - case 40 /* OpenParen */: - hasOpenParens = true; - chClass = 0 /* None */; - break; - case 41 /* CloseParen */: - chClass = (hasOpenParens ? 0 /* None */ : 1 /* ForceTermination */); - break; - case 91 /* OpenSquareBracket */: - hasOpenSquareBracket = true; - chClass = 0 /* None */; - break; - case 93 /* CloseSquareBracket */: - chClass = (hasOpenSquareBracket ? 0 /* None */ : 1 /* ForceTermination */); - break; - case 123 /* OpenCurlyBrace */: - hasOpenCurlyBracket = true; - chClass = 0 /* None */; - break; - case 125 /* CloseCurlyBrace */: - chClass = (hasOpenCurlyBracket ? 0 /* None */ : 1 /* ForceTermination */); - break; - /* The following three rules make it that ' or " or ` are allowed inside links if the link began with a different one */ - case 39 /* SingleQuote */: - chClass = (linkBeginChCode === 34 /* DoubleQuote */ || linkBeginChCode === 96 /* BackTick */) ? 0 /* None */ : 1 /* ForceTermination */; - break; - case 34 /* DoubleQuote */: - chClass = (linkBeginChCode === 39 /* SingleQuote */ || linkBeginChCode === 96 /* BackTick */) ? 0 /* None */ : 1 /* ForceTermination */; - break; - case 96 /* BackTick */: - chClass = (linkBeginChCode === 39 /* SingleQuote */ || linkBeginChCode === 34 /* DoubleQuote */) ? 0 /* None */ : 1 /* ForceTermination */; - break; - default: - chClass = classifier.get(chCode); - } - // Check if character terminates link - if (chClass === 1 /* ForceTermination */) { - result.push(LinkComputer._createLink(classifier, line, i, linkBeginIndex, j)); - resetStateMachine = true; - } - } - else if (state === 12 /* End */) { - var chClass = void 0; - if (chCode === 91 /* OpenSquareBracket */) { - // Allow for the authority part to contain ipv6 addresses which contain [ and ] - hasOpenSquareBracket = true; - chClass = 0 /* None */; - } - else { - chClass = classifier.get(chCode); - } - // Check if character terminates link - if (chClass === 1 /* ForceTermination */) { - resetStateMachine = true; - } - else { - state = 13 /* Accept */; - } - } - else { - state = stateMachine.nextState(state, chCode); - if (state === 0 /* Invalid */) { - resetStateMachine = true; - } - } - if (resetStateMachine) { - state = 1 /* Start */; - hasOpenParens = false; - hasOpenSquareBracket = false; - hasOpenCurlyBracket = false; - // Record where the link started - linkBeginIndex = j + 1; - linkBeginChCode = chCode; - } - j++; - } - if (state === 13 /* Accept */) { - result.push(LinkComputer._createLink(classifier, line, i, linkBeginIndex, len)); - } - } - return result; - }; - return LinkComputer; -}()); - -/** - * Returns an array of all links contains in the provided - * document. *Note* that this operation is computational - * expensive and should not run in the UI thread. - */ -function computeLinks(model) { - if (!model || typeof model.getLineCount !== 'function' || typeof model.getLineContent !== 'function') { - // Unknown caller! - return []; - } - return LinkComputer.computeLinks(model); -} +/*--------------------------------------------------------------------------------------------- + * Copyright (c) Microsoft Corporation. All rights reserved. + * Licensed under the MIT License. See License.txt in the project root for license information. + *--------------------------------------------------------------------------------------------*/ + +var Uint8Matrix = /** @class */ (function () { + function Uint8Matrix(rows, cols, defaultValue) { + var data = new Uint8Array(rows * cols); + for (var i = 0, len = rows * cols; i < len; i++) { + data[i] = defaultValue; + } + this._data = data; + this.rows = rows; + this.cols = cols; + } + Uint8Matrix.prototype.get = function (row, col) { + return this._data[row * this.cols + col]; + }; + Uint8Matrix.prototype.set = function (row, col, value) { + this._data[row * this.cols + col] = value; + }; + return Uint8Matrix; +}()); + +var StateMachine = /** @class */ (function () { + function StateMachine(edges) { + var maxCharCode = 0; + var maxState = 0 /* Invalid */; + for (var i = 0, len = edges.length; i < len; i++) { + var _a = edges[i], from = _a[0], chCode = _a[1], to = _a[2]; + if (chCode > maxCharCode) { + maxCharCode = chCode; + } + if (from > maxState) { + maxState = from; + } + if (to > maxState) { + maxState = to; + } + } + maxCharCode++; + maxState++; + var states = new Uint8Matrix(maxState, maxCharCode, 0 /* Invalid */); + for (var i = 0, len = edges.length; i < len; i++) { + var _b = edges[i], from = _b[0], chCode = _b[1], to = _b[2]; + states.set(from, chCode, to); + } + this._states = states; + this._maxCharCode = maxCharCode; + } + StateMachine.prototype.nextState = function (currentState, chCode) { + if (chCode < 0 || chCode >= this._maxCharCode) { + return 0 /* Invalid */; + } + return this._states.get(currentState, chCode); + }; + return StateMachine; +}()); + +// State machine for http:// or https:// or file:// +var _stateMachine = null; +function getStateMachine() { + if (_stateMachine === null) { + _stateMachine = new StateMachine([ + [1 /* Start */, 104 /* h */, 2 /* H */], + [1 /* Start */, 72 /* H */, 2 /* H */], + [1 /* Start */, 102 /* f */, 6 /* F */], + [1 /* Start */, 70 /* F */, 6 /* F */], + [2 /* H */, 116 /* t */, 3 /* HT */], + [2 /* H */, 84 /* T */, 3 /* HT */], + [3 /* HT */, 116 /* t */, 4 /* HTT */], + [3 /* HT */, 84 /* T */, 4 /* HTT */], + [4 /* HTT */, 112 /* p */, 5 /* HTTP */], + [4 /* HTT */, 80 /* P */, 5 /* HTTP */], + [5 /* HTTP */, 115 /* s */, 9 /* BeforeColon */], + [5 /* HTTP */, 83 /* S */, 9 /* BeforeColon */], + [5 /* HTTP */, 58 /* Colon */, 10 /* AfterColon */], + [6 /* F */, 105 /* i */, 7 /* FI */], + [6 /* F */, 73 /* I */, 7 /* FI */], + [7 /* FI */, 108 /* l */, 8 /* FIL */], + [7 /* FI */, 76 /* L */, 8 /* FIL */], + [8 /* FIL */, 101 /* e */, 9 /* BeforeColon */], + [8 /* FIL */, 69 /* E */, 9 /* BeforeColon */], + [9 /* BeforeColon */, 58 /* Colon */, 10 /* AfterColon */], + [10 /* AfterColon */, 47 /* Slash */, 11 /* AlmostThere */], + [11 /* AlmostThere */, 47 /* Slash */, 12 /* End */], + ]); + } + return _stateMachine; +} +var _classifier = null; +function getClassifier() { + if (_classifier === null) { + _classifier = new _core_characterClassifier_js__WEBPACK_IMPORTED_MODULE_0__["CharacterClassifier"](0 /* None */); + var FORCE_TERMINATION_CHARACTERS = ' \t<>\'\"、。。、,.:;?!@#$%&*‘“〈《「『【〔([{「」}])〕】』」》〉”’`~…'; + for (var i = 0; i < FORCE_TERMINATION_CHARACTERS.length; i++) { + _classifier.set(FORCE_TERMINATION_CHARACTERS.charCodeAt(i), 1 /* ForceTermination */); + } + var CANNOT_END_WITH_CHARACTERS = '.,;'; + for (var i = 0; i < CANNOT_END_WITH_CHARACTERS.length; i++) { + _classifier.set(CANNOT_END_WITH_CHARACTERS.charCodeAt(i), 2 /* CannotEndIn */); + } + } + return _classifier; +} +var LinkComputer = /** @class */ (function () { + function LinkComputer() { + } + LinkComputer._createLink = function (classifier, line, lineNumber, linkBeginIndex, linkEndIndex) { + // Do not allow to end link in certain characters... + var lastIncludedCharIndex = linkEndIndex - 1; + do { + var chCode = line.charCodeAt(lastIncludedCharIndex); + var chClass = classifier.get(chCode); + if (chClass !== 2 /* CannotEndIn */) { + break; + } + lastIncludedCharIndex--; + } while (lastIncludedCharIndex > linkBeginIndex); + // Handle links enclosed in parens, square brackets and curlys. + if (linkBeginIndex > 0) { + var charCodeBeforeLink = line.charCodeAt(linkBeginIndex - 1); + var lastCharCodeInLink = line.charCodeAt(lastIncludedCharIndex); + if ((charCodeBeforeLink === 40 /* OpenParen */ && lastCharCodeInLink === 41 /* CloseParen */) + || (charCodeBeforeLink === 91 /* OpenSquareBracket */ && lastCharCodeInLink === 93 /* CloseSquareBracket */) + || (charCodeBeforeLink === 123 /* OpenCurlyBrace */ && lastCharCodeInLink === 125 /* CloseCurlyBrace */)) { + // Do not end in ) if ( is before the link start + // Do not end in ] if [ is before the link start + // Do not end in } if { is before the link start + lastIncludedCharIndex--; + } + } + return { + range: { + startLineNumber: lineNumber, + startColumn: linkBeginIndex + 1, + endLineNumber: lineNumber, + endColumn: lastIncludedCharIndex + 2 + }, + url: line.substring(linkBeginIndex, lastIncludedCharIndex + 1) + }; + }; + LinkComputer.computeLinks = function (model, stateMachine) { + if (stateMachine === void 0) { stateMachine = getStateMachine(); } + var classifier = getClassifier(); + var result = []; + for (var i = 1, lineCount = model.getLineCount(); i <= lineCount; i++) { + var line = model.getLineContent(i); + var len = line.length; + var j = 0; + var linkBeginIndex = 0; + var linkBeginChCode = 0; + var state = 1 /* Start */; + var hasOpenParens = false; + var hasOpenSquareBracket = false; + var hasOpenCurlyBracket = false; + while (j < len) { + var resetStateMachine = false; + var chCode = line.charCodeAt(j); + if (state === 13 /* Accept */) { + var chClass = void 0; + switch (chCode) { + case 40 /* OpenParen */: + hasOpenParens = true; + chClass = 0 /* None */; + break; + case 41 /* CloseParen */: + chClass = (hasOpenParens ? 0 /* None */ : 1 /* ForceTermination */); + break; + case 91 /* OpenSquareBracket */: + hasOpenSquareBracket = true; + chClass = 0 /* None */; + break; + case 93 /* CloseSquareBracket */: + chClass = (hasOpenSquareBracket ? 0 /* None */ : 1 /* ForceTermination */); + break; + case 123 /* OpenCurlyBrace */: + hasOpenCurlyBracket = true; + chClass = 0 /* None */; + break; + case 125 /* CloseCurlyBrace */: + chClass = (hasOpenCurlyBracket ? 0 /* None */ : 1 /* ForceTermination */); + break; + /* The following three rules make it that ' or " or ` are allowed inside links if the link began with a different one */ + case 39 /* SingleQuote */: + chClass = (linkBeginChCode === 34 /* DoubleQuote */ || linkBeginChCode === 96 /* BackTick */) ? 0 /* None */ : 1 /* ForceTermination */; + break; + case 34 /* DoubleQuote */: + chClass = (linkBeginChCode === 39 /* SingleQuote */ || linkBeginChCode === 96 /* BackTick */) ? 0 /* None */ : 1 /* ForceTermination */; + break; + case 96 /* BackTick */: + chClass = (linkBeginChCode === 39 /* SingleQuote */ || linkBeginChCode === 34 /* DoubleQuote */) ? 0 /* None */ : 1 /* ForceTermination */; + break; + case 42 /* Asterisk */: + // `*` terminates a link if the link began with `*` + chClass = (linkBeginChCode === 42 /* Asterisk */) ? 1 /* ForceTermination */ : 0 /* None */; + break; + default: + chClass = classifier.get(chCode); + } + // Check if character terminates link + if (chClass === 1 /* ForceTermination */) { + result.push(LinkComputer._createLink(classifier, line, i, linkBeginIndex, j)); + resetStateMachine = true; + } + } + else if (state === 12 /* End */) { + var chClass = void 0; + if (chCode === 91 /* OpenSquareBracket */) { + // Allow for the authority part to contain ipv6 addresses which contain [ and ] + hasOpenSquareBracket = true; + chClass = 0 /* None */; + } + else { + chClass = classifier.get(chCode); + } + // Check if character terminates link + if (chClass === 1 /* ForceTermination */) { + resetStateMachine = true; + } + else { + state = 13 /* Accept */; + } + } + else { + state = stateMachine.nextState(state, chCode); + if (state === 0 /* Invalid */) { + resetStateMachine = true; + } + } + if (resetStateMachine) { + state = 1 /* Start */; + hasOpenParens = false; + hasOpenSquareBracket = false; + hasOpenCurlyBracket = false; + // Record where the link started + linkBeginIndex = j + 1; + linkBeginChCode = chCode; + } + j++; + } + if (state === 13 /* Accept */) { + result.push(LinkComputer._createLink(classifier, line, i, linkBeginIndex, len)); + } + } + return result; + }; + return LinkComputer; +}()); + +/** + * Returns an array of all links contains in the provided + * document. *Note* that this operation is computational + * expensive and should not run in the UI thread. + */ +function computeLinks(model) { + if (!model || typeof model.getLineCount !== 'function' || typeof model.getLineContent !== 'function') { + // Unknown caller! + return []; + } + return LinkComputer.computeLinks(model); +} /***/ }), @@ -6425,93 +7168,93 @@ function computeLinks(model) { "use strict"; __webpack_require__.r(__webpack_exports__); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "BasicInplaceReplace", function() { return BasicInplaceReplace; }); -/*--------------------------------------------------------------------------------------------- - * Copyright (c) Microsoft Corporation. All rights reserved. - * Licensed under the MIT License. See License.txt in the project root for license information. - *--------------------------------------------------------------------------------------------*/ -var BasicInplaceReplace = /** @class */ (function () { - function BasicInplaceReplace() { - this._defaultValueSet = [ - ['true', 'false'], - ['True', 'False'], - ['Private', 'Public', 'Friend', 'ReadOnly', 'Partial', 'Protected', 'WriteOnly'], - ['public', 'protected', 'private'], - ]; - } - BasicInplaceReplace.prototype.navigateValueSet = function (range1, text1, range2, text2, up) { - if (range1 && text1) { - var result = this.doNavigateValueSet(text1, up); - if (result) { - return { - range: range1, - value: result - }; - } - } - if (range2 && text2) { - var result = this.doNavigateValueSet(text2, up); - if (result) { - return { - range: range2, - value: result - }; - } - } - return null; - }; - BasicInplaceReplace.prototype.doNavigateValueSet = function (text, up) { - var numberResult = this.numberReplace(text, up); - if (numberResult !== null) { - return numberResult; - } - return this.textReplace(text, up); - }; - BasicInplaceReplace.prototype.numberReplace = function (value, up) { - var precision = Math.pow(10, value.length - (value.lastIndexOf('.') + 1)); - var n1 = Number(value); - var n2 = parseFloat(value); - if (!isNaN(n1) && !isNaN(n2) && n1 === n2) { - if (n1 === 0 && !up) { - return null; // don't do negative - // } else if(n1 === 9 && up) { - // return null; // don't insert 10 into a number - } - else { - n1 = Math.floor(n1 * precision); - n1 += up ? precision : -precision; - return String(n1 / precision); - } - } - return null; - }; - BasicInplaceReplace.prototype.textReplace = function (value, up) { - return this.valueSetsReplace(this._defaultValueSet, value, up); - }; - BasicInplaceReplace.prototype.valueSetsReplace = function (valueSets, value, up) { - var result = null; - for (var i = 0, len = valueSets.length; result === null && i < len; i++) { - result = this.valueSetReplace(valueSets[i], value, up); - } - return result; - }; - BasicInplaceReplace.prototype.valueSetReplace = function (valueSet, value, up) { - var idx = valueSet.indexOf(value); - if (idx >= 0) { - idx += up ? +1 : -1; - if (idx < 0) { - idx = valueSet.length - 1; - } - else { - idx %= valueSet.length; - } - return valueSet[idx]; - } - return null; - }; - BasicInplaceReplace.INSTANCE = new BasicInplaceReplace(); - return BasicInplaceReplace; -}()); - +/*--------------------------------------------------------------------------------------------- + * Copyright (c) Microsoft Corporation. All rights reserved. + * Licensed under the MIT License. See License.txt in the project root for license information. + *--------------------------------------------------------------------------------------------*/ +var BasicInplaceReplace = /** @class */ (function () { + function BasicInplaceReplace() { + this._defaultValueSet = [ + ['true', 'false'], + ['True', 'False'], + ['Private', 'Public', 'Friend', 'ReadOnly', 'Partial', 'Protected', 'WriteOnly'], + ['public', 'protected', 'private'], + ]; + } + BasicInplaceReplace.prototype.navigateValueSet = function (range1, text1, range2, text2, up) { + if (range1 && text1) { + var result = this.doNavigateValueSet(text1, up); + if (result) { + return { + range: range1, + value: result + }; + } + } + if (range2 && text2) { + var result = this.doNavigateValueSet(text2, up); + if (result) { + return { + range: range2, + value: result + }; + } + } + return null; + }; + BasicInplaceReplace.prototype.doNavigateValueSet = function (text, up) { + var numberResult = this.numberReplace(text, up); + if (numberResult !== null) { + return numberResult; + } + return this.textReplace(text, up); + }; + BasicInplaceReplace.prototype.numberReplace = function (value, up) { + var precision = Math.pow(10, value.length - (value.lastIndexOf('.') + 1)); + var n1 = Number(value); + var n2 = parseFloat(value); + if (!isNaN(n1) && !isNaN(n2) && n1 === n2) { + if (n1 === 0 && !up) { + return null; // don't do negative + // } else if(n1 === 9 && up) { + // return null; // don't insert 10 into a number + } + else { + n1 = Math.floor(n1 * precision); + n1 += up ? precision : -precision; + return String(n1 / precision); + } + } + return null; + }; + BasicInplaceReplace.prototype.textReplace = function (value, up) { + return this.valueSetsReplace(this._defaultValueSet, value, up); + }; + BasicInplaceReplace.prototype.valueSetsReplace = function (valueSets, value, up) { + var result = null; + for (var i = 0, len = valueSets.length; result === null && i < len; i++) { + result = this.valueSetReplace(valueSets[i], value, up); + } + return result; + }; + BasicInplaceReplace.prototype.valueSetReplace = function (valueSet, value, up) { + var idx = valueSet.indexOf(value); + if (idx >= 0) { + idx += up ? +1 : -1; + if (idx < 0) { + idx = valueSet.length - 1; + } + else { + idx %= valueSet.length; + } + return valueSet[idx]; + } + return null; + }; + BasicInplaceReplace.INSTANCE = new BasicInplaceReplace(); + return BasicInplaceReplace; +}()); + /***/ }), @@ -6520,13 +7263,12 @@ var BasicInplaceReplace = /** @class */ (function () { /*!****************************************************************************************!*\ !*** ./node_modules/monaco-editor/esm/vs/editor/common/services/editorSimpleWorker.js ***! \****************************************************************************************/ -/*! exports provided: BaseEditorSimpleWorker, EditorSimpleWorkerImpl, create */ +/*! exports provided: EditorSimpleWorker, create */ /***/ (function(module, __webpack_exports__, __webpack_require__) { "use strict"; __webpack_require__.r(__webpack_exports__); -/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "BaseEditorSimpleWorker", function() { return BaseEditorSimpleWorker; }); -/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "EditorSimpleWorkerImpl", function() { return EditorSimpleWorkerImpl; }); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "EditorSimpleWorker", function() { return EditorSimpleWorker; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "create", function() { return create; }); /* harmony import */ var _base_common_arrays_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../../../base/common/arrays.js */ "./node_modules/monaco-editor/esm/vs/base/common/arrays.js"); /* harmony import */ var _base_common_diff_diff_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../../../base/common/diff/diff.js */ "./node_modules/monaco-editor/esm/vs/base/common/diff/diff.js"); @@ -6542,553 +7284,579 @@ __webpack_require__.r(__webpack_exports__); /* harmony import */ var _modes_supports_inplaceReplaceSupport_js__WEBPACK_IMPORTED_MODULE_11__ = __webpack_require__(/*! ../modes/supports/inplaceReplaceSupport.js */ "./node_modules/monaco-editor/esm/vs/editor/common/modes/supports/inplaceReplaceSupport.js"); /* harmony import */ var _standalone_standaloneBase_js__WEBPACK_IMPORTED_MODULE_12__ = __webpack_require__(/*! ../standalone/standaloneBase.js */ "./node_modules/monaco-editor/esm/vs/editor/common/standalone/standaloneBase.js"); /* harmony import */ var _base_common_types_js__WEBPACK_IMPORTED_MODULE_13__ = __webpack_require__(/*! ../../../base/common/types.js */ "./node_modules/monaco-editor/esm/vs/base/common/types.js"); -/*--------------------------------------------------------------------------------------------- - * Copyright (c) Microsoft Corporation. All rights reserved. - * Licensed under the MIT License. See License.txt in the project root for license information. - *--------------------------------------------------------------------------------------------*/ -var __extends = (undefined && undefined.__extends) || (function () { - var extendStatics = function (d, b) { - extendStatics = Object.setPrototypeOf || - ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) || - function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; }; - return extendStatics(d, b); - }; - return function (d, b) { - extendStatics(d, b); - function __() { this.constructor = d; } - d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __()); - }; -})(); - - - - - - - - - - - - - - -/** - * @internal - */ -var MirrorModel = /** @class */ (function (_super) { - __extends(MirrorModel, _super); - function MirrorModel() { - return _super !== null && _super.apply(this, arguments) || this; - } - Object.defineProperty(MirrorModel.prototype, "uri", { - get: function () { - return this._uri; - }, - enumerable: true, - configurable: true - }); - Object.defineProperty(MirrorModel.prototype, "version", { - get: function () { - return this._versionId; - }, - enumerable: true, - configurable: true - }); - Object.defineProperty(MirrorModel.prototype, "eol", { - get: function () { - return this._eol; - }, - enumerable: true, - configurable: true - }); - MirrorModel.prototype.getValue = function () { - return this.getText(); - }; - MirrorModel.prototype.getLinesContent = function () { - return this._lines.slice(0); - }; - MirrorModel.prototype.getLineCount = function () { - return this._lines.length; - }; - MirrorModel.prototype.getLineContent = function (lineNumber) { - return this._lines[lineNumber - 1]; - }; - MirrorModel.prototype.getWordAtPosition = function (position, wordDefinition) { - var wordAtText = Object(_model_wordHelper_js__WEBPACK_IMPORTED_MODULE_9__["getWordAtText"])(position.column, Object(_model_wordHelper_js__WEBPACK_IMPORTED_MODULE_9__["ensureValidWordDefinition"])(wordDefinition), this._lines[position.lineNumber - 1], 0); - if (wordAtText) { - return new _core_range_js__WEBPACK_IMPORTED_MODULE_6__["Range"](position.lineNumber, wordAtText.startColumn, position.lineNumber, wordAtText.endColumn); - } - return null; - }; - MirrorModel.prototype.getWordUntilPosition = function (position, wordDefinition) { - var wordAtPosition = this.getWordAtPosition(position, wordDefinition); - if (!wordAtPosition) { - return { - word: '', - startColumn: position.column, - endColumn: position.column - }; - } - return { - word: this._lines[position.lineNumber - 1].substring(wordAtPosition.startColumn - 1, position.column - 1), - startColumn: wordAtPosition.startColumn, - endColumn: position.column - }; - }; - MirrorModel.prototype.createWordIterator = function (wordDefinition) { - var _this = this; - var obj; - var lineNumber = 0; - var lineText; - var wordRangesIdx = 0; - var wordRanges = []; - var next = function () { - if (wordRangesIdx < wordRanges.length) { - var value = lineText.substring(wordRanges[wordRangesIdx].start, wordRanges[wordRangesIdx].end); - wordRangesIdx += 1; - if (!obj) { - obj = { done: false, value: value }; - } - else { - obj.value = value; - } - return obj; - } - else if (lineNumber >= _this._lines.length) { - return _base_common_iterator_js__WEBPACK_IMPORTED_MODULE_2__["FIN"]; - } - else { - lineText = _this._lines[lineNumber]; - wordRanges = _this._wordenize(lineText, wordDefinition); - wordRangesIdx = 0; - lineNumber += 1; - return next(); - } - }; - return { next: next }; - }; - MirrorModel.prototype.getLineWords = function (lineNumber, wordDefinition) { - var content = this._lines[lineNumber - 1]; - var ranges = this._wordenize(content, wordDefinition); - var words = []; - for (var _i = 0, ranges_1 = ranges; _i < ranges_1.length; _i++) { - var range = ranges_1[_i]; - words.push({ - word: content.substring(range.start, range.end), - startColumn: range.start + 1, - endColumn: range.end + 1 - }); - } - return words; - }; - MirrorModel.prototype._wordenize = function (content, wordDefinition) { - var result = []; - var match; - wordDefinition.lastIndex = 0; // reset lastIndex just to be sure - while (match = wordDefinition.exec(content)) { - if (match[0].length === 0) { - // it did match the empty string - break; - } - result.push({ start: match.index, end: match.index + match[0].length }); - } - return result; - }; - MirrorModel.prototype.getValueInRange = function (range) { - range = this._validateRange(range); - if (range.startLineNumber === range.endLineNumber) { - return this._lines[range.startLineNumber - 1].substring(range.startColumn - 1, range.endColumn - 1); - } - var lineEnding = this._eol; - var startLineIndex = range.startLineNumber - 1; - var endLineIndex = range.endLineNumber - 1; - var resultLines = []; - resultLines.push(this._lines[startLineIndex].substring(range.startColumn - 1)); - for (var i = startLineIndex + 1; i < endLineIndex; i++) { - resultLines.push(this._lines[i]); - } - resultLines.push(this._lines[endLineIndex].substring(0, range.endColumn - 1)); - return resultLines.join(lineEnding); - }; - MirrorModel.prototype.offsetAt = function (position) { - position = this._validatePosition(position); - this._ensureLineStarts(); - return this._lineStarts.getAccumulatedValue(position.lineNumber - 2) + (position.column - 1); - }; - MirrorModel.prototype.positionAt = function (offset) { - offset = Math.floor(offset); - offset = Math.max(0, offset); - this._ensureLineStarts(); - var out = this._lineStarts.getIndexOf(offset); - var lineLength = this._lines[out.index].length; - // Ensure we return a valid position - return { - lineNumber: 1 + out.index, - column: 1 + Math.min(out.remainder, lineLength) - }; - }; - MirrorModel.prototype._validateRange = function (range) { - var start = this._validatePosition({ lineNumber: range.startLineNumber, column: range.startColumn }); - var end = this._validatePosition({ lineNumber: range.endLineNumber, column: range.endColumn }); - if (start.lineNumber !== range.startLineNumber - || start.column !== range.startColumn - || end.lineNumber !== range.endLineNumber - || end.column !== range.endColumn) { - return { - startLineNumber: start.lineNumber, - startColumn: start.column, - endLineNumber: end.lineNumber, - endColumn: end.column - }; - } - return range; - }; - MirrorModel.prototype._validatePosition = function (position) { - if (!_core_position_js__WEBPACK_IMPORTED_MODULE_5__["Position"].isIPosition(position)) { - throw new Error('bad position'); - } - var lineNumber = position.lineNumber, column = position.column; - var hasChanged = false; - if (lineNumber < 1) { - lineNumber = 1; - column = 1; - hasChanged = true; - } - else if (lineNumber > this._lines.length) { - lineNumber = this._lines.length; - column = this._lines[lineNumber - 1].length + 1; - hasChanged = true; - } - else { - var maxCharacter = this._lines[lineNumber - 1].length + 1; - if (column < 1) { - column = 1; - hasChanged = true; - } - else if (column > maxCharacter) { - column = maxCharacter; - hasChanged = true; - } - } - if (!hasChanged) { - return position; - } - else { - return { lineNumber: lineNumber, column: column }; - } - }; - return MirrorModel; -}(_model_mirrorTextModel_js__WEBPACK_IMPORTED_MODULE_8__["MirrorTextModel"])); -/** - * @internal - */ -var BaseEditorSimpleWorker = /** @class */ (function () { - function BaseEditorSimpleWorker(foreignModuleFactory) { - this._foreignModuleFactory = foreignModuleFactory; - this._foreignModule = null; - } - // ---- BEGIN diff -------------------------------------------------------------------------- - BaseEditorSimpleWorker.prototype.computeDiff = function (originalUrl, modifiedUrl, ignoreTrimWhitespace) { - var original = this._getModel(originalUrl); - var modified = this._getModel(modifiedUrl); - if (!original || !modified) { - return Promise.resolve(null); - } - var originalLines = original.getLinesContent(); - var modifiedLines = modified.getLinesContent(); - var diffComputer = new _diff_diffComputer_js__WEBPACK_IMPORTED_MODULE_7__["DiffComputer"](originalLines, modifiedLines, { - shouldComputeCharChanges: true, - shouldPostProcessCharChanges: true, - shouldIgnoreTrimWhitespace: ignoreTrimWhitespace, - shouldMakePrettyDiff: true - }); - var changes = diffComputer.computeDiff(); - var identical = (changes.length > 0 ? false : this._modelsAreIdentical(original, modified)); - return Promise.resolve({ - identical: identical, - changes: changes - }); - }; - BaseEditorSimpleWorker.prototype._modelsAreIdentical = function (original, modified) { - var originalLineCount = original.getLineCount(); - var modifiedLineCount = modified.getLineCount(); - if (originalLineCount !== modifiedLineCount) { - return false; - } - for (var line = 1; line <= originalLineCount; line++) { - var originalLine = original.getLineContent(line); - var modifiedLine = modified.getLineContent(line); - if (originalLine !== modifiedLine) { - return false; - } - } - return true; - }; - BaseEditorSimpleWorker.prototype.computeMoreMinimalEdits = function (modelUrl, edits) { - var model = this._getModel(modelUrl); - if (!model) { - return Promise.resolve(edits); - } - var result = []; - var lastEol = undefined; - edits = Object(_base_common_arrays_js__WEBPACK_IMPORTED_MODULE_0__["mergeSort"])(edits, function (a, b) { - if (a.range && b.range) { - return _core_range_js__WEBPACK_IMPORTED_MODULE_6__["Range"].compareRangesUsingStarts(a.range, b.range); - } - // eol only changes should go to the end - var aRng = a.range ? 0 : 1; - var bRng = b.range ? 0 : 1; - return aRng - bRng; - }); - for (var _i = 0, edits_1 = edits; _i < edits_1.length; _i++) { - var _a = edits_1[_i], range = _a.range, text = _a.text, eol = _a.eol; - if (typeof eol === 'number') { - lastEol = eol; - } - if (_core_range_js__WEBPACK_IMPORTED_MODULE_6__["Range"].isEmpty(range) && !text) { - // empty change - continue; - } - var original = model.getValueInRange(range); - text = text.replace(/\r\n|\n|\r/g, model.eol); - if (original === text) { - // noop - continue; - } - // make sure diff won't take too long - if (Math.max(text.length, original.length) > BaseEditorSimpleWorker._diffLimit) { - result.push({ range: range, text: text }); - continue; - } - // compute diff between original and edit.text - var changes = Object(_base_common_diff_diff_js__WEBPACK_IMPORTED_MODULE_1__["stringDiff"])(original, text, false); - var editOffset = model.offsetAt(_core_range_js__WEBPACK_IMPORTED_MODULE_6__["Range"].lift(range).getStartPosition()); - for (var _b = 0, changes_1 = changes; _b < changes_1.length; _b++) { - var change = changes_1[_b]; - var start = model.positionAt(editOffset + change.originalStart); - var end = model.positionAt(editOffset + change.originalStart + change.originalLength); - var newEdit = { - text: text.substr(change.modifiedStart, change.modifiedLength), - range: { startLineNumber: start.lineNumber, startColumn: start.column, endLineNumber: end.lineNumber, endColumn: end.column } - }; - if (model.getValueInRange(newEdit.range) !== newEdit.text) { - result.push(newEdit); - } - } - } - if (typeof lastEol === 'number') { - result.push({ eol: lastEol, text: '', range: { startLineNumber: 0, startColumn: 0, endLineNumber: 0, endColumn: 0 } }); - } - return Promise.resolve(result); - }; - // ---- END minimal edits --------------------------------------------------------------- - BaseEditorSimpleWorker.prototype.computeLinks = function (modelUrl) { - var model = this._getModel(modelUrl); - if (!model) { - return Promise.resolve(null); - } - return Promise.resolve(Object(_modes_linkComputer_js__WEBPACK_IMPORTED_MODULE_10__["computeLinks"])(model)); - }; - BaseEditorSimpleWorker.prototype.textualSuggest = function (modelUrl, position, wordDef, wordDefFlags) { - var model = this._getModel(modelUrl); - if (!model) { - return Promise.resolve(null); - } - var seen = Object.create(null); - var suggestions = []; - var wordDefRegExp = new RegExp(wordDef, wordDefFlags); - var wordUntil = model.getWordUntilPosition(position, wordDefRegExp); - var wordAt = model.getWordAtPosition(position, wordDefRegExp); - if (wordAt) { - seen[model.getValueInRange(wordAt)] = true; - } - for (var iter = model.createWordIterator(wordDefRegExp), e = iter.next(); !e.done && suggestions.length <= BaseEditorSimpleWorker._suggestionsLimit; e = iter.next()) { - var word = e.value; - if (seen[word]) { - continue; - } - seen[word] = true; - if (!isNaN(Number(word))) { - continue; - } - suggestions.push({ - kind: 18 /* Text */, - label: word, - insertText: word, - range: { startLineNumber: position.lineNumber, startColumn: wordUntil.startColumn, endLineNumber: position.lineNumber, endColumn: wordUntil.endColumn } - }); - } - return Promise.resolve({ suggestions: suggestions }); - }; - // ---- END suggest -------------------------------------------------------------------------- - //#region -- word ranges -- - BaseEditorSimpleWorker.prototype.computeWordRanges = function (modelUrl, range, wordDef, wordDefFlags) { - var model = this._getModel(modelUrl); - if (!model) { - return Promise.resolve(Object.create(null)); - } - var wordDefRegExp = new RegExp(wordDef, wordDefFlags); - var result = Object.create(null); - for (var line = range.startLineNumber; line < range.endLineNumber; line++) { - var words = model.getLineWords(line, wordDefRegExp); - for (var _i = 0, words_1 = words; _i < words_1.length; _i++) { - var word = words_1[_i]; - if (!isNaN(Number(word.word))) { - continue; - } - var array = result[word.word]; - if (!array) { - array = []; - result[word.word] = array; - } - array.push({ - startLineNumber: line, - startColumn: word.startColumn, - endLineNumber: line, - endColumn: word.endColumn - }); - } - } - return Promise.resolve(result); - }; - //#endregion - BaseEditorSimpleWorker.prototype.navigateValueSet = function (modelUrl, range, up, wordDef, wordDefFlags) { - var model = this._getModel(modelUrl); - if (!model) { - return Promise.resolve(null); - } - var wordDefRegExp = new RegExp(wordDef, wordDefFlags); - if (range.startColumn === range.endColumn) { - range = { - startLineNumber: range.startLineNumber, - startColumn: range.startColumn, - endLineNumber: range.endLineNumber, - endColumn: range.endColumn + 1 - }; - } - var selectionText = model.getValueInRange(range); - var wordRange = model.getWordAtPosition({ lineNumber: range.startLineNumber, column: range.startColumn }, wordDefRegExp); - if (!wordRange) { - return Promise.resolve(null); - } - var word = model.getValueInRange(wordRange); - var result = _modes_supports_inplaceReplaceSupport_js__WEBPACK_IMPORTED_MODULE_11__["BasicInplaceReplace"].INSTANCE.navigateValueSet(range, selectionText, wordRange, word, up); - return Promise.resolve(result); - }; - // ---- BEGIN foreign module support -------------------------------------------------------------------------- - BaseEditorSimpleWorker.prototype.loadForeignModule = function (moduleId, createData) { - var _this = this; - var ctx = { - getMirrorModels: function () { - return _this._getModels(); - } - }; - if (this._foreignModuleFactory) { - this._foreignModule = this._foreignModuleFactory(ctx, createData); - // static foreing module - var methods = []; - for (var _i = 0, _a = Object(_base_common_types_js__WEBPACK_IMPORTED_MODULE_13__["getAllPropertyNames"])(this._foreignModule); _i < _a.length; _i++) { - var prop = _a[_i]; - if (typeof this._foreignModule[prop] === 'function') { - methods.push(prop); - } - } - return Promise.resolve(methods); - } - // ESM-comment-begin - // return new Promise((resolve, reject) => { - // require([moduleId], (foreignModule: { create: IForeignModuleFactory }) => { - // this._foreignModule = foreignModule.create(ctx, createData); - // - // let methods: string[] = []; - // for (const prop of getAllPropertyNames(this._foreignModule)) { - // if (typeof this._foreignModule[prop] === 'function') { - // methods.push(prop); - // } - // } - // - // resolve(methods); - // - // }, reject); - // }); - // ESM-comment-end - // ESM-uncomment-begin - return Promise.reject(new Error("Unexpected usage")); - // ESM-uncomment-end - }; - // foreign method request - BaseEditorSimpleWorker.prototype.fmr = function (method, args) { - if (!this._foreignModule || typeof this._foreignModule[method] !== 'function') { - return Promise.reject(new Error('Missing requestHandler or method: ' + method)); - } - try { - return Promise.resolve(this._foreignModule[method].apply(this._foreignModule, args)); - } - catch (e) { - return Promise.reject(e); - } - }; - // ---- END diff -------------------------------------------------------------------------- - // ---- BEGIN minimal edits --------------------------------------------------------------- - BaseEditorSimpleWorker._diffLimit = 100000; - // ---- BEGIN suggest -------------------------------------------------------------------------- - BaseEditorSimpleWorker._suggestionsLimit = 10000; - return BaseEditorSimpleWorker; -}()); - -/** - * @internal - */ -var EditorSimpleWorkerImpl = /** @class */ (function (_super) { - __extends(EditorSimpleWorkerImpl, _super); - function EditorSimpleWorkerImpl(foreignModuleFactory) { - var _this = _super.call(this, foreignModuleFactory) || this; - _this._models = Object.create(null); - return _this; - } - EditorSimpleWorkerImpl.prototype.dispose = function () { - this._models = Object.create(null); - }; - EditorSimpleWorkerImpl.prototype._getModel = function (uri) { - return this._models[uri]; - }; - EditorSimpleWorkerImpl.prototype._getModels = function () { - var _this = this; - var all = []; - Object.keys(this._models).forEach(function (key) { return all.push(_this._models[key]); }); - return all; - }; - EditorSimpleWorkerImpl.prototype.acceptNewModel = function (data) { - this._models[data.url] = new MirrorModel(_base_common_uri_js__WEBPACK_IMPORTED_MODULE_4__["URI"].parse(data.url), data.lines, data.EOL, data.versionId); - }; - EditorSimpleWorkerImpl.prototype.acceptModelChanged = function (strURL, e) { - if (!this._models[strURL]) { - return; - } - var model = this._models[strURL]; - model.onEvents(e); - }; - EditorSimpleWorkerImpl.prototype.acceptRemovedModel = function (strURL) { - if (!this._models[strURL]) { - return; - } - delete this._models[strURL]; - }; - return EditorSimpleWorkerImpl; -}(BaseEditorSimpleWorker)); - -/** - * Called on the worker side - * @internal - */ -function create() { - return new EditorSimpleWorkerImpl(null); -} -if (typeof importScripts === 'function') { - // Running in a web worker - _base_common_platform_js__WEBPACK_IMPORTED_MODULE_3__["globals"].monaco = Object(_standalone_standaloneBase_js__WEBPACK_IMPORTED_MODULE_12__["createMonacoBaseAPI"])(); -} +/*--------------------------------------------------------------------------------------------- + * Copyright (c) Microsoft Corporation. All rights reserved. + * Licensed under the MIT License. See License.txt in the project root for license information. + *--------------------------------------------------------------------------------------------*/ +var __extends = (undefined && undefined.__extends) || (function () { + var extendStatics = function (d, b) { + extendStatics = Object.setPrototypeOf || + ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) || + function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; }; + return extendStatics(d, b); + }; + return function (d, b) { + extendStatics(d, b); + function __() { this.constructor = d; } + d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __()); + }; +})(); +var __awaiter = (undefined && undefined.__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 = (undefined && undefined.__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 (_) 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 }; + } +}; + + + + + + + + + + + + + + +/** + * @internal + */ +var MirrorModel = /** @class */ (function (_super) { + __extends(MirrorModel, _super); + function MirrorModel() { + return _super !== null && _super.apply(this, arguments) || this; + } + Object.defineProperty(MirrorModel.prototype, "uri", { + get: function () { + return this._uri; + }, + enumerable: true, + configurable: true + }); + Object.defineProperty(MirrorModel.prototype, "version", { + get: function () { + return this._versionId; + }, + enumerable: true, + configurable: true + }); + Object.defineProperty(MirrorModel.prototype, "eol", { + get: function () { + return this._eol; + }, + enumerable: true, + configurable: true + }); + MirrorModel.prototype.getValue = function () { + return this.getText(); + }; + MirrorModel.prototype.getLinesContent = function () { + return this._lines.slice(0); + }; + MirrorModel.prototype.getLineCount = function () { + return this._lines.length; + }; + MirrorModel.prototype.getLineContent = function (lineNumber) { + return this._lines[lineNumber - 1]; + }; + MirrorModel.prototype.getWordAtPosition = function (position, wordDefinition) { + var wordAtText = Object(_model_wordHelper_js__WEBPACK_IMPORTED_MODULE_9__["getWordAtText"])(position.column, Object(_model_wordHelper_js__WEBPACK_IMPORTED_MODULE_9__["ensureValidWordDefinition"])(wordDefinition), this._lines[position.lineNumber - 1], 0); + if (wordAtText) { + return new _core_range_js__WEBPACK_IMPORTED_MODULE_6__["Range"](position.lineNumber, wordAtText.startColumn, position.lineNumber, wordAtText.endColumn); + } + return null; + }; + MirrorModel.prototype.createWordIterator = function (wordDefinition) { + var _this = this; + var obj; + var lineNumber = 0; + var lineText; + var wordRangesIdx = 0; + var wordRanges = []; + var next = function () { + if (wordRangesIdx < wordRanges.length) { + var value = lineText.substring(wordRanges[wordRangesIdx].start, wordRanges[wordRangesIdx].end); + wordRangesIdx += 1; + if (!obj) { + obj = { done: false, value: value }; + } + else { + obj.value = value; + } + return obj; + } + else if (lineNumber >= _this._lines.length) { + return _base_common_iterator_js__WEBPACK_IMPORTED_MODULE_2__["FIN"]; + } + else { + lineText = _this._lines[lineNumber]; + wordRanges = _this._wordenize(lineText, wordDefinition); + wordRangesIdx = 0; + lineNumber += 1; + return next(); + } + }; + return { next: next }; + }; + MirrorModel.prototype.getLineWords = function (lineNumber, wordDefinition) { + var content = this._lines[lineNumber - 1]; + var ranges = this._wordenize(content, wordDefinition); + var words = []; + for (var _i = 0, ranges_1 = ranges; _i < ranges_1.length; _i++) { + var range = ranges_1[_i]; + words.push({ + word: content.substring(range.start, range.end), + startColumn: range.start + 1, + endColumn: range.end + 1 + }); + } + return words; + }; + MirrorModel.prototype._wordenize = function (content, wordDefinition) { + var result = []; + var match; + wordDefinition.lastIndex = 0; // reset lastIndex just to be sure + while (match = wordDefinition.exec(content)) { + if (match[0].length === 0) { + // it did match the empty string + break; + } + result.push({ start: match.index, end: match.index + match[0].length }); + } + return result; + }; + MirrorModel.prototype.getValueInRange = function (range) { + range = this._validateRange(range); + if (range.startLineNumber === range.endLineNumber) { + return this._lines[range.startLineNumber - 1].substring(range.startColumn - 1, range.endColumn - 1); + } + var lineEnding = this._eol; + var startLineIndex = range.startLineNumber - 1; + var endLineIndex = range.endLineNumber - 1; + var resultLines = []; + resultLines.push(this._lines[startLineIndex].substring(range.startColumn - 1)); + for (var i = startLineIndex + 1; i < endLineIndex; i++) { + resultLines.push(this._lines[i]); + } + resultLines.push(this._lines[endLineIndex].substring(0, range.endColumn - 1)); + return resultLines.join(lineEnding); + }; + MirrorModel.prototype.offsetAt = function (position) { + position = this._validatePosition(position); + this._ensureLineStarts(); + return this._lineStarts.getAccumulatedValue(position.lineNumber - 2) + (position.column - 1); + }; + MirrorModel.prototype.positionAt = function (offset) { + offset = Math.floor(offset); + offset = Math.max(0, offset); + this._ensureLineStarts(); + var out = this._lineStarts.getIndexOf(offset); + var lineLength = this._lines[out.index].length; + // Ensure we return a valid position + return { + lineNumber: 1 + out.index, + column: 1 + Math.min(out.remainder, lineLength) + }; + }; + MirrorModel.prototype._validateRange = function (range) { + var start = this._validatePosition({ lineNumber: range.startLineNumber, column: range.startColumn }); + var end = this._validatePosition({ lineNumber: range.endLineNumber, column: range.endColumn }); + if (start.lineNumber !== range.startLineNumber + || start.column !== range.startColumn + || end.lineNumber !== range.endLineNumber + || end.column !== range.endColumn) { + return { + startLineNumber: start.lineNumber, + startColumn: start.column, + endLineNumber: end.lineNumber, + endColumn: end.column + }; + } + return range; + }; + MirrorModel.prototype._validatePosition = function (position) { + if (!_core_position_js__WEBPACK_IMPORTED_MODULE_5__["Position"].isIPosition(position)) { + throw new Error('bad position'); + } + var lineNumber = position.lineNumber, column = position.column; + var hasChanged = false; + if (lineNumber < 1) { + lineNumber = 1; + column = 1; + hasChanged = true; + } + else if (lineNumber > this._lines.length) { + lineNumber = this._lines.length; + column = this._lines[lineNumber - 1].length + 1; + hasChanged = true; + } + else { + var maxCharacter = this._lines[lineNumber - 1].length + 1; + if (column < 1) { + column = 1; + hasChanged = true; + } + else if (column > maxCharacter) { + column = maxCharacter; + hasChanged = true; + } + } + if (!hasChanged) { + return position; + } + else { + return { lineNumber: lineNumber, column: column }; + } + }; + return MirrorModel; +}(_model_mirrorTextModel_js__WEBPACK_IMPORTED_MODULE_8__["MirrorTextModel"])); +/** + * @internal + */ +var EditorSimpleWorker = /** @class */ (function () { + function EditorSimpleWorker(host, foreignModuleFactory) { + this._host = host; + this._models = Object.create(null); + this._foreignModuleFactory = foreignModuleFactory; + this._foreignModule = null; + } + EditorSimpleWorker.prototype.dispose = function () { + this._models = Object.create(null); + }; + EditorSimpleWorker.prototype._getModel = function (uri) { + return this._models[uri]; + }; + EditorSimpleWorker.prototype._getModels = function () { + var _this = this; + var all = []; + Object.keys(this._models).forEach(function (key) { return all.push(_this._models[key]); }); + return all; + }; + EditorSimpleWorker.prototype.acceptNewModel = function (data) { + this._models[data.url] = new MirrorModel(_base_common_uri_js__WEBPACK_IMPORTED_MODULE_4__["URI"].parse(data.url), data.lines, data.EOL, data.versionId); + }; + EditorSimpleWorker.prototype.acceptModelChanged = function (strURL, e) { + if (!this._models[strURL]) { + return; + } + var model = this._models[strURL]; + model.onEvents(e); + }; + EditorSimpleWorker.prototype.acceptRemovedModel = function (strURL) { + if (!this._models[strURL]) { + return; + } + delete this._models[strURL]; + }; + // ---- BEGIN diff -------------------------------------------------------------------------- + EditorSimpleWorker.prototype.computeDiff = function (originalUrl, modifiedUrl, ignoreTrimWhitespace, maxComputationTime) { + return __awaiter(this, void 0, void 0, function () { + var original, modified, originalLines, modifiedLines, diffComputer, diffResult, identical; + return __generator(this, function (_a) { + original = this._getModel(originalUrl); + modified = this._getModel(modifiedUrl); + if (!original || !modified) { + return [2 /*return*/, null]; + } + originalLines = original.getLinesContent(); + modifiedLines = modified.getLinesContent(); + diffComputer = new _diff_diffComputer_js__WEBPACK_IMPORTED_MODULE_7__["DiffComputer"](originalLines, modifiedLines, { + shouldComputeCharChanges: true, + shouldPostProcessCharChanges: true, + shouldIgnoreTrimWhitespace: ignoreTrimWhitespace, + shouldMakePrettyDiff: true, + maxComputationTime: maxComputationTime + }); + diffResult = diffComputer.computeDiff(); + identical = (diffResult.changes.length > 0 ? false : this._modelsAreIdentical(original, modified)); + return [2 /*return*/, { + quitEarly: diffResult.quitEarly, + identical: identical, + changes: diffResult.changes + }]; + }); + }); + }; + EditorSimpleWorker.prototype._modelsAreIdentical = function (original, modified) { + var originalLineCount = original.getLineCount(); + var modifiedLineCount = modified.getLineCount(); + if (originalLineCount !== modifiedLineCount) { + return false; + } + for (var line = 1; line <= originalLineCount; line++) { + var originalLine = original.getLineContent(line); + var modifiedLine = modified.getLineContent(line); + if (originalLine !== modifiedLine) { + return false; + } + } + return true; + }; + EditorSimpleWorker.prototype.computeMoreMinimalEdits = function (modelUrl, edits) { + return __awaiter(this, void 0, void 0, function () { + var model, result, lastEol, _i, edits_1, _a, range, text, eol, original, changes, editOffset, _b, changes_1, change, start, end, newEdit; + return __generator(this, function (_c) { + model = this._getModel(modelUrl); + if (!model) { + return [2 /*return*/, edits]; + } + result = []; + lastEol = undefined; + edits = Object(_base_common_arrays_js__WEBPACK_IMPORTED_MODULE_0__["mergeSort"])(edits, function (a, b) { + if (a.range && b.range) { + return _core_range_js__WEBPACK_IMPORTED_MODULE_6__["Range"].compareRangesUsingStarts(a.range, b.range); + } + // eol only changes should go to the end + var aRng = a.range ? 0 : 1; + var bRng = b.range ? 0 : 1; + return aRng - bRng; + }); + for (_i = 0, edits_1 = edits; _i < edits_1.length; _i++) { + _a = edits_1[_i], range = _a.range, text = _a.text, eol = _a.eol; + if (typeof eol === 'number') { + lastEol = eol; + } + if (_core_range_js__WEBPACK_IMPORTED_MODULE_6__["Range"].isEmpty(range) && !text) { + // empty change + continue; + } + original = model.getValueInRange(range); + text = text.replace(/\r\n|\n|\r/g, model.eol); + if (original === text) { + // noop + continue; + } + // make sure diff won't take too long + if (Math.max(text.length, original.length) > EditorSimpleWorker._diffLimit) { + result.push({ range: range, text: text }); + continue; + } + changes = Object(_base_common_diff_diff_js__WEBPACK_IMPORTED_MODULE_1__["stringDiff"])(original, text, false); + editOffset = model.offsetAt(_core_range_js__WEBPACK_IMPORTED_MODULE_6__["Range"].lift(range).getStartPosition()); + for (_b = 0, changes_1 = changes; _b < changes_1.length; _b++) { + change = changes_1[_b]; + start = model.positionAt(editOffset + change.originalStart); + end = model.positionAt(editOffset + change.originalStart + change.originalLength); + newEdit = { + text: text.substr(change.modifiedStart, change.modifiedLength), + range: { startLineNumber: start.lineNumber, startColumn: start.column, endLineNumber: end.lineNumber, endColumn: end.column } + }; + if (model.getValueInRange(newEdit.range) !== newEdit.text) { + result.push(newEdit); + } + } + } + if (typeof lastEol === 'number') { + result.push({ eol: lastEol, text: '', range: { startLineNumber: 0, startColumn: 0, endLineNumber: 0, endColumn: 0 } }); + } + return [2 /*return*/, result]; + }); + }); + }; + // ---- END minimal edits --------------------------------------------------------------- + EditorSimpleWorker.prototype.computeLinks = function (modelUrl) { + return __awaiter(this, void 0, void 0, function () { + var model; + return __generator(this, function (_a) { + model = this._getModel(modelUrl); + if (!model) { + return [2 /*return*/, null]; + } + return [2 /*return*/, Object(_modes_linkComputer_js__WEBPACK_IMPORTED_MODULE_10__["computeLinks"])(model)]; + }); + }); + }; + EditorSimpleWorker.prototype.textualSuggest = function (modelUrl, position, wordDef, wordDefFlags) { + return __awaiter(this, void 0, void 0, function () { + var model, words, seen, wordDefRegExp, wordAt, iter, e, word; + return __generator(this, function (_a) { + model = this._getModel(modelUrl); + if (!model) { + return [2 /*return*/, null]; + } + words = []; + seen = new Set(); + wordDefRegExp = new RegExp(wordDef, wordDefFlags); + wordAt = model.getWordAtPosition(position, wordDefRegExp); + if (wordAt) { + seen.add(model.getValueInRange(wordAt)); + } + for (iter = model.createWordIterator(wordDefRegExp), e = iter.next(); !e.done && seen.size <= EditorSimpleWorker._suggestionsLimit; e = iter.next()) { + word = e.value; + if (seen.has(word)) { + continue; + } + seen.add(word); + if (!isNaN(Number(word))) { + continue; + } + words.push(word); + } + return [2 /*return*/, words]; + }); + }); + }; + // ---- END suggest -------------------------------------------------------------------------- + //#region -- word ranges -- + EditorSimpleWorker.prototype.computeWordRanges = function (modelUrl, range, wordDef, wordDefFlags) { + return __awaiter(this, void 0, void 0, function () { + var model, wordDefRegExp, result, line, words, _i, words_1, word, array; + return __generator(this, function (_a) { + model = this._getModel(modelUrl); + if (!model) { + return [2 /*return*/, Object.create(null)]; + } + wordDefRegExp = new RegExp(wordDef, wordDefFlags); + result = Object.create(null); + for (line = range.startLineNumber; line < range.endLineNumber; line++) { + words = model.getLineWords(line, wordDefRegExp); + for (_i = 0, words_1 = words; _i < words_1.length; _i++) { + word = words_1[_i]; + if (!isNaN(Number(word.word))) { + continue; + } + array = result[word.word]; + if (!array) { + array = []; + result[word.word] = array; + } + array.push({ + startLineNumber: line, + startColumn: word.startColumn, + endLineNumber: line, + endColumn: word.endColumn + }); + } + } + return [2 /*return*/, result]; + }); + }); + }; + //#endregion + EditorSimpleWorker.prototype.navigateValueSet = function (modelUrl, range, up, wordDef, wordDefFlags) { + return __awaiter(this, void 0, void 0, function () { + var model, wordDefRegExp, selectionText, wordRange, word, result; + return __generator(this, function (_a) { + model = this._getModel(modelUrl); + if (!model) { + return [2 /*return*/, null]; + } + wordDefRegExp = new RegExp(wordDef, wordDefFlags); + if (range.startColumn === range.endColumn) { + range = { + startLineNumber: range.startLineNumber, + startColumn: range.startColumn, + endLineNumber: range.endLineNumber, + endColumn: range.endColumn + 1 + }; + } + selectionText = model.getValueInRange(range); + wordRange = model.getWordAtPosition({ lineNumber: range.startLineNumber, column: range.startColumn }, wordDefRegExp); + if (!wordRange) { + return [2 /*return*/, null]; + } + word = model.getValueInRange(wordRange); + result = _modes_supports_inplaceReplaceSupport_js__WEBPACK_IMPORTED_MODULE_11__["BasicInplaceReplace"].INSTANCE.navigateValueSet(range, selectionText, wordRange, word, up); + return [2 /*return*/, result]; + }); + }); + }; + // ---- BEGIN foreign module support -------------------------------------------------------------------------- + EditorSimpleWorker.prototype.loadForeignModule = function (moduleId, createData, foreignHostMethods) { + var _this = this; + var proxyMethodRequest = function (method, args) { + return _this._host.fhr(method, args); + }; + var foreignHost = _base_common_types_js__WEBPACK_IMPORTED_MODULE_13__["createProxyObject"](foreignHostMethods, proxyMethodRequest); + var ctx = { + host: foreignHost, + getMirrorModels: function () { + return _this._getModels(); + } + }; + if (this._foreignModuleFactory) { + this._foreignModule = this._foreignModuleFactory(ctx, createData); + // static foreing module + return Promise.resolve(_base_common_types_js__WEBPACK_IMPORTED_MODULE_13__["getAllMethodNames"](this._foreignModule)); + } + // ESM-comment-begin + // return new Promise((resolve, reject) => { + // require([moduleId], (foreignModule: { create: IForeignModuleFactory }) => { + // this._foreignModule = foreignModule.create(ctx, createData); + // + // resolve(types.getAllMethodNames(this._foreignModule)); + // + // }, reject); + // }); + // ESM-comment-end + // ESM-uncomment-begin + return Promise.reject(new Error("Unexpected usage")); + // ESM-uncomment-end + }; + // foreign method request + EditorSimpleWorker.prototype.fmr = function (method, args) { + if (!this._foreignModule || typeof this._foreignModule[method] !== 'function') { + return Promise.reject(new Error('Missing requestHandler or method: ' + method)); + } + try { + return Promise.resolve(this._foreignModule[method].apply(this._foreignModule, args)); + } + catch (e) { + return Promise.reject(e); + } + }; + // ---- END diff -------------------------------------------------------------------------- + // ---- BEGIN minimal edits --------------------------------------------------------------- + EditorSimpleWorker._diffLimit = 100000; + // ---- BEGIN suggest -------------------------------------------------------------------------- + EditorSimpleWorker._suggestionsLimit = 10000; + return EditorSimpleWorker; +}()); + +/** + * Called on the worker side + * @internal + */ +function create(host) { + return new EditorSimpleWorker(host, null); +} +if (typeof importScripts === 'function') { + // Running in a web worker + _base_common_platform_js__WEBPACK_IMPORTED_MODULE_3__["globals"].monaco = Object(_standalone_standaloneBase_js__WEBPACK_IMPORTED_MODULE_12__["createMonacoBaseAPI"])(); +} /***/ }), @@ -7416,51 +8184,51 @@ __webpack_require__.r(__webpack_exports__); /* harmony import */ var _core_selection_js__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../core/selection.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/selection.js"); /* harmony import */ var _core_token_js__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ../core/token.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/token.js"); /* harmony import */ var _standaloneEnums_js__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ./standaloneEnums.js */ "./node_modules/monaco-editor/esm/vs/editor/common/standalone/standaloneEnums.js"); -/*--------------------------------------------------------------------------------------------- - * Copyright (c) Microsoft Corporation. All rights reserved. - * Licensed under the MIT License. See License.txt in the project root for license information. - *--------------------------------------------------------------------------------------------*/ - - - - - - - - - - -var KeyMod = /** @class */ (function () { - function KeyMod() { - } - KeyMod.chord = function (firstPart, secondPart) { - return Object(_base_common_keyCodes_js__WEBPACK_IMPORTED_MODULE_3__["KeyChord"])(firstPart, secondPart); - }; - KeyMod.CtrlCmd = 2048 /* CtrlCmd */; - KeyMod.Shift = 1024 /* Shift */; - KeyMod.Alt = 512 /* Alt */; - KeyMod.WinCtrl = 256 /* WinCtrl */; - return KeyMod; -}()); - -function createMonacoBaseAPI() { - return { - editor: undefined, - languages: undefined, - CancellationTokenSource: _base_common_cancellation_js__WEBPACK_IMPORTED_MODULE_1__["CancellationTokenSource"], - Emitter: _base_common_event_js__WEBPACK_IMPORTED_MODULE_2__["Emitter"], - KeyCode: _standaloneEnums_js__WEBPACK_IMPORTED_MODULE_9__["KeyCode"], - KeyMod: KeyMod, - Position: _core_position_js__WEBPACK_IMPORTED_MODULE_5__["Position"], - Range: _core_range_js__WEBPACK_IMPORTED_MODULE_6__["Range"], - Selection: _core_selection_js__WEBPACK_IMPORTED_MODULE_7__["Selection"], - SelectionDirection: _standaloneEnums_js__WEBPACK_IMPORTED_MODULE_9__["SelectionDirection"], - MarkerSeverity: _standaloneEnums_js__WEBPACK_IMPORTED_MODULE_9__["MarkerSeverity"], - MarkerTag: _standaloneEnums_js__WEBPACK_IMPORTED_MODULE_9__["MarkerTag"], - Uri: _base_common_uri_js__WEBPACK_IMPORTED_MODULE_4__["URI"], - Token: _core_token_js__WEBPACK_IMPORTED_MODULE_8__["Token"] - }; -} +/*--------------------------------------------------------------------------------------------- + * Copyright (c) Microsoft Corporation. All rights reserved. + * Licensed under the MIT License. See License.txt in the project root for license information. + *--------------------------------------------------------------------------------------------*/ + + + + + + + + + + +var KeyMod = /** @class */ (function () { + function KeyMod() { + } + KeyMod.chord = function (firstPart, secondPart) { + return Object(_base_common_keyCodes_js__WEBPACK_IMPORTED_MODULE_3__["KeyChord"])(firstPart, secondPart); + }; + KeyMod.CtrlCmd = 2048 /* CtrlCmd */; + KeyMod.Shift = 1024 /* Shift */; + KeyMod.Alt = 512 /* Alt */; + KeyMod.WinCtrl = 256 /* WinCtrl */; + return KeyMod; +}()); + +function createMonacoBaseAPI() { + return { + editor: undefined, + languages: undefined, + CancellationTokenSource: _base_common_cancellation_js__WEBPACK_IMPORTED_MODULE_1__["CancellationTokenSource"], + Emitter: _base_common_event_js__WEBPACK_IMPORTED_MODULE_2__["Emitter"], + KeyCode: _standaloneEnums_js__WEBPACK_IMPORTED_MODULE_9__["KeyCode"], + KeyMod: KeyMod, + Position: _core_position_js__WEBPACK_IMPORTED_MODULE_5__["Position"], + Range: _core_range_js__WEBPACK_IMPORTED_MODULE_6__["Range"], + Selection: _core_selection_js__WEBPACK_IMPORTED_MODULE_7__["Selection"], + SelectionDirection: _standaloneEnums_js__WEBPACK_IMPORTED_MODULE_9__["SelectionDirection"], + MarkerSeverity: _standaloneEnums_js__WEBPACK_IMPORTED_MODULE_9__["MarkerSeverity"], + MarkerTag: _standaloneEnums_js__WEBPACK_IMPORTED_MODULE_9__["MarkerTag"], + Uri: _base_common_uri_js__WEBPACK_IMPORTED_MODULE_4__["URI"], + Token: _core_token_js__WEBPACK_IMPORTED_MODULE_8__["Token"] + }; +} /***/ }), @@ -7469,7 +8237,7 @@ function createMonacoBaseAPI() { /*!***************************************************************************************!*\ !*** ./node_modules/monaco-editor/esm/vs/editor/common/standalone/standaloneEnums.js ***! \***************************************************************************************/ -/*! exports provided: MarkerTag, MarkerSeverity, KeyCode, SelectionDirection, ScrollbarVisibility, OverviewRulerLane, EndOfLinePreference, DefaultEndOfLine, EndOfLineSequence, TrackedRangeStickiness, ScrollType, CursorChangeReason, RenderMinimap, WrappingIndent, TextEditorCursorBlinkingStyle, TextEditorCursorStyle, RenderLineNumbersType, ContentWidgetPositionPreference, OverlayWidgetPositionPreference, MouseTargetType, IndentAction, CompletionItemKind, CompletionItemInsertTextRule, CompletionTriggerKind, SignatureHelpTriggerKind, DocumentHighlightKind, SymbolKind */ +/*! exports provided: MarkerTag, MarkerSeverity, KeyCode, SelectionDirection, ScrollbarVisibility, OverviewRulerLane, MinimapPosition, EndOfLinePreference, DefaultEndOfLine, EndOfLineSequence, TrackedRangeStickiness, ScrollType, CursorChangeReason, RenderMinimap, ContentWidgetPositionPreference, OverlayWidgetPositionPreference, MouseTargetType, IndentAction, CompletionItemKind, CompletionItemTag, CompletionItemInsertTextRule, CompletionTriggerKind, SignatureHelpTriggerKind, DocumentHighlightKind, SymbolKind, SymbolTag */ /***/ (function(module, __webpack_exports__, __webpack_require__) { "use strict"; @@ -7480,6 +8248,7 @@ __webpack_require__.r(__webpack_exports__); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "SelectionDirection", function() { return SelectionDirection; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "ScrollbarVisibility", function() { return ScrollbarVisibility; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "OverviewRulerLane", function() { return OverviewRulerLane; }); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "MinimapPosition", function() { return MinimapPosition; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "EndOfLinePreference", function() { return EndOfLinePreference; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "DefaultEndOfLine", function() { return DefaultEndOfLine; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "EndOfLineSequence", function() { return EndOfLineSequence; }); @@ -7487,669 +8256,592 @@ __webpack_require__.r(__webpack_exports__); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "ScrollType", function() { return ScrollType; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "CursorChangeReason", function() { return CursorChangeReason; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "RenderMinimap", function() { return RenderMinimap; }); -/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "WrappingIndent", function() { return WrappingIndent; }); -/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "TextEditorCursorBlinkingStyle", function() { return TextEditorCursorBlinkingStyle; }); -/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "TextEditorCursorStyle", function() { return TextEditorCursorStyle; }); -/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "RenderLineNumbersType", function() { return RenderLineNumbersType; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "ContentWidgetPositionPreference", function() { return ContentWidgetPositionPreference; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "OverlayWidgetPositionPreference", function() { return OverlayWidgetPositionPreference; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "MouseTargetType", function() { return MouseTargetType; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "IndentAction", function() { return IndentAction; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "CompletionItemKind", function() { return CompletionItemKind; }); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "CompletionItemTag", function() { return CompletionItemTag; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "CompletionItemInsertTextRule", function() { return CompletionItemInsertTextRule; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "CompletionTriggerKind", function() { return CompletionTriggerKind; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "SignatureHelpTriggerKind", function() { return SignatureHelpTriggerKind; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "DocumentHighlightKind", function() { return DocumentHighlightKind; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "SymbolKind", function() { return SymbolKind; }); -/*--------------------------------------------------------------------------------------------- - * Copyright (c) Microsoft Corporation. All rights reserved. - * Licensed under the MIT License. See License.txt in the project root for license information. - *--------------------------------------------------------------------------------------------*/ -// THIS IS A GENERATED FILE. DO NOT EDIT DIRECTLY. -var MarkerTag; -(function (MarkerTag) { - MarkerTag[MarkerTag["Unnecessary"] = 1] = "Unnecessary"; -})(MarkerTag || (MarkerTag = {})); -var MarkerSeverity; -(function (MarkerSeverity) { - MarkerSeverity[MarkerSeverity["Hint"] = 1] = "Hint"; - MarkerSeverity[MarkerSeverity["Info"] = 2] = "Info"; - MarkerSeverity[MarkerSeverity["Warning"] = 4] = "Warning"; - MarkerSeverity[MarkerSeverity["Error"] = 8] = "Error"; -})(MarkerSeverity || (MarkerSeverity = {})); -/** - * Virtual Key Codes, the value does not hold any inherent meaning. - * Inspired somewhat from https://msdn.microsoft.com/en-us/library/windows/desktop/dd375731(v=vs.85).aspx - * But these are "more general", as they should work across browsers & OS`s. - */ -var KeyCode; -(function (KeyCode) { - /** - * Placed first to cover the 0 value of the enum. - */ - KeyCode[KeyCode["Unknown"] = 0] = "Unknown"; - KeyCode[KeyCode["Backspace"] = 1] = "Backspace"; - KeyCode[KeyCode["Tab"] = 2] = "Tab"; - KeyCode[KeyCode["Enter"] = 3] = "Enter"; - KeyCode[KeyCode["Shift"] = 4] = "Shift"; - KeyCode[KeyCode["Ctrl"] = 5] = "Ctrl"; - KeyCode[KeyCode["Alt"] = 6] = "Alt"; - KeyCode[KeyCode["PauseBreak"] = 7] = "PauseBreak"; - KeyCode[KeyCode["CapsLock"] = 8] = "CapsLock"; - KeyCode[KeyCode["Escape"] = 9] = "Escape"; - KeyCode[KeyCode["Space"] = 10] = "Space"; - KeyCode[KeyCode["PageUp"] = 11] = "PageUp"; - KeyCode[KeyCode["PageDown"] = 12] = "PageDown"; - KeyCode[KeyCode["End"] = 13] = "End"; - KeyCode[KeyCode["Home"] = 14] = "Home"; - KeyCode[KeyCode["LeftArrow"] = 15] = "LeftArrow"; - KeyCode[KeyCode["UpArrow"] = 16] = "UpArrow"; - KeyCode[KeyCode["RightArrow"] = 17] = "RightArrow"; - KeyCode[KeyCode["DownArrow"] = 18] = "DownArrow"; - KeyCode[KeyCode["Insert"] = 19] = "Insert"; - KeyCode[KeyCode["Delete"] = 20] = "Delete"; - KeyCode[KeyCode["KEY_0"] = 21] = "KEY_0"; - KeyCode[KeyCode["KEY_1"] = 22] = "KEY_1"; - KeyCode[KeyCode["KEY_2"] = 23] = "KEY_2"; - KeyCode[KeyCode["KEY_3"] = 24] = "KEY_3"; - KeyCode[KeyCode["KEY_4"] = 25] = "KEY_4"; - KeyCode[KeyCode["KEY_5"] = 26] = "KEY_5"; - KeyCode[KeyCode["KEY_6"] = 27] = "KEY_6"; - KeyCode[KeyCode["KEY_7"] = 28] = "KEY_7"; - KeyCode[KeyCode["KEY_8"] = 29] = "KEY_8"; - KeyCode[KeyCode["KEY_9"] = 30] = "KEY_9"; - KeyCode[KeyCode["KEY_A"] = 31] = "KEY_A"; - KeyCode[KeyCode["KEY_B"] = 32] = "KEY_B"; - KeyCode[KeyCode["KEY_C"] = 33] = "KEY_C"; - KeyCode[KeyCode["KEY_D"] = 34] = "KEY_D"; - KeyCode[KeyCode["KEY_E"] = 35] = "KEY_E"; - KeyCode[KeyCode["KEY_F"] = 36] = "KEY_F"; - KeyCode[KeyCode["KEY_G"] = 37] = "KEY_G"; - KeyCode[KeyCode["KEY_H"] = 38] = "KEY_H"; - KeyCode[KeyCode["KEY_I"] = 39] = "KEY_I"; - KeyCode[KeyCode["KEY_J"] = 40] = "KEY_J"; - KeyCode[KeyCode["KEY_K"] = 41] = "KEY_K"; - KeyCode[KeyCode["KEY_L"] = 42] = "KEY_L"; - KeyCode[KeyCode["KEY_M"] = 43] = "KEY_M"; - KeyCode[KeyCode["KEY_N"] = 44] = "KEY_N"; - KeyCode[KeyCode["KEY_O"] = 45] = "KEY_O"; - KeyCode[KeyCode["KEY_P"] = 46] = "KEY_P"; - KeyCode[KeyCode["KEY_Q"] = 47] = "KEY_Q"; - KeyCode[KeyCode["KEY_R"] = 48] = "KEY_R"; - KeyCode[KeyCode["KEY_S"] = 49] = "KEY_S"; - KeyCode[KeyCode["KEY_T"] = 50] = "KEY_T"; - KeyCode[KeyCode["KEY_U"] = 51] = "KEY_U"; - KeyCode[KeyCode["KEY_V"] = 52] = "KEY_V"; - KeyCode[KeyCode["KEY_W"] = 53] = "KEY_W"; - KeyCode[KeyCode["KEY_X"] = 54] = "KEY_X"; - KeyCode[KeyCode["KEY_Y"] = 55] = "KEY_Y"; - KeyCode[KeyCode["KEY_Z"] = 56] = "KEY_Z"; - KeyCode[KeyCode["Meta"] = 57] = "Meta"; - KeyCode[KeyCode["ContextMenu"] = 58] = "ContextMenu"; - KeyCode[KeyCode["F1"] = 59] = "F1"; - KeyCode[KeyCode["F2"] = 60] = "F2"; - KeyCode[KeyCode["F3"] = 61] = "F3"; - KeyCode[KeyCode["F4"] = 62] = "F4"; - KeyCode[KeyCode["F5"] = 63] = "F5"; - KeyCode[KeyCode["F6"] = 64] = "F6"; - KeyCode[KeyCode["F7"] = 65] = "F7"; - KeyCode[KeyCode["F8"] = 66] = "F8"; - KeyCode[KeyCode["F9"] = 67] = "F9"; - KeyCode[KeyCode["F10"] = 68] = "F10"; - KeyCode[KeyCode["F11"] = 69] = "F11"; - KeyCode[KeyCode["F12"] = 70] = "F12"; - KeyCode[KeyCode["F13"] = 71] = "F13"; - KeyCode[KeyCode["F14"] = 72] = "F14"; - KeyCode[KeyCode["F15"] = 73] = "F15"; - KeyCode[KeyCode["F16"] = 74] = "F16"; - KeyCode[KeyCode["F17"] = 75] = "F17"; - KeyCode[KeyCode["F18"] = 76] = "F18"; - KeyCode[KeyCode["F19"] = 77] = "F19"; - KeyCode[KeyCode["NumLock"] = 78] = "NumLock"; - KeyCode[KeyCode["ScrollLock"] = 79] = "ScrollLock"; - /** - * Used for miscellaneous characters; it can vary by keyboard. - * For the US standard keyboard, the ';:' key - */ - KeyCode[KeyCode["US_SEMICOLON"] = 80] = "US_SEMICOLON"; - /** - * For any country/region, the '+' key - * For the US standard keyboard, the '=+' key - */ - KeyCode[KeyCode["US_EQUAL"] = 81] = "US_EQUAL"; - /** - * For any country/region, the ',' key - * For the US standard keyboard, the ',<' key - */ - KeyCode[KeyCode["US_COMMA"] = 82] = "US_COMMA"; - /** - * For any country/region, the '-' key - * For the US standard keyboard, the '-_' key - */ - KeyCode[KeyCode["US_MINUS"] = 83] = "US_MINUS"; - /** - * For any country/region, the '.' key - * For the US standard keyboard, the '.>' key - */ - KeyCode[KeyCode["US_DOT"] = 84] = "US_DOT"; - /** - * Used for miscellaneous characters; it can vary by keyboard. - * For the US standard keyboard, the '/?' key - */ - KeyCode[KeyCode["US_SLASH"] = 85] = "US_SLASH"; - /** - * Used for miscellaneous characters; it can vary by keyboard. - * For the US standard keyboard, the '`~' key - */ - KeyCode[KeyCode["US_BACKTICK"] = 86] = "US_BACKTICK"; - /** - * Used for miscellaneous characters; it can vary by keyboard. - * For the US standard keyboard, the '[{' key - */ - KeyCode[KeyCode["US_OPEN_SQUARE_BRACKET"] = 87] = "US_OPEN_SQUARE_BRACKET"; - /** - * Used for miscellaneous characters; it can vary by keyboard. - * For the US standard keyboard, the '\|' key - */ - KeyCode[KeyCode["US_BACKSLASH"] = 88] = "US_BACKSLASH"; - /** - * Used for miscellaneous characters; it can vary by keyboard. - * For the US standard keyboard, the ']}' key - */ - KeyCode[KeyCode["US_CLOSE_SQUARE_BRACKET"] = 89] = "US_CLOSE_SQUARE_BRACKET"; - /** - * Used for miscellaneous characters; it can vary by keyboard. - * For the US standard keyboard, the ''"' key - */ - KeyCode[KeyCode["US_QUOTE"] = 90] = "US_QUOTE"; - /** - * Used for miscellaneous characters; it can vary by keyboard. - */ - KeyCode[KeyCode["OEM_8"] = 91] = "OEM_8"; - /** - * Either the angle bracket key or the backslash key on the RT 102-key keyboard. - */ - KeyCode[KeyCode["OEM_102"] = 92] = "OEM_102"; - KeyCode[KeyCode["NUMPAD_0"] = 93] = "NUMPAD_0"; - KeyCode[KeyCode["NUMPAD_1"] = 94] = "NUMPAD_1"; - KeyCode[KeyCode["NUMPAD_2"] = 95] = "NUMPAD_2"; - KeyCode[KeyCode["NUMPAD_3"] = 96] = "NUMPAD_3"; - KeyCode[KeyCode["NUMPAD_4"] = 97] = "NUMPAD_4"; - KeyCode[KeyCode["NUMPAD_5"] = 98] = "NUMPAD_5"; - KeyCode[KeyCode["NUMPAD_6"] = 99] = "NUMPAD_6"; - KeyCode[KeyCode["NUMPAD_7"] = 100] = "NUMPAD_7"; - KeyCode[KeyCode["NUMPAD_8"] = 101] = "NUMPAD_8"; - KeyCode[KeyCode["NUMPAD_9"] = 102] = "NUMPAD_9"; - KeyCode[KeyCode["NUMPAD_MULTIPLY"] = 103] = "NUMPAD_MULTIPLY"; - KeyCode[KeyCode["NUMPAD_ADD"] = 104] = "NUMPAD_ADD"; - KeyCode[KeyCode["NUMPAD_SEPARATOR"] = 105] = "NUMPAD_SEPARATOR"; - KeyCode[KeyCode["NUMPAD_SUBTRACT"] = 106] = "NUMPAD_SUBTRACT"; - KeyCode[KeyCode["NUMPAD_DECIMAL"] = 107] = "NUMPAD_DECIMAL"; - KeyCode[KeyCode["NUMPAD_DIVIDE"] = 108] = "NUMPAD_DIVIDE"; - /** - * Cover all key codes when IME is processing input. - */ - KeyCode[KeyCode["KEY_IN_COMPOSITION"] = 109] = "KEY_IN_COMPOSITION"; - KeyCode[KeyCode["ABNT_C1"] = 110] = "ABNT_C1"; - KeyCode[KeyCode["ABNT_C2"] = 111] = "ABNT_C2"; - /** - * Placed last to cover the length of the enum. - * Please do not depend on this value! - */ - KeyCode[KeyCode["MAX_VALUE"] = 112] = "MAX_VALUE"; -})(KeyCode || (KeyCode = {})); -/** - * The direction of a selection. - */ -var SelectionDirection; -(function (SelectionDirection) { - /** - * The selection starts above where it ends. - */ - SelectionDirection[SelectionDirection["LTR"] = 0] = "LTR"; - /** - * The selection starts below where it ends. - */ - SelectionDirection[SelectionDirection["RTL"] = 1] = "RTL"; -})(SelectionDirection || (SelectionDirection = {})); -var ScrollbarVisibility; -(function (ScrollbarVisibility) { - ScrollbarVisibility[ScrollbarVisibility["Auto"] = 1] = "Auto"; - ScrollbarVisibility[ScrollbarVisibility["Hidden"] = 2] = "Hidden"; - ScrollbarVisibility[ScrollbarVisibility["Visible"] = 3] = "Visible"; -})(ScrollbarVisibility || (ScrollbarVisibility = {})); -/** - * Vertical Lane in the overview ruler of the editor. - */ -var OverviewRulerLane; -(function (OverviewRulerLane) { - OverviewRulerLane[OverviewRulerLane["Left"] = 1] = "Left"; - OverviewRulerLane[OverviewRulerLane["Center"] = 2] = "Center"; - OverviewRulerLane[OverviewRulerLane["Right"] = 4] = "Right"; - OverviewRulerLane[OverviewRulerLane["Full"] = 7] = "Full"; -})(OverviewRulerLane || (OverviewRulerLane = {})); -/** - * End of line character preference. - */ -var EndOfLinePreference; -(function (EndOfLinePreference) { - /** - * Use the end of line character identified in the text buffer. - */ - EndOfLinePreference[EndOfLinePreference["TextDefined"] = 0] = "TextDefined"; - /** - * Use line feed (\n) as the end of line character. - */ - EndOfLinePreference[EndOfLinePreference["LF"] = 1] = "LF"; - /** - * Use carriage return and line feed (\r\n) as the end of line character. - */ - EndOfLinePreference[EndOfLinePreference["CRLF"] = 2] = "CRLF"; -})(EndOfLinePreference || (EndOfLinePreference = {})); -/** - * The default end of line to use when instantiating models. - */ -var DefaultEndOfLine; -(function (DefaultEndOfLine) { - /** - * Use line feed (\n) as the end of line character. - */ - DefaultEndOfLine[DefaultEndOfLine["LF"] = 1] = "LF"; - /** - * Use carriage return and line feed (\r\n) as the end of line character. - */ - DefaultEndOfLine[DefaultEndOfLine["CRLF"] = 2] = "CRLF"; -})(DefaultEndOfLine || (DefaultEndOfLine = {})); -/** - * End of line character preference. - */ -var EndOfLineSequence; -(function (EndOfLineSequence) { - /** - * Use line feed (\n) as the end of line character. - */ - EndOfLineSequence[EndOfLineSequence["LF"] = 0] = "LF"; - /** - * Use carriage return and line feed (\r\n) as the end of line character. - */ - EndOfLineSequence[EndOfLineSequence["CRLF"] = 1] = "CRLF"; -})(EndOfLineSequence || (EndOfLineSequence = {})); -/** - * Describes the behavior of decorations when typing/editing near their edges. - * Note: Please do not edit the values, as they very carefully match `DecorationRangeBehavior` - */ -var TrackedRangeStickiness; -(function (TrackedRangeStickiness) { - TrackedRangeStickiness[TrackedRangeStickiness["AlwaysGrowsWhenTypingAtEdges"] = 0] = "AlwaysGrowsWhenTypingAtEdges"; - TrackedRangeStickiness[TrackedRangeStickiness["NeverGrowsWhenTypingAtEdges"] = 1] = "NeverGrowsWhenTypingAtEdges"; - TrackedRangeStickiness[TrackedRangeStickiness["GrowsOnlyWhenTypingBefore"] = 2] = "GrowsOnlyWhenTypingBefore"; - TrackedRangeStickiness[TrackedRangeStickiness["GrowsOnlyWhenTypingAfter"] = 3] = "GrowsOnlyWhenTypingAfter"; -})(TrackedRangeStickiness || (TrackedRangeStickiness = {})); -var ScrollType; -(function (ScrollType) { - ScrollType[ScrollType["Smooth"] = 0] = "Smooth"; - ScrollType[ScrollType["Immediate"] = 1] = "Immediate"; -})(ScrollType || (ScrollType = {})); -/** - * Describes the reason the cursor has changed its position. - */ -var CursorChangeReason; -(function (CursorChangeReason) { - /** - * Unknown or not set. - */ - CursorChangeReason[CursorChangeReason["NotSet"] = 0] = "NotSet"; - /** - * A `model.setValue()` was called. - */ - CursorChangeReason[CursorChangeReason["ContentFlush"] = 1] = "ContentFlush"; - /** - * The `model` has been changed outside of this cursor and the cursor recovers its position from associated markers. - */ - CursorChangeReason[CursorChangeReason["RecoverFromMarkers"] = 2] = "RecoverFromMarkers"; - /** - * There was an explicit user gesture. - */ - CursorChangeReason[CursorChangeReason["Explicit"] = 3] = "Explicit"; - /** - * There was a Paste. - */ - CursorChangeReason[CursorChangeReason["Paste"] = 4] = "Paste"; - /** - * There was an Undo. - */ - CursorChangeReason[CursorChangeReason["Undo"] = 5] = "Undo"; - /** - * There was a Redo. - */ - CursorChangeReason[CursorChangeReason["Redo"] = 6] = "Redo"; -})(CursorChangeReason || (CursorChangeReason = {})); -var RenderMinimap; -(function (RenderMinimap) { - RenderMinimap[RenderMinimap["None"] = 0] = "None"; - RenderMinimap[RenderMinimap["Small"] = 1] = "Small"; - RenderMinimap[RenderMinimap["Large"] = 2] = "Large"; - RenderMinimap[RenderMinimap["SmallBlocks"] = 3] = "SmallBlocks"; - RenderMinimap[RenderMinimap["LargeBlocks"] = 4] = "LargeBlocks"; -})(RenderMinimap || (RenderMinimap = {})); -/** - * Describes how to indent wrapped lines. - */ -var WrappingIndent; -(function (WrappingIndent) { - /** - * No indentation => wrapped lines begin at column 1. - */ - WrappingIndent[WrappingIndent["None"] = 0] = "None"; - /** - * Same => wrapped lines get the same indentation as the parent. - */ - WrappingIndent[WrappingIndent["Same"] = 1] = "Same"; - /** - * Indent => wrapped lines get +1 indentation toward the parent. - */ - WrappingIndent[WrappingIndent["Indent"] = 2] = "Indent"; - /** - * DeepIndent => wrapped lines get +2 indentation toward the parent. - */ - WrappingIndent[WrappingIndent["DeepIndent"] = 3] = "DeepIndent"; -})(WrappingIndent || (WrappingIndent = {})); -/** - * The kind of animation in which the editor's cursor should be rendered. - */ -var TextEditorCursorBlinkingStyle; -(function (TextEditorCursorBlinkingStyle) { - /** - * Hidden - */ - TextEditorCursorBlinkingStyle[TextEditorCursorBlinkingStyle["Hidden"] = 0] = "Hidden"; - /** - * Blinking - */ - TextEditorCursorBlinkingStyle[TextEditorCursorBlinkingStyle["Blink"] = 1] = "Blink"; - /** - * Blinking with smooth fading - */ - TextEditorCursorBlinkingStyle[TextEditorCursorBlinkingStyle["Smooth"] = 2] = "Smooth"; - /** - * Blinking with prolonged filled state and smooth fading - */ - TextEditorCursorBlinkingStyle[TextEditorCursorBlinkingStyle["Phase"] = 3] = "Phase"; - /** - * Expand collapse animation on the y axis - */ - TextEditorCursorBlinkingStyle[TextEditorCursorBlinkingStyle["Expand"] = 4] = "Expand"; - /** - * No-Blinking - */ - TextEditorCursorBlinkingStyle[TextEditorCursorBlinkingStyle["Solid"] = 5] = "Solid"; -})(TextEditorCursorBlinkingStyle || (TextEditorCursorBlinkingStyle = {})); -/** - * The style in which the editor's cursor should be rendered. - */ -var TextEditorCursorStyle; -(function (TextEditorCursorStyle) { - /** - * As a vertical line (sitting between two characters). - */ - TextEditorCursorStyle[TextEditorCursorStyle["Line"] = 1] = "Line"; - /** - * As a block (sitting on top of a character). - */ - TextEditorCursorStyle[TextEditorCursorStyle["Block"] = 2] = "Block"; - /** - * As a horizontal line (sitting under a character). - */ - TextEditorCursorStyle[TextEditorCursorStyle["Underline"] = 3] = "Underline"; - /** - * As a thin vertical line (sitting between two characters). - */ - TextEditorCursorStyle[TextEditorCursorStyle["LineThin"] = 4] = "LineThin"; - /** - * As an outlined block (sitting on top of a character). - */ - TextEditorCursorStyle[TextEditorCursorStyle["BlockOutline"] = 5] = "BlockOutline"; - /** - * As a thin horizontal line (sitting under a character). - */ - TextEditorCursorStyle[TextEditorCursorStyle["UnderlineThin"] = 6] = "UnderlineThin"; -})(TextEditorCursorStyle || (TextEditorCursorStyle = {})); -var RenderLineNumbersType; -(function (RenderLineNumbersType) { - RenderLineNumbersType[RenderLineNumbersType["Off"] = 0] = "Off"; - RenderLineNumbersType[RenderLineNumbersType["On"] = 1] = "On"; - RenderLineNumbersType[RenderLineNumbersType["Relative"] = 2] = "Relative"; - RenderLineNumbersType[RenderLineNumbersType["Interval"] = 3] = "Interval"; - RenderLineNumbersType[RenderLineNumbersType["Custom"] = 4] = "Custom"; -})(RenderLineNumbersType || (RenderLineNumbersType = {})); -/** - * A positioning preference for rendering content widgets. - */ -var ContentWidgetPositionPreference; -(function (ContentWidgetPositionPreference) { - /** - * Place the content widget exactly at a position - */ - ContentWidgetPositionPreference[ContentWidgetPositionPreference["EXACT"] = 0] = "EXACT"; - /** - * Place the content widget above a position - */ - ContentWidgetPositionPreference[ContentWidgetPositionPreference["ABOVE"] = 1] = "ABOVE"; - /** - * Place the content widget below a position - */ - ContentWidgetPositionPreference[ContentWidgetPositionPreference["BELOW"] = 2] = "BELOW"; -})(ContentWidgetPositionPreference || (ContentWidgetPositionPreference = {})); -/** - * A positioning preference for rendering overlay widgets. - */ -var OverlayWidgetPositionPreference; -(function (OverlayWidgetPositionPreference) { - /** - * Position the overlay widget in the top right corner - */ - OverlayWidgetPositionPreference[OverlayWidgetPositionPreference["TOP_RIGHT_CORNER"] = 0] = "TOP_RIGHT_CORNER"; - /** - * Position the overlay widget in the bottom right corner - */ - OverlayWidgetPositionPreference[OverlayWidgetPositionPreference["BOTTOM_RIGHT_CORNER"] = 1] = "BOTTOM_RIGHT_CORNER"; - /** - * Position the overlay widget in the top center - */ - OverlayWidgetPositionPreference[OverlayWidgetPositionPreference["TOP_CENTER"] = 2] = "TOP_CENTER"; -})(OverlayWidgetPositionPreference || (OverlayWidgetPositionPreference = {})); -/** - * Type of hit element with the mouse in the editor. - */ -var MouseTargetType; -(function (MouseTargetType) { - /** - * Mouse is on top of an unknown element. - */ - MouseTargetType[MouseTargetType["UNKNOWN"] = 0] = "UNKNOWN"; - /** - * Mouse is on top of the textarea used for input. - */ - MouseTargetType[MouseTargetType["TEXTAREA"] = 1] = "TEXTAREA"; - /** - * Mouse is on top of the glyph margin - */ - MouseTargetType[MouseTargetType["GUTTER_GLYPH_MARGIN"] = 2] = "GUTTER_GLYPH_MARGIN"; - /** - * Mouse is on top of the line numbers - */ - MouseTargetType[MouseTargetType["GUTTER_LINE_NUMBERS"] = 3] = "GUTTER_LINE_NUMBERS"; - /** - * Mouse is on top of the line decorations - */ - MouseTargetType[MouseTargetType["GUTTER_LINE_DECORATIONS"] = 4] = "GUTTER_LINE_DECORATIONS"; - /** - * Mouse is on top of the whitespace left in the gutter by a view zone. - */ - MouseTargetType[MouseTargetType["GUTTER_VIEW_ZONE"] = 5] = "GUTTER_VIEW_ZONE"; - /** - * Mouse is on top of text in the content. - */ - MouseTargetType[MouseTargetType["CONTENT_TEXT"] = 6] = "CONTENT_TEXT"; - /** - * Mouse is on top of empty space in the content (e.g. after line text or below last line) - */ - MouseTargetType[MouseTargetType["CONTENT_EMPTY"] = 7] = "CONTENT_EMPTY"; - /** - * Mouse is on top of a view zone in the content. - */ - MouseTargetType[MouseTargetType["CONTENT_VIEW_ZONE"] = 8] = "CONTENT_VIEW_ZONE"; - /** - * Mouse is on top of a content widget. - */ - MouseTargetType[MouseTargetType["CONTENT_WIDGET"] = 9] = "CONTENT_WIDGET"; - /** - * Mouse is on top of the decorations overview ruler. - */ - MouseTargetType[MouseTargetType["OVERVIEW_RULER"] = 10] = "OVERVIEW_RULER"; - /** - * Mouse is on top of a scrollbar. - */ - MouseTargetType[MouseTargetType["SCROLLBAR"] = 11] = "SCROLLBAR"; - /** - * Mouse is on top of an overlay widget. - */ - MouseTargetType[MouseTargetType["OVERLAY_WIDGET"] = 12] = "OVERLAY_WIDGET"; - /** - * Mouse is outside of the editor. - */ - MouseTargetType[MouseTargetType["OUTSIDE_EDITOR"] = 13] = "OUTSIDE_EDITOR"; -})(MouseTargetType || (MouseTargetType = {})); -/** - * Describes what to do with the indentation when pressing Enter. - */ -var IndentAction; -(function (IndentAction) { - /** - * Insert new line and copy the previous line's indentation. - */ - IndentAction[IndentAction["None"] = 0] = "None"; - /** - * Insert new line and indent once (relative to the previous line's indentation). - */ - IndentAction[IndentAction["Indent"] = 1] = "Indent"; - /** - * Insert two new lines: - * - the first one indented which will hold the cursor - * - the second one at the same indentation level - */ - IndentAction[IndentAction["IndentOutdent"] = 2] = "IndentOutdent"; - /** - * Insert new line and outdent once (relative to the previous line's indentation). - */ - IndentAction[IndentAction["Outdent"] = 3] = "Outdent"; -})(IndentAction || (IndentAction = {})); -var CompletionItemKind; -(function (CompletionItemKind) { - CompletionItemKind[CompletionItemKind["Method"] = 0] = "Method"; - CompletionItemKind[CompletionItemKind["Function"] = 1] = "Function"; - CompletionItemKind[CompletionItemKind["Constructor"] = 2] = "Constructor"; - CompletionItemKind[CompletionItemKind["Field"] = 3] = "Field"; - CompletionItemKind[CompletionItemKind["Variable"] = 4] = "Variable"; - CompletionItemKind[CompletionItemKind["Class"] = 5] = "Class"; - CompletionItemKind[CompletionItemKind["Struct"] = 6] = "Struct"; - CompletionItemKind[CompletionItemKind["Interface"] = 7] = "Interface"; - CompletionItemKind[CompletionItemKind["Module"] = 8] = "Module"; - CompletionItemKind[CompletionItemKind["Property"] = 9] = "Property"; - CompletionItemKind[CompletionItemKind["Event"] = 10] = "Event"; - CompletionItemKind[CompletionItemKind["Operator"] = 11] = "Operator"; - CompletionItemKind[CompletionItemKind["Unit"] = 12] = "Unit"; - CompletionItemKind[CompletionItemKind["Value"] = 13] = "Value"; - CompletionItemKind[CompletionItemKind["Constant"] = 14] = "Constant"; - CompletionItemKind[CompletionItemKind["Enum"] = 15] = "Enum"; - CompletionItemKind[CompletionItemKind["EnumMember"] = 16] = "EnumMember"; - CompletionItemKind[CompletionItemKind["Keyword"] = 17] = "Keyword"; - CompletionItemKind[CompletionItemKind["Text"] = 18] = "Text"; - CompletionItemKind[CompletionItemKind["Color"] = 19] = "Color"; - CompletionItemKind[CompletionItemKind["File"] = 20] = "File"; - CompletionItemKind[CompletionItemKind["Reference"] = 21] = "Reference"; - CompletionItemKind[CompletionItemKind["Customcolor"] = 22] = "Customcolor"; - CompletionItemKind[CompletionItemKind["Folder"] = 23] = "Folder"; - CompletionItemKind[CompletionItemKind["TypeParameter"] = 24] = "TypeParameter"; - CompletionItemKind[CompletionItemKind["Snippet"] = 25] = "Snippet"; -})(CompletionItemKind || (CompletionItemKind = {})); -var CompletionItemInsertTextRule; -(function (CompletionItemInsertTextRule) { - /** - * Adjust whitespace/indentation of multiline insert texts to - * match the current line indentation. - */ - CompletionItemInsertTextRule[CompletionItemInsertTextRule["KeepWhitespace"] = 1] = "KeepWhitespace"; - /** - * `insertText` is a snippet. - */ - CompletionItemInsertTextRule[CompletionItemInsertTextRule["InsertAsSnippet"] = 4] = "InsertAsSnippet"; -})(CompletionItemInsertTextRule || (CompletionItemInsertTextRule = {})); -/** - * How a suggest provider was triggered. - */ -var CompletionTriggerKind; -(function (CompletionTriggerKind) { - CompletionTriggerKind[CompletionTriggerKind["Invoke"] = 0] = "Invoke"; - CompletionTriggerKind[CompletionTriggerKind["TriggerCharacter"] = 1] = "TriggerCharacter"; - CompletionTriggerKind[CompletionTriggerKind["TriggerForIncompleteCompletions"] = 2] = "TriggerForIncompleteCompletions"; -})(CompletionTriggerKind || (CompletionTriggerKind = {})); -var SignatureHelpTriggerKind; -(function (SignatureHelpTriggerKind) { - SignatureHelpTriggerKind[SignatureHelpTriggerKind["Invoke"] = 1] = "Invoke"; - SignatureHelpTriggerKind[SignatureHelpTriggerKind["TriggerCharacter"] = 2] = "TriggerCharacter"; - SignatureHelpTriggerKind[SignatureHelpTriggerKind["ContentChange"] = 3] = "ContentChange"; -})(SignatureHelpTriggerKind || (SignatureHelpTriggerKind = {})); -/** - * A document highlight kind. - */ -var DocumentHighlightKind; -(function (DocumentHighlightKind) { - /** - * A textual occurrence. - */ - DocumentHighlightKind[DocumentHighlightKind["Text"] = 0] = "Text"; - /** - * Read-access of a symbol, like reading a variable. - */ - DocumentHighlightKind[DocumentHighlightKind["Read"] = 1] = "Read"; - /** - * Write-access of a symbol, like writing to a variable. - */ - DocumentHighlightKind[DocumentHighlightKind["Write"] = 2] = "Write"; -})(DocumentHighlightKind || (DocumentHighlightKind = {})); -/** - * A symbol kind. - */ -var SymbolKind; -(function (SymbolKind) { - SymbolKind[SymbolKind["File"] = 0] = "File"; - SymbolKind[SymbolKind["Module"] = 1] = "Module"; - SymbolKind[SymbolKind["Namespace"] = 2] = "Namespace"; - SymbolKind[SymbolKind["Package"] = 3] = "Package"; - SymbolKind[SymbolKind["Class"] = 4] = "Class"; - SymbolKind[SymbolKind["Method"] = 5] = "Method"; - SymbolKind[SymbolKind["Property"] = 6] = "Property"; - SymbolKind[SymbolKind["Field"] = 7] = "Field"; - SymbolKind[SymbolKind["Constructor"] = 8] = "Constructor"; - SymbolKind[SymbolKind["Enum"] = 9] = "Enum"; - SymbolKind[SymbolKind["Interface"] = 10] = "Interface"; - SymbolKind[SymbolKind["Function"] = 11] = "Function"; - SymbolKind[SymbolKind["Variable"] = 12] = "Variable"; - SymbolKind[SymbolKind["Constant"] = 13] = "Constant"; - SymbolKind[SymbolKind["String"] = 14] = "String"; - SymbolKind[SymbolKind["Number"] = 15] = "Number"; - SymbolKind[SymbolKind["Boolean"] = 16] = "Boolean"; - SymbolKind[SymbolKind["Array"] = 17] = "Array"; - SymbolKind[SymbolKind["Object"] = 18] = "Object"; - SymbolKind[SymbolKind["Key"] = 19] = "Key"; - SymbolKind[SymbolKind["Null"] = 20] = "Null"; - SymbolKind[SymbolKind["EnumMember"] = 21] = "EnumMember"; - SymbolKind[SymbolKind["Struct"] = 22] = "Struct"; - SymbolKind[SymbolKind["Event"] = 23] = "Event"; - SymbolKind[SymbolKind["Operator"] = 24] = "Operator"; - SymbolKind[SymbolKind["TypeParameter"] = 25] = "TypeParameter"; -})(SymbolKind || (SymbolKind = {})); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "SymbolTag", function() { return SymbolTag; }); +/*--------------------------------------------------------------------------------------------- + * Copyright (c) Microsoft Corporation. All rights reserved. + * Licensed under the MIT License. See License.txt in the project root for license information. + *--------------------------------------------------------------------------------------------*/ +// THIS IS A GENERATED FILE. DO NOT EDIT DIRECTLY. +var MarkerTag; +(function (MarkerTag) { + MarkerTag[MarkerTag["Unnecessary"] = 1] = "Unnecessary"; + MarkerTag[MarkerTag["Deprecated"] = 2] = "Deprecated"; +})(MarkerTag || (MarkerTag = {})); +var MarkerSeverity; +(function (MarkerSeverity) { + MarkerSeverity[MarkerSeverity["Hint"] = 1] = "Hint"; + MarkerSeverity[MarkerSeverity["Info"] = 2] = "Info"; + MarkerSeverity[MarkerSeverity["Warning"] = 4] = "Warning"; + MarkerSeverity[MarkerSeverity["Error"] = 8] = "Error"; +})(MarkerSeverity || (MarkerSeverity = {})); +/** + * Virtual Key Codes, the value does not hold any inherent meaning. + * Inspired somewhat from https://msdn.microsoft.com/en-us/library/windows/desktop/dd375731(v=vs.85).aspx + * But these are "more general", as they should work across browsers & OS`s. + */ +var KeyCode; +(function (KeyCode) { + /** + * Placed first to cover the 0 value of the enum. + */ + KeyCode[KeyCode["Unknown"] = 0] = "Unknown"; + KeyCode[KeyCode["Backspace"] = 1] = "Backspace"; + KeyCode[KeyCode["Tab"] = 2] = "Tab"; + KeyCode[KeyCode["Enter"] = 3] = "Enter"; + KeyCode[KeyCode["Shift"] = 4] = "Shift"; + KeyCode[KeyCode["Ctrl"] = 5] = "Ctrl"; + KeyCode[KeyCode["Alt"] = 6] = "Alt"; + KeyCode[KeyCode["PauseBreak"] = 7] = "PauseBreak"; + KeyCode[KeyCode["CapsLock"] = 8] = "CapsLock"; + KeyCode[KeyCode["Escape"] = 9] = "Escape"; + KeyCode[KeyCode["Space"] = 10] = "Space"; + KeyCode[KeyCode["PageUp"] = 11] = "PageUp"; + KeyCode[KeyCode["PageDown"] = 12] = "PageDown"; + KeyCode[KeyCode["End"] = 13] = "End"; + KeyCode[KeyCode["Home"] = 14] = "Home"; + KeyCode[KeyCode["LeftArrow"] = 15] = "LeftArrow"; + KeyCode[KeyCode["UpArrow"] = 16] = "UpArrow"; + KeyCode[KeyCode["RightArrow"] = 17] = "RightArrow"; + KeyCode[KeyCode["DownArrow"] = 18] = "DownArrow"; + KeyCode[KeyCode["Insert"] = 19] = "Insert"; + KeyCode[KeyCode["Delete"] = 20] = "Delete"; + KeyCode[KeyCode["KEY_0"] = 21] = "KEY_0"; + KeyCode[KeyCode["KEY_1"] = 22] = "KEY_1"; + KeyCode[KeyCode["KEY_2"] = 23] = "KEY_2"; + KeyCode[KeyCode["KEY_3"] = 24] = "KEY_3"; + KeyCode[KeyCode["KEY_4"] = 25] = "KEY_4"; + KeyCode[KeyCode["KEY_5"] = 26] = "KEY_5"; + KeyCode[KeyCode["KEY_6"] = 27] = "KEY_6"; + KeyCode[KeyCode["KEY_7"] = 28] = "KEY_7"; + KeyCode[KeyCode["KEY_8"] = 29] = "KEY_8"; + KeyCode[KeyCode["KEY_9"] = 30] = "KEY_9"; + KeyCode[KeyCode["KEY_A"] = 31] = "KEY_A"; + KeyCode[KeyCode["KEY_B"] = 32] = "KEY_B"; + KeyCode[KeyCode["KEY_C"] = 33] = "KEY_C"; + KeyCode[KeyCode["KEY_D"] = 34] = "KEY_D"; + KeyCode[KeyCode["KEY_E"] = 35] = "KEY_E"; + KeyCode[KeyCode["KEY_F"] = 36] = "KEY_F"; + KeyCode[KeyCode["KEY_G"] = 37] = "KEY_G"; + KeyCode[KeyCode["KEY_H"] = 38] = "KEY_H"; + KeyCode[KeyCode["KEY_I"] = 39] = "KEY_I"; + KeyCode[KeyCode["KEY_J"] = 40] = "KEY_J"; + KeyCode[KeyCode["KEY_K"] = 41] = "KEY_K"; + KeyCode[KeyCode["KEY_L"] = 42] = "KEY_L"; + KeyCode[KeyCode["KEY_M"] = 43] = "KEY_M"; + KeyCode[KeyCode["KEY_N"] = 44] = "KEY_N"; + KeyCode[KeyCode["KEY_O"] = 45] = "KEY_O"; + KeyCode[KeyCode["KEY_P"] = 46] = "KEY_P"; + KeyCode[KeyCode["KEY_Q"] = 47] = "KEY_Q"; + KeyCode[KeyCode["KEY_R"] = 48] = "KEY_R"; + KeyCode[KeyCode["KEY_S"] = 49] = "KEY_S"; + KeyCode[KeyCode["KEY_T"] = 50] = "KEY_T"; + KeyCode[KeyCode["KEY_U"] = 51] = "KEY_U"; + KeyCode[KeyCode["KEY_V"] = 52] = "KEY_V"; + KeyCode[KeyCode["KEY_W"] = 53] = "KEY_W"; + KeyCode[KeyCode["KEY_X"] = 54] = "KEY_X"; + KeyCode[KeyCode["KEY_Y"] = 55] = "KEY_Y"; + KeyCode[KeyCode["KEY_Z"] = 56] = "KEY_Z"; + KeyCode[KeyCode["Meta"] = 57] = "Meta"; + KeyCode[KeyCode["ContextMenu"] = 58] = "ContextMenu"; + KeyCode[KeyCode["F1"] = 59] = "F1"; + KeyCode[KeyCode["F2"] = 60] = "F2"; + KeyCode[KeyCode["F3"] = 61] = "F3"; + KeyCode[KeyCode["F4"] = 62] = "F4"; + KeyCode[KeyCode["F5"] = 63] = "F5"; + KeyCode[KeyCode["F6"] = 64] = "F6"; + KeyCode[KeyCode["F7"] = 65] = "F7"; + KeyCode[KeyCode["F8"] = 66] = "F8"; + KeyCode[KeyCode["F9"] = 67] = "F9"; + KeyCode[KeyCode["F10"] = 68] = "F10"; + KeyCode[KeyCode["F11"] = 69] = "F11"; + KeyCode[KeyCode["F12"] = 70] = "F12"; + KeyCode[KeyCode["F13"] = 71] = "F13"; + KeyCode[KeyCode["F14"] = 72] = "F14"; + KeyCode[KeyCode["F15"] = 73] = "F15"; + KeyCode[KeyCode["F16"] = 74] = "F16"; + KeyCode[KeyCode["F17"] = 75] = "F17"; + KeyCode[KeyCode["F18"] = 76] = "F18"; + KeyCode[KeyCode["F19"] = 77] = "F19"; + KeyCode[KeyCode["NumLock"] = 78] = "NumLock"; + KeyCode[KeyCode["ScrollLock"] = 79] = "ScrollLock"; + /** + * Used for miscellaneous characters; it can vary by keyboard. + * For the US standard keyboard, the ';:' key + */ + KeyCode[KeyCode["US_SEMICOLON"] = 80] = "US_SEMICOLON"; + /** + * For any country/region, the '+' key + * For the US standard keyboard, the '=+' key + */ + KeyCode[KeyCode["US_EQUAL"] = 81] = "US_EQUAL"; + /** + * For any country/region, the ',' key + * For the US standard keyboard, the ',<' key + */ + KeyCode[KeyCode["US_COMMA"] = 82] = "US_COMMA"; + /** + * For any country/region, the '-' key + * For the US standard keyboard, the '-_' key + */ + KeyCode[KeyCode["US_MINUS"] = 83] = "US_MINUS"; + /** + * For any country/region, the '.' key + * For the US standard keyboard, the '.>' key + */ + KeyCode[KeyCode["US_DOT"] = 84] = "US_DOT"; + /** + * Used for miscellaneous characters; it can vary by keyboard. + * For the US standard keyboard, the '/?' key + */ + KeyCode[KeyCode["US_SLASH"] = 85] = "US_SLASH"; + /** + * Used for miscellaneous characters; it can vary by keyboard. + * For the US standard keyboard, the '`~' key + */ + KeyCode[KeyCode["US_BACKTICK"] = 86] = "US_BACKTICK"; + /** + * Used for miscellaneous characters; it can vary by keyboard. + * For the US standard keyboard, the '[{' key + */ + KeyCode[KeyCode["US_OPEN_SQUARE_BRACKET"] = 87] = "US_OPEN_SQUARE_BRACKET"; + /** + * Used for miscellaneous characters; it can vary by keyboard. + * For the US standard keyboard, the '\|' key + */ + KeyCode[KeyCode["US_BACKSLASH"] = 88] = "US_BACKSLASH"; + /** + * Used for miscellaneous characters; it can vary by keyboard. + * For the US standard keyboard, the ']}' key + */ + KeyCode[KeyCode["US_CLOSE_SQUARE_BRACKET"] = 89] = "US_CLOSE_SQUARE_BRACKET"; + /** + * Used for miscellaneous characters; it can vary by keyboard. + * For the US standard keyboard, the ''"' key + */ + KeyCode[KeyCode["US_QUOTE"] = 90] = "US_QUOTE"; + /** + * Used for miscellaneous characters; it can vary by keyboard. + */ + KeyCode[KeyCode["OEM_8"] = 91] = "OEM_8"; + /** + * Either the angle bracket key or the backslash key on the RT 102-key keyboard. + */ + KeyCode[KeyCode["OEM_102"] = 92] = "OEM_102"; + KeyCode[KeyCode["NUMPAD_0"] = 93] = "NUMPAD_0"; + KeyCode[KeyCode["NUMPAD_1"] = 94] = "NUMPAD_1"; + KeyCode[KeyCode["NUMPAD_2"] = 95] = "NUMPAD_2"; + KeyCode[KeyCode["NUMPAD_3"] = 96] = "NUMPAD_3"; + KeyCode[KeyCode["NUMPAD_4"] = 97] = "NUMPAD_4"; + KeyCode[KeyCode["NUMPAD_5"] = 98] = "NUMPAD_5"; + KeyCode[KeyCode["NUMPAD_6"] = 99] = "NUMPAD_6"; + KeyCode[KeyCode["NUMPAD_7"] = 100] = "NUMPAD_7"; + KeyCode[KeyCode["NUMPAD_8"] = 101] = "NUMPAD_8"; + KeyCode[KeyCode["NUMPAD_9"] = 102] = "NUMPAD_9"; + KeyCode[KeyCode["NUMPAD_MULTIPLY"] = 103] = "NUMPAD_MULTIPLY"; + KeyCode[KeyCode["NUMPAD_ADD"] = 104] = "NUMPAD_ADD"; + KeyCode[KeyCode["NUMPAD_SEPARATOR"] = 105] = "NUMPAD_SEPARATOR"; + KeyCode[KeyCode["NUMPAD_SUBTRACT"] = 106] = "NUMPAD_SUBTRACT"; + KeyCode[KeyCode["NUMPAD_DECIMAL"] = 107] = "NUMPAD_DECIMAL"; + KeyCode[KeyCode["NUMPAD_DIVIDE"] = 108] = "NUMPAD_DIVIDE"; + /** + * Cover all key codes when IME is processing input. + */ + KeyCode[KeyCode["KEY_IN_COMPOSITION"] = 109] = "KEY_IN_COMPOSITION"; + KeyCode[KeyCode["ABNT_C1"] = 110] = "ABNT_C1"; + KeyCode[KeyCode["ABNT_C2"] = 111] = "ABNT_C2"; + /** + * Placed last to cover the length of the enum. + * Please do not depend on this value! + */ + KeyCode[KeyCode["MAX_VALUE"] = 112] = "MAX_VALUE"; +})(KeyCode || (KeyCode = {})); +/** + * The direction of a selection. + */ +var SelectionDirection; +(function (SelectionDirection) { + /** + * The selection starts above where it ends. + */ + SelectionDirection[SelectionDirection["LTR"] = 0] = "LTR"; + /** + * The selection starts below where it ends. + */ + SelectionDirection[SelectionDirection["RTL"] = 1] = "RTL"; +})(SelectionDirection || (SelectionDirection = {})); +var ScrollbarVisibility; +(function (ScrollbarVisibility) { + ScrollbarVisibility[ScrollbarVisibility["Auto"] = 1] = "Auto"; + ScrollbarVisibility[ScrollbarVisibility["Hidden"] = 2] = "Hidden"; + ScrollbarVisibility[ScrollbarVisibility["Visible"] = 3] = "Visible"; +})(ScrollbarVisibility || (ScrollbarVisibility = {})); +/** + * Vertical Lane in the overview ruler of the editor. + */ +var OverviewRulerLane; +(function (OverviewRulerLane) { + OverviewRulerLane[OverviewRulerLane["Left"] = 1] = "Left"; + OverviewRulerLane[OverviewRulerLane["Center"] = 2] = "Center"; + OverviewRulerLane[OverviewRulerLane["Right"] = 4] = "Right"; + OverviewRulerLane[OverviewRulerLane["Full"] = 7] = "Full"; +})(OverviewRulerLane || (OverviewRulerLane = {})); +/** + * Position in the minimap to render the decoration. + */ +var MinimapPosition; +(function (MinimapPosition) { + MinimapPosition[MinimapPosition["Inline"] = 1] = "Inline"; + MinimapPosition[MinimapPosition["Gutter"] = 2] = "Gutter"; +})(MinimapPosition || (MinimapPosition = {})); +/** + * End of line character preference. + */ +var EndOfLinePreference; +(function (EndOfLinePreference) { + /** + * Use the end of line character identified in the text buffer. + */ + EndOfLinePreference[EndOfLinePreference["TextDefined"] = 0] = "TextDefined"; + /** + * Use line feed (\n) as the end of line character. + */ + EndOfLinePreference[EndOfLinePreference["LF"] = 1] = "LF"; + /** + * Use carriage return and line feed (\r\n) as the end of line character. + */ + EndOfLinePreference[EndOfLinePreference["CRLF"] = 2] = "CRLF"; +})(EndOfLinePreference || (EndOfLinePreference = {})); +/** + * The default end of line to use when instantiating models. + */ +var DefaultEndOfLine; +(function (DefaultEndOfLine) { + /** + * Use line feed (\n) as the end of line character. + */ + DefaultEndOfLine[DefaultEndOfLine["LF"] = 1] = "LF"; + /** + * Use carriage return and line feed (\r\n) as the end of line character. + */ + DefaultEndOfLine[DefaultEndOfLine["CRLF"] = 2] = "CRLF"; +})(DefaultEndOfLine || (DefaultEndOfLine = {})); +/** + * End of line character preference. + */ +var EndOfLineSequence; +(function (EndOfLineSequence) { + /** + * Use line feed (\n) as the end of line character. + */ + EndOfLineSequence[EndOfLineSequence["LF"] = 0] = "LF"; + /** + * Use carriage return and line feed (\r\n) as the end of line character. + */ + EndOfLineSequence[EndOfLineSequence["CRLF"] = 1] = "CRLF"; +})(EndOfLineSequence || (EndOfLineSequence = {})); +/** + * Describes the behavior of decorations when typing/editing near their edges. + * Note: Please do not edit the values, as they very carefully match `DecorationRangeBehavior` + */ +var TrackedRangeStickiness; +(function (TrackedRangeStickiness) { + TrackedRangeStickiness[TrackedRangeStickiness["AlwaysGrowsWhenTypingAtEdges"] = 0] = "AlwaysGrowsWhenTypingAtEdges"; + TrackedRangeStickiness[TrackedRangeStickiness["NeverGrowsWhenTypingAtEdges"] = 1] = "NeverGrowsWhenTypingAtEdges"; + TrackedRangeStickiness[TrackedRangeStickiness["GrowsOnlyWhenTypingBefore"] = 2] = "GrowsOnlyWhenTypingBefore"; + TrackedRangeStickiness[TrackedRangeStickiness["GrowsOnlyWhenTypingAfter"] = 3] = "GrowsOnlyWhenTypingAfter"; +})(TrackedRangeStickiness || (TrackedRangeStickiness = {})); +var ScrollType; +(function (ScrollType) { + ScrollType[ScrollType["Smooth"] = 0] = "Smooth"; + ScrollType[ScrollType["Immediate"] = 1] = "Immediate"; +})(ScrollType || (ScrollType = {})); +/** + * Describes the reason the cursor has changed its position. + */ +var CursorChangeReason; +(function (CursorChangeReason) { + /** + * Unknown or not set. + */ + CursorChangeReason[CursorChangeReason["NotSet"] = 0] = "NotSet"; + /** + * A `model.setValue()` was called. + */ + CursorChangeReason[CursorChangeReason["ContentFlush"] = 1] = "ContentFlush"; + /** + * The `model` has been changed outside of this cursor and the cursor recovers its position from associated markers. + */ + CursorChangeReason[CursorChangeReason["RecoverFromMarkers"] = 2] = "RecoverFromMarkers"; + /** + * There was an explicit user gesture. + */ + CursorChangeReason[CursorChangeReason["Explicit"] = 3] = "Explicit"; + /** + * There was a Paste. + */ + CursorChangeReason[CursorChangeReason["Paste"] = 4] = "Paste"; + /** + * There was an Undo. + */ + CursorChangeReason[CursorChangeReason["Undo"] = 5] = "Undo"; + /** + * There was a Redo. + */ + CursorChangeReason[CursorChangeReason["Redo"] = 6] = "Redo"; +})(CursorChangeReason || (CursorChangeReason = {})); +var RenderMinimap; +(function (RenderMinimap) { + RenderMinimap[RenderMinimap["None"] = 0] = "None"; + RenderMinimap[RenderMinimap["Text"] = 1] = "Text"; + RenderMinimap[RenderMinimap["Blocks"] = 2] = "Blocks"; +})(RenderMinimap || (RenderMinimap = {})); +/** + * A positioning preference for rendering content widgets. + */ +var ContentWidgetPositionPreference; +(function (ContentWidgetPositionPreference) { + /** + * Place the content widget exactly at a position + */ + ContentWidgetPositionPreference[ContentWidgetPositionPreference["EXACT"] = 0] = "EXACT"; + /** + * Place the content widget above a position + */ + ContentWidgetPositionPreference[ContentWidgetPositionPreference["ABOVE"] = 1] = "ABOVE"; + /** + * Place the content widget below a position + */ + ContentWidgetPositionPreference[ContentWidgetPositionPreference["BELOW"] = 2] = "BELOW"; +})(ContentWidgetPositionPreference || (ContentWidgetPositionPreference = {})); +/** + * A positioning preference for rendering overlay widgets. + */ +var OverlayWidgetPositionPreference; +(function (OverlayWidgetPositionPreference) { + /** + * Position the overlay widget in the top right corner + */ + OverlayWidgetPositionPreference[OverlayWidgetPositionPreference["TOP_RIGHT_CORNER"] = 0] = "TOP_RIGHT_CORNER"; + /** + * Position the overlay widget in the bottom right corner + */ + OverlayWidgetPositionPreference[OverlayWidgetPositionPreference["BOTTOM_RIGHT_CORNER"] = 1] = "BOTTOM_RIGHT_CORNER"; + /** + * Position the overlay widget in the top center + */ + OverlayWidgetPositionPreference[OverlayWidgetPositionPreference["TOP_CENTER"] = 2] = "TOP_CENTER"; +})(OverlayWidgetPositionPreference || (OverlayWidgetPositionPreference = {})); +/** + * Type of hit element with the mouse in the editor. + */ +var MouseTargetType; +(function (MouseTargetType) { + /** + * Mouse is on top of an unknown element. + */ + MouseTargetType[MouseTargetType["UNKNOWN"] = 0] = "UNKNOWN"; + /** + * Mouse is on top of the textarea used for input. + */ + MouseTargetType[MouseTargetType["TEXTAREA"] = 1] = "TEXTAREA"; + /** + * Mouse is on top of the glyph margin + */ + MouseTargetType[MouseTargetType["GUTTER_GLYPH_MARGIN"] = 2] = "GUTTER_GLYPH_MARGIN"; + /** + * Mouse is on top of the line numbers + */ + MouseTargetType[MouseTargetType["GUTTER_LINE_NUMBERS"] = 3] = "GUTTER_LINE_NUMBERS"; + /** + * Mouse is on top of the line decorations + */ + MouseTargetType[MouseTargetType["GUTTER_LINE_DECORATIONS"] = 4] = "GUTTER_LINE_DECORATIONS"; + /** + * Mouse is on top of the whitespace left in the gutter by a view zone. + */ + MouseTargetType[MouseTargetType["GUTTER_VIEW_ZONE"] = 5] = "GUTTER_VIEW_ZONE"; + /** + * Mouse is on top of text in the content. + */ + MouseTargetType[MouseTargetType["CONTENT_TEXT"] = 6] = "CONTENT_TEXT"; + /** + * Mouse is on top of empty space in the content (e.g. after line text or below last line) + */ + MouseTargetType[MouseTargetType["CONTENT_EMPTY"] = 7] = "CONTENT_EMPTY"; + /** + * Mouse is on top of a view zone in the content. + */ + MouseTargetType[MouseTargetType["CONTENT_VIEW_ZONE"] = 8] = "CONTENT_VIEW_ZONE"; + /** + * Mouse is on top of a content widget. + */ + MouseTargetType[MouseTargetType["CONTENT_WIDGET"] = 9] = "CONTENT_WIDGET"; + /** + * Mouse is on top of the decorations overview ruler. + */ + MouseTargetType[MouseTargetType["OVERVIEW_RULER"] = 10] = "OVERVIEW_RULER"; + /** + * Mouse is on top of a scrollbar. + */ + MouseTargetType[MouseTargetType["SCROLLBAR"] = 11] = "SCROLLBAR"; + /** + * Mouse is on top of an overlay widget. + */ + MouseTargetType[MouseTargetType["OVERLAY_WIDGET"] = 12] = "OVERLAY_WIDGET"; + /** + * Mouse is outside of the editor. + */ + MouseTargetType[MouseTargetType["OUTSIDE_EDITOR"] = 13] = "OUTSIDE_EDITOR"; +})(MouseTargetType || (MouseTargetType = {})); +/** + * Describes what to do with the indentation when pressing Enter. + */ +var IndentAction; +(function (IndentAction) { + /** + * Insert new line and copy the previous line's indentation. + */ + IndentAction[IndentAction["None"] = 0] = "None"; + /** + * Insert new line and indent once (relative to the previous line's indentation). + */ + IndentAction[IndentAction["Indent"] = 1] = "Indent"; + /** + * Insert two new lines: + * - the first one indented which will hold the cursor + * - the second one at the same indentation level + */ + IndentAction[IndentAction["IndentOutdent"] = 2] = "IndentOutdent"; + /** + * Insert new line and outdent once (relative to the previous line's indentation). + */ + IndentAction[IndentAction["Outdent"] = 3] = "Outdent"; +})(IndentAction || (IndentAction = {})); +var CompletionItemKind; +(function (CompletionItemKind) { + CompletionItemKind[CompletionItemKind["Method"] = 0] = "Method"; + CompletionItemKind[CompletionItemKind["Function"] = 1] = "Function"; + CompletionItemKind[CompletionItemKind["Constructor"] = 2] = "Constructor"; + CompletionItemKind[CompletionItemKind["Field"] = 3] = "Field"; + CompletionItemKind[CompletionItemKind["Variable"] = 4] = "Variable"; + CompletionItemKind[CompletionItemKind["Class"] = 5] = "Class"; + CompletionItemKind[CompletionItemKind["Struct"] = 6] = "Struct"; + CompletionItemKind[CompletionItemKind["Interface"] = 7] = "Interface"; + CompletionItemKind[CompletionItemKind["Module"] = 8] = "Module"; + CompletionItemKind[CompletionItemKind["Property"] = 9] = "Property"; + CompletionItemKind[CompletionItemKind["Event"] = 10] = "Event"; + CompletionItemKind[CompletionItemKind["Operator"] = 11] = "Operator"; + CompletionItemKind[CompletionItemKind["Unit"] = 12] = "Unit"; + CompletionItemKind[CompletionItemKind["Value"] = 13] = "Value"; + CompletionItemKind[CompletionItemKind["Constant"] = 14] = "Constant"; + CompletionItemKind[CompletionItemKind["Enum"] = 15] = "Enum"; + CompletionItemKind[CompletionItemKind["EnumMember"] = 16] = "EnumMember"; + CompletionItemKind[CompletionItemKind["Keyword"] = 17] = "Keyword"; + CompletionItemKind[CompletionItemKind["Text"] = 18] = "Text"; + CompletionItemKind[CompletionItemKind["Color"] = 19] = "Color"; + CompletionItemKind[CompletionItemKind["File"] = 20] = "File"; + CompletionItemKind[CompletionItemKind["Reference"] = 21] = "Reference"; + CompletionItemKind[CompletionItemKind["Customcolor"] = 22] = "Customcolor"; + CompletionItemKind[CompletionItemKind["Folder"] = 23] = "Folder"; + CompletionItemKind[CompletionItemKind["TypeParameter"] = 24] = "TypeParameter"; + CompletionItemKind[CompletionItemKind["Snippet"] = 25] = "Snippet"; +})(CompletionItemKind || (CompletionItemKind = {})); +var CompletionItemTag; +(function (CompletionItemTag) { + CompletionItemTag[CompletionItemTag["Deprecated"] = 1] = "Deprecated"; +})(CompletionItemTag || (CompletionItemTag = {})); +var CompletionItemInsertTextRule; +(function (CompletionItemInsertTextRule) { + /** + * Adjust whitespace/indentation of multiline insert texts to + * match the current line indentation. + */ + CompletionItemInsertTextRule[CompletionItemInsertTextRule["KeepWhitespace"] = 1] = "KeepWhitespace"; + /** + * `insertText` is a snippet. + */ + CompletionItemInsertTextRule[CompletionItemInsertTextRule["InsertAsSnippet"] = 4] = "InsertAsSnippet"; +})(CompletionItemInsertTextRule || (CompletionItemInsertTextRule = {})); +/** + * How a suggest provider was triggered. + */ +var CompletionTriggerKind; +(function (CompletionTriggerKind) { + CompletionTriggerKind[CompletionTriggerKind["Invoke"] = 0] = "Invoke"; + CompletionTriggerKind[CompletionTriggerKind["TriggerCharacter"] = 1] = "TriggerCharacter"; + CompletionTriggerKind[CompletionTriggerKind["TriggerForIncompleteCompletions"] = 2] = "TriggerForIncompleteCompletions"; +})(CompletionTriggerKind || (CompletionTriggerKind = {})); +var SignatureHelpTriggerKind; +(function (SignatureHelpTriggerKind) { + SignatureHelpTriggerKind[SignatureHelpTriggerKind["Invoke"] = 1] = "Invoke"; + SignatureHelpTriggerKind[SignatureHelpTriggerKind["TriggerCharacter"] = 2] = "TriggerCharacter"; + SignatureHelpTriggerKind[SignatureHelpTriggerKind["ContentChange"] = 3] = "ContentChange"; +})(SignatureHelpTriggerKind || (SignatureHelpTriggerKind = {})); +/** + * A document highlight kind. + */ +var DocumentHighlightKind; +(function (DocumentHighlightKind) { + /** + * A textual occurrence. + */ + DocumentHighlightKind[DocumentHighlightKind["Text"] = 0] = "Text"; + /** + * Read-access of a symbol, like reading a variable. + */ + DocumentHighlightKind[DocumentHighlightKind["Read"] = 1] = "Read"; + /** + * Write-access of a symbol, like writing to a variable. + */ + DocumentHighlightKind[DocumentHighlightKind["Write"] = 2] = "Write"; +})(DocumentHighlightKind || (DocumentHighlightKind = {})); +/** + * A symbol kind. + */ +var SymbolKind; +(function (SymbolKind) { + SymbolKind[SymbolKind["File"] = 0] = "File"; + SymbolKind[SymbolKind["Module"] = 1] = "Module"; + SymbolKind[SymbolKind["Namespace"] = 2] = "Namespace"; + SymbolKind[SymbolKind["Package"] = 3] = "Package"; + SymbolKind[SymbolKind["Class"] = 4] = "Class"; + SymbolKind[SymbolKind["Method"] = 5] = "Method"; + SymbolKind[SymbolKind["Property"] = 6] = "Property"; + SymbolKind[SymbolKind["Field"] = 7] = "Field"; + SymbolKind[SymbolKind["Constructor"] = 8] = "Constructor"; + SymbolKind[SymbolKind["Enum"] = 9] = "Enum"; + SymbolKind[SymbolKind["Interface"] = 10] = "Interface"; + SymbolKind[SymbolKind["Function"] = 11] = "Function"; + SymbolKind[SymbolKind["Variable"] = 12] = "Variable"; + SymbolKind[SymbolKind["Constant"] = 13] = "Constant"; + SymbolKind[SymbolKind["String"] = 14] = "String"; + SymbolKind[SymbolKind["Number"] = 15] = "Number"; + SymbolKind[SymbolKind["Boolean"] = 16] = "Boolean"; + SymbolKind[SymbolKind["Array"] = 17] = "Array"; + SymbolKind[SymbolKind["Object"] = 18] = "Object"; + SymbolKind[SymbolKind["Key"] = 19] = "Key"; + SymbolKind[SymbolKind["Null"] = 20] = "Null"; + SymbolKind[SymbolKind["EnumMember"] = 21] = "EnumMember"; + SymbolKind[SymbolKind["Struct"] = 22] = "Struct"; + SymbolKind[SymbolKind["Event"] = 23] = "Event"; + SymbolKind[SymbolKind["Operator"] = 24] = "Operator"; + SymbolKind[SymbolKind["TypeParameter"] = 25] = "TypeParameter"; +})(SymbolKind || (SymbolKind = {})); +var SymbolTag; +(function (SymbolTag) { + SymbolTag[SymbolTag["Deprecated"] = 1] = "Deprecated"; +})(SymbolTag || (SymbolTag = {})); /***/ }), @@ -8166,207 +8858,207 @@ __webpack_require__.r(__webpack_exports__); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "PrefixSumIndexOfResult", function() { return PrefixSumIndexOfResult; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "PrefixSumComputer", function() { return PrefixSumComputer; }); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "PrefixSumComputerWithCache", function() { return PrefixSumComputerWithCache; }); -/* harmony import */ var _core_uint_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../core/uint.js */ "./node_modules/monaco-editor/esm/vs/editor/common/core/uint.js"); -/*--------------------------------------------------------------------------------------------- - * Copyright (c) Microsoft Corporation. All rights reserved. - * Licensed under the MIT License. See License.txt in the project root for license information. - *--------------------------------------------------------------------------------------------*/ - -var PrefixSumIndexOfResult = /** @class */ (function () { - function PrefixSumIndexOfResult(index, remainder) { - this.index = index; - this.remainder = remainder; - } - return PrefixSumIndexOfResult; -}()); - -var PrefixSumComputer = /** @class */ (function () { - function PrefixSumComputer(values) { - this.values = values; - this.prefixSum = new Uint32Array(values.length); - this.prefixSumValidIndex = new Int32Array(1); - this.prefixSumValidIndex[0] = -1; - } - PrefixSumComputer.prototype.getCount = function () { - return this.values.length; - }; - PrefixSumComputer.prototype.insertValues = function (insertIndex, insertValues) { - insertIndex = Object(_core_uint_js__WEBPACK_IMPORTED_MODULE_0__["toUint32"])(insertIndex); - var oldValues = this.values; - var oldPrefixSum = this.prefixSum; - var insertValuesLen = insertValues.length; - if (insertValuesLen === 0) { - return false; - } - this.values = new Uint32Array(oldValues.length + insertValuesLen); - this.values.set(oldValues.subarray(0, insertIndex), 0); - this.values.set(oldValues.subarray(insertIndex), insertIndex + insertValuesLen); - this.values.set(insertValues, insertIndex); - if (insertIndex - 1 < this.prefixSumValidIndex[0]) { - this.prefixSumValidIndex[0] = insertIndex - 1; - } - this.prefixSum = new Uint32Array(this.values.length); - if (this.prefixSumValidIndex[0] >= 0) { - this.prefixSum.set(oldPrefixSum.subarray(0, this.prefixSumValidIndex[0] + 1)); - } - return true; - }; - PrefixSumComputer.prototype.changeValue = function (index, value) { - index = Object(_core_uint_js__WEBPACK_IMPORTED_MODULE_0__["toUint32"])(index); - value = Object(_core_uint_js__WEBPACK_IMPORTED_MODULE_0__["toUint32"])(value); - if (this.values[index] === value) { - return false; - } - this.values[index] = value; - if (index - 1 < this.prefixSumValidIndex[0]) { - this.prefixSumValidIndex[0] = index - 1; - } - return true; - }; - PrefixSumComputer.prototype.removeValues = function (startIndex, cnt) { - startIndex = Object(_core_uint_js__WEBPACK_IMPORTED_MODULE_0__["toUint32"])(startIndex); - cnt = Object(_core_uint_js__WEBPACK_IMPORTED_MODULE_0__["toUint32"])(cnt); - var oldValues = this.values; - var oldPrefixSum = this.prefixSum; - if (startIndex >= oldValues.length) { - return false; - } - var maxCnt = oldValues.length - startIndex; - if (cnt >= maxCnt) { - cnt = maxCnt; - } - if (cnt === 0) { - return false; - } - this.values = new Uint32Array(oldValues.length - cnt); - this.values.set(oldValues.subarray(0, startIndex), 0); - this.values.set(oldValues.subarray(startIndex + cnt), startIndex); - this.prefixSum = new Uint32Array(this.values.length); - if (startIndex - 1 < this.prefixSumValidIndex[0]) { - this.prefixSumValidIndex[0] = startIndex - 1; - } - if (this.prefixSumValidIndex[0] >= 0) { - this.prefixSum.set(oldPrefixSum.subarray(0, this.prefixSumValidIndex[0] + 1)); - } - return true; - }; - PrefixSumComputer.prototype.getTotalValue = function () { - if (this.values.length === 0) { - return 0; - } - return this._getAccumulatedValue(this.values.length - 1); - }; - PrefixSumComputer.prototype.getAccumulatedValue = function (index) { - if (index < 0) { - return 0; - } - index = Object(_core_uint_js__WEBPACK_IMPORTED_MODULE_0__["toUint32"])(index); - return this._getAccumulatedValue(index); - }; - PrefixSumComputer.prototype._getAccumulatedValue = function (index) { - if (index <= this.prefixSumValidIndex[0]) { - return this.prefixSum[index]; - } - var startIndex = this.prefixSumValidIndex[0] + 1; - if (startIndex === 0) { - this.prefixSum[0] = this.values[0]; - startIndex++; - } - if (index >= this.values.length) { - index = this.values.length - 1; - } - for (var i = startIndex; i <= index; i++) { - this.prefixSum[i] = this.prefixSum[i - 1] + this.values[i]; - } - this.prefixSumValidIndex[0] = Math.max(this.prefixSumValidIndex[0], index); - return this.prefixSum[index]; - }; - PrefixSumComputer.prototype.getIndexOf = function (accumulatedValue) { - accumulatedValue = Math.floor(accumulatedValue); //@perf - // Compute all sums (to get a fully valid prefixSum) - this.getTotalValue(); - var low = 0; - var high = this.values.length - 1; - var mid = 0; - var midStop = 0; - var midStart = 0; - while (low <= high) { - mid = low + ((high - low) / 2) | 0; - midStop = this.prefixSum[mid]; - midStart = midStop - this.values[mid]; - if (accumulatedValue < midStart) { - high = mid - 1; - } - else if (accumulatedValue >= midStop) { - low = mid + 1; - } - else { - break; - } - } - return new PrefixSumIndexOfResult(mid, accumulatedValue - midStart); - }; - return PrefixSumComputer; -}()); - -var PrefixSumComputerWithCache = /** @class */ (function () { - function PrefixSumComputerWithCache(values) { - this._cacheAccumulatedValueStart = 0; - this._cache = null; - this._actual = new PrefixSumComputer(values); - this._bustCache(); - } - PrefixSumComputerWithCache.prototype._bustCache = function () { - this._cacheAccumulatedValueStart = 0; - this._cache = null; - }; - PrefixSumComputerWithCache.prototype.insertValues = function (insertIndex, insertValues) { - if (this._actual.insertValues(insertIndex, insertValues)) { - this._bustCache(); - } - }; - PrefixSumComputerWithCache.prototype.changeValue = function (index, value) { - if (this._actual.changeValue(index, value)) { - this._bustCache(); - } - }; - PrefixSumComputerWithCache.prototype.removeValues = function (startIndex, cnt) { - if (this._actual.removeValues(startIndex, cnt)) { - this._bustCache(); - } - }; - PrefixSumComputerWithCache.prototype.getTotalValue = function () { - return this._actual.getTotalValue(); - }; - PrefixSumComputerWithCache.prototype.getAccumulatedValue = function (index) { - return this._actual.getAccumulatedValue(index); - }; - PrefixSumComputerWithCache.prototype.getIndexOf = function (accumulatedValue) { - accumulatedValue = Math.floor(accumulatedValue); //@perf - if (this._cache !== null) { - var cacheIndex = accumulatedValue - this._cacheAccumulatedValueStart; - if (cacheIndex >= 0 && cacheIndex < this._cache.length) { - // Cache hit! - return this._cache[cacheIndex]; - } - } - // Cache miss! - return this._actual.getIndexOf(accumulatedValue); - }; - /** - * Gives a hint that a lot of requests are about to come in for these accumulated values. - */ - PrefixSumComputerWithCache.prototype.warmUpCache = function (accumulatedValueStart, accumulatedValueEnd) { - var newCache = []; - for (var accumulatedValue = accumulatedValueStart; accumulatedValue <= accumulatedValueEnd; accumulatedValue++) { - newCache[accumulatedValue - accumulatedValueStart] = this.getIndexOf(accumulatedValue); - } - this._cache = newCache; - this._cacheAccumulatedValueStart = accumulatedValueStart; - }; - return PrefixSumComputerWithCache; -}()); - +/* harmony import */ var _base_common_uint_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../../../base/common/uint.js */ "./node_modules/monaco-editor/esm/vs/base/common/uint.js"); +/*--------------------------------------------------------------------------------------------- + * Copyright (c) Microsoft Corporation. All rights reserved. + * Licensed under the MIT License. See License.txt in the project root for license information. + *--------------------------------------------------------------------------------------------*/ + +var PrefixSumIndexOfResult = /** @class */ (function () { + function PrefixSumIndexOfResult(index, remainder) { + this.index = index; + this.remainder = remainder; + } + return PrefixSumIndexOfResult; +}()); + +var PrefixSumComputer = /** @class */ (function () { + function PrefixSumComputer(values) { + this.values = values; + this.prefixSum = new Uint32Array(values.length); + this.prefixSumValidIndex = new Int32Array(1); + this.prefixSumValidIndex[0] = -1; + } + PrefixSumComputer.prototype.getCount = function () { + return this.values.length; + }; + PrefixSumComputer.prototype.insertValues = function (insertIndex, insertValues) { + insertIndex = Object(_base_common_uint_js__WEBPACK_IMPORTED_MODULE_0__["toUint32"])(insertIndex); + var oldValues = this.values; + var oldPrefixSum = this.prefixSum; + var insertValuesLen = insertValues.length; + if (insertValuesLen === 0) { + return false; + } + this.values = new Uint32Array(oldValues.length + insertValuesLen); + this.values.set(oldValues.subarray(0, insertIndex), 0); + this.values.set(oldValues.subarray(insertIndex), insertIndex + insertValuesLen); + this.values.set(insertValues, insertIndex); + if (insertIndex - 1 < this.prefixSumValidIndex[0]) { + this.prefixSumValidIndex[0] = insertIndex - 1; + } + this.prefixSum = new Uint32Array(this.values.length); + if (this.prefixSumValidIndex[0] >= 0) { + this.prefixSum.set(oldPrefixSum.subarray(0, this.prefixSumValidIndex[0] + 1)); + } + return true; + }; + PrefixSumComputer.prototype.changeValue = function (index, value) { + index = Object(_base_common_uint_js__WEBPACK_IMPORTED_MODULE_0__["toUint32"])(index); + value = Object(_base_common_uint_js__WEBPACK_IMPORTED_MODULE_0__["toUint32"])(value); + if (this.values[index] === value) { + return false; + } + this.values[index] = value; + if (index - 1 < this.prefixSumValidIndex[0]) { + this.prefixSumValidIndex[0] = index - 1; + } + return true; + }; + PrefixSumComputer.prototype.removeValues = function (startIndex, cnt) { + startIndex = Object(_base_common_uint_js__WEBPACK_IMPORTED_MODULE_0__["toUint32"])(startIndex); + cnt = Object(_base_common_uint_js__WEBPACK_IMPORTED_MODULE_0__["toUint32"])(cnt); + var oldValues = this.values; + var oldPrefixSum = this.prefixSum; + if (startIndex >= oldValues.length) { + return false; + } + var maxCnt = oldValues.length - startIndex; + if (cnt >= maxCnt) { + cnt = maxCnt; + } + if (cnt === 0) { + return false; + } + this.values = new Uint32Array(oldValues.length - cnt); + this.values.set(oldValues.subarray(0, startIndex), 0); + this.values.set(oldValues.subarray(startIndex + cnt), startIndex); + this.prefixSum = new Uint32Array(this.values.length); + if (startIndex - 1 < this.prefixSumValidIndex[0]) { + this.prefixSumValidIndex[0] = startIndex - 1; + } + if (this.prefixSumValidIndex[0] >= 0) { + this.prefixSum.set(oldPrefixSum.subarray(0, this.prefixSumValidIndex[0] + 1)); + } + return true; + }; + PrefixSumComputer.prototype.getTotalValue = function () { + if (this.values.length === 0) { + return 0; + } + return this._getAccumulatedValue(this.values.length - 1); + }; + PrefixSumComputer.prototype.getAccumulatedValue = function (index) { + if (index < 0) { + return 0; + } + index = Object(_base_common_uint_js__WEBPACK_IMPORTED_MODULE_0__["toUint32"])(index); + return this._getAccumulatedValue(index); + }; + PrefixSumComputer.prototype._getAccumulatedValue = function (index) { + if (index <= this.prefixSumValidIndex[0]) { + return this.prefixSum[index]; + } + var startIndex = this.prefixSumValidIndex[0] + 1; + if (startIndex === 0) { + this.prefixSum[0] = this.values[0]; + startIndex++; + } + if (index >= this.values.length) { + index = this.values.length - 1; + } + for (var i = startIndex; i <= index; i++) { + this.prefixSum[i] = this.prefixSum[i - 1] + this.values[i]; + } + this.prefixSumValidIndex[0] = Math.max(this.prefixSumValidIndex[0], index); + return this.prefixSum[index]; + }; + PrefixSumComputer.prototype.getIndexOf = function (accumulatedValue) { + accumulatedValue = Math.floor(accumulatedValue); //@perf + // Compute all sums (to get a fully valid prefixSum) + this.getTotalValue(); + var low = 0; + var high = this.values.length - 1; + var mid = 0; + var midStop = 0; + var midStart = 0; + while (low <= high) { + mid = low + ((high - low) / 2) | 0; + midStop = this.prefixSum[mid]; + midStart = midStop - this.values[mid]; + if (accumulatedValue < midStart) { + high = mid - 1; + } + else if (accumulatedValue >= midStop) { + low = mid + 1; + } + else { + break; + } + } + return new PrefixSumIndexOfResult(mid, accumulatedValue - midStart); + }; + return PrefixSumComputer; +}()); + +var PrefixSumComputerWithCache = /** @class */ (function () { + function PrefixSumComputerWithCache(values) { + this._cacheAccumulatedValueStart = 0; + this._cache = null; + this._actual = new PrefixSumComputer(values); + this._bustCache(); + } + PrefixSumComputerWithCache.prototype._bustCache = function () { + this._cacheAccumulatedValueStart = 0; + this._cache = null; + }; + PrefixSumComputerWithCache.prototype.insertValues = function (insertIndex, insertValues) { + if (this._actual.insertValues(insertIndex, insertValues)) { + this._bustCache(); + } + }; + PrefixSumComputerWithCache.prototype.changeValue = function (index, value) { + if (this._actual.changeValue(index, value)) { + this._bustCache(); + } + }; + PrefixSumComputerWithCache.prototype.removeValues = function (startIndex, cnt) { + if (this._actual.removeValues(startIndex, cnt)) { + this._bustCache(); + } + }; + PrefixSumComputerWithCache.prototype.getTotalValue = function () { + return this._actual.getTotalValue(); + }; + PrefixSumComputerWithCache.prototype.getAccumulatedValue = function (index) { + return this._actual.getAccumulatedValue(index); + }; + PrefixSumComputerWithCache.prototype.getIndexOf = function (accumulatedValue) { + accumulatedValue = Math.floor(accumulatedValue); //@perf + if (this._cache !== null) { + var cacheIndex = accumulatedValue - this._cacheAccumulatedValueStart; + if (cacheIndex >= 0 && cacheIndex < this._cache.length) { + // Cache hit! + return this._cache[cacheIndex]; + } + } + // Cache miss! + return this._actual.getIndexOf(accumulatedValue); + }; + /** + * Gives a hint that a lot of requests are about to come in for these accumulated values. + */ + PrefixSumComputerWithCache.prototype.warmUpCache = function (accumulatedValueStart, accumulatedValueEnd) { + var newCache = []; + for (var accumulatedValue = accumulatedValueStart; accumulatedValue <= accumulatedValueEnd; accumulatedValue++) { + newCache[accumulatedValue - accumulatedValueStart] = this.getIndexOf(accumulatedValue); + } + this._cache = newCache; + this._cacheAccumulatedValueStart = accumulatedValueStart; + }; + return PrefixSumComputerWithCache; +}()); + /***/ }), @@ -8383,32 +9075,310 @@ __webpack_require__.r(__webpack_exports__); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "initialize", function() { return initialize; }); /* harmony import */ var _base_common_worker_simpleWorker_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../base/common/worker/simpleWorker.js */ "./node_modules/monaco-editor/esm/vs/base/common/worker/simpleWorker.js"); /* harmony import */ var _common_services_editorSimpleWorker_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./common/services/editorSimpleWorker.js */ "./node_modules/monaco-editor/esm/vs/editor/common/services/editorSimpleWorker.js"); -/*--------------------------------------------------------------------------------------------- - * Copyright (c) Microsoft Corporation. All rights reserved. - * Licensed under the MIT License. See License.txt in the project root for license information. - *--------------------------------------------------------------------------------------------*/ +/*--------------------------------------------------------------------------------------------- + * Copyright (c) Microsoft Corporation. All rights reserved. + * Licensed under the MIT License. See License.txt in the project root for license information. + *--------------------------------------------------------------------------------------------*/ + + +var initialized = false; +function initialize(foreignModule) { + if (initialized) { + return; + } + initialized = true; + var simpleWorker = new _base_common_worker_simpleWorker_js__WEBPACK_IMPORTED_MODULE_0__["SimpleWorkerServer"](function (msg) { + self.postMessage(msg); + }, function (host) { return new _common_services_editorSimpleWorker_js__WEBPACK_IMPORTED_MODULE_1__["EditorSimpleWorker"](host, foreignModule); }); + self.onmessage = function (e) { + simpleWorker.onmessage(e.data); + }; +} +self.onmessage = function (e) { + // Ignore first message in this case and initialize if not yet initialized + if (!initialized) { + initialize(null); + } +}; -var initialized = false; -function initialize(foreignModule) { - if (initialized) { - return; - } - initialized = true; - var editorWorker = new _common_services_editorSimpleWorker_js__WEBPACK_IMPORTED_MODULE_1__["EditorSimpleWorkerImpl"](foreignModule); - var simpleWorker = new _base_common_worker_simpleWorker_js__WEBPACK_IMPORTED_MODULE_0__["SimpleWorkerServer"](function (msg) { - self.postMessage(msg); - }, editorWorker); - self.onmessage = function (e) { - simpleWorker.onmessage(e.data); - }; -} -self.onmessage = function (e) { - // Ignore first message in this case and initialize if not yet initialized - if (!initialized) { - initialize(null); - } -}; +/***/ }), + +/***/ "./node_modules/monaco-editor/esm/vs/language/css/_deps/vscode-css-languageservice/_deps/vscode-languageserver-textdocument/lib/esm/main.js": +/*!**************************************************************************************************************************************************!*\ + !*** ./node_modules/monaco-editor/esm/vs/language/css/_deps/vscode-css-languageservice/_deps/vscode-languageserver-textdocument/lib/esm/main.js ***! + \**************************************************************************************************************************************************/ +/*! exports provided: TextDocument */ +/***/ (function(module, __webpack_exports__, __webpack_require__) { + +"use strict"; +__webpack_require__.r(__webpack_exports__); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "TextDocument", function() { return TextDocument; }); +/* -------------------------------------------------------------------------------------------- + * Copyright (c) Microsoft Corporation. All rights reserved. + * Licensed under the MIT License. See License.txt in the project root for license information. + * ------------------------------------------------------------------------------------------ */ + +var FullTextDocument = /** @class */ (function () { + function FullTextDocument(uri, languageId, version, content) { + this._uri = uri; + this._languageId = languageId; + this._version = version; + this._content = content; + this._lineOffsets = undefined; + } + Object.defineProperty(FullTextDocument.prototype, "uri", { + get: function () { + return this._uri; + }, + enumerable: true, + configurable: true + }); + Object.defineProperty(FullTextDocument.prototype, "languageId", { + get: function () { + return this._languageId; + }, + enumerable: true, + configurable: true + }); + Object.defineProperty(FullTextDocument.prototype, "version", { + get: function () { + return this._version; + }, + enumerable: true, + configurable: true + }); + FullTextDocument.prototype.getText = function (range) { + if (range) { + var start = this.offsetAt(range.start); + var end = this.offsetAt(range.end); + return this._content.substring(start, end); + } + return this._content; + }; + FullTextDocument.prototype.update = function (changes, version) { + for (var _i = 0, changes_1 = changes; _i < changes_1.length; _i++) { + var change = changes_1[_i]; + if (FullTextDocument.isIncremental(change)) { + // makes sure start is before end + var range = getWellformedRange(change.range); + // update content + var startOffset = this.offsetAt(range.start); + var endOffset = this.offsetAt(range.end); + this._content = this._content.substring(0, startOffset) + change.text + this._content.substring(endOffset, this._content.length); + // update the offsets + var startLine = Math.max(range.start.line, 0); + var endLine = Math.max(range.end.line, 0); + var lineOffsets = this._lineOffsets; + var addedLineOffsets = computeLineOffsets(change.text, false, startOffset); + if (endLine - startLine === addedLineOffsets.length) { + for (var i = 0, len = addedLineOffsets.length; i < len; i++) { + lineOffsets[i + startLine + 1] = addedLineOffsets[i]; + } + } + else { + if (addedLineOffsets.length < 10000) { + lineOffsets.splice.apply(lineOffsets, [startLine + 1, endLine - startLine].concat(addedLineOffsets)); + } + else { // avoid too many arguments for splice + this._lineOffsets = lineOffsets = lineOffsets.slice(0, startLine + 1).concat(addedLineOffsets, lineOffsets.slice(endLine + 1)); + } + } + var diff = change.text.length - (endOffset - startOffset); + if (diff !== 0) { + for (var i = startLine + 1 + addedLineOffsets.length, len = lineOffsets.length; i < len; i++) { + lineOffsets[i] = lineOffsets[i] + diff; + } + } + } + else if (FullTextDocument.isFull(change)) { + this._content = change.text; + this._lineOffsets = undefined; + } + else { + throw new Error('Unknown change event received'); + } + } + this._version = version; + }; + FullTextDocument.prototype.getLineOffsets = function () { + if (this._lineOffsets === undefined) { + this._lineOffsets = computeLineOffsets(this._content, true); + } + return this._lineOffsets; + }; + FullTextDocument.prototype.positionAt = function (offset) { + offset = Math.max(Math.min(offset, this._content.length), 0); + var lineOffsets = this.getLineOffsets(); + var low = 0, high = lineOffsets.length; + if (high === 0) { + return { line: 0, character: offset }; + } + while (low < high) { + var mid = Math.floor((low + high) / 2); + if (lineOffsets[mid] > offset) { + high = mid; + } + else { + low = mid + 1; + } + } + // low is the least x for which the line offset is larger than the current offset + // or array.length if no line offset is larger than the current offset + var line = low - 1; + return { line: line, character: offset - lineOffsets[line] }; + }; + FullTextDocument.prototype.offsetAt = function (position) { + var lineOffsets = this.getLineOffsets(); + if (position.line >= lineOffsets.length) { + return this._content.length; + } + else if (position.line < 0) { + return 0; + } + var lineOffset = lineOffsets[position.line]; + var nextLineOffset = (position.line + 1 < lineOffsets.length) ? lineOffsets[position.line + 1] : this._content.length; + return Math.max(Math.min(lineOffset + position.character, nextLineOffset), lineOffset); + }; + Object.defineProperty(FullTextDocument.prototype, "lineCount", { + get: function () { + return this.getLineOffsets().length; + }, + enumerable: true, + configurable: true + }); + FullTextDocument.isIncremental = function (event) { + var candidate = event; + return candidate !== undefined && candidate !== null && + typeof candidate.text === 'string' && candidate.range !== undefined && + (candidate.rangeLength === undefined || typeof candidate.rangeLength === 'number'); + }; + FullTextDocument.isFull = function (event) { + var candidate = event; + return candidate !== undefined && candidate !== null && + typeof candidate.text === 'string' && candidate.range === undefined && candidate.rangeLength === undefined; + }; + return FullTextDocument; +}()); +var TextDocument; +(function (TextDocument) { + /** + * Creates a new text document. + * + * @param uri The document's uri. + * @param languageId The document's language Id. + * @param version The document's initial version number. + * @param content The document's content. + */ + function create(uri, languageId, version, content) { + return new FullTextDocument(uri, languageId, version, content); + } + TextDocument.create = create; + /** + * Updates a TextDocument by modifing its content. + * + * @param document the document to update. Only documents created by TextDocument.create are valid inputs. + * @param changes the changes to apply to the document. + * @returns The updated TextDocument. Note: That's the same document instance passed in as first parameter. + * + */ + function update(document, changes, version) { + if (document instanceof FullTextDocument) { + document.update(changes, version); + return document; + } + else { + throw new Error('TextDocument.update: document must be created by TextDocument.create'); + } + } + TextDocument.update = update; + function applyEdits(document, edits) { + var text = document.getText(); + var sortedEdits = mergeSort(edits.map(getWellformedEdit), function (a, b) { + var diff = a.range.start.line - b.range.start.line; + if (diff === 0) { + return a.range.start.character - b.range.start.character; + } + return diff; + }); + var lastModifiedOffset = text.length; + for (var i = sortedEdits.length - 1; i >= 0; i--) { + var e = sortedEdits[i]; + var startOffset = document.offsetAt(e.range.start); + var endOffset = document.offsetAt(e.range.end); + if (endOffset <= lastModifiedOffset) { + text = text.substring(0, startOffset) + e.newText + text.substring(endOffset, text.length); + } + else { + throw new Error('Overlapping edit'); + } + lastModifiedOffset = startOffset; + } + return text; + } + TextDocument.applyEdits = applyEdits; +})(TextDocument || (TextDocument = {})); +function mergeSort(data, compare) { + if (data.length <= 1) { + // sorted + return data; + } + var p = (data.length / 2) | 0; + var left = data.slice(0, p); + var right = data.slice(p); + mergeSort(left, compare); + mergeSort(right, compare); + var leftIdx = 0; + var rightIdx = 0; + var i = 0; + while (leftIdx < left.length && rightIdx < right.length) { + var ret = compare(left[leftIdx], right[rightIdx]); + if (ret <= 0) { + // smaller_equal -> take left to preserve order + data[i++] = left[leftIdx++]; + } + else { + // greater -> take right + data[i++] = right[rightIdx++]; + } + } + while (leftIdx < left.length) { + data[i++] = left[leftIdx++]; + } + while (rightIdx < right.length) { + data[i++] = right[rightIdx++]; + } + return data; +} +function computeLineOffsets(text, isAtLineStart, textOffset) { + if (textOffset === void 0) { textOffset = 0; } + var result = isAtLineStart ? [textOffset] : []; + for (var i = 0; i < text.length; i++) { + var ch = text.charCodeAt(i); + if (ch === 13 /* CarriageReturn */ || ch === 10 /* LineFeed */) { + if (ch === 13 /* CarriageReturn */ && i + 1 < text.length && text.charCodeAt(i + 1) === 10 /* LineFeed */) { + i++; + } + result.push(textOffset + i + 1); + } + } + return result; +} +function getWellformedRange(range) { + var start = range.start; + var end = range.end; + if (start.line > end.line || (start.line === end.line && start.character > end.character)) { + return { start: end, end: start }; + } + return range; +} +function getWellformedEdit(textEdit) { + var range = getWellformedRange(textEdit.range); + if (range !== textEdit.range) { + return { newText: textEdit.newText, range: range }; + } + return textEdit; +} /***/ }), @@ -8417,7 +9387,7 @@ self.onmessage = function (e) { /*!***************************************************************************************************************!*\ !*** ./node_modules/monaco-editor/esm/vs/language/css/_deps/vscode-css-languageservice/cssLanguageService.js ***! \***************************************************************************************************************/ -/*! exports provided: Position, Range, Location, LocationLink, Color, ColorInformation, ColorPresentation, FoldingRangeKind, FoldingRange, DiagnosticRelatedInformation, DiagnosticSeverity, Diagnostic, Command, TextEdit, TextDocumentEdit, CreateFile, RenameFile, DeleteFile, WorkspaceEdit, WorkspaceChange, TextDocumentIdentifier, VersionedTextDocumentIdentifier, TextDocumentItem, MarkupKind, MarkupContent, CompletionItemKind, InsertTextFormat, CompletionItem, CompletionList, MarkedString, Hover, ParameterInformation, SignatureInformation, DocumentHighlightKind, DocumentHighlight, SymbolKind, SymbolInformation, DocumentSymbol, CodeActionKind, CodeActionContext, CodeAction, CodeLens, FormattingOptions, DocumentLink, EOL, TextDocument, TextDocumentSaveReason, getCSSLanguageService, getSCSSLanguageService, getLESSLanguageService, SelectionRangeKind */ +/*! exports provided: getCSSLanguageService, getSCSSLanguageService, getLESSLanguageService, TextDocument, Position, Range, Location, LocationLink, Color, ColorInformation, ColorPresentation, FoldingRangeKind, FoldingRange, DiagnosticRelatedInformation, DiagnosticSeverity, DiagnosticTag, Diagnostic, Command, TextEdit, TextDocumentEdit, CreateFile, RenameFile, DeleteFile, WorkspaceEdit, WorkspaceChange, TextDocumentIdentifier, VersionedTextDocumentIdentifier, TextDocumentItem, MarkupKind, MarkupContent, CompletionItemKind, InsertTextFormat, CompletionItemTag, CompletionItem, CompletionList, MarkedString, Hover, ParameterInformation, SignatureInformation, DocumentHighlightKind, DocumentHighlight, SymbolKind, SymbolTag, SymbolInformation, DocumentSymbol, CodeActionKind, CodeActionContext, CodeAction, CodeLens, FormattingOptions, DocumentLink, SelectionRange, EOL, ClientCapabilities, FileType */ /***/ (function(module, __webpack_exports__, __webpack_require__) { "use strict"; @@ -8438,103 +9408,111 @@ __webpack_require__.r(__webpack_exports__); /* harmony import */ var _services_cssFolding_js__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ./services/cssFolding.js */ "./node_modules/monaco-editor/esm/vs/language/css/_deps/vscode-css-languageservice/services/cssFolding.js"); /* harmony import */ var _languageFacts_facts_js__WEBPACK_IMPORTED_MODULE_11__ = __webpack_require__(/*! ./languageFacts/facts.js */ "./node_modules/monaco-editor/esm/vs/language/css/_deps/vscode-css-languageservice/languageFacts/facts.js"); /* harmony import */ var _services_cssSelectionRange_js__WEBPACK_IMPORTED_MODULE_12__ = __webpack_require__(/*! ./services/cssSelectionRange.js */ "./node_modules/monaco-editor/esm/vs/language/css/_deps/vscode-css-languageservice/services/cssSelectionRange.js"); -/* harmony import */ var _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_13__ = __webpack_require__(/*! ./cssLanguageTypes.js */ "./node_modules/monaco-editor/esm/vs/language/css/_deps/vscode-css-languageservice/cssLanguageTypes.js"); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "Range", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_13__["Range"]; }); +/* harmony import */ var _services_scssNavigation_js__WEBPACK_IMPORTED_MODULE_13__ = __webpack_require__(/*! ./services/scssNavigation.js */ "./node_modules/monaco-editor/esm/vs/language/css/_deps/vscode-css-languageservice/services/scssNavigation.js"); +/* harmony import */ var _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__ = __webpack_require__(/*! ./cssLanguageTypes.js */ "./node_modules/monaco-editor/esm/vs/language/css/_deps/vscode-css-languageservice/cssLanguageTypes.js"); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "TextDocument", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["TextDocument"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "TextEdit", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_13__["TextEdit"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "Position", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["Position"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "Position", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_13__["Position"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "Range", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["Range"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "SelectionRangeKind", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_13__["SelectionRangeKind"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "Location", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["Location"]; }); -/* harmony import */ var _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__ = __webpack_require__(/*! ../vscode-languageserver-types/main.js */ "./node_modules/monaco-editor/esm/vs/language/css/_deps/vscode-languageserver-types/main.js"); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "Location", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["Location"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "LocationLink", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["LocationLink"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "LocationLink", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["LocationLink"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "Color", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["Color"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "Color", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["Color"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "ColorInformation", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["ColorInformation"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "ColorInformation", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["ColorInformation"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "ColorPresentation", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["ColorPresentation"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "ColorPresentation", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["ColorPresentation"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "FoldingRangeKind", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["FoldingRangeKind"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "FoldingRangeKind", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["FoldingRangeKind"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "FoldingRange", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["FoldingRange"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "FoldingRange", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["FoldingRange"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "DiagnosticRelatedInformation", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["DiagnosticRelatedInformation"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "DiagnosticRelatedInformation", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["DiagnosticRelatedInformation"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "DiagnosticSeverity", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["DiagnosticSeverity"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "DiagnosticSeverity", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["DiagnosticSeverity"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "DiagnosticTag", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["DiagnosticTag"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "Diagnostic", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["Diagnostic"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "Diagnostic", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["Diagnostic"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "Command", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["Command"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "Command", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["Command"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "TextDocumentEdit", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["TextDocumentEdit"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "TextEdit", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["TextEdit"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "CreateFile", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["CreateFile"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "TextDocumentEdit", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["TextDocumentEdit"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "RenameFile", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["RenameFile"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "CreateFile", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["CreateFile"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "DeleteFile", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["DeleteFile"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "RenameFile", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["RenameFile"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "WorkspaceEdit", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["WorkspaceEdit"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "DeleteFile", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["DeleteFile"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "WorkspaceChange", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["WorkspaceChange"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "WorkspaceEdit", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["WorkspaceEdit"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "TextDocumentIdentifier", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["TextDocumentIdentifier"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "WorkspaceChange", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["WorkspaceChange"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "VersionedTextDocumentIdentifier", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["VersionedTextDocumentIdentifier"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "TextDocumentIdentifier", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["TextDocumentIdentifier"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "TextDocumentItem", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["TextDocumentItem"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "VersionedTextDocumentIdentifier", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["VersionedTextDocumentIdentifier"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "MarkupKind", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["MarkupKind"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "TextDocumentItem", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["TextDocumentItem"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "MarkupContent", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["MarkupContent"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "MarkupKind", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["MarkupKind"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "CompletionItemKind", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["CompletionItemKind"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "MarkupContent", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["MarkupContent"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "InsertTextFormat", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["InsertTextFormat"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "CompletionItemKind", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["CompletionItemKind"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "CompletionItem", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["CompletionItem"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "InsertTextFormat", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["InsertTextFormat"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "CompletionList", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["CompletionList"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "CompletionItemTag", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["CompletionItemTag"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "MarkedString", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["MarkedString"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "CompletionItem", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["CompletionItem"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "Hover", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["Hover"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "CompletionList", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["CompletionList"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "ParameterInformation", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["ParameterInformation"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "MarkedString", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["MarkedString"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "SignatureInformation", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["SignatureInformation"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "Hover", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["Hover"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "DocumentHighlightKind", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["DocumentHighlightKind"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "ParameterInformation", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["ParameterInformation"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "DocumentHighlight", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["DocumentHighlight"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "SignatureInformation", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["SignatureInformation"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "SymbolKind", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["SymbolKind"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "DocumentHighlightKind", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["DocumentHighlightKind"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "SymbolInformation", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["SymbolInformation"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "DocumentHighlight", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["DocumentHighlight"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "DocumentSymbol", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["DocumentSymbol"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "SymbolKind", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["SymbolKind"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "CodeActionKind", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["CodeActionKind"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "SymbolTag", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["SymbolTag"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "CodeActionContext", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["CodeActionContext"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "SymbolInformation", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["SymbolInformation"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "CodeAction", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["CodeAction"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "DocumentSymbol", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["DocumentSymbol"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "CodeLens", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["CodeLens"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "CodeActionKind", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["CodeActionKind"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "FormattingOptions", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["FormattingOptions"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "CodeActionContext", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["CodeActionContext"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "DocumentLink", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["DocumentLink"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "CodeAction", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["CodeAction"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "EOL", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["EOL"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "CodeLens", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["CodeLens"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "TextDocument", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["TextDocument"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "FormattingOptions", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["FormattingOptions"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "TextDocumentSaveReason", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_14__["TextDocumentSaveReason"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "DocumentLink", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["DocumentLink"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "SelectionRange", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["SelectionRange"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "EOL", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["EOL"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "ClientCapabilities", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["ClientCapabilities"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "FileType", function() { return _cssLanguageTypes_js__WEBPACK_IMPORTED_MODULE_14__["FileType"]; }); /*--------------------------------------------------------------------------------------------- * Copyright (c) Microsoft Corporation. All rights reserved. @@ -8558,7 +9536,10 @@ __webpack_require__.r(__webpack_exports__); function createFacade(parser, completion, hover, navigation, codeActions, validation) { return { - configure: validation.configure.bind(validation), + configure: function (settings) { + validation.configure(settings); + completion.configure(settings); + }, doValidation: validation.doValidation.bind(validation), parseStylesheet: parser.parseStylesheet.bind(parser), doComplete: completion.doComplete.bind(completion), @@ -8568,6 +9549,7 @@ function createFacade(parser, completion, hover, navigation, codeActions, valida findReferences: navigation.findReferences.bind(navigation), findDocumentHighlights: navigation.findDocumentHighlights.bind(navigation), findDocumentLinks: navigation.findDocumentLinks.bind(navigation), + findDocumentLinks2: navigation.findDocumentLinks2.bind(navigation), findDocumentSymbols: navigation.findDocumentSymbols.bind(navigation), doCodeActions: codeActions.doCodeActions.bind(codeActions), doCodeActions2: codeActions.doCodeActions2.bind(codeActions), @@ -8586,15 +9568,15 @@ function handleCustomData(options) { } function getCSSLanguageService(options) { handleCustomData(options); - return createFacade(new _parser_cssParser_js__WEBPACK_IMPORTED_MODULE_0__["Parser"](), new _services_cssCompletion_js__WEBPACK_IMPORTED_MODULE_1__["CSSCompletion"](), new _services_cssHover_js__WEBPACK_IMPORTED_MODULE_2__["CSSHover"](), new _services_cssNavigation_js__WEBPACK_IMPORTED_MODULE_3__["CSSNavigation"](), new _services_cssCodeActions_js__WEBPACK_IMPORTED_MODULE_4__["CSSCodeActions"](), new _services_cssValidation_js__WEBPACK_IMPORTED_MODULE_5__["CSSValidation"]()); + return createFacade(new _parser_cssParser_js__WEBPACK_IMPORTED_MODULE_0__["Parser"](), new _services_cssCompletion_js__WEBPACK_IMPORTED_MODULE_1__["CSSCompletion"](null, options && options.clientCapabilities), new _services_cssHover_js__WEBPACK_IMPORTED_MODULE_2__["CSSHover"](options && options.clientCapabilities), new _services_cssNavigation_js__WEBPACK_IMPORTED_MODULE_3__["CSSNavigation"](), new _services_cssCodeActions_js__WEBPACK_IMPORTED_MODULE_4__["CSSCodeActions"](), new _services_cssValidation_js__WEBPACK_IMPORTED_MODULE_5__["CSSValidation"]()); } function getSCSSLanguageService(options) { handleCustomData(options); - return createFacade(new _parser_scssParser_js__WEBPACK_IMPORTED_MODULE_6__["SCSSParser"](), new _services_scssCompletion_js__WEBPACK_IMPORTED_MODULE_7__["SCSSCompletion"](), new _services_cssHover_js__WEBPACK_IMPORTED_MODULE_2__["CSSHover"](), new _services_cssNavigation_js__WEBPACK_IMPORTED_MODULE_3__["CSSNavigation"](), new _services_cssCodeActions_js__WEBPACK_IMPORTED_MODULE_4__["CSSCodeActions"](), new _services_cssValidation_js__WEBPACK_IMPORTED_MODULE_5__["CSSValidation"]()); + return createFacade(new _parser_scssParser_js__WEBPACK_IMPORTED_MODULE_6__["SCSSParser"](), new _services_scssCompletion_js__WEBPACK_IMPORTED_MODULE_7__["SCSSCompletion"](options && options.clientCapabilities), new _services_cssHover_js__WEBPACK_IMPORTED_MODULE_2__["CSSHover"](options && options.clientCapabilities), new _services_scssNavigation_js__WEBPACK_IMPORTED_MODULE_13__["SCSSNavigation"](options && options.fileSystemProvider), new _services_cssCodeActions_js__WEBPACK_IMPORTED_MODULE_4__["CSSCodeActions"](), new _services_cssValidation_js__WEBPACK_IMPORTED_MODULE_5__["CSSValidation"]()); } function getLESSLanguageService(options) { handleCustomData(options); - return createFacade(new _parser_lessParser_js__WEBPACK_IMPORTED_MODULE_8__["LESSParser"](), new _services_lessCompletion_js__WEBPACK_IMPORTED_MODULE_9__["LESSCompletion"](), new _services_cssHover_js__WEBPACK_IMPORTED_MODULE_2__["CSSHover"](), new _services_cssNavigation_js__WEBPACK_IMPORTED_MODULE_3__["CSSNavigation"](), new _services_cssCodeActions_js__WEBPACK_IMPORTED_MODULE_4__["CSSCodeActions"](), new _services_cssValidation_js__WEBPACK_IMPORTED_MODULE_5__["CSSValidation"]()); + return createFacade(new _parser_lessParser_js__WEBPACK_IMPORTED_MODULE_8__["LESSParser"](), new _services_lessCompletion_js__WEBPACK_IMPORTED_MODULE_9__["LESSCompletion"](options && options.clientCapabilities), new _services_cssHover_js__WEBPACK_IMPORTED_MODULE_2__["CSSHover"](options && options.clientCapabilities), new _services_cssNavigation_js__WEBPACK_IMPORTED_MODULE_3__["CSSNavigation"](), new _services_cssCodeActions_js__WEBPACK_IMPORTED_MODULE_4__["CSSCodeActions"](), new _services_cssValidation_js__WEBPACK_IMPORTED_MODULE_5__["CSSValidation"]()); } @@ -8604,18 +9586,114 @@ function getLESSLanguageService(options) { /*!*************************************************************************************************************!*\ !*** ./node_modules/monaco-editor/esm/vs/language/css/_deps/vscode-css-languageservice/cssLanguageTypes.js ***! \*************************************************************************************************************/ -/*! exports provided: Range, TextEdit, Position, SelectionRangeKind */ +/*! exports provided: TextDocument, Position, Range, Location, LocationLink, Color, ColorInformation, ColorPresentation, FoldingRangeKind, FoldingRange, DiagnosticRelatedInformation, DiagnosticSeverity, DiagnosticTag, Diagnostic, Command, TextEdit, TextDocumentEdit, CreateFile, RenameFile, DeleteFile, WorkspaceEdit, WorkspaceChange, TextDocumentIdentifier, VersionedTextDocumentIdentifier, TextDocumentItem, MarkupKind, MarkupContent, CompletionItemKind, InsertTextFormat, CompletionItemTag, CompletionItem, CompletionList, MarkedString, Hover, ParameterInformation, SignatureInformation, DocumentHighlightKind, DocumentHighlight, SymbolKind, SymbolTag, SymbolInformation, DocumentSymbol, CodeActionKind, CodeActionContext, CodeAction, CodeLens, FormattingOptions, DocumentLink, SelectionRange, EOL, ClientCapabilities, FileType */ /***/ (function(module, __webpack_exports__, __webpack_require__) { "use strict"; __webpack_require__.r(__webpack_exports__); -/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "SelectionRangeKind", function() { return SelectionRangeKind; }); -/* harmony import */ var _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../vscode-languageserver-types/main.js */ "./node_modules/monaco-editor/esm/vs/language/css/_deps/vscode-languageserver-types/main.js"); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "ClientCapabilities", function() { return ClientCapabilities; }); +/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "FileType", function() { return FileType; }); +/* harmony import */ var _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./../vscode-languageserver-types/main.js */ "./node_modules/monaco-editor/esm/vs/language/css/_deps/vscode-languageserver-types/main.js"); +/* harmony import */ var _deps_vscode_languageserver_textdocument_lib_esm_main_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./_deps/vscode-languageserver-textdocument/lib/esm/main.js */ "./node_modules/monaco-editor/esm/vs/language/css/_deps/vscode-css-languageservice/_deps/vscode-languageserver-textdocument/lib/esm/main.js"); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "TextDocument", function() { return _deps_vscode_languageserver_textdocument_lib_esm_main_js__WEBPACK_IMPORTED_MODULE_1__["TextDocument"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "Position", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["Position"]; }); + /* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "Range", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["Range"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "Location", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["Location"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "LocationLink", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["LocationLink"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "Color", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["Color"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "ColorInformation", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["ColorInformation"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "ColorPresentation", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["ColorPresentation"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "FoldingRangeKind", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["FoldingRangeKind"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "FoldingRange", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["FoldingRange"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "DiagnosticRelatedInformation", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["DiagnosticRelatedInformation"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "DiagnosticSeverity", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["DiagnosticSeverity"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "DiagnosticTag", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["DiagnosticTag"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "Diagnostic", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["Diagnostic"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "Command", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["Command"]; }); + /* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "TextEdit", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["TextEdit"]; }); -/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "Position", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["Position"]; }); +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "TextDocumentEdit", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["TextDocumentEdit"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "CreateFile", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["CreateFile"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "RenameFile", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["RenameFile"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "DeleteFile", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["DeleteFile"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "WorkspaceEdit", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["WorkspaceEdit"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "WorkspaceChange", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["WorkspaceChange"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "TextDocumentIdentifier", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["TextDocumentIdentifier"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "VersionedTextDocumentIdentifier", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["VersionedTextDocumentIdentifier"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "TextDocumentItem", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["TextDocumentItem"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "MarkupKind", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["MarkupKind"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "MarkupContent", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["MarkupContent"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "CompletionItemKind", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["CompletionItemKind"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "InsertTextFormat", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["InsertTextFormat"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "CompletionItemTag", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["CompletionItemTag"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "CompletionItem", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["CompletionItem"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "CompletionList", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["CompletionList"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "MarkedString", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["MarkedString"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "Hover", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["Hover"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "ParameterInformation", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["ParameterInformation"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "SignatureInformation", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["SignatureInformation"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "DocumentHighlightKind", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["DocumentHighlightKind"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "DocumentHighlight", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["DocumentHighlight"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "SymbolKind", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["SymbolKind"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "SymbolTag", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["SymbolTag"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "SymbolInformation", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["SymbolInformation"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "DocumentSymbol", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["DocumentSymbol"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "CodeActionKind", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["CodeActionKind"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "CodeActionContext", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["CodeActionContext"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "CodeAction", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["CodeAction"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "CodeLens", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["CodeLens"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "FormattingOptions", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["FormattingOptions"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "DocumentLink", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["DocumentLink"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "SelectionRange", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["SelectionRange"]; }); + +/* harmony reexport (safe) */ __webpack_require__.d(__webpack_exports__, "EOL", function() { return _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["EOL"]; }); /*--------------------------------------------------------------------------------------------- * Copyright (c) Microsoft Corporation. All rights reserved. @@ -8624,532 +9702,626 @@ __webpack_require__.r(__webpack_exports__); -// #region Proposed types, remove once added to vscode-languageserver-types -/** - * Enum of known selection range kinds - */ -var SelectionRangeKind; -(function (SelectionRangeKind) { + +var ClientCapabilities; +(function (ClientCapabilities) { + ClientCapabilities.LATEST = { + textDocument: { + completion: { + completionItem: { + documentationFormat: [_vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["MarkupKind"].Markdown, _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["MarkupKind"].PlainText] + } + }, + hover: { + contentFormat: [_vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["MarkupKind"].Markdown, _vscode_languageserver_types_main_js__WEBPACK_IMPORTED_MODULE_0__["MarkupKind"].PlainText] + } + } + }; +})(ClientCapabilities || (ClientCapabilities = {})); +var FileType; +(function (FileType) { /** - * Empty Kind. + * The file type is unknown. */ - SelectionRangeKind["Empty"] = ""; + FileType[FileType["Unknown"] = 0] = "Unknown"; /** - * The statment kind, its value is `statement`, possible extensions can be - * `statement.if` etc + * A regular file. */ - SelectionRangeKind["Statement"] = "statement"; + FileType[FileType["File"] = 1] = "File"; /** - * The declaration kind, its value is `declaration`, possible extensions can be - * `declaration.function`, `declaration.class` etc. + * A directory. */ - SelectionRangeKind["Declaration"] = "declaration"; -})(SelectionRangeKind || (SelectionRangeKind = {})); + FileType[FileType["Directory"] = 2] = "Directory"; + /** + * A symbolic link to a file. + */ + FileType[FileType["SymbolicLink"] = 64] = "SymbolicLink"; +})(FileType || (FileType = {})); /***/ }), -/***/ "./node_modules/monaco-editor/esm/vs/language/css/_deps/vscode-css-languageservice/data/browsers.js": -/*!**********************************************************************************************************!*\ - !*** ./node_modules/monaco-editor/esm/vs/language/css/_deps/vscode-css-languageservice/data/browsers.js ***! - \**********************************************************************************************************/ -/*! exports provided: cssData, descriptions */ +/***/ "./node_modules/monaco-editor/esm/vs/language/css/_deps/vscode-css-languageservice/data/webCustomData.js": +/*!***************************************************************************************************************!*\ + !*** ./node_modules/monaco-editor/esm/vs/language/css/_deps/vscode-css-languageservice/data/webCustomData.js ***! + \***************************************************************************************************************/ +/*! exports provided: cssData */ /***/ (function(module, __webpack_exports__, __webpack_require__) { "use strict"; __webpack_require__.r(__webpack_exports__); /* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "cssData", function() { return cssData; }); -/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "descriptions", function() { return descriptions; }); /*--------------------------------------------------------------------------------------------- * Copyright (c) Microsoft Corporation. All rights reserved. * Licensed under the MIT License. See License.txt in the project root for license information. *--------------------------------------------------------------------------------------------*/ -// file generated from css-schema.xml and https://github.com/mdn/data using build/generate_browserjs.js +// file generated from vscode-web-custom-data NPM package var cssData = { - "version": 1, + "version": 1.1, "properties": [ { - name: "additive-symbols", - browsers: [ - "FF33" - ], - "syntax": "[ && ]#", - "description": "@counter-style descriptor. Specifies the symbols used by the marker-construction algorithm specified by the system descriptor. Needs to be specified if the counter system is 'additive'.", - "restrictions": [ - "integer", - "string", - "image", - "identifier" - ] - }, - { - name: "align-content", - values: [ + "name": "width", + "values": [ { - name: "center", - "description": "Lines are packed toward the center of the flex container." + "name": "auto", + "description": "The width depends on the values of other properties." }, { - name: "flex-end", - "description": "Lines are packed toward the end of the flex container." + "name": "fit-content", + "description": "Use the fit-content inline size or fit-content block size, as appropriate to the writing mode." }, { - name: "flex-start", - "description": "Lines are packed toward the start of the flex container." + "name": "max-content", + "description": "Use the max-content inline size or max-content block size, as appropriate to the writing mode." }, { - name: "space-around", - "description": "Lines are evenly distributed in the flex container, with half-size spaces on either end." - }, - { - name: "space-between", - "description": "Lines are evenly distributed in the flex container." - }, - { - name: "stretch", - "description": "Lines stretch to take up the remaining space." + "name": "min-content", + "description": "Use the min-content inline size or min-content block size, as appropriate to the writing mode." } ], - "syntax": "normal | | | ? ", - "description": "Aligns a flex container’s lines within the flex container when there is extra space in the cross-axis, similar to how 'justify-content' aligns individual items within the main-axis.", - "restrictions": [ - "enum" - ] - }, - { - name: "align-items", - values: [ + "syntax": "{1,2}", + "references": [ { - name: "baseline", - "description": "If the flex item’s inline axis is the same as the cross axis, this value is identical to 'flex-start'. Otherwise, it participates in baseline alignment." - }, - { - name: "center", - "description": "The flex item’s margin box is centered in the cross axis within the line." - }, - { - name: "flex-end", - "description": "The cross-end margin edge of the flex item is placed flush with the cross-end edge of the line." - }, - { - name: "flex-start", - "description": "The cross-start margin edge of the flex item is placed flush with the cross-start edge of the line." - }, - { - name: "stretch", - "description": "If the cross size property of the flex item computes to auto, and neither of the cross-axis margins are auto, the flex item is stretched." + "name": "MDN Reference", + "url": "https://developer.mozilla.org/docs/Web/CSS/width" } ], - "syntax": "normal | stretch | | [ ? ]", - "description": "Aligns flex items along the cross axis of the current line of the flex container.", + "description": "Specifies the width of the content area, padding area or border area (depending on 'box-sizing') of certain boxes.", "restrictions": [ - "enum" + "length", + "percentage" ] }, { - name: "justify-items", - values: [ + "name": "height", + "values": [ { - name: "auto" + "name": "auto", + "description": "The height depends on the values of other properties." }, { - name: "normal" + "name": "fit-content", + "description": "Use the fit-content inline size or fit-content block size, as appropriate to the writing mode." }, { - name: "end" + "name": "max-content", + "description": "Use the max-content inline size or max-content block size, as appropriate to the writing mode." }, { - name: "start" - }, - { - name: "flex-end", - "description": "\"Flex items are packed toward the end of the line.\"" - }, - { - name: "flex-start", - "description": "\"Flex items are packed toward the start of the line.\"" - }, - { - name: "self-end" - }, - { - name: "self-start" - }, - { - name: "center", - "description": "The items are packed flush to each other toward the center of the of the alignment container." - }, - { - name: "left" - }, - { - name: "right" - }, - { - name: "baseline" - }, - { - name: "first baseline" - }, - { - name: "last baseline" - }, - { - name: "stretch", - "description": "If the cross size property of the flex item computes to auto, and neither of the cross-axis margins are auto, the flex item is stretched." - }, - { - name: "save" - }, - { - name: "unsave" - }, - { - name: "legacy" + "name": "min-content", + "description": "Use the min-content inline size or min-content block size, as appropriate to the writing mode." } ], - "syntax": "normal | stretch | | ? [ | left | right ] | legacy | legacy && [ left | right | center ]", - "description": "Defines the default justify-self for all items of the box, giving them the default way of justifying each box along the appropriate axis", - "restrictions": [ - "enum" - ] - }, - { - name: "justify-self", - browsers: [ - "E16", - "FF45", - "S10.1", - "C57", - "O44" - ], - values: [ + "syntax": "{1,2}", + "references": [ { - name: "auto" - }, - { - name: "normal" - }, - { - name: "end" - }, - { - name: "start" - }, - { - name: "flex-end", - "description": "\"Flex items are packed toward the end of the line.\"" - }, - { - name: "flex-start", - "description": "\"Flex items are packed toward the start of the line.\"" - }, - { - name: "self-end" - }, - { - name: "self-start" - }, - { - name: "center", - "description": "The items are packed flush to each other toward the center of the of the alignment container." - }, - { - name: "left" - }, - { - name: "right" - }, - { - name: "baseline" - }, - { - name: "first baseline" - }, - { - name: "last baseline" - }, - { - name: "stretch", - "description": "If the cross size property of the flex item computes to auto, and neither of the cross-axis margins are auto, the flex item is stretched." - }, - { - name: "save" - }, - { - name: "unsave" + "name": "MDN Reference", + "url": "https://developer.mozilla.org/docs/Web/CSS/height" } ], - "syntax": "auto | normal | stretch | | ? [ | left | right ]", - "description": "Defines the way of justifying a box inside its container along the appropriate axis.", + "description": "Specifies the height of the content area, padding area or border area (depending on 'box-sizing') of certain boxes.", "restrictions": [ - "enum" + "length", + "percentage" ] }, { - name: "align-self", - values: [ + "name": "display", + "values": [ { - name: "auto", - "description": "Computes to the value of 'align-items' on the element’s parent, or 'stretch' if the element has no parent. On absolutely positioned elements, it computes to itself." + "name": "block", + "description": "The element generates a block-level box" }, { - name: "baseline", - "description": "If the flex item’s inline axis is the same as the cross axis, this value is identical to 'flex-start'. Otherwise, it participates in baseline alignment." + "name": "contents", + "description": "The element itself does not generate any boxes, but its children and pseudo-elements still generate boxes as normal." }, { - name: "center", - "description": "The flex item’s margin box is centered in the cross axis within the line." + "name": "flex", + "description": "The element generates a principal flex container box and establishes a flex formatting context." }, { - name: "flex-end", - "description": "The cross-end margin edge of the flex item is placed flush with the cross-end edge of the line." + "name": "flexbox", + "description": "The element lays out its contents using flow layout (block-and-inline layout). Standardized as 'flex'." }, { - name: "flex-start", - "description": "The cross-start margin edge of the flex item is placed flush with the cross-start edge of the line." + "name": "flow-root", + "description": "The element generates a block container box, and lays out its contents using flow layout." }, { - name: "stretch", - "description": "If the cross size property of the flex item computes to auto, and neither of the cross-axis margins are auto, the flex item is stretched." + "name": "grid", + "description": "The element generates a principal grid container box, and establishes a grid formatting context." + }, + { + "name": "inline", + "description": "The element generates an inline-level box." + }, + { + "name": "inline-block", + "description": "A block box, which itself is flowed as a single inline box, similar to a replaced element. The inside of an inline-block is formatted as a block box, and the box itself is formatted as an inline box." + }, + { + "name": "inline-flex", + "description": "Inline-level flex container." + }, + { + "name": "inline-flexbox", + "description": "Inline-level flex container. Standardized as 'inline-flex'" + }, + { + "name": "inline-table", + "description": "Inline-level table wrapper box containing table box." + }, + { + "name": "list-item", + "description": "One or more block boxes and one marker box." + }, + { + "name": "-moz-box", + "description": "The element lays out its contents using flow layout (block-and-inline layout). Standardized as 'flex'." + }, + { + "name": "-moz-deck" + }, + { + "name": "-moz-grid" + }, + { + "name": "-moz-grid-group" + }, + { + "name": "-moz-grid-line" + }, + { + "name": "-moz-groupbox" + }, + { + "name": "-moz-inline-box", + "description": "Inline-level flex container. Standardized as 'inline-flex'" + }, + { + "name": "-moz-inline-grid" + }, + { + "name": "-moz-inline-stack" + }, + { + "name": "-moz-marker" + }, + { + "name": "-moz-popup" + }, + { + "name": "-moz-stack" + }, + { + "name": "-ms-flexbox", + "description": "The element lays out its contents using flow layout (block-and-inline layout). Standardized as 'flex'." + }, + { + "name": "-ms-grid", + "description": "The element generates a principal grid container box, and establishes a grid formatting context." + }, + { + "name": "-ms-inline-flexbox", + "description": "Inline-level flex container. Standardized as 'inline-flex'" + }, + { + "name": "-ms-inline-grid", + "description": "Inline-level grid container." + }, + { + "name": "none", + "description": "The element and its descendants generates no boxes." + }, + { + "name": "ruby", + "description": "The element generates a principal ruby container box, and establishes a ruby formatting context." + }, + { + "name": "ruby-base" + }, + { + "name": "ruby-base-container" + }, + { + "name": "ruby-text" + }, + { + "name": "ruby-text-container" + }, + { + "name": "run-in", + "description": "The element generates a run-in box. Run-in elements act like inlines or blocks, depending on the surrounding elements." + }, + { + "name": "table", + "description": "The element generates a principal table wrapper box containing an additionally-generated table box, and establishes a table formatting context." + }, + { + "name": "table-caption" + }, + { + "name": "table-cell" + }, + { + "name": "table-column" + }, + { + "name": "table-column-group" + }, + { + "name": "table-footer-group" + }, + { + "name": "table-header-group" + }, + { + "name": "table-row" + }, + { + "name": "table-row-group" + }, + { + "name": "-webkit-box", + "description": "The element lays out its contents using flow layout (block-and-inline layout). Standardized as 'flex'." + }, + { + "name": "-webkit-flex", + "description": "The element lays out its contents using flow layout (block-and-inline layout)." + }, + { + "name": "-webkit-inline-box", + "description": "Inline-level flex container. Standardized as 'inline-flex'" + }, + { + "name": "-webkit-inline-flex", + "description": "Inline-level flex container." } ], - "syntax": "auto | normal | stretch | | ? ", - "description": "Allows the default alignment along the cross axis to be overridden for individual flex items.", - "restrictions": [ - "enum" - ] - }, - { - name: "all", - browsers: [ - "FF27", - "S9.1", - "C37", - "O24" - ], - values: [], - "syntax": "initial | inherit | unset | revert", - "description": "Shorthand that resets all properties except 'direction' and 'unicode-bidi'.", - "restrictions": [ - "enum" - ] - }, - { - name: "alt", - browsers: [ - "S9" - ], - values: [], - "description": "Provides alternative text for assistive technology to replace the generated content of a ::before or ::after element.", - "restrictions": [ - "string", - "enum" - ] - }, - { - name: "animation", - values: [ + "syntax": "[ || ] | | | | ", + "references": [ { - name: "alternate" - }, - { - name: "alternate-reverse" - }, - { - name: "backwards" - }, - { - name: "both", - "description": "Both forwards and backwards fill modes are applied." - }, - { - name: "forwards" - }, - { - name: "infinite", - "description": "Causes the animation to repeat forever." - }, - { - name: "none", - "description": "No animation is performed" - }, - { - name: "normal", - "description": "Normal playback." - }, - { - name: "reverse", - "description": "All iterations of the animation are played in the reverse direction from the way they were specified." + "name": "MDN Reference", + "url": "https://developer.mozilla.org/docs/Web/CSS/display" } ], - "syntax": "#", - "description": "Shorthand property combines six of the animation properties into a single property.", - "restrictions": [ - "time", - "timing-function", - "enum", - "identifier", - "number" - ] - }, - { - name: "animation-delay", - "syntax": "